[ { "user_id": "u057109575", "problem_id": "p02580", "submission1_id": "s918237454", "submission2_id": "s683361436", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict\n\nH, W, M = map(int, input().split())\nX = [list(map(int, input().split())) for _ in range(M)]\n\nctr_h = defaultdict(list)\nctr_w = defaultdict(list)\n\nfor h, w in X:\n ctr_h[h].append((h, w))\n ctr_w[w].append((h, w))\n\nval_h = sorted(ctr_h.items(), key=lambda x: -len(x[1]))\nval_w = sorted(ctr_w.items(), key=lambda x: -len(x[1]))\n\nmax_h = len(val_h[0][1])\nmax_w = len(val_w[0][1])\n\nif (len(val_h) > 1 and len(val_h[1][1]) == max_h\n and len(val_w) > 1 and len(val_w[1][1]) == max_w):\n print(max_h + max_w)\nelse:\n h = val_h[0][0]\n w = val_w[0][0]\n for u, v in X:\n if u == h and v == w:\n print(max_h + max_w - 1)\n break\n else:\n print(max_h + max_w)\n", "code2": "\nimport sys\nfrom collections import defaultdict\n\nH, W, M = map(int, input().split())\nX = [list(map(int, input().split())) for _ in range(M)]\n\nctr_h = defaultdict(int)\nctr_w = defaultdict(int)\nappeared = set()\n\nfor h, w in X:\n ctr_h[h] += 1\n ctr_w[w] += 1\n appeared.add(h * W + w)\n\nval_h = sorted(ctr_h.items(), key=lambda x: -x[1])\nval_w = sorted(ctr_w.items(), key=lambda x: -x[1])\n\nmax_h = val_h[0][1]\nmax_w = val_w[0][1]\n\nval_h = [i for i, v in val_h if v == max_h]\nval_w = [i for i, v in val_w if v == max_w]\n\nif len(val_h) * len(val_w) > M:\n print(max_h + max_w)\n sys.exit(0)\n\nfor h in val_h:\n for w in val_w:\n if h * W + w not in appeared:\n print(max_h + max_w)\n sys.exit(0)\nelse:\n print(max_h + max_w - 1)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598128653", "date2": "1598129828", "bleu_score": "0.767282211511788", "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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 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], "code1_test_score": 93, "total_score": 103, "input": "5 5 10\n2 5\n4 5\n2 3\n1 5\n2 4\n5 4\n5 1\n5 1\n4 5\n1 4\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": ["\nfrom collections import defaultdict\n\nH, W, M = map(int, input().split()) # (0): H=5, W=5, M=10\nX = [list(map(int, input().split())) for _ in range(M)] # (1): X\n\nctr_h = defaultdict(list) # (2): ctr_h=defaultdict(, {})\nctr_w = defaultdict(list) # (3): ctr_w=defaultdict(, {})\n\nfor h, w in X: # (4): h=2, w=5 (7): h=4 ... (34): NO CHANGE\n ctr_h[h].append((h, w)) # (5): ctr_h=defaultdict(, {2: [(2, 5)]}) (8): ctr_h=defaultdict(, {2: [(2, 5)], 4: [(4, 5)]}) ... (32): ctr_h=defaultdict(, {2: [(2, 5), (2, 3), (2, 4)], 4: [(4, 5), (4, 5)], 1: [(1, 5), (1, 4)], 5: [(5, 4), (5, 1), (5, 1)]})\n ctr_w[w].append((h, w)) # (6): ctr_w=defaultdict(, {5: [(2, 5)]}) (9): ctr_w=defaultdict(, {5: [(2, 5), (4, 5)]}) ... (33): ctr_w=defaultdict(, {5: [(2, 5), (4, 5), (1, 5), (4, 5)], 3: [(2, 3)], 4: [(2, 4), (5, 4), (1, 4)], 1: [(5, 1), (5, 1)]})\n\nval_h = sorted(ctr_h.items(), key=lambda x: -len(x[1])) # (35): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])]\nval_w = sorted(ctr_w.items(), key=lambda x: -len(x[1])) # (36): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])]\n\nmax_h = len(val_h[0][1]) # (37): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])], max_h=3\nmax_w = len(val_w[0][1]) # (38): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])], max_w=4\n\nif (len(val_h) > 1 and len(val_h[1][1]) == max_h # (39): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])]\n and len(val_w) > 1 and len(val_w[1][1]) == max_w): # (40): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])]\n print(max_h + max_w)\nelse:\n h = val_h[0][0] # (41): h=2, val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])]\n w = val_w[0][0] # (42): w=5, val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])]\n for u, v in X: # (43): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])], u=2, v=5\n if u == h and v == w: # (44): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])]\n print(max_h + max_w - 1) # (45): val_h=[(2, [(2, 5), (2, 3), (2, 4)]), (5, [(5, 4), (5, 1), (5, 1)]), (4, [(4, 5), (4, 5)]), (1, [(1, 5), (1, 4)])], val_w=[(5, [(2, 5), (4, 5), (1, 5), (4, 5)]), (4, [(2, 4), (5, 4), (1, 4)]), (1, [(5, 1), (5, 1)]), (3, [(2, 3)])]\n break\n else:\n print(max_h + max_w)\n"], "anno_status": [false], "diff_content": " \n+import sys\n from collections import defaultdict\n \n H, W, M = map(int, input().split())\n X = [list(map(int, input().split())) for _ in range(M)]\n \n-ctr_h = defaultdict(list)\n-ctr_w = defaultdict(list)\n+ctr_h = defaultdict(int)\n+ctr_w = defaultdict(int)\n+appeared = set()\n \n for h, w in X:\n- ctr_h[h].append((h, w))\n- ctr_w[w].append((h, w))\n+ ctr_h[h] += 1\n+ ctr_w[w] += 1\n+ appeared.add(h * W + w)\n \n-val_h = sorted(ctr_h.items(), key=lambda x: -len(x[1]))\n-val_w = sorted(ctr_w.items(), key=lambda x: -len(x[1]))\n+val_h = sorted(ctr_h.items(), key=lambda x: -x[1])\n+val_w = sorted(ctr_w.items(), key=lambda x: -x[1])\n \n-max_h = len(val_h[0][1])\n-max_w = len(val_w[0][1])\n+max_h = val_h[0][1]\n+max_w = val_w[0][1]\n \n-if (len(val_h) > 1 and len(val_h[1][1]) == max_h\n- and len(val_w) > 1 and len(val_w[1][1]) == max_w):\n+val_h = [i for i, v in val_h if v == max_h]\n+val_w = [i for i, v in val_w if v == max_w]\n+\n+if len(val_h) * len(val_w) > M:\n print(max_h + max_w)\n+ sys.exit(0)\n+\n+for h in val_h:\n+ for w in val_w:\n+ if h * W + w not in appeared:\n+ print(max_h + max_w)\n+ sys.exit(0)\n else:\n- h = val_h[0][0]\n- w = val_w[0][0]\n- for u, v in X:\n- if u == h and v == w:\n- print(max_h + max_w - 1)\n- break\n- else:\n- print(max_h + max_w)\n+ print(max_h + max_w - 1)\n \n", "FL_content": " \n from collections import defaultdict\n \n H, W, M = map(int, input().split())\n X = [list(map(int, input().split())) for _ in range(M)]\n \n-ctr_h = defaultdict(list)\n-ctr_w = defaultdict(list)\n \n for h, w in X:\n- ctr_h[h].append((h, w))\n- ctr_w[w].append((h, w))\n \n-val_h = sorted(ctr_h.items(), key=lambda x: -len(x[1]))\n-val_w = sorted(ctr_w.items(), key=lambda x: -len(x[1]))\n \n-max_h = len(val_h[0][1])\n-max_w = len(val_w[0][1])\n \n-if (len(val_h) > 1 and len(val_h[1][1]) == max_h\n- and len(val_w) > 1 and len(val_w[1][1]) == max_w):\n print(max_h + max_w)\n else:\n- h = val_h[0][0]\n- w = val_w[0][0]\n- for u, v in X:\n- if u == h and v == w:\n- print(max_h + max_w - 1)\n- break\n- else:\n- print(max_h + max_w)\n \n", "added_lines": 23, "removed_lines": 18, "code1_lines": 32 }, { "user_id": "u941753895", "problem_id": "p02580", "submission1_id": "s968887474", "submission2_id": "s914378147", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n H,W,M=LI()\n h=[0]*H\n w=[0]*W\n lh=[]\n lw=[]\n d={}\n for _ in range(M):\n a,b=LI()\n lh.append(a)\n lw.append(b)\n a-=1\n b-=1\n h[a]+=1\n w[b]+=1\n d[(a,b)]=1\n\n h_koho=[]\n w_koho=[]\n\n h_max=max(h)\n w_max=max(w)\n\n for i,x in enumerate(h):\n if x==h_max:\n h_koho.append(x)\n for i,x in enumerate(w):\n if x==w_max:\n w_koho.append(x)\n\n for x in h_koho:\n for y in w_koho:\n if (x,y) not in d:\n return h_max+w_max\n\n return h_max+w_max-1\n\n\nprint(main())\n", "code2": "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n H,W,M=LI()\n h=[0]*H\n w=[0]*W\n d={}\n for _ in range(M):\n a,b=LI()\n a-=1\n b-=1\n h[a]+=1\n w[b]+=1\n d[(a,b)]=1\n\n h_koho=[]\n w_koho=[]\n\n h_max=max(h)\n w_max=max(w)\n\n for i,x in enumerate(h):\n if x==h_max:\n h_koho.append(i)\n for i,x in enumerate(w):\n if x==w_max:\n w_koho.append(i)\n\n for x in h_koho:\n for y in w_koho:\n if (x,y) not in d:\n return h_max+w_max\n\n return h_max+w_max-1\n\n\nprint(main())\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598317127", "date2": "1598319354", "bleu_score": "0.9410706356956637", "code1_test_status": [0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 103, "input": "5 5 10\n2 5\n4 5\n2 1\n3 5\n2 2\n5 4\n5 1\n5 1\n3 5\n1 4\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": ["import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\ninf=10**20 # (1): inf=100000000000000000000\nmod=10**9+7 # (2): mod=1000000007\ndd=[(-1,0),(0,1),(1,0),(0,-1)] # (3): dd=[(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)] # (4): ddn=[(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)], LI=, I=, F=, LS=, S=\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main(): # (5): main=\n H,W,M=LI() # (7): H=5, W=5, M=10\n h=[0]*H # (8): h=[0, 0, 0, 0, 0]\n w=[0]*W # (9): w=[0, 0, 0, 0, 0]\n lh=[] # (10): lh=[]\n lw=[] # (11): lw=[]\n d={} # (12): d={}\n for _ in range(M): # (13): _=0 (22): _=1 ... (103): NO CHANGE\n a,b=LI() # (14): a=2, b=5 (23): a=4, b=5 ... (95): a=1\n lh.append(a) # (15): lh=[2] (24): lh=[2, 4] ... (96): lh=[2, 4, 2, 3, 2, 5, 5, 5, 3, 1]\n lw.append(b) # (16): lw=[5] (25): lw=[5, 5] ... (97): lw=[5, 5, 1, 5, 2, 4, 1, 1, 5, 4]\n a-=1 # (17): a=1 (26): a=3 ... (98): a=0\n b-=1 # (18): b=4 (27): b=4 ... (99): b=3\n h[a]+=1 # (19): h=[0, 1, 0, 0, 0] (28): h=[0, 1, 0, 1, 0] ... (100): h=[1, 3, 2, 1, 3]\n w[b]+=1 # (20): w=[0, 0, 0, 0, 1] (29): w=[0, 0, 0, 0, 2] ... (101): w=[3, 1, 0, 2, 4]\n d[(a,b)]=1 # (21): d={(1, 4): 1} (30): d={(1, 4): 1, (3, 4): 1} ... (102): d={(1, 4): 1, (3, 4): 1, (1, 0): 1, (2, 4): 1, (1, 1): 1, (4, 3): 1, (4, 0): 1, (0, 3): 1}\n\n h_koho=[] # (104): h_koho=[]\n w_koho=[] # (105): w_koho=[]\n\n h_max=max(h) # (106): h_max=3\n w_max=max(w) # (107): w_max=4\n\n for i,x in enumerate(h): # (108): i=0, x=1 (110): i=1, x=3 ... (120): NO CHANGE\n if x==h_max: # (109): NO CHANGE (111): NO CHANGE ... (118): NO CHANGE\n h_koho.append(x) # (112): h_koho=[3] (119): h_koho=[3, 3]\n for i,x in enumerate(w): # (121): i=0 (123): i=1, x=1 ... (132): NO CHANGE\n if x==w_max: # (122): NO CHANGE (124): NO CHANGE ... (130): NO CHANGE\n w_koho.append(x) # (131): w_koho=[4]\n\n for x in h_koho: # (133): x=3 (137): NO CHANGE\n for y in w_koho: # (134): y=4 (136): NO CHANGE ... (140): NO CHANGE\n if (x,y) not in d: # (135): NO CHANGE (139): NO CHANGE\n return h_max+w_max\n\n return h_max+w_max-1\n\n\nprint(main()) # (6): NO CHANGE\n"], "anno_status": [false], "diff_content": " import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n \n sys.setrecursionlimit(10**7)\n inf=10**20\n mod=10**9+7\n dd=[(-1,0),(0,1),(1,0),(0,-1)]\n ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n \n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n \n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def LS(): return sys.stdin.readline().split()\n def S(): return input()\n \n def main():\n H,W,M=LI()\n h=[0]*H\n w=[0]*W\n- lh=[]\n- lw=[]\n d={}\n for _ in range(M):\n a,b=LI()\n- lh.append(a)\n- lw.append(b)\n a-=1\n b-=1\n h[a]+=1\n w[b]+=1\n d[(a,b)]=1\n \n h_koho=[]\n w_koho=[]\n \n h_max=max(h)\n w_max=max(w)\n \n for i,x in enumerate(h):\n if x==h_max:\n- h_koho.append(x)\n+ h_koho.append(i)\n for i,x in enumerate(w):\n if x==w_max:\n- w_koho.append(x)\n+ w_koho.append(i)\n \n for x in h_koho:\n for y in w_koho:\n if (x,y) not in d:\n return h_max+w_max\n \n return h_max+w_max-1\n \n \n print(main())\n \n", "FL_content": " import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n \n sys.setrecursionlimit(10**7)\n inf=10**20\n mod=10**9+7\n dd=[(-1,0),(0,1),(1,0),(0,-1)]\n ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n \n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n \n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def LS(): return sys.stdin.readline().split()\n def S(): return input()\n \n def main():\n H,W,M=LI()\n h=[0]*H\n w=[0]*W\n- lh=[]\n- lw=[]\n d={}\n for _ in range(M):\n a,b=LI()\n- lh.append(a)\n- lw.append(b)\n a-=1\n b-=1\n h[a]+=1\n w[b]+=1\n d[(a,b)]=1\n \n h_koho=[]\n w_koho=[]\n \n h_max=max(h)\n w_max=max(w)\n \n for i,x in enumerate(h):\n if x==h_max:\n- h_koho.append(x)\n for i,x in enumerate(w):\n if x==w_max:\n- w_koho.append(x)\n \n for x in h_koho:\n for y in w_koho:\n if (x,y) not in d:\n return h_max+w_max\n \n return h_max+w_max-1\n \n \n print(main())\n \n", "added_lines": 2, "removed_lines": 6, "code1_lines": 55 }, { "user_id": "u156815136", "problem_id": "p02580", "submission1_id": "s472949111", "submission2_id": "s078722748", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nfrom math import gcd\nfrom itertools import combinations,permutations,accumulate, product \n\nfrom collections import deque,defaultdict,Counter\nimport decimal\nimport re\nimport math\nimport bisect\nimport heapq\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nimport sys\nsys.setrecursionlimit(10000000)\nmod = 10**9 + 7\n\n\nINF = float('inf')\nfrom sys import stdin\nreadline = stdin.readline\ndef readInts():\n return list(map(int,readline().split()))\ndef readTuples():\n return tuple(map(int,readline().split()))\ndef I():\n return int(readline())\nH,W,M = readInts()\n\ndic1 = defaultdict(int)\ndic2 = defaultdict(int)\ns = set()\nfor i in range(M):\n h,w = map(lambda x:int(x)-1, input().split())\n dic1[h] += 1\n dic2[w] += 1\n s.add((h,w))\n\n\nans = 0\n\n\n\n\n\n\nfor h,w in s:\n ans = max(ans, dic1[h] + dic2[w] - 1)\n\nmax1 = max(dic1, key = dic1.get)\nmax2 = max(dic2, key = dic2.get)\nif (max1,max2) in s:\n pass\nelse:\n ans = max(ans, dic1[max1] + dic2[max2])\nprint(ans)\n", "code2": "\n\n\nfrom math import gcd\nfrom itertools import combinations,permutations,accumulate, product \n\nfrom collections import deque,defaultdict,Counter\nimport decimal\nimport re\nimport math\nimport bisect\nimport heapq\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nimport sys\nsys.setrecursionlimit(10000000)\nmod = 10**9 + 7\n\n\nINF = float('inf')\nfrom sys import stdin\nreadline = stdin.readline\ndef readInts():\n return list(map(int,readline().split()))\ndef readTuples():\n return tuple(map(int,readline().split()))\ndef I():\n return int(readline())\nH,W,M = readInts()\n\ndic1 = Counter()\ndic2 = Counter()\ns = set()\nfor i in range(M):\n h,w = map(lambda x:int(x)-1, input().split())\n dic1[h] += 1\n dic2[w] += 1\n s.add((h,w))\n\nans = 0\n\n\n\nfor h,w in s:\n ans = max(ans, dic1[h] + dic2[w] - 1)\n\ndic1 = dic1.most_common()\ndic2 = dic2.most_common()\nmax1 = dic1[0][1]\nmax2 = dic2[0][1]\n\nfor k1,v1 in dic1:\n if v1 < max1:\n break \n for k2,v2 in dic2:\n if v2 < max2:\n break \n if (k1,k2) in s: \n continue\n \n ans = max(ans, v1 + v2)\n break\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600154905", "date2": "1600157517", "bleu_score": "0.7900553049310771", "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, 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, 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, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 103, "input": "5 7 10\n1 5\n4 5\n2 2\n5 5\n1 2\n5 4\n5 4\n5 1\n4 3\n2 2\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": [" # (0): gcd=, combinations=, permutations=, accumulate=, product=, deque=, defaultdict=, Counter=, decimal=, re=, math=, bisect=, heapq=, sys=\n\n\nfrom math import gcd\nfrom itertools import combinations,permutations,accumulate, product \n\nfrom collections import deque,defaultdict,Counter\nimport decimal\nimport re\nimport math\nimport bisect\nimport heapq\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nimport sys\nsys.setrecursionlimit(10000000) # (1): NO CHANGE\nmod = 10**9 + 7 # (2): mod=1000000007\n\n\nINF = float('inf') # (3): INF=inf, stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p02580\\\\input_s472949111.txt' mode='r' encoding='utf-8'>\nfrom sys import stdin\nreadline = stdin.readline # (4): readline=\ndef readInts(): # (5): readInts=\n return list(map(int,readline().split()))\ndef readTuples(): # (6): readTuples=\n return tuple(map(int,readline().split()))\ndef I(): # (7): I=\n return int(readline())\nH,W,M = readInts() # (8): H=5, W=7, M=10\n\ndic1 = defaultdict(int) # (9): dic1=defaultdict(, {})\ndic2 = defaultdict(int) # (10): dic2=defaultdict(, {})\ns = set() # (11): s=set()\nfor i in range(M): # (12): i=0 (17): i=1 ... (62): NO CHANGE\n h,w = map(lambda x:int(x)-1, input().split()) # (13): h=0, w=4 (18): h=3 ... (58): h=1, w=1\n dic1[h] += 1 # (14): dic1=defaultdict(, {0: 1}) (19): dic1=defaultdict(, {0: 1, 3: 1}) ... (59): dic1=defaultdict(, {0: 2, 3: 2, 1: 2, 4: 4})\n dic2[w] += 1 # (15): dic2=defaultdict(, {4: 1}) (20): dic2=defaultdict(, {4: 2}) ... (60): dic2=defaultdict(, {4: 3, 1: 3, 3: 2, 0: 1, 2: 1})\n s.add((h,w)) # (16): s={(0, 4)} (21): s={(0, 4), (3, 4)} ... (61): NO CHANGE\n\n\nans = 0 # (63): ans=0\n\n\n\n\n\n\nfor h,w in s: # (64): h=4, w=4 (66): h=0, w=1 ... (80): NO CHANGE\n ans = max(ans, dic1[h] + dic2[w] - 1) # (65): ans=6 (67): NO CHANGE ... (79): NO CHANGE\n\nmax1 = max(dic1, key = dic1.get) # (81): max1=4\nmax2 = max(dic2, key = dic2.get) # (82): max2=4\nif (max1,max2) in s: # (83): NO CHANGE\n pass # (84): NO CHANGE\nelse:\n ans = max(ans, dic1[max1] + dic2[max2])\nprint(ans)\n"], "anno_status": [false], "diff_content": " \n \n \n from math import gcd\n from itertools import combinations,permutations,accumulate, product \n \n from collections import deque,defaultdict,Counter\n import decimal\n import re\n import math\n import bisect\n import heapq\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n import sys\n sys.setrecursionlimit(10000000)\n mod = 10**9 + 7\n \n \n INF = float('inf')\n from sys import stdin\n readline = stdin.readline\n def readInts():\n return list(map(int,readline().split()))\n def readTuples():\n return tuple(map(int,readline().split()))\n def I():\n return int(readline())\n H,W,M = readInts()\n \n-dic1 = defaultdict(int)\n-dic2 = defaultdict(int)\n+dic1 = Counter()\n+dic2 = Counter()\n s = set()\n for i in range(M):\n h,w = map(lambda x:int(x)-1, input().split())\n dic1[h] += 1\n dic2[w] += 1\n s.add((h,w))\n \n-\n ans = 0\n \n \n \n-\n-\n-\n for h,w in s:\n ans = max(ans, dic1[h] + dic2[w] - 1)\n \n-max1 = max(dic1, key = dic1.get)\n-max2 = max(dic2, key = dic2.get)\n-if (max1,max2) in s:\n- pass\n-else:\n- ans = max(ans, dic1[max1] + dic2[max2])\n+dic1 = dic1.most_common()\n+dic2 = dic2.most_common()\n+max1 = dic1[0][1]\n+max2 = dic2[0][1]\n+\n+for k1,v1 in dic1:\n+ if v1 < max1:\n+ break \n+ for k2,v2 in dic2:\n+ if v2 < max2:\n+ break \n+ if (k1,k2) in s: \n+ continue\n+ \n+ ans = max(ans, v1 + v2)\n+ break\n print(ans)\n \n", "FL_content": " \n \n \n from math import gcd\n from itertools import combinations,permutations,accumulate, product \n \n from collections import deque,defaultdict,Counter\n import decimal\n import re\n import math\n import bisect\n import heapq\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n import sys\n sys.setrecursionlimit(10000000)\n mod = 10**9 + 7\n \n \n INF = float('inf')\n from sys import stdin\n readline = stdin.readline\n def readInts():\n return list(map(int,readline().split()))\n def readTuples():\n return tuple(map(int,readline().split()))\n def I():\n return int(readline())\n H,W,M = readInts()\n \n-dic1 = defaultdict(int)\n-dic2 = defaultdict(int)\n s = set()\n for i in range(M):\n h,w = map(lambda x:int(x)-1, input().split())\n dic1[h] += 1\n dic2[w] += 1\n s.add((h,w))\n \n-\n ans = 0\n \n \n \n-\n-\n-\n for h,w in s:\n ans = max(ans, dic1[h] + dic2[w] - 1)\n \n-max1 = max(dic1, key = dic1.get)\n-max2 = max(dic2, key = dic2.get)\n-if (max1,max2) in s:\n- pass\n-else:\n- ans = max(ans, dic1[max1] + dic2[max2])\n print(ans)\n \n", "added_lines": 18, "removed_lines": 12, "code1_lines": 70 }, { "user_id": "u344655022", "problem_id": "p02580", "submission1_id": "s945708732", "submission2_id": "s965357485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nfrom collections import defaultdict\n\ndef li():\n return [int(x) for x in input().split()]\n\nH, W, M = li()\nPH = []\nPW = []\n\nfor i in range(M):\n h, w = li()\n PH.append(h)\n PW.append(w)\n\nfrequency_h_list = Counter(PH).most_common()\nfrequency_w_list = Counter(PW).most_common()\nmost_common_h_cnt = frequency_h_list[0][1]\nmost_common_w_cnt = frequency_w_list[0][1]\n\nmost_common_h_list = []\nfor x in frequency_h_list:\n if x[1] < most_common_h_cnt:\n break\n most_common_h_list.append(x[0])\n\nmost_common_w_list = []\nfor x in frequency_w_list:\n if x[1] < most_common_w_cnt:\n break\n most_common_w_list.append(x[0])\n\ncontain_intersection = {}\nfor h in most_common_h_list:\n for w in most_common_w_list:\n contain_intersection[h, w] = False\n\nadd = 0\n\nfor i in range(M):\n h, w = PH[i], PW[i]\n if h not in most_common_h_list and w not in most_common_w_list:\n continue\n if (h, w) not in contain_intersection:\n add = -1\n break\ncnt = most_common_h_cnt + most_common_w_cnt + add\n\nprint(cnt)", "code2": "from collections import Counter\nfrom collections import defaultdict\n\ndef li():\n return [int(x) for x in input().split()]\n\nH, W, M = li()\nPH = []\nPW = []\nPHF = defaultdict(int)\nPWF = defaultdict(int)\nPF = defaultdict(int)\n\nfor i in range(M):\n h, w = li()\n PH.append(h)\n PW.append(w)\n PHF[h] += 1\n PWF[w] += 1\n PF[h, w] += 1\n\nsorted_PHF = sorted(PHF.items(), key=lambda x: x[1], reverse=True)\nsorted_PWF = sorted(PWF.items(), key=lambda x: x[1], reverse=True)\nmost_common_h_cnt = sorted_PHF[0][1]\nmost_common_w_cnt = sorted_PWF[0][1]\n\nmost_common_h_list = []\nfor x in sorted_PHF:\n if x[1] < most_common_h_cnt:\n break\n most_common_h_list.append(x[0])\n\nmost_common_w_list = []\nfor x in sorted_PWF:\n if x[1] < most_common_w_cnt:\n break\n most_common_w_list.append(x[0])\n\nadd = -1\nfor h in most_common_h_list:\n for w in most_common_w_list:\n if PF[h, w] == 0:\n add = 0\n break\n\ncnt = most_common_h_cnt + most_common_w_cnt + add\n\nprint(cnt)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598143938", "date2": "1598146490", "bleu_score": "0.7130001937018308", "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, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 83, "total_score": 103, "input": "5 7 10\n1 5\n4 5\n2 2\n5 5\n2 2\n5 4\n5 4\n5 1\n4 3\n2 2\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": ["from collections import Counter\nfrom collections import defaultdict\n\ndef li(): # (0): li=\n return [int(x) for x in input().split()]\n\nH, W, M = li() # (1): H=5, W=7, M=10\nPH = [] # (2): PH=[]\nPW = [] # (3): PW=[]\n\nfor i in range(M): # (4): i=0 (8): i=1 ... (44): NO CHANGE\n h, w = li() # (5): h=1, w=5 (9): h=4 ... (41): h=2, w=2\n PH.append(h) # (6): PH=[1] (10): PH=[1, 4] ... (42): PH=[1, 4, 2, 5, 2, 5, 5, 5, 4, 2]\n PW.append(w) # (7): PW=[5] (11): PW=[5, 5] ... (43): PW=[5, 5, 2, 5, 2, 4, 4, 1, 3, 2]\n\nfrequency_h_list = Counter(PH).most_common() # (45): frequency_h_list=[(5, 4), (2, 3), (4, 2), (1, 1)]\nfrequency_w_list = Counter(PW).most_common() # (46): frequency_w_list=[(5, 3), (2, 3), (4, 2), (1, 1), (3, 1)]\nmost_common_h_cnt = frequency_h_list[0][1] # (47): most_common_h_cnt=4\nmost_common_w_cnt = frequency_w_list[0][1] # (48): most_common_w_cnt=3\n\nmost_common_h_list = [] # (49): most_common_h_list=[]\nfor x in frequency_h_list: # (50): x=(5, 4) (53): x=(2, 3)\n if x[1] < most_common_h_cnt: # (51): NO CHANGE (54): NO CHANGE\n break # (55): NO CHANGE\n most_common_h_list.append(x[0]) # (52): most_common_h_list=[5]\n\nmost_common_w_list = [] # (56): most_common_w_list=[]\nfor x in frequency_w_list: # (57): x=(5, 3) (60): x=(2, 3) (63): x=(4, 2)\n if x[1] < most_common_w_cnt: # (58): NO CHANGE (61): NO CHANGE (64): NO CHANGE\n break # (65): NO CHANGE\n most_common_w_list.append(x[0]) # (59): most_common_w_list=[5] (62): most_common_w_list=[5, 2]\n\ncontain_intersection = {} # (66): contain_intersection={}\nfor h in most_common_h_list: # (67): h=5 (73): NO CHANGE\n for w in most_common_w_list: # (68): w=5 (70): w=2 (72): NO CHANGE\n contain_intersection[h, w] = False # (69): contain_intersection={(5, 5): False} (71): contain_intersection={(5, 5): False, (5, 2): False}\n\nadd = 0 # (74): add=0\n\nfor i in range(M): # (75): i=0\n h, w = PH[i], PW[i] # (76): h=1, w=5\n if h not in most_common_h_list and w not in most_common_w_list: # (77): NO CHANGE\n continue\n if (h, w) not in contain_intersection: # (78): NO CHANGE\n add = -1 # (79): add=-1\n break # (80): NO CHANGE\ncnt = most_common_h_cnt + most_common_w_cnt + add # (81): cnt=6\n\nprint(cnt)"], "anno_status": [false], "diff_content": " from collections import Counter\n from collections import defaultdict\n \n def li():\n return [int(x) for x in input().split()]\n \n H, W, M = li()\n PH = []\n PW = []\n+PHF = defaultdict(int)\n+PWF = defaultdict(int)\n+PF = defaultdict(int)\n \n for i in range(M):\n h, w = li()\n PH.append(h)\n PW.append(w)\n+ PHF[h] += 1\n+ PWF[w] += 1\n+ PF[h, w] += 1\n \n-frequency_h_list = Counter(PH).most_common()\n-frequency_w_list = Counter(PW).most_common()\n-most_common_h_cnt = frequency_h_list[0][1]\n-most_common_w_cnt = frequency_w_list[0][1]\n+sorted_PHF = sorted(PHF.items(), key=lambda x: x[1], reverse=True)\n+sorted_PWF = sorted(PWF.items(), key=lambda x: x[1], reverse=True)\n+most_common_h_cnt = sorted_PHF[0][1]\n+most_common_w_cnt = sorted_PWF[0][1]\n \n most_common_h_list = []\n-for x in frequency_h_list:\n+for x in sorted_PHF:\n if x[1] < most_common_h_cnt:\n break\n most_common_h_list.append(x[0])\n \n most_common_w_list = []\n-for x in frequency_w_list:\n+for x in sorted_PWF:\n if x[1] < most_common_w_cnt:\n break\n most_common_w_list.append(x[0])\n \n-contain_intersection = {}\n+add = -1\n for h in most_common_h_list:\n for w in most_common_w_list:\n- contain_intersection[h, w] = False\n+ if PF[h, w] == 0:\n+ add = 0\n+ break\n \n-add = 0\n-\n-for i in range(M):\n- h, w = PH[i], PW[i]\n- if h not in most_common_h_list and w not in most_common_w_list:\n- continue\n- if (h, w) not in contain_intersection:\n- add = -1\n- break\n cnt = most_common_h_cnt + most_common_w_cnt + add\n \n print(cnt)\n", "FL_content": " from collections import Counter\n from collections import defaultdict\n \n def li():\n return [int(x) for x in input().split()]\n \n H, W, M = li()\n PH = []\n PW = []\n \n for i in range(M):\n h, w = li()\n PH.append(h)\n PW.append(w)\n \n-frequency_h_list = Counter(PH).most_common()\n-frequency_w_list = Counter(PW).most_common()\n-most_common_h_cnt = frequency_h_list[0][1]\n-most_common_w_cnt = frequency_w_list[0][1]\n \n most_common_h_list = []\n-for x in frequency_h_list:\n if x[1] < most_common_h_cnt:\n break\n most_common_h_list.append(x[0])\n \n most_common_w_list = []\n-for x in frequency_w_list:\n if x[1] < most_common_w_cnt:\n break\n most_common_w_list.append(x[0])\n \n-contain_intersection = {}\n for h in most_common_h_list:\n for w in most_common_w_list:\n- contain_intersection[h, w] = False\n \n-add = 0\n-\n-for i in range(M):\n- h, w = PH[i], PW[i]\n- if h not in most_common_h_list and w not in most_common_w_list:\n- continue\n- if (h, w) not in contain_intersection:\n- add = -1\n- break\n cnt = most_common_h_cnt + most_common_w_cnt + add\n \n print(cnt)\n", "added_lines": 16, "removed_lines": 17, "code1_lines": 49 }, { "user_id": "u645855527", "problem_id": "p02580", "submission1_id": "s612151636", "submission2_id": "s006038436", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import combinations\n\nH, W, M = map(int, input().split())\n\nbomb_h = [0] * H\nbomb_w = [0] * W\ngrid = [[False] * W for _ in range(H)]\nfor i in range(M):\n h, w = map(int, input().split())\n bomb_h[h-1] += 1\n bomb_w[w-1] += 1\n grid[h-1][w-1] = True\n\nmax_h = max(bomb_h)\nmax_w = max(bomb_w)\n\nh_indices = []\nfor i in range(H):\n if bomb_h[i] == max_h:\n h_indices.append(i)\n\nw_indices = []\nfor i in range(W):\n if bomb_w[i] == max_w:\n w_indices.append(i)\n\nans = max_w + max_h - 1\nfor h in h_indices:\n for w in w_indices:\n if not grid[h][w]:\n ans += 1\n break\n\nprint(ans)", "code2": "import sys\ninput = sys.stdin.buffer.readline\n\nH, W, M = map(int, input().split())\n\nbomb_h = [0] * H\nbomb_w = [0] * W\nbomb = set()\nfor i in range(M):\n h, w = map(int, input().split())\n bomb_h[h-1] += 1\n bomb_w[w-1] += 1\n bomb.add((h-1, w-1))\n\nmax_h = max(bomb_h)\nmax_w = max(bomb_w)\n\nh_indices = []\nfor i in range(H):\n if bomb_h[i] == max_h:\n h_indices.append(i)\n\nw_indices = []\nfor i in range(W):\n if bomb_w[i] == max_w:\n w_indices.append(i)\n\nans = max_w + max_h - 1\nfor h in h_indices:\n for w in w_indices:\n if (h, w) not in bomb:\n ans += 1\n print(ans)\n exit()\n\nif ans == -1:\n ans = 0\n\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598124394", "date2": "1598136146", "bleu_score": "0.8181369579822055", "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, 0, 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, 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": 97, "total_score": 103, "input": "5 5 10\n2 5\n1 5\n2 1\n5 1\n2 2\n5 2\n5 1\n1 2\n3 5\n1 4\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["from itertools import combinations\n\nH, W, M = map(int, input().split()) # (0): H=5, W=5, M=10\n\nbomb_h = [0] * H # (1): bomb_h=[0, 0, 0, 0, 0]\nbomb_w = [0] * W # (2): bomb_w=[0, 0, 0, 0, 0]\ngrid = [[False] * W for _ in range(H)] # (3): grid\nfor i in range(M): # (4): i=0 (9): i=1 ... (54): NO CHANGE\n h, w = map(int, input().split()) # (5): h=2, w=5 (10): h=1 ... (50): h=1, w=4\n bomb_h[h-1] += 1 # (6): bomb_h=[0, 1, 0, 0, 0] (11): bomb_h=[1, 1, 0, 0, 0] ... (51): bomb_h=[3, 3, 1, 0, 3]\n bomb_w[w-1] += 1 # (7): bomb_w=[0, 0, 0, 0, 1] (12): bomb_w=[0, 0, 0, 0, 2] ... (52): bomb_w=[3, 3, 0, 1, 3]\n grid[h-1][w-1] = True # (8): grid (13): grid ... (53): grid\n\nmax_h = max(bomb_h) # (55): max_h=3\nmax_w = max(bomb_w) # (56): max_w=3\n\nh_indices = [] # (57): h_indices=[]\nfor i in range(H): # (58): i=0 (61): i=1 ... (71): NO CHANGE\n if bomb_h[i] == max_h: # (59): NO CHANGE (62): NO CHANGE ... (69): NO CHANGE\n h_indices.append(i) # (60): h_indices=[0] (63): h_indices=[0, 1] (70): h_indices=[0, 1, 4]\n\nw_indices = [] # (72): w_indices=[]\nfor i in range(W): # (73): i=0 (76): i=1 ... (86): NO CHANGE\n if bomb_w[i] == max_w: # (74): NO CHANGE (77): NO CHANGE ... (84): NO CHANGE\n w_indices.append(i) # (75): w_indices=[0] (78): w_indices=[0, 1] (85): w_indices=[0, 1, 4]\n\nans = max_w + max_h - 1 # (87): ans=5\nfor h in h_indices: # (88): h=0 (93): h=1 ... (110): NO CHANGE\n for w in w_indices: # (89): w=0 (94): NO CHANGE ... (106): w=4\n if not grid[h][w]: # (90): NO CHANGE (95): NO CHANGE ... (107): NO CHANGE\n ans += 1 # (91): ans=6 (108): ans=7\n break # (92): NO CHANGE (109): NO CHANGE\n\nprint(ans)"], "anno_status": [true], "diff_content": "-from itertools import combinations\n+import sys\n+input = sys.stdin.buffer.readline\n \n H, W, M = map(int, input().split())\n \n bomb_h = [0] * H\n bomb_w = [0] * W\n-grid = [[False] * W for _ in range(H)]\n+bomb = set()\n for i in range(M):\n h, w = map(int, input().split())\n bomb_h[h-1] += 1\n bomb_w[w-1] += 1\n- grid[h-1][w-1] = True\n+ bomb.add((h-1, w-1))\n \n max_h = max(bomb_h)\n max_w = max(bomb_w)\n \n h_indices = []\n for i in range(H):\n if bomb_h[i] == max_h:\n h_indices.append(i)\n \n w_indices = []\n for i in range(W):\n if bomb_w[i] == max_w:\n w_indices.append(i)\n \n ans = max_w + max_h - 1\n for h in h_indices:\n for w in w_indices:\n- if not grid[h][w]:\n+ if (h, w) not in bomb:\n ans += 1\n- break\n+ print(ans)\n+ exit()\n+\n+if ans == -1:\n+ ans = 0\n \n print(ans)\n+\n", "FL_content": "-from itertools import combinations\n \n H, W, M = map(int, input().split())\n \n bomb_h = [0] * H\n bomb_w = [0] * W\n-grid = [[False] * W for _ in range(H)]\n for i in range(M):\n h, w = map(int, input().split())\n bomb_h[h-1] += 1\n bomb_w[w-1] += 1\n- grid[h-1][w-1] = True\n \n max_h = max(bomb_h)\n max_w = max(bomb_w)\n \n h_indices = []\n for i in range(H):\n if bomb_h[i] == max_h:\n h_indices.append(i)\n \n w_indices = []\n for i in range(W):\n if bomb_w[i] == max_w:\n w_indices.append(i)\n \n ans = max_w + max_h - 1\n for h in h_indices:\n for w in w_indices:\n- if not grid[h][w]:\n ans += 1\n- break\n \n print(ans)\n", "added_lines": 11, "removed_lines": 5, "code1_lines": 34 }, { "user_id": "u137226361", "problem_id": "p02580", "submission1_id": "s293915255", "submission2_id": "s577777091", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\n\nh, w, m = map(int, input().split())\nlsh = [0] * h\nlsw = [0] * w\n\nbom = []\nfor _ in range(m):\n m1, m2 = map(int, input().split())\n lsh[m1 - 1] += 1\n lsw[m2 - 1] += 1\n bom.append((m1-1, m2-1))\n\nlshmax = max(lsh)\nlswmax = max(lsw)\nhin = [i for i in lsh if i == lshmax]\nwin = [i for i in lsw if i == lswmax]\n\n\njd= False\n\nfor i in hin:\n for j in win:\n if (i, j) not in bom:\n jd= True\n \nif jd:\n print(lshmax+lswmax)\nelse:\n print(lshmax + lswmax -1)", "code2": "def main():\n h, w, m = map(int, input().split())\n lsh = [0] * h\n lsw = [0] * w\n\n bom = set()\n for _ in range(m):\n m1, m2 = map(int, input().split())\n lsh[m1 - 1] += 1\n lsw[m2 - 1] += 1\n bom.add((m1-1, m2-1))\n\n lshmax = max(lsh)\n lswmax = max(lsw)\n\n hin = [i for i in range(h) if lsh[i] == lshmax]\n win = [i for i in range(w) if lsw[i] == lswmax]\n\n for i in hin:\n for j in win:\n if (i, j) not in bom:\n print(lshmax + lswmax)\n exit(0)\n else:\n print(lshmax + lswmax -1)\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598135475", "date2": "1598136900", "bleu_score": "0.7294519621271943", "code1_test_status": [0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 103, "input": "5 5 10\n2 5\n4 5\n3 2\n5 3\n2 2\n5 4\n5 1\n5 1\n3 5\n1 4\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": ["import collections\n\nh, w, m = map(int, input().split()) # (0): h=5, w=5, m=10\nlsh = [0] * h # (1): lsh=[0, 0, 0, 0, 0]\nlsw = [0] * w # (2): lsw=[0, 0, 0, 0, 0]\n\nbom = [] # (3): bom=[]\nfor _ in range(m): # (4): _=0 (9): _=1 ... (54): NO CHANGE\n m1, m2 = map(int, input().split()) # (5): m1=2, m2=5 (10): m1=4 ... (50): m1=1, m2=4\n lsh[m1 - 1] += 1 # (6): lsh=[0, 1, 0, 0, 0] (11): lsh=[0, 1, 0, 1, 0] ... (51): lsh=[1, 2, 2, 1, 4]\n lsw[m2 - 1] += 1 # (7): lsw=[0, 0, 0, 0, 1] (12): lsw=[0, 0, 0, 0, 2] ... (52): lsw=[2, 2, 1, 2, 3]\n bom.append((m1-1, m2-1)) # (8): bom=[(1, 4)] (13): bom=[(1, 4), (3, 4)] ... (53): bom=[(1, 4), (3, 4), (2, 1), (4, 2), (1, 1), (4, 3), (4, 0), (4, 0), (2, 4), (0, 3)]\n\nlshmax = max(lsh) # (55): lshmax=4\nlswmax = max(lsw) # (56): lswmax=3\nhin = [i for i in lsh if i == lshmax] # (57): hin=[4]\nwin = [i for i in lsw if i == lswmax] # (58): win=[3]\n\n\njd= False # (59): jd=False\n\nfor i in hin: # (60): i=4 (64): NO CHANGE\n for j in win: # (61): j=3 (63): NO CHANGE\n if (i, j) not in bom: # (62): NO CHANGE\n jd= True\n \nif jd: # (65): NO CHANGE\n print(lshmax+lswmax)\nelse:\n print(lshmax + lswmax -1)"], "anno_status": [true], "diff_content": "-import collections\n+def main():\n+ h, w, m = map(int, input().split())\n+ lsh = [0] * h\n+ lsw = [0] * w\n \n-h, w, m = map(int, input().split())\n-lsh = [0] * h\n-lsw = [0] * w\n+ bom = set()\n+ for _ in range(m):\n+ m1, m2 = map(int, input().split())\n+ lsh[m1 - 1] += 1\n+ lsw[m2 - 1] += 1\n+ bom.add((m1-1, m2-1))\n \n-bom = []\n-for _ in range(m):\n- m1, m2 = map(int, input().split())\n- lsh[m1 - 1] += 1\n- lsw[m2 - 1] += 1\n- bom.append((m1-1, m2-1))\n+ lshmax = max(lsh)\n+ lswmax = max(lsw)\n \n-lshmax = max(lsh)\n-lswmax = max(lsw)\n-hin = [i for i in lsh if i == lshmax]\n-win = [i for i in lsw if i == lswmax]\n+ hin = [i for i in range(h) if lsh[i] == lshmax]\n+ win = [i for i in range(w) if lsw[i] == lswmax]\n \n+ for i in hin:\n+ for j in win:\n+ if (i, j) not in bom:\n+ print(lshmax + lswmax)\n+ exit(0)\n+ else:\n+ print(lshmax + lswmax -1)\n \n-jd= False\n \n-for i in hin:\n- for j in win:\n- if (i, j) not in bom:\n- jd= True\n- \n-if jd:\n- print(lshmax+lswmax)\n-else:\n- print(lshmax + lswmax -1)\n+if __name__ == '__main__':\n+ main()\n", "FL_content": "-import collections\n \n-h, w, m = map(int, input().split())\n-lsh = [0] * h\n-lsw = [0] * w\n \n-bom = []\n-for _ in range(m):\n- m1, m2 = map(int, input().split())\n- lsh[m1 - 1] += 1\n- lsw[m2 - 1] += 1\n- bom.append((m1-1, m2-1))\n \n-lshmax = max(lsh)\n-lswmax = max(lsw)\n-hin = [i for i in lsh if i == lshmax]\n-win = [i for i in lsw if i == lswmax]\n \n \n-jd= False\n \n-for i in hin:\n- for j in win:\n- if (i, j) not in bom:\n- jd= True\n- \n-if jd:\n- print(lshmax+lswmax)\n-else:\n- print(lshmax + lswmax -1)\n", "added_lines": 23, "removed_lines": 24, "code1_lines": 30 }, { "user_id": "u309039873", "problem_id": "p02580", "submission1_id": "s295803083", "submission2_id": "s311727322", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nHK,WK,M = map(int, input().split())\nW = [0] * (WK + 1)\nH = [0] * (HK + 1)\nHW = {}\n\n\nfor i in range(M):\n h, w = map(int, input().split())\n\n H[h] += 1\n W[w] += 1\n\n HW[(h,w)] = 1\n\nanswer = 0\nHMAX = max(H)\nWMAX = max(W)\n\nHEMAX = H.count(HMAX)\nWEMAX = W.count(WMAX)\nif HEMAX * WEMAX > M:\n print(HMAX + WMAX)\n sys.exit(0)\n\nHMAXES = [i for i, _ in enumerate(H) if _ == HMAX]\nWMAXES = [i for i, _ in enumerate(W) if _ == WMAX]\n\n\nanswer = HMAX + WMAX\nfor h in HMAXES:\n for w in WMAXES:\n if (h,w) in HW:\n print(answer)\n sys.exit(0)\nprint(answer-1)", "code2": "import sys\nHK,WK,M = map(int, input().split())\nW = [0] * (WK + 1)\nH = [0] * (HK + 1)\nHW = {}\n\n\nfor i in range(M):\n h, w = map(int, input().split())\n\n H[h] += 1\n W[w] += 1\n\n HW[(h,w)] = 1\n\nanswer = 0\nHMAX = max(H)\nWMAX = max(W)\n\nHEMAX = H.count(HMAX)\nWEMAX = W.count(WMAX)\nif HEMAX * WEMAX > M:\n print(HMAX + WMAX)\n sys.exit(0)\n\nHMAXES = [i for i, _ in enumerate(H) if _ == HMAX]\nWMAXES = [i for i, _ in enumerate(W) if _ == WMAX]\n\n\nanswer = HMAX + WMAX\nfor h in HMAXES:\n for w in WMAXES:\n if not (h,w) in HW:\n print(answer)\n sys.exit(0)\nprint(answer-1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598153717", "date2": "1598153794", "bleu_score": "0.9920864876940086", "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, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 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, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 16, "total_score": 103, "input": "5 10 10\n2 5\n4 5\n2 3\n5 5\n2 4\n5 4\n5 1\n1 1\n4 5\n1 4\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n HK,WK,M = map(int, input().split())\n W = [0] * (WK + 1)\n H = [0] * (HK + 1)\n HW = {}\n \n \n for i in range(M):\n h, w = map(int, input().split())\n \n H[h] += 1\n W[w] += 1\n \n HW[(h,w)] = 1\n \n answer = 0\n HMAX = max(H)\n WMAX = max(W)\n \n HEMAX = H.count(HMAX)\n WEMAX = W.count(WMAX)\n if HEMAX * WEMAX > M:\n print(HMAX + WMAX)\n sys.exit(0)\n \n HMAXES = [i for i, _ in enumerate(H) if _ == HMAX]\n WMAXES = [i for i, _ in enumerate(W) if _ == WMAX]\n \n \n answer = HMAX + WMAX\n for h in HMAXES:\n for w in WMAXES:\n- if (h,w) in HW:\n+ if not (h,w) in HW:\n print(answer)\n sys.exit(0)\n print(answer-1)\n", "FL_content": " import sys\n HK,WK,M = map(int, input().split())\n W = [0] * (WK + 1)\n H = [0] * (HK + 1)\n HW = {}\n \n \n for i in range(M):\n h, w = map(int, input().split())\n \n H[h] += 1\n W[w] += 1\n \n HW[(h,w)] = 1\n \n answer = 0\n HMAX = max(H)\n WMAX = max(W)\n \n HEMAX = H.count(HMAX)\n WEMAX = W.count(WMAX)\n if HEMAX * WEMAX > M:\n print(HMAX + WMAX)\n sys.exit(0)\n \n HMAXES = [i for i, _ in enumerate(H) if _ == HMAX]\n WMAXES = [i for i, _ in enumerate(W) if _ == WMAX]\n \n \n answer = HMAX + WMAX\n for h in HMAXES:\n for w in WMAXES:\n- if (h,w) in HW:\n print(answer)\n sys.exit(0)\n print(answer-1)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 36 }, { "user_id": "u987164499", "problem_id": "p02580", "submission1_id": "s781485723", "submission2_id": "s043287587", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W,M = map(int,input().split())\n\nh_target = [0]*(H+1)\nw_target = [0]*(W+1)\ntarget = []\n\nfor _ in range(M):\n h,w = map(int,input().split())\n target.append((h,w))\n h_target[h] += 1\n w_target[w] += 1\n\nmax_h_target = max(h_target)\nmax_w_target = max(w_target)\n\nflag = False \n\nfor i,j in target:\n if h_target[i] != max_h_target and w_target[j] != max_w_target:\n break\nelse:\n flag = True\n\nif flag:\n print(max_h_target+max_w_target)\nelse:\n print(max_h_target+max_w_target-1)", "code2": "H,W,M = map(int,input().split())\n\nh_target = [0]*(H+1)\nw_target = [0]*(W+1)\ntarget = []\n\nfor _ in range(M):\n h,w = map(int,input().split())\n target.append((h,w))\n h_target[h] += 1\n w_target[w] += 1\n\nmax_h = max(h_target)\nmax_w = max(w_target)\n\nnum_max_h = 0\nnum_max_w = 0\n\nfor i in h_target:\n if i == max_h:\n num_max_h += 1\n\nfor i in w_target:\n if i == max_w:\n num_max_w += 1\n\ntotal = num_max_h*num_max_w\npoint = 0\n\nfor i,j in target:\n if h_target[i] == max_h and w_target[j] == max_w:\n point += 1\n\nif point == total:\n print(max_h+max_w-1)\nelse:\n print(max_h+max_w)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598198379", "date2": "1598199284", "bleu_score": "0.6661205196710707", "code1_test_status": [0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0], "code1_test_score": 71, "total_score": 103, "input": "5 5 10\n2 5\n4 5\n2 3\n5 2\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": ["H,W,M = map(int,input().split()) # (0): H=5, W=5, M=10\n\nh_target = [0]*(H+1) # (1): h_target=[0, 0, 0, 0, 0, 0]\nw_target = [0]*(W+1) # (2): w_target=[0, 0, 0, 0, 0, 0]\ntarget = [] # (3): target=[]\n\nfor _ in range(M): # (4): _=0 (9): _=1 ... (54): NO CHANGE\n h,w = map(int,input().split()) # (5): h=2, w=5 (10): h=4 ... (50): h=1, w=4\n target.append((h,w)) # (6): target=[(2, 5)] (11): target=[(2, 5), (4, 5)] ... (51): target=[(2, 5), (4, 5), (2, 3), (5, 2), (2, 2), (5, 4), (5, 3), (5, 1), (3, 5), (1, 4)]\n h_target[h] += 1 # (7): h_target=[0, 0, 1, 0, 0, 0] (12): h_target=[0, 0, 1, 0, 1, 0] ... (52): h_target=[0, 1, 3, 1, 1, 4]\n w_target[w] += 1 # (8): w_target=[0, 0, 0, 0, 0, 1] (13): w_target=[0, 0, 0, 0, 0, 2] ... (53): w_target=[0, 1, 2, 2, 2, 3]\n\nmax_h_target = max(h_target) # (55): max_h_target=4\nmax_w_target = max(w_target) # (56): max_w_target=3\n\nflag = False # (57): flag=False\n\nfor i,j in target: # (58): i=2, j=5 (60): i=4 (62): i=2, j=3\n if h_target[i] != max_h_target and w_target[j] != max_w_target: # (59): NO CHANGE (61): NO CHANGE (63): NO CHANGE\n break # (64): NO CHANGE\nelse:\n flag = True\n\nif flag: # (65): NO CHANGE\n print(max_h_target+max_w_target)\nelse:\n print(max_h_target+max_w_target-1)"], "anno_status": [true], "diff_content": " H,W,M = map(int,input().split())\n \n h_target = [0]*(H+1)\n w_target = [0]*(W+1)\n target = []\n \n for _ in range(M):\n h,w = map(int,input().split())\n target.append((h,w))\n h_target[h] += 1\n w_target[w] += 1\n \n-max_h_target = max(h_target)\n-max_w_target = max(w_target)\n+max_h = max(h_target)\n+max_w = max(w_target)\n \n-flag = False \n+num_max_h = 0\n+num_max_w = 0\n+\n+for i in h_target:\n+ if i == max_h:\n+ num_max_h += 1\n+\n+for i in w_target:\n+ if i == max_w:\n+ num_max_w += 1\n+\n+total = num_max_h*num_max_w\n+point = 0\n \n for i,j in target:\n- if h_target[i] != max_h_target and w_target[j] != max_w_target:\n- break\n-else:\n- flag = True\n+ if h_target[i] == max_h and w_target[j] == max_w:\n+ point += 1\n \n-if flag:\n- print(max_h_target+max_w_target)\n+if point == total:\n+ print(max_h+max_w-1)\n else:\n- print(max_h_target+max_w_target-1)\n+ print(max_h+max_w)\n", "FL_content": " H,W,M = map(int,input().split())\n \n h_target = [0]*(H+1)\n w_target = [0]*(W+1)\n target = []\n \n for _ in range(M):\n h,w = map(int,input().split())\n target.append((h,w))\n h_target[h] += 1\n w_target[w] += 1\n \n-max_h_target = max(h_target)\n-max_w_target = max(w_target)\n \n-flag = False \n \n for i,j in target:\n- if h_target[i] != max_h_target and w_target[j] != max_w_target:\n- break\n-else:\n- flag = True\n \n-if flag:\n- print(max_h_target+max_w_target)\n else:\n- print(max_h_target+max_w_target-1)\n", "added_lines": 20, "removed_lines": 10, "code1_lines": 27 }, { "user_id": "u595905528", "problem_id": "p02580", "submission1_id": "s557024985", "submission2_id": "s832421453", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport bisect\nimport itertools\nimport collections\nimport fractions\nimport heapq\nimport math\nfrom operator import mul\nfrom functools import reduce\nfrom functools import lru_cache\n\n\ndef solve():\n readline = sys.stdin.buffer.readline\n input = readline\n mod = 10 ** 9 + 7\n H, W, M = map(int, input().split())\n Hlist = [0] * H\n Wlist = [0] * W\n hw = []\n\n for _ in range(M):\n h, w = map(int, input().split())\n Hlist[h-1] += 1\n Wlist[w-1] += 1\n hw.append([h, w])\n\n\n hmax = [i for i, x in enumerate(Hlist) if x == max(Hlist)]\n wmax = [i for i, x in enumerate(Wlist) if x == max(Wlist)]\n hmaxset = set(hmax)\n wmaxset = set(wmax)\n\n flag = False\n for hh in hw:\n h = hh[0] - 1\n w = hh[1] - 1\n if not (h in hmaxset and w in wmaxset):\n flag = True\n break\n\n\n if flag:\n print(Hlist[h] + Wlist[w])\n else:\n print(Hlist[h] + Wlist[w] - 1)\n\n\n\n\n\nif __name__ == '__main__':\n solve()", "code2": "import sys\nimport bisect\nimport itertools\nimport collections\nimport fractions\nimport heapq\nimport math\nfrom operator import mul\nfrom functools import reduce\nfrom functools import lru_cache\n\n\ndef solve():\n readline = sys.stdin.buffer.readline\n input = readline\n mod = 10 ** 9 + 7\n H, W, M = map(int, input().split())\n Hlist = collections.defaultdict(int)\n Wlist = collections.defaultdict(int)\n hw = []\n\n for _ in range(M):\n h, w = map(int, input().split())\n Hlist[h-1] += 1\n Wlist[w-1] += 1\n hw.append([h, w])\n\n \n \n\n Hlist = sorted(Hlist.items(), key=lambda x: x[1], reverse=True)\n Wlist = sorted(Wlist.items(), key=lambda x: x[1], reverse=True)\n\n hmaxset = set()\n wmaxset = set()\n\n maxH = Hlist[0][1]\n for k, v in Hlist:\n if v != maxH:\n break\n else:\n hmaxset.add(k)\n\n maxW = Wlist[0][1]\n for k, v in Wlist:\n if v != maxW:\n break\n else:\n wmaxset.add(k)\n\n\n flag = False\n count = 0\n for hh in hw:\n h = hh[0] - 1\n w = hh[1] - 1\n if h in hmaxset and w in wmaxset:\n count += 1\n\n lenhmax = len(hmaxset)\n lenwmax = len(wmaxset)\n\n if count != lenhmax * lenwmax:\n flag = True\n\n if flag:\n print(maxH + maxW)\n else:\n print(maxH + maxW - 1)\n\n\n\n\n\nif __name__ == '__main__':\n solve()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598129103", "date2": "1598191026", "bleu_score": "0.6520816897556586", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1], "code1_test_score": 45, "total_score": 103, "input": "5 5 10\n2 5\n4 5\n3 2\n5 3\n2 2\n5 4\n5 1\n5 1\n3 5\n1 4\n", "actual_output": "5\n", "expected_output": "7\n\n", "anno_code": ["import sys\nimport bisect\nimport itertools\nimport collections\nimport fractions\nimport heapq\nimport math\nfrom operator import mul\nfrom functools import reduce\nfrom functools import lru_cache\n\n\ndef solve(): # (0): solve=\n readline = sys.stdin.buffer.readline\n input = readline\n mod = 10 ** 9 + 7\n H, W, M = map(int, input().split())\n Hlist = [0] * H\n Wlist = [0] * W\n hw = []\n\n for _ in range(M):\n h, w = map(int, input().split())\n Hlist[h-1] += 1\n Wlist[w-1] += 1\n hw.append([h, w])\n\n\n hmax = [i for i, x in enumerate(Hlist) if x == max(Hlist)]\n wmax = [i for i, x in enumerate(Wlist) if x == max(Wlist)]\n hmaxset = set(hmax)\n wmaxset = set(wmax)\n\n flag = False\n for hh in hw:\n h = hh[0] - 1\n w = hh[1] - 1\n if not (h in hmaxset and w in wmaxset):\n flag = True\n break\n\n\n if flag:\n print(Hlist[h] + Wlist[w])\n else:\n print(Hlist[h] + Wlist[w] - 1)\n\n\n\n\n\nif __name__ == '__main__':\n solve()"], "anno_status": [true], "diff_content": " import sys\n import bisect\n import itertools\n import collections\n import fractions\n import heapq\n import math\n from operator import mul\n from functools import reduce\n from functools import lru_cache\n \n \n def solve():\n readline = sys.stdin.buffer.readline\n input = readline\n mod = 10 ** 9 + 7\n H, W, M = map(int, input().split())\n- Hlist = [0] * H\n- Wlist = [0] * W\n+ Hlist = collections.defaultdict(int)\n+ Wlist = collections.defaultdict(int)\n hw = []\n \n for _ in range(M):\n h, w = map(int, input().split())\n Hlist[h-1] += 1\n Wlist[w-1] += 1\n hw.append([h, w])\n \n+ \n+ \n+\n+ Hlist = sorted(Hlist.items(), key=lambda x: x[1], reverse=True)\n+ Wlist = sorted(Wlist.items(), key=lambda x: x[1], reverse=True)\n+\n+ hmaxset = set()\n+ wmaxset = set()\n+\n+ maxH = Hlist[0][1]\n+ for k, v in Hlist:\n+ if v != maxH:\n+ break\n+ else:\n+ hmaxset.add(k)\n+\n+ maxW = Wlist[0][1]\n+ for k, v in Wlist:\n+ if v != maxW:\n+ break\n+ else:\n+ wmaxset.add(k)\n \n- hmax = [i for i, x in enumerate(Hlist) if x == max(Hlist)]\n- wmax = [i for i, x in enumerate(Wlist) if x == max(Wlist)]\n- hmaxset = set(hmax)\n- wmaxset = set(wmax)\n \n flag = False\n+ count = 0\n for hh in hw:\n h = hh[0] - 1\n w = hh[1] - 1\n- if not (h in hmaxset and w in wmaxset):\n- flag = True\n- break\n+ if h in hmaxset and w in wmaxset:\n+ count += 1\n+\n+ lenhmax = len(hmaxset)\n+ lenwmax = len(wmaxset)\n \n+ if count != lenhmax * lenwmax:\n+ flag = True\n \n if flag:\n- print(Hlist[h] + Wlist[w])\n+ print(maxH + maxW)\n else:\n- print(Hlist[h] + Wlist[w] - 1)\n+ print(maxH + maxW - 1)\n \n \n \n \n \n if __name__ == '__main__':\n solve()\n", "FL_content": " import sys\n import bisect\n import itertools\n import collections\n import fractions\n import heapq\n import math\n from operator import mul\n from functools import reduce\n from functools import lru_cache\n \n \n def solve():\n readline = sys.stdin.buffer.readline\n input = readline\n mod = 10 ** 9 + 7\n H, W, M = map(int, input().split())\n- Hlist = [0] * H\n- Wlist = [0] * W\n hw = []\n \n for _ in range(M):\n h, w = map(int, input().split())\n Hlist[h-1] += 1\n Wlist[w-1] += 1\n hw.append([h, w])\n \n \n- hmax = [i for i, x in enumerate(Hlist) if x == max(Hlist)]\n- wmax = [i for i, x in enumerate(Wlist) if x == max(Wlist)]\n- hmaxset = set(hmax)\n- wmaxset = set(wmax)\n \n flag = False\n for hh in hw:\n h = hh[0] - 1\n w = hh[1] - 1\n- if not (h in hmaxset and w in wmaxset):\n- flag = True\n- break\n \n \n if flag:\n- print(Hlist[h] + Wlist[w])\n else:\n- print(Hlist[h] + Wlist[w] - 1)\n \n \n \n \n \n if __name__ == '__main__':\n solve()\n", "added_lines": 34, "removed_lines": 11, "code1_lines": 53 }, { "user_id": "u910632349", "problem_id": "p02580", "submission1_id": "s864634856", "submission2_id": "s111557176", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,m=map(int,input().split())\nbomb=[list(map(int,input().split())) for _ in range(m)] \na=[0 for i in range(h+1)] \nb=[0 for _ in range(w+1)] \nfor i in range(m):\n a[bomb[i][0]]+=1\n b[bomb[i][1]]+=1\nam=max(a) \nbm=max(b) \nhmax=[0]*(h+1) \nwmax=[0]*(w+1) \nfor i in range(h+1):\n if am==a[i]:\n hmax[i]+=1\nfor i in range(w):\n if bm==b[i]:\n wmax[i]+=1\nans=(am+bm) \nk=sum(hmax)*sum(wmax)\nif k>m: \n print(ans)\n exit()\nfor i in bomb:\n if hmax[i[0]]==1 and wmax[i[1]]==1:\n k-=1\nif k==0:\n print(ans-1)\nelse:\n print(ans)", "code2": "h,w,m=map(int,input().split())\nbomb=[list(map(int,input().split())) for _ in range(m)] \na=[0 for i in range(h+1)] \nb=[0 for _ in range(w+1)] \nfor i in range(m):\n a[bomb[i][0]]+=1\n b[bomb[i][1]]+=1\nam=max(a) \nbm=max(b) \nhmax=[0]*(h+1) \nwmax=[0]*(w+1) \nfor i in range(h+1):\n if am==a[i]:\n hmax[i]+=1\nfor i in range(w+1):\n if bm==b[i]:\n wmax[i]+=1\nans=am+bm \nk=sum(hmax)*sum(wmax)\nif k>m: \n print(ans)\n exit()\nfor i in bomb:\n if hmax[i[0]]==1 and wmax[i[1]]==1:\n k-=1\nif k==0:\n print(ans-1)\nelse:\n print(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598136725", "date2": "1598138231", "bleu_score": "0.9881827208616112", "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, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 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, 0, 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], "code1_test_score": 93, "total_score": 103, "input": "5 5 10\n2 5\n4 5\n2 1\n3 5\n2 2\n5 4\n5 2\n5 1\n3 5\n1 4\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": ["h,w,m=map(int,input().split()) # (0): h=5, w=5, m=10\nbomb=[list(map(int,input().split())) for _ in range(m)] # (1): bomb\na=[0 for i in range(h+1)] # (2): a=[0, 0, 0, 0, 0, 0]\nb=[0 for _ in range(w+1)] # (3): b=[0, 0, 0, 0, 0, 0]\nfor i in range(m): # (4): i=0 (7): i=1 ... (34): NO CHANGE\n a[bomb[i][0]]+=1 # (5): a=[0, 0, 1, 0, 0, 0] (8): a=[0, 0, 1, 0, 1, 0] ... (32): a=[0, 1, 3, 2, 1, 3]\n b[bomb[i][1]]+=1 # (6): b=[0, 0, 0, 0, 0, 1] (9): b=[0, 0, 0, 0, 0, 2] ... (33): b=[0, 2, 2, 0, 2, 4]\nam=max(a) # (35): am=3\nbm=max(b) # (36): bm=4\nhmax=[0]*(h+1) # (37): hmax=[0, 0, 0, 0, 0, 0]\nwmax=[0]*(w+1) # (38): wmax=[0, 0, 0, 0, 0, 0]\nfor i in range(h+1): # (39): i=0 (41): i=1 ... (53): NO CHANGE\n if am==a[i]: # (40): NO CHANGE (42): NO CHANGE ... (51): NO CHANGE\n hmax[i]+=1 # (45): hmax=[0, 0, 1, 0, 0, 0] (52): hmax=[0, 0, 1, 0, 0, 1]\nfor i in range(w): # (54): i=0 (56): i=1 ... (64): NO CHANGE\n if bm==b[i]: # (55): NO CHANGE (57): NO CHANGE ... (63): NO CHANGE\n wmax[i]+=1\nans=(am+bm) # (65): ans=7\nk=sum(hmax)*sum(wmax) # (66): k=0\nif k>m: # (67): NO CHANGE\n print(ans)\n exit()\nfor i in bomb: # (68): i=[2, 5] (70): i=[4, 5] ... (88): NO CHANGE\n if hmax[i[0]]==1 and wmax[i[1]]==1: # (69): NO CHANGE (71): NO CHANGE ... (87): NO CHANGE\n k-=1\nif k==0: # (89): NO CHANGE\n print(ans-1)\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " h,w,m=map(int,input().split())\n bomb=[list(map(int,input().split())) for _ in range(m)] \n a=[0 for i in range(h+1)] \n b=[0 for _ in range(w+1)] \n for i in range(m):\n a[bomb[i][0]]+=1\n b[bomb[i][1]]+=1\n am=max(a) \n bm=max(b) \n hmax=[0]*(h+1) \n wmax=[0]*(w+1) \n for i in range(h+1):\n if am==a[i]:\n hmax[i]+=1\n-for i in range(w):\n+for i in range(w+1):\n if bm==b[i]:\n wmax[i]+=1\n-ans=(am+bm) \n+ans=am+bm \n k=sum(hmax)*sum(wmax)\n if k>m: \n print(ans)\n exit()\n for i in bomb:\n if hmax[i[0]]==1 and wmax[i[1]]==1:\n k-=1\n if k==0:\n print(ans-1)\n else:\n print(ans)\n", "FL_content": " h,w,m=map(int,input().split())\n bomb=[list(map(int,input().split())) for _ in range(m)] \n a=[0 for i in range(h+1)] \n b=[0 for _ in range(w+1)] \n for i in range(m):\n a[bomb[i][0]]+=1\n b[bomb[i][1]]+=1\n am=max(a) \n bm=max(b) \n hmax=[0]*(h+1) \n wmax=[0]*(w+1) \n for i in range(h+1):\n if am==a[i]:\n hmax[i]+=1\n-for i in range(w):\n if bm==b[i]:\n wmax[i]+=1\n-ans=(am+bm) \n k=sum(hmax)*sum(wmax)\n if k>m: \n print(ans)\n exit()\n for i in bomb:\n if hmax[i[0]]==1 and wmax[i[1]]==1:\n k-=1\n if k==0:\n print(ans-1)\n else:\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u211706121", "problem_id": "p02580", "submission1_id": "s231820315", "submission2_id": "s415565043", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict\n\nH,W,M=map(int,input().split())\nAB=[tuple(map(int,input().split()))for i in range(M)]\nAB=[(a-1,b-1)for a,b in AB]\nst=set(AB)\n\nWc=defaultdict(lambda :0)\nHc=defaultdict(lambda :0)\nfor a,b in AB:\n Hc[a]+=1\n Wc[b]+=1\n\nHm=max(Hc.values())\nfor i in Hc.keys():\n if Hc[i]==Hm:\n x=i\n break\nWm=max(Wc.values())\nfor j in Wc.keys():\n if Wc[j]==Wm:\n y=j\n break\n\n\nans=Hc[x] + Wc[y] +(-1 if (x,y) in st else 0)\nprint(ans)\n", "code2": "\nfrom collections import defaultdict\n\nH,W,M=map(int,input().split())\nAB=[tuple(map(int,input().split()))for i in range(M)]\nAB=[(a-1,b-1)for a,b in AB]\nst=set(AB)\n\nWc=defaultdict(lambda :0)\nHc=defaultdict(lambda :0)\nfor a,b in AB:\n Hc[a]+=1\n Wc[b]+=1\n\nHm=max(Hc.values())\nhhh=list(Hc.keys())\nwww=list(Wc.keys())\nfor i in hhh:\n if Hc[i]!=Hm:\n Hc.pop(i)\nWm=max(Wc.values())\nfor j in www:\n if Wc[j]!=Wm:\n Wc.pop(j)\n\nans=0\ncount=0\nfor i in Hc.keys():\n for j in Wc.keys():\n add = -1 if (i,j) in st else 0\n tmp= Hc[i] + Wc[j] + add\n ans=max(ans,tmp)\n if count>300000:\n break\n count+=1\n\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598128454", "date2": "1598128712", "bleu_score": "0.6760211902597787", "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, 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, 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, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 103, "input": "5 10 10\n2 5\n4 5\n2 3\n5 5\n2 4\n5 4\n5 1\n1 1\n4 1\n1 4\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["\nfrom collections import defaultdict\n\nH,W,M=map(int,input().split()) # (0): H=5, W=10, M=10\nAB=[tuple(map(int,input().split()))for i in range(M)] # (1): AB=[(2, 5), (4, 5), (2, 3), (5, 5), (2, 4), (5, 4), (5, 1), (1, 1), (4, 1), (1, 4)]\nAB=[(a-1,b-1)for a,b in AB] # (2): AB=[(1, 4), (3, 4), (1, 2), (4, 4), (1, 3), (4, 3), (4, 0), (0, 0), (3, 0), (0, 3)]\nst=set(AB) # (3): st={(4, 4), (4, 0), (1, 2), (3, 4), (4, 3), (0, 0), (0, 3), (1, 4), (3, 0), (1, 3)}\n\nWc=defaultdict(lambda :0) # (4): Wc=defaultdict( at 0x0000017BFFC59BD0>, {})\nHc=defaultdict(lambda :0) # (5): Hc=defaultdict( at 0x0000017BFFC59B40>, {})\nfor a,b in AB: # (6): a=1, b=4 (9): a=3 ... (36): NO CHANGE\n Hc[a]+=1 # (7): Hc=defaultdict( at 0x0000017BFFC59B40>, {1: 1}) (10): Hc=defaultdict( at 0x0000017BFFC59B40>, {1: 1, 3: 1}) ... (34): Hc=defaultdict( at 0x0000017BFFC59B40>, {1: 3, 3: 2, 4: 3, 0: 2})\n Wc[b]+=1 # (8): Wc=defaultdict( at 0x0000017BFFC59BD0>, {4: 1}) (11): Wc=defaultdict( at 0x0000017BFFC59BD0>, {4: 2}) ... (35): Wc=defaultdict( at 0x0000017BFFC59BD0>, {4: 3, 2: 1, 3: 3, 0: 3})\n\nHm=max(Hc.values()) # (37): Hm=3\nfor i in Hc.keys(): # (38): i=1\n if Hc[i]==Hm: # (39): NO CHANGE\n x=i # (40): x=1\n break # (41): NO CHANGE\nWm=max(Wc.values()) # (42): Wm=3\nfor j in Wc.keys(): # (43): j=4\n if Wc[j]==Wm: # (44): NO CHANGE\n y=j # (45): y=4\n break # (46): NO CHANGE\n\n\nans=Hc[x] + Wc[y] +(-1 if (x,y) in st else 0) # (47): ans=5\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n from collections import defaultdict\n \n H,W,M=map(int,input().split())\n AB=[tuple(map(int,input().split()))for i in range(M)]\n AB=[(a-1,b-1)for a,b in AB]\n st=set(AB)\n \n Wc=defaultdict(lambda :0)\n Hc=defaultdict(lambda :0)\n for a,b in AB:\n Hc[a]+=1\n Wc[b]+=1\n \n Hm=max(Hc.values())\n-for i in Hc.keys():\n- if Hc[i]==Hm:\n- x=i\n- break\n+hhh=list(Hc.keys())\n+www=list(Wc.keys())\n+for i in hhh:\n+ if Hc[i]!=Hm:\n+ Hc.pop(i)\n Wm=max(Wc.values())\n-for j in Wc.keys():\n- if Wc[j]==Wm:\n- y=j\n- break\n+for j in www:\n+ if Wc[j]!=Wm:\n+ Wc.pop(j)\n \n+ans=0\n+count=0\n+for i in Hc.keys():\n+ for j in Wc.keys():\n+ add = -1 if (i,j) in st else 0\n+ tmp= Hc[i] + Wc[j] + add\n+ ans=max(ans,tmp)\n+ if count>300000:\n+ break\n+ count+=1\n \n-ans=Hc[x] + Wc[y] +(-1 if (x,y) in st else 0)\n print(ans)\n \n", "FL_content": " \n from collections import defaultdict\n \n H,W,M=map(int,input().split())\n AB=[tuple(map(int,input().split()))for i in range(M)]\n AB=[(a-1,b-1)for a,b in AB]\n st=set(AB)\n \n Wc=defaultdict(lambda :0)\n Hc=defaultdict(lambda :0)\n for a,b in AB:\n Hc[a]+=1\n Wc[b]+=1\n \n Hm=max(Hc.values())\n-for i in Hc.keys():\n- if Hc[i]==Hm:\n- x=i\n- break\n Wm=max(Wc.values())\n-for j in Wc.keys():\n- if Wc[j]==Wm:\n- y=j\n- break\n \n \n-ans=Hc[x] + Wc[y] +(-1 if (x,y) in st else 0)\n print(ans)\n \n", "added_lines": 18, "removed_lines": 9, "code1_lines": 29 }, { "user_id": "u255898796", "problem_id": "p02580", "submission1_id": "s302245909", "submission2_id": "s517726531", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\na = input().split()\nM = int(a[2])\nhidari = []\nmigi = []\nc = []\n \nfor i in range(M):\n b = input().split()\n hidari.append(b[0])\n migi.append(b[1])\n c.append(b)\n \ncountleft = collections.Counter(hidari)\ncountright = collections.Counter(migi)\nleftmax = countleft.most_common()[0][1]\nrightmax = countright.most_common()[0][1]\ntempmax = int(leftmax + rightmax)\n \n\n\nleftkeys = (list(countleft.keys())[list(countleft.values()).index(leftmax)])\nrightkeys = (list(countright.keys())[list(countright.values()).index(rightmax)])\n \nleftkeyN = int(len(leftkeys))\nrightkeyN = int(len(rightkeys))\nflag = int(0)\ncnt = int(0)\n\nfor i in range(leftkeyN):\n if flag != 0:\n break\n else:\n for P in range(rightkeyN):\n for T in range(M):\n if c[T] == [leftkeys[i],rightkeys[P]]:\n cnt = cnt + 1\n if cnt == 0:\n flag = flag + 1\n break\n else:\n cnt = 0\n \nif flag == 0:\n print(int(tempmax - 1))\nelse:\n print(int(tempmax))\n ", "code2": "import collections\na = input().split()\nM = int(a[2])\nhidari = []\nmigi = []\nc = []\n \nfor i in range(M):\n b = input().split()\n hidari.append(b[0])\n migi.append(b[1])\n c.append(b)\n \ncountleft = collections.Counter(hidari)\ncountright = collections.Counter(migi)\nleftmax = countleft.most_common()[0][1]\nrightmax = countright.most_common()[0][1]\ntempmax = int(leftmax + rightmax)\n \nleftkeys = [k for k, v in countleft.items() if v == leftmax]\nrightkeys = [k for k, v in countright.items() if v == rightmax]\n \nleftkeyN = int(len(leftkeys))\nrightkeyN = int(len(rightkeys))\nflag = int(0)\ncnt = int(0)\n\n\n\n \nfor i in range(M):\n goukei = int(countleft.get(c[i][0])) + int(countright.get(c[i][1]))\n if goukei == tempmax:\n cnt += 1\n else:\n pass\n\nif cnt == int(leftkeyN * rightkeyN):\n print(int(tempmax - 1))\nelse:\n print(int(tempmax))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598129196", "date2": "1598134097", "bleu_score": "0.6927601886601292", "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, 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, 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, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 103, "input": "2 3 3\n2 2\n1 1\n2 3\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["import collections\na = input().split() # (0): a=['2', '3', '3']\nM = int(a[2]) # (1): M=3\nhidari = [] # (2): hidari=[]\nmigi = [] # (3): migi=[]\nc = [] # (4): c=[]\n \nfor i in range(M): # (5): i=0 (10): i=1 ... (20): NO CHANGE\n b = input().split() # (6): b=['2', '2'] (11): b=['1', '1'] (16): b=['2', '3']\n hidari.append(b[0]) # (7): hidari=['2'] (12): hidari=['2', '1'] (17): hidari=['2', '1', '2']\n migi.append(b[1]) # (8): migi=['2'] (13): migi=['2', '1'] (18): migi=['2', '1', '3']\n c.append(b) # (9): c=[['2', '2']] (14): c (19): c\n \ncountleft = collections.Counter(hidari) # (21): countleft=Counter({'2': 2, '1': 1})\ncountright = collections.Counter(migi) # (22): countright=Counter({'2': 1, '1': 1, '3': 1})\nleftmax = countleft.most_common()[0][1] # (23): leftmax=2\nrightmax = countright.most_common()[0][1] # (24): rightmax=1\ntempmax = int(leftmax + rightmax) # (25): tempmax=3\n \n\n\nleftkeys = (list(countleft.keys())[list(countleft.values()).index(leftmax)]) # (26): leftkeys=2\nrightkeys = (list(countright.keys())[list(countright.values()).index(rightmax)]) # (27): rightkeys=2\n \nleftkeyN = int(len(leftkeys)) # (28): leftkeyN=1\nrightkeyN = int(len(rightkeys)) # (29): rightkeyN=1\nflag = int(0) # (30): flag=0\ncnt = int(0) # (31): cnt=0\n\nfor i in range(leftkeyN): # (32): i=0 (46): NO CHANGE\n if flag != 0: # (33): NO CHANGE\n break\n else:\n for P in range(rightkeyN): # (34): P=0 (45): NO CHANGE\n for T in range(M): # (35): T=0 (38): T=1 ... (42): NO CHANGE\n if c[T] == [leftkeys[i],rightkeys[P]]: # (36): NO CHANGE (39): NO CHANGE (41): NO CHANGE\n cnt = cnt + 1 # (37): cnt=1\n if cnt == 0: # (43): NO CHANGE\n flag = flag + 1\n break\n else:\n cnt = 0 # (44): cnt=0\n \nif flag == 0: # (47): NO CHANGE\n print(int(tempmax - 1))\nelse:\n print(int(tempmax))\n "], "anno_status": [true], "diff_content": " import collections\n a = input().split()\n M = int(a[2])\n hidari = []\n migi = []\n c = []\n \n for i in range(M):\n b = input().split()\n hidari.append(b[0])\n migi.append(b[1])\n c.append(b)\n- \n+ \n countleft = collections.Counter(hidari)\n countright = collections.Counter(migi)\n leftmax = countleft.most_common()[0][1]\n rightmax = countright.most_common()[0][1]\n tempmax = int(leftmax + rightmax)\n \n-\n-\n-leftkeys = (list(countleft.keys())[list(countleft.values()).index(leftmax)])\n-rightkeys = (list(countright.keys())[list(countright.values()).index(rightmax)])\n+leftkeys = [k for k, v in countleft.items() if v == leftmax]\n+rightkeys = [k for k, v in countright.items() if v == rightmax]\n \n leftkeyN = int(len(leftkeys))\n rightkeyN = int(len(rightkeys))\n flag = int(0)\n cnt = int(0)\n \n-for i in range(leftkeyN):\n- if flag != 0:\n- break\n- else:\n- for P in range(rightkeyN):\n- for T in range(M):\n- if c[T] == [leftkeys[i],rightkeys[P]]:\n- cnt = cnt + 1\n- if cnt == 0:\n- flag = flag + 1\n- break\n- else:\n- cnt = 0\n+\n+\n \n-if flag == 0:\n+for i in range(M):\n+ goukei = int(countleft.get(c[i][0])) + int(countright.get(c[i][1]))\n+ if goukei == tempmax:\n+ cnt += 1\n+ else:\n+ pass\n+\n+if cnt == int(leftkeyN * rightkeyN):\n print(int(tempmax - 1))\n else:\n print(int(tempmax))\n- \n", "FL_content": " import collections\n a = input().split()\n M = int(a[2])\n hidari = []\n migi = []\n c = []\n \n for i in range(M):\n b = input().split()\n hidari.append(b[0])\n migi.append(b[1])\n c.append(b)\n- \n countleft = collections.Counter(hidari)\n countright = collections.Counter(migi)\n leftmax = countleft.most_common()[0][1]\n rightmax = countright.most_common()[0][1]\n tempmax = int(leftmax + rightmax)\n \n-\n-\n-leftkeys = (list(countleft.keys())[list(countleft.values()).index(leftmax)])\n-rightkeys = (list(countright.keys())[list(countright.values()).index(rightmax)])\n \n leftkeyN = int(len(leftkeys))\n rightkeyN = int(len(rightkeys))\n flag = int(0)\n cnt = int(0)\n \n-for i in range(leftkeyN):\n- if flag != 0:\n- break\n- else:\n- for P in range(rightkeyN):\n- for T in range(M):\n- if c[T] == [leftkeys[i],rightkeys[P]]:\n- cnt = cnt + 1\n- if cnt == 0:\n- flag = flag + 1\n- break\n- else:\n- cnt = 0\n \n-if flag == 0:\n print(int(tempmax - 1))\n else:\n print(int(tempmax))\n- \n", "added_lines": 13, "removed_lines": 20, "code1_lines": 48 }, { "user_id": "u567225946", "problem_id": "p02580", "submission1_id": "s441413219", "submission2_id": "s931050312", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\nn,m,k=map(int,input().split())\npoints=set()\nrow=defaultdict(int)\ncol=defaultdict(int)\nfor i in range(k):\n a,b=map(int,input().split())\n points.add((a,b))\n row[a]+=1\n col[b]+=1\nm1=max(row.values())\nm2=max(col.values())\nl1=[]\nl2=[]\nfor i in row:\n if row[i]==m1:\n l1.append(i)\nfor i in col:\n if col[i]==m2:\n l2.append(i)\nans=m2+m1-1\nfor i in l1:\n for j in l2:\n if (i,j) not in points:\n print(i,j)\n ans+=1\n print(ans)\n quit()\nprint(ans)\n\n\n", "code2": "from collections import defaultdict\nn,m,k=map(int,input().split())\npoints=set()\nrow=defaultdict(int)\ncol=defaultdict(int)\nfor i in range(k):\n a,b=map(int,input().split())\n points.add((a,b))\n row[a]+=1\n col[b]+=1\nm1=max(row.values())\nm2=max(col.values())\nl1=[]\nl2=[]\nfor i in row:\n if row[i]==m1:\n l1.append(i)\nfor i in col:\n if col[i]==m2:\n l2.append(i)\nans=m2+m1-1\nfor i in l1:\n for j in l2:\n if (i,j) not in points:\n \n ans+=1\n print(ans)\n quit()\nprint(ans)\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598198040", "date2": "1598198360", "bleu_score": "0.9773489620908005", "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, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 83, "total_score": 103, "input": "5 5 10\n2 2\n4 5\n2 3\n5 5\n2 4\n1 4\n5 1\n5 1\n3 5\n1 1\n", "actual_output": "2 5\n6\n", "expected_output": "6\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " from collections import defaultdict\n n,m,k=map(int,input().split())\n points=set()\n row=defaultdict(int)\n col=defaultdict(int)\n for i in range(k):\n a,b=map(int,input().split())\n points.add((a,b))\n row[a]+=1\n col[b]+=1\n m1=max(row.values())\n m2=max(col.values())\n l1=[]\n l2=[]\n for i in row:\n if row[i]==m1:\n l1.append(i)\n for i in col:\n if col[i]==m2:\n l2.append(i)\n ans=m2+m1-1\n for i in l1:\n for j in l2:\n if (i,j) not in points:\n- print(i,j)\n+ \n ans+=1\n print(ans)\n quit()\n print(ans)\n \n \n \n", "FL_content": " from collections import defaultdict\n n,m,k=map(int,input().split())\n points=set()\n row=defaultdict(int)\n col=defaultdict(int)\n for i in range(k):\n a,b=map(int,input().split())\n points.add((a,b))\n row[a]+=1\n col[b]+=1\n m1=max(row.values())\n m2=max(col.values())\n l1=[]\n l2=[]\n for i in row:\n if row[i]==m1:\n l1.append(i)\n for i in col:\n if col[i]==m2:\n l2.append(i)\n ans=m2+m1-1\n for i in l1:\n for j in l2:\n if (i,j) not in points:\n- print(i,j)\n ans+=1\n print(ans)\n quit()\n print(ans)\n \n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 32 }, { "user_id": "u009348313", "problem_id": "p02580", "submission1_id": "s401676318", "submission2_id": "s117393407", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,m = map(int,input().split())\nb = []\nx = [0 for _ in range(w)]\ny = [0 for _ in range(h)]\nfor i in range(m):\n bh,bw = map(int,input().split())\n bh -= 1\n bw -= 1\n b.append((bh,bw))\n x[bw] += 1\n y[bh] += 1\n\n\nmxx = max(x)\nmxy = max(y)\n\ncmxb = 0\nfor by,bx in b:\n if y[by]+x[bx] == mxx+mxy-1:\n cmxb += 1\ncmxx = 0\nfor xi in x:\n if xi == mxx:\n cmxx += 1\ncmxy = 0\nfor yi in y:\n if yi == mxy:\n cmxy += 1\n\n\nif cmxb >= cmxx*cmxy:\n print(mxx+mxy-1)\nelse:\n print(mxx+mxy)", "code2": "h,w,m = map(int,input().split())\nb = []\nx = [0 for _ in range(w)]\ny = [0 for _ in range(h)]\nfor i in range(m):\n bh,bw = map(int,input().split())\n bh -= 1\n bw -= 1\n b.append((bh,bw))\n x[bw] += 1\n y[bh] += 1\n\n\nmxx = max(x)\nmxy = max(y)\n\ncmxb = 0\nfor by,bx in b:\n if y[by]+x[bx] == mxx+mxy:\n cmxb += 1\ncmxx = 0\nfor xi in x:\n if xi == mxx:\n cmxx += 1\ncmxy = 0\nfor yi in y:\n if yi == mxy:\n cmxy += 1\n\n\nif cmxb == cmxx*cmxy:\n print(mxx+mxy-1)\nelse:\n print(mxx+mxy)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598126778", "date2": "1598127023", "bleu_score": "0.9874429853772475", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 103, "input": "5 7 10\n1 5\n4 5\n2 2\n5 5\n2 2\n5 4\n5 4\n5 1\n4 5\n2 2\n", "actual_output": "8\n", "expected_output": "7\n\n", "anno_code": ["h,w,m = map(int,input().split()) # (0): h=5, w=7, m=10\nb = [] # (1): b=[]\nx = [0 for _ in range(w)] # (2): x=[0, 0, 0, 0, 0, 0, 0]\ny = [0 for _ in range(h)] # (3): y=[0, 0, 0, 0, 0]\nfor i in range(m): # (4): i=0 (11): i=1 ... (74): NO CHANGE\n bh,bw = map(int,input().split()) # (5): bh=1, bw=5 (12): bh=4, bw=5 ... (68): bh=2, bw=2\n bh -= 1 # (6): bh=0 (13): bh=3 ... (69): bh=1\n bw -= 1 # (7): bw=4 (14): bw=4 ... (70): bw=1\n b.append((bh,bw)) # (8): b=[(0, 4)] (15): b=[(0, 4), (3, 4)] ... (71): b=[(0, 4), (3, 4), (1, 1), (4, 4), (1, 1), (4, 3), (4, 3), (4, 0), (3, 4), (1, 1)]\n x[bw] += 1 # (9): x=[0, 0, 0, 0, 1, 0, 0] (16): x=[0, 0, 0, 0, 2, 0, 0] ... (72): x=[1, 3, 0, 2, 4, 0, 0]\n y[bh] += 1 # (10): y=[1, 0, 0, 0, 0] (17): y=[1, 0, 0, 1, 0] ... (73): y=[1, 3, 0, 2, 4]\n\n\nmxx = max(x) # (75): mxx=4\nmxy = max(y) # (76): mxy=4\n\ncmxb = 0 # (77): cmxb=0\nfor by,bx in b: # (78): by=0, bx=4 (80): by=3 ... (98): NO CHANGE\n if y[by]+x[bx] == mxx+mxy-1: # (79): NO CHANGE (81): NO CHANGE ... (97): NO CHANGE\n cmxb += 1\ncmxx = 0 # (99): cmxx=0\nfor xi in x: # (100): xi=1 (102): xi=3 ... (115): NO CHANGE\n if xi == mxx: # (101): NO CHANGE (103): NO CHANGE ... (114): NO CHANGE\n cmxx += 1 # (110): cmxx=1\ncmxy = 0 # (116): cmxy=0\nfor yi in y: # (117): yi=1 (119): yi=3 ... (128): NO CHANGE\n if yi == mxy: # (118): NO CHANGE (120): NO CHANGE ... (126): NO CHANGE\n cmxy += 1 # (127): cmxy=1\n\n\nif cmxb >= cmxx*cmxy: # (129): NO CHANGE\n print(mxx+mxy-1)\nelse:\n print(mxx+mxy)"], "anno_status": [true], "diff_content": " h,w,m = map(int,input().split())\n b = []\n x = [0 for _ in range(w)]\n y = [0 for _ in range(h)]\n for i in range(m):\n bh,bw = map(int,input().split())\n bh -= 1\n bw -= 1\n b.append((bh,bw))\n x[bw] += 1\n y[bh] += 1\n \n \n mxx = max(x)\n mxy = max(y)\n \n cmxb = 0\n for by,bx in b:\n- if y[by]+x[bx] == mxx+mxy-1:\n+ if y[by]+x[bx] == mxx+mxy:\n cmxb += 1\n cmxx = 0\n for xi in x:\n if xi == mxx:\n cmxx += 1\n cmxy = 0\n for yi in y:\n if yi == mxy:\n cmxy += 1\n \n \n-if cmxb >= cmxx*cmxy:\n+if cmxb == cmxx*cmxy:\n print(mxx+mxy-1)\n else:\n print(mxx+mxy)\n", "FL_content": " h,w,m = map(int,input().split())\n b = []\n x = [0 for _ in range(w)]\n y = [0 for _ in range(h)]\n for i in range(m):\n bh,bw = map(int,input().split())\n bh -= 1\n bw -= 1\n b.append((bh,bw))\n x[bw] += 1\n y[bh] += 1\n \n \n mxx = max(x)\n mxy = max(y)\n \n cmxb = 0\n for by,bx in b:\n- if y[by]+x[bx] == mxx+mxy-1:\n cmxb += 1\n cmxx = 0\n for xi in x:\n if xi == mxx:\n cmxx += 1\n cmxy = 0\n for yi in y:\n if yi == mxy:\n cmxy += 1\n \n \n-if cmxb >= cmxx*cmxy:\n print(mxx+mxy-1)\n else:\n print(mxx+mxy)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 34 }, { "user_id": "u355853184", "problem_id": "p02580", "submission1_id": "s225191644", "submission2_id": "s238371599", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, M = map(int, input().split())\n\nH_bom = [0 for i in range(H)]\nW_bom = [0 for i in range(W)]\nbom_map = [[0 for i in range(W)] for i in range(H)]\n\nfor i in range(M):\n M_temp = list(map(int, input().split()))\n H_bom[M_temp[0]-1] += 1\n W_bom[M_temp[1]-1] += 1\n bom_map[M_temp[0]-1][M_temp[1]-1] = 1\n\n\nH_bom_max = max(H_bom)\nW_bom_max = max(W_bom)\nH_bom_line = []\nW_bom_line = []\n\nfor i in range(H):\n if H_bom[i] == H_bom_max:\n H_bom_line.append(i)\nfor i in range(W):\n if W_bom[i] == W_bom_max:\n W_bom_line.append(i)\n\nbom_check_flag = 0\n\nfor i in H_bom_line:\n for j in W_bom_line:\n if bom_map[i-1][j-1] == 1:\n print(H_bom_max + W_bom_max)\n bom_check_flag = 1\n break\nif bom_check_flag == 0:\n print(H_bom_max + W_bom_max -1)\n", "code2": "H, W, M = map(int, input().split())\n\nH_bomb = [0 for i in range(H)]\nW_bomb = [0 for i in range(W)]\nbomb_list = []\n\nfor i in range(M):\n M_temp = tuple(map(int, input().split()))\n H_bomb[M_temp[0]-1] += 1\n W_bomb[M_temp[1]-1] += 1\n bomb_list.append(M_temp)\n\n\nH_bomb_max = max(H_bomb)\nW_bomb_max = max(W_bomb)\nH_bomb_line = []\nW_bomb_line = []\n\nfor i in range(H):\n if H_bomb[i] == H_bomb_max:\n H_bomb_line.append(i)\nfor i in range(W):\n if W_bomb[i] == W_bomb_max:\n W_bomb_line.append(i)\n\nbomb_set = set(bomb_list)\nfor i in H_bomb_line:\n for j in W_bomb_line:\n if (i+1, j+1) not in bomb_set:\n print(H_bomb_max + W_bomb_max)\n exit()\nprint(H_bomb_max + W_bomb_max - 1)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598172748", "date2": "1598190493", "bleu_score": "0.7388650580040335", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0], "code1_test_score": 76, "total_score": 103, "input": "5 5 10\n2 5\n4 3\n2 3\n5 5\n2 4\n5 4\n5 1\n1 1\n4 5\n1 4\n", "actual_output": "6\n6\n", "expected_output": "5\n\n", "anno_code": ["H, W, M = map(int, input().split()) # (0): H=5, W=5, M=10\n\nH_bom = [0 for i in range(H)] # (1): H_bom=[0, 0, 0, 0, 0]\nW_bom = [0 for i in range(W)] # (2): W_bom=[0, 0, 0, 0, 0]\nbom_map = [[0 for i in range(W)] for i in range(H)] # (3): bom_map\n\nfor i in range(M): # (4): i=0 (9): i=1 ... (54): NO CHANGE\n M_temp = list(map(int, input().split())) # (5): M_temp=[2, 5] (10): M_temp=[4, 3] ... (50): M_temp=[1, 4]\n H_bom[M_temp[0]-1] += 1 # (6): H_bom=[0, 1, 0, 0, 0] (11): H_bom=[0, 1, 0, 1, 0] ... (51): H_bom=[2, 3, 0, 2, 3]\n W_bom[M_temp[1]-1] += 1 # (7): W_bom=[0, 0, 0, 0, 1] (12): W_bom=[0, 0, 1, 0, 1] ... (52): W_bom=[2, 0, 2, 3, 3]\n bom_map[M_temp[0]-1][M_temp[1]-1] = 1 # (8): bom_map (13): bom_map ... (53): bom_map\n\n\nH_bom_max = max(H_bom) # (55): H_bom_max=3\nW_bom_max = max(W_bom) # (56): W_bom_max=3\nH_bom_line = [] # (57): H_bom_line=[]\nW_bom_line = [] # (58): W_bom_line=[]\n\nfor i in range(H): # (59): i=0 (61): i=1 ... (71): NO CHANGE\n if H_bom[i] == H_bom_max: # (60): NO CHANGE (62): NO CHANGE ... (69): NO CHANGE\n H_bom_line.append(i) # (63): H_bom_line=[1] (70): H_bom_line=[1, 4]\nfor i in range(W): # (72): i=0 (74): i=1 ... (84): NO CHANGE\n if W_bom[i] == W_bom_max: # (73): NO CHANGE (75): NO CHANGE ... (82): NO CHANGE\n W_bom_line.append(i) # (80): W_bom_line=[3] (83): W_bom_line=[3, 4]\n\nbom_check_flag = 0 # (85): bom_check_flag=0\n\nfor i in H_bom_line: # (86): i=1 (94): i=4 (100): NO CHANGE\n for j in W_bom_line: # (87): j=3 (89): j=4 (95): j=3\n if bom_map[i-1][j-1] == 1: # (88): NO CHANGE (90): NO CHANGE (96): NO CHANGE\n print(H_bom_max + W_bom_max) # (91): NO CHANGE (97): NO CHANGE\n bom_check_flag = 1 # (92): bom_check_flag=1 (98): NO CHANGE\n break # (93): NO CHANGE (99): NO CHANGE\nif bom_check_flag == 0:\n print(H_bom_max + W_bom_max -1)\n"], "anno_status": [true], "diff_content": " H, W, M = map(int, input().split())\n \n-H_bom = [0 for i in range(H)]\n-W_bom = [0 for i in range(W)]\n-bom_map = [[0 for i in range(W)] for i in range(H)]\n+H_bomb = [0 for i in range(H)]\n+W_bomb = [0 for i in range(W)]\n+bomb_list = []\n \n for i in range(M):\n- M_temp = list(map(int, input().split()))\n- H_bom[M_temp[0]-1] += 1\n- W_bom[M_temp[1]-1] += 1\n- bom_map[M_temp[0]-1][M_temp[1]-1] = 1\n+ M_temp = tuple(map(int, input().split()))\n+ H_bomb[M_temp[0]-1] += 1\n+ W_bomb[M_temp[1]-1] += 1\n+ bomb_list.append(M_temp)\n \n \n-H_bom_max = max(H_bom)\n-W_bom_max = max(W_bom)\n-H_bom_line = []\n-W_bom_line = []\n+H_bomb_max = max(H_bomb)\n+W_bomb_max = max(W_bomb)\n+H_bomb_line = []\n+W_bomb_line = []\n \n for i in range(H):\n- if H_bom[i] == H_bom_max:\n- H_bom_line.append(i)\n+ if H_bomb[i] == H_bomb_max:\n+ H_bomb_line.append(i)\n for i in range(W):\n- if W_bom[i] == W_bom_max:\n- W_bom_line.append(i)\n-\n-bom_check_flag = 0\n-\n-for i in H_bom_line:\n- for j in W_bom_line:\n- if bom_map[i-1][j-1] == 1:\n- print(H_bom_max + W_bom_max)\n- bom_check_flag = 1\n- break\n-if bom_check_flag == 0:\n- print(H_bom_max + W_bom_max -1)\n+ if W_bomb[i] == W_bomb_max:\n+ W_bomb_line.append(i)\n+\n+bomb_set = set(bomb_list)\n+for i in H_bomb_line:\n+ for j in W_bomb_line:\n+ if (i+1, j+1) not in bomb_set:\n+ print(H_bomb_max + W_bomb_max)\n+ exit()\n+print(H_bomb_max + W_bomb_max - 1)\n \n", "FL_content": " H, W, M = map(int, input().split())\n \n-H_bom = [0 for i in range(H)]\n-W_bom = [0 for i in range(W)]\n-bom_map = [[0 for i in range(W)] for i in range(H)]\n \n for i in range(M):\n- M_temp = list(map(int, input().split()))\n- H_bom[M_temp[0]-1] += 1\n- W_bom[M_temp[1]-1] += 1\n- bom_map[M_temp[0]-1][M_temp[1]-1] = 1\n \n \n-H_bom_max = max(H_bom)\n-W_bom_max = max(W_bom)\n-H_bom_line = []\n-W_bom_line = []\n \n for i in range(H):\n- if H_bom[i] == H_bom_max:\n- H_bom_line.append(i)\n for i in range(W):\n- if W_bom[i] == W_bom_max:\n- W_bom_line.append(i)\n-\n-bom_check_flag = 0\n-\n-for i in H_bom_line:\n- for j in W_bom_line:\n- if bom_map[i-1][j-1] == 1:\n- print(H_bom_max + W_bom_max)\n- bom_check_flag = 1\n- break\n-if bom_check_flag == 0:\n- print(H_bom_max + W_bom_max -1)\n \n", "added_lines": 23, "removed_lines": 26, "code1_lines": 36 }, { "user_id": "u614181788", "problem_id": "p02580", "submission1_id": "s944788569", "submission2_id": "s885495690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,m = map(int,input().split())\nH = [0]*(h+1)\nW = [0]*(w+1)\ns = set([])\nfor i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n\n H[a] += 1\n W[b] += 1\n\nx = [0]*(h+1)\ny = [0]*(w+1)\n \nfor i in range(h+1):\n x[i] = [i,H[i]]\nfor i in range(w+1):\n y[i] = [i,W[i]]\n\nx.sort(key= lambda val : val[1],reverse=True)\ny.sort(key= lambda val : val[1],reverse=True)\n\nma = x[0][1]\nmb = y[0][1]\ni,j = 0,0\nsw = 0\nwhile 1:\n if (x[i][0],y[j][0]) in s:\n pass\n else:\n sw = 1\n break\n if x[i][1] + y[j][1] != ma+mb:\n break\n \n if x[i+1][1] != ma:\n j += 1\n i = 0\n else:\n i += 1\nprint(ma+mb+sw-1)\n", "code2": "import time\n\nt0 = time.time()\n\nh,w,m = map(int,input().split())\nH = [0]*(h+1)\nW = [0]*(w+1)\ns = set([])\nfor i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n\n H[a] += 1\n W[b] += 1\n\nx = [0]*(h+1)\ny = [0]*(w+1)\n \nfor i in range(h+1):\n x[i] = [i,H[i]]\nfor i in range(w+1):\n y[i] = [i,W[i]]\n\nx.sort(key= lambda val : val[1],reverse=True)\ny.sort(key= lambda val : val[1],reverse=True)\n\nma = x[0][1]\nmb = y[0][1]\n\ni,j = 0,0\nsw = 0\nwhile 1:\n if j > w:\n break\n if x[i][1] == ma:\n if (x[i][0],y[j][0]) in s:\n pass\n else:\n if x[i][1]+y[j][1] == ma+mb:\n sw = 1\n break\n i += 1\n else:\n i = 0\n j += 1\n if time.time() - t0 > 2.5:\n break\n\n \nprint(ma+mb+sw-1)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598129857", "date2": "1598131985", "bleu_score": "0.8227137081096867", "code1_test_status": [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, 1, 1, 1, 1, 0, 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, 1, 1, 0, 0, 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, 0, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "5 7 10\n1 5\n4 5\n2 2\n5 5\n2 2\n5 4\n5 4\n5 1\n4 5\n2 2\n", "actual_output": "8\n", "expected_output": "7\n\n", "anno_code": ["h,w,m = map(int,input().split()) # (0): h=5, w=7, m=10\nH = [0]*(h+1) # (1): H=[0, 0, 0, 0, 0, 0]\nW = [0]*(w+1) # (2): W=[0, 0, 0, 0, 0, 0, 0, 0]\ns = set([]) # (3): s=set()\nfor i in range(m): # (4): i=0 (9): i=1 ... (54): NO CHANGE\n a,b = map(int,input().split()) # (5): a=1, b=5 (10): a=4 ... (50): a=2, b=2\n s.add((a,b)) # (6): s={(1, 5)} (11): s={(4, 5), (1, 5)} ... (51): NO CHANGE\n\n H[a] += 1 # (7): H=[0, 1, 0, 0, 0, 0] (12): H=[0, 1, 0, 0, 1, 0] ... (52): H=[0, 1, 3, 0, 2, 4]\n W[b] += 1 # (8): W=[0, 0, 0, 0, 0, 1, 0, 0] (13): W=[0, 0, 0, 0, 0, 2, 0, 0] ... (53): W=[0, 1, 3, 0, 2, 4, 0, 0]\n\nx = [0]*(h+1) # (55): x=[0, 0, 0, 0, 0, 0]\ny = [0]*(w+1) # (56): y=[0, 0, 0, 0, 0, 0, 0, 0]\n \nfor i in range(h+1): # (57): i=0 (59): i=1, x ... (69): NO CHANGE\n x[i] = [i,H[i]] # (58): x (60): x ... (68): x\nfor i in range(w+1): # (70): i=0 (72): i=1, y ... (86): NO CHANGE\n y[i] = [i,W[i]] # (71): y (73): y ... (85): y\n\nx.sort(key= lambda val : val[1],reverse=True) # (87): x\ny.sort(key= lambda val : val[1],reverse=True) # (88): y\n\nma = x[0][1] # (89): ma=4\nmb = y[0][1] # (90): mb=4\ni,j = 0,0 # (91): i=0, j=0\nsw = 0 # (92): sw=0\nwhile 1: # (93): NO CHANGE (100): NO CHANGE\n if (x[i][0],y[j][0]) in s: # (94): NO CHANGE (101): NO CHANGE\n pass # (95): NO CHANGE\n else:\n sw = 1 # (102): sw=1\n break # (103): NO CHANGE\n if x[i][1] + y[j][1] != ma+mb: # (96): NO CHANGE\n break\n \n if x[i+1][1] != ma: # (97): NO CHANGE\n j += 1 # (98): j=1\n i = 0 # (99): NO CHANGE\n else:\n i += 1\nprint(ma+mb+sw-1)\n"], "anno_status": [true], "diff_content": "+import time\n+\n+t0 = time.time()\n+\n h,w,m = map(int,input().split())\n H = [0]*(h+1)\n W = [0]*(w+1)\n s = set([])\n for i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n \n H[a] += 1\n W[b] += 1\n \n x = [0]*(h+1)\n y = [0]*(w+1)\n \n for i in range(h+1):\n x[i] = [i,H[i]]\n for i in range(w+1):\n y[i] = [i,W[i]]\n \n x.sort(key= lambda val : val[1],reverse=True)\n y.sort(key= lambda val : val[1],reverse=True)\n \n ma = x[0][1]\n mb = y[0][1]\n+\n i,j = 0,0\n sw = 0\n while 1:\n- if (x[i][0],y[j][0]) in s:\n- pass\n- else:\n- sw = 1\n+ if j > w:\n break\n- if x[i][1] + y[j][1] != ma+mb:\n+ if x[i][1] == ma:\n+ if (x[i][0],y[j][0]) in s:\n+ pass\n+ else:\n+ if x[i][1]+y[j][1] == ma+mb:\n+ sw = 1\n+ break\n+ i += 1\n+ else:\n+ i = 0\n+ j += 1\n+ if time.time() - t0 > 2.5:\n break\n+\n \n- if x[i+1][1] != ma:\n- j += 1\n- i = 0\n- else:\n- i += 1\n print(ma+mb+sw-1)\n \n", "FL_content": " h,w,m = map(int,input().split())\n H = [0]*(h+1)\n W = [0]*(w+1)\n s = set([])\n for i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n \n H[a] += 1\n W[b] += 1\n \n x = [0]*(h+1)\n y = [0]*(w+1)\n \n for i in range(h+1):\n x[i] = [i,H[i]]\n for i in range(w+1):\n y[i] = [i,W[i]]\n \n x.sort(key= lambda val : val[1],reverse=True)\n y.sort(key= lambda val : val[1],reverse=True)\n \n ma = x[0][1]\n mb = y[0][1]\n i,j = 0,0\n sw = 0\n while 1:\n- if (x[i][0],y[j][0]) in s:\n- pass\n- else:\n- sw = 1\n break\n- if x[i][1] + y[j][1] != ma+mb:\n break\n \n- if x[i+1][1] != ma:\n- j += 1\n- i = 0\n- else:\n- i += 1\n print(ma+mb+sw-1)\n \n", "added_lines": 19, "removed_lines": 10, "code1_lines": 42 }, { "user_id": "u161164709", "problem_id": "p02580", "submission1_id": "s251761174", "submission2_id": "s124360360", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nh, w, m = map(int, input().split())\nhw_array = [list(map(int, input().split())) for _ in range(m)]\n\nh_array = [0]*h\nw_array = [0]*w\n\nfor hw in hw_array:\n h, w = hw\n h_array[h - 1] += 1\n w_array[w - 1] += 1\n\nh_max = max(h_array)\nh_argmax_array = [i for i in h_array if i == h_max]\nw_max = max(w_array)\nw_argmax_array = [j for j in w_array if j == w_max]\n\nflag = False\nfor h_argmax in h_argmax_array:\n for w_argmax in w_argmax_array:\n if not [h_argmax + 1, w_argmax + 1] in hw_array:\n flag = True\n break\n\nans = h_max + w_max\nif not flag:\n ans -= 1\n\nprint(ans)", "code2": "\n\nh, w, m = map(int, input().split())\nhw_array = [list(map(int, input().split())) for _ in range(m)]\n\nh_array = [0]*h\nw_array = [0]*w\n\nfor hw in hw_array:\n h, w = hw\n h_array[h - 1] += 1\n w_array[w - 1] += 1\n\nh_max = max(h_array)\nh_argmax_array = [True if i == h_max else False for i in h_array]\nw_max = max(w_array)\nw_argmax_array = [True if j == w_max else False for j in w_array]\n\ncomb = sum(h_argmax_array) * sum(w_argmax_array)\nfor hw in hw_array:\n h, w = hw\n if h_argmax_array[h - 1] and w_argmax_array[w - 1]:\n comb -= 1\nans = h_max + w_max\nif comb == 0:\n ans -= 1\n\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598136695", "date2": "1598138456", "bleu_score": "0.8253481736784867", "code1_test_status": [0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 103, "input": "2 3 3\n2 2\n1 1\n1 2\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["\n\nh, w, m = map(int, input().split()) # (0): h=2, w=3, m=3\nhw_array = [list(map(int, input().split())) for _ in range(m)] # (1): hw_array\n\nh_array = [0]*h # (2): h_array=[0, 0]\nw_array = [0]*w # (3): w_array=[0, 0, 0]\n\nfor hw in hw_array: # (4): hw=[2, 2] (8): hw=[1, 1] ... (16): NO CHANGE\n h, w = hw # (5): w=2 (9): h=1, w=1 (13): w=2\n h_array[h - 1] += 1 # (6): h_array=[0, 1] (10): h_array=[1, 1] (14): h_array=[2, 1]\n w_array[w - 1] += 1 # (7): w_array=[0, 1, 0] (11): w_array=[1, 1, 0] (15): w_array=[1, 2, 0]\n\nh_max = max(h_array) # (17): h_max=2\nh_argmax_array = [i for i in h_array if i == h_max] # (18): h_argmax_array=[2]\nw_max = max(w_array) # (19): w_max=2\nw_argmax_array = [j for j in w_array if j == w_max] # (20): w_argmax_array=[2]\n\nflag = False # (21): flag=False\nfor h_argmax in h_argmax_array: # (22): h_argmax=2 (27): NO CHANGE\n for w_argmax in w_argmax_array: # (23): w_argmax=2\n if not [h_argmax + 1, w_argmax + 1] in hw_array: # (24): NO CHANGE\n flag = True # (25): flag=True\n break # (26): NO CHANGE\n\nans = h_max + w_max # (28): ans=4\nif not flag: # (29): NO CHANGE\n ans -= 1\n\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n h, w, m = map(int, input().split())\n hw_array = [list(map(int, input().split())) for _ in range(m)]\n \n h_array = [0]*h\n w_array = [0]*w\n \n for hw in hw_array:\n h, w = hw\n h_array[h - 1] += 1\n w_array[w - 1] += 1\n \n h_max = max(h_array)\n-h_argmax_array = [i for i in h_array if i == h_max]\n+h_argmax_array = [True if i == h_max else False for i in h_array]\n w_max = max(w_array)\n-w_argmax_array = [j for j in w_array if j == w_max]\n-\n-flag = False\n-for h_argmax in h_argmax_array:\n- for w_argmax in w_argmax_array:\n- if not [h_argmax + 1, w_argmax + 1] in hw_array:\n- flag = True\n- break\n+w_argmax_array = [True if j == w_max else False for j in w_array]\n \n+comb = sum(h_argmax_array) * sum(w_argmax_array)\n+for hw in hw_array:\n+ h, w = hw\n+ if h_argmax_array[h - 1] and w_argmax_array[w - 1]:\n+ comb -= 1\n ans = h_max + w_max\n-if not flag:\n+if comb == 0:\n ans -= 1\n \n print(ans)\n", "FL_content": " \n \n h, w, m = map(int, input().split())\n hw_array = [list(map(int, input().split())) for _ in range(m)]\n \n h_array = [0]*h\n w_array = [0]*w\n \n for hw in hw_array:\n h, w = hw\n h_array[h - 1] += 1\n w_array[w - 1] += 1\n \n h_max = max(h_array)\n-h_argmax_array = [i for i in h_array if i == h_max]\n w_max = max(w_array)\n-w_argmax_array = [j for j in w_array if j == w_max]\n-\n-flag = False\n-for h_argmax in h_argmax_array:\n- for w_argmax in w_argmax_array:\n- if not [h_argmax + 1, w_argmax + 1] in hw_array:\n- flag = True\n- break\n \n ans = h_max + w_max\n-if not flag:\n ans -= 1\n \n print(ans)\n", "added_lines": 8, "removed_lines": 10, "code1_lines": 30 }, { "user_id": "u614181788", "problem_id": "p02580", "submission1_id": "s930355994", "submission2_id": "s885495690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,m = map(int,input().split())\nH = [0]*(h+1)\nW = [0]*(w+1)\ns = set([])\nfor i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n\n H[a] += 1\n W[b] += 1\n\nx = [0]*(h+1)\ny = [0]*(w+1)\n \nfor i in range(h+1):\n x[i] = [i,H[i]]\nfor i in range(w+1):\n y[i] = [i,W[i]]\n\nx.sort(key= lambda val : val[1],reverse=True)\ny.sort(key= lambda val : val[1],reverse=True)\n\nma = x[0][1]\nmb = y[0][1]\n\ni,j = 0,0\nsw = 0\n\nxx = x.count(ma)\nyy = y.count(mb)\n\nfor i in range(xx):\n for j in range(yy):\n if (x[i][0],y[j][0]) not in s:\n sw = 1\n break \nprint(ma+mb+sw-1)\n", "code2": "import time\n\nt0 = time.time()\n\nh,w,m = map(int,input().split())\nH = [0]*(h+1)\nW = [0]*(w+1)\ns = set([])\nfor i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n\n H[a] += 1\n W[b] += 1\n\nx = [0]*(h+1)\ny = [0]*(w+1)\n \nfor i in range(h+1):\n x[i] = [i,H[i]]\nfor i in range(w+1):\n y[i] = [i,W[i]]\n\nx.sort(key= lambda val : val[1],reverse=True)\ny.sort(key= lambda val : val[1],reverse=True)\n\nma = x[0][1]\nmb = y[0][1]\n\ni,j = 0,0\nsw = 0\nwhile 1:\n if j > w:\n break\n if x[i][1] == ma:\n if (x[i][0],y[j][0]) in s:\n pass\n else:\n if x[i][1]+y[j][1] == ma+mb:\n sw = 1\n break\n i += 1\n else:\n i = 0\n j += 1\n if time.time() - t0 > 2.5:\n break\n\n \nprint(ma+mb+sw-1)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598131527", "date2": "1598131985", "bleu_score": "0.6781458481566867", "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, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 83, "total_score": 103, "input": "5 5 10\n2 2\n4 5\n2 3\n5 5\n2 4\n1 4\n5 1\n5 1\n3 5\n1 4\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["h,w,m = map(int,input().split()) # (0): h=5, w=5, m=10\nH = [0]*(h+1) # (1): H=[0, 0, 0, 0, 0, 0]\nW = [0]*(w+1) # (2): W=[0, 0, 0, 0, 0, 0]\ns = set([]) # (3): s=set()\nfor i in range(m): # (4): i=0 (9): i=1 ... (54): NO CHANGE\n a,b = map(int,input().split()) # (5): a=2, b=2 (10): a=4, b=5 ... (50): a=1, b=4\n s.add((a,b)) # (6): s={(2, 2)} (11): s={(4, 5), (2, 2)} ... (51): NO CHANGE\n\n H[a] += 1 # (7): H=[0, 0, 1, 0, 0, 0] (12): H=[0, 0, 1, 0, 1, 0] ... (52): H=[0, 2, 3, 1, 1, 3]\n W[b] += 1 # (8): W=[0, 0, 1, 0, 0, 0] (13): W=[0, 0, 1, 0, 0, 1] ... (53): W=[0, 2, 1, 1, 3, 3]\n\nx = [0]*(h+1) # (55): x=[0, 0, 0, 0, 0, 0]\ny = [0]*(w+1) # (56): y=[0, 0, 0, 0, 0, 0]\n \nfor i in range(h+1): # (57): i=0 (59): i=1, x ... (69): NO CHANGE\n x[i] = [i,H[i]] # (58): x (60): x ... (68): x\nfor i in range(w+1): # (70): i=0 (72): i=1, y ... (82): NO CHANGE\n y[i] = [i,W[i]] # (71): y (73): y ... (81): y\n\nx.sort(key= lambda val : val[1],reverse=True) # (83): x\ny.sort(key= lambda val : val[1],reverse=True) # (84): y\n\nma = x[0][1] # (85): ma=3\nmb = y[0][1] # (86): mb=3\n\ni,j = 0,0 # (87): i=0, j=0\nsw = 0 # (88): sw=0\n\nxx = x.count(ma) # (89): xx=0\nyy = y.count(mb) # (90): yy=0\n\nfor i in range(xx): # (91): NO CHANGE\n for j in range(yy):\n if (x[i][0],y[j][0]) not in s:\n sw = 1\n break \nprint(ma+mb+sw-1)\n"], "anno_status": [true], "diff_content": "+import time\n+\n+t0 = time.time()\n+\n h,w,m = map(int,input().split())\n H = [0]*(h+1)\n W = [0]*(w+1)\n s = set([])\n for i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n \n H[a] += 1\n W[b] += 1\n \n x = [0]*(h+1)\n y = [0]*(w+1)\n \n for i in range(h+1):\n x[i] = [i,H[i]]\n for i in range(w+1):\n y[i] = [i,W[i]]\n \n x.sort(key= lambda val : val[1],reverse=True)\n y.sort(key= lambda val : val[1],reverse=True)\n \n ma = x[0][1]\n mb = y[0][1]\n \n i,j = 0,0\n sw = 0\n+while 1:\n+ if j > w:\n+ break\n+ if x[i][1] == ma:\n+ if (x[i][0],y[j][0]) in s:\n+ pass\n+ else:\n+ if x[i][1]+y[j][1] == ma+mb:\n+ sw = 1\n+ break\n+ i += 1\n+ else:\n+ i = 0\n+ j += 1\n+ if time.time() - t0 > 2.5:\n+ break\n \n-xx = x.count(ma)\n-yy = y.count(mb)\n-\n-for i in range(xx):\n- for j in range(yy):\n- if (x[i][0],y[j][0]) not in s:\n- sw = 1\n- break \n+ \n print(ma+mb+sw-1)\n \n", "FL_content": " h,w,m = map(int,input().split())\n H = [0]*(h+1)\n W = [0]*(w+1)\n s = set([])\n for i in range(m):\n a,b = map(int,input().split())\n s.add((a,b))\n \n H[a] += 1\n W[b] += 1\n \n x = [0]*(h+1)\n y = [0]*(w+1)\n \n for i in range(h+1):\n x[i] = [i,H[i]]\n for i in range(w+1):\n y[i] = [i,W[i]]\n \n x.sort(key= lambda val : val[1],reverse=True)\n y.sort(key= lambda val : val[1],reverse=True)\n \n ma = x[0][1]\n mb = y[0][1]\n \n i,j = 0,0\n sw = 0\n \n-xx = x.count(ma)\n-yy = y.count(mb)\n-\n-for i in range(xx):\n- for j in range(yy):\n- if (x[i][0],y[j][0]) not in s:\n- sw = 1\n- break \n print(ma+mb+sw-1)\n \n", "added_lines": 21, "removed_lines": 8, "code1_lines": 38 }, { "user_id": "u559315737", "problem_id": "p02580", "submission1_id": "s152544099", "submission2_id": "s392614476", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\nrow=defaultdict(int)\ncol=defaultdict(int)\nH,W,M=map(int,input().split())\n\nmatrix=defaultdict(bool)\nfor i in range(M):\n h,w=map(int,input().split())\n row[h-1]+=1\n col[w-1]+=1\n matrix[(h-1,w-1)]=True\n\n\n\n\ntemp=list(row.items())\ntemp.sort(key=lambda x:x[1])\na,b=temp[-1][0],temp[-1][1]\ncnt=0\nfor i in range(W):\n temp=0\n if matrix[(a,i)]:\n temp=(b+col[i]-1)\n else:\n temp=(b+col[i])\n cnt=max(cnt,temp)\n\ntemp=list(col.items())\ntemp.sort(key=lambda x:x[1])\na,b=temp[-1][0],temp[-1][1]\ncnt2=0\nfor i in range(H):\n temp=0\n if matrix[(a,i)]:\n temp=(b+row[i]-1)\n else:\n temp=(b+row[i])\n cnt2=max(cnt2,temp)\nprint(max(cnt,cnt2))", "code2": "from collections import defaultdict\nrow=defaultdict(int)\ncol=defaultdict(int)\nH,W,M=map(int,input().split())\n\nmatrix=defaultdict(bool)\nfor i in range(M):\n h,w=map(int,input().split())\n row[h-1]+=1\n col[w-1]+=1\n matrix[(h-1,w-1)]=True\n\n\n\n\ntemp=list(row.items())\ntemp.sort(key=lambda x:x[1])\na,b=temp[-1][0],temp[-1][1]\ncnt=0\nfor i in range(W):\n temp=0\n if matrix[(a,i)]:\n temp=(b+col[i]-1)\n else:\n temp=(b+col[i])\n cnt=max(cnt,temp)\n\ntemp=list(col.items())\ntemp.sort(key=lambda x:x[1])\na,b=temp[-1][0],temp[-1][1]\ncnt2=0\nfor i in range(H):\n temp=0\n if matrix[(i,a)]:\n temp=(b+row[i]-1)\n else:\n temp=(b+row[i])\n cnt2=max(cnt2,temp)\nprint(max(cnt,cnt2))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598128157", "date2": "1598128285", "bleu_score": "0.9947270096812301", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 73, "total_score": 103, "input": "5 10 10\n2 5\n4 5\n2 3\n5 5\n2 4\n5 4\n5 1\n1 1\n4 5\n1 4\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["from collections import defaultdict\nrow=defaultdict(int) # (0): row=defaultdict(, {})\ncol=defaultdict(int) # (1): col=defaultdict(, {})\nH,W,M=map(int,input().split()) # (2): H=5, W=10, M=10\n\nmatrix=defaultdict(bool) # (3): matrix=defaultdict(, {})\nfor i in range(M): # (4): i=0 (9): i=1 ... (54): NO CHANGE\n h,w=map(int,input().split()) # (5): h=2, w=5 (10): h=4 ... (50): h=1, w=4\n row[h-1]+=1 # (6): row=defaultdict(, {1: 1}) (11): row=defaultdict(, {1: 1, 3: 1}) ... (51): row=defaultdict(, {1: 3, 3: 2, 4: 3, 0: 2})\n col[w-1]+=1 # (7): col=defaultdict(, {4: 1}) (12): col=defaultdict(, {4: 2}) ... (52): col=defaultdict(, {4: 4, 2: 1, 3: 3, 0: 2})\n matrix[(h-1,w-1)]=True # (8): matrix=defaultdict(, {(1, 4): True}) (13): matrix=defaultdict(, {(1, 4): True, (3, 4): True}) ... (53): matrix=defaultdict(, {(1, 4): True, (3, 4): True, (1, 2): True, (4, 4): True, (1, 3): True, (4, 3): True, (4, 0): True, (0, 0): True, (0, 3): True})\n\n\n\n\ntemp=list(row.items()) # (55): temp=[(1, 3), (3, 2), (4, 3), (0, 2)]\ntemp.sort(key=lambda x:x[1]) # (56): temp=[(3, 2), (0, 2), (1, 3), (4, 3)]\na,b=temp[-1][0],temp[-1][1] # (57): a=4, b=3\ncnt=0 # (58): cnt=0\nfor i in range(W): # (59): i=0 (64): i=1 ... (109): NO CHANGE\n temp=0 # (60): temp=0 (65): temp=0 ... (105): temp=0\n if matrix[(a,i)]: # (61): NO CHANGE (66): matrix=defaultdict(, {(1, 4): True, (3, 4): True, (1, 2): True, (4, 4): True, (1, 3): True, (4, 3): True, (4, 0): True, (0, 0): True, (0, 3): True, (4, 1): False}) ... (106): matrix=defaultdict(, {(1, 4): True, (3, 4): True, (1, 2): True, (4, 4): True, (1, 3): True, (4, 3): True, (4, 0): True, (0, 0): True, (0, 3): True, (4, 1): False, (4, 2): False, (4, 5): False, (4, 6): False, (4, 7): False, (4, 8): False, (4, 9): False})\n temp=(b+col[i]-1) # (62): temp=4 (77): temp=5 (82): temp=6\n else:\n temp=(b+col[i]) # (67): col=defaultdict(, {4: 4, 2: 1, 3: 3, 0: 2, 1: 0}), temp=3 (72): temp=4 ... (107): col=defaultdict(, {4: 4, 2: 1, 3: 3, 0: 2, 1: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0}), temp=3\n cnt=max(cnt,temp) # (63): cnt=4 (68): NO CHANGE ... (108): NO CHANGE\n\ntemp=list(col.items()) # (110): temp=[(4, 4), (2, 1), (3, 3), (0, 2), (1, 0), (5, 0), (6, 0), (7, 0), (8, 0), (9, 0)]\ntemp.sort(key=lambda x:x[1]) # (111): temp=[(1, 0), (5, 0), (6, 0), (7, 0), (8, 0), (9, 0), (2, 1), (0, 2), (3, 3), (4, 4)]\na,b=temp[-1][0],temp[-1][1] # (112): b=4\ncnt2=0 # (113): cnt2=0\nfor i in range(H): # (114): i=0 (119): i=1 ... (139): NO CHANGE\n temp=0 # (115): temp=0 (120): temp=0 ... (135): temp=0\n if matrix[(a,i)]: # (116): NO CHANGE (121): NO CHANGE ... (136): NO CHANGE\n temp=(b+row[i]-1) # (117): temp=5 (132): temp=5 (137): temp=6\n else:\n temp=(b+row[i]) # (122): temp=7 (127): row=defaultdict(, {1: 3, 3: 2, 4: 3, 0: 2, 2: 0}), temp=4\n cnt2=max(cnt2,temp) # (118): cnt2=5 (123): cnt2=7 ... (138): NO CHANGE\nprint(max(cnt,cnt2))"], "anno_status": [false], "diff_content": " from collections import defaultdict\n row=defaultdict(int)\n col=defaultdict(int)\n H,W,M=map(int,input().split())\n \n matrix=defaultdict(bool)\n for i in range(M):\n h,w=map(int,input().split())\n row[h-1]+=1\n col[w-1]+=1\n matrix[(h-1,w-1)]=True\n \n \n \n \n temp=list(row.items())\n temp.sort(key=lambda x:x[1])\n a,b=temp[-1][0],temp[-1][1]\n cnt=0\n for i in range(W):\n temp=0\n if matrix[(a,i)]:\n temp=(b+col[i]-1)\n else:\n temp=(b+col[i])\n cnt=max(cnt,temp)\n \n temp=list(col.items())\n temp.sort(key=lambda x:x[1])\n a,b=temp[-1][0],temp[-1][1]\n cnt2=0\n for i in range(H):\n temp=0\n- if matrix[(a,i)]:\n+ if matrix[(i,a)]:\n temp=(b+row[i]-1)\n else:\n temp=(b+row[i])\n cnt2=max(cnt2,temp)\n print(max(cnt,cnt2))\n", "FL_content": " from collections import defaultdict\n row=defaultdict(int)\n col=defaultdict(int)\n H,W,M=map(int,input().split())\n \n matrix=defaultdict(bool)\n for i in range(M):\n h,w=map(int,input().split())\n row[h-1]+=1\n col[w-1]+=1\n matrix[(h-1,w-1)]=True\n \n \n \n \n temp=list(row.items())\n temp.sort(key=lambda x:x[1])\n a,b=temp[-1][0],temp[-1][1]\n cnt=0\n for i in range(W):\n temp=0\n if matrix[(a,i)]:\n temp=(b+col[i]-1)\n else:\n temp=(b+col[i])\n cnt=max(cnt,temp)\n \n temp=list(col.items())\n temp.sort(key=lambda x:x[1])\n a,b=temp[-1][0],temp[-1][1]\n cnt2=0\n for i in range(H):\n temp=0\n- if matrix[(a,i)]:\n temp=(b+row[i]-1)\n else:\n temp=(b+row[i])\n cnt2=max(cnt2,temp)\n print(max(cnt,cnt2))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 39 }, { "user_id": "u433532588", "problem_id": "p02922", "submission1_id": "s675601682", "submission2_id": "s800685279", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**6)\n\n\nA, B = map(int, input().split())\n\nif A == B:\n print(1)\n exit()\n\ncount = 1\nB -= A\nwhile True:\n count += 1\n if A > B:\n print(count)\n exit()\n\n B -= A", "code2": "\n\nimport sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**6)\n\n\nA, B = map(int, input().split())\n\nif B == 1:\n print(0)\n exit()\n\nif A >= B:\n print(1)\n exit()\n\ncount = 2\nB -= (A-1)\nwhile True:\n if A >= B:\n print(count)\n exit()\n\n count += 1\n B -= (A-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567369325", "date2": "1567370870", "bleu_score": "0.8163837362547096", "code1_test_status": [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, 1, 0, 0, 1, 1, 1, 1], "code1_test_score": 8, "total_score": 32, "input": "2 50\n", "actual_output": "26\n", "expected_output": "49\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " \n \n import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10**6)\n \n \n A, B = map(int, input().split())\n \n-if A == B:\n+if B == 1:\n+ print(0)\n+ exit()\n+\n+if A >= B:\n print(1)\n exit()\n \n-count = 1\n-B -= A\n+count = 2\n+B -= (A-1)\n while True:\n- count += 1\n- if A > B:\n+ if A >= B:\n print(count)\n exit()\n \n- B -= A\n+ count += 1\n+ B -= (A-1)\n+\n", "FL_content": " \n \n import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10**6)\n \n \n A, B = map(int, input().split())\n \n-if A == B:\n print(1)\n exit()\n \n-count = 1\n-B -= A\n while True:\n- count += 1\n- if A > B:\n print(count)\n exit()\n \n- B -= A\n", "added_lines": 11, "removed_lines": 6, "code1_lines": 22 }, { "user_id": "u188745744", "problem_id": "p02922", "submission1_id": "s772451444", "submission2_id": "s505910442", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nA = list(map(int,input().split(\" \")))\nB = math.ceil(A[1] / A[0])\nprint(B)", "code2": "import math\nA,B = list(map(int,input().split(\" \")))\nprint(math.ceil((B-1) / (A-1)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577734055", "date2": "1578060267", "bleu_score": "0.7805082813680227", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 9, "total_score": 32, "input": "2 27\n", "actual_output": "14\n", "expected_output": "26\n\n", "anno_code": ["import math\nA = list(map(int,input().split(\" \"))) # (0): A=[2, 27]\nB = math.ceil(A[1] / A[0]) # (1): B=14\nprint(B)"], "anno_status": [true], "diff_content": " import math\n-A = list(map(int,input().split(\" \")))\n-B = math.ceil(A[1] / A[0])\n-print(B)\n+A,B = list(map(int,input().split(\" \")))\n+print(math.ceil((B-1) / (A-1)))\n", "FL_content": " import math\n-A = list(map(int,input().split(\" \")))\n-B = math.ceil(A[1] / A[0])\n-print(B)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 4 }, { "user_id": "u318042557", "problem_id": "p02922", "submission1_id": "s643369443", "submission2_id": "s925226212", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\nsum = 0\ni = 1\nif B != 1:\n sum = A\n while sum < B:\n sum += (A-1)*i\n i += 1\n print(i)\nelse:\n print(0)", "code2": "A, B = map(int, input().split())\nsum = 0\ni = 1\nif B != 1:\n while sum < B:\n sum = A + (A-1)*(i-1)\n i += 1\n print(i-1)\nelse:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567365783", "date2": "1567366865", "bleu_score": "0.9002725089431144", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 10, "total_score": 32, "input": "2 50\n", "actual_output": "11\n", "expected_output": "49\n\n", "anno_code": ["A, B = map(int, input().split()) # (0): A=2, B=50\nsum = 0 # (1): sum=0\ni = 1 # (2): i=1\nif B != 1: # (3): NO CHANGE\n sum = A # (4): sum=2\n while sum < B: # (5): NO CHANGE (8): NO CHANGE ... (35): NO CHANGE\n sum += (A-1)*i # (6): sum=3 (9): sum=5 ... (33): sum=57\n i += 1 # (7): i=2 (10): i=3 ... (34): i=11\n print(i)\nelse:\n print(0)"], "anno_status": [true], "diff_content": " A, B = map(int, input().split())\n sum = 0\n i = 1\n if B != 1:\n- sum = A\n while sum < B:\n- sum += (A-1)*i\n+ sum = A + (A-1)*(i-1)\n i += 1\n- print(i)\n+ print(i-1)\n else:\n print(0)\n", "FL_content": " A, B = map(int, input().split())\n sum = 0\n i = 1\n if B != 1:\n- sum = A\n while sum < B:\n- sum += (A-1)*i\n i += 1\n- print(i)\n else:\n print(0)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u639989198", "problem_id": "p02922", "submission1_id": "s293526598", "submission2_id": "s076166684", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\na, c = 0, 1\nwhile c < B:\n c += A\n a += 1\nprint(a)", "code2": "A, B = map(int, input().split())\na, c = 0, 1\nwhile c < B:\n c += A - 1\n a += 1\nprint(a)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570952925", "date2": "1570952968", "bleu_score": "0.9361374222844416", "code1_test_status": [0, 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, 1, 1, 1, 0, 1, 0], "code1_test_score": 7, "total_score": 32, "input": "4 16\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["A, B = map(int, input().split()) # (0): A=4, B=16\na, c = 0, 1 # (1): a=0, c=1\nwhile c < B: # (2): NO CHANGE (5): NO CHANGE ... (14): NO CHANGE\n c += A # (3): c=5 (6): c=9 ... (12): c=17\n a += 1 # (4): a=1 (7): a=2 ... (13): a=4\nprint(a)"], "anno_status": [true], "diff_content": " A, B = map(int, input().split())\n a, c = 0, 1\n while c < B:\n- c += A\n+ c += A - 1\n a += 1\n print(a)\n", "FL_content": " A, B = map(int, input().split())\n a, c = 0, 1\n while c < B:\n- c += A\n a += 1\n print(a)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u441320782", "problem_id": "p02922", "submission1_id": "s620128204", "submission2_id": "s506165992", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B=map(int,input().split())\ncount = 0\ntotal = 0\nif B==1:\n print(0)\nelse:\n while True:\n total += A\n count += 1\n if total>=B:\n break\n total -= 1\n print(count)", "code2": "A,B=map(int,input().split())\ncount = 0\ntotal = 0\nif B==1:\n print(0)\nelse:\n while True:\n total += A\n count += 1\n if total>=B:\n break\n total -= 1\n print(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574116193", "date2": "1574116478", "bleu_score": "0.9887641638186618", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 9, "total_score": 32, "input": "3 34\n", "actual_output": "12\n", "expected_output": "17\n\n", "anno_code": ["A,B=map(int,input().split()) # (0): A=3, B=34\ncount = 0 # (1): count=0\ntotal = 0 # (2): total=0\nif B==1: # (3): NO CHANGE\n print(0)\nelse:\n while True: # (4): NO CHANGE (8): NO CHANGE ... (48): NO CHANGE\n total += A # (5): total=3 (9): total=6 ... (49): total=36\n count += 1 # (6): count=1 (10): count=2 ... (50): count=12\n if total>=B: # (7): NO CHANGE (11): NO CHANGE ... (51): NO CHANGE\n break # (52): NO CHANGE\n total -= 1\n print(count)"], "anno_status": [true], "diff_content": " A,B=map(int,input().split())\n count = 0\n total = 0\n if B==1:\n print(0)\n else:\n while True:\n total += A\n count += 1\n if total>=B:\n break\n- total -= 1\n+ total -= 1\n print(count)\n", "FL_content": " A,B=map(int,input().split())\n count = 0\n total = 0\n if B==1:\n print(0)\n else:\n while True:\n total += A\n count += 1\n if total>=B:\n break\n- total -= 1\n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u979126665", "problem_id": "p02922", "submission1_id": "s209182264", "submission2_id": "s950041119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split(\" \"))\nk = 1\nwhile (a * k + 1) < b:\n k +=1\nprint(k)", "code2": "a,b = map(int,input().split(\" \"))\nk = 0\nwhile ((a-1) * k + 1) < b:\n k +=1\nprint(k)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580785466", "date2": "1580785816", "bleu_score": "0.8999152716796783", "code1_test_status": [0, 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, 1, 1, 1, 0, 1, 0], "code1_test_score": 7, "total_score": 32, "input": "2 50\n", "actual_output": "25\n", "expected_output": "49\n\n", "anno_code": ["a,b = map(int,input().split(\" \")) # (0): a=2, b=50\nk = 1 # (1): k=1\nwhile (a * k + 1) < b: # (2): NO CHANGE (4): NO CHANGE ... (50): NO CHANGE\n k +=1 # (3): k=2 (5): k=3 ... (49): k=25\nprint(k)"], "anno_status": [true], "diff_content": " a,b = map(int,input().split(\" \"))\n-k = 1\n-while (a * k + 1) < b:\n+k = 0\n+while ((a-1) * k + 1) < b:\n k +=1\n print(k)\n", "FL_content": " a,b = map(int,input().split(\" \"))\n-k = 1\n-while (a * k + 1) < b:\n k +=1\n print(k)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u732412551", "problem_id": "p02922", "submission1_id": "s550109421", "submission2_id": "s502157589", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import ceil\nA, B = map(int, input().split())\nprint(ceil(B/A))", "code2": "from math import ceil\nA, B = map(int, input().split())\nprint(ceil((B - 1)/(A - 1)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576176778", "date2": "1576177102", "bleu_score": "0.8120760102201895", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 9, "total_score": 32, "input": "3 59\n", "actual_output": "20\n", "expected_output": "29\n\n", "anno_code": ["from math import ceil\nA, B = map(int, input().split()) # (0): A=3, B=59\nprint(ceil(B/A))"], "anno_status": [true], "diff_content": " from math import ceil\n A, B = map(int, input().split())\n-print(ceil(B/A))\n+print(ceil((B - 1)/(A - 1)))\n", "FL_content": " from math import ceil\n A, B = map(int, input().split())\n-print(ceil(B/A))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u611352758", "problem_id": "p02922", "submission1_id": "s087084286", "submission2_id": "s754550261", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\nnum = a\nfor i in range(50):\n if num > b:\n break\n else:\n num -= 1\n num += a\nprint(i+1)", "code2": "a, b = map(int, input().split())\nif b == 1:\n print(0)\n exit(0)\nnum = a\nc = 1\nwhile True:\n if num >= b:\n break\n else:\n num += a-1\n c += 1\nprint(c)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593125515", "date2": "1593128279", "bleu_score": "0.6498969782946495", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 15, "total_score": 32, "input": "3 31\n", "actual_output": "16\n", "expected_output": "15\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=3, b=31\nnum = a # (1): num=3\nfor i in range(50): # (2): i=0 (6): i=1 ... (62): i=15\n if num > b: # (3): NO CHANGE (7): NO CHANGE ... (63): NO CHANGE\n break # (64): NO CHANGE\n else:\n num -= 1 # (4): num=2 (8): num=4 ... (60): num=30\n num += a # (5): num=5 (9): num=7 ... (61): num=33\nprint(i+1)"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n+if b == 1:\n+ print(0)\n+ exit(0)\n num = a\n-for i in range(50):\n- if num > b:\n+c = 1\n+while True:\n+ if num >= b:\n break\n else:\n- num -= 1\n- num += a\n-print(i+1)\n+ num += a-1\n+ c += 1\n+print(c)\n", "FL_content": " a, b = map(int, input().split())\n num = a\n-for i in range(50):\n- if num > b:\n break\n else:\n- num -= 1\n- num += a\n-print(i+1)\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 9 }, { "user_id": "u366939485", "problem_id": "p02922", "submission1_id": "s524697124", "submission2_id": "s720329713", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = (int(i) for i in input().split())\ncount = 0\nwhile True:\n b -= a\n count += 1\n if b <= 0: break\n b -= 1\nprint(count)", "code2": "a, b = (int(i) for i in input().split())\ncount = 0\nif b == 1:\n print(\"0\")\n exit()\nwhile True:\n b -= a\n count += 1\n if b <= 0: break\n b += 1\nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599588240", "date2": "1599589834", "bleu_score": "0.7609310880626453", "code1_test_status": [0, 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, 1, 1, 1, 0, 1, 1], "code1_test_score": 8, "total_score": 32, "input": "3 79\n", "actual_output": "20\n", "expected_output": "39\n\n", "anno_code": ["a, b = (int(i) for i in input().split()) # (0): a=3, b=79\ncount = 0 # (1): count=0\nwhile True: # (2): NO CHANGE (7): NO CHANGE ... (97): NO CHANGE\n b -= a # (3): b=76 (8): b=72 ... (98): b=0\n count += 1 # (4): count=1 (9): count=2 ... (99): count=20\n if b <= 0: break # (5): NO CHANGE (10): NO CHANGE ... (100): NO CHANGE\n b -= 1 # (6): b=75 (11): b=71 ... (96): b=3\nprint(count)"], "anno_status": [true], "diff_content": " a, b = (int(i) for i in input().split())\n count = 0\n+if b == 1:\n+ print(\"0\")\n+ exit()\n while True:\n b -= a\n count += 1\n if b <= 0: break\n- b -= 1\n+ b += 1\n print(count)\n", "FL_content": " a, b = (int(i) for i in input().split())\n count = 0\n while True:\n b -= a\n count += 1\n if b <= 0: break\n- b -= 1\n print(count)\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u112317104", "problem_id": "p02922", "submission1_id": "s133553051", "submission2_id": "s086917293", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve():\n N, M = map(int, input().split())\n\n c = 0\n if M == 1:\n return c\n\n c += 1\n if N >= M:\n return c\n \n M -= N\n for i in range(2, 100):\n if M - N <= 0:\n return i\n M -= (N-1)\n\nprint(solve())", "code2": "def solve():\n N, M = map(int, input().split())\n\n if M == 1:\n return 0\n \n \n diff = N-1\n sum = N\n c = 1\n while sum < M:\n sum += diff\n c += 1\n return c\n\nprint(solve())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581210203", "date2": "1581210583", "bleu_score": "0.6503453231968839", "code1_test_status": [0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 17, "total_score": 32, "input": "2 46\n", "actual_output": "44\n", "expected_output": "45\n\n", "anno_code": ["def solve(): # (0): solve=\n N, M = map(int, input().split()) # (2): N=2, M=46\n\n c = 0 # (3): c=0\n if M == 1: # (4): NO CHANGE\n return c\n\n c += 1 # (5): c=1\n if N >= M: # (6): NO CHANGE\n return c\n \n M -= N # (7): M=44\n for i in range(2, 100): # (8): i=2 (11): i=3 ... (134): i=44\n if M - N <= 0: # (9): NO CHANGE (12): NO CHANGE ... (132): NO CHANGE\n return i\n M -= (N-1) # (10): M=43 (13): M=42 ... (133): M=2\n\nprint(solve()) # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def solve():\n N, M = map(int, input().split())\n \n- c = 0\n if M == 1:\n- return c\n-\n- c += 1\n- if N >= M:\n- return c\n+ return 0\n+ \n \n- M -= N\n- for i in range(2, 100):\n- if M - N <= 0:\n- return i\n- M -= (N-1)\n+ diff = N-1\n+ sum = N\n+ c = 1\n+ while sum < M:\n+ sum += diff\n+ c += 1\n+ return c\n \n print(solve())\n", "FL_content": " def solve():\n N, M = map(int, input().split())\n \n- c = 0\n if M == 1:\n- return c\n-\n- c += 1\n- if N >= M:\n- return c\n \n- M -= N\n- for i in range(2, 100):\n- if M - N <= 0:\n- return i\n- M -= (N-1)\n \n print(solve())\n", "added_lines": 9, "removed_lines": 11, "code1_lines": 18 }, { "user_id": "u652656291", "problem_id": "p02922", "submission1_id": "s248903927", "submission2_id": "s720816337", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split())\nc = 1 + (a-1)\nans = 0\nif c <= b:\n ans += 1\n c += (a-1)\nprint(ans)\n ", "code2": "a,b = map(int,input().split())\nc = 1 \nans = 0\nwhile c < b:\n c += a-1\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586896554", "date2": "1586897231", "bleu_score": "0.7672998742586786", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 32, "input": "3 41\n", "actual_output": "1\n", "expected_output": "20\n\n", "anno_code": ["a,b = map(int,input().split()) # (0): a=3, b=41\nc = 1 + (a-1) # (1): c=3\nans = 0 # (2): ans=0\nif c <= b: # (3): NO CHANGE\n ans += 1 # (4): ans=1\n c += (a-1) # (5): c=5\nprint(ans)\n "], "anno_status": [true], "diff_content": " a,b = map(int,input().split())\n-c = 1 + (a-1)\n+c = 1 \n ans = 0\n-if c <= b:\n+while c < b:\n+ c += a-1\n ans += 1\n- c += (a-1)\n print(ans)\n- \n", "FL_content": " a,b = map(int,input().split())\n-c = 1 + (a-1)\n ans = 0\n-if c <= b:\n ans += 1\n- c += (a-1)\n print(ans)\n- \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 8 }, { "user_id": "u241159583", "problem_id": "p02922", "submission1_id": "s638117601", "submission2_id": "s480217029", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\n\nif b - a == 1:\n print(2)\nelse:\n print(round((b-1)/(a-1)))", "code2": "a, b = map(int, input().split())\n\nif (b - a) % (a - 1) == 0:\n print(round((b - a) / (a - 1) + 1))\nelse:\n print(round((b - a) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571395137", "date2": "1571405562", "bleu_score": "0.6102174838746748", "code1_test_status": [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, 0, 1, 0, 0, 1, 1, 1], "code1_test_score": 26, "total_score": 32, "input": "4 8\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=4, b=8\n\nif b - a == 1: # (1): NO CHANGE\n print(2)\nelse:\n print(round((b-1)/(a-1)))"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n \n-if b - a == 1:\n- print(2)\n+if (b - a) % (a - 1) == 0:\n+ print(round((b - a) / (a - 1) + 1))\n else:\n- print(round((b-1)/(a-1)))\n+ print(round((b - a) \n", "FL_content": " a, b = map(int, input().split())\n \n-if b - a == 1:\n- print(2)\n else:\n- print(round((b-1)/(a-1)))\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u020798319", "problem_id": "p02922", "submission1_id": "s705916248", "submission2_id": "s407370836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split())\nsum = a\ncount = 1\nwhile sum < b :\n sum += a\n count += 1\nprint (count)", "code2": "a,b = map(int,input().split())\nsum = 1\ncount = 0\nwhile sum < b :\n sum += a - 1\n count += 1\nprint (count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593698722", "date2": "1593699024", "bleu_score": "0.9154571500965012", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 9, "total_score": 32, "input": "2 13\n", "actual_output": "7\n", "expected_output": "12\n\n", "anno_code": ["a,b = map(int,input().split()) # (0): a=2, b=13\nsum = a # (1): sum=2\ncount = 1 # (2): count=1\nwhile sum < b : # (3): NO CHANGE (6): NO CHANGE ... (21): NO CHANGE\n sum += a # (4): sum=4 (7): sum=6 ... (19): sum=14\n count += 1 # (5): count=2 (8): count=3 ... (20): count=7\nprint (count)"], "anno_status": [true], "diff_content": " a,b = map(int,input().split())\n-sum = a\n-count = 1\n+sum = 1\n+count = 0\n while sum < b :\n- sum += a\n+ sum += a - 1\n count += 1\n print (count)\n", "FL_content": " a,b = map(int,input().split())\n-sum = a\n-count = 1\n while sum < b :\n- sum += a\n count += 1\n print (count)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u834832056", "problem_id": "p02922", "submission1_id": "s953641343", "submission2_id": "s064682194", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\na, b = map(int, input().split(' '))\n\nprint(math.ceil(b / a))\n", "code2": "import math\n\na, b = map(int, input().split(' '))\n\nprint(math.ceil((b - 1) / (a - 1)))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598876683", "date2": "1598876964", "bleu_score": "0.8121900529589829", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 9, "total_score": 32, "input": "2 45\n", "actual_output": "23\n", "expected_output": "44\n\n", "anno_code": ["import math\n\na, b = map(int, input().split(' ')) # (0): a=2, b=45\n\nprint(math.ceil(b / a))\n"], "anno_status": [true], "diff_content": " import math\n \n a, b = map(int, input().split(' '))\n \n-print(math.ceil(b / a))\n+print(math.ceil((b - 1) / (a - 1)))\n \n", "FL_content": " import math\n \n a, b = map(int, input().split(' '))\n \n-print(math.ceil(b / a))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u510630535", "problem_id": "p02922", "submission1_id": "s885212911", "submission2_id": "s837695854", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n a, b = map(int, input().split())\n ret = 0\n if b > 1:\n n, m = divmod(b, a)\n ret = n + (1 if m > 0 else 0)\n print(ret)\n\n\nif __name__ == '__main__':\n resolve()", "code2": "def resolve():\n a, b = map(int, input().split())\n ret = 0\n if b > 1:\n from math import ceil\n ret = ceil((b - 1) / (a - 1))\n print(ret)\n\n\nif __name__ == '__main__':\n resolve()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593016797", "date2": "1593017124", "bleu_score": "0.8063577004195444", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 9, "total_score": 32, "input": "3 41\n", "actual_output": "14\n", "expected_output": "20\n\n", "anno_code": ["def resolve(): # (0): resolve=\n a, b = map(int, input().split())\n ret = 0\n if b > 1:\n n, m = divmod(b, a)\n ret = n + (1 if m > 0 else 0)\n print(ret)\n\n\nif __name__ == '__main__':\n resolve()"], "anno_status": [true], "diff_content": " def resolve():\n a, b = map(int, input().split())\n ret = 0\n if b > 1:\n- n, m = divmod(b, a)\n- ret = n + (1 if m > 0 else 0)\n+ from math import ceil\n+ ret = ceil((b - 1) / (a - 1))\n print(ret)\n \n \n if __name__ == '__main__':\n resolve()\n", "FL_content": " def resolve():\n a, b = map(int, input().split())\n ret = 0\n if b > 1:\n- n, m = divmod(b, a)\n- ret = n + (1 if m > 0 else 0)\n print(ret)\n \n \n if __name__ == '__main__':\n resolve()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u197038614", "problem_id": "p02922", "submission1_id": "s733909107", "submission2_id": "s299322090", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\n\nif a >= b:\n print(1)\n exit()\n \nx = 2 * a - 1\n\nfor i in range(2, a + 1):\n if x >= b:\n print(i)\n exit()\n x = x + a - 1\n", "code2": "a, b = map(int, input().split())\n\nif b <= 1:\n print(0)\n exit()\n\nx = a\n\nfor i in range(1, 100000):\n if x >= b:\n print(i)\n exit()\n x = x + a - 1\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567364986", "date2": "1567366616", "bleu_score": "0.8214610865732306", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 11, "total_score": 32, "input": "2 36\n", "actual_output": "no output\n", "expected_output": "35\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=2, b=36\n\nif a >= b: # (1): NO CHANGE\n print(1)\n exit()\n \nx = 2 * a - 1 # (2): x=3\n\nfor i in range(2, a + 1): # (3): i=2\n if x >= b: # (4): NO CHANGE\n print(i)\n exit()\n x = x + a - 1 # (5): x=4\n"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n \n-if a >= b:\n- print(1)\n+if b <= 1:\n+ print(0)\n exit()\n- \n-x = 2 * a - 1\n \n-for i in range(2, a + 1):\n+x = a\n+\n+for i in range(1, 100000):\n if x >= b:\n print(i)\n exit()\n x = x + a - 1\n \n", "FL_content": " a, b = map(int, input().split())\n \n-if a >= b:\n- print(1)\n exit()\n- \n-x = 2 * a - 1\n \n-for i in range(2, a + 1):\n if x >= b:\n print(i)\n exit()\n x = x + a - 1\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 14 }, { "user_id": "u411353821", "problem_id": "p02922", "submission1_id": "s871152411", "submission2_id": "s956440949", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(A, B), = [list(map(int, s.split())) for s in open(0)]\nif A >= B:\n print(1)\nelse:\n if (B - A)%(A - 1) == 0:\n print(int((B - A)/(A - 1) + 1))\n else:\n t = (B - A)\n while A + (A - 1)*(t - 1) < B:\n t += 1\n print(int(t))", "code2": "(A, B), = [list(map(int, s.split())) for s in open(0)]\n\nif B == 1:\n print(0)\nelif A >= B:\n print(1)\nelse:\n cnt = 1\n while True:\n if B <= A + (A - 1)*(cnt - 1):\n break\n cnt += 1\n print(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576617231", "date2": "1576618300", "bleu_score": "0.6908323032040258", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1], "code1_test_score": 23, "total_score": 32, "input": "5 20\n", "actual_output": "15\n", "expected_output": "5\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " (A, B), = [list(map(int, s.split())) for s in open(0)]\n-if A >= B:\n+\n+if B == 1:\n+ print(0)\n+elif A >= B:\n print(1)\n else:\n- if (B - A)%(A - 1) == 0:\n- print(int((B - A)/(A - 1) + 1))\n- else:\n- t = (B - A)\n- while A + (A - 1)*(t - 1) < B:\n- t += 1\n- print(int(t))\n+ cnt = 1\n+ while True:\n+ if B <= A + (A - 1)*(cnt - 1):\n+ break\n+ cnt += 1\n+ print(cnt)\n", "FL_content": " (A, B), = [list(map(int, s.split())) for s in open(0)]\n-if A >= B:\n print(1)\n else:\n- if (B - A)%(A - 1) == 0:\n- print(int((B - A)/(A - 1) + 1))\n- else:\n- t = (B - A)\n- while A + (A - 1)*(t - 1) < B:\n- t += 1\n- print(int(t))\n", "added_lines": 10, "removed_lines": 8, "code1_lines": 11 }, { "user_id": "u667024514", "problem_id": "p02922", "submission1_id": "s613269513", "submission2_id": "s527321154", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\na,b = map(int,input().split())\nprint(math.ceil(a/b))", "code2": "import math\na,b = map(int,input().split())\nprint(math.ceil((b-a)/(a-1))+1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567365279", "date2": "1567365847", "bleu_score": "0.805121532677653", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 32, "input": "4 16\n", "actual_output": "1\n", "expected_output": "5\n\n", "anno_code": ["import math\na,b = map(int,input().split()) # (0): a=4, b=16\nprint(math.ceil(a/b))"], "anno_status": [true], "diff_content": " import math\n a,b = map(int,input().split())\n-print(math.ceil(a/b))\n+print(math.ceil((b-a)/(a-1))+1)\n+\n", "FL_content": " import math\n a,b = map(int,input().split())\n-print(math.ceil(a/b))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u611090896", "problem_id": "p02922", "submission1_id": "s261376288", "submission2_id": "s085379335", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nA,B = map(int,input().split())\nprint(math.ceil(B/A))", "code2": "import math\nA,B = map(int,input().split())\nprint(1+math.ceil((B-A)/(A-1)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590174325", "date2": "1590174567", "bleu_score": "0.797914008180643", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 9, "total_score": 32, "input": "2 29\n", "actual_output": "15\n", "expected_output": "28\n\n", "anno_code": ["import math\nA,B = map(int,input().split()) # (0): A=2, B=29\nprint(math.ceil(B/A))"], "anno_status": [true], "diff_content": " import math\n A,B = map(int,input().split())\n-print(math.ceil(B/A))\n+print(1+math.ceil((B-A)/(A-1)))\n", "FL_content": " import math\n A,B = map(int,input().split())\n-print(math.ceil(B/A))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u757777793", "problem_id": "p02922", "submission1_id": "s328986562", "submission2_id": "s103090449", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split())\nc = b \nif ((b > 1) and (b < a)) or (a==b):\n print(1)\nelif b == 1:\n print(0)\nelse:\n print(c + 1)", "code2": "a,b = map(int,input().split())\nsum = 1\nif ((b > 1) and (b < a)):\n print(1)\nelif b == 1:\n print(0)\nelse:\n b = b - a\n while 0 < b:\n b = b - (a-1)\n sum=sum+1\n print(sum)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567367588", "date2": "1567368614", "bleu_score": "0.6042007980925669", "code1_test_status": [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, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 32, "input": "2 36\n", "actual_output": "37\n", "expected_output": "35\n\n", "anno_code": ["a,b = map(int,input().split()) # (0): a=2, b=36\nc = b # (1): c=36\nif ((b > 1) and (b < a)) or (a==b): # (2): NO CHANGE\n print(1)\nelif b == 1: # (3): NO CHANGE\n print(0)\nelse:\n print(c + 1)"], "anno_status": [true], "diff_content": " a,b = map(int,input().split())\n-c = b \n-if ((b > 1) and (b < a)) or (a==b):\n+sum = 1\n+if ((b > 1) and (b < a)):\n print(1)\n elif b == 1:\n print(0)\n else:\n- print(c + 1)\n+ b = b - a\n+ while 0 < b:\n+ b = b - (a-1)\n+ sum=sum+1\n+ print(sum)\n", "FL_content": " a,b = map(int,input().split())\n-c = b \n-if ((b > 1) and (b < a)) or (a==b):\n print(1)\n elif b == 1:\n print(0)\n else:\n- print(c + 1)\n", "added_lines": 7, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u328733599", "problem_id": "p00006", "submission1_id": "s455234194", "submission2_id": "s288933385", "status1": "Wrong Answer", "status2": "Accepted", "code1": "txt = input(\"\")\nfor i in range(0,len(txt)):\n print(txt[(len(txt)-i-1)],end=\"\")\n print()\n", "code2": "txt = input(\"\")\nfor i in range(0,len(txt)):\n print(txt[(len(txt)-i-1)],end=\"\")\nprint()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528445047", "date2": "1528445308", "bleu_score": "0.9709669619572224", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "o5yf`o3m\n", "actual_output": "m\n3\no\n`\nf\ny\n5\no\n", "expected_output": "m3o`fy5o\n\n", "anno_code": ["txt = input(\"\") # (0): txt=o5yf`o3m\nfor i in range(0,len(txt)): # (1): i=0 (4): i=1 ... (22): i=7\n print(txt[(len(txt)-i-1)],end=\"\") # (2): NO CHANGE (5): NO CHANGE ... (23): NO CHANGE\n print() # (3): NO CHANGE (6): NO CHANGE ... (24): NO CHANGE\n"], "anno_status": [true], "diff_content": " txt = input(\"\")\n for i in range(0,len(txt)):\n print(txt[(len(txt)-i-1)],end=\"\")\n- print()\n+print()\n \n", "FL_content": " txt = input(\"\")\n for i in range(0,len(txt)):\n print(txt[(len(txt)-i-1)],end=\"\")\n- print()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u542645301", "problem_id": "p00006", "submission1_id": "s607480231", "submission2_id": "s420802892", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(input()[::-3])", "code2": "print(input()[::-1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1479479839", "date2": "1479479857", "bleu_score": "0.8739351325046804", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "rf5xno3a\n", "actual_output": "anf\n", "expected_output": "a3onx5fr\n\n", "anno_code": ["print(input()[::-3])"], "anno_status": [true], "diff_content": "-print(input()[::-3])\n+print(input()[::-1])\n", "FL_content": "-print(input()[::-3])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u742505495", "problem_id": "p00006", "submission1_id": "s677927315", "submission2_id": "s416598460", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nimport sys\n\nlines = input()\nprint(lines[0:len(lines)-1:-1])", "code2": "import math\nimport sys\n\nlines = input()\nprint(lines[::-1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1507705216", "date2": "1507705297", "bleu_score": "0.7666619759270109", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "o3o5mzfa\n", "actual_output": "no output\n", "expected_output": "afzm5o3o\n\n", "anno_code": ["import math\nimport sys\n\nlines = input() # (0): lines=o3o5mzfa\nprint(lines[0:len(lines)-1:-1])"], "anno_status": [true], "diff_content": " import math\n import sys\n \n lines = input()\n-print(lines[0:len(lines)-1:-1])\n+print(lines[::-1])\n", "FL_content": " import math\n import sys\n \n lines = input()\n-print(lines[0:len(lines)-1:-1])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u114860785", "problem_id": "p00006", "submission1_id": "s963627881", "submission2_id": "s703888402", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(input()[-1])\n", "code2": "print(input()[::-1])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559541497", "date2": "1559541740", "bleu_score": "0.8137489370974955", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "nx44alcl\n", "actual_output": "l\n", "expected_output": "lcla44xn\n\n", "anno_code": ["print(input()[-1])\n"], "anno_status": [true], "diff_content": "-print(input()[-1])\n+print(input()[::-1])\n \n", "FL_content": "-print(input()[-1])\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u609881501", "problem_id": "p00006", "submission1_id": "s211364098", "submission2_id": "s142608424", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nprint(sys.stdin.readline()[:-1:-1])", "code2": "import sys\nstr = sys.stdin.readline()[:-1]\nprint(str[::-1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1450272638", "date2": "1450272959", "bleu_score": "0.7187163556395807", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "m5ny`fn4\n", "actual_output": "no output\n", "expected_output": "4nf`yn5m\n\n", "anno_code": ["import sys\nprint(sys.stdin.readline()[:-1:-1])"], "anno_status": [true], "diff_content": " import sys\n-print(sys.stdin.readline()[:-1:-1])\n+str = sys.stdin.readline()[:-1]\n+print(str[::-1])\n", "FL_content": " import sys\n-print(sys.stdin.readline()[:-1:-1])\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u177398299", "problem_id": "p03326", "submission1_id": "s418779009", "submission2_id": "s740472392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\ncake = [list(map(int, input().split())) for _ in range(N)]\n\nINF = 10 ** 18\ndp = [[[-INF] * 8 for _ in range(M + 1)] for _ in range(N + 1)]\nfor i in range(8):\n dp[0][0][i] = 0\n\nfor i in range(1, N + 1):\n x, y, z = cake[i - 1]\n for j in range(M, 0, -1):\n for msk in range(8):\n mx = x * (1 - 2 * (msk >> 2 & 1))\n my = y * (1 - 2 * (msk >> 1 & 1))\n mz = z * (1 - 2 * (msk >> 0 & 1))\n dp[i][j][msk] = max(dp[i - 1][j][msk],\n dp[i - 1][j - 1][msk] + mx + my + mz)\n\nprint(max(dp[N][M][i] for i in range(8)))", "code2": "N, M = map(int, input().split())\ncake = [list(map(int, input().split())) for _ in range(N)]\n\nINF = 10 ** 18\ndp = [[[-INF] * 8 for _ in range(M + 1)] for _ in range(N + 1)]\nfor i in range(N + 1):\n for msk in range(8):\n dp[i][0][msk] = 0\n\nfor i in range(1, N + 1):\n x, y, z = cake[i - 1]\n for j in range(1, M + 1):\n for msk in range(8):\n mx = x * (1 - 2 * (msk >> 2 & 1))\n my = y * (1 - 2 * (msk >> 1 & 1))\n mz = z * (1 - 2 * (msk >> 0 & 1))\n dp[i][j][msk] = max(dp[i - 1][j][msk],\n dp[i - 1][j - 1][msk] + mx + my + mz)\n\nprint(max(dp[N][M][i] for i in range(8)))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1539552271", "date2": "1539552768", "bleu_score": "0.9296085484459372", "code1_test_status": [1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 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, 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, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 67, "total_score": 104, "input": "10 0\n-1 -252 15\n33 11 1\n-94 45 1\n0 -1 8\n-123 60 656\n-17 -195 -24\n-26 0 4\n42 24 -34\n26 -17 5\n-6 18 82\n", "actual_output": "-1000000000000000000\n", "expected_output": "0\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=10, M=0\ncake = [list(map(int, input().split())) for _ in range(N)] # (1): cake\n\nINF = 10 ** 18 # (2): INF=1000000000000000000\ndp = [[[-INF] * 8 for _ in range(M + 1)] for _ in range(N + 1)] # (3): dp\nfor i in range(8): # (4): i=0 (6): i=1 ... (20): NO CHANGE\n dp[0][0][i] = 0 # (5): dp (7): dp ... (19): dp\n\nfor i in range(1, N + 1): # (21): i=1 (24): i=2 ... (51): NO CHANGE\n x, y, z = cake[i - 1] # (22): x=-1, y=-252, z=15 (25): x=33, y=11, z=1 ... (49): x=-6, y=18, z=82\n for j in range(M, 0, -1): # (23): NO CHANGE (26): NO CHANGE ... (50): NO CHANGE\n for msk in range(8):\n mx = x * (1 - 2 * (msk >> 2 & 1))\n my = y * (1 - 2 * (msk >> 1 & 1))\n mz = z * (1 - 2 * (msk >> 0 & 1))\n dp[i][j][msk] = max(dp[i - 1][j][msk],\n dp[i - 1][j - 1][msk] + mx + my + mz)\n\nprint(max(dp[N][M][i] for i in range(8)))"], "anno_status": [false], "diff_content": " N, M = map(int, input().split())\n cake = [list(map(int, input().split())) for _ in range(N)]\n \n INF = 10 ** 18\n dp = [[[-INF] * 8 for _ in range(M + 1)] for _ in range(N + 1)]\n-for i in range(8):\n- dp[0][0][i] = 0\n+for i in range(N + 1):\n+ for msk in range(8):\n+ dp[i][0][msk] = 0\n \n for i in range(1, N + 1):\n x, y, z = cake[i - 1]\n- for j in range(M, 0, -1):\n+ for j in range(1, M + 1):\n for msk in range(8):\n mx = x * (1 - 2 * (msk >> 2 & 1))\n my = y * (1 - 2 * (msk >> 1 & 1))\n mz = z * (1 - 2 * (msk >> 0 & 1))\n dp[i][j][msk] = max(dp[i - 1][j][msk],\n dp[i - 1][j - 1][msk] + mx + my + mz)\n \n print(max(dp[N][M][i] for i in range(8)))\n", "FL_content": " N, M = map(int, input().split())\n cake = [list(map(int, input().split())) for _ in range(N)]\n \n INF = 10 ** 18\n dp = [[[-INF] * 8 for _ in range(M + 1)] for _ in range(N + 1)]\n-for i in range(8):\n- dp[0][0][i] = 0\n \n for i in range(1, N + 1):\n x, y, z = cake[i - 1]\n- for j in range(M, 0, -1):\n for msk in range(8):\n mx = x * (1 - 2 * (msk >> 2 & 1))\n my = y * (1 - 2 * (msk >> 1 & 1))\n mz = z * (1 - 2 * (msk >> 0 & 1))\n dp[i][j][msk] = max(dp[i - 1][j][msk],\n dp[i - 1][j - 1][msk] + mx + my + mz)\n \n print(max(dp[N][M][i] for i in range(8)))\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u393512980", "problem_id": "p03326", "submission1_id": "s568910407", "submission2_id": "s220454770", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nxyz = [None] * N\nfor i in range(N):\n _x, _y, _z = map(int, input().split())\n xyz[i] = [_x, _y, _z]\nans = 0\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n sx, sy, sz = (-1)**i, (-1)**j, (-1)**k\n xyz.sort(key = lambda v : -(sx * v[0] + sy * v[1] + sz * v[2]))\n X, Y, Z = 0, 0, 0\n for i in range(M):\n X += xyz[i][0]\n Y += xyz[i][1]\n Z += xyz[i][2]\n ans = max(ans, abs(X) + abs(Y) + abs(Z))\nprint(ans)", "code2": "from itertools import product\nimport sys\ndef input():\n return sys.stdin.readline()[:-1]\nN, M = map(int, input().split())\nxyz = [None] * N\nfor i in range(N):\n _x, _y, _z = map(int, input().split())\n xyz[i] = [_x, _y, _z]\nans = 0\nfor i, j, k in product([0, 1], repeat=3):\n sx, sy, sz = (-1)**i, (-1)**j, (-1)**k\n xyz.sort(key = lambda v : -(sx * v[0] + sy * v[1] + sz * v[2]))\n X, Y, Z = 0, 0, 0\n for i in range(M):\n X += xyz[i][0]\n Y += xyz[i][1]\n Z += xyz[i][2]\n ans = max(ans, abs(X) + abs(Y) + abs(Z))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562050128", "date2": "1562818570", "bleu_score": "0.8077994311353053", "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, 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, 0, 0, 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], "code1_test_score": 96, "total_score": 104, "input": "10 5\n10 -80 21\n23 16 3\n-94 0 1\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-87 -8 48\n21 65 -25\n25 -140 87\n-62 18 82\n", "actual_output": "646\n", "expected_output": "657\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "+from itertools import product\n import sys\n-input = sys.stdin.readline\n-\n+def input():\n+ return sys.stdin.readline()[:-1]\n N, M = map(int, input().split())\n xyz = [None] * N\n for i in range(N):\n _x, _y, _z = map(int, input().split())\n xyz[i] = [_x, _y, _z]\n ans = 0\n-for i in range(2):\n- for j in range(2):\n- for k in range(2):\n- sx, sy, sz = (-1)**i, (-1)**j, (-1)**k\n- xyz.sort(key = lambda v : -(sx * v[0] + sy * v[1] + sz * v[2]))\n- X, Y, Z = 0, 0, 0\n- for i in range(M):\n- X += xyz[i][0]\n- Y += xyz[i][1]\n- Z += xyz[i][2]\n- ans = max(ans, abs(X) + abs(Y) + abs(Z))\n+for i, j, k in product([0, 1], repeat=3):\n+ sx, sy, sz = (-1)**i, (-1)**j, (-1)**k\n+ xyz.sort(key = lambda v : -(sx * v[0] + sy * v[1] + sz * v[2]))\n+ X, Y, Z = 0, 0, 0\n+ for i in range(M):\n+ X += xyz[i][0]\n+ Y += xyz[i][1]\n+ Z += xyz[i][2]\n+ ans = max(ans, abs(X) + abs(Y) + abs(Z))\n print(ans)\n+\n", "FL_content": " import sys\n-input = sys.stdin.readline\n-\n N, M = map(int, input().split())\n xyz = [None] * N\n for i in range(N):\n _x, _y, _z = map(int, input().split())\n xyz[i] = [_x, _y, _z]\n ans = 0\n-for i in range(2):\n- for j in range(2):\n- for k in range(2):\n- sx, sy, sz = (-1)**i, (-1)**j, (-1)**k\n- xyz.sort(key = lambda v : -(sx * v[0] + sy * v[1] + sz * v[2]))\n- X, Y, Z = 0, 0, 0\n- for i in range(M):\n- X += xyz[i][0]\n- Y += xyz[i][1]\n- Z += xyz[i][2]\n- ans = max(ans, abs(X) + abs(Y) + abs(Z))\n print(ans)\n", "added_lines": 13, "removed_lines": 13, "code1_lines": 21 }, { "user_id": "u050024609", "problem_id": "p03326", "submission1_id": "s663557269", "submission2_id": "s422990489", "status1": "Wrong Answer", "status2": "Accepted", "code1": "[N, M] = map(int, input().split())\na = [list(map(int, input().split())) for i in range(N)]\ndef value(xyz, sign):\n\treturn sum([xyz[i]*(1 - 2*((sign & (1 << i)) >> i)) for i in range(3)])\nprint(max([sum([value(a[i], sign) for i in sorted([i for i in range(N)], key = lambda index : value(a[index], sign))[-M:]]) for sign in range(8)]))\n", "code2": "[N, M] = map(int, input().split())\na = [list(map(int, input().split())) for i in range(N)]\ndef value(xyz, sign):\n\treturn sum([xyz[i]*(1 - 2*((sign & (1 << i)) >> i)) for i in range(3)])\nprint(0 if M == 0 else max([sum([value(a[j], sign) for j in sorted([i for i in range(N)], key = lambda index : value(a[index], sign))[-M:]]) for sign in range(8)]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570065179", "date2": "1570065294", "bleu_score": "0.9339007747560036", "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, 0, 1, 1, 1, 1, 1, 1, 1, 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": "10 0\n-1 -252 15\n33 11 1\n-94 45 1\n0 -1 8\n-123 60 656\n-17 -195 -24\n-26 0 4\n42 24 -34\n26 -17 5\n-6 18 82\n", "actual_output": "1187\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " [N, M] = map(int, input().split())\n a = [list(map(int, input().split())) for i in range(N)]\n def value(xyz, sign):\n \treturn sum([xyz[i]*(1 - 2*((sign & (1 << i)) >> i)) for i in range(3)])\n-print(max([sum([value(a[i], sign) for i in sorted([i for i in range(N)], key = lambda index : value(a[index], sign))[-M:]]) for sign in range(8)]))\n-\n+print(0 if M == 0 else max([sum([value(a[j], sign) for j in sorted([i for i in range(N)], key = lambda index : value(a[index], sign))[-M:]]) for sign in range(8)]))\n", "FL_content": " [N, M] = map(int, input().split())\n a = [list(map(int, input().split())) for i in range(N)]\n def value(xyz, sign):\n \treturn sum([xyz[i]*(1 - 2*((sign & (1 << i)) >> i)) for i in range(3)])\n-print(max([sum([value(a[i], sign) for i in sorted([i for i in range(N)], key = lambda index : value(a[index], sign))[-M:]]) for sign in range(8)]))\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u570944601", "problem_id": "p03326", "submission1_id": "s923978206", "submission2_id": "s066298471", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int, input().split())\nx = [tuple(map(int, input().split())) for _ in range(n)]\nfrom itertools import *\nres = 0\nfor a in product([-1, 1], [-1, 1], [-1, 1]):\n res = max(res, sum(sorted((max(0, sum(i*j for i,j in zip(a,t))) for t in x),reverse=True)[:m]))\nprint(res)", "code2": "n,m = map(int, input().split())\nx = [tuple(map(int, input().split())) for _ in range(n)]\nfrom itertools import *\nres = 0\nfor a in product([-1, 1], [-1, 1], [-1, 1]):\n res = max(res, sum(sorted((sum(i*j for i,j in zip(a,t)) for t in x),reverse=True)[:m]))\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529403943", "date2": "1529404028", "bleu_score": "0.9639141820098048", "code1_test_status": [0, 1, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 78, "total_score": 104, "input": "10 8\n1 -80 11\n10 12 6\n-3 45 2\n-1 -1 7\n-57 118 159\n-12 -79 -54\n-26 2 6\n21 65 -25\n26 -140 99\n-66 18 82\n", "actual_output": "618\n", "expected_output": "591\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n,m = map(int, input().split())\n x = [tuple(map(int, input().split())) for _ in range(n)]\n from itertools import *\n res = 0\n for a in product([-1, 1], [-1, 1], [-1, 1]):\n- res = max(res, sum(sorted((max(0, sum(i*j for i,j in zip(a,t))) for t in x),reverse=True)[:m]))\n+ res = max(res, sum(sorted((sum(i*j for i,j in zip(a,t)) for t in x),reverse=True)[:m]))\n print(res)\n", "FL_content": " n,m = map(int, input().split())\n x = [tuple(map(int, input().split())) for _ in range(n)]\n from itertools import *\n res = 0\n for a in product([-1, 1], [-1, 1], [-1, 1]):\n- res = max(res, sum(sorted((max(0, sum(i*j for i,j in zip(a,t))) for t in x),reverse=True)[:m]))\n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u595952233", "problem_id": "p03326", "submission1_id": "s917776374", "submission2_id": "s745722711", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nfrom itertools import product\nn, m = map(int, input().split())\nxyz = [list(map(int, input().split())) for _ in range(n)]\n\nans = 0\nfor p in product([1, -1], repeat=3):\n dp = [0] * (m+1)\n for i in range(n):\n x, y, z = [s*t for s,t in zip(p, xyz[i])]\n for j in list(range(m))[::-1]:\n dp[j+1] = max(dp[j+1], dp[j]+x+y+z)\n ans = max(ans, dp[m])\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\nfrom itertools import product\nn, m = map(int, input().split())\nxyz = [list(map(int, input().split())) for _ in range(n)]\n\nans = 0\nfor p in product([1, -1], repeat=3):\n temp = []\n for x, y, z in xyz:\n x*=p[0];y*=p[1];z*=p[2]\n temp.append(x+y+z)\n temp.sort(reverse=True)\n ans = max(ans, sum(temp[:m]))\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591584869", "date2": "1591586375", "bleu_score": "0.7135157667812536", "code1_test_status": [0, 1, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 78, "total_score": 104, "input": "5 5\n1 -2 4\n-4 5 -9\n7 -8 -16\n-10 7 -12\n13 -3 15\n", "actual_output": "48\n", "expected_output": "26\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n from itertools import product\n n, m = map(int, input().split())\n xyz = [list(map(int, input().split())) for _ in range(n)]\n \n ans = 0\n for p in product([1, -1], repeat=3):\n- dp = [0] * (m+1)\n- for i in range(n):\n- x, y, z = [s*t for s,t in zip(p, xyz[i])]\n- for j in list(range(m))[::-1]:\n- dp[j+1] = max(dp[j+1], dp[j]+x+y+z)\n- ans = max(ans, dp[m])\n+ temp = []\n+ for x, y, z in xyz:\n+ x*=p[0];y*=p[1];z*=p[2]\n+ temp.append(x+y+z)\n+ temp.sort(reverse=True)\n+ ans = max(ans, sum(temp[:m]))\n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n from itertools import product\n n, m = map(int, input().split())\n xyz = [list(map(int, input().split())) for _ in range(n)]\n \n ans = 0\n for p in product([1, -1], repeat=3):\n- dp = [0] * (m+1)\n- for i in range(n):\n- x, y, z = [s*t for s,t in zip(p, xyz[i])]\n- for j in list(range(m))[::-1]:\n- dp[j+1] = max(dp[j+1], dp[j]+x+y+z)\n- ans = max(ans, dp[m])\n print(ans)\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 15 }, { "user_id": "u536377809", "problem_id": "p03326", "submission1_id": "s911472974", "submission2_id": "s768483742", "status1": "Wrong Answer", "status2": "Accepted", "code1": "[N,M]=list(map(int,input().split()\n )\n )\nXYZ=[[int(i) for i in input().split()] for i in range(N)] \nmaxabs=0\n\nfor i in range(8):\n pm=list(map(int,format(i, 'b')))\n pm=[0,]*(3-len(pm))+pm\n\n newXYZ=sorted([[item[0]*(-1)**pm[0],item[1]*(-1)**pm[1],item[2]*(-1)**pm[2]] for item in XYZ],\n reverse=True)\n \n maxabs=max(sum([abs(sum([newXYZ[m][j] for m in range(M)]\n )\n ) for j in range(3)\n ]\n ),\n maxabs\n )\n\n\nprint(maxabs)", "code2": "[N,M]=list(map(int,input().split()\n )\n )\nXYZ=[[int(i) for i in input().split()] for i in range(N)] \nmaxabs=0\n\nfor i in range(8):\n pm=list(map(int,format(i, 'b')))\n pm=[0,]*(3-len(pm))+pm\n pm=[(-1)**item for item in pm]\n \n newXYZ=sorted([[item[0]*pm[0],item[1]*pm[1],item[2]*pm[2]] for item in XYZ],\n key=lambda x:sum(x),\n reverse=True)\n \n maxabs=max(sum([abs(sum([newXYZ[m][j] for m in range(M)]\n )\n ) for j in range(3)\n ]\n ),\n maxabs\n )\n\n\nprint(maxabs)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559073875", "date2": "1559074138", "bleu_score": "0.8821271550437494", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 1, 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, 0, 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, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1], "code1_test_score": 36, "total_score": 104, "input": "10 8\n1 -80 10\n17 12 1\n-94 45 1\n-1 -1 7\n-57 60 162\n-12 -79 -24\n-26 0 3\n42 30 -14\n26 -236 103\n-202 18 82\n", "actual_output": "641\n", "expected_output": "982\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " [N,M]=list(map(int,input().split()\n )\n )\n XYZ=[[int(i) for i in input().split()] for i in range(N)] \n maxabs=0\n \n for i in range(8):\n pm=list(map(int,format(i, 'b')))\n pm=[0,]*(3-len(pm))+pm\n-\n- newXYZ=sorted([[item[0]*(-1)**pm[0],item[1]*(-1)**pm[1],item[2]*(-1)**pm[2]] for item in XYZ],\n- reverse=True)\n+ pm=[(-1)**item for item in pm]\n+ \n+ newXYZ=sorted([[item[0]*pm[0],item[1]*pm[1],item[2]*pm[2]] for item in XYZ],\n+ key=lambda x:sum(x),\n+ reverse=True)\n \n maxabs=max(sum([abs(sum([newXYZ[m][j] for m in range(M)]\n )\n ) for j in range(3)\n ]\n ),\n maxabs\n )\n \n \n print(maxabs)\n+\n", "FL_content": " [N,M]=list(map(int,input().split()\n )\n )\n XYZ=[[int(i) for i in input().split()] for i in range(N)] \n maxabs=0\n \n for i in range(8):\n pm=list(map(int,format(i, 'b')))\n pm=[0,]*(3-len(pm))+pm\n-\n- newXYZ=sorted([[item[0]*(-1)**pm[0],item[1]*(-1)**pm[1],item[2]*(-1)**pm[2]] for item in XYZ],\n- reverse=True)\n \n maxabs=max(sum([abs(sum([newXYZ[m][j] for m in range(M)]\n )\n ) for j in range(3)\n ]\n ),\n maxabs\n )\n \n \n print(maxabs)\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 23 }, { "user_id": "u930705402", "problem_id": "p03326", "submission1_id": "s469584546", "submission2_id": "s094099016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=map(int,input().split())\nc=[list(map(int,input().split())) for i in range(N)]\n\nbit=[[] for i in range(2**3)]\nfor k in range(N):\n for i in range(2**3):\n t=c[k].copy()\n for j in range(3):\n if(i>>j&1):\n t[j]*=-1\n bit[i].append(t)\nfor i in range(2**3):\n bit[i].sort(key=lambda x:(x[0],x[1],x[2]),reverse=True)\nres=0\nfor i in range(2**3):\n p=[1,1,1]\n for j in range(3):\n if(i>>j&1):\n p[j]*=-1\n z,o,t=0,0,0\n for k in range(M):\n z+=bit[i][k][0]*p[0]\n o+=bit[i][k][1]*p[1]\n t+=bit[i][k][2]*p[2]\n res=max(res,abs(z)+abs(o)+abs(t))\nprint(res)", "code2": "N,M=map(int,input().split())\nc=[list(map(int,input().split())) for i in range(N)]\n\nbit=[[] for i in range(2**3)]\nfor k in range(N):\n for i in range(2**3):\n t=c[k].copy()\n for j in range(3):\n if(i>>j&1):\n t[j]*=-1\n bit[i].append(t)\nfor i in range(2**3):\n bit[i].sort(key=lambda x:(x[0]+x[1]+x[2]),reverse=True)\nres=0\nfor i in range(2**3):\n p=[1,1,1]\n for j in range(3):\n if(i>>j&1):\n p[j]*=-1\n z,o,t=0,0,0\n for k in range(M):\n z+=bit[i][k][0]*p[0]\n o+=bit[i][k][1]*p[1]\n t+=bit[i][k][2]*p[2]\n res=max(res,abs(z)+abs(o)+abs(t))\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588875356", "date2": "1588875522", "bleu_score": "0.9921934982745518", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 1, 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, 0, 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, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1], "code1_test_score": 36, "total_score": 104, "input": "10 5\n13 -80 45\n23 16 5\n-94 28 2\n-3 0 18\n-69 72 128\n-26 -86 -54\n-69 -8 48\n21 65 -25\n25 -140 87\n-62 18 82\n", "actual_output": "550\n", "expected_output": "690\n\n", "anno_code": ["N,M=map(int,input().split()) # (0): N=10, M=5\nc=[list(map(int,input().split())) for i in range(N)] # (1): c\n\nbit=[[] for i in range(2**3)] # (2): bit\nfor k in range(N): # (3): k=0 (97): k=1 ... (943): NO CHANGE\n for i in range(2**3): # (4): i=0 (14): bit, i=1 ... (942): NO CHANGE\n t=c[k].copy() # (5): t=[13, -80, 45] (15): bit ... (930): bit, t=[-62, 18, 82]\n for j in range(3): # (6): j=0 (8): j=1 ... (940): bit\n if(i>>j&1): # (7): NO CHANGE (9): NO CHANGE ... (938): bit\n t[j]*=-1 # (18): bit=[[[13, -80, 45]], [], [], [], [], [], [], []], t=[-13, -80, 45] (31): bit=[[[13, -80, 45]], [[-13, -80, 45]], [], [], [], [], [], []], t=[13, 80, 45] ... (939): bit, t=[62, -18, -82]\n bit[i].append(t) # (13): bit (24): bit ... (941): bit\nfor i in range(2**3): # (944): i=0 (946): i=1 ... (960): NO CHANGE\n bit[i].sort(key=lambda x:(x[0],x[1],x[2]),reverse=True) # (945): bit (947): bit ... (959): bit\nres=0 # (961): res=0\nfor i in range(2**3): # (962): i=0 (994): i=1 ... (1230): NO CHANGE\n p=[1,1,1] # (963): p=[1, 1, 1] (995): NO CHANGE ... (1196): p=[1, 1, 1]\n for j in range(3): # (964): j=0 (966): j=1 ... (1206): NO CHANGE\n if(i>>j&1): # (965): NO CHANGE (967): NO CHANGE ... (1204): NO CHANGE\n p[j]*=-1 # (998): p=[-1, 1, 1] (1033): p=[1, -1, 1] ... (1205): p=[-1, -1, -1]\n z,o,t=0,0,0 # (971): t=0, z=0, o=0 (1004): t=0, z=0, o=0 ... (1207): t=0, z=0, o=0\n for k in range(M): # (972): k=0 (976): k=1 ... (1228): NO CHANGE\n z+=bit[i][k][0]*p[0] # (973): z=25 (977): z=48 ... (1225): z=-320\n o+=bit[i][k][1]*p[1] # (974): o=-140 (978): o=-124 ... (1226): o=24\n t+=bit[i][k][2]*p[2] # (975): t=87 (979): t=92 ... (1227): t=206\n res=max(res,abs(z)+abs(o)+abs(t)) # (993): res=348 (1026): res=550 ... (1229): NO CHANGE\nprint(res)"], "anno_status": [false], "diff_content": " N,M=map(int,input().split())\n c=[list(map(int,input().split())) for i in range(N)]\n \n bit=[[] for i in range(2**3)]\n for k in range(N):\n for i in range(2**3):\n t=c[k].copy()\n for j in range(3):\n if(i>>j&1):\n t[j]*=-1\n bit[i].append(t)\n for i in range(2**3):\n- bit[i].sort(key=lambda x:(x[0],x[1],x[2]),reverse=True)\n+ bit[i].sort(key=lambda x:(x[0]+x[1]+x[2]),reverse=True)\n res=0\n for i in range(2**3):\n p=[1,1,1]\n for j in range(3):\n if(i>>j&1):\n p[j]*=-1\n z,o,t=0,0,0\n for k in range(M):\n z+=bit[i][k][0]*p[0]\n o+=bit[i][k][1]*p[1]\n t+=bit[i][k][2]*p[2]\n res=max(res,abs(z)+abs(o)+abs(t))\n print(res)\n", "FL_content": " N,M=map(int,input().split())\n c=[list(map(int,input().split())) for i in range(N)]\n \n bit=[[] for i in range(2**3)]\n for k in range(N):\n for i in range(2**3):\n t=c[k].copy()\n for j in range(3):\n if(i>>j&1):\n t[j]*=-1\n bit[i].append(t)\n for i in range(2**3):\n- bit[i].sort(key=lambda x:(x[0],x[1],x[2]),reverse=True)\n res=0\n for i in range(2**3):\n p=[1,1,1]\n for j in range(3):\n if(i>>j&1):\n p[j]*=-1\n z,o,t=0,0,0\n for k in range(M):\n z+=bit[i][k][0]*p[0]\n o+=bit[i][k][1]*p[1]\n t+=bit[i][k][2]*p[2]\n res=max(res,abs(z)+abs(o)+abs(t))\n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 26 }, { "user_id": "u335295553", "problem_id": "p03326", "submission1_id": "s683431180", "submission2_id": "s986131287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nxyz = [list(map(int, input().split())) for i in range(N)]\ntmp = [[0]*N for i in range(8)]\n\nfor n, _ in enumerate(xyz):\n x,y,z = _\n tmp[0][n] = x+y+z\n tmp[1][n] = x+y-z\n tmp[2][n] = x-y+z\n tmp[3][n] = x-y-z\n tmp[4][n] = -x+y+z\n tmp[5][n] = -x+y-z\n tmp[6][n] = -x-y+z\n tmp[7][n] = -x-y-z\n\nresult = [0]*8\nfor i in range(8):\n print(sorted(tmp[i]))\n result[i] = sum(sorted(tmp[i])[-M:])\n\nprint(max(result))", "code2": "N, M = map(int, input().split())\nxyz = [list(map(int, input().split())) for i in range(N)]\ntmp = [[0]*N for i in range(8)]\n\nfor n, _ in enumerate(xyz):\n x,y,z = _\n tmp[0][n] = x+y+z\n tmp[1][n] = x+y-z\n tmp[2][n] = x-y+z\n tmp[3][n] = x-y-z\n tmp[4][n] = -x+y+z\n tmp[5][n] = -x+y-z\n tmp[6][n] = -x-y+z\n tmp[7][n] = -x-y-z\n\nresult = -float(\"inf\")\nfor i in range(8):\n result = max(result, sum(sorted(tmp[i], reverse=True)[:M]))\nprint(result)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529208082", "date2": "1529208307", "bleu_score": "0.9097975159539502", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "10 8\n-1 -252 15\n17 11 1\n-94 45 1\n0 0 8\n-63 60 288\n-19 -195 -24\n-26 0 4\n42 30 -34\n26 -10 23\n-300 18 82\n", "actual_output": "[-238, -238, -200, -48, -22, 8, 29, 38, 39, 285]\n[-364, -291, -268, -190, -50, -30, -8, -7, 27, 106]\n[-236, -138, -22, -22, 7, 8, 59, 152, 165, 266]\n[-411, -400, -140, -30, -8, 5, 13, 46, 200, 236]\n[-236, -200, -46, -13, -5, 8, 30, 140, 400, 411]\n[-266, -165, -152, -59, -8, -7, 22, 22, 138, 236]\n[-106, -27, 7, 8, 30, 50, 190, 268, 291, 364]\n[-285, -39, -38, -29, -8, 22, 48, 200, 238, 238]\n1208\n", "expected_output": "1208\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, M = map(int, input().split())\n xyz = [list(map(int, input().split())) for i in range(N)]\n tmp = [[0]*N for i in range(8)]\n \n for n, _ in enumerate(xyz):\n x,y,z = _\n tmp[0][n] = x+y+z\n tmp[1][n] = x+y-z\n tmp[2][n] = x-y+z\n tmp[3][n] = x-y-z\n tmp[4][n] = -x+y+z\n tmp[5][n] = -x+y-z\n tmp[6][n] = -x-y+z\n tmp[7][n] = -x-y-z\n \n-result = [0]*8\n+result = -float(\"inf\")\n for i in range(8):\n- print(sorted(tmp[i]))\n- result[i] = sum(sorted(tmp[i])[-M:])\n+ result = max(result, sum(sorted(tmp[i], reverse=True)[:M]))\n+print(result)\n \n-print(max(result))\n", "FL_content": " N, M = map(int, input().split())\n xyz = [list(map(int, input().split())) for i in range(N)]\n tmp = [[0]*N for i in range(8)]\n \n for n, _ in enumerate(xyz):\n x,y,z = _\n tmp[0][n] = x+y+z\n tmp[1][n] = x+y-z\n tmp[2][n] = x-y+z\n tmp[3][n] = x-y-z\n tmp[4][n] = -x+y+z\n tmp[5][n] = -x+y-z\n tmp[6][n] = -x-y+z\n tmp[7][n] = -x-y-z\n \n-result = [0]*8\n for i in range(8):\n- print(sorted(tmp[i]))\n- result[i] = sum(sorted(tmp[i])[-M:])\n \n-print(max(result))\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 21 }, { "user_id": "u891217808", "problem_id": "p03326", "submission1_id": "s234435943", "submission2_id": "s001247076", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nl = []\nfor i in range(n):\n x, y, z = map(int, input().split())\n l.append([x, y, z])\nans = 0\nfor i in range(8):\n a = bin(i)[2:].zfill(3)\n xi = 1 if a[0] == '1' else - 1\n yi = 1 if a[1] == '1' else - 1\n zi = 1 if a[2] == '1' else - 1\n l = sorted(l, key=lambda value: value[0] * xi + value[1] * yi + value[2] + zi, reverse=True)\n ans = max(ans, sum(j[0]*xi+j[1]*yi+j[2]*zi for j in l[:m]))\nprint(ans)\n\n", "code2": "n, m = map(int, input().split())\nl = []\nfor i in range(n):\n x, y, z = map(int, input().split())\n l.append([x, y, z])\nans = 0\nfor i in range(8):\n a = bin(i)[2:].zfill(3)\n xi = 1 if a[0] == '1' else - 1\n yi = 1 if a[1] == '1' else - 1\n zi = 1 if a[2] == '1' else - 1\n l = sorted(l, key=lambda value: value[0] * xi + value[1] * yi + value[2] * zi, reverse=True)\n ans = max(ans, abs(sum(j[0] * xi for j in l[:m])) + abs(sum(j[1]*yi for j in l[:m])) +abs(sum(j[2]*zi for j in l[:m])))\nprint(ans)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590196985", "date2": "1590199253", "bleu_score": "0.8638136822607068", "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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 103, "total_score": 104, "input": "5 3\n1 -2 3\n-4 5 -6\n7 -8 -16\n-10 19 -12\n13 -14 15\n", "actual_output": "50\n", "expected_output": "57\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n, m = map(int, input().split())\n l = []\n for i in range(n):\n x, y, z = map(int, input().split())\n l.append([x, y, z])\n ans = 0\n for i in range(8):\n a = bin(i)[2:].zfill(3)\n xi = 1 if a[0] == '1' else - 1\n yi = 1 if a[1] == '1' else - 1\n zi = 1 if a[2] == '1' else - 1\n- l = sorted(l, key=lambda value: value[0] * xi + value[1] * yi + value[2] + zi, reverse=True)\n- ans = max(ans, sum(j[0]*xi+j[1]*yi+j[2]*zi for j in l[:m]))\n+ l = sorted(l, key=lambda value: value[0] * xi + value[1] * yi + value[2] * zi, reverse=True)\n+ ans = max(ans, abs(sum(j[0] * xi for j in l[:m])) + abs(sum(j[1]*yi for j in l[:m])) +abs(sum(j[2]*zi for j in l[:m])))\n print(ans)\n \n \n", "FL_content": " n, m = map(int, input().split())\n l = []\n for i in range(n):\n x, y, z = map(int, input().split())\n l.append([x, y, z])\n ans = 0\n for i in range(8):\n a = bin(i)[2:].zfill(3)\n xi = 1 if a[0] == '1' else - 1\n yi = 1 if a[1] == '1' else - 1\n zi = 1 if a[2] == '1' else - 1\n- l = sorted(l, key=lambda value: value[0] * xi + value[1] * yi + value[2] + zi, reverse=True)\n- ans = max(ans, sum(j[0]*xi+j[1]*yi+j[2]*zi for j in l[:m]))\n print(ans)\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 16 }, { "user_id": "u430937688", "problem_id": "p03326", "submission1_id": "s776742151", "submission2_id": "s388465897", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nlis = [list(map(int, input().split())) for i in range(n)]\n\ndef arr_multiply( lis2):\n def inner(lis1):\n return sum([l1*l2 for l1, l2 in zip(lis1, lis2)])\n return inner\n\nif m == 0:\n print(0)\n\nmax_score = 0\nfor a in (-1, 1):\n for b in (-1, 1):\n for c in (-1, 1):\n func = arr_multiply([a, b, c])\n score = sum(sorted(list(map(func, lis)))[-m:])\n if score > max_score:\n max_score = score\nprint(max_score)", "code2": "n, m = map(int, input().split())\nlis = [list(map(int, input().split())) for i in range(n)]\n\ndef arr_multiply( lis2):\n def inner(lis1):\n return sum([l1*l2 for l1, l2 in zip(lis1, lis2)])\n return inner\n\nmax_score = 0\nif m == 0:\n print(0)\nelse:\n for a in (-1, 1):\n for b in (-1, 1):\n for c in (-1, 1):\n func = arr_multiply([a, b, c])\n score = sum(sorted(list(map(func, lis)))[-m:])\n if score > max_score:\n max_score = score\n print(max_score)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552438477", "date2": "1552438636", "bleu_score": "0.9227156352346559", "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, 0, 1, 1, 1, 1, 1, 1, 1, 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": "10 0\n-1 -252 15\n33 11 1\n-94 45 1\n0 -1 8\n-123 60 656\n-17 -195 -24\n-26 0 4\n42 24 -34\n26 -17 5\n-6 18 82\n", "actual_output": "0\n1187\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n, m = map(int, input().split())\n lis = [list(map(int, input().split())) for i in range(n)]\n \n def arr_multiply( lis2):\n def inner(lis1):\n return sum([l1*l2 for l1, l2 in zip(lis1, lis2)])\n return inner\n \n+max_score = 0\n if m == 0:\n print(0)\n-\n-max_score = 0\n-for a in (-1, 1):\n- for b in (-1, 1):\n- for c in (-1, 1):\n- func = arr_multiply([a, b, c])\n- score = sum(sorted(list(map(func, lis)))[-m:])\n- if score > max_score:\n- max_score = score\n-print(max_score)\n+else:\n+ for a in (-1, 1):\n+ for b in (-1, 1):\n+ for c in (-1, 1):\n+ func = arr_multiply([a, b, c])\n+ score = sum(sorted(list(map(func, lis)))[-m:])\n+ if score > max_score:\n+ max_score = score\n+ print(max_score)\n", "FL_content": " n, m = map(int, input().split())\n lis = [list(map(int, input().split())) for i in range(n)]\n \n def arr_multiply( lis2):\n def inner(lis1):\n return sum([l1*l2 for l1, l2 in zip(lis1, lis2)])\n return inner\n \n if m == 0:\n print(0)\n-\n-max_score = 0\n-for a in (-1, 1):\n- for b in (-1, 1):\n- for c in (-1, 1):\n- func = arr_multiply([a, b, c])\n- score = sum(sorted(list(map(func, lis)))[-m:])\n- if score > max_score:\n- max_score = score\n-print(max_score)\n", "added_lines": 10, "removed_lines": 10, "code1_lines": 20 }, { "user_id": "u997641430", "problem_id": "p03326", "submission1_id": "s169512068", "submission2_id": "s765696821", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=map(int,input().split())\nxyz=[list(map(int,input().split())) for i in range(N)]\nMAX=0\nfor index in [[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1],[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]:\n LIST=sorted([sum([p[a]*index[a] for a in range(3)]) for p in xyz])[::-1]\n print(LIST)\n if sum(LIST[0:M])>MAX:\n MAX=sum(LIST[0:M])\nprint(MAX)", "code2": "N,M=map(int,input().split())\nxyz=[list(map(int,input().split())) for i in range(N)]\nMAX=0\nfor index in [[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1],[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]:\n LIST=sorted([sum([p[a]*index[a] for a in range(3)]) for p in xyz])[::-1]\n if sum(LIST[0:M])>MAX:\n MAX=sum(LIST[0:M])\nprint(MAX)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529202731", "date2": "1529203043", "bleu_score": "0.9516712745002811", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "10 7\n-1 -252 15\n17 11 2\n-94 45 1\n0 -1 8\n-63 60 656\n-17 -195 -24\n-26 0 4\n42 24 -34\n26 -17 5\n-6 18 82\n", "actual_output": "[653, 94, 32, 30, 14, 7, -22, -48, -236, -238]\n[100, 26, 4, -9, -30, -50, -70, -188, -268, -659]\n[533, 266, 154, 58, 48, 9, 8, -16, -22, -138]\n[236, 202, 52, 38, 4, -7, -30, -106, -140, -779]\n[779, 140, 106, 30, 7, -4, -38, -52, -202, -236]\n[138, 22, 16, -8, -9, -48, -58, -154, -266, -533]\n[659, 268, 188, 70, 50, 30, 9, -4, -26, -100]\n[238, 236, 48, 22, -7, -14, -30, -32, -94, -653]\n1274\n", "expected_output": "1274\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N,M=map(int,input().split())\n xyz=[list(map(int,input().split())) for i in range(N)]\n MAX=0\n for index in [[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1],[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]:\n LIST=sorted([sum([p[a]*index[a] for a in range(3)]) for p in xyz])[::-1]\n- print(LIST)\n if sum(LIST[0:M])>MAX:\n MAX=sum(LIST[0:M])\n print(MAX)\n", "FL_content": " N,M=map(int,input().split())\n xyz=[list(map(int,input().split())) for i in range(N)]\n MAX=0\n for index in [[1,1,1],[1,1,-1],[1,-1,1],[1,-1,-1],[-1,1,1],[-1,1,-1],[-1,-1,1],[-1,-1,-1]]:\n LIST=sorted([sum([p[a]*index[a] for a in range(3)]) for p in xyz])[::-1]\n- print(LIST)\n if sum(LIST[0:M])>MAX:\n MAX=sum(LIST[0:M])\n print(MAX)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u636311816", "problem_id": "p03326", "submission1_id": "s502606845", "submission2_id": "s873495788", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\nn,m = map(int,input().split())\n\n\nscores = list()\nfor i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n\nsmax=None\nfor x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n scores_[i][1] = pow(-1,x)*scores[i][1]\n for z in range(2):\n for i in range(n):\n scores_[i][2] = pow(-1,x)*scores[i][2]\n \n sumlist=list()\n for i in range(n):\n sumlist.append(sum(scores_[i]))\n sumlist.sort()\n tmp=0\n \n for eat in range(m):\n tmp+=sumlist[-1]\n sumlist.pop()\n if smax==None or tmp>smax:\n smax=tmp\nprint(smax)", "code2": "import copy\nn,m = map(int,input().split())\n\n\nscores = list()\nfor i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n\nsmax=None\nfor x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n scores_[i][1] = pow(-1,y)*scores[i][1]\n for z in range(2):\n for i in range(n):\n scores_[i][2] = pow(-1,z)*scores[i][2]\n \n sumlist=list()\n for i in range(n):\n sumlist.append(sum(scores_[i]))\n sumlist.sort()\n \n tmp=0\n for eat in range(m):\n tmp+=sumlist[-1]\n sumlist.pop()\n if smax==None or tmp>smax:\n smax=tmp\nprint(smax)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529266162", "date2": "1529267844", "bleu_score": "0.9940652378121427", "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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 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": 6, "total_score": 104, "input": "10 8\n0 -153 10\n17 17 1\n-94 45 1\n-1 0 7\n-63 60 165\n-12 -118 -24\n-26 0 3\n42 30 -14\n26 -236 81\n-202 18 82\n", "actual_output": "558\n", "expected_output": "1081\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import copy\n n,m = map(int,input().split())\n \n \n scores = list()\n for i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n \n smax=None\n for x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n- scores_[i][1] = pow(-1,x)*scores[i][1]\n+ scores_[i][1] = pow(-1,y)*scores[i][1]\n for z in range(2):\n for i in range(n):\n- scores_[i][2] = pow(-1,x)*scores[i][2]\n+ scores_[i][2] = pow(-1,z)*scores[i][2]\n \n sumlist=list()\n for i in range(n):\n sumlist.append(sum(scores_[i]))\n sumlist.sort()\n- tmp=0\n \n+ tmp=0\n for eat in range(m):\n tmp+=sumlist[-1]\n sumlist.pop()\n if smax==None or tmp>smax:\n smax=tmp\n print(smax)\n", "FL_content": " import copy\n n,m = map(int,input().split())\n \n \n scores = list()\n for i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n \n smax=None\n for x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n- scores_[i][1] = pow(-1,x)*scores[i][1]\n for z in range(2):\n for i in range(n):\n- scores_[i][2] = pow(-1,x)*scores[i][2]\n \n sumlist=list()\n for i in range(n):\n sumlist.append(sum(scores_[i]))\n sumlist.sort()\n- tmp=0\n \n for eat in range(m):\n tmp+=sumlist[-1]\n sumlist.pop()\n if smax==None or tmp>smax:\n smax=tmp\n print(smax)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 34 }, { "user_id": "u119714109", "problem_id": "p03326", "submission1_id": "s972054209", "submission2_id": "s078480333", "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()\n\nn, m = na()\n\nzs = []\nfor i in range(n):\n zs.append(na())\n\nans = 0\nfor u in (-1, 1):\n for v in (-1, 1):\n for w in (-1, 1):\n vs = []\n for z in zs:\n vs.append(z[0]*u+z[1]*v+z[2]*w)\n vs.sort()\n ans = max(ans, sum(vs[-m:]))\n\nprint(ans)", "code2": "import sys\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline()\n\nn, m = na()\n\nzs = []\nfor i in range(n):\n zs.append(na())\n\nans = 0\nif m == 0:\n print(0)\nelse:\n for u in (-1, 1):\n for v in (-1, 1):\n for w in (-1, 1):\n vs = []\n for z in zs:\n vs.append(z[0]*u+z[1]*v+z[2]*w)\n vs.sort()\n ans = max(ans, sum(vs[-m:]))\n\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529197903", "date2": "1529199137", "bleu_score": "0.863478102028264", "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, 0, 1, 1, 1, 1, 1, 1, 1, 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": "10 0\n-1 -252 15\n33 11 1\n-94 45 1\n0 -1 8\n-123 60 656\n-17 -195 -24\n-26 0 4\n42 24 -34\n26 -17 5\n-6 18 82\n", "actual_output": "1187\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "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()\n \n n, m = na()\n \n zs = []\n for i in range(n):\n zs.append(na())\n \n ans = 0\n-for u in (-1, 1):\n- for v in (-1, 1):\n- for w in (-1, 1):\n- vs = []\n- for z in zs:\n- vs.append(z[0]*u+z[1]*v+z[2]*w)\n- vs.sort()\n- ans = max(ans, sum(vs[-m:]))\n+if m == 0:\n+ print(0)\n+else:\n+ for u in (-1, 1):\n+ for v in (-1, 1):\n+ for w in (-1, 1):\n+ vs = []\n+ for z in zs:\n+ vs.append(z[0]*u+z[1]*v+z[2]*w)\n+ vs.sort()\n+ ans = max(ans, sum(vs[-m:]))\n \n-print(ans)\n+ print(ans)\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()\n \n n, m = na()\n \n zs = []\n for i in range(n):\n zs.append(na())\n \n ans = 0\n-for u in (-1, 1):\n- for v in (-1, 1):\n- for w in (-1, 1):\n- vs = []\n- for z in zs:\n- vs.append(z[0]*u+z[1]*v+z[2]*w)\n- vs.sort()\n- ans = max(ans, sum(vs[-m:]))\n \n-print(ans)\n", "added_lines": 12, "removed_lines": 9, "code1_lines": 25 }, { "user_id": "u636311816", "problem_id": "p03326", "submission1_id": "s930111637", "submission2_id": "s873495788", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\nn,m = map(int,input().split())\n\n\nscores = list()\nfor i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n\nsmax=None\nfor x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n scores_[i][1] = pow(-1,x)*scores[i][1]\n for z in range(2):\n for i in range(n):\n scores_[i][2] = pow(-1,x)*scores[i][2]\n \n ssum=list()\n for i in range(n):\n ssum.append(sum(scores_[i]))\n ssum.sort()\n tmp=0\n \n for eat in range(m):\n tmp+=ssum[-1]\n ssum.pop()\n if smax==None or tmp>smax:\n smax=tmp\nprint(smax)", "code2": "import copy\nn,m = map(int,input().split())\n\n\nscores = list()\nfor i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n\nsmax=None\nfor x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n scores_[i][1] = pow(-1,y)*scores[i][1]\n for z in range(2):\n for i in range(n):\n scores_[i][2] = pow(-1,z)*scores[i][2]\n \n sumlist=list()\n for i in range(n):\n sumlist.append(sum(scores_[i]))\n sumlist.sort()\n \n tmp=0\n for eat in range(m):\n tmp+=sumlist[-1]\n sumlist.pop()\n if smax==None or tmp>smax:\n smax=tmp\nprint(smax)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529261813", "date2": "1529267844", "bleu_score": "0.9583521551408373", "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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 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": 6, "total_score": 104, "input": "10 8\n1 -80 11\n10 12 6\n-94 45 0\n-1 -1 7\n-57 118 162\n-12 -79 -54\n-26 2 6\n42 30 -25\n26 -140 99\n-114 18 82\n", "actual_output": "276\n", "expected_output": "707\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import copy\n n,m = map(int,input().split())\n \n \n scores = list()\n for i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n \n smax=None\n for x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n- scores_[i][1] = pow(-1,x)*scores[i][1]\n+ scores_[i][1] = pow(-1,y)*scores[i][1]\n for z in range(2):\n for i in range(n):\n- scores_[i][2] = pow(-1,x)*scores[i][2]\n+ scores_[i][2] = pow(-1,z)*scores[i][2]\n \n- ssum=list()\n+ sumlist=list()\n for i in range(n):\n- ssum.append(sum(scores_[i]))\n- ssum.sort()\n- tmp=0\n+ sumlist.append(sum(scores_[i]))\n+ sumlist.sort()\n \n+ tmp=0\n for eat in range(m):\n- tmp+=ssum[-1]\n- ssum.pop()\n+ tmp+=sumlist[-1]\n+ sumlist.pop()\n if smax==None or tmp>smax:\n smax=tmp\n print(smax)\n", "FL_content": " import copy\n n,m = map(int,input().split())\n \n \n scores = list()\n for i in range(n):\n score = list(map(int,input().split()))\n scores.append(score)\n \n smax=None\n for x in range(2):\n scores_=copy.deepcopy(scores)\n \n for i in range(n):\n scores_[i][0] = pow(-1,x)*scores[i][0]\n for y in range(2):\n for i in range(n):\n- scores_[i][1] = pow(-1,x)*scores[i][1]\n for z in range(2):\n for i in range(n):\n- scores_[i][2] = pow(-1,x)*scores[i][2]\n \n- ssum=list()\n for i in range(n):\n- ssum.append(sum(scores_[i]))\n- ssum.sort()\n- tmp=0\n \n for eat in range(m):\n- tmp+=ssum[-1]\n- ssum.pop()\n if smax==None or tmp>smax:\n smax=tmp\n print(smax)\n", "added_lines": 8, "removed_lines": 8, "code1_lines": 34 }, { "user_id": "u659753499", "problem_id": "p03326", "submission1_id": "s351183166", "submission2_id": "s006353586", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=map(int,input().split())\ncakes=[]\nfor i in range(N):\n x,y,z=map(int,input().split())\n cakes.append([x,y,z])\nscore=[0]*8\nscore[0]=sum(sorted(map(lambda c: c[0]+c[1]+c[2], cakes))[-M:])\nscore[1]=sum(sorted(map(lambda c: c[0]+c[1]-c[2], cakes))[-M:])\nscore[2]=sum(sorted(map(lambda c: c[0]-c[1]+c[2], cakes))[-M:])\nscore[3]=sum(sorted(map(lambda c: c[0]-c[1]-c[2], cakes))[-M:])\nscore[4]=sum(sorted(map(lambda c:-c[0]+c[1]+c[2], cakes))[-M:])\nscore[5]=sum(sorted(map(lambda c:-c[0]+c[1]-c[2], cakes))[-M:])\nscore[6]=sum(sorted(map(lambda c:-c[0]-c[1]+c[2], cakes))[-M:])\nscore[7]=sum(sorted(map(lambda c:-c[0]-c[1]-c[2], cakes))[-M:])\nprint(max(score))\n", "code2": "N,M=map(int,input().split())\ncakes=[]\nfor i in range(N):\n x,y,z=map(int,input().split())\n cakes.append([x,y,z])\nif M==0:\n print(0)\n quit()\nscore=[0]*8\nscore[0]=sum(sorted(map(lambda c: c[0]+c[1]+c[2], cakes))[-M:])\nscore[1]=sum(sorted(map(lambda c: c[0]+c[1]-c[2], cakes))[-M:])\nscore[2]=sum(sorted(map(lambda c: c[0]-c[1]+c[2], cakes))[-M:])\nscore[3]=sum(sorted(map(lambda c: c[0]-c[1]-c[2], cakes))[-M:])\nscore[4]=sum(sorted(map(lambda c:-c[0]+c[1]+c[2], cakes))[-M:])\nscore[5]=sum(sorted(map(lambda c:-c[0]+c[1]-c[2], cakes))[-M:])\nscore[6]=sum(sorted(map(lambda c:-c[0]-c[1]+c[2], cakes))[-M:])\nscore[7]=sum(sorted(map(lambda c:-c[0]-c[1]-c[2], cakes))[-M:])\nprint(max(score))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531674051", "date2": "1531676743", "bleu_score": "0.9572043927099618", "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, 0, 1, 1, 1, 1, 1, 1, 1, 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": "10 0\n-1 -252 15\n33 11 1\n-94 45 1\n0 -1 8\n-123 60 656\n-17 -195 -24\n-26 0 4\n42 24 -34\n26 -17 5\n-6 18 82\n", "actual_output": "1187\n", "expected_output": "0\n\n", "anno_code": ["N,M=map(int,input().split()) # (0): N=10, M=0\ncakes=[] # (1): cakes=[]\nfor i in range(N): # (2): i=0 (5): i=1 ... (32): NO CHANGE\n x,y,z=map(int,input().split()) # (3): x=-1, y=-252, z=15 (6): x=33, y=11, z=1 ... (30): x=-6, y=18, z=82\n cakes.append([x,y,z]) # (4): cakes (7): cakes ... (31): cakes\nscore=[0]*8 # (33): score=[0, 0, 0, 0, 0, 0, 0, 0]\nscore[0]=sum(sorted(map(lambda c: c[0]+c[1]+c[2], cakes))[-M:]) # (34): score=[241, 0, 0, 0, 0, 0, 0, 0]\nscore[1]=sum(sorted(map(lambda c: c[0]+c[1]-c[2], cakes))[-M:]) # (35): score=[241, -1187, 0, 0, 0, 0, 0, 0]\nscore[2]=sum(sorted(map(lambda c: c[0]-c[1]+c[2], cakes))[-M:]) # (36): score=[241, -1187, 855, 0, 0, 0, 0, 0]\nscore[3]=sum(sorted(map(lambda c: c[0]-c[1]-c[2], cakes))[-M:]) # (37): score=[241, -1187, 855, -573, 0, 0, 0, 0]\nscore[4]=sum(sorted(map(lambda c:-c[0]+c[1]+c[2], cakes))[-M:]) # (38): score=[241, -1187, 855, -573, 573, 0, 0, 0]\nscore[5]=sum(sorted(map(lambda c:-c[0]+c[1]-c[2], cakes))[-M:]) # (39): score=[241, -1187, 855, -573, 573, -855, 0, 0]\nscore[6]=sum(sorted(map(lambda c:-c[0]-c[1]+c[2], cakes))[-M:]) # (40): score=[241, -1187, 855, -573, 573, -855, 1187, 0]\nscore[7]=sum(sorted(map(lambda c:-c[0]-c[1]-c[2], cakes))[-M:]) # (41): score=[241, -1187, 855, -573, 573, -855, 1187, -241]\nprint(max(score))\n"], "anno_status": [false], "diff_content": " N,M=map(int,input().split())\n cakes=[]\n for i in range(N):\n x,y,z=map(int,input().split())\n cakes.append([x,y,z])\n+if M==0:\n+ print(0)\n+ quit()\n score=[0]*8\n score[0]=sum(sorted(map(lambda c: c[0]+c[1]+c[2], cakes))[-M:])\n score[1]=sum(sorted(map(lambda c: c[0]+c[1]-c[2], cakes))[-M:])\n score[2]=sum(sorted(map(lambda c: c[0]-c[1]+c[2], cakes))[-M:])\n score[3]=sum(sorted(map(lambda c: c[0]-c[1]-c[2], cakes))[-M:])\n score[4]=sum(sorted(map(lambda c:-c[0]+c[1]+c[2], cakes))[-M:])\n score[5]=sum(sorted(map(lambda c:-c[0]+c[1]-c[2], cakes))[-M:])\n score[6]=sum(sorted(map(lambda c:-c[0]-c[1]+c[2], cakes))[-M:])\n score[7]=sum(sorted(map(lambda c:-c[0]-c[1]-c[2], cakes))[-M:])\n print(max(score))\n \n", "FL_content": " N,M=map(int,input().split())\n cakes=[]\n for i in range(N):\n x,y,z=map(int,input().split())\n cakes.append([x,y,z])\n score=[0]*8\n score[0]=sum(sorted(map(lambda c: c[0]+c[1]+c[2], cakes))[-M:])\n score[1]=sum(sorted(map(lambda c: c[0]+c[1]-c[2], cakes))[-M:])\n score[2]=sum(sorted(map(lambda c: c[0]-c[1]+c[2], cakes))[-M:])\n score[3]=sum(sorted(map(lambda c: c[0]-c[1]-c[2], cakes))[-M:])\n score[4]=sum(sorted(map(lambda c:-c[0]+c[1]+c[2], cakes))[-M:])\n score[5]=sum(sorted(map(lambda c:-c[0]+c[1]-c[2], cakes))[-M:])\n score[6]=sum(sorted(map(lambda c:-c[0]-c[1]+c[2], cakes))[-M:])\n score[7]=sum(sorted(map(lambda c:-c[0]-c[1]-c[2], cakes))[-M:])\n print(max(score))\n \n", "added_lines": 3, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u698176039", "problem_id": "p03326", "submission1_id": "s341856305", "submission2_id": "s965006175", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = map(int,input().split())\nxyz = [list(map(int,input().split())) for _ in range(N)]\n\nans = 0\nstate = [0,0,0]\nfor s in range(1<<3):\n for i in range(3):\n if s%2 == 1:\n state[i] = 1\n else:\n state[i] = 0\n s = s>>1\n \n \n totalList = [0] * N\n \n for k in range(N):\n t = 0\n for i in range(3):\n if state[i]:\n t -= xyz[k][i]\n else:\n t += xyz[k][i]\n totalList[k] = t\n \n totalList.sort(reverse = True)\n cur = sum(totalList[:M])\n ans = max(ans,cur)\n cur = sum(totalList[M:])\n ans = max(ans,cur)\n\nprint(ans)\n \n ", "code2": "N,M = map(int,input().split())\nxyz = [list(map(int,input().split())) for _ in range(N)]\n\nans = 0\nstate = [0,0,0]\nfor s in range(1<<3):\n for i in range(3):\n if s%2 == 1:\n state[i] = 1\n else:\n state[i] = 0\n s = s>>1\n \n \n totalList = [0] * N\n \n for k in range(N):\n t = 0\n for i in range(3):\n if state[i]:\n t -= xyz[k][i]\n else:\n t += xyz[k][i]\n totalList[k] = t\n \n totalList.sort(reverse = True)\n cur = sum(totalList[:M])\n ans = max(ans,cur)\n cur = sum(totalList[N-M:])\n ans = max(ans,cur)\n\nprint(ans)\n \n ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1581712714", "date2": "1581712920", "bleu_score": "0.9947126713329819", "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, 0, 1, 1, 1, 1, 1, 1, 1, 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": "10 0\n-1 -252 15\n33 11 1\n-94 45 1\n0 -1 8\n-123 60 656\n-17 -195 -24\n-26 0 4\n42 24 -34\n26 -17 5\n-6 18 82\n", "actual_output": "1187\n", "expected_output": "0\n\n", "anno_code": ["N,M = map(int,input().split()) # (0): N=10, M=0\nxyz = [list(map(int,input().split())) for _ in range(N)] # (1): xyz\n\nans = 0 # (2): ans=0\nstate = [0,0,0] # (3): state=[0, 0, 0]\nfor s in range(1<<3): # (4): s=0 (155): s=1 ... (1212): NO CHANGE\n for i in range(3): # (5): i=0 (9): i=1 ... (1074): NO CHANGE\n if s%2 == 1: # (6): NO CHANGE (10): NO CHANGE ... (1071): NO CHANGE\n state[i] = 1 # (158): state=[1, 0, 0] (313): state=[0, 1, 0] ... (1072): NO CHANGE\n else:\n state[i] = 0 # (7): NO CHANGE (11): NO CHANGE ... (913): state=[0, 0, 1]\n s = s>>1 # (8): NO CHANGE (12): NO CHANGE ... (1073): s=0\n \n \n totalList = [0] * N # (18): totalList=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (169): totalList=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (1075): totalList=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n \n for k in range(N): # (19): k=0 (32): k=1 ... (1206): NO CHANGE\n t = 0 # (20): t=0 (33): t=0 ... (1194): t=0\n for i in range(3): # (21): i=0 (24): i=1 ... (1204): NO CHANGE\n if state[i]: # (22): NO CHANGE (25): NO CHANGE ... (1202): NO CHANGE\n t -= xyz[k][i] # (174): t=1 (187): t=-33 ... (1203): t=-94\n else:\n t += xyz[k][i] # (23): t=-1 (26): t=-253 ... (1046): t=-6\n totalList[k] = t # (31): totalList=[-238, 0, 0, 0, 0, 0, 0, 0, 0, 0] (44): totalList=[-238, 45, 0, 0, 0, 0, 0, 0, 0, 0] ... (1205): totalList=[238, -45, 48, -7, -593, 236, 22, -32, -14, -94]\n \n totalList.sort(reverse = True) # (150): totalList=[593, 94, 45, 32, 14, 7, -22, -48, -236, -238] (301): totalList=[839, 140, 106, 30, 7, -21, -38, -52, -202, -236] ... (1207): totalList=[238, 236, 48, 22, -7, -14, -32, -45, -94, -593]\n cur = sum(totalList[:M]) # (151): cur=0 (302): cur=0 ... (1208): cur=0\n ans = max(ans,cur) # (152): NO CHANGE (303): NO CHANGE ... (1209): NO CHANGE\n cur = sum(totalList[M:]) # (153): cur=241 (304): cur=573 ... (1210): cur=-241\n ans = max(ans,cur) # (154): ans=241 (305): ans=573 ... (1211): NO CHANGE\n\nprint(ans)\n \n "], "anno_status": [false], "diff_content": " N,M = map(int,input().split())\n xyz = [list(map(int,input().split())) for _ in range(N)]\n \n ans = 0\n state = [0,0,0]\n for s in range(1<<3):\n for i in range(3):\n if s%2 == 1:\n state[i] = 1\n else:\n state[i] = 0\n s = s>>1\n \n \n totalList = [0] * N\n \n for k in range(N):\n t = 0\n for i in range(3):\n if state[i]:\n t -= xyz[k][i]\n else:\n t += xyz[k][i]\n totalList[k] = t\n \n totalList.sort(reverse = True)\n cur = sum(totalList[:M])\n ans = max(ans,cur)\n- cur = sum(totalList[M:])\n+ cur = sum(totalList[N-M:])\n ans = max(ans,cur)\n \n print(ans)\n \n \n", "FL_content": " N,M = map(int,input().split())\n xyz = [list(map(int,input().split())) for _ in range(N)]\n \n ans = 0\n state = [0,0,0]\n for s in range(1<<3):\n for i in range(3):\n if s%2 == 1:\n state[i] = 1\n else:\n state[i] = 0\n s = s>>1\n \n \n totalList = [0] * N\n \n for k in range(N):\n t = 0\n for i in range(3):\n if state[i]:\n t -= xyz[k][i]\n else:\n t += xyz[k][i]\n totalList[k] = t\n \n totalList.sort(reverse = True)\n cur = sum(totalList[:M])\n ans = max(ans,cur)\n- cur = sum(totalList[M:])\n ans = max(ans,cur)\n \n print(ans)\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 34 }, { "user_id": "u347363297", "problem_id": "p02718", "submission1_id": "s521534064", "submission2_id": "s776155128", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = input().split()\nm = int(m)\n\nvotes = input().split()\nvotes = [int(i) for i in votes]\nvotes.sort(reverse=True)\n\ntotal = sum(votes)\n\nvalid = True\nfor i in range(m):\n if votes[i] <= total/(4*m):\n valid = False\n break\n\nif valid:\n print('yes')\nelse:\n print('no')", "code2": "n, m = input().split()\nm = int(m)\n\nvotes = input().split()\nvotes = [int(i) for i in votes]\nvotes.sort(reverse=True)\n\ntotal = sum(votes)\n\nvalid = True\nfor i in range(m):\n if votes[i] < total/(4*m):\n valid = False\n break\n\nif valid:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586245707", "date2": "1586245810", "bleu_score": "0.9735306511202632", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2\n145 15 3\n", "actual_output": "no\n", "expected_output": "No\n\n", "anno_code": ["n, m = input().split() # (0): n=3, m=2\nm = int(m) # (1): m=2\n\nvotes = input().split() # (2): votes=['145', '15', '3']\nvotes = [int(i) for i in votes] # (3): votes=[145, 15, 3]\nvotes.sort(reverse=True) # (4): NO CHANGE\n\ntotal = sum(votes) # (5): total=163\n\nvalid = True # (6): valid=True\nfor i in range(m): # (7): i=0 (9): i=1\n if votes[i] <= total/(4*m): # (8): NO CHANGE (10): NO CHANGE\n valid = False # (11): valid=False\n break # (12): NO CHANGE\n\nif valid: # (13): NO CHANGE\n print('yes')\nelse:\n print('no')"], "anno_status": [true], "diff_content": " n, m = input().split()\n m = int(m)\n \n votes = input().split()\n votes = [int(i) for i in votes]\n votes.sort(reverse=True)\n \n total = sum(votes)\n \n valid = True\n for i in range(m):\n- if votes[i] <= total/(4*m):\n+ if votes[i] < total/(4*m):\n valid = False\n break\n \n if valid:\n- print('yes')\n+ print('Yes')\n else:\n- print('no')\n+ print('No')\n", "FL_content": " n, m = input().split()\n m = int(m)\n \n votes = input().split()\n votes = [int(i) for i in votes]\n votes.sort(reverse=True)\n \n total = sum(votes)\n \n valid = True\n for i in range(m):\n- if votes[i] <= total/(4*m):\n valid = False\n break\n \n if valid:\n- print('yes')\n else:\n- print('no')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u185405877", "problem_id": "p02718", "submission1_id": "s232388254", "submission2_id": "s971684002", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y= list(map(int, input().split()))\ni = list(map(int, input().split()))\ni.sort(reverse=True)\nk=sum(i)\nflag=0\nfor j in range(y):\n if i[j]>=k/(4*(j+1)):\n flag+=1\nif flag>y:\n print(\"No\")\nelse:\n print(\"Yes\")\n ", "code2": "x,y= list(map(int, input().split()))\ni = list(map(int, input().split()))\ni.sort(reverse=True)\nk=sum(i)\nflag=0\nif i[y-1]>=k/(4*y):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586053490", "date2": "1586241385", "bleu_score": "0.6975947800265829", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 59, "total_score": 103, "input": "6 5\n7 44 78 1766 1 345 67 1493 111 45 6 789\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x,y= list(map(int, input().split())) # (0): x=6, y=5\ni = list(map(int, input().split())) # (1): i=[7, 44, 78, 1766, 1, 345, 67, 1493, 111, 45, 6, 789]\ni.sort(reverse=True) # (2): i=[1766, 1493, 789, 345, 111, 78, 67, 45, 44, 7, 6, 1]\nk=sum(i) # (3): k=4752\nflag=0 # (4): flag=0\nfor j in range(y): # (5): j=0 (8): j=1 ... (19): NO CHANGE\n if i[j]>=k/(4*(j+1)): # (6): NO CHANGE (9): NO CHANGE ... (18): NO CHANGE\n flag+=1 # (7): flag=1 (10): flag=2 ... (16): flag=4\nif flag>y: # (20): NO CHANGE\n print(\"No\")\nelse:\n print(\"Yes\")\n "], "anno_status": [true], "diff_content": " x,y= list(map(int, input().split()))\n i = list(map(int, input().split()))\n i.sort(reverse=True)\n k=sum(i)\n flag=0\n-for j in range(y):\n- if i[j]>=k/(4*(j+1)):\n- flag+=1\n-if flag>y:\n- print(\"No\")\n-else:\n+if i[y-1]>=k/(4*y):\n print(\"Yes\")\n- \n+else:\n+ print(\"No\")\n", "FL_content": " x,y= list(map(int, input().split()))\n i = list(map(int, input().split()))\n i.sort(reverse=True)\n k=sum(i)\n flag=0\n-for j in range(y):\n- if i[j]>=k/(4*(j+1)):\n- flag+=1\n-if flag>y:\n- print(\"No\")\n-else:\n print(\"Yes\")\n- \n", "added_lines": 3, "removed_lines": 7, "code1_lines": 13 }, { "user_id": "u945335181", "problem_id": "p02718", "submission1_id": "s847049129", "submission2_id": "s126742778", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = map(int,input().split())\n\nvotos = list(map(int,input().split()))\n\nqtd_votos = sum(votos)\nminimo = qtd_votos\n\ncontador = 0\nfor i in votos:\n if i > minimo:\n contador += 1\nif contador >= M:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "N,M = map(int,input().split())\n\nvotos = list(map(int,input().split()))\n\nqtd_votos = sum(votos)\n\nminimo = qtd_votos/(4*M)\n\nvotos.sort(reverse = True)\n\nif votos[M-1] >= minimo:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588153471", "date2": "1588154109", "bleu_score": "0.7083606231966656", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 44, "total_score": 103, "input": "12 3\n4 5 78 104 2 345 23 2462 123 45 3 789\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N,M = map(int,input().split()) # (0): N=12, M=3\n\nvotos = list(map(int,input().split())) # (1): votos=[4, 5, 78, 104, 2, 345, 23, 2462, 123, 45, 3, 789]\n\nqtd_votos = sum(votos) # (2): qtd_votos=3983\nminimo = qtd_votos # (3): minimo=3983\n\ncontador = 0 # (4): contador=0\nfor i in votos: # (5): i=4 (7): i=5 ... (29): NO CHANGE\n if i > minimo: # (6): NO CHANGE (8): NO CHANGE ... (28): NO CHANGE\n contador += 1\nif contador >= M: # (30): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " N,M = map(int,input().split())\n \n votos = list(map(int,input().split()))\n \n qtd_votos = sum(votos)\n-minimo = qtd_votos\n \n-contador = 0\n-for i in votos:\n- if i > minimo:\n- contador += 1\n-if contador >= M:\n+minimo = qtd_votos/(4*M)\n+\n+votos.sort(reverse = True)\n+\n+if votos[M-1] >= minimo:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "FL_content": " N,M = map(int,input().split())\n \n votos = list(map(int,input().split()))\n \n qtd_votos = sum(votos)\n-minimo = qtd_votos\n \n-contador = 0\n-for i in votos:\n- if i > minimo:\n- contador += 1\n-if contador >= M:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 5, "removed_lines": 6, "code1_lines": 16 }, { "user_id": "u281334626", "problem_id": "p02718", "submission1_id": "s386099712", "submission2_id": "s498695203", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nA = list(map(int, input().split()))\n \nsum_A =0\nfor i in range(N):\n sum_A += A[i]\n \nans = 1\nfor i in range(N):\n if (4*M*A[i] < sum_A):\n ans= ans*1\n else:\n \tans =ans*0\n \nif (ans != 0):\n print('Yes')\nelse:\n print('No')", "code2": "N, M = map(int, input().split())\nA = list(map(int, input().split()))\n \nsum_A =0\nfor i in range(N):\n sum_A += A[i]\n\nans = 0\nfor i in range(N):\n if (4*M*A[i] >= sum_A):\n ans+=1\n else:\n \tans+=0\n \t\nif (ans >= M):\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586599321", "date2": "1586634776", "bleu_score": "0.9013440054252589", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 44, "total_score": 103, "input": "3 1\n145 15 1\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=3, M=1\nA = list(map(int, input().split())) # (1): A=[145, 15, 1]\n \nsum_A =0 # (2): sum_A=0\nfor i in range(N): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n sum_A += A[i] # (4): sum_A=145 (6): sum_A=160 (8): sum_A=161\n \nans = 1 # (10): ans=1\nfor i in range(N): # (11): i=0 (14): i=1 ... (20): NO CHANGE\n if (4*M*A[i] < sum_A): # (12): NO CHANGE (15): NO CHANGE (18): NO CHANGE\n ans= ans*1 # (16): NO CHANGE (19): NO CHANGE\n else:\n \tans =ans*0 # (13): ans=0\n \nif (ans != 0): # (21): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n A = list(map(int, input().split()))\n \n sum_A =0\n for i in range(N):\n sum_A += A[i]\n- \n-ans = 1\n+\n+ans = 0\n for i in range(N):\n- if (4*M*A[i] < sum_A):\n- ans= ans*1\n+ if (4*M*A[i] >= sum_A):\n+ ans+=1\n else:\n- \tans =ans*0\n- \n-if (ans != 0):\n+ \tans+=0\n+ \t\n+if (ans >= M):\n print('Yes')\n else:\n print('No')\n+\n", "FL_content": " N, M = map(int, input().split())\n A = list(map(int, input().split()))\n \n sum_A =0\n for i in range(N):\n sum_A += A[i]\n- \n-ans = 1\n for i in range(N):\n- if (4*M*A[i] < sum_A):\n- ans= ans*1\n else:\n- \tans =ans*0\n- \n-if (ans != 0):\n print('Yes')\n else:\n print('No')\n", "added_lines": 8, "removed_lines": 7, "code1_lines": 18 }, { "user_id": "u910536093", "problem_id": "p02718", "submission1_id": "s754139148", "submission2_id": "s939039921", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i1 = input()\ni1 = i1.split()\ntypes = int(i1[0])\nselect = int(i1[1])\n\ni2 = input()\ni2 = [int(n) for n in i2.split()]\ni2.sort(reverse=True)\n\nsummary = sum(i2)\nthreshold = int(summary / (types * 4))\n\nif i2[select-1] < threshold :\n print(\"No\")\nelse:\n print(\"Yes\")\n", "code2": "i1 = input()\ni1 = i1.split()\ntypes = int(i1[0])\nselect = int(i1[1])\n\ni2 = input()\ni2 = [int(n) for n in i2.split()]\ni2.sort(reverse=True)\n\nsummary = sum(i2)\nthreshold = summary / (select * 4)\n\n\n\n\nif i2[select-1] < threshold :\n print(\"No\")\nelse:\n print(\"Yes\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586053757", "date2": "1586054411", "bleu_score": "0.9506378595849742", "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, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 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], "code1_test_score": 89, "total_score": 103, "input": "12 5\n4 44 78 1300 4 345 67 1061 123 45 6 789\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["i1 = input() # (0): i1=12 5\ni1 = i1.split() # (1): i1=['12', '5']\ntypes = int(i1[0]) # (2): types=12\nselect = int(i1[1]) # (3): select=5\n\ni2 = input() # (4): i2=4 44 78 1300 4 345 67 1061 123 45 6 789\ni2 = [int(n) for n in i2.split()] # (5): i2=[4, 44, 78, 1300, 4, 345, 67, 1061, 123, 45, 6, 789]\ni2.sort(reverse=True) # (6): i2=[1300, 1061, 789, 345, 123, 78, 67, 45, 44, 6, 4, 4]\n\nsummary = sum(i2) # (7): summary=3866\nthreshold = int(summary / (types * 4)) # (8): threshold=80\n\nif i2[select-1] < threshold : # (9): NO CHANGE\n print(\"No\")\nelse:\n print(\"Yes\")\n"], "anno_status": [true], "diff_content": " i1 = input()\n i1 = i1.split()\n types = int(i1[0])\n select = int(i1[1])\n \n i2 = input()\n i2 = [int(n) for n in i2.split()]\n i2.sort(reverse=True)\n \n summary = sum(i2)\n-threshold = int(summary / (types * 4))\n+threshold = summary / (select * 4)\n+\n+\n+\n \n if i2[select-1] < threshold :\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "FL_content": " i1 = input()\n i1 = i1.split()\n types = int(i1[0])\n select = int(i1[1])\n \n i2 = input()\n i2 = [int(n) for n in i2.split()]\n i2.sort(reverse=True)\n \n summary = sum(i2)\n-threshold = int(summary / (types * 4))\n \n if i2[select-1] < threshold :\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "added_lines": 4, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u847923740", "problem_id": "p02718", "submission1_id": "s874811528", "submission2_id": "s603157074", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\ninput=sys.stdin.readline\n\ndef main():\n n,m=map(int,input().split())\n A=list(map(int,input().split()))\n cnt=0\n for i in range(n):\n if A[i]>=1/(4*m):\n cnt+=1\n if cnt>=m:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \nif __name__==\"__main__\":\n main()\n", "code2": "\n\nimport sys\ninput=sys.stdin.readline\n\ndef main():\n n,m=map(int,input().split())\n A=list(map(int,input().split()))\n cnt=0\n suma=sum(A)\n for i in range(n):\n if A[i]>=suma/(4*m):\n cnt+=1\n if cnt>=m:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \nif __name__==\"__main__\":\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1591818784", "date2": "1591818830", "bleu_score": "0.9355134637698606", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 59, "total_score": 103, "input": "3 2\n380 30 1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["\n\nimport sys\ninput=sys.stdin.readline # (0): input=\n\ndef main(): # (1): main=\n n,m=map(int,input().split())\n A=list(map(int,input().split()))\n cnt=0\n for i in range(n):\n if A[i]>=1/(4*m):\n cnt+=1\n if cnt>=m:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \nif __name__==\"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n \n import sys\n input=sys.stdin.readline\n \n def main():\n n,m=map(int,input().split())\n A=list(map(int,input().split()))\n cnt=0\n+ suma=sum(A)\n for i in range(n):\n- if A[i]>=1/(4*m):\n+ if A[i]>=suma/(4*m):\n cnt+=1\n if cnt>=m:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n if __name__==\"__main__\":\n main()\n \n", "FL_content": " \n \n import sys\n input=sys.stdin.readline\n \n def main():\n n,m=map(int,input().split())\n A=list(map(int,input().split()))\n cnt=0\n for i in range(n):\n- if A[i]>=1/(4*m):\n cnt+=1\n if cnt>=m:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n if __name__==\"__main__\":\n main()\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u939198091", "problem_id": "p02718", "submission1_id": "s059049459", "submission2_id": "s719712702", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\ndef solve(n,m,lst):\n min_vote = math.ceil(sum(lst)/4/m) - 1\n print(min_vote)\n print(sum(lst))\n return lst[m-1] > min_vote\n\nif __name__ == \"__main__\":\n _n, _m = map(int, input().split())\n a_list = [int(i) for i in input().split()]\n a_list = sorted(a_list,reverse=True)\n if solve(_n,_m,a_list):\n print('Yes')\n else:\n print('No')\n", "code2": "import math\n\ndef solve(n,m,lst):\n min_vote = math.ceil(sum(lst)/4/m) - 1\n return lst[m-1] > min_vote\n\nif __name__ == \"__main__\":\n _n, _m = map(int, input().split())\n a_list = [int(i) for i in input().split()]\n a_list = sorted(a_list,reverse=True)\n if solve(_n,_m,a_list):\n print('Yes')\n else:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586049119", "date2": "1586049169", "bleu_score": "0.8932822625411143", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 1\n4 0 0 2\n", "actual_output": "1\n6\nYes\n", "expected_output": "Yes\n\n", "anno_code": ["import math\n\ndef solve(n,m,lst): # (0): solve=\n min_vote = math.ceil(sum(lst)/4/m) - 1\n print(min_vote)\n print(sum(lst))\n return lst[m-1] > min_vote\n\nif __name__ == \"__main__\":\n _n, _m = map(int, input().split())\n a_list = [int(i) for i in input().split()]\n a_list = sorted(a_list,reverse=True)\n if solve(_n,_m,a_list):\n print('Yes')\n else:\n print('No')\n"], "anno_status": [true], "diff_content": " import math\n \n def solve(n,m,lst):\n min_vote = math.ceil(sum(lst)/4/m) - 1\n- print(min_vote)\n- print(sum(lst))\n return lst[m-1] > min_vote\n \n if __name__ == \"__main__\":\n _n, _m = map(int, input().split())\n a_list = [int(i) for i in input().split()]\n a_list = sorted(a_list,reverse=True)\n if solve(_n,_m,a_list):\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " import math\n \n def solve(n,m,lst):\n min_vote = math.ceil(sum(lst)/4/m) - 1\n- print(min_vote)\n- print(sum(lst))\n return lst[m-1] > min_vote\n \n if __name__ == \"__main__\":\n _n, _m = map(int, input().split())\n a_list = [int(i) for i in input().split()]\n a_list = sorted(a_list,reverse=True)\n if solve(_n,_m,a_list):\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 0, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u207309781", "problem_id": "p02718", "submission1_id": "s252525406", "submission2_id": "s057821415", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(N, M) = [int(x) for x in input().split()]\nline=[int(x) for x in input().split()]\ncutoff=sum(line)/(4*M)\ncount=0\nfor i in line:\n if i>cutoff:\n count+=1\nif count>M:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "(N, M) = [int(x) for x in input().split()]\nline=[int(x) for x in input().split()]\ncutoff=sum(line)/(4*M)\ncount=N\nfor i in line:\n if i=M:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586048811", "date2": "1586049194", "bleu_score": "0.9525910952677581", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 64, "total_score": 103, "input": "3 1\n53 16 2\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["(N, M) = [int(x) for x in input().split()] # (0): N=3, M=1\nline=[int(x) for x in input().split()] # (1): line=[53, 16, 2]\ncutoff=sum(line)/(4*M) # (2): cutoff=17.75\ncount=0 # (3): count=0\nfor i in line: # (4): i=53 (7): i=16 ... (11): NO CHANGE\n if i>cutoff: # (5): NO CHANGE (8): NO CHANGE (10): NO CHANGE\n count+=1 # (6): count=1\nif count>M: # (12): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " (N, M) = [int(x) for x in input().split()]\n line=[int(x) for x in input().split()]\n cutoff=sum(line)/(4*M)\n-count=0\n+count=N\n for i in line:\n- if i>cutoff:\n- count+=1\n-if count>M:\n+ if i=M:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "FL_content": " (N, M) = [int(x) for x in input().split()]\n line=[int(x) for x in input().split()]\n cutoff=sum(line)/(4*M)\n-count=0\n for i in line:\n- if i>cutoff:\n- count+=1\n-if count>M:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u347920118", "problem_id": "p02718", "submission1_id": "s073846843", "submission2_id": "s305381017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = []\nvote = []\nnum = list(map(int,input().split()))\nvote = list(map(int,input().split()))\nN = num[0]\nM = num[1]\nj = 0\nj /= 4*M\ncnt = 0\nfor i in range(0,len(vote)-1):\n if vote[i]>=j:\n cnt += 1\n else:\n pass\nif M<=cnt:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "num = []\nvote = []\nnum = list(map(int,input().split()))\nvote = list(map(int,input().split()))\nN = num[0]\nM = num[1]\nj = sum(vote)/(4*M)\n\n\ncnt = 0\nfor i in vote:\n if i>=j:\n cnt += 1\n else:\n pass\n\nif M<=cnt:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586726320", "date2": "1586727752", "bleu_score": "0.8843486843586106", "code1_test_status": [1, 0, 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, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 63, "total_score": 103, "input": "12 5\n4 44 78 1300 4 345 67 1061 101 45 6 789\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["num = [] # (0): num=[]\nvote = [] # (1): vote=[]\nnum = list(map(int,input().split())) # (2): num=[12, 5]\nvote = list(map(int,input().split())) # (3): vote=[4, 44, 78, 1300, 4, 345, 67, 1061, 101, 45, 6, 789]\nN = num[0] # (4): N=12\nM = num[1] # (5): M=5\nj = 0 # (6): j=0\nj /= 4*M # (7): NO CHANGE\ncnt = 0 # (8): cnt=0\nfor i in range(0,len(vote)-1): # (9): i=0 (12): i=1 ... (42): NO CHANGE\n if vote[i]>=j: # (10): NO CHANGE (13): NO CHANGE ... (40): NO CHANGE\n cnt += 1 # (11): cnt=1 (14): cnt=2 ... (41): cnt=11\n else:\n pass\nif M<=cnt: # (43): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " num = []\n vote = []\n num = list(map(int,input().split()))\n vote = list(map(int,input().split()))\n N = num[0]\n M = num[1]\n-j = 0\n-j /= 4*M\n+j = sum(vote)/(4*M)\n+\n+\n cnt = 0\n-for i in range(0,len(vote)-1):\n- if vote[i]>=j:\n+for i in vote:\n+ if i>=j:\n cnt += 1\n else:\n pass\n+\n if M<=cnt:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "FL_content": " num = []\n vote = []\n num = list(map(int,input().split()))\n vote = list(map(int,input().split()))\n N = num[0]\n M = num[1]\n-j = 0\n-j /= 4*M\n cnt = 0\n-for i in range(0,len(vote)-1):\n- if vote[i]>=j:\n cnt += 1\n else:\n pass\n if M<=cnt:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 6, "removed_lines": 4, "code1_lines": 19 }, { "user_id": "u723711163", "problem_id": "p02718", "submission1_id": "s062282807", "submission2_id": "s960189973", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = list(map(int, input().split()))\nscores = list(map(int, input().split()))\nat_least = sum(scores) \n\nif len([ s for s in scores if s > at_least]) >= M:\n print('Yes')\nelse:\n print('No')", "code2": "N, M = list(map(int, input().split()))\nscores = list(map(int, input().split()))\nat_least = sum(scores) / (4*M)\n\nif len([ s for s in scores if s >= at_least]) >= M:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586049644", "date2": "1586199438", "bleu_score": "0.9438812881391523", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 44, "total_score": 103, "input": "4 1\n5 4 0 1\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N, M = list(map(int, input().split())) # (0): N=4, M=1\nscores = list(map(int, input().split())) # (1): scores=[5, 4, 0, 1]\nat_least = sum(scores) # (2): at_least=10\n\nif len([ s for s in scores if s > at_least]) >= M: # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N, M = list(map(int, input().split()))\n scores = list(map(int, input().split()))\n-at_least = sum(scores) \n+at_least = sum(scores) / (4*M)\n \n-if len([ s for s in scores if s > at_least]) >= M:\n+if len([ s for s in scores if s >= at_least]) >= M:\n print('Yes')\n else:\n print('No')\n", "FL_content": " N, M = list(map(int, input().split()))\n scores = list(map(int, input().split()))\n-at_least = sum(scores) \n \n-if len([ s for s in scores if s > at_least]) >= M:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u860002137", "problem_id": "p02718", "submission1_id": "s831329813", "submission2_id": "s924283452", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\na = list(map(int, input().split()))\nprint(\"Yes\") if len([a[i] for i in range(m) if a[i] > sum(a) / 4 / m]) >= m else print(\"No\")", "code2": "n, m = map(int, input().split())\na = list(map(int, input().split()))\nprint(\"Yes\") if len([a[i] for i in range(n) if a[i] >= sum(a) / 4 / m]) >= m else print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588393168", "date2": "1588393343", "bleu_score": "0.9686454134377341", "code1_test_status": [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, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 90, "total_score": 103, "input": "12 3\n4 56 78 104 2 345 23 1268 123 45 3 789\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=12, m=3\na = list(map(int, input().split())) # (1): a=[4, 56, 78, 104, 2, 345, 23, 1268, 123, 45, 3, 789]\nprint(\"Yes\") if len([a[i] for i in range(m) if a[i] > sum(a) / 4 / m]) >= m else print(\"No\")"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n-print(\"Yes\") if len([a[i] for i in range(m) if a[i] > sum(a) / 4 / m]) >= m else print(\"No\")\n+print(\"Yes\") if len([a[i] for i in range(n) if a[i] >= sum(a) / 4 / m]) >= m else print(\"No\")\n", "FL_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n-print(\"Yes\") if len([a[i] for i in range(m) if a[i] > sum(a) / 4 / m]) >= m else print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u282652245", "problem_id": "p02718", "submission1_id": "s238116946", "submission2_id": "s605181665", "status1": "Wrong Answer", "status2": "Accepted", "code1": "NM = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\ncount = 0\nsumA = sum(A)\nboard = sumA \n\n\n\n\n\nfor i in range(len(A)):\n if A[i] > board:\n count += 1\n else:\n continue\n\n\nif count >= NM[1]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "NM = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\ncount = 0\nsumA = sum(A)\nboard = sumA / (4*NM[1])\n\n\n\n\n\nfor i in range(len(A)):\n if float(A[i]) >= board:\n count += 1\n else:\n continue\n\n\nif count >= NM[1]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586869896", "date2": "1586870020", "bleu_score": "0.9131312561896519", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 44, "total_score": 103, "input": "3 2\n44 18 1\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["NM = list(map(int, input().split())) # (0): NM=[3, 2]\nA = list(map(int, input().split())) # (1): A=[44, 18, 1]\n\ncount = 0 # (2): count=0\nsumA = sum(A) # (3): sumA=63\nboard = sumA # (4): board=63\n\n\n\n\n\nfor i in range(len(A)): # (5): i=0 (8): i=1 ... (14): NO CHANGE\n if A[i] > board: # (6): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n count += 1\n else:\n continue # (7): NO CHANGE (10): NO CHANGE (13): NO CHANGE\n\n\nif count >= NM[1]: # (15): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " NM = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n count = 0\n sumA = sum(A)\n-board = sumA \n+board = sumA / (4*NM[1])\n \n \n \n \n \n for i in range(len(A)):\n- if A[i] > board:\n+ if float(A[i]) >= board:\n count += 1\n else:\n continue\n \n \n if count >= NM[1]:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "FL_content": " NM = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n count = 0\n sumA = sum(A)\n-board = sumA \n \n \n \n \n \n for i in range(len(A)):\n- if A[i] > board:\n count += 1\n else:\n continue\n \n \n if count >= NM[1]:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u826785572", "problem_id": "p02718", "submission1_id": "s619670929", "submission2_id": "s170230583", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\ntotal = sum(a)\n\ncount = 0\n\nvalid = total / (4 * m)\n\nfor i in a:\n if i > valid:\n count += 1\n\nif count > m:\n print('Yes')\nelse:\n print('No')\n", "code2": "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\ntotal = sum(a)\n\ncount = 0\n\nvalid = total / (4 * m)\n\nfor i in a:\n if i >= valid:\n count += 1\n\nif count >= m:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586113379", "date2": "1586114056", "bleu_score": "0.9777259261726056", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 64, "total_score": 103, "input": "3 1\n145 15 1\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=1\na = list(map(int, input().split())) # (1): a=[145, 15, 1]\n\ntotal = sum(a) # (2): total=161\n\ncount = 0 # (3): count=0\n\nvalid = total / (4 * m) # (4): valid=40.25\n\nfor i in a: # (5): i=145 (8): i=15 ... (12): NO CHANGE\n if i > valid: # (6): NO CHANGE (9): NO CHANGE (11): NO CHANGE\n count += 1 # (7): count=1\n\nif count > m: # (13): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n \n total = sum(a)\n \n count = 0\n \n valid = total / (4 * m)\n \n for i in a:\n- if i > valid:\n+ if i >= valid:\n count += 1\n \n-if count > m:\n+if count >= m:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n \n total = sum(a)\n \n count = 0\n \n valid = total / (4 * m)\n \n for i in a:\n- if i > valid:\n count += 1\n \n-if count > m:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u562015767", "problem_id": "p02718", "submission1_id": "s039407328", "submission2_id": "s666649520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nN,M = map(int,input().split())\nl = [int(i) for i in input().split()]\nl.sort(reverse = True)\nl_sum = sum(l)\nd = 4*M / l_sum\nd = int(d)\ncnt = 0\n \nfor i in range(N):\n if l[i] > d:\n cnt += 1\n else:\n break\n \nif cnt >= M:\n print(\"Yes\")\nelse:\n print(\"No\") ", "code2": "import math\nN,M = map(int,input().split())\nl = [int(i) for i in input().split()]\nl.sort(reverse = True)\nl_sum = sum(l)\nd = (1/(4*M))*l_sum\ncnt = 0\n \nfor i in range(N):\n if l[i] >= d:\n cnt += 1\n else:\n break\n \nif cnt >= M:\n print(\"Yes\")\nelse:\n print(\"No\") ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586055521", "date2": "1586056015", "bleu_score": "0.9233219259537031", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 59, "total_score": 103, "input": "3 2\n380 19 2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["import math\nN,M = map(int,input().split()) # (0): N=3, M=2\nl = [int(i) for i in input().split()] # (1): l=[380, 19, 2]\nl.sort(reverse = True) # (2): NO CHANGE\nl_sum = sum(l) # (3): l_sum=401\nd = 4*M / l_sum # (4): d=0.01995\nd = int(d) # (5): d=0\ncnt = 0 # (6): cnt=0\n \nfor i in range(N): # (7): i=0 (10): i=1 ... (16): NO CHANGE\n if l[i] > d: # (8): NO CHANGE (11): NO CHANGE (14): NO CHANGE\n cnt += 1 # (9): cnt=1 (12): cnt=2 (15): cnt=3\n else:\n break\n \nif cnt >= M: # (17): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\") "], "anno_status": [true], "diff_content": " import math\n N,M = map(int,input().split())\n l = [int(i) for i in input().split()]\n l.sort(reverse = True)\n l_sum = sum(l)\n-d = 4*M / l_sum\n-d = int(d)\n+d = (1/(4*M))*l_sum\n cnt = 0\n \n for i in range(N):\n- if l[i] > d:\n+ if l[i] >= d:\n cnt += 1\n else:\n break\n \n if cnt >= M:\n print(\"Yes\")\n else:\n- print(\"No\") \n+ print(\"No\") \n", "FL_content": " import math\n N,M = map(int,input().split())\n l = [int(i) for i in input().split()]\n l.sort(reverse = True)\n l_sum = sum(l)\n-d = 4*M / l_sum\n-d = int(d)\n cnt = 0\n \n for i in range(N):\n- if l[i] > d:\n cnt += 1\n else:\n break\n \n if cnt >= M:\n print(\"Yes\")\n else:\n- print(\"No\") \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 19 }, { "user_id": "u736189571", "problem_id": "p02718", "submission1_id": "s355103432", "submission2_id": "s541446770", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nitem = input().split()\nitem = [int(x) for x in item]\n\nitem.sort(reverse=True)\n\ns = sum(item)\nres = 0\nfor i in range(n):\n if item[i] > s / (4*m):\n res += 1\n if res >= m:\n print('Yes')\n else:\n print('No')", "code2": "n, m = map(int, input().split())\nitem = input().split()\nitem = [int(x) for x in item]\n\nitem.sort(reverse=True)\n\ns = sum(item)\nres = 0\nfor i in range(n):\n if item[i] >= s / (4*m):\n res += 1\n if res >= m:\n print('Yes')\n break\n else:\n print('No')\n break\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586234094", "date2": "1586234590", "bleu_score": "0.9067348847191181", "code1_test_status": [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, 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], "code1_test_score": 4, "total_score": 103, "input": "3 1\n104 15 1\n", "actual_output": "Yes\nNo\nNo\n", "expected_output": "Yes\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=1\nitem = input().split() # (1): item=['104', '15', '1']\nitem = [int(x) for x in item] # (2): item=[104, 15, 1]\n\nitem.sort(reverse=True) # (3): NO CHANGE\n\ns = sum(item) # (4): s=120\nres = 0 # (5): res=0\nfor i in range(n): # (6): i=0 (11): i=1 (14): i=2\n if item[i] > s / (4*m): # (7): NO CHANGE (12): NO CHANGE (15): NO CHANGE\n res += 1 # (8): res=1\n if res >= m: # (9): NO CHANGE\n print('Yes') # (10): NO CHANGE\n else:\n print('No') # (13): NO CHANGE (16): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n item = input().split()\n item = [int(x) for x in item]\n \n item.sort(reverse=True)\n \n s = sum(item)\n res = 0\n for i in range(n):\n- if item[i] > s / (4*m):\n+ if item[i] >= s / (4*m):\n res += 1\n if res >= m:\n print('Yes')\n+ break\n else:\n print('No')\n+ break\n+\n", "FL_content": " n, m = map(int, input().split())\n item = input().split()\n item = [int(x) for x in item]\n \n item.sort(reverse=True)\n \n s = sum(item)\n res = 0\n for i in range(n):\n- if item[i] > s / (4*m):\n res += 1\n if res >= m:\n print('Yes')\n else:\n print('No')\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u934566927", "problem_id": "p02718", "submission1_id": "s638700361", "submission2_id": "s387089194", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,a1 = input().split()\nb = input().split()\nsum = 0\nfor _ in b:\n sum += int(_)\nif int(b[int(a1) - 1]) < sum/4:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "n, m = input().split()\nb = input().split()\nsum = 0\nfor x in b:\n sum += int(x)\nyy=0\nfor y in b:\n if int(y) >= sum/(4*int(m)):\n yy+=1\nif yy < int(m):\n print(\"No\")\nelse:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586314834", "date2": "1586318986", "bleu_score": "0.6316924459949367", "code1_test_status": [0, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 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, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], "code1_test_score": 17, "total_score": 103, "input": "3 1\n343 2 1\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a,a1 = input().split() # (0): a=3, a1=1\nb = input().split() # (1): b=['343', '2', '1']\nsum = 0 # (2): sum=0\nfor _ in b: # (3): _=343 (5): _=2 ... (9): NO CHANGE\n sum += int(_) # (4): sum=343 (6): sum=345 (8): sum=346\nif int(b[int(a1) - 1]) < sum/4: # (10): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": "-a,a1 = input().split()\n+n, m = input().split()\n b = input().split()\n sum = 0\n-for _ in b:\n- sum += int(_)\n-if int(b[int(a1) - 1]) < sum/4:\n- print(\"Yes\")\n-else:\n+for x in b:\n+ sum += int(x)\n+yy=0\n+for y in b:\n+ if int(y) >= sum/(4*int(m)):\n+ yy+=1\n+if yy < int(m):\n print(\"No\")\n-\n+else:\n+ print(\"Yes\")\n", "FL_content": "-a,a1 = input().split()\n b = input().split()\n sum = 0\n-for _ in b:\n- sum += int(_)\n-if int(b[int(a1) - 1]) < sum/4:\n- print(\"Yes\")\n-else:\n print(\"No\")\n-\n", "added_lines": 10, "removed_lines": 7, "code1_lines": 10 }, { "user_id": "u273660689", "problem_id": "p02718", "submission1_id": "s406762427", "submission2_id": "s513315755", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nA = list(map(int, input().split()))\n\n\n\ncnt = 0\ncnt1 = 0\n\nfor i in range(N):\n cnt = cnt + A[i]\n\nfor i in range(N):\n if A[i] / cnt > 1 / 4 / M:\n cnt1 = cnt1 + 1\n\n\n\nif cnt1 > M:\n print('Yes')\nelse:\n print('No')\n", "code2": "N, M = map(int, input().split())\nA = list(map(int, input().split()))\n\n\n\ncnt = 0\ncnt1 = 0\n\nfor i in range(N):\n cnt = cnt + A[i]\n\nfor i in range(N):\n if A[i] / cnt >= 1 / 4 / M:\n cnt1 = cnt1 + 1\n\n\n\nif cnt1 >= M:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586051608", "date2": "1586051720", "bleu_score": "0.9807306533847826", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 64, "total_score": 103, "input": "12 3\n4 5 78 104 2 345 23 2462 123 45 3 789\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=12, M=3\nA = list(map(int, input().split())) # (1): A=[4, 5, 78, 104, 2, 345, 23, 2462, 123, 45, 3, 789]\n\n\n\ncnt = 0 # (2): cnt=0\ncnt1 = 0 # (3): cnt1=0\n\nfor i in range(N): # (4): i=0 (6): i=1 ... (28): NO CHANGE\n cnt = cnt + A[i] # (5): cnt=4 (7): cnt=9 ... (27): cnt=3983\n\nfor i in range(N): # (29): i=0 (31): i=1 ... (56): NO CHANGE\n if A[i] / cnt > 1 / 4 / M: # (30): NO CHANGE (32): NO CHANGE ... (54): NO CHANGE\n cnt1 = cnt1 + 1 # (41): cnt1=1 (46): cnt1=2 (55): cnt1=3\n\n\n\nif cnt1 > M: # (57): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n A = list(map(int, input().split()))\n \n \n \n cnt = 0\n cnt1 = 0\n \n for i in range(N):\n cnt = cnt + A[i]\n \n for i in range(N):\n- if A[i] / cnt > 1 / 4 / M:\n+ if A[i] / cnt >= 1 / 4 / M:\n cnt1 = cnt1 + 1\n \n \n \n-if cnt1 > M:\n+if cnt1 >= M:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " N, M = map(int, input().split())\n A = list(map(int, input().split()))\n \n \n \n cnt = 0\n cnt1 = 0\n \n for i in range(N):\n cnt = cnt + A[i]\n \n for i in range(N):\n- if A[i] / cnt > 1 / 4 / M:\n cnt1 = cnt1 + 1\n \n \n \n-if cnt1 > M:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 22 }, { "user_id": "u852110531", "problem_id": "p02718", "submission1_id": "s821722284", "submission2_id": "s404055372", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\narr = list(map(int, input().split()))\ntemp = sum(arr)\narr.sort()\narr = arr[::-1]\ncnt = 0\nfor i in range(n):\n if arr[i] >= temp:\n cnt += 1\nif cnt >= m:\n print(\"Yes\")\n exit()\nprint(\"No\")", "code2": "n, m = map(int, input().split())\narr = list(map(int, input().split()))\ntemp = sum(arr)/(4 * m)\ncnt = 0\nfor i in range(n):\n if arr[i] >= temp:\n cnt += 1\nif cnt >= m:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586048658", "date2": "1586048830", "bleu_score": "0.8818227476442165", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 44, "total_score": 103, "input": "3 2\n25 22 3\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=2\narr = list(map(int, input().split())) # (1): arr=[25, 22, 3]\ntemp = sum(arr) # (2): temp=50\narr.sort() # (3): arr=[3, 22, 25]\narr = arr[::-1] # (4): arr=[25, 22, 3]\ncnt = 0 # (5): cnt=0\nfor i in range(n): # (6): i=0 (8): i=1 ... (12): NO CHANGE\n if arr[i] >= temp: # (7): NO CHANGE (9): NO CHANGE (11): NO CHANGE\n cnt += 1\nif cnt >= m: # (13): NO CHANGE\n print(\"Yes\")\n exit()\nprint(\"No\")"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n arr = list(map(int, input().split()))\n-temp = sum(arr)\n-arr.sort()\n-arr = arr[::-1]\n+temp = sum(arr)/(4 * m)\n cnt = 0\n for i in range(n):\n if arr[i] >= temp:\n cnt += 1\n if cnt >= m:\n print(\"Yes\")\n exit()\n print(\"No\")\n+\n", "FL_content": " n, m = map(int, input().split())\n arr = list(map(int, input().split()))\n-temp = sum(arr)\n-arr.sort()\n-arr = arr[::-1]\n cnt = 0\n for i in range(n):\n if arr[i] >= temp:\n cnt += 1\n if cnt >= m:\n print(\"Yes\")\n exit()\n print(\"No\")\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u991237710", "problem_id": "p02718", "submission1_id": "s549709070", "submission2_id": "s081600851", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N , M = input().split()\narray = input().split()\nflag = 0\n\nN = int(N)\nM = int(M)\n\niarray = []\n\nfor i in array:\n iarray.append(int(i))\n\ntotal = sum(iarray)\n\nfor i in iarray:\n if i >= total/(4*M):\n flag += 1\nif flag >= M:\n print(\"yes\")\nelse:\n print(\"no\")", "code2": "N , M = input().split()\narray = input().split()\nflag = 0\n\nN = int(N)\nM = int(M)\n\niarray = []\n\nfor i in array:\n iarray.append(int(i))\n\ntotal = sum(iarray)\n\nfor i in iarray:\n if i >= total/(4*M):\n flag += 1\nif flag >= M:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586050435", "date2": "1586050559", "bleu_score": "0.9813070206194715", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "12 3\n4 56 78 104 2 345 67 1145 123 45 3 789\n", "actual_output": "yes\n", "expected_output": "Yes\n\n", "anno_code": ["N , M = input().split() # (0): N=12, M=3\narray = input().split() # (1): array=['4', '56', '78', '104', '2', '345', '67', '1145', '123', '45', '3', '789']\nflag = 0 # (2): flag=0\n\nN = int(N) # (3): N=12\nM = int(M) # (4): M=3\n\niarray = [] # (5): iarray=[]\n\nfor i in array: # (6): i=4 (8): i=56 ... (30): NO CHANGE\n iarray.append(int(i)) # (7): iarray=[4] (9): iarray=[4, 56] ... (29): iarray=[4, 56, 78, 104, 2, 345, 67, 1145, 123, 45, 3, 789]\n\ntotal = sum(iarray) # (31): total=2761\n\nfor i in iarray: # (32): i=4 (34): i=56 ... (59): NO CHANGE\n if i >= total/(4*M): # (33): NO CHANGE (35): NO CHANGE ... (57): NO CHANGE\n flag += 1 # (44): flag=1 (49): flag=2 (58): flag=3\nif flag >= M: # (60): NO CHANGE\n print(\"yes\")\nelse:\n print(\"no\")"], "anno_status": [true], "diff_content": " N , M = input().split()\n array = input().split()\n flag = 0\n \n N = int(N)\n M = int(M)\n \n iarray = []\n \n for i in array:\n iarray.append(int(i))\n \n total = sum(iarray)\n \n for i in iarray:\n if i >= total/(4*M):\n flag += 1\n if flag >= M:\n- print(\"yes\")\n+ print(\"Yes\")\n else:\n- print(\"no\")\n+ print(\"No\")\n", "FL_content": " N , M = input().split()\n array = input().split()\n flag = 0\n \n N = int(N)\n M = int(M)\n \n iarray = []\n \n for i in array:\n iarray.append(int(i))\n \n total = sum(iarray)\n \n for i in iarray:\n if i >= total/(4*M):\n flag += 1\n if flag >= M:\n- print(\"yes\")\n else:\n- print(\"no\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 21 }, { "user_id": "u275704180", "problem_id": "p02718", "submission1_id": "s213301268", "submission2_id": "s194898069", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = map(int,input().split())\narr = list(map(int,input().split()))\n\nres = 0\nfor i in range(N):\n if i < (1/(4*M)*sum(arr)):\n res = res\n else:\n res += 1\nif res >= M:\n print('Yes')\nelse:\n print('No')", "code2": "N,M = map(int,input().split())\narr = list(map(int,input().split()))\n\nres = 0\nfor i in range(N):\n if arr[i] < (1/(4*M)*sum(arr)):\n res = res\n else:\n res += 1\n\nif res >= M:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586318343", "date2": "1586318715", "bleu_score": "0.960337983128609", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 52, "total_score": 103, "input": "12 3\n4 56 78 97 2 345 67 890 123 45 3 789\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N,M = map(int,input().split()) # (0): N=12, M=3\narr = list(map(int,input().split())) # (1): arr=[4, 56, 78, 97, 2, 345, 67, 890, 123, 45, 3, 789]\n\nres = 0 # (2): res=0\nfor i in range(N): # (3): i=0 (6): i=1 ... (39): NO CHANGE\n if i < (1/(4*M)*sum(arr)): # (4): NO CHANGE (7): NO CHANGE ... (37): NO CHANGE\n res = res # (5): NO CHANGE (8): NO CHANGE ... (38): NO CHANGE\n else:\n res += 1\nif res >= M: # (40): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N,M = map(int,input().split())\n arr = list(map(int,input().split()))\n \n res = 0\n for i in range(N):\n- if i < (1/(4*M)*sum(arr)):\n+ if arr[i] < (1/(4*M)*sum(arr)):\n res = res\n else:\n res += 1\n+\n if res >= M:\n print('Yes')\n else:\n print('No')\n", "FL_content": " N,M = map(int,input().split())\n arr = list(map(int,input().split()))\n \n res = 0\n for i in range(N):\n- if i < (1/(4*M)*sum(arr)):\n res = res\n else:\n res += 1\n if res >= M:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u072717685", "problem_id": "p03796", "submission1_id": "s220690653", "submission2_id": "s714890976", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nr = 1\nw = 10**9 + 7\nfor i in range(1, n+1):\n if r > w:\n r = (r % w) * i\n else:\n r *= i\n \n \nprint(r)", "code2": "n = int(input())\nr = 1\nw = 10**9 + 7\nfor i in range(1, n+1): \n r *= i\n r = (r % w)\n \n \n \nprint(r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580591658", "date2": "1580592502", "bleu_score": "0.7657288128498942", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "100110\n", "actual_output": "49469097715650\n", "expected_output": "97369367\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n r = 1\n w = 10**9 + 7\n-for i in range(1, n+1):\n- if r > w:\n- r = (r % w) * i\n- else:\n- r *= i\n+for i in range(1, n+1): \n+ r *= i\n+ r = (r % w)\n+ \n \n \n print(r)\n", "FL_content": " n = int(input())\n r = 1\n w = 10**9 + 7\n-for i in range(1, n+1):\n- if r > w:\n- r = (r % w) * i\n- else:\n- r *= i\n \n \n print(r)\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u953379577", "problem_id": "p03796", "submission1_id": "s331139499", "submission2_id": "s235332120", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nans = 1\n\nfor i in range(n):\n ans *= i+1\n ans = ans%10000007", "code2": "\nn = int(input())\n\nans = 1\n\nfor i in range(n):\n ans *= i+1\n ans = ans%(10**9+7)\n \nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594857299", "date2": "1594857584", "bleu_score": "0.7484402663287275", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "110010\n", "actual_output": "no output\n", "expected_output": "893005454\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "+\n n = int(input())\n \n ans = 1\n \n for i in range(n):\n ans *= i+1\n- ans = ans%10000007\n+ ans = ans%(10**9+7)\n+ \n+print(ans)\n", "FL_content": " n = int(input())\n \n ans = 1\n \n for i in range(n):\n ans *= i+1\n- ans = ans%10000007\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u482157295", "problem_id": "p03796", "submission1_id": "s701455186", "submission2_id": "s894088749", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nans = 1\ndummy1,dummy2 = divmod(n,2)\nfor i in range(1,dummy1+1):\n ans *= i\n ans *= n+1-i\n ans = ans % (10**9+7)\nif dummy2 == 1:\n ans *= (dummy2+1)\nprint(ans)\n\n", "code2": "n = int(input())\nans = 1\ndummy1,dummy2 = divmod(n,2)\nfor i in range(1,dummy1+1):\n ans *= i\n ans *= n+1-i\n ans = ans % (10**9+7)\nif dummy2 == 1:\n ans = ((dummy1+1)*ans % (10**9+7))\nprint(ans)\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585967791", "date2": "1585968264", "bleu_score": "0.8711028327469482", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1], "code1_test_score": 14, "total_score": 26, "input": "101101\n", "actual_output": "1683785140\n", "expected_output": "511008164\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n ans = 1\n dummy1,dummy2 = divmod(n,2)\n for i in range(1,dummy1+1):\n ans *= i\n ans *= n+1-i\n ans = ans % (10**9+7)\n if dummy2 == 1:\n- ans *= (dummy2+1)\n+ ans = ((dummy1+1)*ans % (10**9+7))\n print(ans)\n \n \n+\n+\n", "FL_content": " n = int(input())\n ans = 1\n dummy1,dummy2 = divmod(n,2)\n for i in range(1,dummy1+1):\n ans *= i\n ans *= n+1-i\n ans = ans % (10**9+7)\n if dummy2 == 1:\n- ans *= (dummy2+1)\n print(ans)\n \n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u597455618", "problem_id": "p03796", "submission1_id": "s913133989", "submission2_id": "s854291542", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nans = 1\nfor i in range(1,n):\n ans *= i\n ans %= 10**9 + 7\nprint(ans)", "code2": "n = int(input())\nans = 1\nfor i in range(1,n+1):\n ans *= i\n ans %= (10**9 + 7)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567930340", "date2": "1567930500", "bleu_score": "0.9026118820339671", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "110010\n", "actual_output": "234059569\n", "expected_output": "893005454\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n ans = 1\n-for i in range(1,n):\n+for i in range(1,n+1):\n ans *= i\n- ans %= 10**9 + 7\n+ ans %= (10**9 + 7)\n print(ans)\n", "FL_content": " n = int(input())\n ans = 1\n-for i in range(1,n):\n ans *= i\n- ans %= 10**9 + 7\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u695079172", "problem_id": "p03796", "submission1_id": "s347141236", "submission2_id": "s542545592", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ntemp = 1\n \nfor i in range(1,n+1):\n temp = temp * i\n temp = temp % (10**10)\n \nprint(temp % (10 ** 9 + 7))\n", "code2": "n = int(input())\ntemp = 1\n \nfor i in range(1,n+1):\n temp = temp * i\n temp = temp % ((10**9)+7)\n \nprint(temp % (10 ** 9 + 7))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564961443", "date2": "1564961903", "bleu_score": "0.9454525916316017", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "110110\n", "actual_output": "0\n", "expected_output": "887588411\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n temp = 1\n \n for i in range(1,n+1):\n temp = temp * i\n- temp = temp % (10**10)\n+ temp = temp % ((10**9)+7)\n \n print(temp % (10 ** 9 + 7))\n \n", "FL_content": " n = int(input())\n temp = 1\n \n for i in range(1,n+1):\n temp = temp * i\n- temp = temp % (10**10)\n \n print(temp % (10 ** 9 + 7))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u488497128", "problem_id": "p03796", "submission1_id": "s067510684", "submission2_id": "s536125157", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nM = 10**9 + 7\nN = int(sys.stdin.readline().strip())\n\nx = 1\n\nfor i in range(N):\n x = (x * i) % M\n\nprint(x)\n", "code2": "import sys\n\nM = 10**9 + 7\nN = int(sys.stdin.readline().strip())\n\nx = 1\n\nfor i in range(1, N+1):\n x = (x * i) % M\n\nprint(x)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543522955", "date2": "1543523153", "bleu_score": "0.9415767278141215", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "110010\n", "actual_output": "0\n", "expected_output": "893005454\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n \n M = 10**9 + 7\n N = int(sys.stdin.readline().strip())\n \n x = 1\n \n-for i in range(N):\n+for i in range(1, N+1):\n x = (x * i) % M\n \n print(x)\n \n", "FL_content": " import sys\n \n M = 10**9 + 7\n N = int(sys.stdin.readline().strip())\n \n x = 1\n \n-for i in range(N):\n x = (x * i) % M\n \n print(x)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u142023109", "problem_id": "p03796", "submission1_id": "s017517087", "submission2_id": "s009949166", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nans = 1\nfor i in range(1,N+1):\n ans = (ans%(1000000007)) * i\n\nprint(ans)\n", "code2": "N = int(input())\n\nans = 1\nfor i in range(1,N+1):\n ans = ((ans%(1000000007)) * i) % 1000000007\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586800726", "date2": "1586800943", "bleu_score": "0.8375887013728063", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "101000\n", "actual_output": "88703810853000\n", "expected_output": "810232079\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N = int(input())\n \n ans = 1\n for i in range(1,N+1):\n- ans = (ans%(1000000007)) * i\n+ ans = ((ans%(1000000007)) * i) % 1000000007\n \n print(ans)\n-\n", "FL_content": " N = int(input())\n \n ans = 1\n for i in range(1,N+1):\n- ans = (ans%(1000000007)) * i\n \n print(ans)\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u993268357", "problem_id": "p03796", "submission1_id": "s590334818", "submission2_id": "s800966354", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nres = 1\n\nfor i in range(1, n):\n res = res*i%(10**9+7)\n\nprint(res)", "code2": "n = int(input())\n\nres = 1\n\nfor i in range(1, n+1):\n res = res*i%(10**9+7)\n\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590980798", "date2": "1590980873", "bleu_score": "0.9582983561855744", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "111010\n", "actual_output": "18102166\n", "expected_output": "521433597\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n \n res = 1\n \n-for i in range(1, n):\n+for i in range(1, n+1):\n res = res*i%(10**9+7)\n \n print(res)\n", "FL_content": " n = int(input())\n \n res = 1\n \n-for i in range(1, n):\n res = res*i%(10**9+7)\n \n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u961674365", "problem_id": "p03796", "submission1_id": "s921176113", "submission2_id": "s772981637", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor i in range(n):\n n=(n*(i+1))%(10**9+7)\nprint(n)", "code2": "n=int(input())\np=1\nfor i in range(1,n+1):\n p=(p*i)%(10**9+7)\nprint(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572579499", "date2": "1576981299", "bleu_score": "0.7338469637394951", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "110110\n", "actual_output": "359251086\n", "expected_output": "887588411\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n=int(input())\n-for i in range(n):\n- n=(n*(i+1))%(10**9+7)\n-print(n)\n+p=1\n+for i in range(1,n+1):\n+ p=(p*i)%(10**9+7)\n+print(p)\n", "FL_content": " n=int(input())\n-for i in range(n):\n- n=(n*(i+1))%(10**9+7)\n-print(n)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 4 }, { "user_id": "u178192749", "problem_id": "p03796", "submission1_id": "s696467127", "submission2_id": "s620245639", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\np = 1\nmod = int(10e9+7)\nfor i in range(1,n+1):\n p *=i\n p = p%mod\nprint(p)", "code2": "n = int(input())\np = 1\nmod = int(1e9+7)\nfor i in range(1,n+1):\n p *=i\n p = p%mod\nprint(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559884302", "date2": "1559884743", "bleu_score": "0.9737154137804751", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "101100\n", "actual_output": "9193462480\n", "expected_output": "650720680\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n p = 1\n-mod = int(10e9+7)\n+mod = int(1e9+7)\n for i in range(1,n+1):\n p *=i\n p = p%mod\n print(p)\n", "FL_content": " n = int(input())\n p = 1\n-mod = int(10e9+7)\n for i in range(1,n+1):\n p *=i\n p = p%mod\n print(p)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u354126779", "problem_id": "p03796", "submission1_id": "s582141658", "submission2_id": "s348471338", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\np=1\nfor i in range(1,n+1):\n p=p*i\n p=p%(10**9+7)", "code2": "n=int(input())\np=1\nfor i in range(1,n+1):\n p=p*i\n p=p%(10**9+7)\nprint(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582670374", "date2": "1582670420", "bleu_score": "0.8823261270193965", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "193\n", "actual_output": "no output\n", "expected_output": "98399701\n\n", "anno_code": ["n=int(input()) # (0): n=193\np=1 # (1): p=1\nfor i in range(1,n+1): # (2): i=1 (5): i=2 ... (578): i=193\n p=p*i # (3): NO CHANGE (6): p=2 ... (579): p=75098400226\n p=p%(10**9+7) # (4): NO CHANGE (7): NO CHANGE ... (580): p=98399701\n"], "anno_status": [true], "diff_content": " n=int(input())\n p=1\n for i in range(1,n+1):\n p=p*i\n p=p%(10**9+7)\n+print(p)\n", "FL_content": " n=int(input())\n p=1\n for i in range(1,n+1):\n p=p*i\n p=p%(10**9+7)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u004025573", "problem_id": "p03796", "submission1_id": "s113138591", "submission2_id": "s088356266", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod=1000000007\n\ndef P(x):\n ans=1\n for i in range(x):\n ans=ans*(i+1)%mod\n \n return(ans)\n\nn=int(input())\n\nprint(n)", "code2": "mod=1000000007\n\ndef P(x):\n ans=1\n for i in range(x):\n ans=ans*(i+1)%mod\n \n return(ans)\n\nn=int(input())\n\nprint(P(n))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1532092787", "date2": "1532092894", "bleu_score": "0.9716243141045656", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "100000\n", "actual_output": "100000\n", "expected_output": "457992974\n", "anno_code": ["mod=1000000007 # (0): mod=1000000007\n\ndef P(x): # (1): P=\n ans=1\n for i in range(x):\n ans=ans*(i+1)%mod\n \n return(ans)\n\nn=int(input()) # (2): n=100000\n\nprint(n)"], "anno_status": [true], "diff_content": " mod=1000000007\n \n def P(x):\n ans=1\n for i in range(x):\n ans=ans*(i+1)%mod\n \n return(ans)\n \n n=int(input())\n \n-print(n)\n+print(P(n))\n", "FL_content": " mod=1000000007\n \n def P(x):\n ans=1\n for i in range(x):\n ans=ans*(i+1)%mod\n \n return(ans)\n \n n=int(input())\n \n-print(n)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u026788530", "problem_id": "p03796", "submission1_id": "s084155396", "submission2_id": "s584837501", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nans=1\nfor i in range(n):\n ans*=(i+1)\n ans%=1000000007", "code2": "n=int(input())\nans=1\nfor i in range(n):\n ans*=(i+1)\n ans%=1000000007\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588033343", "date2": "1588033389", "bleu_score": "0.8302686678701421", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "110000\n", "actual_output": "no output\n", "expected_output": "559938709\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n=int(input())\n ans=1\n for i in range(n):\n ans*=(i+1)\n ans%=1000000007\n+ \n+print(ans)\n", "FL_content": " n=int(input())\n ans=1\n for i in range(n):\n ans*=(i+1)\n ans%=1000000007\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u703890795", "problem_id": "p03796", "submission1_id": "s317598015", "submission2_id": "s215632958", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ns = 1\nfor i in range(1, N+1):\n s *= i\n s %= (7 + 1E+9)\nprint(s)", "code2": "N = int(input())\ns = 1\nfor i in range(1, N+1):\n s *= i\n s %= (7 + 1E+9)\nprint(int(s))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566980904", "date2": "1566980974", "bleu_score": "0.9415101546914173", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "101101\n", "actual_output": "511008164.0\n", "expected_output": "511008164\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N = int(input())\n s = 1\n for i in range(1, N+1):\n s *= i\n s %= (7 + 1E+9)\n-print(s)\n+print(int(s))\n", "FL_content": " N = int(input())\n s = 1\n for i in range(1, N+1):\n s *= i\n s %= (7 + 1E+9)\n-print(s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u137704841", "problem_id": "p03796", "submission1_id": "s602907488", "submission2_id": "s831183670", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inN = int(input())\n\nD=1000000000 + 7\np=0\nfor i in range(inN):\n p*=i\n if (D < p): p=p%D\n\nprint(str(p))", "code2": "inN = int(input())\n \nD=1000000000+7\np=1\nfor i in range(inN):\n p*=(i+1)\n if (D < p): p=p%D\n \nprint(str(p))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584049787", "date2": "1584049972", "bleu_score": "0.8497008232064123", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "101111\n", "actual_output": "0\n", "expected_output": "981391086\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " inN = int(input())\n-\n-D=1000000000 + 7\n-p=0\n+ \n+D=1000000000+7\n+p=1\n for i in range(inN):\n- p*=i\n+ p*=(i+1)\n if (D < p): p=p%D\n-\n+ \n print(str(p))\n", "FL_content": " inN = int(input())\n-\n-D=1000000000 + 7\n-p=0\n for i in range(inN):\n- p*=i\n if (D < p): p=p%D\n-\n print(str(p))\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 9 }, { "user_id": "u730769327", "problem_id": "p03796", "submission1_id": "s003080448", "submission2_id": "s443333807", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nsum=1\nfor i in range(n):\n sum*=i\n sum=sum%(10**9+7)\n \nprint(sum)", "code2": "n=int(input())\nsum=1\nfor i in range(n):\n sum*=i+1\n if sum>10**9:\n sum=sum%(10**9+7)\n \nprint(sum)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591242588", "date2": "1591242704", "bleu_score": "0.7832055229459949", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "110011\n", "actual_output": "0\n", "expected_output": "422312314\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n=int(input())\n sum=1\n for i in range(n):\n- sum*=i\n- sum=sum%(10**9+7)\n+ sum*=i+1\n+ if sum>10**9:\n+ sum=sum%(10**9+7)\n \n print(sum)\n", "FL_content": " n=int(input())\n sum=1\n for i in range(n):\n- sum*=i\n- sum=sum%(10**9+7)\n \n print(sum)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u858670323", "problem_id": "p03796", "submission1_id": "s678189381", "submission2_id": "s622081570", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input().rstrip())\na=1\nmod=1e9+7\nfor i in range(1,N+1):\n a*=i\n a%=mod\nprint(a)\n", "code2": "N=int(input().rstrip())\na=1\nmod=1e9+7\nfor i in range(1,N+1):\n a*=i\n a%=mod\nprint(int(a))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587086813", "date2": "1587086872", "bleu_score": "0.9384544225186231", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "111110\n", "actual_output": "910389867.0\n", "expected_output": "910389867\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N=int(input().rstrip())\n a=1\n mod=1e9+7\n for i in range(1,N+1):\n a*=i\n a%=mod\n-print(a)\n+print(int(a))\n \n", "FL_content": " N=int(input().rstrip())\n a=1\n mod=1e9+7\n for i in range(1,N+1):\n a*=i\n a%=mod\n-print(a)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u619458041", "problem_id": "p03796", "submission1_id": "s237900280", "submission2_id": "s548299471", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef main():\n input = sys.stdin.readline\n N = int(input())\n MOD = 10**9 + 7\n\n ans = 1\n for i in range(N):\n ans *= i\n ans = ans % MOD\n\n return ans\n\n\nif __name__ == '__main__':\n print(main())\n", "code2": "import sys\n\ndef main():\n input = sys.stdin.readline\n N = int(input())\n MOD = 10**9 + 7\n\n ans = 1\n for i in range(1, N+1):\n ans *= i\n ans = ans % MOD\n\n return ans\n\n\nif __name__ == '__main__':\n print(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555277294", "date2": "1555277356", "bleu_score": "0.9696791577147992", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "101110\n", "actual_output": "0\n", "expected_output": "175005504\n\n", "anno_code": ["import sys\n\ndef main(): # (0): main=\n input = sys.stdin.readline\n N = int(input())\n MOD = 10**9 + 7\n\n ans = 1\n for i in range(N):\n ans *= i\n ans = ans % MOD\n\n return ans\n\n\nif __name__ == '__main__':\n print(main())\n"], "anno_status": [true], "diff_content": " import sys\n \n def main():\n input = sys.stdin.readline\n N = int(input())\n MOD = 10**9 + 7\n \n ans = 1\n- for i in range(N):\n+ for i in range(1, N+1):\n ans *= i\n ans = ans % MOD\n \n return ans\n \n \n if __name__ == '__main__':\n print(main())\n \n", "FL_content": " import sys\n \n def main():\n input = sys.stdin.readline\n N = int(input())\n MOD = 10**9 + 7\n \n ans = 1\n- for i in range(N):\n ans *= i\n ans = ans % MOD\n \n return ans\n \n \n if __name__ == '__main__':\n print(main())\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u324549724", "problem_id": "p03796", "submission1_id": "s610085967", "submission2_id": "s310233619", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn = int(input())\nprint(math.factorial(n)%1000000009)\n", "code2": "import math\n\nn = int(input())\nprint(math.factorial(n)%1000000007)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564060852", "date2": "1564060962", "bleu_score": "0.9648044412369604", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 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": "111010\n", "actual_output": "822179390\n", "expected_output": "521433597\n\n", "anno_code": ["import math\n\nn = int(input()) # (0): n=111010\nprint(math.factorial(n)%1000000009)\n"], "anno_status": [true], "diff_content": " import math\n \n n = int(input())\n-print(math.factorial(n)%1000000009)\n+print(math.factorial(n)%1000000007)\n \n", "FL_content": " import math\n \n n = int(input())\n-print(math.factorial(n)%1000000009)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u967822229", "problem_id": "p03479", "submission1_id": "s703840520", "submission2_id": "s183185520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import floor\nfrom decimal import Decimal\n\nA, B = list(map(int, input().split()))\n\nnum = A\nc = 0\nwhile num < B:\n num *= 2\n c+=1\n\nprint(c)", "code2": "from math import floor\nfrom decimal import Decimal\n\nA, B = list(map(int, input().split()))\n\nnum = A\nc = 0\nwhile num <= B:\n num *= 2\n c+=1\n\nprint(c)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591425182", "date2": "1591425230", "bleu_score": "0.9769653993529381", "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, 0, 1], "code1_test_score": 87, "total_score": 88, "input": "25 100\n", "actual_output": "2\n", "expected_output": "3\n", "anno_code": ["from math import floor\nfrom decimal import Decimal\n\nA, B = list(map(int, input().split())) # (0): A=25, B=100\n\nnum = A # (1): num=25\nc = 0 # (2): c=0\nwhile num < B: # (3): NO CHANGE (6): NO CHANGE (9): NO CHANGE\n num *= 2 # (4): num=50 (7): num=100\n c+=1 # (5): c=1 (8): c=2\n\nprint(c)"], "anno_status": [true], "diff_content": " from math import floor\n from decimal import Decimal\n \n A, B = list(map(int, input().split()))\n \n num = A\n c = 0\n-while num < B:\n+while num <= B:\n num *= 2\n c+=1\n \n print(c)\n+\n", "FL_content": " from math import floor\n from decimal import Decimal\n \n A, B = list(map(int, input().split()))\n \n num = A\n c = 0\n-while num < B:\n num *= 2\n c+=1\n \n print(c)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u552746936", "problem_id": "p03479", "submission1_id": "s590824918", "submission2_id": "s312630628", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\nans = 0\n\nwhile x < y:\n x *= 2\n ans += 1\nprint(ans)\n", "code2": "x, y = map(int, input().split())\n\nans = 0\n\nwhile x <= y:\n x *= 2\n ans += 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574531514", "date2": "1574531778", "bleu_score": "0.9721358527750605", "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, 0, 1], "code1_test_score": 87, "total_score": 88, "input": "25 100\n", "actual_output": "2\n", "expected_output": "3\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=25, y=100\n\nans = 0 # (1): ans=0\n\nwhile x < y: # (2): NO CHANGE (5): NO CHANGE (8): NO CHANGE\n x *= 2 # (3): x=50 (6): x=100\n ans += 1 # (4): ans=1 (7): ans=2\nprint(ans)\n"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n \n ans = 0\n \n-while x < y:\n+while x <= y:\n x *= 2\n ans += 1\n print(ans)\n \n", "FL_content": " x, y = map(int, input().split())\n \n ans = 0\n \n-while x < y:\n x *= 2\n ans += 1\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u764860452", "problem_id": "p03479", "submission1_id": "s010449043", "submission2_id": "s338725489", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y=map(int,input().split())\n\ncnt=0\nwhile(X\n result = []\n i = min_limit\n\n while(i < max_limit + 1):\n result.append(i)\n i = i * 2\n print(len(result))\n print(result)\n\n\nif __name__ == \"__main__\":\n min_limit, max_limit = [int(val) for val in input().split()]\n main(min_limit, max_limit)"], "anno_status": [true], "diff_content": " \n \n \n def main(min_limit, max_limit):\n result = []\n i = min_limit\n \n while(i < max_limit + 1):\n result.append(i)\n i = i * 2\n print(len(result))\n- print(result)\n \n \n if __name__ == \"__main__\":\n min_limit, max_limit = [int(val) for val in input().split()]\n main(min_limit, max_limit)\n", "FL_content": " \n \n \n def main(min_limit, max_limit):\n result = []\n i = min_limit\n \n while(i < max_limit + 1):\n result.append(i)\n i = i * 2\n print(len(result))\n- print(result)\n \n \n if __name__ == \"__main__\":\n min_limit, max_limit = [int(val) for val in input().split()]\n main(min_limit, max_limit)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u688375653", "problem_id": "p03479", "submission1_id": "s703248447", "submission2_id": "s110562542", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def input_int():\n return map(int, input().split())\n\ndef one_int():\n return int(input())\n\ndef one_str():\n return input()\n\ndef many_int():\n return list(map(int, input().split()))\n\nX,Y=input_int()\ncount=0\nwhile X\n return map(int, input().split())\n\ndef one_int(): # (1): one_int=\n return int(input())\n\ndef one_str(): # (2): one_str=\n return input()\n\ndef many_int(): # (3): many_int=\n return list(map(int, input().split()))\n\nX,Y=input_int() # (4): X=25, Y=100\ncount=0 # (5): count=0\nwhile Xa:\n a*=2\n ans+=1\nprint(ans-1)", "code2": "a,b=map(int,input().split())\nans=0\nwhile b>=a:\n a*=2\n ans+=1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574615057", "date2": "1574615280", "bleu_score": "0.9410013810793967", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "14975555 686618920047839292\n", "actual_output": "35\n", "expected_output": "36\n\n", "anno_code": ["a,b=map(int,input().split()) # (0): a=14975555, b=686618920047839292\nans=0 # (1): ans=0\nwhile b>a: # (2): NO CHANGE (5): NO CHANGE ... (110): NO CHANGE\n a*=2 # (3): a=29951110 (6): a=59902220 ... (108): a=1029112303431188480\n ans+=1 # (4): ans=1 (7): ans=2 ... (109): ans=36\nprint(ans-1)"], "anno_status": [true], "diff_content": " a,b=map(int,input().split())\n ans=0\n-while b>a:\n+while b>=a:\n a*=2\n ans+=1\n-print(ans-1)\n+print(ans)\n", "FL_content": " a,b=map(int,input().split())\n ans=0\n-while b>a:\n a*=2\n ans+=1\n-print(ans-1)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u591016708", "problem_id": "p03479", "submission1_id": "s454264038", "submission2_id": "s279164940", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve(X, Y):\n tmp = X\n ans = 0\n while tmp < Y:\n ans += 1\n tmp *= 2\n return ans\n\ndef main():\n X, Y = map(int, input().split())\n ans = solve(X, Y)\n print(ans)\n\nif __name__ == \"__main__\":\n main()", "code2": "def solve(X, Y):\n tmp = X\n ans = 0\n while tmp <= Y:\n ans += 1\n tmp *= 2\n return ans\n\ndef main():\n X, Y = map(int, input().split())\n ans = solve(X, Y)\n print(ans)\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576992274", "date2": "1576992451", "bleu_score": "0.9892583505502627", "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, 0, 1], "code1_test_score": 87, "total_score": 88, "input": "25 100\n", "actual_output": "2\n", "expected_output": "3\n", "anno_code": ["def solve(X, Y): # (0): solve=\n tmp = X\n ans = 0\n while tmp < Y:\n ans += 1\n tmp *= 2\n return ans\n\ndef main(): # (1): main=\n X, Y = map(int, input().split())\n ans = solve(X, Y)\n print(ans)\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " def solve(X, Y):\n tmp = X\n ans = 0\n- while tmp < Y:\n+ while tmp <= Y:\n ans += 1\n tmp *= 2\n return ans\n \n def main():\n X, Y = map(int, input().split())\n ans = solve(X, Y)\n print(ans)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " def solve(X, Y):\n tmp = X\n ans = 0\n- while tmp < Y:\n ans += 1\n tmp *= 2\n return ans\n \n def main():\n X, Y = map(int, input().split())\n ans = solve(X, Y)\n print(ans)\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u604607346", "problem_id": "p03479", "submission1_id": "s514585615", "submission2_id": "s157309895", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n \nnum = 0\nwhile x < y:\n num += 1\n x *= 2\n \nprint(num)", "code2": "x, y = map(int, input().split())\n \nnum = 0\nwhile x <= y:\n num += 1\n x *= 2\n \nprint(num)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1518205984", "date2": "1518206068", "bleu_score": "0.9733254474339004", "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, 0, 1], "code1_test_score": 87, "total_score": 88, "input": "25 100\n", "actual_output": "2\n", "expected_output": "3\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=25, y=100\n \nnum = 0 # (1): num=0\nwhile x < y: # (2): NO CHANGE (5): NO CHANGE (8): NO CHANGE\n num += 1 # (3): num=1 (6): num=2\n x *= 2 # (4): x=50 (7): x=100\n \nprint(num)"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n \n num = 0\n-while x < y:\n+while x <= y:\n num += 1\n x *= 2\n \n print(num)\n", "FL_content": " x, y = map(int, input().split())\n \n num = 0\n-while x < y:\n num += 1\n x *= 2\n \n print(num)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u699699071", "problem_id": "p03479", "submission1_id": "s023614447", "submission2_id": "s707211047", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y=map(int,input().split())\nresult=0\nwhile X<=Y :\n print(X)\n X*=2\n result+=1\nprint(result)", "code2": "X,Y=map(int,input().split())\nresult=0\nwhile X<=Y :\n \n X*=2\n result+=1\nprint(result)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567463793", "date2": "1567463809", "bleu_score": "0.9013068952429583", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "240 1502541996\n", "actual_output": "240\n480\n960\n1920\n3840\n7680\n15360\n30720\n61440\n122880\n245760\n491520\n983040\n1966080\n3932160\n7864320\n15728640\n31457280\n62914560\n125829120\n251658240\n503316480\n1006632960\n23\n", "expected_output": "23\n\n", "anno_code": ["X,Y=map(int,input().split()) # (0): X=240, Y=1502541996\nresult=0 # (1): result=0\nwhile X<=Y : # (2): NO CHANGE (6): NO CHANGE ... (94): NO CHANGE\n print(X) # (3): NO CHANGE (7): NO CHANGE ... (91): NO CHANGE\n X*=2 # (4): X=480 (8): X=960 ... (92): X=2013265920\n result+=1 # (5): result=1 (9): result=2 ... (93): result=23\nprint(result)"], "anno_status": [true], "diff_content": " X,Y=map(int,input().split())\n result=0\n while X<=Y :\n- print(X)\n+ \n X*=2\n result+=1\n print(result)\n", "FL_content": " X,Y=map(int,input().split())\n result=0\n while X<=Y :\n- print(X)\n X*=2\n result+=1\n print(result)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u430771494", "problem_id": "p03479", "submission1_id": "s792242129", "submission2_id": "s464284322", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y=list(map(int, input().split()))\npresent=[X]\ni=0\nwhile present[i] y:\n break\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556219685", "date2": "1556220671", "bleu_score": "0.7304482688843122", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 48, "total_score": 88, "input": "363 5404913929872006\n", "actual_output": "0\n", "expected_output": "44\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nx, y = map(int, input().split()) # (1): x=363, y=5404913929872006\nans = 0 # (2): ans=0\nfor k in range(1, 40): # (3): k=1 (5): k=2 ... (81): NO CHANGE\n \n if int(y / (x * 2**k)) < 1: # (4): NO CHANGE (6): NO CHANGE ... (80): NO CHANGE\n ans = k\n break\nprint(ans)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n x, y = map(int, input().split())\n ans = 0\n-for k in range(1, 40):\n- \n- if int(y / (x * 2**k)) < 1:\n- ans = k\n+while True:\n+ ans += 1\n+ temp = x * 2 ** ans\n+ if temp > y:\n break\n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n x, y = map(int, input().split())\n ans = 0\n-for k in range(1, 40):\n- \n- if int(y / (x * 2**k)) < 1:\n- ans = k\n break\n print(ans)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 11 }, { "user_id": "u844697453", "problem_id": "p03479", "submission1_id": "s582529932", "submission2_id": "s910067620", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input().split()\nans=1\nb=0\nc=[int(a[0])]\nwhile(0==0):\n if c[b]*2\n n, m = map(int, input().split())\n\n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n\n x_len = 0\n y_len = 0\n\n for i in range(n):\n x_len += (2 * i - n + 1) * x[i] % (10 ** 9 + 7)\n print(x_len)\n\n for j in range(m):\n y_len += (2 * j - m + 1) * y[j] % (10 ** 9 + 7)\n print(y_len)\n\n print(x_len * y_len % (10 ** 9 + 7))\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import itertools\n \n \n def main():\n n, m = map(int, input().split())\n \n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n \n x_len = 0\n y_len = 0\n \n for i in range(n):\n x_len += (2 * i - n + 1) * x[i] % (10 ** 9 + 7)\n- print(x_len)\n+ \n \n for j in range(m):\n y_len += (2 * j - m + 1) * y[j] % (10 ** 9 + 7)\n- print(y_len)\n+ \n \n print(x_len * y_len % (10 ** 9 + 7))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import itertools\n \n \n def main():\n n, m = map(int, input().split())\n \n x = list(map(int, input().split()))\n y = list(map(int, input().split()))\n \n x_len = 0\n y_len = 0\n \n for i in range(n):\n x_len += (2 * i - n + 1) * x[i] % (10 ** 9 + 7)\n- print(x_len)\n \n for j in range(m):\n y_len += (2 * j - m + 1) * y[j] % (10 ** 9 + 7)\n- print(y_len)\n \n print(x_len * y_len % (10 ** 9 + 7))\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 26 }, { "user_id": "u692632484", "problem_id": "p03764", "submission1_id": "s481632788", "submission2_id": "s820749530", "status1": "Wrong Answer", "status2": "Accepted", "code1": "INF=10**9+7\nL=[int(i)-1 for i in input().split()]\nx=[int(i) for i in input().split()]\ny=[int(i) for i in input().split()]\nx.sort()\ny.sort()\n\nX=[x[i+1]-x[i] for i in range(L[0])]\nY=[y[i+1]-y[i] for i in range(L[1])]\n\nusingX=[0 for i in range(L[0])]\nusingY=[0 for i in range(L[1])]\n\nif L[0]%2==0:\n\tfor i in range(L[0]):\n\t\ttemp=min(i,L[0]-i-1)\n\t\ttemp+=1\n\t\tusingX[i]+=int(temp*(temp+1)/2)\n\t\t\n\t\tusingX[i]+=temp*int(L[0]/2-temp)\n\t\t\n\t\tusingX[i]*=2\n\t\t\nelse:\n\tfor i in range(L[0]):\n\t\ttemp=min(i,L[0]-i-1)\n\t\ttemp+=1\n\t\tusingX[i]+=int(temp*(temp+1)/2)\n\t\tusingX[i]+=temp*int((L[0]-1)/2-temp)\n\t\tusingX[i]*=2\n\t\t\n\t\tusingX[i]+=temp\n\t\n\t\n\n\nif L[1]%2==0:\n\tfor i in range(L[1]):\n\t\ttemp=min(i,L[1]-i-1)\n\t\ttemp+=1\n\t\tusingY[i]+=int(temp*(temp+1)/2)\n\t\t\n\t\tusingY[i]+=temp*int(L[1]/2-temp)\n\t\t\n\t\tusingY[i]*=2\n\t\t\nelse:\n\tfor i in range(L[1]):\n\t\ttemp=min(i,L[1]-i-1)\n\t\ttemp+=1\n\t\tusingY[i]+=int(temp*(temp+1)/2)\n\t\tusingY[i]+=temp*int((L[1]-1)/2-temp)\n\t\tusingY[i]*=2\n\t\t\n\t\tusingY[i]+=temp\n\t\n\t\n\nprint(usingX)\nprint(usingY)\nfor i in range(L[0]):\n\tX[i]*=usingX[i]\nfor j in range(L[1]):\n\tY[j]*=usingY[j]\nans=sum(X)*sum(Y)\nprint(ans%INF)", "code2": "INF=10**9+7\nL=[int(i)-1 for i in input().split()]\nx=[int(i) for i in input().split()]\ny=[int(i) for i in input().split()]\nx.sort()\ny.sort()\n\nX=[x[i+1]-x[i] for i in range(L[0])]\nY=[y[i+1]-y[i] for i in range(L[1])]\n\nusingX=[0 for i in range(L[0])]\nusingY=[0 for i in range(L[1])]\n\nif L[0]%2==0:\n\tfor i in range(L[0]):\n\t\ttemp=min(i,L[0]-i-1)\n\t\ttemp+=1\n\t\tusingX[i]+=int(temp*(temp+1)/2)\n\t\t\n\t\tusingX[i]+=temp*int(L[0]/2-temp)\n\t\t\n\t\tusingX[i]*=2\n\t\t\nelse:\n\tfor i in range(L[0]):\n\t\ttemp=min(i,L[0]-i-1)\n\t\ttemp+=1\n\t\tusingX[i]+=int(temp*(temp+1)/2)\n\t\tusingX[i]+=temp*int((L[0]-1)/2-temp)\n\t\tusingX[i]*=2\n\t\t\n\t\tusingX[i]+=temp\n\t\n\t\n\n\nif L[1]%2==0:\n\tfor i in range(L[1]):\n\t\ttemp=min(i,L[1]-i-1)\n\t\ttemp+=1\n\t\tusingY[i]+=int(temp*(temp+1)/2)\n\t\t\n\t\tusingY[i]+=temp*int(L[1]/2-temp)\n\t\t\n\t\tusingY[i]*=2\n\t\t\nelse:\n\tfor i in range(L[1]):\n\t\ttemp=min(i,L[1]-i-1)\n\t\ttemp+=1\n\t\tusingY[i]+=int(temp*(temp+1)/2)\n\t\tusingY[i]+=temp*int((L[1]-1)/2-temp)\n\t\tusingY[i]*=2\n\t\t\n\t\tusingY[i]+=temp\n\t\n\t\n\n\n\nfor i in range(L[0]):\n\tX[i]*=usingX[i]\nfor j in range(L[1]):\n\tY[j]*=usingY[j]\nans=sum(X)*sum(Y)\nprint(ans%INF)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1491707298", "date2": "1491707329", "bleu_score": "0.9740797232407734", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "3 3\n1 3 4\n1 3 6\n", "actual_output": "[2, 2]\n[2, 2]\n60\n", "expected_output": "60\n", "anno_code": ["INF=10**9+7 # (0): INF=1000000007\nL=[int(i)-1 for i in input().split()] # (1): L=[2, 2]\nx=[int(i) for i in input().split()] # (2): x=[1, 3, 4]\ny=[int(i) for i in input().split()] # (3): y=[1, 3, 6]\nx.sort() # (4): NO CHANGE\ny.sort() # (5): NO CHANGE\n\nX=[x[i+1]-x[i] for i in range(L[0])] # (6): X=[2, 1]\nY=[y[i+1]-y[i] for i in range(L[1])] # (7): Y=[2, 3]\n\nusingX=[0 for i in range(L[0])] # (8): usingX=[0, 0]\nusingY=[0 for i in range(L[1])] # (9): usingY=[0, 0]\n\nif L[0]%2==0: # (10): NO CHANGE\n\tfor i in range(L[0]): # (11): i=0 (17): i=1 (23): NO CHANGE\n\t\ttemp=min(i,L[0]-i-1) # (12): temp=0 (18): temp=0\n\t\ttemp+=1 # (13): temp=1 (19): temp=1\n\t\tusingX[i]+=int(temp*(temp+1)/2) # (14): usingX=[1, 0] (20): usingX=[2, 1]\n\t\t\n\t\tusingX[i]+=temp*int(L[0]/2-temp) # (15): NO CHANGE (21): NO CHANGE\n\t\t\n\t\tusingX[i]*=2 # (16): usingX=[2, 0] (22): usingX=[2, 2]\n\t\t\nelse:\n\tfor i in range(L[0]):\n\t\ttemp=min(i,L[0]-i-1)\n\t\ttemp+=1\n\t\tusingX[i]+=int(temp*(temp+1)/2)\n\t\tusingX[i]+=temp*int((L[0]-1)/2-temp)\n\t\tusingX[i]*=2\n\t\t\n\t\tusingX[i]+=temp\n\t\n\t\n\n\nif L[1]%2==0: # (24): NO CHANGE\n\tfor i in range(L[1]): # (25): i=0 (31): i=1 (37): NO CHANGE\n\t\ttemp=min(i,L[1]-i-1) # (26): temp=0 (32): temp=0\n\t\ttemp+=1 # (27): temp=1 (33): temp=1\n\t\tusingY[i]+=int(temp*(temp+1)/2) # (28): usingY=[1, 0] (34): usingY=[2, 1]\n\t\t\n\t\tusingY[i]+=temp*int(L[1]/2-temp) # (29): NO CHANGE (35): NO CHANGE\n\t\t\n\t\tusingY[i]*=2 # (30): usingY=[2, 0] (36): usingY=[2, 2]\n\t\t\nelse:\n\tfor i in range(L[1]):\n\t\ttemp=min(i,L[1]-i-1)\n\t\ttemp+=1\n\t\tusingY[i]+=int(temp*(temp+1)/2)\n\t\tusingY[i]+=temp*int((L[1]-1)/2-temp)\n\t\tusingY[i]*=2\n\t\t\n\t\tusingY[i]+=temp\n\t\n\t\n\nprint(usingX) # (38): NO CHANGE\nprint(usingY) # (39): NO CHANGE\nfor i in range(L[0]): # (40): i=0 (42): i=1 (44): NO CHANGE\n\tX[i]*=usingX[i] # (41): X=[4, 1] (43): X=[4, 2]\nfor j in range(L[1]): # (45): j=0 (47): j=1 (49): NO CHANGE\n\tY[j]*=usingY[j] # (46): Y=[4, 3] (48): Y=[4, 6]\nans=sum(X)*sum(Y) # (50): ans=60\nprint(ans%INF)"], "anno_status": [false], "diff_content": " INF=10**9+7\n L=[int(i)-1 for i in input().split()]\n x=[int(i) for i in input().split()]\n y=[int(i) for i in input().split()]\n x.sort()\n y.sort()\n \n X=[x[i+1]-x[i] for i in range(L[0])]\n Y=[y[i+1]-y[i] for i in range(L[1])]\n \n usingX=[0 for i in range(L[0])]\n usingY=[0 for i in range(L[1])]\n \n if L[0]%2==0:\n \tfor i in range(L[0]):\n \t\ttemp=min(i,L[0]-i-1)\n \t\ttemp+=1\n \t\tusingX[i]+=int(temp*(temp+1)/2)\n \t\t\n \t\tusingX[i]+=temp*int(L[0]/2-temp)\n \t\t\n \t\tusingX[i]*=2\n \t\t\n else:\n \tfor i in range(L[0]):\n \t\ttemp=min(i,L[0]-i-1)\n \t\ttemp+=1\n \t\tusingX[i]+=int(temp*(temp+1)/2)\n \t\tusingX[i]+=temp*int((L[0]-1)/2-temp)\n \t\tusingX[i]*=2\n \t\t\n \t\tusingX[i]+=temp\n \t\n \t\n \n \n if L[1]%2==0:\n \tfor i in range(L[1]):\n \t\ttemp=min(i,L[1]-i-1)\n \t\ttemp+=1\n \t\tusingY[i]+=int(temp*(temp+1)/2)\n \t\t\n \t\tusingY[i]+=temp*int(L[1]/2-temp)\n \t\t\n \t\tusingY[i]*=2\n \t\t\n else:\n \tfor i in range(L[1]):\n \t\ttemp=min(i,L[1]-i-1)\n \t\ttemp+=1\n \t\tusingY[i]+=int(temp*(temp+1)/2)\n \t\tusingY[i]+=temp*int((L[1]-1)/2-temp)\n \t\tusingY[i]*=2\n \t\t\n \t\tusingY[i]+=temp\n \t\n \t\n \n-print(usingX)\n-print(usingY)\n+\n+\n for i in range(L[0]):\n \tX[i]*=usingX[i]\n for j in range(L[1]):\n \tY[j]*=usingY[j]\n ans=sum(X)*sum(Y)\n print(ans%INF)\n", "FL_content": " INF=10**9+7\n L=[int(i)-1 for i in input().split()]\n x=[int(i) for i in input().split()]\n y=[int(i) for i in input().split()]\n x.sort()\n y.sort()\n \n X=[x[i+1]-x[i] for i in range(L[0])]\n Y=[y[i+1]-y[i] for i in range(L[1])]\n \n usingX=[0 for i in range(L[0])]\n usingY=[0 for i in range(L[1])]\n \n if L[0]%2==0:\n \tfor i in range(L[0]):\n \t\ttemp=min(i,L[0]-i-1)\n \t\ttemp+=1\n \t\tusingX[i]+=int(temp*(temp+1)/2)\n \t\t\n \t\tusingX[i]+=temp*int(L[0]/2-temp)\n \t\t\n \t\tusingX[i]*=2\n \t\t\n else:\n \tfor i in range(L[0]):\n \t\ttemp=min(i,L[0]-i-1)\n \t\ttemp+=1\n \t\tusingX[i]+=int(temp*(temp+1)/2)\n \t\tusingX[i]+=temp*int((L[0]-1)/2-temp)\n \t\tusingX[i]*=2\n \t\t\n \t\tusingX[i]+=temp\n \t\n \t\n \n \n if L[1]%2==0:\n \tfor i in range(L[1]):\n \t\ttemp=min(i,L[1]-i-1)\n \t\ttemp+=1\n \t\tusingY[i]+=int(temp*(temp+1)/2)\n \t\t\n \t\tusingY[i]+=temp*int(L[1]/2-temp)\n \t\t\n \t\tusingY[i]*=2\n \t\t\n else:\n \tfor i in range(L[1]):\n \t\ttemp=min(i,L[1]-i-1)\n \t\ttemp+=1\n \t\tusingY[i]+=int(temp*(temp+1)/2)\n \t\tusingY[i]+=temp*int((L[1]-1)/2-temp)\n \t\tusingY[i]*=2\n \t\t\n \t\tusingY[i]+=temp\n \t\n \t\n \n-print(usingX)\n-print(usingY)\n for i in range(L[0]):\n \tX[i]*=usingX[i]\n for j in range(L[1]):\n \tY[j]*=usingY[j]\n ans=sum(X)*sum(Y)\n print(ans%INF)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 66 }, { "user_id": "u964299793", "problem_id": "p03764", "submission1_id": "s992132203", "submission2_id": "s730238556", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod=10**9+7\nn,m=map(int,input().split())\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nansx=0\ncum=x[0]\nfor i in range(1,n):\n ansx+=(i*x[i]-cum+mod)%mod\n ansx%=mod\n cum+=x[i]\nansy=0\ncum=y[0]\nfor i in range(1,m):\n ansy+=(i*y[i]-cum+mod)%mod\n ansy%=mod\n cum+=y[i]\nprint(ansx,ansy)\nprint((ansx*ansy)%mod)\n", "code2": "mod=10**9+7\nn,m=map(int,input().split())\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nansx=0\ncum=x[0]\nfor i in range(1,n):\n ansx+=(i*x[i]-cum+mod)%mod\n ansx%=mod\n cum+=x[i]\nansy=0\ncum=y[0]\nfor i in range(1,m):\n ansy+=(i*y[i]-cum+mod)%mod\n ansy%=mod\n cum+=y[i]\n\nprint((ansx*ansy)%mod)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585980601", "date2": "1585980660", "bleu_score": "0.9472137297333959", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "3 3\n1 3 4\n1 3 6\n", "actual_output": "6 10\n60\n", "expected_output": "60\n", "anno_code": ["mod=10**9+7 # (0): mod=1000000007\nn,m=map(int,input().split()) # (1): n=3, m=3\nx=list(map(int,input().split())) # (2): x=[1, 3, 4]\ny=list(map(int,input().split())) # (3): y=[1, 3, 6]\nansx=0 # (4): ansx=0\ncum=x[0] # (5): cum=1\nfor i in range(1,n): # (6): i=1 (10): i=2 (14): NO CHANGE\n ansx+=(i*x[i]-cum+mod)%mod # (7): ansx=2 (11): ansx=6\n ansx%=mod # (8): NO CHANGE (12): NO CHANGE\n cum+=x[i] # (9): cum=4 (13): cum=8\nansy=0 # (15): ansy=0\ncum=y[0] # (16): cum=1\nfor i in range(1,m): # (17): i=1 (21): i=2 (25): NO CHANGE\n ansy+=(i*y[i]-cum+mod)%mod # (18): ansy=2 (22): ansy=10\n ansy%=mod # (19): NO CHANGE (23): NO CHANGE\n cum+=y[i] # (20): cum=4 (24): cum=10\nprint(ansx,ansy) # (26): NO CHANGE\nprint((ansx*ansy)%mod)\n"], "anno_status": [true], "diff_content": " mod=10**9+7\n n,m=map(int,input().split())\n x=list(map(int,input().split()))\n y=list(map(int,input().split()))\n ansx=0\n cum=x[0]\n for i in range(1,n):\n ansx+=(i*x[i]-cum+mod)%mod\n ansx%=mod\n cum+=x[i]\n ansy=0\n cum=y[0]\n for i in range(1,m):\n ansy+=(i*y[i]-cum+mod)%mod\n ansy%=mod\n cum+=y[i]\n-print(ansx,ansy)\n+\n print((ansx*ansy)%mod)\n \n", "FL_content": " mod=10**9+7\n n,m=map(int,input().split())\n x=list(map(int,input().split()))\n y=list(map(int,input().split()))\n ansx=0\n cum=x[0]\n for i in range(1,n):\n ansx+=(i*x[i]-cum+mod)%mod\n ansx%=mod\n cum+=x[i]\n ansy=0\n cum=y[0]\n for i in range(1,m):\n ansy+=(i*y[i]-cum+mod)%mod\n ansy%=mod\n cum+=y[i]\n-print(ansx,ansy)\n print((ansx*ansy)%mod)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u716530146", "problem_id": "p03714", "submission1_id": "s421355128", "submission2_id": "s257813464", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nimport math\nimport heapq\n\n\ndef input(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n\n\nsys.setrecursionlimit(10**8)\ninf = float('inf')\ncount = 0\nans = -inf\nn = int(input())\nA = list(map(int, input().split()))\nAL = A[:n]\nAR = A[2*n:]\nAL.sort()\nAR.sort(reverse=1)\ni1 = i2 = j1 = j2 = 0\ni = j = 0\nANL = A[n:2*n]\nANR = ANL[::-1]\nLS = sum(AL)\nRS = sum(AR)\nheapq.heapify(AL)\nAR = list(map(lambda ddd: -ddd, AR))\n\nheapq.heapify(AR)\nans = max(ans, LS-RS)\n\nfor count in range(n):\n print(AL,AR)\n \n if ANL[i]-AL[0] > -AR[0]-ANR[j]:\n LS = LS-heapq.heappop(AL)+ANL[i]\n heapq.heappush(AL,ANL[i])\n i += 1\n else:\n RS = RS+heapq.heappop(AR)+ANR[j]\n heapq.heappush(AR,-ANR[j])\n j += 1\n \n ans = max(ans, LS-RS)\nprint(AL,AR)\n\n\n\nprint(ans)\n", "code2": "\nimport sys, math, heapq,copy\ninput = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\nsys.setrecursionlimit(10**8)\ninf = float('inf')\nans=count=0\n\n\nans = -inf\nn = int(input())\nA = list(map(int, input().split()))\nAL, AR = A[:n], A[2*n:]\nal,ar=copy.copy(AL),copy.copy(AR)\nAN = A[n:2*n]\nLS, RS = sum(AL), sum(AR)\nAR = list(map(lambda ddd: -ddd, AR))\nheapq.heapify(AL)\nheapq.heapify(AR)\ntmp=LS\nANSR=[0]*n\nANSL=[0]*n\n\nfor i in range(n):\n if AN[i]-AL[0] >0:\n LS = LS-heapq.heappop(AL)+AN[i]\n heapq.heappush(AL,AN[i])\n ANSL[i] = LS\n\nLS=tmp\nfor j in range(n-1,-1,-1):\n if 0 < -AR[0]-AN[j]:\n RS = RS+heapq.heappop(AR)+AN[j]\n heapq.heappush(AR,-AN[j])\n ANSR[j] = RS\nANSR=ANSR+[sum(ar)]\nANSL=[sum(al)]+ANSL\nfor i in range(n+1):\n ans=max(ans,ANSL[i]-ANSR[i])\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573945204", "date2": "1573949946", "bleu_score": "0.7280430496176337", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n1 2 3\n", "actual_output": "[1] [-3]\n[1] [-2]\n-1\n", "expected_output": "-1\n", "anno_code": ["\nimport sys\nimport math\nimport heapq\n\n\ndef input(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n\n\nsys.setrecursionlimit(10**8) # (0): NO CHANGE\ninf = float('inf') # (1): inf=inf\ncount = 0 # (2): count=0\nans = -inf # (3): ans=-inf\nn = int(input()) # (4): n=1\nA = list(map(int, input().split())) # (5): A=[1, 2, 3]\nAL = A[:n] # (6): AL=[1]\nAR = A[2*n:] # (7): AR=[3]\nAL.sort() # (8): NO CHANGE\nAR.sort(reverse=1) # (9): NO CHANGE\ni1 = i2 = j1 = j2 = 0 # (10): i1=0, i2=0, j1=0, j2=0\ni = j = 0 # (11): i=0, j=0\nANL = A[n:2*n] # (12): ANL=[2]\nANR = ANL[::-1] # (13): ANR=[2]\nLS = sum(AL) # (14): LS=1\nRS = sum(AR) # (15): RS=3\nheapq.heapify(AL) # (16): NO CHANGE\nAR = list(map(lambda ddd: -ddd, AR)) # (17): AR=[-3]\n\nheapq.heapify(AR) # (18): NO CHANGE\nans = max(ans, LS-RS) # (19): ans=-2\n\nfor count in range(n): # (20): NO CHANGE (27): NO CHANGE\n print(AL,AR) # (21): NO CHANGE\n \n if ANL[i]-AL[0] > -AR[0]-ANR[j]: # (22): NO CHANGE\n LS = LS-heapq.heappop(AL)+ANL[i]\n heapq.heappush(AL,ANL[i])\n i += 1\n else:\n RS = RS+heapq.heappop(AR)+ANR[j] # (23): AR=[], RS=2\n heapq.heappush(AR,-ANR[j]) # (24): AR=[-2]\n j += 1 # (25): j=1\n \n ans = max(ans, LS-RS) # (26): ans=-1\nprint(AL,AR) # (28): NO CHANGE\n\n\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n-import sys\n-import math\n-import heapq\n-\n-\n-def input(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n-\n-\n+import sys, math, heapq,copy\n+input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\n sys.setrecursionlimit(10**8)\n inf = float('inf')\n-count = 0\n+ans=count=0\n+\n+\n ans = -inf\n n = int(input())\n A = list(map(int, input().split()))\n-AL = A[:n]\n-AR = A[2*n:]\n-AL.sort()\n-AR.sort(reverse=1)\n-i1 = i2 = j1 = j2 = 0\n-i = j = 0\n-ANL = A[n:2*n]\n-ANR = ANL[::-1]\n-LS = sum(AL)\n-RS = sum(AR)\n-heapq.heapify(AL)\n+AL, AR = A[:n], A[2*n:]\n+al,ar=copy.copy(AL),copy.copy(AR)\n+AN = A[n:2*n]\n+LS, RS = sum(AL), sum(AR)\n AR = list(map(lambda ddd: -ddd, AR))\n-\n+heapq.heapify(AL)\n heapq.heapify(AR)\n-ans = max(ans, LS-RS)\n-\n-for count in range(n):\n- print(AL,AR)\n- \n- if ANL[i]-AL[0] > -AR[0]-ANR[j]:\n- LS = LS-heapq.heappop(AL)+ANL[i]\n- heapq.heappush(AL,ANL[i])\n- i += 1\n- else:\n- RS = RS+heapq.heappop(AR)+ANR[j]\n- heapq.heappush(AR,-ANR[j])\n- j += 1\n- \n- ans = max(ans, LS-RS)\n-print(AL,AR)\n-\n-\n-\n+tmp=LS\n+ANSR=[0]*n\n+ANSL=[0]*n\n+\n+for i in range(n):\n+ if AN[i]-AL[0] >0:\n+ LS = LS-heapq.heappop(AL)+AN[i]\n+ heapq.heappush(AL,AN[i])\n+ ANSL[i] = LS\n+\n+LS=tmp\n+for j in range(n-1,-1,-1):\n+ if 0 < -AR[0]-AN[j]:\n+ RS = RS+heapq.heappop(AR)+AN[j]\n+ heapq.heappush(AR,-AN[j])\n+ ANSR[j] = RS\n+ANSR=ANSR+[sum(ar)]\n+ANSL=[sum(al)]+ANSL\n+for i in range(n+1):\n+ ans=max(ans,ANSL[i]-ANSR[i])\n print(ans)\n \n", "FL_content": " \n-import sys\n-import math\n-import heapq\n-\n-\n-def input(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n-\n-\n sys.setrecursionlimit(10**8)\n inf = float('inf')\n-count = 0\n ans = -inf\n n = int(input())\n A = list(map(int, input().split()))\n-AL = A[:n]\n-AR = A[2*n:]\n-AL.sort()\n-AR.sort(reverse=1)\n-i1 = i2 = j1 = j2 = 0\n-i = j = 0\n-ANL = A[n:2*n]\n-ANR = ANL[::-1]\n-LS = sum(AL)\n-RS = sum(AR)\n-heapq.heapify(AL)\n AR = list(map(lambda ddd: -ddd, AR))\n-\n heapq.heapify(AR)\n-ans = max(ans, LS-RS)\n-\n-for count in range(n):\n- print(AL,AR)\n- \n- if ANL[i]-AL[0] > -AR[0]-ANR[j]:\n- LS = LS-heapq.heappop(AL)+ANL[i]\n- heapq.heappush(AL,ANL[i])\n- i += 1\n- else:\n- RS = RS+heapq.heappop(AR)+ANR[j]\n- heapq.heappush(AR,-ANR[j])\n- j += 1\n- \n- ans = max(ans, LS-RS)\n-print(AL,AR)\n-\n-\n-\n print(ans)\n \n", "added_lines": 30, "removed_lines": 40, "code1_lines": 50 }, { "user_id": "u390193191", "problem_id": "p03714", "submission1_id": "s940490218", "submission2_id": "s711978550", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nn = int(input())\nA = list(map(int, input().split()))\n\npre = [0]*(n+1)\npre_list = [e for e in A[:n]]\nheapq.heapify(pre_list)\npre_sum = sum(pre_list)\npre[0] = pre_sum\nfor i in range(n, 2*n):\n small = heapq.heappushpop(pre_list, A[i])\n pre_sum += A[i] - small\n pre[i-n+1] = pre_sum\n\nsuf = [0]*(n+1)\nsuf_list = [-e for e in A[2*n:]]\nheapq.heapify(suf_list)\nsuf_sum = -sum(suf_list)\nsuf[-1] = suf_sum\nfor i in range(2*n-1, n-1, -1):\n large = -heapq.heappushpop(suf_list, A[i])\n suf_sum += A[i] - large\n suf[i-n] = suf_sum\n\n\n\n\nprint(max([pre[i] - suf[i] for i in range(n+1)]))\n", "code2": "import heapq\n\nn = int(input())\nA = list(map(int, input().split()))\n\npre = [0]*(n+1)\npre_list = [e for e in A[:n]]\nheapq.heapify(pre_list)\npre_sum = sum(pre_list)\npre[0] = pre_sum\nfor i in range(n, 2*n):\n small = heapq.heappushpop(pre_list, A[i])\n pre_sum += A[i] - small\n pre[i-n+1] = pre_sum\n\nsuf = [0]*(n+1)\nsuf_list = [-e for e in A[2*n:]]\nheapq.heapify(suf_list)\nsuf_sum = -sum(suf_list)\nsuf[-1] = suf_sum\nfor i in range(2*n-1, n-1, -1):\n large = -heapq.heappushpop(suf_list, -A[i])\n suf_sum += A[i] - large\n suf[i-n] = suf_sum\n\n\n\n\nprint(max([pre[i] - suf[i] for i in range(n+1)]))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586097445", "date2": "1586097575", "bleu_score": "0.9958454213062967", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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\n3 8 1 2 1 4 -1 6 1\n", "actual_output": "9\n", "expected_output": "12\n\n", "anno_code": ["import heapq\n\nn = int(input()) # (0): n=3\nA = list(map(int, input().split())) # (1): A=[3, 8, 1, 2, 1, 4, -1, 6, 1]\n\npre = [0]*(n+1) # (2): pre=[0, 0, 0, 0]\npre_list = [e for e in A[:n]] # (3): pre_list=[3, 8, 1]\nheapq.heapify(pre_list) # (4): pre_list=[1, 8, 3]\npre_sum = sum(pre_list) # (5): pre_sum=12\npre[0] = pre_sum # (6): pre=[12, 0, 0, 0]\nfor i in range(n, 2*n): # (7): i=3 (11): i=4 ... (19): NO CHANGE\n small = heapq.heappushpop(pre_list, A[i]) # (8): pre_list=[2, 8, 3], small=1 (12): NO CHANGE (16): pre_list=[3, 8, 4], small=2\n pre_sum += A[i] - small # (9): pre_sum=13 (13): NO CHANGE (17): pre_sum=15\n pre[i-n+1] = pre_sum # (10): pre=[12, 13, 0, 0] (14): pre=[12, 13, 13, 0] (18): pre=[12, 13, 13, 15]\n\nsuf = [0]*(n+1) # (20): suf=[0, 0, 0, 0]\nsuf_list = [-e for e in A[2*n:]] # (21): suf_list=[1, -6, -1]\nheapq.heapify(suf_list) # (22): suf_list=[-6, 1, -1]\nsuf_sum = -sum(suf_list) # (23): suf_sum=6\nsuf[-1] = suf_sum # (24): suf=[0, 0, 0, 6]\nfor i in range(2*n-1, n-1, -1): # (25): NO CHANGE (29): i=4 ... (37): NO CHANGE\n large = -heapq.heappushpop(suf_list, A[i]) # (26): suf_list=[-1, 1, 4], large=6 (30): suf_list=[1, 1, 4], large=1 (34): suf_list=[1, 2, 4], large=-1\n suf_sum += A[i] - large # (27): suf_sum=4 (31): NO CHANGE (35): suf_sum=7\n suf[i-n] = suf_sum # (28): suf=[0, 0, 4, 6] (32): suf=[0, 4, 4, 6] (36): suf=[7, 4, 4, 6]\n\n\n\n\nprint(max([pre[i] - suf[i] for i in range(n+1)]))\n"], "anno_status": [true], "diff_content": " import heapq\n \n n = int(input())\n A = list(map(int, input().split()))\n \n pre = [0]*(n+1)\n pre_list = [e for e in A[:n]]\n heapq.heapify(pre_list)\n pre_sum = sum(pre_list)\n pre[0] = pre_sum\n for i in range(n, 2*n):\n small = heapq.heappushpop(pre_list, A[i])\n pre_sum += A[i] - small\n pre[i-n+1] = pre_sum\n \n suf = [0]*(n+1)\n suf_list = [-e for e in A[2*n:]]\n heapq.heapify(suf_list)\n suf_sum = -sum(suf_list)\n suf[-1] = suf_sum\n for i in range(2*n-1, n-1, -1):\n- large = -heapq.heappushpop(suf_list, A[i])\n+ large = -heapq.heappushpop(suf_list, -A[i])\n suf_sum += A[i] - large\n suf[i-n] = suf_sum\n \n \n \n \n print(max([pre[i] - suf[i] for i in range(n+1)]))\n \n", "FL_content": " import heapq\n \n n = int(input())\n A = list(map(int, input().split()))\n \n pre = [0]*(n+1)\n pre_list = [e for e in A[:n]]\n heapq.heapify(pre_list)\n pre_sum = sum(pre_list)\n pre[0] = pre_sum\n for i in range(n, 2*n):\n small = heapq.heappushpop(pre_list, A[i])\n pre_sum += A[i] - small\n pre[i-n+1] = pre_sum\n \n suf = [0]*(n+1)\n suf_list = [-e for e in A[2*n:]]\n heapq.heapify(suf_list)\n suf_sum = -sum(suf_list)\n suf[-1] = suf_sum\n for i in range(2*n-1, n-1, -1):\n- large = -heapq.heappushpop(suf_list, A[i])\n suf_sum += A[i] - large\n suf[i-n] = suf_sum\n \n \n \n \n print(max([pre[i] - suf[i] for i in range(n+1)]))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 30 }, { "user_id": "u826263061", "problem_id": "p03714", "submission1_id": "s513917148", "submission2_id": "s683760020", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nn = int(input())\na = list(map(int, input().split()))\n\na1 = a[:n]\nax = a[n:2*n]\na2 = list(map(lambda x: -x, a[2*n:]))\nprint('a2', a2)\n\nsum_a1 = sum(a1)\nfdif1 = [sum_a1]\nheapq.heapify(a1)\nfor i in range(n):\n p = heapq.heappushpop(a1,ax[i])\n fdif1.append(fdif1[-1]+ax[i]-p)\n \nsum_a2 = sum(a2)\nfdif2 = [sum_a2]\nheapq.heapify(a2)\nprint('a2', a2)\nfor i in range(n):\n p = heapq.heappushpop(a2,-ax[-1-i])\n fdif2.append(fdif2[-1]-ax[-1-i]-p)\nfdif2.reverse()\n\nfdif = [fdif1[i]+fdif2[i] for i in range(n)]\nprint(max(fdif))", "code2": "import heapq\nn = int(input())\na = list(map(int, input().split()))\n\na1 = a[:n]\nax = a[n:2*n]\na2 = list(map(lambda x: -x, a[2*n:]))\n\n\nsum_a1 = sum(a1)\nfdif1 = [sum_a1]\nheapq.heapify(a1)\nfor i in range(n):\n p = heapq.heappushpop(a1,ax[i])\n fdif1.append(fdif1[-1]+ax[i]-p)\n \nsum_a2 = sum(a2)\nfdif2 = [sum_a2]\nheapq.heapify(a2)\n\nfor i in range(n):\n p = heapq.heappushpop(a2,-ax[-1-i])\n fdif2.append(fdif2[-1]-ax[-1-i]-p)\nfdif2.reverse()\n\nfdif = [fdif1[i]+fdif2[i] for i in range(n+1)]\nprint(max(fdif))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537197689", "date2": "1537197938", "bleu_score": "0.9355035814215856", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n3 1 4 1 7 0\n", "actual_output": "a2 [-7, 0]\na2 [-7, 0]\n6\n", "expected_output": "6\n\n", "anno_code": ["import heapq\nn = int(input()) # (0): n=2\na = list(map(int, input().split())) # (1): a=[3, 1, 4, 1, 7, 0]\n\na1 = a[:n] # (2): a1=[3, 1]\nax = a[n:2*n] # (3): ax=[4, 1]\na2 = list(map(lambda x: -x, a[2*n:])) # (4): a2=[-7, 0]\nprint('a2', a2) # (5): NO CHANGE\n\nsum_a1 = sum(a1) # (6): sum_a1=4\nfdif1 = [sum_a1] # (7): fdif1=[4]\nheapq.heapify(a1) # (8): a1=[1, 3]\nfor i in range(n): # (9): i=0 (12): i=1 (15): NO CHANGE\n p = heapq.heappushpop(a1,ax[i]) # (10): a1=[3, 4], p=1 (13): NO CHANGE\n fdif1.append(fdif1[-1]+ax[i]-p) # (11): fdif1=[4, 7] (14): fdif1=[4, 7, 7]\n \nsum_a2 = sum(a2) # (16): sum_a2=-7\nfdif2 = [sum_a2] # (17): fdif2=[-7]\nheapq.heapify(a2) # (18): NO CHANGE\nprint('a2', a2) # (19): NO CHANGE\nfor i in range(n): # (20): i=0 (23): i=1 (26): NO CHANGE\n p = heapq.heappushpop(a2,-ax[-1-i]) # (21): a2=[-1, 0], p=-7 (24): p=-4\n fdif2.append(fdif2[-1]-ax[-1-i]-p) # (22): fdif2=[-7, -1] (25): fdif2=[-7, -1, -1]\nfdif2.reverse() # (27): fdif2=[-1, -1, -7]\n\nfdif = [fdif1[i]+fdif2[i] for i in range(n)] # (28): fdif=[3, 6]\nprint(max(fdif))"], "anno_status": [true], "diff_content": " import heapq\n n = int(input())\n a = list(map(int, input().split()))\n \n a1 = a[:n]\n ax = a[n:2*n]\n a2 = list(map(lambda x: -x, a[2*n:]))\n-print('a2', a2)\n+\n \n sum_a1 = sum(a1)\n fdif1 = [sum_a1]\n heapq.heapify(a1)\n for i in range(n):\n p = heapq.heappushpop(a1,ax[i])\n fdif1.append(fdif1[-1]+ax[i]-p)\n \n sum_a2 = sum(a2)\n fdif2 = [sum_a2]\n heapq.heapify(a2)\n-print('a2', a2)\n+\n for i in range(n):\n p = heapq.heappushpop(a2,-ax[-1-i])\n fdif2.append(fdif2[-1]-ax[-1-i]-p)\n fdif2.reverse()\n \n-fdif = [fdif1[i]+fdif2[i] for i in range(n)]\n+fdif = [fdif1[i]+fdif2[i] for i in range(n+1)]\n print(max(fdif))\n", "FL_content": " import heapq\n n = int(input())\n a = list(map(int, input().split()))\n \n a1 = a[:n]\n ax = a[n:2*n]\n a2 = list(map(lambda x: -x, a[2*n:]))\n-print('a2', a2)\n \n sum_a1 = sum(a1)\n fdif1 = [sum_a1]\n heapq.heapify(a1)\n for i in range(n):\n p = heapq.heappushpop(a1,ax[i])\n fdif1.append(fdif1[-1]+ax[i]-p)\n \n sum_a2 = sum(a2)\n fdif2 = [sum_a2]\n heapq.heapify(a2)\n-print('a2', a2)\n for i in range(n):\n p = heapq.heappushpop(a2,-ax[-1-i])\n fdif2.append(fdif2[-1]-ax[-1-i]-p)\n fdif2.reverse()\n \n-fdif = [fdif1[i]+fdif2[i] for i in range(n)]\n print(max(fdif))\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 27 }, { "user_id": "u638795007", "problem_id": "p03714", "submission1_id": "s142152285", "submission2_id": "s555302363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def examD():\n N = I()\n a = LI()\n a_b = list(map(lambda x: x*(-1), a))\n R = a[:N]; B = a_b[2*N:]\n heapq.heapify(R)\n heapq.heapify(B)\n ansC =[]\n curR = [sum(R)]; curB = [-sum(B)]\n for i in range(N):\n heapq.heappush(R, a[N+i])\n cur = curR[-1] - heapq.heappop(R) + a[N+i]\n curR.append(cur)\n for i in range(N):\n heapq.heappush(B, a_b[2*N-1-i])\n cur =curB[-1] - heapq.heappop(B)*(-1) - a_b[2*N-1-i]\n curB.append(cur)\n for i in range(N):\n ansC.append(curR[i]-curB[-1-i])\n ans = max(ansC)\n print(ans)\n\n\n\n\nimport sys\nimport copy\nimport bisect\nimport heapq\nfrom collections import Counter,defaultdict,deque\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\ndef LS(): return sys.stdin.readline().split()\ndef S(): return sys.stdin.readline().strip()\nmod = 10**9 + 7\ninf = float('inf')\n\nexamD()\n", "code2": "def examD():\n N = I()\n a = LI()\n a_b = list(map(lambda x: x*(-1), a))\n R = a[:N]; B = a_b[2*N:]\n heapq.heapify(R)\n heapq.heapify(B)\n ansC =[]\n curR = [sum(R)]; curB = [-sum(B)]\n for i in range(N):\n heapq.heappush(R, a[N+i])\n cur = curR[-1] - heapq.heappop(R) + a[N+i]\n curR.append(cur)\n for i in range(N):\n heapq.heappush(B, a_b[2*N-1-i])\n cur =curB[-1] - heapq.heappop(B)*(-1) - a_b[2*N-1-i]\n curB.append(cur)\n for i in range(N+1):\n ansC.append(curR[i]-curB[-1-i])\n ans = max(ansC)\n print(ans)\n\n\n\n\nimport sys\nimport copy\nimport bisect\nimport heapq\nfrom collections import Counter,defaultdict,deque\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\ndef LS(): return sys.stdin.readline().split()\ndef S(): return sys.stdin.readline().strip()\nmod = 10**9 + 7\ninf = float('inf')\n\nexamD()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573624596", "date2": "1573624681", "bleu_score": "0.996207857939182", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 78, "total_score": 102, "input": "1\n0 1 -1\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["def examD(): # (0): examD=, sys=, copy=, bisect=, heapq=, Counter=, defaultdict=, deque=, I=, LI=, LS=, S=\n N = I() # (4): N=1\n a = LI() # (5): a=[0, 1, -1]\n a_b = list(map(lambda x: x*(-1), a)) # (6): a_b=[0, -1, 1]\n R = a[:N]; B = a_b[2*N:] # (7): R=[0], B=[1]\n heapq.heapify(R) # (8): NO CHANGE\n heapq.heapify(B) # (9): NO CHANGE\n ansC =[] # (10): ansC=[]\n curR = [sum(R)]; curB = [-sum(B)] # (11): curR=[0], curB=[-1]\n for i in range(N): # (12): i=0 (16): NO CHANGE\n heapq.heappush(R, a[N+i]) # (13): R=[0, 1]\n cur = curR[-1] - heapq.heappop(R) + a[N+i] # (14): R=[1], cur=1\n curR.append(cur) # (15): curR=[0, 1]\n for i in range(N): # (17): NO CHANGE (21): NO CHANGE\n heapq.heappush(B, a_b[2*N-1-i]) # (18): B=[-1, 1]\n cur =curB[-1] - heapq.heappop(B)*(-1) - a_b[2*N-1-i] # (19): B=[1], cur=-1\n curB.append(cur) # (20): curB=[-1, -1]\n for i in range(N): # (22): NO CHANGE (24): NO CHANGE\n ansC.append(curR[i]-curB[-1-i]) # (23): ansC=[1]\n ans = max(ansC) # (25): ans=1\n print(ans)\n\n\n\n\nimport sys\nimport copy\nimport bisect\nimport heapq\nfrom collections import Counter,defaultdict,deque\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\ndef LS(): return sys.stdin.readline().split()\ndef S(): return sys.stdin.readline().strip()\nmod = 10**9 + 7 # (1): mod=1000000007\ninf = float('inf') # (2): inf=inf\n\nexamD() # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def examD():\n N = I()\n a = LI()\n a_b = list(map(lambda x: x*(-1), a))\n R = a[:N]; B = a_b[2*N:]\n heapq.heapify(R)\n heapq.heapify(B)\n ansC =[]\n curR = [sum(R)]; curB = [-sum(B)]\n for i in range(N):\n heapq.heappush(R, a[N+i])\n cur = curR[-1] - heapq.heappop(R) + a[N+i]\n curR.append(cur)\n for i in range(N):\n heapq.heappush(B, a_b[2*N-1-i])\n cur =curB[-1] - heapq.heappop(B)*(-1) - a_b[2*N-1-i]\n curB.append(cur)\n- for i in range(N):\n+ for i in range(N+1):\n ansC.append(curR[i]-curB[-1-i])\n ans = max(ansC)\n print(ans)\n \n \n \n \n import sys\n import copy\n import bisect\n import heapq\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 LS(): return sys.stdin.readline().split()\n def S(): return sys.stdin.readline().strip()\n mod = 10**9 + 7\n inf = float('inf')\n \n examD()\n \n", "FL_content": " def examD():\n N = I()\n a = LI()\n a_b = list(map(lambda x: x*(-1), a))\n R = a[:N]; B = a_b[2*N:]\n heapq.heapify(R)\n heapq.heapify(B)\n ansC =[]\n curR = [sum(R)]; curB = [-sum(B)]\n for i in range(N):\n heapq.heappush(R, a[N+i])\n cur = curR[-1] - heapq.heappop(R) + a[N+i]\n curR.append(cur)\n for i in range(N):\n heapq.heappush(B, a_b[2*N-1-i])\n cur =curB[-1] - heapq.heappop(B)*(-1) - a_b[2*N-1-i]\n curB.append(cur)\n- for i in range(N):\n ansC.append(curR[i]-curB[-1-i])\n ans = max(ansC)\n print(ans)\n \n \n \n \n import sys\n import copy\n import bisect\n import heapq\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 LS(): return sys.stdin.readline().split()\n def S(): return sys.stdin.readline().strip()\n mod = 10**9 + 7\n inf = float('inf')\n \n examD()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 39 }, { "user_id": "u964299793", "problem_id": "p03714", "submission1_id": "s302652555", "submission2_id": "s828458150", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\nn=int(input())\na=list(map(int,input().split()))\nimport heapq as hq\nf1=[0]*(3*n)\nf1[n-1]=sum(a[:n])\nh=copy.deepcopy(a[:n])\nhq.heapify(h)\nsu=f1[n-1]\nfor i in range(n,2*n):\n cur=a[i]\n x=hq.heappop(h)\n if cur>x:\n su-=x\n su+=cur\n hq.heappush(h,cur)\n else:\n hq.heappush(h,x)\n f1[i]=su\nf2=[0]*(3*n)\nf2[2*n]=sum(a[2*n:])\nsu=f2[2*n]\nh2=[]\nfor i in a[2*n:]:\n h2.append(-i)\nhq.heapify(h2)\nfor i in range(2*n-1,n-1,-1):\n cur=a[i]\n x=-1*hq.heappop(h2)\n if curx:\n su-=x\n su+=cur\n hq.heappush(h,cur)\n else:\n hq.heappush(h,x)\n f1[i]=su\nf2=[0]*(3*n)\nf2[2*n]=sum(a[2*n:])\nsu=f2[2*n]\nh2=[]\nfor i in a[2*n:]:\n h2.append(-i)\nhq.heapify(h2)\nfor i in range(2*n-1,n-1,-1):\n cur=a[i]\n x=-1*hq.heappop(h2)\n if cur\nimport heapq as hq\nf1=[0]*(3*n) # (2): f1=[0, 0, 0, 0, 0, 0, 0, 0, 0]\nf1[n-1]=sum(a[:n]) # (3): f1=[0, 0, 12, 0, 0, 0, 0, 0, 0]\nh=copy.deepcopy(a[:n]) # (4): h=[3, 8, 1]\nhq.heapify(h) # (5): h=[1, 8, 3]\nsu=f1[n-1] # (6): su=12\nfor i in range(n,2*n): # (7): i=3 (15): i=4 ... (29): NO CHANGE\n cur=a[i] # (8): cur=2 (16): cur=1 (22): cur=4\n x=hq.heappop(h) # (9): h=[3, 8], x=1 (17): h=[3, 8], x=2 (23): h=[3, 8]\n if cur>x: # (10): NO CHANGE (18): NO CHANGE (24): NO CHANGE\n su-=x # (11): su=11 (25): su=11\n su+=cur # (12): su=13 (26): su=15\n hq.heappush(h,cur) # (13): h=[2, 8, 3] (27): h=[3, 8, 4]\n else:\n hq.heappush(h,x) # (19): h=[2, 8, 3]\n f1[i]=su # (14): f1=[0, 0, 12, 13, 0, 0, 0, 0, 0] (20): f1=[0, 0, 12, 13, 13, 0, 0, 0, 0] (28): f1=[0, 0, 12, 13, 13, 15, 0, 0, 0]\nf2=[0]*(3*n) # (30): f2=[0, 0, 0, 0, 0, 0, 0, 0, 0]\nf2[2*n]=sum(a[2*n:]) # (31): f2=[0, 0, 0, 0, 0, 0, 6, 0, 0]\nsu=f2[2*n] # (32): su=6\nh2=[] # (33): h2=[]\nfor i in a[2*n:]: # (34): i=-1 (36): i=6 ... (40): NO CHANGE\n h2.append(-i) # (35): h2=[1] (37): h2=[1, -6] (39): h2=[1, -6, -1]\nhq.heapify(h2) # (41): h2=[-6, 1, -1]\nfor i in range(2*n-1,n-1,-1): # (42): i=5 (50): i=4 ... (62): NO CHANGE\n cur=a[i] # (43): NO CHANGE (51): cur=1 (57): cur=2\n x=-1*hq.heappop(h2) # (44): x=6, h2=[-1, 1] (52): x=1, h2=[1, 4] (58): h2=[1, 4]\n if curx:\n su-=x\n su+=cur\n hq.heappush(h,cur)\n else:\n hq.heappush(h,x)\n f1[i]=su\n f2=[0]*(3*n)\n f2[2*n]=sum(a[2*n:])\n su=f2[2*n]\n h2=[]\n for i in a[2*n:]:\n h2.append(-i)\n hq.heapify(h2)\n for i in range(2*n-1,n-1,-1):\n cur=a[i]\n x=-1*hq.heappop(h2)\n if curx:\n su-=x\n su+=cur\n hq.heappush(h,cur)\n else:\n hq.heappush(h,x)\n f1[i]=su\n f2=[0]*(3*n)\n f2[2*n]=sum(a[2*n:])\n su=f2[2*n]\n h2=[]\n for i in a[2*n:]:\n h2.append(-i)\n hq.heapify(h2)\n for i in range(2*n-1,n-1,-1):\n cur=a[i]\n x=-1*hq.heappop(h2)\n if cur= A[i]:\n heapq.heappush(left,l)\n left_total.append(left_total[-1])\n \n else:\n heapq.heappush(left,A[i])\n left_total.append(left_total[-1] - l + A[i])\n\n\nright = [-i for i in A[2*N:]]\nright_total = [sum(right)]\nheapq.heapify(right)\n\nfor i in reversed(range(N, 2*N)):\n r = heapq.heappop(right)\n \n if r >= -1*A[i]:\n heapq.heappush(right, r)\n right_total.append(right_total[-1])\n else:\n heapq.heappush(right, A[i])\n right_total.append(right_total[-1] - r - A[i])\n\n\nright_total = right_total[::-1]\n\nans = -float(\"inf\")\nfor i in range(len(left_total)):\n ans = max(ans, left_total[i] + right_total[i])\n\nprint(ans)", "code2": "n = int(input())\na = list(map(int, input().split()))\n\nimport heapq\n\nlefts = a[:n]\nlefts_sums = [sum(lefts)]\nheapq.heapify(lefts)\n\nfor x in range(n, 2 * n):\n l = heapq.heappop(lefts)\n if l < a[x]:\n heapq.heappush(lefts, a[x])\n lefts_sums.append(lefts_sums[-1] - l + a[x])\n else:\n heapq.heappush(lefts, l)\n lefts_sums.append(lefts_sums[-1])\n\nrights = [-_a for _a in a[2 * n:]]\nrights_sums = [sum(rights)]\nheapq.heapify(rights)\n\nfor x in reversed(range(n, 2 * n)):\n r = heapq.heappop(rights)\n if r < -a[x]:\n heapq.heappush(rights, -a[x])\n rights_sums.append(rights_sums[-1] - r - a[x])\n else:\n heapq.heappush(rights, r)\n rights_sums.append(rights_sums[-1])\n\nrights_sums = rights_sums[::-1]\nans = -float('inf')\nfor i in range(len(lefts_sums)):\n ans = max(ans, lefts_sums[i] + rights_sums[i])\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577377463", "date2": "1577378038", "bleu_score": "0.7434484977365007", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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\n3 8 1 2 1 4 -1 6 1\n", "actual_output": "9\n", "expected_output": "12\n\n", "anno_code": ["import heapq\n\nN = int(input()) # (0): N=3\n\nA = list(map(int, input().split())) # (1): A=[3, 8, 1, 2, 1, 4, -1, 6, 1]\n\nleft = A[:N] # (2): left=[3, 8, 1]\nleft_total = [(sum(left))] # (3): left_total=[12]\nheapq.heapify(left) # (4): left=[1, 8, 3]\n\nfor i in range(N, 2*N): # (5): i=3 (10): i=4 ... (20): NO CHANGE\n l = heapq.heappop(left) # (6): left=[3, 8], l=1 (11): left=[3, 8], l=2 (16): left=[3, 8]\n \n if l >= A[i]: # (7): NO CHANGE (12): NO CHANGE (17): NO CHANGE\n heapq.heappush(left,l) # (13): left=[2, 8, 3]\n left_total.append(left_total[-1]) # (14): left_total=[12, 13, 13]\n \n else:\n heapq.heappush(left,A[i]) # (8): left=[2, 8, 3] (18): left=[3, 8, 4]\n left_total.append(left_total[-1] - l + A[i]) # (9): left_total=[12, 13] (19): left_total=[12, 13, 13, 15]\n\n\nright = [-i for i in A[2*N:]] # (21): right=[1, -6, -1]\nright_total = [sum(right)] # (22): right_total=[-6]\nheapq.heapify(right) # (23): right=[-6, 1, -1]\n\nfor i in reversed(range(N, 2*N)): # (24): NO CHANGE (29): i=4 ... (39): NO CHANGE\n r = heapq.heappop(right) # (25): right=[-1, 1], r=-6 (30): right=[1, 4], r=-1 (35): right=[1, 4]\n \n if r >= -1*A[i]: # (26): NO CHANGE (31): NO CHANGE (36): NO CHANGE\n heapq.heappush(right, r) # (32): right=[-1, 4, 1] (37): right=[-1, 4, 1]\n right_total.append(right_total[-1]) # (33): right_total=[-6, -4, -4] (38): right_total=[-6, -4, -4, -4]\n else:\n heapq.heappush(right, A[i]) # (27): right=[-1, 1, 4]\n right_total.append(right_total[-1] - r - A[i]) # (28): right_total=[-6, -4]\n\n\nright_total = right_total[::-1] # (40): right_total=[-4, -4, -4, -6]\n\nans = -float(\"inf\") # (41): ans=-inf\nfor i in range(len(left_total)): # (42): i=0 (44): i=1 ... (50): NO CHANGE\n ans = max(ans, left_total[i] + right_total[i]) # (43): ans=8 (45): ans=9 ... (49): NO CHANGE\n\nprint(ans)"], "anno_status": [true], "diff_content": "-import heapq\n-\n-N = int(input())\n+n = int(input())\n+a = list(map(int, input().split()))\n \n-A = list(map(int, input().split()))\n+import heapq\n \n-left = A[:N]\n-left_total = [(sum(left))]\n-heapq.heapify(left)\n+lefts = a[:n]\n+lefts_sums = [sum(lefts)]\n+heapq.heapify(lefts)\n \n-for i in range(N, 2*N):\n- l = heapq.heappop(left)\n- \n- if l >= A[i]:\n- heapq.heappush(left,l)\n- left_total.append(left_total[-1])\n- \n+for x in range(n, 2 * n):\n+ l = heapq.heappop(lefts)\n+ if l < a[x]:\n+ heapq.heappush(lefts, a[x])\n+ lefts_sums.append(lefts_sums[-1] - l + a[x])\n else:\n- heapq.heappush(left,A[i])\n- left_total.append(left_total[-1] - l + A[i])\n-\n-\n-right = [-i for i in A[2*N:]]\n-right_total = [sum(right)]\n-heapq.heapify(right)\n-\n-for i in reversed(range(N, 2*N)):\n- r = heapq.heappop(right)\n- \n- if r >= -1*A[i]:\n- heapq.heappush(right, r)\n- right_total.append(right_total[-1])\n+ heapq.heappush(lefts, l)\n+ lefts_sums.append(lefts_sums[-1])\n+\n+rights = [-_a for _a in a[2 * n:]]\n+rights_sums = [sum(rights)]\n+heapq.heapify(rights)\n+\n+for x in reversed(range(n, 2 * n)):\n+ r = heapq.heappop(rights)\n+ if r < -a[x]:\n+ heapq.heappush(rights, -a[x])\n+ rights_sums.append(rights_sums[-1] - r - a[x])\n else:\n- heapq.heappush(right, A[i])\n- right_total.append(right_total[-1] - r - A[i])\n-\n+ heapq.heappush(rights, r)\n+ rights_sums.append(rights_sums[-1])\n \n-right_total = right_total[::-1]\n-\n-ans = -float(\"inf\")\n-for i in range(len(left_total)):\n- ans = max(ans, left_total[i] + right_total[i])\n+rights_sums = rights_sums[::-1]\n+ans = -float('inf')\n+for i in range(len(lefts_sums)):\n+ ans = max(ans, lefts_sums[i] + rights_sums[i])\n \n print(ans)\n+\n", "FL_content": "-import heapq\n-\n-N = int(input())\n \n-A = list(map(int, input().split()))\n \n-left = A[:N]\n-left_total = [(sum(left))]\n-heapq.heapify(left)\n \n-for i in range(N, 2*N):\n- l = heapq.heappop(left)\n- \n- if l >= A[i]:\n- heapq.heappush(left,l)\n- left_total.append(left_total[-1])\n- \n else:\n- heapq.heappush(left,A[i])\n- left_total.append(left_total[-1] - l + A[i])\n-\n-\n-right = [-i for i in A[2*N:]]\n-right_total = [sum(right)]\n-heapq.heapify(right)\n-\n-for i in reversed(range(N, 2*N)):\n- r = heapq.heappop(right)\n- \n- if r >= -1*A[i]:\n- heapq.heappush(right, r)\n- right_total.append(right_total[-1])\n else:\n- heapq.heappush(right, A[i])\n- right_total.append(right_total[-1] - r - A[i])\n-\n \n-right_total = right_total[::-1]\n-\n-ans = -float(\"inf\")\n-for i in range(len(left_total)):\n- ans = max(ans, left_total[i] + right_total[i])\n \n print(ans)\n", "added_lines": 30, "removed_lines": 36, "code1_lines": 44 }, { "user_id": "u316464887", "problem_id": "p03714", "submission1_id": "s062626531", "submission2_id": "s000250781", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n fl = [i for i in A[:N]]\n f = [sum(A[:N])]\n heapq.heapify(fl)\n ll = [-i for i in A[2*N:]]\n l = [sum(A[2*N:])]\n heapq.heapify(ll)\n for i in range(N):\n s = f[-1]\n if A[N+i] > fl[0]:\n s = s - fl[0] + A[N+i]\n heapq.heappushpop(fl, A[N+i])\n f.append(s)\n s = l[-1]\n if - A[2*N-1-i] > ll[0]:\n s = s + ll[0] + A[2*N-1-i]\n heapq.heappushpop(ll, -A[2*N-1-i])\n l.append(s)\n r = -pow(10, 100)\n for i in range(N):\n r = max(r, f[i] - l[-1-i])\n return r\nprint(main())\n", "code2": "import heapq\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n fl = [i for i in A[:N]]\n f = [sum(A[:N])]\n heapq.heapify(fl)\n ll = [-i for i in A[2*N:]]\n l = [sum(A[2*N:])]\n heapq.heapify(ll)\n for i in range(N):\n s = f[-1]\n if A[N+i] > fl[0]:\n s = s - fl[0] + A[N+i]\n heapq.heappushpop(fl, A[N+i])\n f.append(s)\n s = l[-1]\n if - A[2*N-1-i] > ll[0]:\n s = s + ll[0] + A[2*N-1-i]\n heapq.heappushpop(ll, -A[2*N-1-i])\n l.append(s)\n r = f[0] - l[-1]\n for i in range(N+1):\n r = max(r, f[i] - l[-1-i])\n return r\nprint(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587864628", "date2": "1587865050", "bleu_score": "0.9765377034455976", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 78, "total_score": 102, "input": "1\n-1 1 0\n", "actual_output": "-1\n", "expected_output": "1\n\n", "anno_code": ["import heapq\ndef main(): # (0): main=\n N = int(input()) # (2): N=1\n A = list(map(int, input().split())) # (3): A=[-1, 1, 0]\n fl = [i for i in A[:N]] # (4): fl=[-1]\n f = [sum(A[:N])] # (5): f=[-1]\n heapq.heapify(fl) # (6): NO CHANGE\n ll = [-i for i in A[2*N:]] # (7): ll=[0]\n l = [sum(A[2*N:])] # (8): l=[0]\n heapq.heapify(ll) # (9): NO CHANGE\n for i in range(N): # (10): i=0 (19): NO CHANGE\n s = f[-1] # (11): s=-1\n if A[N+i] > fl[0]: # (12): NO CHANGE\n s = s - fl[0] + A[N+i] # (13): s=1\n heapq.heappushpop(fl, A[N+i]) # (14): fl=[1]\n f.append(s) # (15): f=[-1, 1]\n s = l[-1] # (16): s=0\n if - A[2*N-1-i] > ll[0]: # (17): NO CHANGE\n s = s + ll[0] + A[2*N-1-i]\n heapq.heappushpop(ll, -A[2*N-1-i])\n l.append(s) # (18): l=[0, 0]\n r = -pow(10, 100) # (20): r=-10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n for i in range(N): # (21): NO CHANGE\n r = max(r, f[i] - l[-1-i]) # (22): r=-1\n return r\nprint(main()) # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import heapq\n def main():\n N = int(input())\n A = list(map(int, input().split()))\n fl = [i for i in A[:N]]\n f = [sum(A[:N])]\n heapq.heapify(fl)\n ll = [-i for i in A[2*N:]]\n l = [sum(A[2*N:])]\n heapq.heapify(ll)\n for i in range(N):\n s = f[-1]\n if A[N+i] > fl[0]:\n s = s - fl[0] + A[N+i]\n heapq.heappushpop(fl, A[N+i])\n f.append(s)\n s = l[-1]\n if - A[2*N-1-i] > ll[0]:\n s = s + ll[0] + A[2*N-1-i]\n heapq.heappushpop(ll, -A[2*N-1-i])\n l.append(s)\n- r = -pow(10, 100)\n- for i in range(N):\n+ r = f[0] - l[-1]\n+ for i in range(N+1):\n r = max(r, f[i] - l[-1-i])\n return r\n print(main())\n \n", "FL_content": " import heapq\n def main():\n N = int(input())\n A = list(map(int, input().split()))\n fl = [i for i in A[:N]]\n f = [sum(A[:N])]\n heapq.heapify(fl)\n ll = [-i for i in A[2*N:]]\n l = [sum(A[2*N:])]\n heapq.heapify(ll)\n for i in range(N):\n s = f[-1]\n if A[N+i] > fl[0]:\n s = s - fl[0] + A[N+i]\n heapq.heappushpop(fl, A[N+i])\n f.append(s)\n s = l[-1]\n if - A[2*N-1-i] > ll[0]:\n s = s + ll[0] + A[2*N-1-i]\n heapq.heappushpop(ll, -A[2*N-1-i])\n l.append(s)\n- r = -pow(10, 100)\n- for i in range(N):\n r = max(r, f[i] - l[-1-i])\n return r\n print(main())\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 27 }, { "user_id": "u309977459", "problem_id": "p03714", "submission1_id": "s069521748", "submission2_id": "s042242806", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nfrom collections import deque\nN = int(input())\nA = list(map(int, input().split()))\n\nal = A[:N]\nar = [-a for a in A[2*N:]]\nac = deque(A[N:2*N])\nheapq.heapify(al)\nheapq.heapify(ar)\nfor i in range(N):\n gl = ac[0] - al[0]\n gr = -ar[0] - ac[-1]\n if gl < 0 and gr < 0:\n ac.pop()\n elif gl > gr:\n heapq.heappop(al)\n tmp = ac.popleft()\n heapq.heappush(al, tmp)\n else:\n heapq.heappop(ar)\n tmp = ac.pop()\n heapq.heappush(ar, -tmp)\nprint(sum(al)+sum(ar))\n", "code2": "import heapq\nN = int(input())\nA = list(map(int, input().split()))\n\nal = A[:N]\nheapq.heapify(al)\nsal = sum(al)\nsuml = [sal]\nfor i in range(N, 2*N):\n if al[0] < A[i]:\n tmp = heapq.heappop(al)\n heapq.heappush(al, A[i])\n sal += A[i]-tmp\n suml.append(sal)\n\nar = [-a for a in A[2*N:]]\nheapq.heapify(ar)\nsar = -sum(ar)\nsumr = [sar]\n\nans = -10**15\nfor i in range(N, 2*N):\n if -ar[0] > A[3*N-1-i]:\n tmp = -heapq.heappop(ar)\n heapq.heappush(ar, -A[3*N-1-i])\n sar += A[3*N-1-i]-tmp\n sumr.append(sar)\nfor i in range(len(suml)):\n ans = max(ans, suml[i]-sumr[-(i+1)])\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548445660", "date2": "1548449272", "bleu_score": "0.6183812693062768", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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\n23 1 2 -2 1 12 -2 -1 3\n", "actual_output": "31\n", "expected_output": "37\n\n", "anno_code": ["import heapq\nfrom collections import deque\nN = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[23, 1, 2, -2, 1, 12, -2, -1, 3]\n\nal = A[:N] # (2): al=[23, 1, 2]\nar = [-a for a in A[2*N:]] # (3): ar=[2, 1, -3]\nac = deque(A[N:2*N]) # (4): ac=deque([])\nheapq.heapify(al) # (5): al=[1, 23, 2]\nheapq.heapify(ar) # (6): ar=[-3, 1, 2]\nfor i in range(N): # (7): i=0 (12): i=1 ... (28): NO CHANGE\n gl = ac[0] - al[0] # (8): gl=-3 (13): NO CHANGE (21): NO CHANGE\n gr = -ar[0] - ac[-1] # (9): gr=-9 (14): gr=2 (22): gr=3\n if gl < 0 and gr < 0: # (10): NO CHANGE (15): NO CHANGE (23): NO CHANGE\n ac.pop() # (11): NO CHANGE\n elif gl > gr: # (16): NO CHANGE (24): NO CHANGE\n heapq.heappop(al)\n tmp = ac.popleft()\n heapq.heappush(al, tmp)\n else:\n heapq.heappop(ar) # (17): ar=[1, 2] (25): ar=[1, 2]\n tmp = ac.pop() # (18): tmp=1 (26): tmp=-2\n heapq.heappush(ar, -tmp) # (19): ar=[-1, 2, 1] (27): ar=[1, 2, 2]\nprint(sum(al)+sum(ar))\n"], "anno_status": [true], "diff_content": " import heapq\n-from collections import deque\n N = int(input())\n A = list(map(int, input().split()))\n \n al = A[:N]\n-ar = [-a for a in A[2*N:]]\n-ac = deque(A[N:2*N])\n heapq.heapify(al)\n+sal = sum(al)\n+suml = [sal]\n+for i in range(N, 2*N):\n+ if al[0] < A[i]:\n+ tmp = heapq.heappop(al)\n+ heapq.heappush(al, A[i])\n+ sal += A[i]-tmp\n+ suml.append(sal)\n+\n+ar = [-a for a in A[2*N:]]\n heapq.heapify(ar)\n-for i in range(N):\n- gl = ac[0] - al[0]\n- gr = -ar[0] - ac[-1]\n- if gl < 0 and gr < 0:\n- ac.pop()\n- elif gl > gr:\n- heapq.heappop(al)\n- tmp = ac.popleft()\n- heapq.heappush(al, tmp)\n- else:\n- heapq.heappop(ar)\n- tmp = ac.pop()\n- heapq.heappush(ar, -tmp)\n-print(sum(al)+sum(ar))\n+sar = -sum(ar)\n+sumr = [sar]\n+\n+ans = -10**15\n+for i in range(N, 2*N):\n+ if -ar[0] > A[3*N-1-i]:\n+ tmp = -heapq.heappop(ar)\n+ heapq.heappush(ar, -A[3*N-1-i])\n+ sar += A[3*N-1-i]-tmp\n+ sumr.append(sar)\n+for i in range(len(suml)):\n+ ans = max(ans, suml[i]-sumr[-(i+1)])\n+print(ans)\n \n", "FL_content": " import heapq\n-from collections import deque\n N = int(input())\n A = list(map(int, input().split()))\n \n al = A[:N]\n-ar = [-a for a in A[2*N:]]\n-ac = deque(A[N:2*N])\n heapq.heapify(al)\n heapq.heapify(ar)\n-for i in range(N):\n- gl = ac[0] - al[0]\n- gr = -ar[0] - ac[-1]\n- if gl < 0 and gr < 0:\n- ac.pop()\n- elif gl > gr:\n- heapq.heappop(al)\n- tmp = ac.popleft()\n- heapq.heappush(al, tmp)\n- else:\n- heapq.heappop(ar)\n- tmp = ac.pop()\n- heapq.heappush(ar, -tmp)\n-print(sum(al)+sum(ar))\n \n", "added_lines": 23, "removed_lines": 17, "code1_lines": 25 }, { "user_id": "u531436689", "problem_id": "p03714", "submission1_id": "s358041239", "submission2_id": "s097912183", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\nfrom collections import deque\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\nDR = [1, -1, 0, 0]\nDC = [0, 0, 1, -1]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n \ndef main():\n N = I()\n A = LI()\n wakeme = N\n Aleftsum = [0 for _ in range(3*N+1)]\n leftA = [x for x in A[:N]]\n heapq.heapify(leftA)\n subsum = sum(leftA)\n Aleftsum[wakeme] = subsum\n for i in range(N):\n heapq.heappush(leftA, A[wakeme + i])\n subsum += A[wakeme + i]\n subsum -= heapq.heappop(leftA)\n Aleftsum[wakeme+i+1] = subsum\n\n Arightsum = [0 for _ in range(3*N+1)]\n rightA = [-x for x in A[-N:]]\n heapq.heapify(rightA)\n subsum = sum(rightA)\n wakeme = 2*N\n Arightsum[wakeme] = -subsum\n for i in range(1, N+1):\n heapq.heappush(rightA, -A[wakeme-i])\n subsum -= A[wakeme - i]\n subsum -= heapq.heappop(rightA)\n Arightsum[wakeme - i] = -subsum\n ans = -inf\n for i in range(N, 2*N):\n ans = max(ans, Aleftsum[i] - Arightsum[i])\n print(ans)\nmain()\n\n", "code2": "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\nfrom collections import deque\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\nDR = [1, -1, 0, 0]\nDC = [0, 0, 1, -1]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n \ndef main():\n N = I()\n A = LI()\n wakeme = N\n Aleftsum = [0 for _ in range(3*N+1)]\n leftA = [x for x in A[:N]]\n heapq.heapify(leftA)\n subsum = sum(leftA)\n Aleftsum[wakeme] = subsum\n for i in range(N):\n heapq.heappush(leftA, A[wakeme + i])\n subsum += A[wakeme + i]\n subsum -= heapq.heappop(leftA)\n Aleftsum[wakeme+i+1] = subsum\n\n Arightsum = [0 for _ in range(3*N+1)]\n rightA = [-x for x in A[-N:]]\n heapq.heapify(rightA)\n subsum = sum(rightA)\n wakeme = 2*N\n Arightsum[wakeme] = -subsum\n for i in range(1, N+1):\n heapq.heappush(rightA, -A[wakeme-i])\n subsum -= A[wakeme - i]\n subsum -= heapq.heappop(rightA)\n Arightsum[wakeme - i] = -subsum\n ans = -inf\n for i in range(N, 2*N+1):\n ans = max(ans, Aleftsum[i] - Arightsum[i])\n print(ans)\nmain()\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584380780", "date2": "1584380944", "bleu_score": "0.9975878078049216", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 78, "total_score": 102, "input": "1\n-1 0 0\n", "actual_output": "-1\n", "expected_output": "0\n\n", "anno_code": ["import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\nfrom collections import deque\n\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\ninf = 10**20 # (1): inf=100000000000000000000\nmod = 10**9 + 7 # (2): mod=1000000007\n\nDR = [1, -1, 0, 0] # (3): DR=[1, -1, 0, 0]\nDC = [0, 0, 1, -1] # (4): DC=[0, 0, 1, -1], LI=, LI_=, LF=, LS=, I=, F=, S=\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n \ndef main(): # (5): main=\n N = I() # (7): N=1\n A = LI() # (8): A=[-1, 0, 0]\n wakeme = N # (9): wakeme=1\n Aleftsum = [0 for _ in range(3*N+1)] # (10): Aleftsum=[0, 0, 0, 0]\n leftA = [x for x in A[:N]] # (11): leftA=[-1]\n heapq.heapify(leftA) # (12): NO CHANGE\n subsum = sum(leftA) # (13): subsum=-1\n Aleftsum[wakeme] = subsum # (14): Aleftsum=[0, -1, 0, 0]\n for i in range(N): # (15): i=0 (20): NO CHANGE\n heapq.heappush(leftA, A[wakeme + i]) # (16): leftA=[-1, 0]\n subsum += A[wakeme + i] # (17): NO CHANGE\n subsum -= heapq.heappop(leftA) # (18): leftA=[0], subsum=0\n Aleftsum[wakeme+i+1] = subsum # (19): NO CHANGE\n\n Arightsum = [0 for _ in range(3*N+1)] # (21): Arightsum=[0, 0, 0, 0]\n rightA = [-x for x in A[-N:]] # (22): rightA=[0]\n heapq.heapify(rightA) # (23): NO CHANGE\n subsum = sum(rightA) # (24): NO CHANGE\n wakeme = 2*N # (25): wakeme=2\n Arightsum[wakeme] = -subsum # (26): NO CHANGE\n for i in range(1, N+1): # (27): i=1 (32): NO CHANGE\n heapq.heappush(rightA, -A[wakeme-i]) # (28): rightA=[0, 0]\n subsum -= A[wakeme - i] # (29): NO CHANGE\n subsum -= heapq.heappop(rightA) # (30): rightA=[0]\n Arightsum[wakeme - i] = -subsum # (31): NO CHANGE\n ans = -inf # (33): ans=-100000000000000000000\n for i in range(N, 2*N): # (34): NO CHANGE (36): NO CHANGE\n ans = max(ans, Aleftsum[i] - Arightsum[i]) # (35): ans=-1\n print(ans)\nmain() # (6): NO CHANGE\n\n"], "anno_status": [false], "diff_content": " import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n from collections import deque\n \n sys.setrecursionlimit(10**7)\n inf = 10**20\n mod = 10**9 + 7\n \n DR = [1, -1, 0, 0]\n DC = [0, 0, 1, -1]\n \n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def S(): return input()\n \n def main():\n N = I()\n A = LI()\n wakeme = N\n Aleftsum = [0 for _ in range(3*N+1)]\n leftA = [x for x in A[:N]]\n heapq.heapify(leftA)\n subsum = sum(leftA)\n Aleftsum[wakeme] = subsum\n for i in range(N):\n heapq.heappush(leftA, A[wakeme + i])\n subsum += A[wakeme + i]\n subsum -= heapq.heappop(leftA)\n Aleftsum[wakeme+i+1] = subsum\n \n Arightsum = [0 for _ in range(3*N+1)]\n rightA = [-x for x in A[-N:]]\n heapq.heapify(rightA)\n subsum = sum(rightA)\n wakeme = 2*N\n Arightsum[wakeme] = -subsum\n for i in range(1, N+1):\n heapq.heappush(rightA, -A[wakeme-i])\n subsum -= A[wakeme - i]\n subsum -= heapq.heappop(rightA)\n Arightsum[wakeme - i] = -subsum\n ans = -inf\n- for i in range(N, 2*N):\n+ for i in range(N, 2*N+1):\n ans = max(ans, Aleftsum[i] - Arightsum[i])\n print(ans)\n main()\n \n \n", "FL_content": " import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n from collections import deque\n \n sys.setrecursionlimit(10**7)\n inf = 10**20\n mod = 10**9 + 7\n \n DR = [1, -1, 0, 0]\n DC = [0, 0, 1, -1]\n \n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def S(): return input()\n \n def main():\n N = I()\n A = LI()\n wakeme = N\n Aleftsum = [0 for _ in range(3*N+1)]\n leftA = [x for x in A[:N]]\n heapq.heapify(leftA)\n subsum = sum(leftA)\n Aleftsum[wakeme] = subsum\n for i in range(N):\n heapq.heappush(leftA, A[wakeme + i])\n subsum += A[wakeme + i]\n subsum -= heapq.heappop(leftA)\n Aleftsum[wakeme+i+1] = subsum\n \n Arightsum = [0 for _ in range(3*N+1)]\n rightA = [-x for x in A[-N:]]\n heapq.heapify(rightA)\n subsum = sum(rightA)\n wakeme = 2*N\n Arightsum[wakeme] = -subsum\n for i in range(1, N+1):\n heapq.heappush(rightA, -A[wakeme-i])\n subsum -= A[wakeme - i]\n subsum -= heapq.heappop(rightA)\n Arightsum[wakeme - i] = -subsum\n ans = -inf\n- for i in range(N, 2*N):\n ans = max(ans, Aleftsum[i] - Arightsum[i])\n print(ans)\n main()\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 51 }, { "user_id": "u498487134", "problem_id": "p03714", "submission1_id": "s096339260", "submission2_id": "s097785523", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\nimport heapq\n\ndef main():\n mod=10**9+7\n N=I()\n a=LI()\n q1=a[:N]\n s1=[0]*(N+1)\n s1[0]=sum(q1)\n heapq.heapify(q1)\n \n q2=[]\n heapq.heapify(q2)\n s2=[0]*(N+1)\n for i in range(N):\n b=a[-1-i]*(-1)\n s2[0]+=b\n heapq.heappush(q2,b)\n \n \n for i in range(N):\n b=heapq.heappop(q1)\n s1[i+1]=s1[i]+a[i+N]-b\n \n c=heapq.heappop(q2)\n s2[i+1]=s2[i]+a[-1-N-i]*(-1)-c\n \n L=[0]*(N+1)\n ans=-1*10**16\n for i in range(N+1):\n temp=s1[i]+s2[-1-i]\n if ans, I=, MI=, LI=, heapq=\n\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\nimport heapq\n\ndef main(): # (1): main=\n mod=10**9+7 # (3): mod=1000000007\n N=I() # (4): N=3\n a=LI() # (5): a=[3, 8, 1, 2, 1, 4, -1, 6, 1]\n q1=a[:N] # (6): q1=[3, 8, 1]\n s1=[0]*(N+1) # (7): s1=[0, 0, 0, 0]\n s1[0]=sum(q1) # (8): s1=[12, 0, 0, 0]\n heapq.heapify(q1) # (9): q1=[1, 8, 3]\n \n q2=[] # (10): q2=[]\n heapq.heapify(q2) # (11): NO CHANGE\n s2=[0]*(N+1) # (12): s2=[0, 0, 0, 0]\n for i in range(N): # (13): i=0 (17): i=1 ... (25): NO CHANGE\n b=a[-1-i]*(-1) # (14): b=-1 (18): b=-6 (22): b=1\n s2[0]+=b # (15): s2=[-1, 0, 0, 0] (19): s2=[-7, 0, 0, 0] (23): s2=[-6, 0, 0, 0]\n heapq.heappush(q2,b) # (16): q2=[-1] (20): q2=[-6, -1] (24): q2=[-6, -1, 1]\n \n \n for i in range(N): # (26): i=0 (31): i=1 ... (41): NO CHANGE\n b=heapq.heappop(q1) # (27): q1=[3, 8] (32): q1=[8], b=3 (37): q1=[], b=8\n s1[i+1]=s1[i]+a[i+N]-b # (28): s1=[12, 13, 0, 0] (33): s1=[12, 13, 11, 0] (38): s1=[12, 13, 11, 7]\n \n c=heapq.heappop(q2) # (29): q2=[-1, 1], c=-6 (34): q2=[1], c=-1 (39): q2=[], c=1\n s2[i+1]=s2[i]+a[-1-N-i]*(-1)-c # (30): s2=[-6, -4, 0, 0] (35): s2=[-6, -4, -4, 0] (40): s2=[-6, -4, -4, -7]\n \n L=[0]*(N+1) # (42): L=[0, 0, 0, 0]\n ans=-1*10**16 # (43): ans=-10000000000000000\n for i in range(N+1): # (44): i=0 (48): i=1 ... (58): NO CHANGE\n temp=s1[i]+s2[-1-i] # (45): temp=5 (49): temp=9 ... (56): temp=1\n if ans h:\n sa += now-h\n heapq.heappush(hf,now)\n ans = max(ans,sa-sb)\n else:\n heapq.heappush(hf,h)\n \nans = max(ans,sa-sb)\nprint(ans)\n", "code2": "import heapq\n\nn = int(input())\nA = list(map(int,input().split()))\n\nsa = 0\nsb = 0\nhf = []\nhb = []\nla = [[0]*2 for i in range(n+1)]\nfor i in range(n):\n sa += A[i]\n heapq.heappush(hf,A[i])\nfor i in range(2*n,3*n):\n sb += A[i]\n heapq.heappush(hb,-A[i])\nla[0][0] = sa\nla[-1][-1] = sb\nfor i in range(n,2*n):\n now = A[i]\n now2 = A[-1-i]\n heapq.heappush(hf,now)\n heapq.heappush(hb,-now2)\n h1 = heapq.heappop(hf)\n h2 = -heapq.heappop(hb)\n sa += now-h1\n sb += now2 -h2\n la[i-n+1][0] = sa\n la[-i+n-2][1] = sb\n\nans = -float(\"INF\")\nfor i,j in la:\n ans = max(ans,i-j)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589581600", "date2": "1589583298", "bleu_score": "0.7576707697909139", "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, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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": 92, "total_score": 102, "input": "3\n2 4 2 32 0 0 2 2 11\n", "actual_output": "34\n", "expected_output": "36\n\n", "anno_code": ["import heapq\n\nn = int(input()) # (0): n=3\nA = list(map(int,input().split())) # (1): A=[2, 4, 2, 32, 0, 0, 2, 2, 11]\n\nsa = 0 # (2): sa=0\nsb = 0 # (3): sb=0\nhf = [] # (4): hf=[]\nhb = [] # (5): hb=[]\nfor i in range(n): # (6): i=0 (9): i=1 ... (15): NO CHANGE\n sa += A[i] # (7): sa=2 (10): sa=6 (13): sa=8\n heapq.heappush(hf,A[i]) # (8): hf=[2] (11): hf=[2, 4] (14): hf=[2, 4, 2]\nfor i in range(2*n,3*n): # (16): i=6 (19): i=7 ... (25): NO CHANGE\n sb += A[i] # (17): sb=2 (20): sb=4 (23): sb=15\n heapq.heappush(hb,-A[i]) # (18): hb=[-2] (21): hb=[-2, -2] (24): hb=[-11, -2, -2]\n\nans = sa-sb # (26): ans=-7\nfor i in range(n,2*n): # (27): i=3 (37): i=4 ... (55): NO CHANGE\n now = A[i] # (28): now=32 (38): now=0 (47): NO CHANGE\n \n l = -heapq.heappop(hb) # (29): hb=[-2, -2], l=11 (39): hb=[-2, -2] (48): hb=[-2, -2]\n \n if now < l: # (30): NO CHANGE (40): NO CHANGE (49): NO CHANGE\n ans = sa-sb+l-now # (41): ans=34 (50): NO CHANGE\n heapq.heappush(hb,-l) # (31): hb=[-11, -2, -2] (42): hb=[-11, -2, -2] (51): hb=[-11, -2, -2]\n h = heapq.heappop(hf) # (32): hf=[2, 4], h=2 (43): hf=[4, 32] (52): hf=[4, 32]\n \n if now > h: # (33): NO CHANGE (44): NO CHANGE (53): NO CHANGE\n sa += now-h # (34): sa=38\n heapq.heappush(hf,now) # (35): hf=[2, 4, 32]\n ans = max(ans,sa-sb) # (36): ans=23\n else:\n heapq.heappush(hf,h) # (45): hf=[2, 32, 4] (54): hf=[2, 32, 4]\n \nans = max(ans,sa-sb) # (56): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " import heapq\n \n n = int(input())\n A = list(map(int,input().split()))\n \n sa = 0\n sb = 0\n hf = []\n hb = []\n+la = [[0]*2 for i in range(n+1)]\n for i in range(n):\n sa += A[i]\n heapq.heappush(hf,A[i])\n for i in range(2*n,3*n):\n sb += A[i]\n heapq.heappush(hb,-A[i])\n-\n-ans = sa-sb\n+la[0][0] = sa\n+la[-1][-1] = sb\n for i in range(n,2*n):\n now = A[i]\n- \n- l = -heapq.heappop(hb)\n- \n- if now < l:\n- ans = sa-sb+l-now\n- heapq.heappush(hb,-l)\n- h = heapq.heappop(hf)\n- \n- if now > h:\n- sa += now-h\n- heapq.heappush(hf,now)\n- ans = max(ans,sa-sb)\n- else:\n- heapq.heappush(hf,h)\n- \n-ans = max(ans,sa-sb)\n+ now2 = A[-1-i]\n+ heapq.heappush(hf,now)\n+ heapq.heappush(hb,-now2)\n+ h1 = heapq.heappop(hf)\n+ h2 = -heapq.heappop(hb)\n+ sa += now-h1\n+ sb += now2 -h2\n+ la[i-n+1][0] = sa\n+ la[-i+n-2][1] = sb\n+\n+ans = -float(\"INF\")\n+for i,j in la:\n+ ans = max(ans,i-j)\n print(ans)\n \n", "FL_content": " import heapq\n \n n = int(input())\n A = list(map(int,input().split()))\n \n sa = 0\n sb = 0\n hf = []\n hb = []\n for i in range(n):\n sa += A[i]\n heapq.heappush(hf,A[i])\n for i in range(2*n,3*n):\n sb += A[i]\n heapq.heappush(hb,-A[i])\n-\n-ans = sa-sb\n for i in range(n,2*n):\n now = A[i]\n- \n- l = -heapq.heappop(hb)\n- \n- if now < l:\n- ans = sa-sb+l-now\n- heapq.heappush(hb,-l)\n- h = heapq.heappop(hf)\n- \n- if now > h:\n- sa += now-h\n- heapq.heappush(hf,now)\n- ans = max(ans,sa-sb)\n- else:\n- heapq.heappush(hf,h)\n- \n-ans = max(ans,sa-sb)\n print(ans)\n \n", "added_lines": 16, "removed_lines": 18, "code1_lines": 37 }, { "user_id": "u523130469", "problem_id": "p03714", "submission1_id": "s128585875", "submission2_id": "s502374513", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nn = int(input().strip())\na = list(map(int, input().split()))\npre = a[:n]\nheapq.heapify(pre)\nsuf = list(map(lambda x: -x, a[(2 * n):]))\nheapq.heapify(suf)\nleft = {}\nright = {}\npre_sum = sum(pre)\nsuf_sum = -sum(suf)\nleft[n - 1] = pre_sum\nright[2 * n] = suf_sum\nfor i in range(n, 2 * n):\n heapq.heappush(pre, a[i])\n pre_sum = pre_sum + a[i] - heapq.heappop(pre)\n left[i] = pre_sum\nfor i in range(2 * n - 1, n - 1, -1):\n heapq.heappush(suf, -a[i])\n suf_sum = suf_sum + heapq.heappop(suf) + a[i]\n right[i] = suf_sum\nans = - (10 ** 50)\nfor i in range(n - 1, 2 * n - 1):\n ans = max(ans, left[i] - right[i + 1])\nprint(ans)\n", "code2": "import heapq\n\nn = int(input().strip())\na = list(map(int, input().split()))\npre = a[:n]\nheapq.heapify(pre)\nsuf = list(map(lambda x: -x, a[(2 * n):]))\nheapq.heapify(suf)\nleft = {}\nright = {}\npre_sum = sum(pre)\nsuf_sum = -sum(suf)\nleft[n - 1] = pre_sum\nright[2 * n] = suf_sum\nfor i in range(n, 2 * n):\n heapq.heappush(pre, a[i])\n pre_sum = pre_sum + a[i] - heapq.heappop(pre)\n left[i] = pre_sum\nfor i in range(2 * n - 1, n - 1, -1):\n heapq.heappush(suf, -a[i])\n suf_sum = suf_sum + a[i] + heapq.heappop(suf)\n right[i] = suf_sum\nans = -float('inf')\nfor i in range(n - 1, 2 * n):\n ans = max(ans, left[i] - right[i + 1])\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588971628", "date2": "1588972361", "bleu_score": "0.9695034433094358", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 78, "total_score": 102, "input": "2\n4 -1 1 2 1 0\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["import heapq\n\nn = int(input().strip()) # (0): n=2\na = list(map(int, input().split())) # (1): a=[4, -1, 1, 2, 1, 0]\npre = a[:n] # (2): pre=[4, -1]\nheapq.heapify(pre) # (3): pre=[-1, 4]\nsuf = list(map(lambda x: -x, a[(2 * n):])) # (4): suf=[-1, 0]\nheapq.heapify(suf) # (5): NO CHANGE\nleft = {} # (6): left={}\nright = {} # (7): right={}\npre_sum = sum(pre) # (8): pre_sum=3\nsuf_sum = -sum(suf) # (9): suf_sum=1\nleft[n - 1] = pre_sum # (10): left={1: 3}\nright[2 * n] = suf_sum # (11): right={4: 1}\nfor i in range(n, 2 * n): # (12): i=2 (16): i=3 (20): NO CHANGE\n heapq.heappush(pre, a[i]) # (13): pre=[-1, 4, 1] (17): pre=[1, 4, 2]\n pre_sum = pre_sum + a[i] - heapq.heappop(pre) # (14): pre=[1, 4], pre_sum=5 (18): pre=[2, 4], pre_sum=6\n left[i] = pre_sum # (15): left={1: 3, 2: 5} (19): left={1: 3, 2: 5, 3: 6}\nfor i in range(2 * n - 1, n - 1, -1): # (21): NO CHANGE (25): i=2 (29): NO CHANGE\n heapq.heappush(suf, -a[i]) # (22): suf=[-2, 0, -1] (26): suf=[-1, 0, -1]\n suf_sum = suf_sum + heapq.heappop(suf) + a[i] # (23): suf=[-1, 0] (27): suf=[-1, 0]\n right[i] = suf_sum # (24): right={4: 1, 3: 1} (28): right={4: 1, 3: 1, 2: 1}\nans = - (10 ** 50) # (30): ans=-100000000000000000000000000000000000000000000000000\nfor i in range(n - 1, 2 * n - 1): # (31): i=1 (33): i=2 (35): NO CHANGE\n ans = max(ans, left[i] - right[i + 1]) # (32): ans=2 (34): ans=4\nprint(ans)\n"], "anno_status": [true], "diff_content": " import heapq\n \n n = int(input().strip())\n a = list(map(int, input().split()))\n pre = a[:n]\n heapq.heapify(pre)\n suf = list(map(lambda x: -x, a[(2 * n):]))\n heapq.heapify(suf)\n left = {}\n right = {}\n pre_sum = sum(pre)\n suf_sum = -sum(suf)\n left[n - 1] = pre_sum\n right[2 * n] = suf_sum\n for i in range(n, 2 * n):\n heapq.heappush(pre, a[i])\n pre_sum = pre_sum + a[i] - heapq.heappop(pre)\n left[i] = pre_sum\n for i in range(2 * n - 1, n - 1, -1):\n heapq.heappush(suf, -a[i])\n- suf_sum = suf_sum + heapq.heappop(suf) + a[i]\n+ suf_sum = suf_sum + a[i] + heapq.heappop(suf)\n right[i] = suf_sum\n-ans = - (10 ** 50)\n-for i in range(n - 1, 2 * n - 1):\n+ans = -float('inf')\n+for i in range(n - 1, 2 * n):\n ans = max(ans, left[i] - right[i + 1])\n print(ans)\n \n", "FL_content": " import heapq\n \n n = int(input().strip())\n a = list(map(int, input().split()))\n pre = a[:n]\n heapq.heapify(pre)\n suf = list(map(lambda x: -x, a[(2 * n):]))\n heapq.heapify(suf)\n left = {}\n right = {}\n pre_sum = sum(pre)\n suf_sum = -sum(suf)\n left[n - 1] = pre_sum\n right[2 * n] = suf_sum\n for i in range(n, 2 * n):\n heapq.heappush(pre, a[i])\n pre_sum = pre_sum + a[i] - heapq.heappop(pre)\n left[i] = pre_sum\n for i in range(2 * n - 1, n - 1, -1):\n heapq.heappush(suf, -a[i])\n- suf_sum = suf_sum + heapq.heappop(suf) + a[i]\n right[i] = suf_sum\n-ans = - (10 ** 50)\n-for i in range(n - 1, 2 * n - 1):\n ans = max(ans, left[i] - right[i + 1])\n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 27 }, { "user_id": "u884982181", "problem_id": "p03714", "submission1_id": "s288824648", "submission2_id": "s959262368", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nn = int(input())\na = list(map(int,input().split()))\naka = a[:n]\nheapq.heapify(aka)\nakasum = [0] * (n+1)\nakasum[0] = sum(aka)\nao = a[2*n:]\nheapq._heapify_max(ao)\naosum = [0] * (n+1)\naosum[-1] = sum(ao)\nfor i in range(n,2*n):\n b = heapq.heappop(aka)\n if b >= a[i]:\n heapq.heappush(aka, b)\n else:\n heapq.heappush(aka, a[i])\n akasum[i-n+1] = sum(aka)\n b = heapq.heappop(ao)\n if b <= a[-i-1]:\n heapq.heappush(ao, b)\n else:\n heapq.heappush(ao, a[-i-1])\n aosum[-i+n-2] = sum(ao)\nans = - float(\"inf\")\nfor i in range(n+1):\n kota = akasum[i] - aosum[i]\n ans = max(kota,ans)\nprint(ans)", "code2": "import heapq\nn = int(input())\na = list(map(int,input().split()))\naka = a[:n]\nheapq.heapify(aka)\nakasum = [0] * (n+1)\nakasum[0] = sum(aka)\nao = a[2*n:]\naosum = [0] * (n+1)\naosum[-1] = sum(ao)\nfor i in range(len(ao)):\n ao[i] = -ao[i]\nheapq.heapify(ao)\nfor i in range(n,2*n):\n b = heapq.heappop(aka)\n if b >= a[i]:\n heapq.heappush(aka, b)\n akasum[i-n+1] = akasum[i-n] \n else:\n heapq.heappush(aka, a[i])\n akasum[i-n+1] = akasum[i-n] + a[i] - b\n b = heapq.heappop(ao)\n if b >= -a[-i-1]:\n heapq.heappush(ao, b)\n aosum[-i+n-2] = aosum[-i+n-1]\n else:\n heapq.heappush(ao, -a[-i-1])\n aosum[-i+n-2] = aosum[-i+n-1] + a[-i-1] + b\nans = - float(\"inf\")\nfor i in range(n+1):\n kota = akasum[i] - aosum[i]\n ans = max(kota,ans)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535048410", "date2": "1535050135", "bleu_score": "0.7764731248685612", "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, 0, 0, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "3\n3 8 2 6 0 2 2 3 11\n", "actual_output": "12\n", "expected_output": "13\n\n", "anno_code": ["import heapq\nn = int(input()) # (0): n=3\na = list(map(int,input().split())) # (1): a=[3, 8, 2, 6, 0, 2, 2, 3, 11]\naka = a[:n] # (2): aka=[3, 8, 2]\nheapq.heapify(aka) # (3): aka=[2, 8, 3]\nakasum = [0] * (n+1) # (4): akasum=[0, 0, 0, 0]\nakasum[0] = sum(aka) # (5): akasum=[13, 0, 0, 0]\nao = a[2*n:] # (6): ao=[2, 3, 11]\nheapq._heapify_max(ao) # (7): ao=[11, 3, 2]\naosum = [0] * (n+1) # (8): aosum=[0, 0, 0, 0]\naosum[-1] = sum(ao) # (9): aosum=[0, 0, 0, 16]\nfor i in range(n,2*n): # (10): i=3 (19): i=4 ... (37): NO CHANGE\n b = heapq.heappop(aka) # (11): aka=[3, 8], b=2 (20): aka=[6, 8], b=3 (29): aka=[6, 8], b=3\n if b >= a[i]: # (12): NO CHANGE (21): NO CHANGE (30): NO CHANGE\n heapq.heappush(aka, b) # (22): aka=[3, 8, 6] (31): aka=[3, 8, 6]\n else:\n heapq.heappush(aka, a[i]) # (13): aka=[3, 8, 6]\n akasum[i-n+1] = sum(aka) # (14): akasum=[13, 17, 0, 0] (23): akasum=[13, 17, 17, 0] (32): akasum=[13, 17, 17, 17]\n b = heapq.heappop(ao) # (15): ao=[2, 3], b=11 (24): ao=[2, 3], b=2 (33): ao=[2, 3], b=0\n if b <= a[-i-1]: # (16): NO CHANGE (25): NO CHANGE (34): NO CHANGE\n heapq.heappush(ao, b) # (35): ao=[0, 3, 2]\n else:\n heapq.heappush(ao, a[-i-1]) # (17): ao=[2, 3, 2] (26): ao=[0, 3, 2]\n aosum[-i+n-2] = sum(ao) # (18): aosum=[0, 0, 7, 16] (27): aosum=[0, 5, 7, 16] (36): aosum=[5, 5, 7, 16]\nans = - float(\"inf\") # (38): ans=-inf\nfor i in range(n+1): # (39): i=0 (42): i=1 ... (51): NO CHANGE\n kota = akasum[i] - aosum[i] # (40): kota=8 (43): kota=12 ... (49): kota=1\n ans = max(kota,ans) # (41): ans=8 (44): ans=12 ... (50): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " import heapq\n n = int(input())\n a = list(map(int,input().split()))\n aka = a[:n]\n heapq.heapify(aka)\n akasum = [0] * (n+1)\n akasum[0] = sum(aka)\n ao = a[2*n:]\n-heapq._heapify_max(ao)\n aosum = [0] * (n+1)\n aosum[-1] = sum(ao)\n+for i in range(len(ao)):\n+ ao[i] = -ao[i]\n+heapq.heapify(ao)\n for i in range(n,2*n):\n b = heapq.heappop(aka)\n if b >= a[i]:\n heapq.heappush(aka, b)\n+ akasum[i-n+1] = akasum[i-n] \n else:\n heapq.heappush(aka, a[i])\n- akasum[i-n+1] = sum(aka)\n+ akasum[i-n+1] = akasum[i-n] + a[i] - b\n b = heapq.heappop(ao)\n- if b <= a[-i-1]:\n+ if b >= -a[-i-1]:\n heapq.heappush(ao, b)\n+ aosum[-i+n-2] = aosum[-i+n-1]\n else:\n- heapq.heappush(ao, a[-i-1])\n- aosum[-i+n-2] = sum(ao)\n+ heapq.heappush(ao, -a[-i-1])\n+ aosum[-i+n-2] = aosum[-i+n-1] + a[-i-1] + b\n ans = - float(\"inf\")\n for i in range(n+1):\n kota = akasum[i] - aosum[i]\n ans = max(kota,ans)\n print(ans)\n", "FL_content": " import heapq\n n = int(input())\n a = list(map(int,input().split()))\n aka = a[:n]\n heapq.heapify(aka)\n akasum = [0] * (n+1)\n akasum[0] = sum(aka)\n ao = a[2*n:]\n-heapq._heapify_max(ao)\n aosum = [0] * (n+1)\n aosum[-1] = sum(ao)\n for i in range(n,2*n):\n b = heapq.heappop(aka)\n if b >= a[i]:\n heapq.heappush(aka, b)\n else:\n heapq.heappush(aka, a[i])\n- akasum[i-n+1] = sum(aka)\n b = heapq.heappop(ao)\n- if b <= a[-i-1]:\n heapq.heappush(ao, b)\n else:\n- heapq.heappush(ao, a[-i-1])\n- aosum[-i+n-2] = sum(ao)\n ans = - float(\"inf\")\n for i in range(n+1):\n kota = akasum[i] - aosum[i]\n ans = max(kota,ans)\n print(ans)\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 29 }, { "user_id": "u480300350", "problem_id": "p03714", "submission1_id": "s103417578", "submission2_id": "s726371398", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nfrom heapq import heapify, heappush, heappop \n\n\n\n\n\n\n\nfrom operator import itemgetter \n\n\n\n\ndef main():\n mod = 1000000007 \n inf = float('inf') \n \n sys.setrecursionlimit(10**6) \n def input(): return sys.stdin.readline().rstrip()\n def ii(): return int(input())\n def mi(): return map(int, input().split())\n def mi_0(): return map(lambda x: int(x)-1, input().split())\n def lmi(): return list(map(int, input().split()))\n def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))\n def li(): return list(input())\n \n \n n = ii()\n L = lmi()\n \n left = sum(L[:n])\n l_h = L[:n] \n\n right = 0\n tmp = [[i, L[i]] for i in range(n, 3*n)]\n tmp.sort()\n latter_min_nth = [False] * 3 * n \n sub_member_r_h = [] \n for ind in range(n):\n i, num = tmp[ind]\n right += num\n latter_min_nth[i] = True\n for ind in range(n, 2*n):\n i, num = tmp[ind]\n sub_member_r_h.append([num, i])\n \n max_score = left - right\n heapify(l_h)\n heapify(sub_member_r_h)\n for i in range(n, 2*n):\n \n if l_h[0] < L[i]:\n \n left -= heappop(l_h)\n left += L[i]\n heappush(l_h, L[i])\n if latter_min_nth[i]:\n \n right -= L[i]\n while sub_member_r_h[0][1] <= i:\n heappop(sub_member_r_h) \n num, ind = heappop(sub_member_r_h)\n assert (ind > i)\n right += num\n latter_min_nth[ind] = True\n max_score = max(max_score, left - right)\n \n print(max_score)\n\n\n\n\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "\n\nimport sys\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nfrom heapq import heapify, heappush, heappop \n\n\n\n\n\n\n\nfrom operator import itemgetter \n\n\n\n\ndef main():\n mod = 1000000007 \n inf = float('inf') \n \n sys.setrecursionlimit(10**6) \n def input(): return sys.stdin.readline().rstrip()\n def ii(): return int(input())\n def mi(): return map(int, input().split())\n def mi_0(): return map(lambda x: int(x)-1, input().split())\n def lmi(): return list(map(int, input().split()))\n def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))\n def li(): return list(input())\n \n \n n = ii()\n L = lmi()\n \n left = sum(L[:n])\n l_h = L[:n] \n heapify(l_h)\n\n right = 0\n tmp = [[i, L[i]] for i in range(n, 3*n)]\n assert (len(tmp) == 2*n)\n tmp.sort(key=itemgetter(1))\n latter_min_nth = [False] * 3 * n \n sub_member_r_h = [] \n for ind in range(n):\n i, num = tmp[ind]\n right += num\n latter_min_nth[i] = True\n for ind in range(n, 2*n):\n i, num = tmp[ind]\n sub_member_r_h.append([num, i])\n heapify(sub_member_r_h) \n \n\n max_score = left - right\n \n for i in range(n, 2*n):\n \n if l_h[0] < L[i]:\n \n left -= heappop(l_h)\n left += L[i]\n heappush(l_h, L[i])\n if latter_min_nth[i]:\n \n latter_min_nth[i] = False\n right -= L[i]\n while sub_member_r_h[0][1] <= i:\n heappop(sub_member_r_h) \n num, ind = heappop(sub_member_r_h)\n assert (ind > i)\n right += num\n latter_min_nth[ind] = True\n \n max_score = max(max_score, left - right)\n \n print(max_score)\n\n\nif __name__ == \"__main__\":\n main()\n\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590819234", "date2": "1590820961", "bleu_score": "0.9396676838664548", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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\n3 8 1 2 1 4 -1 6 1\n", "actual_output": "9\n", "expected_output": "12\n\n", "anno_code": ["\n\nimport sys\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nfrom heapq import heapify, heappush, heappop \n\n\n\n\n\n\n\nfrom operator import itemgetter \n\n\n\n\ndef main(): # (0): main=\n mod = 1000000007 \n inf = float('inf') \n \n sys.setrecursionlimit(10**6) \n def input(): return sys.stdin.readline().rstrip()\n def ii(): return int(input())\n def mi(): return map(int, input().split())\n def mi_0(): return map(lambda x: int(x)-1, input().split())\n def lmi(): return list(map(int, input().split()))\n def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))\n def li(): return list(input())\n \n \n n = ii()\n L = lmi()\n \n left = sum(L[:n])\n l_h = L[:n] \n\n right = 0\n tmp = [[i, L[i]] for i in range(n, 3*n)]\n tmp.sort()\n latter_min_nth = [False] * 3 * n \n sub_member_r_h = [] \n for ind in range(n):\n i, num = tmp[ind]\n right += num\n latter_min_nth[i] = True\n for ind in range(n, 2*n):\n i, num = tmp[ind]\n sub_member_r_h.append([num, i])\n \n max_score = left - right\n heapify(l_h)\n heapify(sub_member_r_h)\n for i in range(n, 2*n):\n \n if l_h[0] < L[i]:\n \n left -= heappop(l_h)\n left += L[i]\n heappush(l_h, L[i])\n if latter_min_nth[i]:\n \n right -= L[i]\n while sub_member_r_h[0][1] <= i:\n heappop(sub_member_r_h) \n num, ind = heappop(sub_member_r_h)\n assert (ind > i)\n right += num\n latter_min_nth[ind] = True\n max_score = max(max_score, left - right)\n \n print(max_score)\n\n\n\n\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n \n import sys\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n from heapq import heapify, heappush, heappop \n \n \n \n \n \n \n \n from operator import itemgetter \n \n \n \n \n def main():\n mod = 1000000007 \n inf = float('inf') \n \n sys.setrecursionlimit(10**6) \n def input(): return sys.stdin.readline().rstrip()\n def ii(): return int(input())\n def mi(): return map(int, input().split())\n def mi_0(): return map(lambda x: int(x)-1, input().split())\n def lmi(): return list(map(int, input().split()))\n def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))\n def li(): return list(input())\n \n \n n = ii()\n L = lmi()\n \n left = sum(L[:n])\n l_h = L[:n] \n+ heapify(l_h)\n \n right = 0\n tmp = [[i, L[i]] for i in range(n, 3*n)]\n- tmp.sort()\n+ assert (len(tmp) == 2*n)\n+ tmp.sort(key=itemgetter(1))\n latter_min_nth = [False] * 3 * n \n sub_member_r_h = [] \n for ind in range(n):\n i, num = tmp[ind]\n right += num\n latter_min_nth[i] = True\n for ind in range(n, 2*n):\n i, num = tmp[ind]\n sub_member_r_h.append([num, i])\n+ heapify(sub_member_r_h) \n \n+\n max_score = left - right\n- heapify(l_h)\n- heapify(sub_member_r_h)\n+ \n for i in range(n, 2*n):\n \n if l_h[0] < L[i]:\n \n left -= heappop(l_h)\n left += L[i]\n heappush(l_h, L[i])\n if latter_min_nth[i]:\n \n+ latter_min_nth[i] = False\n right -= L[i]\n while sub_member_r_h[0][1] <= i:\n heappop(sub_member_r_h) \n num, ind = heappop(sub_member_r_h)\n assert (ind > i)\n right += num\n latter_min_nth[ind] = True\n+ \n max_score = max(max_score, left - right)\n \n print(max_score)\n \n \n+if __name__ == \"__main__\":\n+ main()\n \n \n \n \n-if __name__ == \"__main__\":\n- main()\n-\n", "FL_content": " \n \n import sys\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n from heapq import heapify, heappush, heappop \n \n \n \n \n \n \n \n from operator import itemgetter \n \n \n \n \n def main():\n mod = 1000000007 \n inf = float('inf') \n \n sys.setrecursionlimit(10**6) \n def input(): return sys.stdin.readline().rstrip()\n def ii(): return int(input())\n def mi(): return map(int, input().split())\n def mi_0(): return map(lambda x: int(x)-1, input().split())\n def lmi(): return list(map(int, input().split()))\n def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))\n def li(): return list(input())\n \n \n n = ii()\n L = lmi()\n \n left = sum(L[:n])\n l_h = L[:n] \n \n right = 0\n tmp = [[i, L[i]] for i in range(n, 3*n)]\n- tmp.sort()\n latter_min_nth = [False] * 3 * n \n sub_member_r_h = [] \n for ind in range(n):\n i, num = tmp[ind]\n right += num\n latter_min_nth[i] = True\n for ind in range(n, 2*n):\n i, num = tmp[ind]\n sub_member_r_h.append([num, i])\n \n max_score = left - right\n- heapify(l_h)\n- heapify(sub_member_r_h)\n for i in range(n, 2*n):\n \n if l_h[0] < L[i]:\n \n left -= heappop(l_h)\n left += L[i]\n heappush(l_h, L[i])\n if latter_min_nth[i]:\n \n right -= L[i]\n while sub_member_r_h[0][1] <= i:\n heappop(sub_member_r_h) \n num, ind = heappop(sub_member_r_h)\n assert (ind > i)\n right += num\n latter_min_nth[ind] = True\n max_score = max(max_score, left - right)\n \n print(max_score)\n \n \n \n \n \n \n-if __name__ == \"__main__\":\n- main()\n-\n", "added_lines": 10, "removed_lines": 6, "code1_lines": 97 }, { "user_id": "u163320134", "problem_id": "p03714", "submission1_id": "s179135610", "submission2_id": "s869238155", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nn=int(input())\narr=list(map(int,input().split()))\nq1=[]\ntmp=0\nfor val in arr[:n]:\n heapq.heappush(q1,val)\n tmp+=val\nsum1=[tmp]\nfor val in arr[n:2*n]:\n tmp=heapq.heappop(q1)\n if val>tmp:\n heapq.heappush(q1,val)\n sum1.append(sum1[-1]+(val-tmp))\n else:\n heapq.heappush(q1,tmp)\n sum1.append(sum1[-1])\nprint(sum1)\nq2=[]\ntmp=0\nfor val in arr[2*n:]:\n heapq.heappush(q2,-val)\n tmp+=val\nsum2=[tmp]\nfor val in arr[2*n-1:n-1:-1]:\n tmp=-heapq.heappop(q2)\n if valtmp:\n heapq.heappush(q1,val)\n sum1.append(sum1[-1]+(val-tmp))\n else:\n heapq.heappush(q1,tmp)\n sum1.append(sum1[-1])\nq2=[]\ntmp=0\nfor val in arr[2*n:]:\n heapq.heappush(q2,-val)\n tmp+=val\nsum2=[tmp]\nfor val in arr[2*n-1:n-1:-1]:\n tmp=-heapq.heappop(q2)\n if valtmp: # (17): NO CHANGE (22): NO CHANGE (27): NO CHANGE\n heapq.heappush(q1,val) # (18): q1=[2, 8, 7] (23): q1=[4, 8, 7] (28): q1=[6, 8, 7]\n sum1.append(sum1[-1]+(val-tmp)) # (19): sum1=[11, 17] (24): sum1=[11, 17, 19] (29): sum1=[11, 17, 19, 21]\n else:\n heapq.heappush(q1,tmp)\n sum1.append(sum1[-1])\nprint(sum1) # (31): NO CHANGE\nq2=[] # (32): q2=[]\ntmp=0 # (33): tmp=0\nfor val in arr[2*n:]: # (34): NO CHANGE (37): val=0 ... (43): NO CHANGE\n heapq.heappush(q2,-val) # (35): q2=[-6] (38): q2=[-6, 0] (41): q2=[-8, 0, -6]\n tmp+=val # (36): tmp=6 (39): NO CHANGE (42): tmp=14\nsum2=[tmp] # (44): sum2=[14]\nfor val in arr[2*n-1:n-1:-1]: # (45): val=6 (50): val=4 ... (60): NO CHANGE\n tmp=-heapq.heappop(q2) # (46): tmp=8, q2=[-6, 0] (51): tmp=6, q2=[-6, 0] (56): q2=[-4, 0]\n if valtmp:\n heapq.heappush(q1,val)\n sum1.append(sum1[-1]+(val-tmp))\n else:\n heapq.heappush(q1,tmp)\n sum1.append(sum1[-1])\n-print(sum1)\n q2=[]\n tmp=0\n for val in arr[2*n:]:\n heapq.heappush(q2,-val)\n tmp+=val\n sum2=[tmp]\n for val in arr[2*n-1:n-1:-1]:\n tmp=-heapq.heappop(q2)\n if valtmp:\n heapq.heappush(q1,val)\n sum1.append(sum1[-1]+(val-tmp))\n else:\n heapq.heappush(q1,tmp)\n sum1.append(sum1[-1])\n-print(sum1)\n q2=[]\n tmp=0\n for val in arr[2*n:]:\n heapq.heappush(q2,-val)\n tmp+=val\n sum2=[tmp]\n for val in arr[2*n-1:n-1:-1]:\n tmp=-heapq.heappop(q2)\n if val r:\n heappush(R, -r)\n else:\n Sr += a - r\n heappush(R, -a)\n if i in used:\n while L:\n l, j = heappop(L)\n if j in used or j >= i:\n continue\n Sl += l - a\n used.add(j)\n break\n ans = max(ans, Sl - Sr)\n\nprint(ans)", "code2": "from heapq import heapify, heappop, heappush\n\nN = int(input())\nA = list(map(int, input().split()))\nA = [-a for a in A]\n\nL = [[a, i] for i, a in enumerate(A[:2*N])]\nSl = 0\nheapify(L)\nused = set()\nfor i in range(N):\n a, i = heappop(L)\n used.add(i)\n Sl -= a\n\nR = A[2*N:].copy()\nSr = -sum(R)\nheapify(R)\n\nans = Sl - Sr\nfor i in range(2*N-1, N-1, -1):\n a = - A[i]\n r = - heappop(R)\n if a > r:\n heappush(R, -r)\n else:\n Sr += a - r\n heappush(R, -a)\n if i in used:\n while L:\n l, j = heappop(L)\n l *= -1\n if j < i:\n Sl += l - a\n used.add(j)\n break\n ans = max(ans, Sl - Sr)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589942852", "date2": "1589943256", "bleu_score": "0.9604506007942167", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 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, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 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, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 86, "total_score": 102, "input": "1\n-2 0 0\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["from heapq import heapify, heappop, heappush\nN = int(input()) # (0): N=1\nA = list(map(int, input().split())) # (1): A=[-2, 0, 0]\nA = [-a for a in A] # (2): A=[2, 0, 0]\n\nL = [[a, i] for i, a in enumerate(A[:2*N])] # (3): L\nSl = 0 # (4): Sl=0\nheapify(L) # (5): L\nused = set() # (6): used=set()\nfor i in range(N): # (7): i=0 (11): NO CHANGE\n a, i = heappop(L) # (8): L, i=1, a=0\n used.add(i) # (9): used={1}\n Sl -= a # (10): NO CHANGE\n\nR = A[2*N:].copy() # (12): R=[0]\nSr = -sum(R) # (13): Sr=0\nheapify(R) # (14): NO CHANGE\n\nans = Sl - Sr # (15): ans=0\nfor i in range(2*N-1, N-1, -1): # (16): NO CHANGE (30): NO CHANGE\n a = - A[i] # (17): NO CHANGE\n r = - heappop(R) # (18): R=[], r=0\n if a > r: # (19): NO CHANGE\n heappush(R, -r)\n else:\n Sr += a - r # (20): NO CHANGE\n heappush(R, -a) # (21): R=[0]\n if i in used: # (22): NO CHANGE\n while L: # (23): NO CHANGE\n l, j = heappop(L) # (24): L=[], l=2, j=0\n if j in used or j >= i: # (25): NO CHANGE\n continue\n Sl += l - a # (26): Sl=2\n used.add(j) # (27): used={0, 1}\n break # (28): NO CHANGE\n ans = max(ans, Sl - Sr) # (29): ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " from heapq import heapify, heappop, heappush\n+\n N = int(input())\n A = list(map(int, input().split()))\n A = [-a for a in A]\n \n L = [[a, i] for i, a in enumerate(A[:2*N])]\n Sl = 0\n heapify(L)\n used = set()\n for i in range(N):\n a, i = heappop(L)\n used.add(i)\n Sl -= a\n \n R = A[2*N:].copy()\n Sr = -sum(R)\n heapify(R)\n \n ans = Sl - Sr\n for i in range(2*N-1, N-1, -1):\n a = - A[i]\n r = - heappop(R)\n if a > r:\n heappush(R, -r)\n else:\n Sr += a - r\n heappush(R, -a)\n if i in used:\n while L:\n l, j = heappop(L)\n- if j in used or j >= i:\n- continue\n- Sl += l - a\n- used.add(j)\n- break\n+ l *= -1\n+ if j < i:\n+ Sl += l - a\n+ used.add(j)\n+ break\n ans = max(ans, Sl - Sr)\n \n print(ans)\n", "FL_content": " from heapq import heapify, heappop, heappush\n N = int(input())\n A = list(map(int, input().split()))\n A = [-a for a in A]\n \n L = [[a, i] for i, a in enumerate(A[:2*N])]\n Sl = 0\n heapify(L)\n used = set()\n for i in range(N):\n a, i = heappop(L)\n used.add(i)\n Sl -= a\n \n R = A[2*N:].copy()\n Sr = -sum(R)\n heapify(R)\n \n ans = Sl - Sr\n for i in range(2*N-1, N-1, -1):\n a = - A[i]\n r = - heappop(R)\n if a > r:\n heappush(R, -r)\n else:\n Sr += a - r\n heappush(R, -a)\n if i in used:\n while L:\n l, j = heappop(L)\n- if j in used or j >= i:\n- continue\n- Sl += l - a\n- used.add(j)\n- break\n ans = max(ans, Sl - Sr)\n \n print(ans)\n", "added_lines": 6, "removed_lines": 5, "code1_lines": 38 }, { "user_id": "u794173881", "problem_id": "p03714", "submission1_id": "s946978997", "submission2_id": "s790729258", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nn = int(input())\na = list(map(int,input().split()))\n\nleft_seq = sorted(a[0:n])\nright_seq = sorted(a[2*n:3*n])\nleft_sum = [0]*(n+1)\nright_sum = [0]*(n+1)\nleft_sum[0] = sum(left_seq) \nright_sum[n] = sum(right_seq) \n\n\nfor i in range(n):\n if left_seq[0]a[n+i]:\n right_sum[i] = right_sum[i+1]-right_seq[-1]+a[n+i]\n del right_seq[-1]\n heapq.heappush(right_seq, a[n+i])\n else:\n right_sum[i] = right_sum[i+1]\n \n\nans = -float(\"inf\")\nfor i in range(n+1):\n ans = max(ans,left_sum[i]-right_sum[i])\nprint(ans)\n", "code2": "import heapq\nn = int(input())\na = list(map(int,input().split()))\n\n\nleft_seq = sorted(a[0:n])\nright_seq = sorted(a[2*n:3*n],reverse=True)\nfor i in range(n):\n right_seq[i]=-right_seq[i]\n\n\n\n\n\n\nleft_sum = [0]*(n+1)\nright_sum = [0]*(n+1)\nleft_sum[0] = sum(left_seq) \nright_sum[n] = sum(right_seq) \n\n\nfor i in range(n):\n if left_seq[0]a[n+i]: # (20): NO CHANGE (25): NO CHANGE (30): NO CHANGE\n right_sum[i] = right_sum[i+1]-right_seq[-1]+a[n+i] # (21): right_sum=[0, 0, 7, 16] (26): right_sum=[0, 5, 7, 16]\n del right_seq[-1] # (22): right_seq=[2, 3] (27): right_seq=[2, 3]\n heapq.heappush(right_seq, a[n+i]) # (23): right_seq=[2, 3, 2] (28): right_seq=[0, 3, 2]\n else:\n right_sum[i] = right_sum[i+1] # (31): right_sum=[5, 5, 7, 16]\n \n\nans = -float(\"inf\") # (33): ans=-inf\nfor i in range(n+1): # (34): NO CHANGE (36): i=1 ... (42): NO CHANGE\n ans = max(ans,left_sum[i]-right_sum[i]) # (35): ans=8 (37): ans=12 ... (41): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " import heapq\n n = int(input())\n a = list(map(int,input().split()))\n \n+\n left_seq = sorted(a[0:n])\n-right_seq = sorted(a[2*n:3*n])\n+right_seq = sorted(a[2*n:3*n],reverse=True)\n+for i in range(n):\n+ right_seq[i]=-right_seq[i]\n+\n+\n+\n+\n+\n+\n left_sum = [0]*(n+1)\n right_sum = [0]*(n+1)\n left_sum[0] = sum(left_seq) \n right_sum[n] = sum(right_seq) \n \n \n for i in range(n):\n if left_seq[0]a[n+i]:\n- right_sum[i] = right_sum[i+1]-right_seq[-1]+a[n+i]\n- del right_seq[-1]\n- heapq.heappush(right_seq, a[n+i])\n+ if right_seq[0]<-a[n+i]:\n+ right_sum[i] = right_sum[i+1] + (-a[n+i]) - right_seq[0]\n+ \n+ heapq.heappop(right_seq)\n+ heapq.heappush(right_seq, -a[n+i])\n+ \n else:\n right_sum[i] = right_sum[i+1]\n \n \n ans = -float(\"inf\")\n for i in range(n+1):\n- ans = max(ans,left_sum[i]-right_sum[i])\n+ \n+ ans = max(ans,left_sum[i]+right_sum[i])\n print(ans)\n-\n", "FL_content": " import heapq\n n = int(input())\n a = list(map(int,input().split()))\n \n left_seq = sorted(a[0:n])\n-right_seq = sorted(a[2*n:3*n])\n left_sum = [0]*(n+1)\n right_sum = [0]*(n+1)\n left_sum[0] = sum(left_seq) \n right_sum[n] = sum(right_seq) \n \n \n for i in range(n):\n if left_seq[0]a[n+i]:\n- right_sum[i] = right_sum[i+1]-right_seq[-1]+a[n+i]\n- del right_seq[-1]\n- heapq.heappush(right_seq, a[n+i])\n else:\n right_sum[i] = right_sum[i+1]\n \n \n ans = -float(\"inf\")\n for i in range(n+1):\n- ans = max(ans,left_sum[i]-right_sum[i])\n print(ans)\n-\n", "added_lines": 21, "removed_lines": 9, "code1_lines": 35 }, { "user_id": "u747873993", "problem_id": "p03264", "submission1_id": "s807816150", "submission2_id": "s330760544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K=int(input())\nif K%2==0:\n print(K/2*K/2)\nelse:\n print(K/2*(K-1)/2)", "code2": "K=int(input())\nif K%2==0:\n print(int(K*K/4))\nelse:\n print(int((K+1)*(K-1)/4))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561029712", "date2": "1561029989", "bleu_score": "0.7162318345397154", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "611\n", "actual_output": "93177.5\n", "expected_output": "93330\n\n", "anno_code": ["K=int(input()) # (0): K=611\nif K%2==0: # (1): NO CHANGE\n print(K/2*K/2)\nelse:\n print(K/2*(K-1)/2)"], "anno_status": [true], "diff_content": " K=int(input())\n if K%2==0:\n- print(K/2*K/2)\n+ print(int(K*K/4))\n else:\n- print(K/2*(K-1)/2)\n+ print(int((K+1)*(K-1)/4))\n", "FL_content": " K=int(input())\n if K%2==0:\n- print(K/2*K/2)\n else:\n- print(K/2*(K-1)/2)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u411435121", "problem_id": "p03264", "submission1_id": "s225396120", "submission2_id": "s240862101", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input())\n\nif k % 2 == 0:\n \tprint((k / 2)**2)\nelse:\n\tprint(k * (k - 1)) ", "code2": "k = int(input())\nif k % 2 == 0:\n \tprint(int((k / 2)**2))\nelse:\n\tprint(int(k", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550364439", "date2": "1550364959", "bleu_score": "0.8126893322816563", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-176\n", "actual_output": "7744.0\n", "expected_output": "7744\n\n", "anno_code": ["k = int(input()) # (0): k=-176\n\nif k % 2 == 0: # (1): NO CHANGE\n \tprint((k / 2)**2)\nelse:\n\tprint(k * (k - 1)) "], "anno_status": [true], "diff_content": " k = int(input())\n-\n if k % 2 == 0:\n- \tprint((k / 2)**2)\n+ \tprint(int((k / 2)**2))\n else:\n-\tprint(k * (k - 1)) \n+\tprint(int(k\n", "FL_content": " k = int(input())\n-\n if k % 2 == 0:\n- \tprint((k / 2)**2)\n else:\n-\tprint(k * (k - 1)) \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u125666426", "problem_id": "p03264", "submission1_id": "s041059636", "submission2_id": "s984159576", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nK = int(input())\nif K % 2 == 0:\n print((K / 2) ** 2)\nelse:\n print((K / 2) * ((K / 2) + 1))", "code2": "import math\n\nK = int(input())\nif K % 2 == 0:\n print(int((K / 2) ** 2))\nelse:\n print(math.floor(K / 2) * (math.floor(K / 2) + 1))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535851794", "date2": "1535854045", "bleu_score": "0.7765574989782481", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-1464\n", "actual_output": "535824.0\n", "expected_output": "535824\n\n", "anno_code": ["import math\n\nK = int(input()) # (0): K=-1464\nif K % 2 == 0: # (1): NO CHANGE\n print((K / 2) ** 2)\nelse:\n print((K / 2) * ((K / 2) + 1))"], "anno_status": [true], "diff_content": " import math\n \n K = int(input())\n if K % 2 == 0:\n- print((K / 2) ** 2)\n+ print(int((K / 2) ** 2))\n else:\n- print((K / 2) * ((K / 2) + 1))\n+ print(math.floor(K / 2) * (math.floor(K / 2) + 1))\n+\n", "FL_content": " import math\n \n K = int(input())\n if K % 2 == 0:\n- print((K / 2) ** 2)\n else:\n- print((K / 2) * ((K / 2) + 1))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u946090308", "problem_id": "p03264", "submission1_id": "s908825329", "submission2_id": "s476969237", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input()) \nif (k%2) == 1:\n oe = ((k+1) * (k-3)) / 8\n print(2 * oe)\nelse:\n o = (k+2) * (k-1)/8\n e = (k*(k-4))/8\n print(o+e)", "code2": "\nk = int(input()) \n\nif (k%2) == 1:\n o = (k-1) * (k+1) / 8\n \n print(int(2*o))\n\nelse:\n o = k * (k+2) / 8\n e = k * (k-2) / 8\n print(int(o+e))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535852865", "date2": "1535854666", "bleu_score": "0.7594300070843394", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-107\n", "actual_output": "2915.0\n", "expected_output": "2862\n\n", "anno_code": ["k = int(input()) # (0): k=-107\nif (k%2) == 1: # (1): NO CHANGE\n oe = ((k+1) * (k-3)) / 8 # (2): oe=1457.5\n print(2 * oe)\nelse:\n o = (k+2) * (k-1)/8\n e = (k*(k-4))/8\n print(o+e)"], "anno_status": [true], "diff_content": "+\n k = int(input()) \n+\n if (k%2) == 1:\n- oe = ((k+1) * (k-3)) / 8\n- print(2 * oe)\n+ o = (k-1) * (k+1) / 8\n+ \n+ print(int(2*o))\n+\n else:\n- o = (k+2) * (k-1)/8\n- e = (k*(k-4))/8\n- print(o+e)\n+ o = k * (k+2) / 8\n+ e = k * (k-2) / 8\n+ print(int(o+e))\n", "FL_content": " k = int(input()) \n if (k%2) == 1:\n- oe = ((k+1) * (k-3)) / 8\n- print(2 * oe)\n else:\n- o = (k+2) * (k-1)/8\n- e = (k*(k-4))/8\n- print(o+e)\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 8 }, { "user_id": "u855380359", "problem_id": "p03264", "submission1_id": "s086505323", "submission2_id": "s558785762", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input())\n\nif k%2 == 0:\n print(k*k/4)\nelse:\n print(k**2/4-1/4)", "code2": "k = int(input())\n \nif k%2 == 0:\n print(int(k*k/4))\nelse:\n print(int(k**2/4-1/4))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592856762", "date2": "1592856907", "bleu_score": "0.8346300053018955", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-2373\n", "actual_output": "1407782.0\n", "expected_output": "1407782\n\n", "anno_code": ["k = int(input()) # (0): k=-2373\n\nif k%2 == 0: # (1): NO CHANGE\n print(k*k/4)\nelse:\n print(k**2/4-1/4)"], "anno_status": [true], "diff_content": " k = int(input())\n-\n+ \n if k%2 == 0:\n- print(k*k/4)\n+ print(int(k*k/4))\n else:\n- print(k**2/4-1/4)\n+ print(int(k**2/4-1/4))\n", "FL_content": " k = int(input())\n-\n if k%2 == 0:\n- print(k*k/4)\n else:\n- print(k**2/4-1/4)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u980492406", "problem_id": "p03264", "submission1_id": "s078287074", "submission2_id": "s043671498", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nif a%2 == 0 :\n print(a**2/4)\nelse :\n print((a+1)/2*(a-1)/2)\n ", "code2": "a = int(input())\nif a%2 == 0 :\n print(int(a**2/4))\nelse :\n print(int((a+1)/2*(a-1)/2))\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555540593", "date2": "1555540767", "bleu_score": "0.8778860946533193", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-107\n", "actual_output": "2862.0\n", "expected_output": "2862\n\n", "anno_code": ["a = int(input()) # (0): a=-107\nif a%2 == 0 : # (1): NO CHANGE\n print(a**2/4)\nelse :\n print((a+1)/2*(a-1)/2)\n "], "anno_status": [true], "diff_content": " a = int(input())\n if a%2 == 0 :\n- print(a**2/4)\n+ print(int(a**2/4))\n else :\n- print((a+1)/2*(a-1)/2)\n+ print(int((a+1)/2*(a-1)/2))\n \n", "FL_content": " a = int(input())\n if a%2 == 0 :\n- print(a**2/4)\n else :\n- print((a+1)/2*(a-1)/2)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u498486375", "problem_id": "p03264", "submission1_id": "s082258519", "submission2_id": "s437675318", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K=int(input())\nif K%2==0:\n m=(K/2)**2\nelse:\n m=((K-1)/2)*(((K-1)/2)+1)\nprint(m)", "code2": "K=int(input())\nif K%2==0:\n m=(K/2)**2\nelse:\n m=((K-1)/2)*(((K-1)/2)+1)\nn=int(m)\nprint(n)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535850255", "date2": "1535850329", "bleu_score": "0.8902967173230238", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-1265\n", "actual_output": "400056.0\n", "expected_output": "400056\n\n", "anno_code": ["K=int(input()) # (0): K=-1265\nif K%2==0: # (1): NO CHANGE\n m=(K/2)**2\nelse:\n m=((K-1)/2)*(((K-1)/2)+1) # (2): m=400056.0\nprint(m)"], "anno_status": [true], "diff_content": " K=int(input())\n if K%2==0:\n m=(K/2)**2\n else:\n m=((K-1)/2)*(((K-1)/2)+1)\n-print(m)\n+n=int(m)\n+print(n)\n+\n", "FL_content": " K=int(input())\n if K%2==0:\n m=(K/2)**2\n else:\n m=((K-1)/2)*(((K-1)/2)+1)\n-print(m)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u044632922", "problem_id": "p03264", "submission1_id": "s294311700", "submission2_id": "s130696858", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k=int(input())\nif k%2==0:\n print(k/2*k/2)\nelse:\n print(int(((k-1)/2+1)*(k-1)/2))", "code2": "k=int(input())\nif k%2==0:\n print(int(k/2*k/2))\nelse:\n print(int(((k-1)/2+1)*(k-1)/2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566014373", "date2": "1566014715", "bleu_score": "0.9325565848544776", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 14, "total_score": 30, "input": "-176\n", "actual_output": "7744.0\n", "expected_output": "7744\n\n", "anno_code": ["k=int(input()) # (0): k=-176\nif k%2==0: # (1): NO CHANGE\n print(k/2*k/2)\nelse:\n print(int(((k-1)/2+1)*(k-1)/2))"], "anno_status": [true], "diff_content": " k=int(input())\n if k%2==0:\n- print(k/2*k/2)\n+ print(int(k/2*k/2))\n else:\n print(int(((k-1)/2+1)*(k-1)/2))\n", "FL_content": " k=int(input())\n if k%2==0:\n- print(k/2*k/2)\n else:\n print(int(((k-1)/2+1)*(k-1)/2))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u290187182", "problem_id": "p03264", "submission1_id": "s868645901", "submission2_id": "s103325291", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\ndef lcm(x, y):\n return (x * y) \n\nif __name__ == '__main__':\n a = [int(i) for i in input().split()]\n\n if a[0] %2 ==1:\n print(a[0]*(a[0]-1))\n else:\n print(a[0]*(a[0]))\n", "code2": "import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\ndef lcm(x, y):\n return (x * y) \n\nif __name__ == '__main__':\n a = [int(i) for i in input().split()]\n\n if a[0] %2 ==1:\n print((a[0]\n else:\n print((a[0]\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585596108", "date2": "1585596237", "bleu_score": "0.9389670608401266", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-50\n", "actual_output": "2500\n", "expected_output": "625\n\n", "anno_code": ["import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\ndef lcm(x, y): # (0): lcm=\n return (x * y) \n\nif __name__ == '__main__':\n a = [int(i) for i in input().split()]\n\n if a[0] %2 ==1:\n print(a[0]*(a[0]-1))\n else:\n print(a[0]*(a[0]))\n"], "anno_status": [true], "diff_content": " import sys\n import copy\n import math\n import bisect\n import pprint\n import bisect\n from functools import reduce\n from copy import deepcopy\n from collections import deque\n \n def lcm(x, y):\n return (x * y) \n \n if __name__ == '__main__':\n a = [int(i) for i in input().split()]\n \n if a[0] %2 ==1:\n- print(a[0]*(a[0]-1))\n+ print((a[0]\n else:\n- print(a[0]*(a[0]))\n+ print((a[0]\n \n", "FL_content": " import sys\n import copy\n import math\n import bisect\n import pprint\n import bisect\n from functools import reduce\n from copy import deepcopy\n from collections import deque\n \n def lcm(x, y):\n return (x * y) \n \n if __name__ == '__main__':\n a = [int(i) for i in input().split()]\n \n if a[0] %2 ==1:\n- print(a[0]*(a[0]-1))\n else:\n- print(a[0]*(a[0]))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 21 }, { "user_id": "u556477263", "problem_id": "p03264", "submission1_id": "s797417820", "submission2_id": "s035847598", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = int(input())\nprint(s/2 * (s+1)/2)", "code2": "s = int(input())\nprint((s-s", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600707876", "date2": "1600708017", "bleu_score": "0.6067582915997367", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-374\n", "actual_output": "34875.5\n", "expected_output": "34969\n\n", "anno_code": ["s = int(input()) # (0): s=-374\nprint(s/2 * (s+1)/2)"], "anno_status": [true], "diff_content": " s = int(input())\n-print(s/2 * (s+1)/2)\n+print((s-s\n", "FL_content": " s = int(input())\n-print(s/2 * (s+1)/2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u871596687", "problem_id": "p03264", "submission1_id": "s035921561", "submission2_id": "s552943812", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K = int(input())\n\nif K%2 == 0:\n print((K/2)**2)\nelse:\n print((K+1)/2*(K-1)/2)\n", "code2": "K = int(input())\n\nif K%2 == 0:\n print(int((K/2)**2))\nelse:\n print(int((K+1)/2*(K-1)/2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568914043", "date2": "1568914208", "bleu_score": "0.882328818239524", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-1265\n", "actual_output": "400056.0\n", "expected_output": "400056\n\n", "anno_code": ["K = int(input()) # (0): K=-1265\n\nif K%2 == 0: # (1): NO CHANGE\n print((K/2)**2)\nelse:\n print((K+1)/2*(K-1)/2)\n"], "anno_status": [true], "diff_content": " K = int(input())\n \n if K%2 == 0:\n- print((K/2)**2)\n+ print(int((K/2)**2))\n else:\n- print((K+1)/2*(K-1)/2)\n-\n+ print(int((K+1)/2*(K-1)/2))\n", "FL_content": " K = int(input())\n \n if K%2 == 0:\n- print((K/2)**2)\n else:\n- print((K+1)/2*(K-1)/2)\n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u264265458", "problem_id": "p03264", "submission1_id": "s567739781", "submission2_id": "s844466528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\na=int(input())\nif a%2==0:\n print(int(a*a/4))\nelse:\n print(math.ceil(a)*math.floor(a))", "code2": "import math\na=int(input())\nif a%2==0:\n print(int(a*a/4))\nelse:\n print(math.ceil(a/2)*math.floor(a/2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566358365", "date2": "1566358461", "bleu_score": "0.9330781069077269", "code1_test_status": [0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 16, "total_score": 30, "input": "-147\n", "actual_output": "21609\n", "expected_output": "5402\n\n", "anno_code": ["import math\na=int(input()) # (0): a=-147\nif a%2==0: # (1): NO CHANGE\n print(int(a*a/4))\nelse:\n print(math.ceil(a)*math.floor(a))"], "anno_status": [true], "diff_content": " import math\n a=int(input())\n if a%2==0:\n print(int(a*a/4))\n else:\n- print(math.ceil(a)*math.floor(a))\n+ print(math.ceil(a/2)*math.floor(a/2))\n", "FL_content": " import math\n a=int(input())\n if a%2==0:\n print(int(a*a/4))\n else:\n- print(math.ceil(a)*math.floor(a))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u946090308", "problem_id": "p03264", "submission1_id": "s096238727", "submission2_id": "s476969237", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input()) \nif (k%2) == 1:\n oe = ((k+1) * (k-3)) / 8\n print(2 * oe)\nelse:\n o = (k+2) * (k-2)/8\n e = k * (k-4) / 8\n print(o+e)", "code2": "\nk = int(input()) \n\nif (k%2) == 1:\n o = (k-1) * (k+1) / 8\n \n print(int(2*o))\n\nelse:\n o = k * (k+2) / 8\n e = k * (k-2) / 8\n print(int(o+e))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535852959", "date2": "1535854666", "bleu_score": "0.8029886198777916", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-74\n", "actual_output": "1405.5\n", "expected_output": "1369\n\n", "anno_code": ["k = int(input()) # (0): k=-74\nif (k%2) == 1: # (1): NO CHANGE\n oe = ((k+1) * (k-3)) / 8\n print(2 * oe)\nelse:\n o = (k+2) * (k-2)/8 # (2): o=684.0\n e = k * (k-4) / 8 # (3): e=721.5\n print(o+e)"], "anno_status": [true], "diff_content": "+\n k = int(input()) \n+\n if (k%2) == 1:\n- oe = ((k+1) * (k-3)) / 8\n- print(2 * oe)\n+ o = (k-1) * (k+1) / 8\n+ \n+ print(int(2*o))\n+\n else:\n- o = (k+2) * (k-2)/8\n- e = k * (k-4) / 8\n- print(o+e)\n+ o = k * (k+2) / 8\n+ e = k * (k-2) / 8\n+ print(int(o+e))\n", "FL_content": " k = int(input()) \n if (k%2) == 1:\n- oe = ((k+1) * (k-3)) / 8\n- print(2 * oe)\n else:\n- o = (k+2) * (k-2)/8\n- e = k * (k-4) / 8\n- print(o+e)\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 8 }, { "user_id": "u543954314", "problem_id": "p03264", "submission1_id": "s658246064", "submission2_id": "s586449243", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input())\nif k % 2 == 0:\n print(k**2/4)\nelse:\n print((k+1)*(k-1)/4)", "code2": "k = int(input())\nif k % 2 == 0:\n print(int(k**2/4))\nelse:\n print(int((k+1)*(k-1)/4))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550176023", "date2": "1550176502", "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], "code1_test_score": 0, "total_score": 30, "input": "-147\n", "actual_output": "5402.0\n", "expected_output": "5402\n\n", "anno_code": ["k = int(input()) # (0): k=-147\nif k % 2 == 0: # (1): NO CHANGE\n print(k**2/4)\nelse:\n print((k+1)*(k-1)/4)"], "anno_status": [true], "diff_content": " k = int(input())\n if k % 2 == 0:\n- print(k**2/4)\n+ print(int(k**2/4))\n else:\n- print((k+1)*(k-1)/4)\n+ print(int((k+1)*(k-1)/4))\n", "FL_content": " k = int(input())\n if k % 2 == 0:\n- print(k**2/4)\n else:\n- print((k+1)*(k-1)/4)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u747873993", "problem_id": "p03264", "submission1_id": "s021638210", "submission2_id": "s330760544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K=int(input())\nif K%2==0:\n print(K*K/4)\nelse:\n print((K-1)*(K-1)/4)", "code2": "K=int(input())\nif K%2==0:\n print(int(K*K/4))\nelse:\n print(int((K+1)*(K-1)/4))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561029945", "date2": "1561029989", "bleu_score": "0.8281893837868014", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "259\n", "actual_output": "16641.0\n", "expected_output": "16770\n\n", "anno_code": ["K=int(input()) # (0): K=259\nif K%2==0: # (1): NO CHANGE\n print(K*K/4)\nelse:\n print((K-1)*(K-1)/4)"], "anno_status": [true], "diff_content": " K=int(input())\n if K%2==0:\n- print(K*K/4)\n+ print(int(K*K/4))\n else:\n- print((K-1)*(K-1)/4)\n+ print(int((K+1)*(K-1)/4))\n", "FL_content": " K=int(input())\n if K%2==0:\n- print(K*K/4)\n else:\n- print((K-1)*(K-1)/4)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u747873993", "problem_id": "p03264", "submission1_id": "s745896227", "submission2_id": "s330760544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K=int(input())\nif K%2==0:\n print(K*K/4)\nelse:\n print((K+1)*(K-1)/4)", "code2": "K=int(input())\nif K%2==0:\n print(int(K*K/4))\nelse:\n print(int((K+1)*(K-1)/4))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561029835", "date2": "1561029989", "bleu_score": "0.8610214589877293", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-374\n", "actual_output": "34969.0\n", "expected_output": "34969\n\n", "anno_code": ["K=int(input()) # (0): K=-374\nif K%2==0: # (1): NO CHANGE\n print(K*K/4)\nelse:\n print((K+1)*(K-1)/4)"], "anno_status": [true], "diff_content": " K=int(input())\n if K%2==0:\n- print(K*K/4)\n+ print(int(K*K/4))\n else:\n- print((K+1)*(K-1)/4)\n+ print(int((K+1)*(K-1)/4))\n", "FL_content": " K=int(input())\n if K%2==0:\n- print(K*K/4)\n else:\n- print((K+1)*(K-1)/4)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u518042385", "problem_id": "p03264", "submission1_id": "s978781518", "submission2_id": "s730898226", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i=int(input())\nif i%2==0:\n print((i/2)**2)\nelse:\n print((i+1)*(i-1)/4)", "code2": "i=int(input())\nif i%2==0:\n print(int((i/2)**2))\nelse:\n print(int((i+1)*(i-1)/4))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554079291", "date2": "1554079369", "bleu_score": "0.8555826064135968", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 30, "input": "-626\n", "actual_output": "97969.0\n", "expected_output": "97969\n\n", "anno_code": ["i=int(input()) # (0): i=-626\nif i%2==0: # (1): NO CHANGE\n print((i/2)**2)\nelse:\n print((i+1)*(i-1)/4)"], "anno_status": [true], "diff_content": " i=int(input())\n if i%2==0:\n- print((i/2)**2)\n+ print(int((i/2)**2))\n else:\n- print((i+1)*(i-1)/4)\n+ print(int((i+1)*(i-1)/4))\n+\n", "FL_content": " i=int(input())\n if i%2==0:\n- print((i/2)**2)\n else:\n- print((i+1)*(i-1)/4)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u940279019", "problem_id": "p03264", "submission1_id": "s140894702", "submission2_id": "s789031655", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K = int(input())\nif(K%2 == 0):\n print(int((K/2)**2))\nelse:\n print(int((K/2)*(K/2+1)))", "code2": "K = int(input())\nif(K%2 == 0):\n print(int((K/2)**2))\nelse:\n print(int(((K-1)/2)*((K+1)/2)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555360977", "date2": "1555361098", "bleu_score": "0.8693936668747004", "code1_test_status": [0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 16, "total_score": 30, "input": "-2373\n", "actual_output": "1406595\n", "expected_output": "1407782\n\n", "anno_code": ["K = int(input()) # (0): K=-2373\nif(K%2 == 0): # (1): NO CHANGE\n print(int((K/2)**2))\nelse:\n print(int((K/2)*(K/2+1)))"], "anno_status": [true], "diff_content": " K = int(input())\n if(K%2 == 0):\n print(int((K/2)**2))\n else:\n- print(int((K/2)*(K/2+1)))\n+ print(int(((K-1)/2)*((K+1)/2)))\n", "FL_content": " K = int(input())\n if(K%2 == 0):\n print(int((K/2)**2))\n else:\n- print(int((K/2)*(K/2+1)))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u022871813", "problem_id": "p03264", "submission1_id": "s951128304", "submission2_id": "s388032165", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input())\nif k%2 == 0:\n a = (k/2)**2\n print(a)\nelse:\n a = ((k-1)/2)*((k-1)/2 + 1)\n print(int(a))\n", "code2": "k = int(input())\nif k%2 == 0:\n a = (k/2)**2\n print(int(a))\nelse:\n a = ((k-1)/2)*((k-1)/2 + 1)\n print(int(a))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537641221", "date2": "1537641765", "bleu_score": "0.9517884201667844", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 14, "total_score": 30, "input": "382\n", "actual_output": "36481.0\n", "expected_output": "36481\n\n", "anno_code": ["k = int(input()) # (0): k=382\nif k%2 == 0: # (1): NO CHANGE\n a = (k/2)**2 # (2): a=36481.0\n print(a)\nelse:\n a = ((k-1)/2)*((k-1)/2 + 1)\n print(int(a))\n"], "anno_status": [true], "diff_content": " k = int(input())\n if k%2 == 0:\n a = (k/2)**2\n- print(a)\n+ print(int(a))\n else:\n a = ((k-1)/2)*((k-1)/2 + 1)\n print(int(a))\n \n", "FL_content": " k = int(input())\n if k%2 == 0:\n a = (k/2)**2\n- print(a)\n else:\n a = ((k-1)/2)*((k-1)/2 + 1)\n print(int(a))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u209620426", "problem_id": "p03264", "submission1_id": "s435216119", "submission2_id": "s898783224", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nk = 50\n\nif k%2:\n print(math.floor(k/2)*math.ceil(k/2))\nelse:\n print(int((k/2)**2))", "code2": "import math\n\nk = int(input())\n\nif k%2:\n print(math.floor(k/2)*math.ceil(k/2))\nelse:\n print(int((k/2)**2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536405561", "date2": "1536406077", "bleu_score": "0.8765201236667678", "code1_test_status": [0, 0, 0, 0, 0, 0, 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": 30, "input": "-931\n", "actual_output": "625\n", "expected_output": "216690\n\n", "anno_code": ["import math\n\nk = 50 # (0): k=50\n\nif k%2: # (1): NO CHANGE\n print(math.floor(k/2)*math.ceil(k/2))\nelse:\n print(int((k/2)**2))"], "anno_status": [true], "diff_content": " import math\n \n-k = 50\n+k = int(input())\n \n if k%2:\n print(math.floor(k/2)*math.ceil(k/2))\n else:\n print(int((k/2)**2))\n", "FL_content": " import math\n \n-k = 50\n \n if k%2:\n print(math.floor(k/2)*math.ceil(k/2))\n else:\n print(int((k/2)**2))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u451100851", "problem_id": "p02553", "submission1_id": "s226095019", "submission2_id": "s861470987", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = [int(t) for t in input().split()]\nprint(max([b*d, a*c, a*d, b*d]))", "code2": "a, b, c, d = [int(t) for t in input().split()]\nprint(max([b*d, a*c, a*d, b*c]))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600205110", "date2": "1600205156", "bleu_score": "0.9674122890261669", "code1_test_status": [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, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "-3 -6 -2 -1\n", "actual_output": "6\n", "expected_output": "12\n\n", "anno_code": ["a, b, c, d = [int(t) for t in input().split()] # (0): a=-3, b=-6, c=-2, d=-1\nprint(max([b*d, a*c, a*d, b*d]))"], "anno_status": [true], "diff_content": " a, b, c, d = [int(t) for t in input().split()]\n-print(max([b*d, a*c, a*d, b*d]))\n+print(max([b*d, a*c, a*d, b*c]))\n", "FL_content": " a, b, c, d = [int(t) for t in input().split()]\n-print(max([b*d, a*c, a*d, b*d]))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u236441175", "problem_id": "p02553", "submission1_id": "s602736263", "submission2_id": "s094921014", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = input().split()\n\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\n\n\nprint(a, b, c, d)\n\nX1 = min(a,b) * min(c,d)\nX2 = min(a,b) * max(c,d)\nX3 = max(a,b) * min(c,d)\nX4 = max(a,b) * max(c,d)\n\nprint(max(X1,X2,X3,X4))\n", "code2": "a, b, c, d = input().split()\n\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\n\nX1 = min(a,b) * min(c,d)\nX2 = min(a,b) * max(c,d)\nX3 = max(a,b) * min(c,d)\nX4 = max(a,b) * max(c,d)\n\nprint(max(X1,X2,X3,X4))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600023970", "date2": "1600023984", "bleu_score": "0.9010751057212905", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "-75619035 -2 -1151695436 0\n", "actual_output": "-75619035 -2 -1151695436 0\n87090097484224260\n", "expected_output": "87090097484224260\n\n", "anno_code": ["a, b, c, d = input().split() # (0): a=-75619035, b=-2, c=-1151695436, d=0\n\na=int(a) # (1): a=-75619035\nb=int(b) # (2): b=-2\nc=int(c) # (3): c=-1151695436\nd=int(d) # (4): d=0\n\n\nprint(a, b, c, d) # (5): NO CHANGE\n\nX1 = min(a,b) * min(c,d) # (6): X1=87090097484224260\nX2 = min(a,b) * max(c,d) # (7): X2=0\nX3 = max(a,b) * min(c,d) # (8): X3=2303390872\nX4 = max(a,b) * max(c,d) # (9): X4=0\n\nprint(max(X1,X2,X3,X4))\n"], "anno_status": [true], "diff_content": " a, b, c, d = input().split()\n \n a=int(a)\n b=int(b)\n c=int(c)\n d=int(d)\n \n-\n-print(a, b, c, d)\n-\n X1 = min(a,b) * min(c,d)\n X2 = min(a,b) * max(c,d)\n X3 = max(a,b) * min(c,d)\n X4 = max(a,b) * max(c,d)\n \n print(max(X1,X2,X3,X4))\n \n", "FL_content": " a, b, c, d = input().split()\n \n a=int(a)\n b=int(b)\n c=int(c)\n d=int(d)\n \n-\n-print(a, b, c, d)\n-\n X1 = min(a,b) * min(c,d)\n X2 = min(a,b) * max(c,d)\n X3 = max(a,b) * min(c,d)\n X4 = max(a,b) * max(c,d)\n \n print(max(X1,X2,X3,X4))\n \n", "added_lines": 0, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u991542950", "problem_id": "p02553", "submission1_id": "s816912975", "submission2_id": "s494210493", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nprint(max(a, b) * max(c, d))", "code2": "a, b, c, d = map(int, input().split())\nprint(max(a * c, b * d, a*d, b*c))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600023692", "date2": "1600023882", "bleu_score": "0.7576487716619199", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 1, 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, 1, 0, 0, 0, 1, 0, 1, 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, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0], "code1_test_score": 19, "total_score": 102, "input": "-1 7 -3 0\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=-1, b=7, c=-3, d=0\nprint(max(a, b) * max(c, d))"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n-print(max(a, b) * max(c, d))\n+print(max(a * c, b * d, a*d, b*c))\n", "FL_content": " a, b, c, d = map(int, input().split())\n-print(max(a, b) * max(c, d))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u771710924", "problem_id": "p02553", "submission1_id": "s096502721", "submission2_id": "s450306173", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(map(int, input().split()))\nans = -float('inf')\nfor i, v in enumerate(a):\n for j in a[i + 1:]:\n ans = max(ans, v * j)\nprint(ans)", "code2": "a,b,c,d = map(int, input().split())\na = [a, b]\nb = [c, d]\n\nans = -float('inf')\nfor i in a:\n for j in b:\n ans = max(ans, i * j)\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600058611", "date2": "1600058715", "bleu_score": "0.7362411615585196", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 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, 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, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0], "code1_test_score": 82, "total_score": 102, "input": "6 39 -3 1\n", "actual_output": "234\n", "expected_output": "39\n\n", "anno_code": ["a = list(map(int, input().split())) # (0): a=[6, 39, -3, 1]\nans = -float('inf') # (1): ans=-inf\nfor i, v in enumerate(a): # (2): i=0, v=6 (10): i=1, v=39 ... (22): NO CHANGE\n for j in a[i + 1:]: # (3): j=39 (5): j=-3 ... (21): NO CHANGE\n ans = max(ans, v * j) # (4): ans=234 (6): NO CHANGE ... (18): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": "-a = list(map(int, input().split()))\n+a,b,c,d = map(int, input().split())\n+a = [a, b]\n+b = [c, d]\n+\n ans = -float('inf')\n-for i, v in enumerate(a):\n- for j in a[i + 1:]:\n- ans = max(ans, v * j)\n+for i in a:\n+ for j in b:\n+ ans = max(ans, i * j)\n print(ans)\n", "FL_content": "-a = list(map(int, input().split()))\n ans = -float('inf')\n-for i, v in enumerate(a):\n- for j in a[i + 1:]:\n- ans = max(ans, v * j)\n print(ans)\n", "added_lines": 7, "removed_lines": 4, "code1_lines": 6 }, { "user_id": "u366996583", "problem_id": "p02553", "submission1_id": "s328444809", "submission2_id": "s782134721", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d=map(int,input().split())\nprint(max(a*b,a*c,b*c,b*d))", "code2": "a,b,c,d=map(int,input().split())\nprint(max(a*c,a*d,b*c,b*d))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600189585", "date2": "1600189680", "bleu_score": "0.9385256146062585", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 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, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0], "code1_test_score": 77, "total_score": 102, "input": "-32 -8 -1 0\n", "actual_output": "256\n", "expected_output": "32\n\n", "anno_code": ["a,b,c,d=map(int,input().split()) # (0): a=-32, b=-8, c=-1, d=0\nprint(max(a*b,a*c,b*c,b*d))"], "anno_status": [true], "diff_content": " a,b,c,d=map(int,input().split())\n-print(max(a*b,a*c,b*c,b*d))\n+print(max(a*c,a*d,b*c,b*d))\n", "FL_content": " a,b,c,d=map(int,input().split())\n-print(max(a*b,a*c,b*c,b*d))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u995109095", "problem_id": "p02553", "submission1_id": "s614804602", "submission2_id": "s857981049", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport collections as cc\nimport math as mt\nI=lambda:list(map(int,input().split()))\na,b,c,d=I()\nprint(max(a*c,a*d,b*d,b*d))", "code2": "import sys\nimport collections as cc\nimport math as mt\nI=lambda:list(map(int,input().split()))\na,b,c,d=I()\nprint(max(a*c,a*d,b*c,b*d))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600023866", "date2": "1600023902", "bleu_score": "0.9808766462985948", "code1_test_status": [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, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "10 3 -2 -8\n", "actual_output": "-20\n", "expected_output": "-6\n\n", "anno_code": ["import sys\nimport collections as cc\nimport math as mt\nI=lambda:list(map(int,input().split())) # (0): I= at 0x00000292293A9BD0>\na,b,c,d=I() # (1): a=10, b=3, c=-2, d=-8\nprint(max(a*c,a*d,b*d,b*d))"], "anno_status": [true], "diff_content": " import sys\n import collections as cc\n import math as mt\n I=lambda:list(map(int,input().split()))\n a,b,c,d=I()\n-print(max(a*c,a*d,b*d,b*d))\n+print(max(a*c,a*d,b*c,b*d))\n", "FL_content": " import sys\n import collections as cc\n import math as mt\n I=lambda:list(map(int,input().split()))\n a,b,c,d=I()\n-print(max(a*c,a*d,b*d,b*d))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u364386647", "problem_id": "p02553", "submission1_id": "s028386806", "submission2_id": "s520908448", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n a, b, c, d = list(map(int, input().split()))\n ans = -10 ** 9\n\n for x in (a, b):\n for y in (c, d):\n ans = max(ans, x * y)\n if (b == 0 and d > 0) or (b > 0 and d == 0):\n ans = 0\n\n print(ans)\n\nresolve()", "code2": "def resolve():\n a, b, c, d = list(map(int, input().split()))\n ans = - 10 ** 19\n\n for x in (a, b):\n for y in (c, d):\n ans = max(ans, x * y)\n\n print(ans)\n\nresolve()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600026312", "date2": "1600030458", "bleu_score": "0.6992852962144154", "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, 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, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 102, "input": "-107235604 0 -2758789909 1\n", "actual_output": "0\n", "expected_output": "295840502200720036\n\n", "anno_code": ["def resolve(): # (0): resolve=\n a, b, c, d = list(map(int, input().split())) # (2): a=-107235604, b=0, c=-2758789909, d=1\n ans = -10 ** 9 # (3): ans=-1000000000\n\n for x in (a, b): # (4): x=-107235604 (10): x=0 (16): NO CHANGE\n for y in (c, d): # (5): y=-2758789909 (7): y=1 ... (15): NO CHANGE\n ans = max(ans, x * y) # (6): ans=295840502200720036 (8): NO CHANGE ... (14): NO CHANGE\n if (b == 0 and d > 0) or (b > 0 and d == 0): # (17): NO CHANGE\n ans = 0 # (18): ans=0\n\n print(ans)\n\nresolve() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def resolve():\n a, b, c, d = list(map(int, input().split()))\n- ans = -10 ** 9\n+ ans = - 10 ** 19\n \n for x in (a, b):\n for y in (c, d):\n ans = max(ans, x * y)\n- if (b == 0 and d > 0) or (b > 0 and d == 0):\n- ans = 0\n \n print(ans)\n \n resolve()\n", "FL_content": " def resolve():\n a, b, c, d = list(map(int, input().split()))\n- ans = -10 ** 9\n \n for x in (a, b):\n for y in (c, d):\n ans = max(ans, x * y)\n- if (b == 0 and d > 0) or (b > 0 and d == 0):\n- ans = 0\n \n print(ans)\n \n resolve()\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u626337957", "problem_id": "p02553", "submission1_id": "s227447881", "submission2_id": "s997999660", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nprint(max(a*c, b*c, b*c, a*d))", "code2": "a, b, c, d = map(int, input().split())\nprint(max(a*c, b*c, b*d, a*d))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600023803", "date2": "1600026037", "bleu_score": "0.9484696017312617", "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, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 102, "input": "6 13 -3 1\n", "actual_output": "6\n", "expected_output": "13\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=6, b=13, c=-3, d=1\nprint(max(a*c, b*c, b*c, a*d))"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n-print(max(a*c, b*c, b*c, a*d))\n+print(max(a*c, b*c, b*d, a*d))\n+\n", "FL_content": " a, b, c, d = map(int, input().split())\n-print(max(a*c, b*c, b*c, a*d))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u250366438", "problem_id": "p02553", "submission1_id": "s237525316", "submission2_id": "s841133998", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == \"__main__\":\n a, b, c, d = map(int, input().split())\n x_list = [a, b]\n y_list = [c, d]\n ans = 0\n\n if x_list[0] <= 0 and x_list[1] <= 0 and y_list[0] >= 0 and y_list[1] >= 0:\n ans = max(x_list) * min(y_list)\n elif (x_list[0] >= 0 and x_list[1] >= 0 and y_list[0] <= 0 and y_list[1] <= 0):\n ans = max(y_list) * min(x_list)\n elif (x_list[0] <= 0 or x_list[1] <= 0) and (y_list[0] <= 0 or y_list[1] <= 0):\n ans = min(x_list) * min(y_list)\n else:\n ans = max(x_list) * max(y_list)\n\n print(ans)", "code2": "if __name__ == \"__main__\":\n a, b, c, d = map(int, input().split())\n x_list = [a, b]\n y_list = [c, d]\n ans = 0\n\n if x_list[0] <= 0 and x_list[1] <= 0 and y_list[0] >= 0 and y_list[1] >= 0:\n ans = max(x_list) * min(y_list)\n elif x_list[0] >= 0 and x_list[1] >= 0 and y_list[0] <= 0 and y_list[1] <= 0:\n ans = max(y_list) * min(x_list)\n elif (x_list[0] <= 0 or x_list[1] <= 0) and (y_list[0] <= 0 or y_list[1] <= 0):\n ans = max(min(x_list) * min(y_list), max(x_list) * max(y_list))\n else:\n ans = max(x_list) * max(y_list)\n\n print(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600025756", "date2": "1600026538", "bleu_score": "0.9396506089685283", "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, 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, 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], "code1_test_score": 98, "total_score": 102, "input": "0 8 -1 1\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["if __name__ == \"__main__\":\n a, b, c, d = map(int, input().split())\n x_list = [a, b]\n y_list = [c, d]\n ans = 0\n\n if x_list[0] <= 0 and x_list[1] <= 0 and y_list[0] >= 0 and y_list[1] >= 0:\n ans = max(x_list) * min(y_list)\n elif (x_list[0] >= 0 and x_list[1] >= 0 and y_list[0] <= 0 and y_list[1] <= 0):\n ans = max(y_list) * min(x_list)\n elif (x_list[0] <= 0 or x_list[1] <= 0) and (y_list[0] <= 0 or y_list[1] <= 0):\n ans = min(x_list) * min(y_list)\n else:\n ans = max(x_list) * max(y_list)\n\n print(ans)"], "anno_status": [true], "diff_content": " if __name__ == \"__main__\":\n a, b, c, d = map(int, input().split())\n x_list = [a, b]\n y_list = [c, d]\n ans = 0\n \n if x_list[0] <= 0 and x_list[1] <= 0 and y_list[0] >= 0 and y_list[1] >= 0:\n ans = max(x_list) * min(y_list)\n- elif (x_list[0] >= 0 and x_list[1] >= 0 and y_list[0] <= 0 and y_list[1] <= 0):\n+ elif x_list[0] >= 0 and x_list[1] >= 0 and y_list[0] <= 0 and y_list[1] <= 0:\n ans = max(y_list) * min(x_list)\n elif (x_list[0] <= 0 or x_list[1] <= 0) and (y_list[0] <= 0 or y_list[1] <= 0):\n- ans = min(x_list) * min(y_list)\n+ ans = max(min(x_list) * min(y_list), max(x_list) * max(y_list))\n else:\n ans = max(x_list) * max(y_list)\n \n print(ans)\n", "FL_content": " if __name__ == \"__main__\":\n a, b, c, d = map(int, input().split())\n x_list = [a, b]\n y_list = [c, d]\n ans = 0\n \n if x_list[0] <= 0 and x_list[1] <= 0 and y_list[0] >= 0 and y_list[1] >= 0:\n ans = max(x_list) * min(y_list)\n- elif (x_list[0] >= 0 and x_list[1] >= 0 and y_list[0] <= 0 and y_list[1] <= 0):\n ans = max(y_list) * min(x_list)\n elif (x_list[0] <= 0 or x_list[1] <= 0) and (y_list[0] <= 0 or y_list[1] <= 0):\n- ans = min(x_list) * min(y_list)\n else:\n ans = max(x_list) * max(y_list)\n \n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 16 }, { "user_id": "u773440446", "problem_id": "p02553", "submission1_id": "s904828488", "submission2_id": "s389856513", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = map(int,input().split())\nans = []\nfor i in c,d:\n ans.append(a*i)\nfor j in c,d:\n ans.append(b*i)\n\nprint(max(ans))", "code2": "a,b,c,d = map(int,input().split())\nans = []\nfor i in c,d:\n ans.append(a*i)\nfor j in c,d:\n ans.append(b*j)\n\nprint(max(ans))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600024509", "date2": "1600024766", "bleu_score": "0.9801160289133815", "code1_test_status": [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, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "10 3 -2 -8\n", "actual_output": "-20\n", "expected_output": "-6\n\n", "anno_code": ["a,b,c,d = map(int,input().split()) # (0): a=10, b=3, c=-2, d=-8\nans = [] # (1): ans=[]\nfor i in c,d: # (2): i=-2 (4): i=-8 (6): NO CHANGE\n ans.append(a*i) # (3): ans=[-20] (5): ans=[-20, -80]\nfor j in c,d: # (7): j=-2 (9): j=-8 (11): NO CHANGE\n ans.append(b*i) # (8): ans=[-20, -80, -24] (10): ans=[-20, -80, -24, -24]\n\nprint(max(ans))"], "anno_status": [true], "diff_content": " a,b,c,d = map(int,input().split())\n ans = []\n for i in c,d:\n ans.append(a*i)\n for j in c,d:\n- ans.append(b*i)\n+ ans.append(b*j)\n \n print(max(ans))\n", "FL_content": " a,b,c,d = map(int,input().split())\n ans = []\n for i in c,d:\n ans.append(a*i)\n for j in c,d:\n- ans.append(b*i)\n \n print(max(ans))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u349457050", "problem_id": "p02553", "submission1_id": "s122916710", "submission2_id": "s004568592", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef input(): return sys.stdin.readline().strip()\na,b,c,d=get_ints()\nx=max(a,b)\ny=max(c,d)\nprint(x*y)", "code2": "import sys\nimport math\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef input(): return sys.stdin.readline().strip()\na,b,c,d=get_ints()\nans=[]\nx=a*c\ny=a*d\nz=b*c\nw=b*d\nans.extend(list([x,y,z,w]))\nprint(max(ans))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600023738", "date2": "1600023982", "bleu_score": "0.8107575964154379", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 1, 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, 1, 0, 0, 0, 1, 0, 1, 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, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0], "code1_test_score": 19, "total_score": 102, "input": "-50222641 1 -1078917638 2\n", "actual_output": "2\n", "expected_output": "54186093201841958\n\n", "anno_code": ["import sys\nimport math\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef input(): return sys.stdin.readline().strip()\na,b,c,d=get_ints() # (0): a=-50222641, b=1, c=-1078917638, d=2\nx=max(a,b) # (1): x=1\ny=max(c,d) # (2): y=2\nprint(x*y)"], "anno_status": [true], "diff_content": " import sys\n import math\n def get_array(): return list(map(int, sys.stdin.readline().strip().split()))\n def get_ints(): return map(int, sys.stdin.readline().strip().split())\n def input(): return sys.stdin.readline().strip()\n a,b,c,d=get_ints()\n-x=max(a,b)\n-y=max(c,d)\n-print(x*y)\n+ans=[]\n+x=a*c\n+y=a*d\n+z=b*c\n+w=b*d\n+ans.extend(list([x,y,z,w]))\n+print(max(ans))\n+\n", "FL_content": " import sys\n import math\n def get_array(): return list(map(int, sys.stdin.readline().strip().split()))\n def get_ints(): return map(int, sys.stdin.readline().strip().split())\n def input(): return sys.stdin.readline().strip()\n a,b,c,d=get_ints()\n-x=max(a,b)\n-y=max(c,d)\n-print(x*y)\n", "added_lines": 8, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u336828547", "problem_id": "p02553", "submission1_id": "s834435282", "submission2_id": "s394130374", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d=map(int,input().split( ))\nprint(max(a*d,b*c,c*d,b*d))", "code2": "a,b,c,d=map(int,input().split( ))\nprint(max(a*d,b*c,a*c,b*d))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600373617", "date2": "1600373965", "bleu_score": "0.931630766864292", "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, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0], "code1_test_score": 33, "total_score": 102, "input": "-452063450 0 -1164863873 0\n", "actual_output": "0\n", "expected_output": "526592381208741850\n\n", "anno_code": ["a,b,c,d=map(int,input().split( )) # (0): a=-452063450, b=0, c=-1164863873, d=0\nprint(max(a*d,b*c,c*d,b*d))"], "anno_status": [true], "diff_content": " a,b,c,d=map(int,input().split( ))\n-print(max(a*d,b*c,c*d,b*d))\n+print(max(a*d,b*c,a*c,b*d))\n", "FL_content": " a,b,c,d=map(int,input().split( ))\n-print(max(a*d,b*c,c*d,b*d))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u631521893", "problem_id": "p02553", "submission1_id": "s777989555", "submission2_id": "s345197830", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nprint(max([a*c, a*d, b*d, b*d]))", "code2": "a, b, c, d = map(int, input().split())\nprint(max([a*c, a*d, b*c, b*d]))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600024101", "date2": "1600024145", "bleu_score": "0.9636162552773174", "code1_test_status": [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, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "10 3 -1 -8\n", "actual_output": "-10\n", "expected_output": "-3\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=10, b=3, c=-1, d=-8\nprint(max([a*c, a*d, b*d, b*d]))"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n-print(max([a*c, a*d, b*d, b*d]))\n+print(max([a*c, a*d, b*c, b*d]))\n", "FL_content": " a, b, c, d = map(int, input().split())\n-print(max([a*c, a*d, b*d, b*d]))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u639390371", "problem_id": "p02553", "submission1_id": "s005093798", "submission2_id": "s133113928", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d=list(map(int, input(\"Enter a multiple value: \").split())) \nprod=[]\n\nprod.append(a*c)\nprod.append(a*d)\nprod.append(b*c)\nprod.append(b*d)\n\nprint(max(prod))", "code2": "a,b,c,d=list(map(int, input().split())) \nprod=[]\n\nprod.append(a*c)\nprod.append(a*d)\nprod.append(b*c)\nprod.append(b*d)\n\nprint(max(prod))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600136765", "date2": "1600136994", "bleu_score": "0.8154618889750095", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "6 26 -4 1\n", "actual_output": "Enter a multiple value: 26\n", "expected_output": "26\n\n", "anno_code": ["a,b,c,d=list(map(int, input(\"Enter a multiple value: \").split())) # (0): a=6, b=26, c=-4, d=1\nprod=[] # (1): prod=[]\n\nprod.append(a*c) # (2): prod=[-24]\nprod.append(a*d) # (3): prod=[-24, 6]\nprod.append(b*c) # (4): prod=[-24, 6, -104]\nprod.append(b*d) # (5): prod=[-24, 6, -104, 26]\n\nprint(max(prod))"], "anno_status": [true], "diff_content": "-a,b,c,d=list(map(int, input(\"Enter a multiple value: \").split())) \n+a,b,c,d=list(map(int, input().split())) \n prod=[]\n \n prod.append(a*c)\n prod.append(a*d)\n prod.append(b*c)\n prod.append(b*d)\n \n print(max(prod))\n", "FL_content": "-a,b,c,d=list(map(int, input(\"Enter a multiple value: \").split())) \n prod=[]\n \n prod.append(a*c)\n prod.append(a*d)\n prod.append(b*c)\n prod.append(b*d)\n \n print(max(prod))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u347502437", "problem_id": "p02553", "submission1_id": "s567041215", "submission2_id": "s091406535", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nprint(max(a*c, b*d, a*d, b*d))\n", "code2": "def main():\n a, b, c, d = map(int, input().split())\n print(max(a*c, b*d, a*d, b*c))\n\nmain()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600163423", "date2": "1600163483", "bleu_score": "0.6699390325790295", "code1_test_status": [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, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "10 3 -1 -8\n", "actual_output": "-10\n", "expected_output": "-3\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=10, b=3, c=-1, d=-8\nprint(max(a*c, b*d, a*d, b*d))\n"], "anno_status": [true], "diff_content": "-a, b, c, d = map(int, input().split())\n-print(max(a*c, b*d, a*d, b*d))\n+def main():\n+ a, b, c, d = map(int, input().split())\n+ print(max(a*c, b*d, a*d, b*c))\n+\n+main()\n \n", "FL_content": "-a, b, c, d = map(int, input().split())\n-print(max(a*c, b*d, a*d, b*d))\n \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u960237860", "problem_id": "p02553", "submission1_id": "s570786641", "submission2_id": "s759303679", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\n\nans = -2e20\nfor x in [a, b, 0]:\n for y in [c,d, 0]:\n if x * y > ans:\n ans = x * y\nprint(ans)", "code2": "a, b, c, d = map(int, input().split())\n\nans = a * c\nfor x in [a, b]:\n for y in [c,d]:\n if x * y > ans:\n ans = x * y\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600023958", "date2": "1600024734", "bleu_score": "0.9001716774138057", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "3 5 -4 -2\n", "actual_output": "0\n", "expected_output": "-6\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=3, b=5, c=-4, d=-2\n\nans = -2e20 # (1): ans=-2e+20\nfor x in [a, b, 0]: # (2): x=3 (13): x=5 ... (29): NO CHANGE\n for y in [c,d, 0]: # (3): y=-4 (6): y=-2 ... (28): NO CHANGE\n if x * y > ans: # (4): NO CHANGE (7): NO CHANGE ... (27): NO CHANGE\n ans = x * y # (5): ans=-12 (8): ans=-6 (11): ans=0\nprint(ans)"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n \n-ans = -2e20\n-for x in [a, b, 0]:\n- for y in [c,d, 0]:\n+ans = a * c\n+for x in [a, b]:\n+ for y in [c,d]:\n if x * y > ans:\n ans = x * y\n print(ans)\n+\n", "FL_content": " a, b, c, d = map(int, input().split())\n \n-ans = -2e20\n-for x in [a, b, 0]:\n- for y in [c,d, 0]:\n if x * y > ans:\n ans = x * y\n print(ans)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u865373042", "problem_id": "p02553", "submission1_id": "s756253659", "submission2_id": "s696277809", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = map(int,input().split(' '))\nans1 = a*c\nans2 = a*c\nans3 = b*c\nans4 = b*d\n\nprint(max(ans1,ans2,ans3,ans4))", "code2": "a,b,c,d = map(int,input().split(' '))\nans1 = a*c\nans2 = a*d\nans3 = b*c\nans4 = b*d\n\nprint(max(ans1,ans2,ans3,ans4))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600087882", "date2": "1600087913", "bleu_score": "0.9776239904176703", "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, 0, 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, 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, 1, 0], "code1_test_score": 94, "total_score": 102, "input": "-1 2 0 -15\n", "actual_output": "0\n", "expected_output": "15\n\n", "anno_code": ["a,b,c,d = map(int,input().split(' ')) # (0): a=-1, b=2, c=0, d=-15\nans1 = a*c # (1): ans1=0\nans2 = a*c # (2): ans2=0\nans3 = b*c # (3): ans3=0\nans4 = b*d # (4): ans4=-30\n\nprint(max(ans1,ans2,ans3,ans4))"], "anno_status": [true], "diff_content": " a,b,c,d = map(int,input().split(' '))\n ans1 = a*c\n-ans2 = a*c\n+ans2 = a*d\n ans3 = b*c\n ans4 = b*d\n \n print(max(ans1,ans2,ans3,ans4))\n", "FL_content": " a,b,c,d = map(int,input().split(' '))\n ans1 = a*c\n-ans2 = a*c\n ans3 = b*c\n ans4 = b*d\n \n print(max(ans1,ans2,ans3,ans4))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u719873358", "problem_id": "p02553", "submission1_id": "s566470120", "submission2_id": "s220171511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = [int(x) for x in input().split()]\nprint(max(a*c,b*d,a*b,b*c)) \n", "code2": "a, b, c, d = [int(x) for x in input().split()]\nprint(max(a*c,b*d,a*d,b*c))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600023898", "date2": "1600024016", "bleu_score": "0.9425964775022463", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 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, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0], "code1_test_score": 77, "total_score": 102, "input": "-1 4 1 -7\n", "actual_output": "4\n", "expected_output": "7\n\n", "anno_code": ["a, b, c, d = [int(x) for x in input().split()] # (0): a=-1, b=4, c=1, d=-7\nprint(max(a*c,b*d,a*b,b*c)) \n"], "anno_status": [true], "diff_content": " a, b, c, d = [int(x) for x in input().split()]\n-print(max(a*c,b*d,a*b,b*c)) \n+print(max(a*c,b*d,a*d,b*c))\n \n", "FL_content": " a, b, c, d = [int(x) for x in input().split()]\n-print(max(a*c,b*d,a*b,b*c)) \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u516050812", "problem_id": "p02553", "submission1_id": "s637713268", "submission2_id": "s007203030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inp = list(map(int,input().split()))\nans = []\nfor i in range(4):\n for j in range(i+1,4):\n ans.append(inp[i] * inp[j])\n \nprint(max(ans))", "code2": "inp = list(map(int,input().split()))\nans = []\nfor i in range(2):\n for j in range(2,4):\n ans.append(inp[i] * inp[j])\n \nprint(max(ans))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600025829", "date2": "1600026576", "bleu_score": "0.9499577601926842", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 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, 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, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0], "code1_test_score": 82, "total_score": 102, "input": "6 13 -3 1\n", "actual_output": "78\n", "expected_output": "13\n\n", "anno_code": ["inp = list(map(int,input().split())) # (0): inp=[6, 13, -3, 1]\nans = [] # (1): ans=[]\nfor i in range(4): # (2): i=0 (10): i=1 ... (22): NO CHANGE\n for j in range(i+1,4): # (3): j=1 (5): j=2 ... (21): NO CHANGE\n ans.append(inp[i] * inp[j]) # (4): ans=[78] (6): ans=[78, -18] ... (18): ans=[78, -18, 6, -39, 13, -3]\n \nprint(max(ans))"], "anno_status": [true], "diff_content": " inp = list(map(int,input().split()))\n ans = []\n-for i in range(4):\n- for j in range(i+1,4):\n+for i in range(2):\n+ for j in range(2,4):\n ans.append(inp[i] * inp[j])\n \n print(max(ans))\n", "FL_content": " inp = list(map(int,input().split()))\n ans = []\n-for i in range(4):\n- for j in range(i+1,4):\n ans.append(inp[i] * inp[j])\n \n print(max(ans))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u770293614", "problem_id": "p02553", "submission1_id": "s762983715", "submission2_id": "s577897495", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d=map(int,input().split(\" \"))\np=max(a*c,b*c,a*c,a*d)\nprint(p)\n", "code2": "a,b,c,d=map(int,input().split(\" \"))\nprint(max(a*c,b*c,a*d,b*d))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600024144", "date2": "1600024204", "bleu_score": "0.8396604612147927", "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, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 102, "input": "1 -1 -2 -25\n", "actual_output": "2\n", "expected_output": "25\n\n", "anno_code": ["a,b,c,d=map(int,input().split(\" \")) # (0): a=1, b=-1, c=-2, d=-25\np=max(a*c,b*c,a*c,a*d) # (1): p=2\nprint(p)\n"], "anno_status": [true], "diff_content": " a,b,c,d=map(int,input().split(\" \"))\n-p=max(a*c,b*c,a*c,a*d)\n-print(p)\n+print(max(a*c,b*c,a*d,b*d))\n \n", "FL_content": " a,b,c,d=map(int,input().split(\" \"))\n-p=max(a*c,b*c,a*c,a*d)\n-print(p)\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u618637847", "problem_id": "p00023", "submission1_id": "s306795269", "submission2_id": "s853368534", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport math\n\n\nnum = int(input())\n\nfor i in range(num):\n ax,ay,ar,bx,by,br = map(float,input().split(' '))\n d = (ax - bx)*(ax - bx) + (ay * by)\n if d < (ar - br):\n print(2)\n if d < (br - ar):\n print(-2)\n elif d <= (ar + br):\n print(1)\n else:\n print(0)", "code2": "\n\nimport math \n\nnum = int(input())\nfor i in range(num):\n ax,ay,ar,bx,by,br=map(float,input().split())\n d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n r1 = (ar+br)*(ar+br)\n r2 = (ar-br)*(ar-br)\n if d <= r1 and d >= r2:\n print(1);\n elif d=br:\n print(2)\n elif d < r2 and ar <= br:\n print(-2)\n else:\n print(0)\n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494902216", "date2": "1494903037", "bleu_score": "0.695960734887893", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n1.7782119048814655 2.229054102605444 8.34592424739532 2.1321559253491804 4.08138413393845 6.1263826782839566\n3.374194988713775 1.1383521104600747 3.8255604638057257 5.273208013897418 3.552118764754478 5.216151553201928\n", "actual_output": "1\n1\n", "expected_output": "2\n1\n\n", "anno_code": ["\n\nimport math\n\n\nnum = int(input()) # (0): num=2\n\nfor i in range(num): # (1): i=0 (8): i=1\n ax,ay,ar,bx,by,br = map(float,input().split(' ')) # (2): ax=1.778212, ay=2.229054, ar=8.345924, bx=2.132156, by=4.081384, br=6.126383 (9): ax=3.374195, ay=1.138352, ar=3.82556, bx=5.273208, by=3.552119, br=5.216152\n d = (ax - bx)*(ax - bx) + (ay * by) # (3): d=9.222902 (10): d=7.649812\n if d < (ar - br): # (4): NO CHANGE (11): NO CHANGE\n print(2)\n if d < (br - ar): # (5): NO CHANGE (12): NO CHANGE\n print(-2)\n elif d <= (ar + br): # (6): NO CHANGE (13): NO CHANGE\n print(1) # (7): NO CHANGE (14): NO CHANGE\n else:\n print(0)"], "anno_status": [true], "diff_content": " \n \n-import math\n-\n+import math \n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)*(ax - bx) + (ay * by)\n- if d < (ar - br):\n- print(2)\n- if d < (br - ar):\n- print(-2)\n- elif d <= (ar + br):\n- print(1)\n+ ax,ay,ar,bx,by,br=map(float,input().split())\n+ d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n+ r1 = (ar+br)*(ar+br)\n+ r2 = (ar-br)*(ar-br)\n+ if d <= r1 and d >= r2:\n+ print(1);\n+ elif d=br:\n+ print(2)\n+ elif d < r2 and ar <= br:\n+ print(-2)\n else:\n print(0)\n+ \n", "FL_content": " \n \n-import math\n-\n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)*(ax - bx) + (ay * by)\n- if d < (ar - br):\n- print(2)\n- if d < (br - ar):\n- print(-2)\n- elif d <= (ar + br):\n- print(1)\n else:\n print(0)\n", "added_lines": 12, "removed_lines": 11, "code1_lines": 18 }, { "user_id": "u928329738", "problem_id": "p00023", "submission1_id": "s008316601", "submission2_id": "s315627077", "status1": "Wrong Answer", "status2": "Accepted", "code1": "for i in range(int(input())):\n points = input().split()\n p = list(map(float,points))\n if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2:\n print(2)\n elif (p[0]-p[3])**2 + (p[1]-p[4])**2 <= p[5]**2:\n print(-2)\n elif (p[3]-p[0])**2 + (p[4]-p[1])**2 <= (p[2]+p[5])**2:\n print(1)\n else:\n print(0)", "code2": "n=int(input())\nfor i in range(n):\n points = input().split()\n p = list(map(float,points))\n if (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]-p[5])**2:\n if p[5]>p[2]:\n print(-2)\n else:\n print(2)\n elif (p[0]-p[3])**2 + (p[1]-p[4])**2 >= (p[2]-p[5])**2 and (p[0]-p[3])**2 + (p[1]-p[4])**2 <= (p[2]+p[5])**2:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1511852318", "date2": "1511854245", "bleu_score": "0.805455546323997", "code1_test_status": [1, 0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 101, "input": "2\n3.1147350602004042 3.104014127818376 8.346090594022616 3.394681734559696 4.777899923453189 6.328774266228958\n3.6249592462761786 1.4833368850878772 3.8255604638057257 5.666886669242947 3.552118764754478 5.216151553201928\n", "actual_output": "2\n2\n", "expected_output": "2\n1\n\n", "anno_code": ["for i in range(int(input())): # (0): i=0 (5): i=1\n points = input().split() # (1): points=['3.1147350602004042', '3.104014127818376', '8.346090594022616', '3.394681734559696', '4.777899923453189', '6.328774266228958'] (6): points=['3.6249592462761786', '1.4833368850878772', '3.8255604638057257', '5.666886669242947', '3.552118764754478', '5.216151553201928']\n p = list(map(float,points)) # (2): p=[3.1147350602004042, 3.104014127818376, 8.346090594022616, 3.394681734559696, 4.777899923453189, 6.328774266228958] (7): p=[3.6249592462761786, 1.4833368850878772, 3.8255604638057257, 5.666886669242947, 3.552118764754478, 5.216151553201928]\n if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2: # (3): NO CHANGE (8): NO CHANGE\n print(2) # (4): NO CHANGE (9): NO CHANGE\n elif (p[0]-p[3])**2 + (p[1]-p[4])**2 <= p[5]**2:\n print(-2)\n elif (p[3]-p[0])**2 + (p[4]-p[1])**2 <= (p[2]+p[5])**2:\n print(1)\n else:\n print(0)"], "anno_status": [true], "diff_content": "-for i in range(int(input())):\n+n=int(input())\n+for i in range(n):\n points = input().split()\n p = list(map(float,points))\n- if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2:\n- print(2)\n- elif (p[0]-p[3])**2 + (p[1]-p[4])**2 <= p[5]**2:\n- print(-2)\n- elif (p[3]-p[0])**2 + (p[4]-p[1])**2 <= (p[2]+p[5])**2:\n+ if (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]-p[5])**2:\n+ if p[5]>p[2]:\n+ print(-2)\n+ else:\n+ print(2)\n+ elif (p[0]-p[3])**2 + (p[1]-p[4])**2 >= (p[2]-p[5])**2 and (p[0]-p[3])**2 + (p[1]-p[4])**2 <= (p[2]+p[5])**2:\n print(1)\n else:\n print(0)\n", "FL_content": "-for i in range(int(input())):\n points = input().split()\n p = list(map(float,points))\n- if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2:\n- print(2)\n- elif (p[0]-p[3])**2 + (p[1]-p[4])**2 <= p[5]**2:\n- print(-2)\n- elif (p[3]-p[0])**2 + (p[4]-p[1])**2 <= (p[2]+p[5])**2:\n print(1)\n else:\n print(0)\n", "added_lines": 8, "removed_lines": 6, "code1_lines": 11 }, { "user_id": "u618637847", "problem_id": "p00023", "submission1_id": "s047812315", "submission2_id": "s853368534", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport math\n\n\nnum = int(input())\n\nfor i in range(num):\n ax,ay,ar,bx,by,br = map(float,input().split(' '))\n d = (ax - bx)*(ax - bx) + (ay * by)\n if d < (br - ar):\n print(2)\n if d < (ar - br):\n print(-2)\n elif d <= (ar + br):\n print(1)\n else:\n print(0)", "code2": "\n\nimport math \n\nnum = int(input())\nfor i in range(num):\n ax,ay,ar,bx,by,br=map(float,input().split())\n d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n r1 = (ar+br)*(ar+br)\n r2 = (ar-br)*(ar-br)\n if d <= r1 and d >= r2:\n print(1);\n elif d=br:\n print(2)\n elif d < r2 and ar <= br:\n print(-2)\n else:\n print(0)\n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494901873", "date2": "1494903037", "bleu_score": "0.695960734887893", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n0.0 0.24407396280008453 5.0 0.8233993605029404 1.5542884595470625 4.0\n0.0 0.0 2.0 4.1 0.0 2.4515674947137622\n", "actual_output": "1\n0\n", "expected_output": "1\n1\n\n", "anno_code": ["\n\nimport math\n\n\nnum = int(input()) # (0): num=2\n\nfor i in range(num): # (1): i=0 (8): i=1\n ax,ay,ar,bx,by,br = map(float,input().split(' ')) # (2): ax=0.0, ay=0.244074, ar=5.0, bx=0.823399, by=1.554288, br=4.0 (9): ay=0.0, ar=2.0, bx=4.1, by=0.0, br=2.451567\n d = (ax - bx)*(ax - bx) + (ay * by) # (3): d=1.057348 (10): d=16.81\n if d < (br - ar): # (4): NO CHANGE (11): NO CHANGE\n print(2)\n if d < (ar - br): # (5): NO CHANGE (12): NO CHANGE\n print(-2)\n elif d <= (ar + br): # (6): NO CHANGE (13): NO CHANGE\n print(1) # (7): NO CHANGE\n else:\n print(0) # (14): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n-import math\n-\n+import math \n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)*(ax - bx) + (ay * by)\n- if d < (br - ar):\n- print(2)\n- if d < (ar - br):\n- print(-2)\n- elif d <= (ar + br):\n- print(1)\n+ ax,ay,ar,bx,by,br=map(float,input().split())\n+ d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n+ r1 = (ar+br)*(ar+br)\n+ r2 = (ar-br)*(ar-br)\n+ if d <= r1 and d >= r2:\n+ print(1);\n+ elif d=br:\n+ print(2)\n+ elif d < r2 and ar <= br:\n+ print(-2)\n else:\n print(0)\n+ \n", "FL_content": " \n \n-import math\n-\n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)*(ax - bx) + (ay * by)\n- if d < (br - ar):\n- print(2)\n- if d < (ar - br):\n- print(-2)\n- elif d <= (ar + br):\n- print(1)\n else:\n print(0)\n", "added_lines": 12, "removed_lines": 11, "code1_lines": 18 }, { "user_id": "u766477342", "problem_id": "p00023", "submission1_id": "s505491395", "submission2_id": "s297419016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = ra ** 2 + rb ** 2\n dr = (ra-rb) ** 2\n\n if d1 <= d2:\n if dr >= d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "code2": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = (ra + rb) ** 2\n dr = (ra-rb) ** 2\n\n if d1 <= d2:\n if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1468114507", "date2": "1468114862", "bleu_score": "0.9662276722163606", "code1_test_status": [0, 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, 1, 1, 1, 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": 101, "input": "2\n0.0 0.24407396280008453 5.0 0.8233993605029404 1.5542884595470625 4.0\n0.0 0.0 2.0 4.1 0.0 3.0061092150330126\n", "actual_output": "1\n0\n", "expected_output": "1\n1\n\n", "anno_code": ["import math\nfor i in range(int(input())): # (0): i=0 (8): i=1\n xa, ya, ra, xb, yb, rb = list(map(float, input().split())) # (1): xa=0.0, ya=0.244074, ra=5.0, xb=0.823399, yb=1.554288, rb=4.0 (9): ya=0.0, ra=2.0, xb=4.1, yb=0.0, rb=3.006109\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2 # (2): d1=2.394649 (10): d1=16.81\n d2 = ra ** 2 + rb ** 2 # (3): d2=41.0 (11): d2=13.036693\n dr = (ra-rb) ** 2 # (4): dr=1.0 (12): dr=1.012256\n\n if d1 <= d2: # (5): NO CHANGE (13): NO CHANGE\n if dr >= d1: # (6): NO CHANGE\n print(2 if ra > rb else -2)\n else:\n print(1) # (7): NO CHANGE\n else:\n print(0) # (14): NO CHANGE\n"], "anno_status": [true], "diff_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n- d2 = ra ** 2 + rb ** 2\n+ d2 = (ra + rb) ** 2\n dr = (ra-rb) ** 2\n \n if d1 <= d2:\n- if dr >= d1:\n+ if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "FL_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n- d2 = ra ** 2 + rb ** 2\n dr = (ra-rb) ** 2\n \n if d1 <= d2:\n- if dr >= d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u203261375", "problem_id": "p00023", "submission1_id": "s848168883", "submission2_id": "s189131538", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nfor _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n dist = ((xa - xb)**2 + (ya - yb)**2)**.5\n if ra + rb < dist:\n print('0')\n elif (rb < ra) and (dist < ra):\n print('2')\n elif (ra < rb) and (dist < rb):\n print('-2')\n else:\n print('1')", "code2": "n = int(input())\n\nfor _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n dist = ((xa - xb)**2 + (ya - yb)**2)**.5\n if ra + rb < dist:\n print('0')\n elif abs(ra - rb) <= dist:\n print('1')\n elif (rb < ra):\n print('2')\n elif (ra < rb):\n print('-2')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1513086754", "date2": "1513087212", "bleu_score": "0.9159926162587526", "code1_test_status": [1, 0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 101, "input": "2\n3.1147350602004042 5.306164423252864 8.532934285306728 3.394681734559696 5.199724891496771 6.328774266228958\n4.906409876074726 2.426875419198473 4.579264541699624 6.577993493319819 3.902262698935009 5.284452322696371\n", "actual_output": "2\n-2\n", "expected_output": "2\n1\n\n", "anno_code": ["n = int(input()) # (0): n=2\n\nfor _ in range(n): # (1): _=0 (7): _=1\n xa, ya, ra, xb, yb, rb = map(float, input().split()) # (2): xa=3.114735, ya=5.306164, ra=8.532934, xb=3.394682, yb=5.199725, rb=6.328774 (8): xa=4.90641, ya=2.426875, ra=4.579265, xb=6.577993, yb=3.902263, rb=5.284452\n dist = ((xa - xb)**2 + (ya - yb)**2)**.5 # (3): dist=0.299499 (9): dist=2.229565\n if ra + rb < dist: # (4): NO CHANGE (10): NO CHANGE\n print('0')\n elif (rb < ra) and (dist < ra): # (5): NO CHANGE (11): NO CHANGE\n print('2') # (6): NO CHANGE\n elif (ra < rb) and (dist < rb): # (12): NO CHANGE\n print('-2') # (13): NO CHANGE\n else:\n print('1')"], "anno_status": [true], "diff_content": " n = int(input())\n \n for _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n dist = ((xa - xb)**2 + (ya - yb)**2)**.5\n if ra + rb < dist:\n print('0')\n- elif (rb < ra) and (dist < ra):\n+ elif abs(ra - rb) <= dist:\n+ print('1')\n+ elif (rb < ra):\n print('2')\n- elif (ra < rb) and (dist < rb):\n+ elif (ra < rb):\n print('-2')\n- else:\n- print('1')\n", "FL_content": " n = int(input())\n \n for _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n dist = ((xa - xb)**2 + (ya - yb)**2)**.5\n if ra + rb < dist:\n print('0')\n- elif (rb < ra) and (dist < ra):\n print('2')\n- elif (ra < rb) and (dist < rb):\n print('-2')\n- else:\n- print('1')\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u928329738", "problem_id": "p00023", "submission1_id": "s750065104", "submission2_id": "s315627077", "status1": "Wrong Answer", "status2": "Accepted", "code1": "for i in range(int(input())):\n points = input().split()\n p = list(map(float,points))\n if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2:\n print(2)\n elif (p[0]-p[3])**2 + (p[1]-p[4])**2 < p[5]**2:\n print(-2)\n elif (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]+p[5])**2:\n print(1)\n else:\n print(0)", "code2": "n=int(input())\nfor i in range(n):\n points = input().split()\n p = list(map(float,points))\n if (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]-p[5])**2:\n if p[5]>p[2]:\n print(-2)\n else:\n print(2)\n elif (p[0]-p[3])**2 + (p[1]-p[4])**2 >= (p[2]-p[5])**2 and (p[0]-p[3])**2 + (p[1]-p[4])**2 <= (p[2]+p[5])**2:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1511852288", "date2": "1511854245", "bleu_score": "0.8055938023810415", "code1_test_status": [1, 0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 101, "input": "2\n0.0 0.24407396280008453 5.0 1.4717826557130267 1.5542884595470625 4.0\n0.9769597723465082 0.0 2.0 4.1 0.0 3.0061092150330126\n", "actual_output": "2\n1\n", "expected_output": "1\n1\n\n", "anno_code": ["for i in range(int(input())): # (0): i=0 (5): i=1\n points = input().split() # (1): points=['0.0', '0.24407396280008453', '5.0', '1.4717826557130267', '1.5542884595470625', '4.0'] (6): points=['0.9769597723465082', '0.0', '2.0', '4.1', '0.0', '3.0061092150330126']\n p = list(map(float,points)) # (2): p=[0.0, 0.24407396280008453, 5.0, 1.4717826557130267, 1.5542884595470625, 4.0] (7): p=[0.9769597723465082, 0.0, 2.0, 4.1, 0.0, 3.0061092150330126]\n if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2: # (3): NO CHANGE (8): NO CHANGE\n print(2) # (4): NO CHANGE\n elif (p[0]-p[3])**2 + (p[1]-p[4])**2 < p[5]**2: # (9): NO CHANGE\n print(-2)\n elif (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]+p[5])**2: # (10): NO CHANGE\n print(1) # (11): NO CHANGE\n else:\n print(0)"], "anno_status": [true], "diff_content": "-for i in range(int(input())):\n+n=int(input())\n+for i in range(n):\n points = input().split()\n p = list(map(float,points))\n- if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2:\n- print(2)\n- elif (p[0]-p[3])**2 + (p[1]-p[4])**2 < p[5]**2:\n- print(-2)\n- elif (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]+p[5])**2:\n+ if (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]-p[5])**2:\n+ if p[5]>p[2]:\n+ print(-2)\n+ else:\n+ print(2)\n+ elif (p[0]-p[3])**2 + (p[1]-p[4])**2 >= (p[2]-p[5])**2 and (p[0]-p[3])**2 + (p[1]-p[4])**2 <= (p[2]+p[5])**2:\n print(1)\n else:\n print(0)\n", "FL_content": "-for i in range(int(input())):\n points = input().split()\n p = list(map(float,points))\n- if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2:\n- print(2)\n- elif (p[0]-p[3])**2 + (p[1]-p[4])**2 < p[5]**2:\n- print(-2)\n- elif (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]+p[5])**2:\n print(1)\n else:\n print(0)\n", "added_lines": 8, "removed_lines": 6, "code1_lines": 11 }, { "user_id": "u766477342", "problem_id": "p00023", "submission1_id": "s040795031", "submission2_id": "s297419016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = ra ** 2 + rb ** 2\n dr = (ra-rb) ** 2\n\n if d1 <= d2:\n if d2 > d1 > dr:\n print(1)\n elif dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "code2": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = (ra + rb) ** 2\n dr = (ra-rb) ** 2\n\n if d1 <= d2:\n if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1468017939", "date2": "1468114862", "bleu_score": "0.8438920007624204", "code1_test_status": [0, 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, 1, 1, 1, 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": 101, "input": "2\n0.0 0.24407396280008453 5.0 0.8233993605029404 1.5542884595470625 4.0\n0.0 0.0 2.0 4.1 0.0 3.0061092150330126\n", "actual_output": "1\n0\n", "expected_output": "1\n1\n\n", "anno_code": ["import math\nfor i in range(int(input())): # (0): i=0 (8): i=1\n xa, ya, ra, xb, yb, rb = list(map(float, input().split())) # (1): xa=0.0, ya=0.244074, ra=5.0, xb=0.823399, yb=1.554288, rb=4.0 (9): ya=0.0, ra=2.0, xb=4.1, yb=0.0, rb=3.006109\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2 # (2): d1=2.394649 (10): d1=16.81\n d2 = ra ** 2 + rb ** 2 # (3): d2=41.0 (11): d2=13.036693\n dr = (ra-rb) ** 2 # (4): dr=1.0 (12): dr=1.012256\n\n if d1 <= d2: # (5): NO CHANGE (13): NO CHANGE\n if d2 > d1 > dr: # (6): NO CHANGE\n print(1) # (7): NO CHANGE\n elif dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0) # (14): NO CHANGE\n"], "anno_status": [true], "diff_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n- d2 = ra ** 2 + rb ** 2\n+ d2 = (ra + rb) ** 2\n dr = (ra-rb) ** 2\n \n if d1 <= d2:\n- if d2 > d1 > dr:\n- print(1)\n- elif dr > d1:\n+ if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "FL_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n- d2 = ra ** 2 + rb ** 2\n dr = (ra-rb) ** 2\n \n if d1 <= d2:\n- if d2 > d1 > dr:\n- print(1)\n- elif dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 17 }, { "user_id": "u766477342", "problem_id": "p00023", "submission1_id": "s695408269", "submission2_id": "s297419016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2)\n d2 = math.fabs(ra + rb)\n\n if d1 <= d2:\n if d1 <= ra or d1 <= rb:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "code2": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = (ra + rb) ** 2\n dr = (ra-rb) ** 2\n\n if d1 <= d2:\n if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1467848041", "date2": "1468114862", "bleu_score": "0.8787120769847133", "code1_test_status": [1, 0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 101, "input": "2\n0.0 1.1804991696233216 5.97720052787132 2.014536612537453 1.81180019862589 4.634115446683061\n0.9769597723465082 0.39921226227011497 2.0 4.456171562511242 0.7358711718147521 3.0061092150330126\n", "actual_output": "2\n1\n", "expected_output": "1\n1\n\n", "anno_code": ["import math\nfor i in range(int(input())): # (0): i=0 (7): i=1\n xa, ya, ra, xb, yb, rb = list(map(float, input().split())) # (1): xa=0.0, ya=1.180499, ra=5.977201, xb=2.014537, yb=1.8118, rb=4.634115 (8): xa=0.97696, ya=0.399212, ra=2.0, xb=4.456172, yb=0.735871, rb=3.006109\n\n d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2) # (2): d1=2.111137 (9): d1=3.495462\n d2 = math.fabs(ra + rb) # (3): d2=10.611316 (10): d2=5.006109\n\n if d1 <= d2: # (4): NO CHANGE (11): NO CHANGE\n if d1 <= ra or d1 <= rb: # (5): NO CHANGE (12): NO CHANGE\n print(2 if ra > rb else -2) # (6): NO CHANGE\n else:\n print(1) # (13): NO CHANGE\n else:\n print(0)"], "anno_status": [true], "diff_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n- d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2)\n- d2 = math.fabs(ra + rb)\n+ d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n+ d2 = (ra + rb) ** 2\n+ dr = (ra-rb) ** 2\n \n if d1 <= d2:\n- if d1 <= ra or d1 <= rb:\n+ if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "FL_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n- d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2)\n- d2 = math.fabs(ra + rb)\n \n if d1 <= d2:\n- if d1 <= ra or d1 <= rb:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u618637847", "problem_id": "p00023", "submission1_id": "s247145139", "submission2_id": "s853368534", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport math\n\n\nnum = int(input())\n\nfor i in range(num):\n ax,ay,ar,bx,by,br = map(float,input().split(' '))\n d = (ax - bx)*(ax - bx) + (ay * by)\n if d < abs(br - ar):\n if ar > br:\n print(2)\n else:\n print(-2)\n elif d <= ar + br:\n print(1)\n else:\n print(0)", "code2": "\n\nimport math \n\nnum = int(input())\nfor i in range(num):\n ax,ay,ar,bx,by,br=map(float,input().split())\n d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n r1 = (ar+br)*(ar+br)\n r2 = (ar-br)*(ar-br)\n if d <= r1 and d >= r2:\n print(1);\n elif d=br:\n print(2)\n elif d < r2 and ar <= br:\n print(-2)\n else:\n print(0)\n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494902288", "date2": "1494903037", "bleu_score": "0.7017504681904437", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 101, "input": "2\n3.1147350602004042 4.968769205602394 8.532934285306728 3.394681734559696 4.777899923453189 6.328774266228958\n4.208439027280414 2.426875419198473 4.579264541699624 6.525780948382415 3.552118764754478 5.284452322696371\n", "actual_output": "0\n0\n", "expected_output": "2\n1\n\n", "anno_code": ["\n\nimport math\n\n\nnum = int(input()) # (0): num=2\n\nfor i in range(num): # (1): i=0 (7): i=1\n ax,ay,ar,bx,by,br = map(float,input().split(' ')) # (2): ax=3.114735, ay=4.968769, ar=8.532934, bx=3.394682, by=4.7779, br=6.328774 (8): ax=4.208439, ay=2.426875, ar=4.579265, bx=6.525781, by=3.552119, br=5.284452\n d = (ax - bx)*(ax - bx) + (ay * by) # (3): d=23.818652 (9): d=13.990623\n if d < abs(br - ar): # (4): NO CHANGE (10): NO CHANGE\n if ar > br:\n print(2)\n else:\n print(-2)\n elif d <= ar + br: # (5): NO CHANGE (11): NO CHANGE\n print(1)\n else:\n print(0) # (6): NO CHANGE (12): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n-import math\n-\n+import math \n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)*(ax - bx) + (ay * by)\n- if d < abs(br - ar):\n- if ar > br:\n- print(2)\n- else:\n- print(-2)\n- elif d <= ar + br:\n- print(1)\n+ ax,ay,ar,bx,by,br=map(float,input().split())\n+ d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n+ r1 = (ar+br)*(ar+br)\n+ r2 = (ar-br)*(ar-br)\n+ if d <= r1 and d >= r2:\n+ print(1);\n+ elif d=br:\n+ print(2)\n+ elif d < r2 and ar <= br:\n+ print(-2)\n else:\n print(0)\n+ \n", "FL_content": " \n \n-import math\n-\n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)*(ax - bx) + (ay * by)\n- if d < abs(br - ar):\n- if ar > br:\n- print(2)\n- else:\n- print(-2)\n- elif d <= ar + br:\n- print(1)\n else:\n print(0)\n", "added_lines": 12, "removed_lines": 12, "code1_lines": 19 }, { "user_id": "u766477342", "problem_id": "p00023", "submission1_id": "s594644708", "submission2_id": "s297419016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2)\n d2 = math.fabs(ra + rb)\n\n if d1 <= d2:\n if d1 < ra or d1 < rb:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "code2": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = (ra + rb) ** 2\n dr = (ra-rb) ** 2\n\n if d1 <= d2:\n if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1467848125", "date2": "1468114862", "bleu_score": "0.8825817927640262", "code1_test_status": [1, 0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 101, "input": "2\n1.3018830993798196 1.1804991696233216 5.97720052787132 2.1321559253491804 2.072303142011048 4.898405435743801\n1.6154186783950772 0.39921226227011497 2.512872370263131 5.273208013897418 2.169775861927481 3.924014997809771\n", "actual_output": "2\n1\n", "expected_output": "1\n1\n\n", "anno_code": ["import math\nfor i in range(int(input())): # (0): i=0 (7): i=1\n xa, ya, ra, xb, yb, rb = list(map(float, input().split())) # (1): xa=1.301883, ya=1.180499, ra=5.977201, xb=2.132156, yb=2.072303, rb=4.898405 (8): xa=1.615419, ya=0.399212, ra=2.512872, xb=5.273208, yb=2.169776, rb=3.924015\n\n d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2) # (2): d1=1.218469 (9): d1=4.063781\n d2 = math.fabs(ra + rb) # (3): d2=10.875606 (10): d2=6.436887\n\n if d1 <= d2: # (4): NO CHANGE (11): NO CHANGE\n if d1 < ra or d1 < rb: # (5): NO CHANGE (12): NO CHANGE\n print(2 if ra > rb else -2) # (6): NO CHANGE\n else:\n print(1) # (13): NO CHANGE\n else:\n print(0)"], "anno_status": [true], "diff_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n- d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2)\n- d2 = math.fabs(ra + rb)\n+ d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n+ d2 = (ra + rb) ** 2\n+ dr = (ra-rb) ** 2\n \n if d1 <= d2:\n- if d1 < ra or d1 < rb:\n+ if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "FL_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n- d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2)\n- d2 = math.fabs(ra + rb)\n \n if d1 <= d2:\n- if d1 < ra or d1 < rb:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u766477342", "problem_id": "p00023", "submission1_id": "s028676556", "submission2_id": "s297419016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = ra ** 2 + rb ** 2\n dr = ra ** 2 - rb ** 2\n\n if d1 <= d2:\n if math.fabs(dr) > math.fabs(d1):\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "code2": "import math\nfor i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n d2 = (ra + rb) ** 2\n dr = (ra-rb) ** 2\n\n if d1 <= d2:\n if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1468016447", "date2": "1468114862", "bleu_score": "0.8666165897194028", "code1_test_status": [0, 0, 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, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 33, "total_score": 101, "input": "2\n0.811277241404971 1.1804991696233216 5.97720052787132 2.1321559253491804 1.81180019862589 4.898405435743801\n1.5169042667075785 0.39921226227011497 2.512872370263131 4.456171562511242 2.169775861927481 3.924014997809771\n", "actual_output": "2\n1\n", "expected_output": "1\n1\n\n", "anno_code": ["import math\nfor i in range(int(input())): # (0): i=0 (8): i=1\n xa, ya, ra, xb, yb, rb = list(map(float, input().split())) # (1): xa=0.811277, ya=1.180499, ra=5.977201, xb=2.132156, yb=1.8118, rb=4.898405 (9): xa=1.516904, ya=0.399212, ra=2.512872, xb=4.456172, yb=2.169776, rb=3.924015\n\n d1 = (xa - xb) ** 2 + (ya - yb) ** 2 # (2): d1=2.143261 (10): d1=11.774188\n d2 = ra ** 2 + rb ** 2 # (3): d2=59.721302 (11): d2=21.712421\n dr = ra ** 2 - rb ** 2 # (4): dr=11.73255 (12): dr=-9.083366\n\n if d1 <= d2: # (5): NO CHANGE (13): NO CHANGE\n if math.fabs(dr) > math.fabs(d1): # (6): NO CHANGE (14): NO CHANGE\n print(2 if ra > rb else -2) # (7): NO CHANGE\n else:\n print(1) # (15): NO CHANGE\n else:\n print(0)"], "anno_status": [true], "diff_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n- d2 = ra ** 2 + rb ** 2\n- dr = ra ** 2 - rb ** 2\n+ d2 = (ra + rb) ** 2\n+ dr = (ra-rb) ** 2\n \n if d1 <= d2:\n- if math.fabs(dr) > math.fabs(d1):\n+ if dr > d1:\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "FL_content": " import math\n for i in range(int(input())):\n xa, ya, ra, xb, yb, rb = list(map(float, input().split()))\n \n d1 = (xa - xb) ** 2 + (ya - yb) ** 2\n- d2 = ra ** 2 + rb ** 2\n- dr = ra ** 2 - rb ** 2\n \n if d1 <= d2:\n- if math.fabs(dr) > math.fabs(d1):\n print(2 if ra > rb else -2)\n else:\n print(1)\n else:\n print(0)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 15 }, { "user_id": "u905313459", "problem_id": "p00023", "submission1_id": "s286489685", "submission2_id": "s284343006", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\nfor i in range(int(n)):\n xa, ya, ra, xb, rb, yb = list(map(float, input().split(\" \")))\n d = abs(complex(xb-xa, yb-ya))\n if ra + rb < d:\n print(\"0\")\n elif abs(rb-ra) <= d <= ra+rb:\n print(\"1\")\n elif d < abs(ra-rb):\n print(\"2\" if ra > rb else \"-2\")", "code2": "n = int(input())\nfor i in range(n):\n k = input()\n xa, ya, ra, xb, yb, rb = list(map(float, k.split(\" \")))\n d = abs(complex(xb-xa, yb-ya))\n if ra + rb < d:\n print(\"0\")\n elif abs(rb-ra) <= d <= ra+rb:\n print(\"1\")\n else:\n print(\"2\" if ra > rb else \"-2\")", "original_language1": "Python3", "original_language2": "Python3", "date1": "1496463951", "date2": "1496464194", "bleu_score": "0.9145701594519784", "code1_test_status": [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 101, "input": "2\n0.1862002303347462 1.1804991696233216 5.97720052787132 2.014536612537453 1.81180019862589 4.634115446683061\n1.2609752971649137 0.39921226227011497 2.0 4.456171562511242 0.7358711718147521 3.0061092150330126\n", "actual_output": "2\n0\n", "expected_output": "1\n1\n\n", "anno_code": ["n = input() # (0): n=2\nfor i in range(int(n)): # (1): i=0 (8): i=1\n xa, ya, ra, xb, rb, yb = list(map(float, input().split(\" \"))) # (2): xa=0.1862, ya=1.180499, ra=5.977201, xb=2.014537, rb=1.8118, yb=4.634115 (9): xa=1.260975, ya=0.399212, ra=2.0, xb=4.456172, rb=0.735871, yb=3.006109\n d = abs(complex(xb-xa, yb-ya)) # (3): d=3.90772 (10): d=4.123735\n if ra + rb < d: # (4): NO CHANGE (11): NO CHANGE\n print(\"0\") # (12): NO CHANGE\n elif abs(rb-ra) <= d <= ra+rb: # (5): NO CHANGE\n print(\"1\")\n elif d < abs(ra-rb): # (6): NO CHANGE\n print(\"2\" if ra > rb else \"-2\") # (7): NO CHANGE\n"], "anno_status": [true], "diff_content": "-n = input()\n-for i in range(int(n)):\n- xa, ya, ra, xb, rb, yb = list(map(float, input().split(\" \")))\n+n = int(input())\n+for i in range(n):\n+ k = input()\n+ xa, ya, ra, xb, yb, rb = list(map(float, k.split(\" \")))\n d = abs(complex(xb-xa, yb-ya))\n if ra + rb < d:\n print(\"0\")\n elif abs(rb-ra) <= d <= ra+rb:\n print(\"1\")\n- elif d < abs(ra-rb):\n+ else:\n print(\"2\" if ra > rb else \"-2\")\n", "FL_content": "-n = input()\n-for i in range(int(n)):\n- xa, ya, ra, xb, rb, yb = list(map(float, input().split(\" \")))\n d = abs(complex(xb-xa, yb-ya))\n if ra + rb < d:\n print(\"0\")\n elif abs(rb-ra) <= d <= ra+rb:\n print(\"1\")\n- elif d < abs(ra-rb):\n print(\"2\" if ra > rb else \"-2\")\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 10 }, { "user_id": "u379956761", "problem_id": "p00023", "submission1_id": "s054307587", "submission2_id": "s014955441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\n\nn = int(input())\n\nfor _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n\n distance = math.sqrt(abs(xa-xb)**2 + abs(ya-yb)**2)\n if distance < ra + rb:\n if (ra < rb and distance < ra) or (ra > rb and distance < rb):\n print(\"2\")\n else:\n print(\"1\")\n else:\n print(\"0\")", "code2": "import sys\nimport math\n\nn = int(input())\n\nfor _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n\n distance = math.sqrt((xa-xb)**2 + (ya-yb)**2)\n if ra + rb >= distance:\n if (distance + ra < rb):\n print(-2)\n elif (distance + rb < ra):\n print(2)\n else:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1434989278", "date2": "1435071783", "bleu_score": "0.8378182854455347", "code1_test_status": [1, 0, 1, 0, 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, 0, 0, 0, 1, 1, 0, 0, 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, 0, 0, 0, 0, 0, 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": 19, "total_score": 101, "input": "2\n2.768549403858919 3.104014127818376 8.346090594022616 3.394681734559696 4.777899923453189 6.328774266228958\n3.6249592462761786 1.4833368850878772 3.8255604638057257 5.666886669242947 3.552118764754478 5.216151553201928\n", "actual_output": "2\n2\n", "expected_output": "2\n1\n\n", "anno_code": ["import sys\nimport math\n\nn = int(input()) # (0): n=2\n\nfor _ in range(n): # (1): _=0 (7): _=1\n xa, ya, ra, xb, yb, rb = map(float, input().split()) # (2): xa=2.768549, ya=3.104014, ra=8.346091, xb=3.394682, yb=4.7779, rb=6.328774 (8): xa=3.624959, ya=1.483337, ra=3.82556, xb=5.666887, yb=3.552119, rb=5.216152\n\n distance = math.sqrt(abs(xa-xb)**2 + abs(ya-yb)**2) # (3): distance=1.787158 (9): distance=2.906772\n if distance < ra + rb: # (4): NO CHANGE (10): NO CHANGE\n if (ra < rb and distance < ra) or (ra > rb and distance < rb): # (5): NO CHANGE (11): NO CHANGE\n print(\"2\") # (6): NO CHANGE (12): NO CHANGE\n else:\n print(\"1\")\n else:\n print(\"0\")"], "anno_status": [true], "diff_content": " import sys\n import math\n \n n = int(input())\n \n for _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n \n- distance = math.sqrt(abs(xa-xb)**2 + abs(ya-yb)**2)\n- if distance < ra + rb:\n- if (ra < rb and distance < ra) or (ra > rb and distance < rb):\n- print(\"2\")\n+ distance = math.sqrt((xa-xb)**2 + (ya-yb)**2)\n+ if ra + rb >= distance:\n+ if (distance + ra < rb):\n+ print(-2)\n+ elif (distance + rb < ra):\n+ print(2)\n else:\n- print(\"1\")\n+ print(1)\n else:\n- print(\"0\")\n+ print(0)\n", "FL_content": " import sys\n import math\n \n n = int(input())\n \n for _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n \n- distance = math.sqrt(abs(xa-xb)**2 + abs(ya-yb)**2)\n- if distance < ra + rb:\n- if (ra < rb and distance < ra) or (ra > rb and distance < rb):\n- print(\"2\")\n else:\n- print(\"1\")\n else:\n- print(\"0\")\n", "added_lines": 8, "removed_lines": 6, "code1_lines": 16 }, { "user_id": "u379956761", "problem_id": "p00023", "submission1_id": "s999323619", "submission2_id": "s014955441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\n\nn = int(input())\n\nfor _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n\n distance = math.sqrt((xa-xb)**2 + (ya-yb)**2)\n if ra + rb < distance:\n if (ra < rb and distance + ra < rb):\n print(-2)\n elif (rb < ra and distance + rb < ra):\n print(2)\n else:\n print(1)\n else:\n print(0)", "code2": "import sys\nimport math\n\nn = int(input())\n\nfor _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n\n distance = math.sqrt((xa-xb)**2 + (ya-yb)**2)\n if ra + rb >= distance:\n if (distance + ra < rb):\n print(-2)\n elif (distance + rb < ra):\n print(2)\n else:\n print(1)\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1435071475", "date2": "1435071783", "bleu_score": "0.9228873504121101", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n3.1147350602004042 3.104014127818376 8.346090594022616 3.394681734559696 4.777899923453189 6.328774266228958\n3.6249592462761786 1.4833368850878772 3.8255604638057257 5.666886669242947 3.552118764754478 5.216151553201928\n", "actual_output": "0\n0\n", "expected_output": "2\n1\n\n", "anno_code": ["import sys\nimport math\n\nn = int(input()) # (0): n=2\n\nfor _ in range(n): # (1): _=0 (6): _=1\n xa, ya, ra, xb, yb, rb = map(float, input().split()) # (2): xa=3.114735, ya=3.104014, ra=8.346091, xb=3.394682, yb=4.7779, rb=6.328774 (7): xa=3.624959, ya=1.483337, ra=3.82556, xb=5.666887, yb=3.552119, rb=5.216152\n\n distance = math.sqrt((xa-xb)**2 + (ya-yb)**2) # (3): distance=1.697134 (8): distance=2.906772\n if ra + rb < distance: # (4): NO CHANGE (9): NO CHANGE\n if (ra < rb and distance + ra < rb):\n print(-2)\n elif (rb < ra and distance + rb < ra):\n print(2)\n else:\n print(1)\n else:\n print(0) # (5): NO CHANGE (10): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n import math\n \n n = int(input())\n \n for _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n \n distance = math.sqrt((xa-xb)**2 + (ya-yb)**2)\n- if ra + rb < distance:\n- if (ra < rb and distance + ra < rb):\n+ if ra + rb >= distance:\n+ if (distance + ra < rb):\n print(-2)\n- elif (rb < ra and distance + rb < ra):\n+ elif (distance + rb < ra):\n print(2)\n else:\n print(1)\n else:\n print(0)\n", "FL_content": " import sys\n import math\n \n n = int(input())\n \n for _ in range(n):\n xa, ya, ra, xb, yb, rb = map(float, input().split())\n \n distance = math.sqrt((xa-xb)**2 + (ya-yb)**2)\n- if ra + rb < distance:\n- if (ra < rb and distance + ra < rb):\n print(-2)\n- elif (rb < ra and distance + rb < ra):\n print(2)\n else:\n print(1)\n else:\n print(0)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u618637847", "problem_id": "p00023", "submission1_id": "s571426162", "submission2_id": "s853368534", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport math\n\n\nnum = int(input())\n\nfor i in range(num):\n ax,ay,ar,bx,by,br = map(float,input().split(' '))\n d = (ax - bx)**2 + (ay * by)**2\n if d < abs(br - ar):\n if ar > br:\n print(2)\n else:\n print(-2)\n elif d <= ar + br:\n print(1)\n else:\n print(0)", "code2": "\n\nimport math \n\nnum = int(input())\nfor i in range(num):\n ax,ay,ar,bx,by,br=map(float,input().split())\n d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n r1 = (ar+br)*(ar+br)\n r2 = (ar-br)*(ar-br)\n if d <= r1 and d >= r2:\n print(1);\n elif d=br:\n print(2)\n elif d < r2 and ar <= br:\n print(-2)\n else:\n print(0)\n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494902392", "date2": "1494903037", "bleu_score": "0.6937635201724119", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 101, "input": "2\n0.0 0.24407396280008453 5.0 0.8233993605029404 1.5542884595470625 4.0\n0.0 0.0 2.0 4.1 0.0 3.0061092150330126\n", "actual_output": "2\n0\n", "expected_output": "1\n1\n\n", "anno_code": ["\n\nimport math\n\n\nnum = int(input()) # (0): num=2\n\nfor i in range(num): # (1): i=0 (7): i=1\n ax,ay,ar,bx,by,br = map(float,input().split(' ')) # (2): ax=0.0, ay=0.244074, ar=5.0, bx=0.823399, by=1.554288, br=4.0 (8): ay=0.0, ar=2.0, bx=4.1, by=0.0, br=3.006109\n d = (ax - bx)**2 + (ay * by)**2 # (3): d=0.821902 (9): d=16.81\n if d < abs(br - ar): # (4): NO CHANGE (10): NO CHANGE\n if ar > br: # (5): NO CHANGE\n print(2) # (6): NO CHANGE\n else:\n print(-2)\n elif d <= ar + br: # (11): NO CHANGE\n print(1)\n else:\n print(0) # (12): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n-import math\n-\n+import math \n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)**2 + (ay * by)**2\n- if d < abs(br - ar):\n- if ar > br:\n- print(2)\n- else:\n- print(-2)\n- elif d <= ar + br:\n- print(1)\n+ ax,ay,ar,bx,by,br=map(float,input().split())\n+ d = ((ax-bx)* (ax - bx))+((ay-by)*(ay-by))\n+ r1 = (ar+br)*(ar+br)\n+ r2 = (ar-br)*(ar-br)\n+ if d <= r1 and d >= r2:\n+ print(1);\n+ elif d=br:\n+ print(2)\n+ elif d < r2 and ar <= br:\n+ print(-2)\n else:\n print(0)\n+ \n", "FL_content": " \n \n-import math\n-\n \n num = int(input())\n-\n for i in range(num):\n- ax,ay,ar,bx,by,br = map(float,input().split(' '))\n- d = (ax - bx)**2 + (ay * by)**2\n- if d < abs(br - ar):\n- if ar > br:\n- print(2)\n- else:\n- print(-2)\n- elif d <= ar + br:\n- print(1)\n else:\n print(0)\n", "added_lines": 12, "removed_lines": 12, "code1_lines": 19 }, { "user_id": "u600319862", "problem_id": "p03036", "submission1_id": "s337689794", "submission2_id": "s937493083", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int,input().split())\ndef fib(n):\n if n == 0:\n return c\n else:\n return 2 * fib(n-1) -10\n \nfor i in range(10):\n print(fib(i+1))", "code2": "a,b,c = map(int,input().split())\ndef fib(n):\n if n == 0:\n return c\n else:\n return a * fib(n-1) -b\n \nfor i in range(10):\n print(fib(i+1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561478922", "date2": "1561479014", "bleu_score": "0.9585596601658813", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 65, "input": "2 -2 1\n", "actual_output": "-8\n-26\n-62\n-134\n-278\n-566\n-1142\n-2294\n-4598\n-9206\n", "expected_output": "4\n10\n22\n46\n94\n190\n382\n766\n1534\n3070\n\n", "anno_code": ["a,b,c = map(int,input().split()) # (0): a=2, b=-2, c=1\ndef fib(n): # (1): fib=\n if n == 0: # (4): n=0 (5): a=2, b=-2, c=1, fib=, i=0 ... (86): a=2, b=-2, c=1, fib=, i=9\n return c\n else:\n return 2 * fib(n-1) -10\n \nfor i in range(10): # (2): i=0 (6): i=1 ... (74): i=9\n print(fib(i+1)) # (3): n=1 (7): n=2 ... (75): n=10\n"], "anno_status": [true], "diff_content": " a,b,c = map(int,input().split())\n def fib(n):\n if n == 0:\n return c\n else:\n- return 2 * fib(n-1) -10\n+ return a * fib(n-1) -b\n \n for i in range(10):\n print(fib(i+1))\n", "FL_content": " a,b,c = map(int,input().split())\n def fib(n):\n if n == 0:\n return c\n else:\n- return 2 * fib(n-1) -10\n \n for i in range(10):\n print(fib(i+1))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u799428010", "problem_id": "p03036", "submission1_id": "s833148003", "submission2_id": "s782983055", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,d,x=map(int, input().split())\nans=x\nfor i in range(1,10):\n ans=r*ans-d\n print(ans)", "code2": "r,d,x=map(int, input().split())\nans=x\nfor i in range(1,11):\n ans=r*ans-d\n print(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596055076", "date2": "1596055130", "bleu_score": "0.971500344915838", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "4 0 -7\n", "actual_output": "-28\n-112\n-448\n-1792\n-7168\n-28672\n-114688\n-458752\n-1835008\n", "expected_output": "-28\n-112\n-448\n-1792\n-7168\n-28672\n-114688\n-458752\n-1835008\n-7340032\n\n", "anno_code": ["r,d,x=map(int, input().split()) # (0): r=4, d=0, x=-7\nans=x # (1): ans=-7\nfor i in range(1,10): # (2): i=1 (5): i=2 ... (26): i=9\n ans=r*ans-d # (3): ans=-28 (6): ans=-112 ... (27): ans=-1835008\n print(ans) # (4): NO CHANGE (7): NO CHANGE ... (28): NO CHANGE\n"], "anno_status": [true], "diff_content": " r,d,x=map(int, input().split())\n ans=x\n-for i in range(1,10):\n+for i in range(1,11):\n ans=r*ans-d\n print(ans)\n", "FL_content": " r,d,x=map(int, input().split())\n ans=x\n-for i in range(1,10):\n ans=r*ans-d\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u687053495", "problem_id": "p03036", "submission1_id": "s391082629", "submission2_id": "s489187918", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, d, x = map(int, input().split())\n\nfor i in range(x):\n x = r * x - d\n if i >= 10:\n break \n print(x)", "code2": "r, d, x = map(int, input().split())\n\nfor i in range(10):\n x = r * x - d\n print(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568476544", "date2": "1568476694", "bleu_score": "0.7144991038020918", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 19, "total_score": 65, "input": "8 10 -1\n", "actual_output": "no output\n", "expected_output": "-18\n-154\n-1242\n-9946\n-79578\n-636634\n-5093082\n-40744666\n-325957338\n-2607658714\n\n", "anno_code": ["r, d, x = map(int, input().split()) # (0): r=8, d=10, x=-1\n\nfor i in range(x):\n x = r * x - d\n if i >= 10:\n break \n print(x)"], "anno_status": [true], "diff_content": " r, d, x = map(int, input().split())\n \n-for i in range(x):\n+for i in range(10):\n x = r * x - d\n- if i >= 10:\n- break \n print(x)\n", "FL_content": " r, d, x = map(int, input().split())\n \n-for i in range(x):\n x = r * x - d\n- if i >= 10:\n- break \n print(x)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u691238759", "problem_id": "p03036", "submission1_id": "s696618979", "submission2_id": "s103749906", "status1": "Wrong Answer", "status2": "Accepted", "code1": "INPUT = input().split()\nr = int(INPUT[0])\nD = int(INPUT[1])\nX = int(INPUT[2])\n\nXX = []\n\nans = \"\"\nXX.append(X)\n\ni = 0\nwhile i <= 10:\n v = r * XX[i] - D\n XX.append(v)\n ans = ans + str(XX[i + 1]) + '\\n'\n i += 1\n\nprint(ans)", "code2": "INPUT = input().split()\nr = int(INPUT[0])\nD = int(INPUT[1])\nX = int(INPUT[2])\n\nXX = []\n\nans = \"\"\nXX.append(X)\n\ni = 0\nwhile i < 10:\n v = r * XX[i] - D\n XX.append(v)\n ans = ans + str(XX[i + 1]) + '\\n'\n i += 1\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558927430", "date2": "1558927484", "bleu_score": "0.9890893886679992", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "1 1 36\n", "actual_output": "35\n34\n33\n32\n31\n30\n29\n28\n27\n26\n25\n\n", "expected_output": "35\n34\n33\n32\n31\n30\n29\n28\n27\n26\n\n", "anno_code": ["INPUT = input().split() # (0): INPUT=['1', '1', '36']\nr = int(INPUT[0]) # (1): r=1\nD = int(INPUT[1]) # (2): D=1\nX = int(INPUT[2]) # (3): X=36\n\nXX = [] # (4): XX=[]\n\nans = \"\" # (5): ans=\nXX.append(X) # (6): XX=[36]\n\ni = 0 # (7): i=0\nwhile i <= 10: # (8): NO CHANGE (13): NO CHANGE ... (63): NO CHANGE\n v = r * XX[i] - D # (9): v=35 (14): v=34 ... (59): v=25\n XX.append(v) # (10): XX=[36, 35] (15): XX=[36, 35, 34] ... (60): XX=[36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25]\n ans = ans + str(XX[i + 1]) + '\\n' # (11): ans=35 (16): ans=35 34 ... (61): ans=35 34 33 32 31 30 29 28 27 26 25 \n i += 1 # (12): i=1 (17): i=2 ... (62): i=11\n\nprint(ans)"], "anno_status": [true], "diff_content": " INPUT = input().split()\n r = int(INPUT[0])\n D = int(INPUT[1])\n X = int(INPUT[2])\n \n XX = []\n \n ans = \"\"\n XX.append(X)\n \n i = 0\n-while i <= 10:\n+while i < 10:\n v = r * XX[i] - D\n XX.append(v)\n ans = ans + str(XX[i + 1]) + '\\n'\n i += 1\n \n print(ans)\n", "FL_content": " INPUT = input().split()\n r = int(INPUT[0])\n D = int(INPUT[1])\n X = int(INPUT[2])\n \n XX = []\n \n ans = \"\"\n XX.append(X)\n \n i = 0\n-while i <= 10:\n v = r * XX[i] - D\n XX.append(v)\n ans = ans + str(XX[i + 1]) + '\\n'\n i += 1\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u373723818", "problem_id": "p03036", "submission1_id": "s000581732", "submission2_id": "s462403967", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, D, x_2000= map(int, input().split(' '))\nxs = [x_2000]\nfor x in range(10):\n\txs.append(r*xs[len(xs)-1]-D)\nprint('\\n'.join(map(str, xs)))", "code2": "r, D, x_2000= map(int, input().split(' '))\nxs = [x_2000]\nfor x in range(10):\n\txs.append(r*xs[len(xs)-1]-D)\nxs.pop(0)\nprint('\\n'.join(map(str, xs)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558879182", "date2": "1558879345", "bleu_score": "0.9295249469583026", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "3 1 -8\n", "actual_output": "-8\n-25\n-76\n-229\n-688\n-2065\n-6196\n-18589\n-55768\n-167305\n-501916\n", "expected_output": "-25\n-76\n-229\n-688\n-2065\n-6196\n-18589\n-55768\n-167305\n-501916\n\n", "anno_code": ["r, D, x_2000= map(int, input().split(' ')) # (0): r=3, D=1, x_2000=-8\nxs = [x_2000] # (1): xs=[-8]\nfor x in range(10): # (2): x=0 (4): x=1 ... (22): NO CHANGE\n\txs.append(r*xs[len(xs)-1]-D) # (3): xs=[-8, -25] (5): xs=[-8, -25, -76] ... (21): xs=[-8, -25, -76, -229, -688, -2065, -6196, -18589, -55768, -167305, -501916]\nprint('\\n'.join(map(str, xs)))"], "anno_status": [true], "diff_content": " r, D, x_2000= map(int, input().split(' '))\n xs = [x_2000]\n for x in range(10):\n \txs.append(r*xs[len(xs)-1]-D)\n+xs.pop(0)\n print('\\n'.join(map(str, xs)))\n", "FL_content": " r, D, x_2000= map(int, input().split(' '))\n xs = [x_2000]\n for x in range(10):\n \txs.append(r*xs[len(xs)-1]-D)\n print('\\n'.join(map(str, xs)))\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u231530807", "problem_id": "p03036", "submission1_id": "s332147599", "submission2_id": "s336217077", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x=input()\nxx=x.split()\nr=int(xx[0])\nx2=int(xx[1])\nD=int(xx[2])\ny=[0]*10\nfor i in range(10):\n y[i]+=r*x2-D\n print(y[i])\n x2=y[i]", "code2": "x=input()\nxx=x.split()\nr=int(xx[0])\nD=int(xx[1])\nx2=int(xx[2])\ny=[0]*10\nfor i in range(10):\n y[i]+=r*x2-D\n print(y[i])\n x2=y[i]", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558833259", "date2": "1558833381", "bleu_score": "1.0", "code1_test_status": [0, 0, 0, 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], "code1_test_score": 2, "total_score": 65, "input": "6 -4 -1\n", "actual_output": "-23\n-137\n-821\n-4925\n-29549\n-177293\n-1063757\n-6382541\n-38295245\n-229771469\n", "expected_output": "-2\n-8\n-44\n-260\n-1556\n-9332\n-55988\n-335924\n-2015540\n-12093236\n\n", "anno_code": ["x=input() # (0): x=6 -4 -1\nxx=x.split() # (1): xx=['6', '-4', '-1']\nr=int(xx[0]) # (2): r=6\nx2=int(xx[1]) # (3): x2=-4\nD=int(xx[2]) # (4): D=-1\ny=[0]*10 # (5): y=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(10): # (6): i=0 (10): i=1 ... (42): i=9\n y[i]+=r*x2-D # (7): y=[-23, 0, 0, 0, 0, 0, 0, 0, 0, 0] (11): y=[-23, -137, 0, 0, 0, 0, 0, 0, 0, 0] ... (43): y=[-23, -137, -821, -4925, -29549, -177293, -1063757, -6382541, -38295245, -229771469]\n print(y[i]) # (8): NO CHANGE (12): NO CHANGE ... (44): NO CHANGE\n x2=y[i] # (9): x2=-23 (13): x2=-137 ... (45): x2=-229771469\n"], "anno_status": [true], "diff_content": " x=input()\n xx=x.split()\n r=int(xx[0])\n-x2=int(xx[1])\n-D=int(xx[2])\n+D=int(xx[1])\n+x2=int(xx[2])\n y=[0]*10\n for i in range(10):\n y[i]+=r*x2-D\n print(y[i])\n x2=y[i]\n", "FL_content": " x=input()\n xx=x.split()\n r=int(xx[0])\n-x2=int(xx[1])\n-D=int(xx[2])\n y=[0]*10\n for i in range(10):\n y[i]+=r*x2-D\n print(y[i])\n x2=y[i]\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u511449169", "problem_id": "p03036", "submission1_id": "s626400931", "submission2_id": "s373840857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, d, x = map(int, input().split())\nfor i in range(10):\n r = r*x-d\n print(r)", "code2": "r, d, x = map(int, input().split())\nfor i in range(10):\n x = r*x-d\n print(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568764900", "date2": "1568765063", "bleu_score": "0.9439433409451379", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "-2 0 9\n", "actual_output": "-18\n-162\n-1458\n-13122\n-118098\n-1062882\n-9565938\n-86093442\n-774840978\n-6973568802\n", "expected_output": "-18\n36\n-72\n144\n-288\n576\n-1152\n2304\n-4608\n9216\n\n", "anno_code": ["r, d, x = map(int, input().split()) # (0): r=-2, d=0, x=9\nfor i in range(10): # (1): i=0 (4): i=1 ... (28): i=9\n r = r*x-d # (2): r=-18 (5): r=-162 ... (29): r=-6973568802\n print(r) # (3): NO CHANGE (6): NO CHANGE ... (30): NO CHANGE\n"], "anno_status": [true], "diff_content": " r, d, x = map(int, input().split())\n for i in range(10):\n- r = r*x-d\n- print(r)\n+ x = r*x-d\n+ print(x)\n", "FL_content": " r, d, x = map(int, input().split())\n for i in range(10):\n- r = r*x-d\n- print(r)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u175590965", "problem_id": "p03036", "submission1_id": "s695093609", "submission2_id": "s028083406", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,d,x = map(int,input().split())\nfor i in range(10):\n x = r*x-d\nprint(x)\n", "code2": "r,d,x = map(int,input().split())\nfor i in range(10):\n x = r*x-d\n print(x)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570761708", "date2": "1570761783", "bleu_score": "0.9295941041259107", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "-2 -1 1\n", "actual_output": "683\n", "expected_output": "-1\n3\n-5\n11\n-21\n43\n-85\n171\n-341\n683\n\n", "anno_code": ["r,d,x = map(int,input().split()) # (0): r=-2, d=-1, x=1\nfor i in range(10): # (1): i=0 (3): i=1 ... (21): NO CHANGE\n x = r*x-d # (2): x=-1 (4): x=3 ... (20): x=683\nprint(x)\n"], "anno_status": [true], "diff_content": " r,d,x = map(int,input().split())\n for i in range(10):\n x = r*x-d\n-print(x)\n+ print(x)\n \n", "FL_content": " r,d,x = map(int,input().split())\n for i in range(10):\n x = r*x-d\n-print(x)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u485319545", "problem_id": "p03036", "submission1_id": "s400511684", "submission2_id": "s147699242", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,D,x_2000 = map(int,input().split())\n\n\nX=[x_2000]\nfor i in range(10):\n X.append(r*X[i] - D)\n\n\nprint(*X,sep=\"\\n\")\n ", "code2": "r,D,x_2000 = map(int,input().split())\n\n\nX=[x_2000]\nfor i in range(10):\n X.append(r*X[i] - D)\n\n\nprint(*X[1:],sep=\"\\n\")\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589132420", "date2": "1589132515", "bleu_score": "0.9553331508419431", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "8 3 -1\n", "actual_output": "-1\n-11\n-91\n-731\n-5851\n-46811\n-374491\n-2995931\n-23967451\n-191739611\n-1533916891\n", "expected_output": "-11\n-91\n-731\n-5851\n-46811\n-374491\n-2995931\n-23967451\n-191739611\n-1533916891\n\n", "anno_code": ["r,D,x_2000 = map(int,input().split()) # (0): r=8, D=3, x_2000=-1\n\n\nX=[x_2000] # (1): X=[-1]\nfor i in range(10): # (2): i=0 (4): i=1 ... (22): NO CHANGE\n X.append(r*X[i] - D) # (3): X=[-1, -11] (5): X=[-1, -11, -91] ... (21): X=[-1, -11, -91, -731, -5851, -46811, -374491, -2995931, -23967451, -191739611, -1533916891]\n\n\nprint(*X,sep=\"\\n\")\n "], "anno_status": [true], "diff_content": " r,D,x_2000 = map(int,input().split())\n \n \n X=[x_2000]\n for i in range(10):\n X.append(r*X[i] - D)\n \n \n-print(*X,sep=\"\\n\")\n+print(*X[1:],sep=\"\\n\")\n \n", "FL_content": " r,D,x_2000 = map(int,input().split())\n \n \n X=[x_2000]\n for i in range(10):\n X.append(r*X[i] - D)\n \n \n-print(*X,sep=\"\\n\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u693524218", "problem_id": "p03036", "submission1_id": "s913774491", "submission2_id": "s360852582", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,D,x = [int(i) for i in input().split()]\n\nprint(r)\n\n\ndef calu(r,D,x):\n X =x\n for j in range(10):\n X = r*X-D\n print(X)\n\ncalu(r,D,x)", "code2": "r,D,x = [int(i) for i in input().split()]\ndef calu(r,D,x):\n X =x\n for j in range(10):\n X = r*X-D\n print(X)\n\ncalu(r,D,x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560369326", "date2": "1560369399", "bleu_score": "0.9110026663945445", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "2 -2 1\n", "actual_output": "2\n4\n10\n22\n46\n94\n190\n382\n766\n1534\n3070\n", "expected_output": "4\n10\n22\n46\n94\n190\n382\n766\n1534\n3070\n\n", "anno_code": ["r,D,x = [int(i) for i in input().split()] # (0): r=2, D=-2, x=1\n\nprint(r) # (1): NO CHANGE\n\n\ndef calu(r,D,x): # (2): calu=\n X =x # (4): X=1\n for j in range(10): # (5): j=0 (8): j=1 ... (32): j=9\n X = r*X-D # (6): X=4 (9): X=10 ... (33): X=3070\n print(X) # (7): NO CHANGE (10): NO CHANGE ... (34): NO CHANGE\n\ncalu(r,D,x) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " r,D,x = [int(i) for i in input().split()]\n-\n-print(r)\n-\n-\n def calu(r,D,x):\n X =x\n for j in range(10):\n X = r*X-D\n print(X)\n \n calu(r,D,x)\n", "FL_content": " r,D,x = [int(i) for i in input().split()]\n-\n-print(r)\n-\n-\n def calu(r,D,x):\n X =x\n for j in range(10):\n X = r*X-D\n print(X)\n \n calu(r,D,x)\n", "added_lines": 0, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u253952966", "problem_id": "p03036", "submission1_id": "s784524952", "submission2_id": "s453854048", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,d,x = map(int, input().split())\nfor i in range(10):\n x =r*x-d\nprint(x)", "code2": "r,d,x = map(int, input().split())\nfor i in range(10):\n x =r*x-d\n print(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558835569", "date2": "1558835608", "bleu_score": "0.9520049151972786", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "13 1 -1\n", "actual_output": "-149346699503\n", "expected_output": "-14\n-183\n-2380\n-30941\n-402234\n-5229043\n-67977560\n-883708281\n-11488207654\n-149346699503\n\n", "anno_code": ["r,d,x = map(int, input().split()) # (0): r=13, d=1, x=-1\nfor i in range(10): # (1): i=0 (3): i=1 ... (21): NO CHANGE\n x =r*x-d # (2): x=-14 (4): x=-183 ... (20): x=-149346699503\nprint(x)"], "anno_status": [true], "diff_content": " r,d,x = map(int, input().split())\n for i in range(10):\n x =r*x-d\n-print(x)\n+ print(x)\n", "FL_content": " r,d,x = map(int, input().split())\n for i in range(10):\n x =r*x-d\n-print(x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u681110193", "problem_id": "p03036", "submission1_id": "s409674302", "submission2_id": "s253410054", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,d,x=map(int,input().split())\n\nfor i in range(11):\n x= x*r-d\n print(x)\n\n", "code2": "r,d,x=map(int,input().split())\n\nfor i in range(10):\n x= x*r-d\n print(x)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564174257", "date2": "1564174648", "bleu_score": "0.9656187881844999", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "4 0 -5\n", "actual_output": "-20\n-80\n-320\n-1280\n-5120\n-20480\n-81920\n-327680\n-1310720\n-5242880\n-20971520\n", "expected_output": "-20\n-80\n-320\n-1280\n-5120\n-20480\n-81920\n-327680\n-1310720\n-5242880\n\n", "anno_code": ["r,d,x=map(int,input().split()) # (0): r=4, d=0, x=-5\n\nfor i in range(11): # (1): i=0 (4): i=1 ... (31): i=10\n x= x*r-d # (2): x=-20 (5): x=-80 ... (32): x=-20971520\n print(x) # (3): NO CHANGE (6): NO CHANGE ... (33): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " r,d,x=map(int,input().split())\n \n-for i in range(11):\n+for i in range(10):\n x= x*r-d\n print(x)\n \n \n", "FL_content": " r,d,x=map(int,input().split())\n \n-for i in range(11):\n x= x*r-d\n print(x)\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u185966380", "problem_id": "p03036", "submission1_id": "s430597677", "submission2_id": "s242928477", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, D, x = map(int, input().split())\ndef mo(r, D, x, i):\n out = rx - D\n print(int(out))\n if i<9:\n \treturn mo(r, D, out, i+1)\n else:\n return 0\n \n mo(r, D, x, 0)", "code2": "r, D, x = map(int, input().split())\ndef mo(r, D, x, i):\n out = r*x - D\n print(int(out))\n if i<9:\n \treturn mo(r, D, out, i+1)\n else:\n return 0\n \nmo(r, D, x, 0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558833047", "date2": "1558833192", "bleu_score": "0.9698178611365524", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "2 -4 0\n", "actual_output": "no output\n", "expected_output": "4\n12\n28\n60\n124\n252\n508\n1020\n2044\n4092\n\n", "anno_code": ["r, D, x = map(int, input().split()) # (0): r=2, D=-4, x=0\ndef mo(r, D, x, i):\n out = rx - D\n print(int(out))\n if i<9:\n \treturn mo(r, D, out, i+1)\n else:\n return 0\n \n mo(r, D, x, 0)"], "anno_status": [true], "diff_content": " r, D, x = map(int, input().split())\n def mo(r, D, x, i):\n- out = rx - D\n+ out = r*x - D\n print(int(out))\n if i<9:\n \treturn mo(r, D, out, i+1)\n else:\n return 0\n \n- mo(r, D, x, 0)\n+mo(r, D, x, 0)\n", "FL_content": " r, D, x = map(int, input().split())\n def mo(r, D, x, i):\n- out = rx - D\n print(int(out))\n if i<9:\n \treturn mo(r, D, out, i+1)\n else:\n return 0\n \n- mo(r, D, x, 0)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u375695365", "problem_id": "p03036", "submission1_id": "s171725482", "submission2_id": "s497233696", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,d,x=map(int,input().split())\nfor i in range(10):\n x= n*x-d\nprint(x)", "code2": "n,d,x=map(int,input().split())\nfor i in range(10):\n x= n*x-d\n print(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577138830", "date2": "1577138873", "bleu_score": "0.9257921357402699", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "3 1 -8\n", "actual_output": "-501916\n", "expected_output": "-25\n-76\n-229\n-688\n-2065\n-6196\n-18589\n-55768\n-167305\n-501916\n\n", "anno_code": ["n,d,x=map(int,input().split()) # (0): n=3, d=1, x=-8\nfor i in range(10): # (1): i=0 (3): i=1 ... (21): NO CHANGE\n x= n*x-d # (2): x=-25 (4): x=-76 ... (20): x=-501916\nprint(x)"], "anno_status": [true], "diff_content": " n,d,x=map(int,input().split())\n for i in range(10):\n x= n*x-d\n-print(x)\n+ print(x)\n", "FL_content": " n,d,x=map(int,input().split())\n for i in range(10):\n x= n*x-d\n-print(x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u426108351", "problem_id": "p03036", "submission1_id": "s169115448", "submission2_id": "s070480522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, D, x2000 = map(int, input().split())\nfor i in range(10):\n x2000 = r*x2000+D\n print(x2000)", "code2": "r, D, x2000 = map(int, input().split())\nfor i in range(10):\n x2000 = r*x2000-D\n print(x2000)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558917502", "date2": "1558917542", "bleu_score": "0.9727436279095398", "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, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 9, "total_score": 65, "input": "3 1 -10\n", "actual_output": "-29\n-86\n-257\n-770\n-2309\n-6926\n-20777\n-62330\n-186989\n-560966\n", "expected_output": "-31\n-94\n-283\n-850\n-2551\n-7654\n-22963\n-68890\n-206671\n-620014\n\n", "anno_code": ["r, D, x2000 = map(int, input().split()) # (0): r=3, D=1, x2000=-10\nfor i in range(10): # (1): i=0 (4): i=1 ... (28): i=9\n x2000 = r*x2000+D # (2): x2000=-29 (5): x2000=-86 ... (29): x2000=-560966\n print(x2000) # (3): NO CHANGE (6): NO CHANGE ... (30): NO CHANGE\n"], "anno_status": [true], "diff_content": " r, D, x2000 = map(int, input().split())\n for i in range(10):\n- x2000 = r*x2000+D\n+ x2000 = r*x2000-D\n print(x2000)\n", "FL_content": " r, D, x2000 = map(int, input().split())\n for i in range(10):\n- x2000 = r*x2000+D\n print(x2000)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u347640436", "problem_id": "p03036", "submission1_id": "s771881374", "submission2_id": "s343557583", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, d, x = map(int, input().split())\nfor _ in range(10):\n x = r * x -d\nprint(x)\n", "code2": "r, d, x = map(int, input().split())\nfor _ in range(10):\n x = r * x -d\n print(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565843315", "date2": "1565932428", "bleu_score": "0.9556553821185526", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "-2 0 3\n", "actual_output": "3072\n", "expected_output": "-6\n12\n-24\n48\n-96\n192\n-384\n768\n-1536\n3072\n\n", "anno_code": ["r, d, x = map(int, input().split()) # (0): r=-2, d=0, x=3\nfor _ in range(10): # (1): _=0 (3): _=1 ... (21): NO CHANGE\n x = r * x -d # (2): x=-6 (4): x=12 ... (20): x=3072\nprint(x)\n"], "anno_status": [true], "diff_content": " r, d, x = map(int, input().split())\n for _ in range(10):\n x = r * x -d\n-print(x)\n-\n+ print(x)\n", "FL_content": " r, d, x = map(int, input().split())\n for _ in range(10):\n x = r * x -d\n-print(x)\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u975719989", "problem_id": "p03036", "submission1_id": "s611076664", "submission2_id": "s078380139", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, D, x = map(int,input().split())\nfor i in range(0,D):\n x = r*x-D\n print(x)", "code2": "r, D, x = map(int,input().split())\nfor i in range(10):\n x = r*x-D\n print(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589139792", "date2": "1589139868", "bleu_score": "0.946902740955315", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 6, "total_score": 65, "input": "3 1 -8\n", "actual_output": "-25\n", "expected_output": "-25\n-76\n-229\n-688\n-2065\n-6196\n-18589\n-55768\n-167305\n-501916\n\n", "anno_code": ["r, D, x = map(int,input().split()) # (0): r=3, D=1, x=-8\nfor i in range(0,D): # (1): i=0\n x = r*x-D # (2): x=-25\n print(x) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " r, D, x = map(int,input().split())\n-for i in range(0,D):\n+for i in range(10):\n x = r*x-D\n print(x)\n", "FL_content": " r, D, x = map(int,input().split())\n-for i in range(0,D):\n x = r*x-D\n print(x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u063073794", "problem_id": "p03036", "submission1_id": "s646624169", "submission2_id": "s452659807", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int, input().split())\nx0=c\nx1=a*c-b\nx2=2*(x1-x0)+x1\nx3=2*(x2-x1)+x2\nx4=2*(x3-x2)+x3\nx5=2*(x4-x3)+x4\nx6=2*(x5-x4)+x5\nx7=2*(x6-x5)+x6\nx8=2*(x7-x6)+x7\nx9=2*(x8-x7)+x8\nx10=2*(x9-x8)+x9\n\nprint(x1)\nprint(x2)\nprint(x3)\nprint(x4)\nprint(x5)\nprint(x6)\nprint(x7)\nprint(x8)\nprint(x9)\nprint(x10)\n", "code2": "a,b,c = map(int, input().split())\nx0=c\nx1=a*c-b\nx2=a*(x1-x0)+x1\nx3=a*(x2-x1)+x2\nx4=a*(x3-x2)+x3\nx5=a*(x4-x3)+x4\nx6=a*(x5-x4)+x5\nx7=a*(x6-x5)+x6\nx8=a*(x7-x6)+x7\nx9=a*(x8-x7)+x8\nx10=a*(x9-x8)+x9\n\nprint(x1)\nprint(x2)\nprint(x3)\nprint(x4)\nprint(x5)\nprint(x6)\nprint(x7)\nprint(x8)\nprint(x9)\nprint(x10)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576551635", "date2": "1576551702", "bleu_score": "0.9191597791923067", "code1_test_status": [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, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 65, "input": "6 -4 -1\n", "actual_output": "-2\n-4\n-8\n-16\n-32\n-64\n-128\n-256\n-512\n-1024\n", "expected_output": "-2\n-8\n-44\n-260\n-1556\n-9332\n-55988\n-335924\n-2015540\n-12093236\n\n", "anno_code": ["a,b,c = map(int, input().split()) # (0): a=6, b=-4, c=-1\nx0=c # (1): x0=-1\nx1=a*c-b # (2): x1=-2\nx2=2*(x1-x0)+x1 # (3): x2=-4\nx3=2*(x2-x1)+x2 # (4): x3=-8\nx4=2*(x3-x2)+x3 # (5): x4=-16\nx5=2*(x4-x3)+x4 # (6): x5=-32\nx6=2*(x5-x4)+x5 # (7): x6=-64\nx7=2*(x6-x5)+x6 # (8): x7=-128\nx8=2*(x7-x6)+x7 # (9): x8=-256\nx9=2*(x8-x7)+x8 # (10): x9=-512\nx10=2*(x9-x8)+x9 # (11): x10=-1024\n\nprint(x1) # (12): NO CHANGE\nprint(x2) # (13): NO CHANGE\nprint(x3) # (14): NO CHANGE\nprint(x4) # (15): NO CHANGE\nprint(x5) # (16): NO CHANGE\nprint(x6) # (17): NO CHANGE\nprint(x7) # (18): NO CHANGE\nprint(x8) # (19): NO CHANGE\nprint(x9) # (20): NO CHANGE\nprint(x10)\n"], "anno_status": [true], "diff_content": " a,b,c = map(int, input().split())\n x0=c\n x1=a*c-b\n-x2=2*(x1-x0)+x1\n-x3=2*(x2-x1)+x2\n-x4=2*(x3-x2)+x3\n-x5=2*(x4-x3)+x4\n-x6=2*(x5-x4)+x5\n-x7=2*(x6-x5)+x6\n-x8=2*(x7-x6)+x7\n-x9=2*(x8-x7)+x8\n-x10=2*(x9-x8)+x9\n+x2=a*(x1-x0)+x1\n+x3=a*(x2-x1)+x2\n+x4=a*(x3-x2)+x3\n+x5=a*(x4-x3)+x4\n+x6=a*(x5-x4)+x5\n+x7=a*(x6-x5)+x6\n+x8=a*(x7-x6)+x7\n+x9=a*(x8-x7)+x8\n+x10=a*(x9-x8)+x9\n \n print(x1)\n print(x2)\n print(x3)\n print(x4)\n print(x5)\n print(x6)\n print(x7)\n print(x8)\n print(x9)\n print(x10)\n-\n", "FL_content": " a,b,c = map(int, input().split())\n x0=c\n x1=a*c-b\n-x2=2*(x1-x0)+x1\n-x3=2*(x2-x1)+x2\n-x4=2*(x3-x2)+x3\n-x5=2*(x4-x3)+x4\n-x6=2*(x5-x4)+x5\n-x7=2*(x6-x5)+x6\n-x8=2*(x7-x6)+x7\n-x9=2*(x8-x7)+x8\n-x10=2*(x9-x8)+x9\n \n print(x1)\n print(x2)\n print(x3)\n print(x4)\n print(x5)\n print(x6)\n print(x7)\n print(x8)\n print(x9)\n print(x10)\n-\n", "added_lines": 9, "removed_lines": 10, "code1_lines": 24 }, { "user_id": "u641722141", "problem_id": "p03036", "submission1_id": "s077747385", "submission2_id": "s747865328", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nfor i in range(10):\n s1=(a*c) -b\n print(s1)\n a=s1", "code2": "a,b,c=map(int,input().split())\nfor i in range(10):\n s1=(a*c) -b\n print(s1)\n c=s1", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558834347", "date2": "1558834443", "bleu_score": "0.9690278768043126", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 65, "input": "-1 1 38\n", "actual_output": "-39\n-1483\n-56355\n-2141491\n-81376659\n-3092313043\n-117507895635\n-4465300034131\n-169681401296979\n-6447893249285203\n", "expected_output": "-39\n38\n-39\n38\n-39\n38\n-39\n38\n-39\n38\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=-1, b=1, c=38\nfor i in range(10): # (1): i=0 (5): i=1 ... (37): i=9\n s1=(a*c) -b # (2): s1=-39 (6): s1=-1483 ... (38): s1=-6447893249285203\n print(s1) # (3): NO CHANGE (7): NO CHANGE ... (39): NO CHANGE\n a=s1 # (4): a=-39 (8): a=-1483 ... (40): a=-6447893249285203\n"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n for i in range(10):\n s1=(a*c) -b\n print(s1)\n- a=s1\n+ c=s1\n", "FL_content": " a,b,c=map(int,input().split())\n for i in range(10):\n s1=(a*c) -b\n print(s1)\n- a=s1\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u957957759", "problem_id": "p03998", "submission1_id": "s593502386", "submission2_id": "s351410828", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=input()\nb=input()\nc=input()\n\n\n\n\n\nn='a'\nwhile True:\n \n if n=='a':\n if len(a)==0:\n print('A')\n break\n else:\n n=a[0]\n a=a.lstrip(a[0])\n elif n=='b':\n if len(b)==0:\n print('B')\n break\n else:\n n=b[0]\n b=b.lstrip(b[0])\n else:\n if len(c)==0:\n print('C')\n break\n else:\n n=c[0]\n c=c.lstrip(c[0])\n\n", "code2": "a=input()\nb=input()\nc=input()\n\n\n\n\n\nn='a'\nwhile True: \n if n=='a':\n if len(a)==0:\n print('A')\n exit()\n \n n=a[0]\n \n a=a[1:]\n \n elif n=='b':\n if len(b)==0:\n print('B')\n exit()\n \n n=b[0]\n \n b=b[1:]\n \n else:\n if len(c)==0:\n print('C')\n exit()\n \n n=c[0]\n \n c=c[1:]\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591676305", "date2": "1591678127", "bleu_score": "0.8450667998178778", "code1_test_status": [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, 0, 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, 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, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 102, "input": "abcb\nbaaa\nbccc\n", "actual_output": "B\n", "expected_output": "A\n\n", "anno_code": ["a=input() # (0): a=abcb\nb=input() # (1): b=baaa\nc=input() # (2): c=bccc\n\n\n\n\n\nn='a' # (3): n=a\nwhile True: # (4): NO CHANGE (9): NO CHANGE ... (37): NO CHANGE\n \n if n=='a': # (5): NO CHANGE (10): NO CHANGE ... (38): NO CHANGE\n if len(a)==0: # (6): NO CHANGE (11): NO CHANGE (28): NO CHANGE\n print('A')\n break\n else:\n n=a[0] # (7): NO CHANGE (12): n=b (29): n=c\n a=a.lstrip(a[0]) # (8): a=bcb (13): a=cb (30): a=b\n elif n=='b': # (16): NO CHANGE (22): NO CHANGE ... (39): NO CHANGE\n if len(b)==0: # (17): NO CHANGE (23): NO CHANGE (40): NO CHANGE\n print('B') # (41): NO CHANGE\n break\n else:\n n=b[0] # (18): NO CHANGE (24): n=a\n b=b.lstrip(b[0]) # (19): b=aaa (25): b=\n else:\n if len(c)==0: # (34): NO CHANGE\n print('C')\n break\n else:\n n=c[0] # (35): n=b\n c=c.lstrip(c[0]) # (36): c=ccc\n\n"], "anno_status": [true], "diff_content": " a=input()\n b=input()\n c=input()\n \n \n \n \n \n n='a'\n-while True:\n- \n+while True: \n if n=='a':\n if len(a)==0:\n print('A')\n- break\n- else:\n- n=a[0]\n- a=a.lstrip(a[0])\n+ exit()\n+ \n+ n=a[0]\n+ \n+ a=a[1:]\n+ \n elif n=='b':\n if len(b)==0:\n print('B')\n- break\n- else:\n- n=b[0]\n- b=b.lstrip(b[0])\n+ exit()\n+ \n+ n=b[0]\n+ \n+ b=b[1:]\n+ \n else:\n if len(c)==0:\n print('C')\n- break\n- else:\n- n=c[0]\n- c=c.lstrip(c[0])\n+ exit()\n+ \n+ n=c[0]\n+ \n+ c=c[1:]\n \n \n", "FL_content": " a=input()\n b=input()\n c=input()\n \n \n \n \n \n n='a'\n-while True:\n- \n if n=='a':\n if len(a)==0:\n print('A')\n- break\n- else:\n- n=a[0]\n- a=a.lstrip(a[0])\n elif n=='b':\n if len(b)==0:\n print('B')\n- break\n- else:\n- n=b[0]\n- b=b.lstrip(b[0])\n else:\n if len(c)==0:\n print('C')\n- break\n- else:\n- n=c[0]\n- c=c.lstrip(c[0])\n \n \n", "added_lines": 18, "removed_lines": 14, "code1_lines": 34 }, { "user_id": "u778720350", "problem_id": "p03998", "submission1_id": "s383212962", "submission2_id": "s711157376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\nb = input()\nc = input()\n\ncards = {'a': a, 'b': b, 'c': c}\nturn = 'a'\n\nwhile True:\n if len(cards[turn]) == 0:\n print(turn)\n break\n draw = cards[turn][0]\n cards[turn] = cards[turn][1:]\n turn = draw\n", "code2": "a = input()\nb = input()\nc = input()\n\ncards = {'a': a, 'b': b, 'c': c}\nturn = 'a'\n\nwhile True:\n if len(cards[turn]) == 0:\n print(turn.upper())\n break\n draw = cards[turn][0]\n cards[turn] = cards[turn][1:]\n turn = draw\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576451453", "date2": "1576451521", "bleu_score": "0.9604643365947203", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "bcba\naaab\ncccc\n", "actual_output": "c\n", "expected_output": "C\n\n", "anno_code": ["a = input() # (0): a=bcba\nb = input() # (1): b=aaab\nc = input() # (2): c=cccc\n\ncards = {'a': a, 'b': b, 'c': c} # (3): cards={'a': 'bcba', 'b': 'aaab', 'c': 'cccc'}\nturn = 'a' # (4): turn=a\n\nwhile True: # (5): NO CHANGE (10): NO CHANGE ... (40): NO CHANGE\n if len(cards[turn]) == 0: # (6): NO CHANGE (11): NO CHANGE ... (41): NO CHANGE\n print(turn) # (42): NO CHANGE\n break\n draw = cards[turn][0] # (7): draw=b (12): draw=a ... (37): NO CHANGE\n cards[turn] = cards[turn][1:] # (8): cards={'a': 'cba', 'b': 'aaab', 'c': 'cccc'} (13): cards={'a': 'cba', 'b': 'aab', 'c': 'cccc'} ... (38): cards={'a': 'ba', 'b': 'aab', 'c': ''}\n turn = draw # (9): turn=b (14): turn=a ... (39): NO CHANGE\n"], "anno_status": [true], "diff_content": " a = input()\n b = input()\n c = input()\n \n cards = {'a': a, 'b': b, 'c': c}\n turn = 'a'\n \n while True:\n if len(cards[turn]) == 0:\n- print(turn)\n+ print(turn.upper())\n break\n draw = cards[turn][0]\n cards[turn] = cards[turn][1:]\n turn = draw\n \n", "FL_content": " a = input()\n b = input()\n c = input()\n \n cards = {'a': a, 'b': b, 'c': c}\n turn = 'a'\n \n while True:\n if len(cards[turn]) == 0:\n- print(turn)\n break\n draw = cards[turn][0]\n cards[turn] = cards[turn][1:]\n turn = draw\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u556610039", "problem_id": "p03998", "submission1_id": "s658643409", "submission2_id": "s758298672", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\nb = input()\nc = input()\ncountlist = [1, 0, 0]\nlist = [\"a\", \"b\", \"c\"]\nturn = 0\nvalue = \"\"\nfor x in range(len(a) + len(b) + len(c)):\n \n if countlist[0] > len(a) or countlist[1] > len(b) or countlist[2] > len(c): break\n if turn == 0: value = a[countlist[turn] - 1]\n elif turn == 1: value = b[countlist[turn] - 1]\n elif turn == 2: value = c[countlist[turn] - 1]\n \n turn = list.index(value)\n countlist[turn] += 1\n print(countlist)\n\nif countlist[0] > len(a): print(\"A\")\nelif countlist[1] > len(b): print(\"B\")\nelif countlist[2] > len(c): print(\"C\")\n", "code2": "a = input()\nb = input()\nc = input()\ncountlist = [1, 0, 0]\nlist = [\"a\", \"b\", \"c\"]\nturn = 0\nvalue = \"\"\nfor x in range(len(a) + len(b) + len(c)):\n \n if countlist[0] > len(a) or countlist[1] > len(b) or countlist[2] > len(c): break\n if turn == 0: value = a[countlist[turn] - 1]\n elif turn == 1: value = b[countlist[turn] - 1]\n elif turn == 2: value = c[countlist[turn] - 1]\n \n turn = list.index(value)\n countlist[turn] += 1\n\nif countlist[0] > len(a): print(\"A\")\nelif countlist[1] > len(b): print(\"B\")\nelif countlist[2] > len(c): print(\"C\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580940841", "date2": "1580940870", "bleu_score": "0.9621622949871186", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "abcb\nbaaa\nbccc\n", "actual_output": "[2, 0, 0]\n[2, 1, 0]\n[2, 2, 0]\n[3, 2, 0]\n[3, 2, 1]\n[3, 3, 1]\n[4, 3, 1]\n[4, 4, 1]\n[5, 4, 1]\nA\n", "expected_output": "A\n\n", "anno_code": ["a = input() # (0): a=abcb\nb = input() # (1): b=baaa\nc = input() # (2): c=bccc\ncountlist = [1, 0, 0] # (3): countlist=[1, 0, 0]\nlist = [\"a\", \"b\", \"c\"] # (4): list=['a', 'b', 'c']\nturn = 0 # (5): turn=0\nvalue = \"\" # (6): value=\nfor x in range(len(a) + len(b) + len(c)): # (7): x=0 (13): x=1 ... (67): x=9\n \n if countlist[0] > len(a) or countlist[1] > len(b) or countlist[2] > len(c): break # (8): NO CHANGE (14): NO CHANGE ... (68): NO CHANGE\n if turn == 0: value = a[countlist[turn] - 1] # (9): value=a (15): value=b ... (62): NO CHANGE\n elif turn == 1: value = b[countlist[turn] - 1] # (22): NO CHANGE (29): value=a ... (63): value=a\n elif turn == 2: value = c[countlist[turn] - 1] # (43): value=b\n \n turn = list.index(value) # (10): NO CHANGE (16): turn=1 ... (64): turn=0\n countlist[turn] += 1 # (11): countlist=[2, 0, 0] (17): countlist=[2, 1, 0] ... (65): countlist=[5, 4, 1]\n print(countlist) # (12): NO CHANGE (18): NO CHANGE ... (66): NO CHANGE\n\nif countlist[0] > len(a): print(\"A\")\nelif countlist[1] > len(b): print(\"B\")\nelif countlist[2] > len(c): print(\"C\")\n"], "anno_status": [true], "diff_content": " a = input()\n b = input()\n c = input()\n countlist = [1, 0, 0]\n list = [\"a\", \"b\", \"c\"]\n turn = 0\n value = \"\"\n for x in range(len(a) + len(b) + len(c)):\n \n if countlist[0] > len(a) or countlist[1] > len(b) or countlist[2] > len(c): break\n if turn == 0: value = a[countlist[turn] - 1]\n elif turn == 1: value = b[countlist[turn] - 1]\n elif turn == 2: value = c[countlist[turn] - 1]\n \n turn = list.index(value)\n countlist[turn] += 1\n- print(countlist)\n \n if countlist[0] > len(a): print(\"A\")\n elif countlist[1] > len(b): print(\"B\")\n elif countlist[2] > len(c): print(\"C\")\n \n", "FL_content": " a = input()\n b = input()\n c = input()\n countlist = [1, 0, 0]\n list = [\"a\", \"b\", \"c\"]\n turn = 0\n value = \"\"\n for x in range(len(a) + len(b) + len(c)):\n \n if countlist[0] > len(a) or countlist[1] > len(b) or countlist[2] > len(c): break\n if turn == 0: value = a[countlist[turn] - 1]\n elif turn == 1: value = b[countlist[turn] - 1]\n elif turn == 2: value = c[countlist[turn] - 1]\n \n turn = list.index(value)\n countlist[turn] += 1\n- print(countlist)\n \n if countlist[0] > len(a): print(\"A\")\n elif countlist[1] > len(b): print(\"B\")\n elif countlist[2] > len(c): print(\"C\")\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u777923818", "problem_id": "p03998", "submission1_id": "s536828572", "submission2_id": "s240592181", "status1": "Wrong Answer", "status2": "Accepted", "code1": "turn = \"a\"\nS = {}\nS[\"a\"] = list(input())\nS[\"b\"] = list(input())\nS[\"c\"] = list(input())\n\nwhile True:\n nextturn = S[turn].pop(0)\n if len(S[turn]) == 0:\n print(turn.upper())\n break\n else:\n turn = nextturn\n ", "code2": "turn = \"a\"\nS = {}\nS[\"a\"] = list(input())\nS[\"b\"] = list(input())\nS[\"c\"] = list(input())\n\nwhile True:\n turn = S[turn].pop(0)\n if len(S[turn]) == 0:\n print(turn.upper())\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546386568", "date2": "1546386735", "bleu_score": "0.7838611992627431", "code1_test_status": [0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 73, "total_score": 102, "input": "aaca\nbaab\ncccb\n", "actual_output": "C\n", "expected_output": "A\n\n", "anno_code": ["turn = \"a\" # (0): turn=a\nS = {} # (1): S={}\nS[\"a\"] = list(input()) # (2): S={'a': ['a', 'a', 'c', 'a']}\nS[\"b\"] = list(input()) # (3): S={'a': ['a', 'a', 'c', 'a'], 'b': ['b', 'a', 'a', 'b']}\nS[\"c\"] = list(input()) # (4): S={'a': ['a', 'a', 'c', 'a'], 'b': ['b', 'a', 'a', 'b'], 'c': ['c', 'c', 'c', 'b']}\n\nwhile True: # (5): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\n nextturn = S[turn].pop(0) # (6): S={'a': ['a', 'c', 'a'], 'b': ['b', 'a', 'a', 'b'], 'c': ['c', 'c', 'c', 'b']}, nextturn=a (10): S={'a': ['c', 'a'], 'b': ['b', 'a', 'a', 'b'], 'c': ['c', 'c', 'c', 'b']} ... (30): S={'a': ['a'], 'b': ['b', 'a', 'a', 'b'], 'c': []}, nextturn=b\n if len(S[turn]) == 0: # (7): NO CHANGE (11): NO CHANGE ... (31): NO CHANGE\n print(turn.upper()) # (32): NO CHANGE\n break\n else:\n turn = nextturn # (8): NO CHANGE (12): NO CHANGE ... (28): NO CHANGE\n "], "anno_status": [true], "diff_content": " turn = \"a\"\n S = {}\n S[\"a\"] = list(input())\n S[\"b\"] = list(input())\n S[\"c\"] = list(input())\n \n while True:\n- nextturn = S[turn].pop(0)\n+ turn = S[turn].pop(0)\n if len(S[turn]) == 0:\n print(turn.upper())\n break\n- else:\n- turn = nextturn\n- \n", "FL_content": " turn = \"a\"\n S = {}\n S[\"a\"] = list(input())\n S[\"b\"] = list(input())\n S[\"c\"] = list(input())\n \n while True:\n- nextturn = S[turn].pop(0)\n if len(S[turn]) == 0:\n print(turn.upper())\n break\n- else:\n- turn = nextturn\n- \n", "added_lines": 1, "removed_lines": 4, "code1_lines": 14 }, { "user_id": "u333190709", "problem_id": "p03998", "submission1_id": "s017106367", "submission2_id": "s829135988", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys, math, fractions, itertools\n\n\ndef solve(S_A: str, S_B: str, S_C: str):\n t = 'a'\n A = list(S_A)\n B = list(S_B)\n C = list(S_C)\n while(True):\n if t == 'a':\n if len(A) == 0:\n w = 'A'\n break\n t = A.pop()\n elif t == 'b':\n if len(B) == 0:\n w = 'B'\n break\n t = B.pop()\n else:\n if len(C) == 0:\n w = 'C'\n break\n t = C.pop()\n print(w)\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 S_A = next(tokens) \n S_B = next(tokens) \n S_C = next(tokens) \n solve(S_A, S_B, S_C)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys, math, fractions, itertools\n\n\ndef solve(S_A: str, S_B: str, S_C: str):\n t = 'a'\n A = list(S_A)\n B = list(S_B)\n C = list(S_C)\n a, b ,c = 0, 0, 0\n while(True):\n if t == 'a':\n if len(A) == a:\n w = 'A'\n break\n t = A[a]\n a += 1\n elif t == 'b':\n if len(B) == b:\n w = 'B'\n break\n t = B[b]\n b += 1\n else:\n if len(C) == c:\n w = 'C'\n break\n t = C[c]\n c += 1\n print(w)\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 S_A = next(tokens) \n S_B = next(tokens) \n S_C = next(tokens) \n solve(S_A, S_B, S_C)\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564781618", "date2": "1564783674", "bleu_score": "0.892744529061882", "code1_test_status": [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, 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, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "aacb\nabbb\nbdba\n", "actual_output": "A\n", "expected_output": "B\n\n", "anno_code": [" # (0): sys=, math=, fractions=, itertools=\nimport sys, math, fractions, itertools\n\n\ndef solve(S_A: str, S_B: str, S_C: str): # (1): solve=\n t = 'a'\n A = list(S_A)\n B = list(S_B)\n C = list(S_C)\n while(True):\n if t == 'a':\n if len(A) == 0:\n w = 'A'\n break\n t = A.pop()\n elif t == 'b':\n if len(B) == 0:\n w = 'B'\n break\n t = B.pop()\n else:\n if len(C) == 0:\n w = 'C'\n break\n t = C.pop()\n print(w)\n return\n\n\n\ndef main(): # (2): 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 S_A = next(tokens) \n S_B = next(tokens) \n S_C = next(tokens) \n solve(S_A, S_B, S_C)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys, math, fractions, itertools\n \n \n def solve(S_A: str, S_B: str, S_C: str):\n t = 'a'\n A = list(S_A)\n B = list(S_B)\n C = list(S_C)\n+ a, b ,c = 0, 0, 0\n while(True):\n if t == 'a':\n- if len(A) == 0:\n+ if len(A) == a:\n w = 'A'\n break\n- t = A.pop()\n+ t = A[a]\n+ a += 1\n elif t == 'b':\n- if len(B) == 0:\n+ if len(B) == b:\n w = 'B'\n break\n- t = B.pop()\n+ t = B[b]\n+ b += 1\n else:\n- if len(C) == 0:\n+ if len(C) == c:\n w = 'C'\n break\n- t = C.pop()\n+ t = C[c]\n+ c += 1\n print(w)\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 S_A = next(tokens) \n S_B = next(tokens) \n S_C = next(tokens) \n solve(S_A, S_B, S_C)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys, math, fractions, itertools\n \n \n def solve(S_A: str, S_B: str, S_C: str):\n t = 'a'\n A = list(S_A)\n B = list(S_B)\n C = list(S_C)\n while(True):\n if t == 'a':\n- if len(A) == 0:\n w = 'A'\n break\n- t = A.pop()\n elif t == 'b':\n- if len(B) == 0:\n w = 'B'\n break\n- t = B.pop()\n else:\n- if len(C) == 0:\n w = 'C'\n break\n- t = C.pop()\n print(w)\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 S_A = next(tokens) \n S_B = next(tokens) \n S_C = next(tokens) \n solve(S_A, S_B, S_C)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 10, "removed_lines": 6, "code1_lines": 44 }, { "user_id": "u383450070", "problem_id": "p03998", "submission1_id": "s263211116", "submission2_id": "s509043159", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(input())\nb = list(input())\nc = list(input())\nselect = \"a\"\nlengtha = len(a)\nlengthb = len(b)\nlengthc = len(c)\nwhile True:\n if select == \"a\":\n del a[0]\n lengtha -= 1\n if lengtha == 0:\n print(\"A\")\n break;\n else:\n select = a[0]\n elif select == \"b\":\n del b[0]\n lengthb -= 1\n if lengthb == 0:\n print(\"B\")\n break;\n else:\n select = b[0]\n else:\n del c[0]\n lengthc -= 1\n if lengthc==0:\n print(\"C\")\n break;\n else:\n select = c[0]", "code2": "a = list(input())\nb = list(input())\nc = list(input())\nmoji = a[0]\nselect = \"a\"\nlengtha = len(a)\nlengthb = len(b)\nlengthc = len(c)\nwhile True:\n if select == \"a\":\n if lengtha == 0:\n print(\"A\")\n break;\n else:\n select = a[0]\n del a[0]\n lengtha -= 1\n elif select == \"b\":\n if lengthb == 0:\n print(\"B\")\n break;\n else:\n select = b[0]\n del b[0]\n lengthb -= 1\n else:\n if lengthc==0:\n print(\"C\")\n break;\n else:\n select = c[0]\n del c[0]\n lengthc -= 1", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588345995", "date2": "1588346528", "bleu_score": "0.9506892673760564", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 70, "total_score": 102, "input": "abcb\naabb\nbccc\n", "actual_output": "C\n", "expected_output": "B\n\n", "anno_code": ["a = list(input()) # (0): a=['a', 'b', 'c', 'b']\nb = list(input()) # (1): b=['a', 'a', 'b', 'b']\nc = list(input()) # (2): c=['b', 'c', 'c', 'c']\nselect = \"a\" # (3): select=a\nlengtha = len(a) # (4): lengtha=4\nlengthb = len(b) # (5): lengthb=4\nlengthc = len(c) # (6): lengthc=4\nwhile True: # (7): NO CHANGE (13): NO CHANGE ... (47): NO CHANGE\n if select == \"a\": # (8): NO CHANGE (14): NO CHANGE ... (48): NO CHANGE\n del a[0] # (9): a=['b', 'c', 'b'] (22): a=['c', 'b']\n lengtha -= 1 # (10): lengtha=3 (23): lengtha=2\n if lengtha == 0: # (11): NO CHANGE (24): NO CHANGE\n print(\"A\")\n break;\n else:\n select = a[0] # (12): select=b (25): select=c\n elif select == \"b\": # (15): NO CHANGE (28): NO CHANGE ... (49): NO CHANGE\n del b[0] # (16): b=['a', 'b', 'b']\n lengthb -= 1 # (17): lengthb=3\n if lengthb == 0: # (18): NO CHANGE\n print(\"B\")\n break;\n else:\n select = b[0] # (19): select=a\n else:\n del c[0] # (29): c=['c', 'c', 'c'] (36): c=['c', 'c'] ... (50): c=[]\n lengthc -= 1 # (30): lengthc=3 (37): lengthc=2 ... (51): lengthc=0\n if lengthc==0: # (31): NO CHANGE (38): NO CHANGE ... (52): NO CHANGE\n print(\"C\") # (53): NO CHANGE\n break;\n else:\n select = c[0] # (32): NO CHANGE (39): NO CHANGE (46): NO CHANGE\n"], "anno_status": [true], "diff_content": " a = list(input())\n b = list(input())\n c = list(input())\n+moji = a[0]\n select = \"a\"\n lengtha = len(a)\n lengthb = len(b)\n lengthc = len(c)\n while True:\n if select == \"a\":\n- del a[0]\n- lengtha -= 1\n if lengtha == 0:\n print(\"A\")\n break;\n else:\n select = a[0]\n+ del a[0]\n+ lengtha -= 1\n elif select == \"b\":\n- del b[0]\n- lengthb -= 1\n if lengthb == 0:\n print(\"B\")\n break;\n else:\n select = b[0]\n+ del b[0]\n+ lengthb -= 1\n else:\n- del c[0]\n- lengthc -= 1\n if lengthc==0:\n print(\"C\")\n break;\n else:\n select = c[0]\n+ del c[0]\n+ lengthc -= 1\n", "FL_content": " a = list(input())\n b = list(input())\n c = list(input())\n select = \"a\"\n lengtha = len(a)\n lengthb = len(b)\n lengthc = len(c)\n while True:\n if select == \"a\":\n- del a[0]\n- lengtha -= 1\n if lengtha == 0:\n print(\"A\")\n break;\n else:\n select = a[0]\n elif select == \"b\":\n- del b[0]\n- lengthb -= 1\n if lengthb == 0:\n print(\"B\")\n break;\n else:\n select = b[0]\n else:\n- del c[0]\n- lengthc -= 1\n if lengthc==0:\n print(\"C\")\n break;\n else:\n select = c[0]\n", "added_lines": 7, "removed_lines": 6, "code1_lines": 32 }, { "user_id": "u071868443", "problem_id": "p03998", "submission1_id": "s802018438", "submission2_id": "s848871453", "status1": "Wrong Answer", "status2": "Accepted", "code1": "sa = list(str(input()))\nsb = list(str(input()))\nsc = list(str(input()))\npa, pb, pc = 0, 0, 0\n\nread = sa[0]\nwhile True:\n if read == 'a':\n pa += 1\n if pa == len(sa):\n print('A')\n break\n read = sa[pa]\n elif read == 'b':\n pb += 1\n if pb == len(sb):\n print('B')\n break\n read = sb[pb]\n else:\n pc += 1\n if pc == len(sc):\n print('C')\n break\n read = sc[pc]\n", "code2": "sa = list(str(input()))\nsb = list(str(input()))\nsc = list(str(input()))\npa, pb, pc = 0, -1, -1\n\nread = sa[0]\nwhile True:\n if read == 'a':\n pa += 1\n if pa == len(sa):\n print('A')\n break\n read = sa[pa]\n elif read == 'b':\n pb += 1\n if pb == len(sb):\n print('B')\n break\n read = sb[pb]\n else:\n pc += 1\n if pc == len(sc):\n print('C')\n break\n read = sc[pc]\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580026420", "date2": "1580026664", "bleu_score": "0.9834518497477334", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 62, "total_score": 102, "input": "abcb\nbaaa\nbccc\n", "actual_output": "C\n", "expected_output": "A\n\n", "anno_code": ["sa = list(str(input())) # (0): sa=['a', 'b', 'c', 'b']\nsb = list(str(input())) # (1): sb=['b', 'a', 'a', 'a']\nsc = list(str(input())) # (2): sc=['b', 'c', 'c', 'c']\npa, pb, pc = 0, 0, 0 # (3): pa=0, pb=0, pc=0\n\nread = sa[0] # (4): read=a\nwhile True: # (5): NO CHANGE (10): NO CHANGE ... (39): NO CHANGE\n if read == 'a': # (6): NO CHANGE (11): NO CHANGE ... (40): NO CHANGE\n pa += 1 # (7): pa=1 (18): pa=2\n if pa == len(sa): # (8): NO CHANGE (19): NO CHANGE\n print('A')\n break\n read = sa[pa] # (9): read=b (20): read=c\n elif read == 'b': # (12): NO CHANGE (23): NO CHANGE ... (41): NO CHANGE\n pb += 1 # (13): pb=1\n if pb == len(sb): # (14): NO CHANGE\n print('B')\n break\n read = sb[pb] # (15): read=a\n else:\n pc += 1 # (24): pc=1 (30): pc=2 ... (42): pc=4\n if pc == len(sc): # (25): NO CHANGE (31): NO CHANGE ... (43): NO CHANGE\n print('C') # (44): NO CHANGE\n break\n read = sc[pc] # (26): NO CHANGE (32): NO CHANGE (38): NO CHANGE\n"], "anno_status": [true], "diff_content": " sa = list(str(input()))\n sb = list(str(input()))\n sc = list(str(input()))\n-pa, pb, pc = 0, 0, 0\n+pa, pb, pc = 0, -1, -1\n \n read = sa[0]\n while True:\n if read == 'a':\n pa += 1\n if pa == len(sa):\n print('A')\n break\n read = sa[pa]\n elif read == 'b':\n pb += 1\n if pb == len(sb):\n print('B')\n break\n read = sb[pb]\n else:\n pc += 1\n if pc == len(sc):\n print('C')\n break\n read = sc[pc]\n \n", "FL_content": " sa = list(str(input()))\n sb = list(str(input()))\n sc = list(str(input()))\n-pa, pb, pc = 0, 0, 0\n \n read = sa[0]\n while True:\n if read == 'a':\n pa += 1\n if pa == len(sa):\n print('A')\n break\n read = sa[pa]\n elif read == 'b':\n pb += 1\n if pb == len(sb):\n print('B')\n break\n read = sb[pb]\n else:\n pc += 1\n if pc == len(sc):\n print('C')\n break\n read = sc[pc]\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 26 }, { "user_id": "u952130512", "problem_id": "p03998", "submission1_id": "s028771829", "submission2_id": "s712337635", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=input()\nB=input()\nC=input()\ns=\"a\"\nwhile len(A)!=0 and len(B)!=0 and len(C)!=0:\n if s==\"a\":\n s=A[0]\n A=A[1:]\n continue\n if s==\"b\":\n s=B[0]\n B=B[1:]\n continue\n if s==\"c\":\n s=C[0]\n C=C[1:]\n continue\nif len(A)==0:\n print(\"A\")\nelif len(B)==0:\n print(\"B\")\nelse:\n print(\"C\")\n", "code2": "A=input()\nB=input()\nC=input()\ns=\"a\"\nwhile (len(A)!=0 or s!=\"a\") and (len(B)!=0 or s!=\"b\") and (len(C)!=0 or s!=\"c\"):\n if s==\"a\":\n s=A[0]\n A=A[1:]\n elif s==\"b\":\n s=B[0]\n B=B[1:]\n else:\n s=C[0]\n C=C[1:]\nif len(A)==0 and s==\"a\":\n print(\"A\")\nelif len(B)==0 and s==\"b\":\n print(\"B\")\nelse:\n print(\"C\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550490502", "date2": "1550492452", "bleu_score": "0.7878933360490041", "code1_test_status": [0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 73, "total_score": 102, "input": "abcb\naacc\nbccc\n", "actual_output": "A\n", "expected_output": "C\n\n", "anno_code": ["A=input() # (0): A=abcb\nB=input() # (1): B=aacc\nC=input() # (2): C=bccc\ns=\"a\" # (3): s=a\nwhile len(A)!=0 and len(B)!=0 and len(C)!=0: # (4): NO CHANGE (9): NO CHANGE ... (43): NO CHANGE\n if s==\"a\": # (5): NO CHANGE (10): NO CHANGE ... (39): NO CHANGE\n s=A[0] # (6): NO CHANGE (11): s=b ... (40): s=b\n A=A[1:] # (7): A=bcb (12): A=cb ... (41): A=\n continue # (8): NO CHANGE (13): NO CHANGE ... (42): NO CHANGE\n if s==\"b\": # (16): NO CHANGE (27): NO CHANGE (34): NO CHANGE\n s=B[0] # (17): s=a (35): s=a\n B=B[1:] # (18): B=acc (36): B=cc\n continue # (19): NO CHANGE (37): NO CHANGE\n if s==\"c\": # (28): NO CHANGE\n s=C[0] # (29): s=b\n C=C[1:] # (30): C=ccc\n continue # (31): NO CHANGE\nif len(A)==0: # (44): NO CHANGE\n print(\"A\")\nelif len(B)==0:\n print(\"B\")\nelse:\n print(\"C\")\n"], "anno_status": [true], "diff_content": " A=input()\n B=input()\n C=input()\n s=\"a\"\n-while len(A)!=0 and len(B)!=0 and len(C)!=0:\n+while (len(A)!=0 or s!=\"a\") and (len(B)!=0 or s!=\"b\") and (len(C)!=0 or s!=\"c\"):\n if s==\"a\":\n s=A[0]\n A=A[1:]\n- continue\n- if s==\"b\":\n+ elif s==\"b\":\n s=B[0]\n B=B[1:]\n- continue\n- if s==\"c\":\n+ else:\n s=C[0]\n C=C[1:]\n- continue\n-if len(A)==0:\n- print(\"A\")\n-elif len(B)==0:\n- print(\"B\")\n+if len(A)==0 and s==\"a\":\n+ print(\"A\")\n+elif len(B)==0 and s==\"b\":\n+ print(\"B\")\n else:\n- print(\"C\")\n+ print(\"C\")\n \n", "FL_content": " A=input()\n B=input()\n C=input()\n s=\"a\"\n-while len(A)!=0 and len(B)!=0 and len(C)!=0:\n if s==\"a\":\n s=A[0]\n A=A[1:]\n- continue\n- if s==\"b\":\n s=B[0]\n B=B[1:]\n- continue\n- if s==\"c\":\n s=C[0]\n C=C[1:]\n- continue\n-if len(A)==0:\n- print(\"A\")\n-elif len(B)==0:\n- print(\"B\")\n else:\n- print(\"C\")\n \n", "added_lines": 8, "removed_lines": 11, "code1_lines": 24 }, { "user_id": "u311636831", "problem_id": "p03998", "submission1_id": "s068872313", "submission2_id": "s557160283", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=input()\nB=input()\nC=input()\n\ni=0\nj=0\nk=0\nc=0\nwhile(True):\n if(c==0):\n if(A[i]==\"a\"):\n i+=1\n c=0\n elif(A[i]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n\n elif(c==1):\n if(B[j]==\"a\"):\n i+=1\n c=0\n elif(B[j]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n else:\n if(C[k]==\"a\"):\n i+=1\n c=0\n elif(C[k]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n if(i==(len(A))):\n print(\"A\")\n exit()\n if(j==(len(B))):\n print(\"B\")\n exit()\n if(k==(len(C))):\n print(\"C\")\n exit()", "code2": "A=input() \nB=input() \nC=input() \n\ni=0\nj=-1\nk=-1\nc=0\n\nwhile(True):\n if(c==0):\n if(i>=(len(A))):\n print(\"A\")\n exit()\n if(A[i]==\"a\"):\n i+=1\n c=0\n elif(A[i]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n\n elif(c==1):\n if(j>=(len(B))):\n print(\"B\")\n exit()\n if(B[j]==\"a\"):\n i+=1\n c=0\n elif(B[j]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n else:\n if(k>=(len(C))):\n print(\"C\")\n exit()\n if(C[k]==\"a\"):\n i+=1\n c=0\n elif(C[k]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n\n\n \n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573573483", "date2": "1573575827", "bleu_score": "0.913683531800106", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 62, "total_score": 102, "input": "aacb\nabab\nbcba\n", "actual_output": "B\n", "expected_output": "A\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": "-A=input()\n-B=input()\n-C=input()\n+A=input() \n+B=input() \n+C=input() \n \n i=0\n-j=0\n-k=0\n+j=-1\n+k=-1\n c=0\n+\n while(True):\n if(c==0):\n+ if(i>=(len(A))):\n+ print(\"A\")\n+ exit()\n if(A[i]==\"a\"):\n i+=1\n c=0\n elif(A[i]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n \n elif(c==1):\n+ if(j>=(len(B))):\n+ print(\"B\")\n+ exit()\n if(B[j]==\"a\"):\n i+=1\n c=0\n elif(B[j]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n else:\n+ if(k>=(len(C))):\n+ print(\"C\")\n+ exit()\n if(C[k]==\"a\"):\n i+=1\n c=0\n elif(C[k]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n- if(i==(len(A))):\n- print(\"A\")\n- exit()\n- if(j==(len(B))):\n- print(\"B\")\n- exit()\n- if(k==(len(C))):\n- print(\"C\")\n- exit()\n+\n+\n+ \n+\n+\n", "FL_content": "-A=input()\n-B=input()\n-C=input()\n \n i=0\n-j=0\n-k=0\n c=0\n while(True):\n if(c==0):\n if(A[i]==\"a\"):\n i+=1\n c=0\n elif(A[i]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n \n elif(c==1):\n if(B[j]==\"a\"):\n i+=1\n c=0\n elif(B[j]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n else:\n if(C[k]==\"a\"):\n i+=1\n c=0\n elif(C[k]==\"b\"):\n j+=1\n c=1\n else:\n k+=1\n c=2\n- if(i==(len(A))):\n- print(\"A\")\n- exit()\n- if(j==(len(B))):\n- print(\"B\")\n- exit()\n- if(k==(len(C))):\n- print(\"C\")\n- exit()\n", "added_lines": 20, "removed_lines": 14, "code1_lines": 49 }, { "user_id": "u215065194", "problem_id": "p03998", "submission1_id": "s930243415", "submission2_id": "s819982925", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=input()\nb=input()\nc=input()\ndic={'a':[_ for _ in a],'b':[_ for _ in b],'c':[_ for _ in c]}\nchar='a'\nprint(dic)\nfor i in range(len(a)+len(b)+len(c)):\n if len(dic[char]) == 0:\n break\n char = dic[char].pop(0)\nprint(char.upper())", "code2": "a=input()\nb=input()\nc=input()\ndic={'a':[_ for _ in a],'b':[_ for _ in b],'c':[_ for _ in c]}\nchar='a'\nfor i in range(len(a)+len(b)+len(c)):\n if len(dic[char]) == 0:\n break\n char = dic[char].pop(0)\nprint(char.upper())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531439489", "date2": "1531439528", "bleu_score": "0.9499357522315975", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "aaca\nabba\nbdcc\n", "actual_output": "{'a': ['a', 'a', 'c', 'a'], 'b': ['a', 'b', 'b', 'a'], 'c': ['b', 'd', 'c', 'c']}\nA\n", "expected_output": "A\n\n", "anno_code": ["a=input() # (0): a=aaca\nb=input() # (1): b=abba\nc=input() # (2): c=bdcc\ndic={'a':[_ for _ in a],'b':[_ for _ in b],'c':[_ for _ in c]} # (3): dic={'a': ['a', 'a', 'c', 'a'], 'b': ['a', 'b', 'b', 'a'], 'c': ['b', 'd', 'c', 'c']}\nchar='a' # (4): char=a\nprint(dic) # (5): NO CHANGE\nfor i in range(len(a)+len(b)+len(c)): # (6): i=0 (9): i=1 ... (24): i=6\n if len(dic[char]) == 0: # (7): NO CHANGE (10): NO CHANGE ... (25): NO CHANGE\n break # (26): NO CHANGE\n char = dic[char].pop(0) # (8): dic={'a': ['a', 'c', 'a'], 'b': ['a', 'b', 'b', 'a'], 'c': ['b', 'd', 'c', 'c']} (11): dic={'a': ['c', 'a'], 'b': ['a', 'b', 'b', 'a'], 'c': ['b', 'd', 'c', 'c']} ... (23): dic={'a': [], 'b': ['b', 'b', 'a'], 'c': ['d', 'c', 'c']}\nprint(char.upper())"], "anno_status": [true], "diff_content": " a=input()\n b=input()\n c=input()\n dic={'a':[_ for _ in a],'b':[_ for _ in b],'c':[_ for _ in c]}\n char='a'\n-print(dic)\n for i in range(len(a)+len(b)+len(c)):\n if len(dic[char]) == 0:\n break\n char = dic[char].pop(0)\n print(char.upper())\n", "FL_content": " a=input()\n b=input()\n c=input()\n dic={'a':[_ for _ in a],'b':[_ for _ in b],'c':[_ for _ in c]}\n char='a'\n-print(dic)\n for i in range(len(a)+len(b)+len(c)):\n if len(dic[char]) == 0:\n break\n char = dic[char].pop(0)\n print(char.upper())\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u581603131", "problem_id": "p03998", "submission1_id": "s278686560", "submission2_id": "s475243973", "status1": "Wrong Answer", "status2": "Accepted", "code1": "SA = list(str(input())) \nSB = list(str(input())) \nSC = list(str(input())) \ncard = 'a'\n\nfor i in range(301):\n if len(SA)==1 and card =='a':\n print('A')\n break\n elif len(SB)==1 and card=='b':\n print('B')\n break\n elif len(SC)==1 and card=='c':\n print('C')\n break\n \n if card == 'a':\n SA = SA[1:]\n card = SA[0]\n elif card == 'b':\n SB = SB[1:]\n card = SB[0]\n elif card == 'c':\n SC =SC[1:]\n card = SC[0]", "code2": "SA, SB, SC = [input() for i in range(3)]\nSA = SA + '0'\nSB = SB + '0'\nSC = SC + '0'\n\ncard = SA[0]\nSA = SA[1:]\n\nfor i in range(303):\n if SA == '0' and card == 'a':\n print('A')\n break\n elif SB == '0' and card == 'b':\n print('B')\n break\n elif SC == '0' and card == 'c':\n print('C')\n break\n \n if card == 'a':\n card = SA[0]\n SA = SA[1:]\n elif card == 'b':\n card = SB[0]\n SB = SB[1:]\n elif card == 'c':\n card = SC[0]\n SC = SC[1:]", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587333987", "date2": "1587504671", "bleu_score": "0.7687656494855732", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 61, "total_score": 102, "input": "acaa\nbbaa\nbccc\n", "actual_output": "C\n", "expected_output": "A\n\n", "anno_code": ["SA = list(str(input())) # (0): SA=['a', 'c', 'a', 'a']\nSB = list(str(input())) # (1): SB=['b', 'b', 'a', 'a']\nSC = list(str(input())) # (2): SC=['b', 'c', 'c', 'c']\ncard = 'a' # (3): card=a\n\nfor i in range(301): # (4): i=0 (11): i=1 ... (38): i=4\n if len(SA)==1 and card =='a': # (5): NO CHANGE (12): NO CHANGE ... (39): NO CHANGE\n print('A')\n break\n elif len(SB)==1 and card=='b': # (6): NO CHANGE (13): NO CHANGE ... (40): NO CHANGE\n print('B')\n break\n elif len(SC)==1 and card=='c': # (7): NO CHANGE (14): NO CHANGE ... (41): NO CHANGE\n print('C') # (42): NO CHANGE\n break\n \n if card == 'a': # (8): NO CHANGE (15): NO CHANGE ... (33): NO CHANGE\n SA = SA[1:] # (9): SA=['c', 'a', 'a']\n card = SA[0] # (10): card=c\n elif card == 'b': # (16): NO CHANGE (25): NO CHANGE (34): NO CHANGE\n SB = SB[1:]\n card = SB[0]\n elif card == 'c': # (17): NO CHANGE (26): NO CHANGE (35): NO CHANGE\n SC =SC[1:] # (18): SC=['c', 'c', 'c'] (27): SC=['c', 'c'] (36): SC=['c']\n card = SC[0] # (19): NO CHANGE (28): NO CHANGE (37): NO CHANGE\n"], "anno_status": [true], "diff_content": "-SA = list(str(input())) \n-SB = list(str(input())) \n-SC = list(str(input())) \n-card = 'a'\n+SA, SB, SC = [input() for i in range(3)]\n+SA = SA + '0'\n+SB = SB + '0'\n+SC = SC + '0'\n \n-for i in range(301):\n- if len(SA)==1 and card =='a':\n+card = SA[0]\n+SA = SA[1:]\n+\n+for i in range(303):\n+ if SA == '0' and card == 'a':\n print('A')\n break\n- elif len(SB)==1 and card=='b':\n+ elif SB == '0' and card == 'b':\n print('B')\n break\n- elif len(SC)==1 and card=='c':\n+ elif SC == '0' and card == 'c':\n print('C')\n break\n- \n+ \n if card == 'a':\n- SA = SA[1:]\n card = SA[0]\n+ SA = SA[1:]\n elif card == 'b':\n- SB = SB[1:]\n card = SB[0]\n+ SB = SB[1:]\n elif card == 'c':\n- SC =SC[1:]\n card = SC[0]\n+ SC = SC[1:]\n", "FL_content": "-SA = list(str(input())) \n-SB = list(str(input())) \n-SC = list(str(input())) \n-card = 'a'\n \n-for i in range(301):\n- if len(SA)==1 and card =='a':\n print('A')\n break\n- elif len(SB)==1 and card=='b':\n print('B')\n break\n- elif len(SC)==1 and card=='c':\n print('C')\n break\n- \n if card == 'a':\n- SA = SA[1:]\n card = SA[0]\n elif card == 'b':\n- SB = SB[1:]\n card = SB[0]\n elif card == 'c':\n- SC =SC[1:]\n card = SC[0]\n", "added_lines": 15, "removed_lines": 12, "code1_lines": 25 }, { "user_id": "u581603131", "problem_id": "p03998", "submission1_id": "s471409352", "submission2_id": "s475243973", "status1": "Wrong Answer", "status2": "Accepted", "code1": "SA, SB, SC = [input() for i in range(3)]\nSA = SA + '0'\nSB = SB + '0'\nSC = SC + '0'\n\ncard = SA[0]\nSA = SA[1:]\n\nfor i in range(1):\n if SA == '0' and card == 'a':\n print('A')\n break\n elif SB == '0' and card == 'b':\n print('B')\n break\n elif SC == '0' and card == 'c':\n print('C')\n break\n \n if card == 'a':\n card = SA[0]\n SA = SA[1:]\n elif card == 'b':\n card = SB[0]\n SB = SB[1:]\n elif card == 'c':\n card = SC[0]\n SC = SC[1:]", "code2": "SA, SB, SC = [input() for i in range(3)]\nSA = SA + '0'\nSB = SB + '0'\nSC = SC + '0'\n\ncard = SA[0]\nSA = SA[1:]\n\nfor i in range(303):\n if SA == '0' and card == 'a':\n print('A')\n break\n elif SB == '0' and card == 'b':\n print('B')\n break\n elif SC == '0' and card == 'c':\n print('C')\n break\n \n if card == 'a':\n card = SA[0]\n SA = SA[1:]\n elif card == 'b':\n card = SB[0]\n SB = SB[1:]\n elif card == 'c':\n card = SC[0]\n SC = SC[1:]", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587504638", "date2": "1587504671", "bleu_score": "0.9914298394648645", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "caa\nacbc\nba\n", "actual_output": "no output\n", "expected_output": "A\n\n", "anno_code": ["SA, SB, SC = [input() for i in range(3)] # (0): SA=caa, SB=acbc, SC=ba\nSA = SA + '0' # (1): SA=caa0\nSB = SB + '0' # (2): SB=acbc0\nSC = SC + '0' # (3): SC=ba0\n\ncard = SA[0] # (4): card=c\nSA = SA[1:] # (5): SA=aa0\n\nfor i in range(1): # (6): i=0\n if SA == '0' and card == 'a': # (7): NO CHANGE\n print('A')\n break\n elif SB == '0' and card == 'b': # (8): NO CHANGE\n print('B')\n break\n elif SC == '0' and card == 'c': # (9): NO CHANGE\n print('C')\n break\n \n if card == 'a': # (10): NO CHANGE\n card = SA[0]\n SA = SA[1:]\n elif card == 'b': # (11): NO CHANGE\n card = SB[0]\n SB = SB[1:]\n elif card == 'c': # (12): NO CHANGE\n card = SC[0] # (13): card=b\n SC = SC[1:] # (14): SC=a0\n"], "anno_status": [true], "diff_content": " SA, SB, SC = [input() for i in range(3)]\n SA = SA + '0'\n SB = SB + '0'\n SC = SC + '0'\n \n card = SA[0]\n SA = SA[1:]\n \n-for i in range(1):\n+for i in range(303):\n if SA == '0' and card == 'a':\n print('A')\n break\n elif SB == '0' and card == 'b':\n print('B')\n break\n elif SC == '0' and card == 'c':\n print('C')\n break\n \n if card == 'a':\n card = SA[0]\n SA = SA[1:]\n elif card == 'b':\n card = SB[0]\n SB = SB[1:]\n elif card == 'c':\n card = SC[0]\n SC = SC[1:]\n", "FL_content": " SA, SB, SC = [input() for i in range(3)]\n SA = SA + '0'\n SB = SB + '0'\n SC = SC + '0'\n \n card = SA[0]\n SA = SA[1:]\n \n-for i in range(1):\n if SA == '0' and card == 'a':\n print('A')\n break\n elif SB == '0' and card == 'b':\n print('B')\n break\n elif SC == '0' and card == 'c':\n print('C')\n break\n \n if card == 'a':\n card = SA[0]\n SA = SA[1:]\n elif card == 'b':\n card = SB[0]\n SB = SB[1:]\n elif card == 'c':\n card = SC[0]\n SC = SC[1:]\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 28 }, { "user_id": "u733337827", "problem_id": "p03998", "submission1_id": "s599836234", "submission2_id": "s309898893", "status1": "Wrong Answer", "status2": "Accepted", "code1": "Sa = list(input())\nSb = list(input())\nSc = list(input())\nl = [len(Sa), len(Sb), len(Sc)]\ns = [Sa, Sb, Sc]\np = 0\nwhile True:\n l[p] -= 1\n if l[p] <= 0:\n print(\"ABC\"[p])\n break\n else:\n p = \"abc\".find(s[p][l[p] - len(s[p]) + 1])", "code2": "Sa = input()\nSb = input()\nSc = input()\nl = [len(Sa), len(Sb), len(Sc)]\ns = [Sa, Sb, Sc]\np = 0\nwhile True:\n if l[p] <= 0:\n print(\"ABC\"[p])\n break\n else:\n l[p] -= 1\n p = \"abc\".find(s[p][len(s[p])-l[p]-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556507805", "date2": "1556509961", "bleu_score": "0.8651230613197303", "code1_test_status": [1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 73, "total_score": 102, "input": "aac\naccb\nca\n", "actual_output": "C\n", "expected_output": "A\n\n", "anno_code": ["Sa = list(input()) # (0): Sa=['a', 'a', 'c']\nSb = list(input()) # (1): Sb=['a', 'c', 'c', 'b']\nSc = list(input()) # (2): Sc=['c', 'a']\nl = [len(Sa), len(Sb), len(Sc)] # (3): l=[3, 4, 2]\ns = [Sa, Sb, Sc] # (4): s\np = 0 # (5): s, p=0\nwhile True: # (6): s (10): s ... (18): s\n l[p] -= 1 # (7): l=[2, 4, 2], s (11): l=[1, 4, 2], s ... (19): l=[1, 4, 0], s\n if l[p] <= 0: # (8): s (12): s ... (20): s\n print(\"ABC\"[p]) # (21): s\n break\n else:\n p = \"abc\".find(s[p][l[p] - len(s[p]) + 1]) # (9): s (13): s, p=2 (17): s\n"], "anno_status": [true], "diff_content": "-Sa = list(input())\n-Sb = list(input())\n-Sc = list(input())\n+Sa = input()\n+Sb = input()\n+Sc = input()\n l = [len(Sa), len(Sb), len(Sc)]\n s = [Sa, Sb, Sc]\n p = 0\n while True:\n- l[p] -= 1\n if l[p] <= 0:\n print(\"ABC\"[p])\n break\n else:\n- p = \"abc\".find(s[p][l[p] - len(s[p]) + 1])\n+ l[p] -= 1\n+ p = \"abc\".find(s[p][len(s[p])-l[p]-1])\n", "FL_content": "-Sa = list(input())\n-Sb = list(input())\n-Sc = list(input())\n l = [len(Sa), len(Sb), len(Sc)]\n s = [Sa, Sb, Sc]\n p = 0\n while True:\n- l[p] -= 1\n if l[p] <= 0:\n print(\"ABC\"[p])\n break\n else:\n- p = \"abc\".find(s[p][l[p] - len(s[p]) + 1])\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 13 }, { "user_id": "u131881594", "problem_id": "p03998", "submission1_id": "s608735469", "submission2_id": "s182160235", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=input(),input(),input()\nstring=[a,b,c]\ns=[0,0,0]\nban=0\nprint(string)\nwhile s[0]!=len(a) and s[1]!=len(b) and s[2]!=len(c):\n temp=s[ban]\n s[ban]+=1\n if string[ban][temp]==\"a\": ban=0\n elif string[ban][temp]==\"b\": ban=1\n else: ban=2\n\nif s[0]==len(a): print(\"A\")\nif s[1]==len(b): print(\"B\")\nif s[2]==len(c): print(\"C\")", "code2": "a,b,c=input(),input(),input()\nstring=[a,b,c]\nans=[\"A\",\"B\",\"C\"]\ns=[0,0,0]\nban=0\nwhile s[ban]!=len(string[ban]):\n temp=s[ban]\n s[ban]+=1\n if string[ban][temp]==\"a\": ban=0\n elif string[ban][temp]==\"b\": ban=1\n else: ban=2\nprint(ans[ban])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592494468", "date2": "1592494673", "bleu_score": "0.6178691437076838", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "aacb\nbbaa\nbccc\n", "actual_output": "['aacb', 'bbaa', 'bccc']\nA\n", "expected_output": "A\n\n", "anno_code": ["a,b,c=input(),input(),input() # (0): a=aacb, b=bbaa, c=bccc\nstring=[a,b,c] # (1): string=['aacb', 'bbaa', 'bccc']\ns=[0,0,0] # (2): s=[0, 0, 0]\nban=0 # (3): ban=0\nprint(string) # (4): NO CHANGE\nwhile s[0]!=len(a) and s[1]!=len(b) and s[2]!=len(c): # (5): NO CHANGE (9): NO CHANGE ... (43): NO CHANGE\n temp=s[ban] # (6): temp=0 (10): temp=1 ... (39): temp=3\n s[ban]+=1 # (7): s=[1, 0, 0] (11): s=[2, 0, 0] ... (40): s=[4, 3, 1]\n if string[ban][temp]==\"a\": ban=0 # (8): NO CHANGE (12): NO CHANGE ... (41): NO CHANGE\n elif string[ban][temp]==\"b\": ban=1 # (17): NO CHANGE (23): ban=1 ... (42): ban=1\n else: ban=2 # (18): ban=2\n\nif s[0]==len(a): print(\"A\") # (44): NO CHANGE\nif s[1]==len(b): print(\"B\") # (45): NO CHANGE\nif s[2]==len(c): print(\"C\")"], "anno_status": [true], "diff_content": " a,b,c=input(),input(),input()\n string=[a,b,c]\n+ans=[\"A\",\"B\",\"C\"]\n s=[0,0,0]\n ban=0\n-print(string)\n-while s[0]!=len(a) and s[1]!=len(b) and s[2]!=len(c):\n+while s[ban]!=len(string[ban]):\n temp=s[ban]\n s[ban]+=1\n if string[ban][temp]==\"a\": ban=0\n elif string[ban][temp]==\"b\": ban=1\n else: ban=2\n-\n-if s[0]==len(a): print(\"A\")\n-if s[1]==len(b): print(\"B\")\n-if s[2]==len(c): print(\"C\")\n+print(ans[ban])\n", "FL_content": " a,b,c=input(),input(),input()\n string=[a,b,c]\n s=[0,0,0]\n ban=0\n-print(string)\n-while s[0]!=len(a) and s[1]!=len(b) and s[2]!=len(c):\n temp=s[ban]\n s[ban]+=1\n if string[ban][temp]==\"a\": ban=0\n elif string[ban][temp]==\"b\": ban=1\n else: ban=2\n-\n-if s[0]==len(a): print(\"A\")\n-if s[1]==len(b): print(\"B\")\n-if s[2]==len(c): print(\"C\")\n", "added_lines": 3, "removed_lines": 6, "code1_lines": 15 }, { "user_id": "u460745860", "problem_id": "p03998", "submission1_id": "s460723019", "submission2_id": "s904566147", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import deque\nS_A = deque(input())\nS_B = deque(input())\nS_C = deque(input())\n\n\nnext_turn = 'a'\n\nwhile True:\n \n if len(S_A) == 0 and next_turn == 'a':\n print(\"A\")\n exit()\n elif len(S_B) == 0 and next_turn == 'b':\n print(\"B\")\n exit()\n elif len(S_C) == 0 and next_turn == 'c':\n print(\"C\")\n exit()\n else:\n if next_turn == 'a':\n next_turn = S_A.pop()\n elif next_turn == 'b':\n next_turn = S_B.pop()\n else:\n next_turn = S_C.pop()\n", "code2": "\nfrom collections import deque\nS_A = deque(input())\nS_B = deque(input())\nS_C = deque(input())\n\n\nnext_turn = 'a'\n\nwhile True:\n \n if len(S_A) == 0 and next_turn == 'a':\n print(\"A\")\n exit()\n elif len(S_B) == 0 and next_turn == 'b':\n print(\"B\")\n exit()\n elif len(S_C) == 0 and next_turn == 'c':\n print(\"C\")\n exit()\n else:\n if next_turn == 'a':\n next_turn = S_A.popleft()\n elif next_turn == 'b':\n next_turn = S_B.popleft()\n elif next_turn == 'c':\n next_turn = S_C.popleft()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598910223", "date2": "1598910392", "bleu_score": "0.9364192881937626", "code1_test_status": [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, 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, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "aacb\nabbb\nbdba\n", "actual_output": "A\n", "expected_output": "B\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " \n from collections import deque\n S_A = deque(input())\n S_B = deque(input())\n S_C = deque(input())\n \n \n next_turn = 'a'\n \n while True:\n \n if len(S_A) == 0 and next_turn == 'a':\n print(\"A\")\n exit()\n elif len(S_B) == 0 and next_turn == 'b':\n print(\"B\")\n exit()\n elif len(S_C) == 0 and next_turn == 'c':\n print(\"C\")\n exit()\n else:\n if next_turn == 'a':\n- next_turn = S_A.pop()\n+ next_turn = S_A.popleft()\n elif next_turn == 'b':\n- next_turn = S_B.pop()\n- else:\n- next_turn = S_C.pop()\n+ next_turn = S_B.popleft()\n+ elif next_turn == 'c':\n+ next_turn = S_C.popleft()\n \n", "FL_content": " \n from collections import deque\n S_A = deque(input())\n S_B = deque(input())\n S_C = deque(input())\n \n \n next_turn = 'a'\n \n while True:\n \n if len(S_A) == 0 and next_turn == 'a':\n print(\"A\")\n exit()\n elif len(S_B) == 0 and next_turn == 'b':\n print(\"B\")\n exit()\n elif len(S_C) == 0 and next_turn == 'c':\n print(\"C\")\n exit()\n else:\n if next_turn == 'a':\n- next_turn = S_A.pop()\n elif next_turn == 'b':\n- next_turn = S_B.pop()\n- else:\n- next_turn = S_C.pop()\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 28 }, { "user_id": "u598684283", "problem_id": "p03998", "submission1_id": "s710229571", "submission2_id": "s261612138", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(input())\nb = list(input())\nc = list(input())\ncheck = \"a\"\nwhile len(a) != 0 and len(b) != 0 and len(c) != 0:\n if check == \"a\":\n check = a[0]\n a.pop(0)\n elif check == \"b\":\n check = b[0]\n b.pop(0)\n else:\n check = c[0]\n c.pop(0)\n\nif len(a) == 1:\n print(\"A\")\nelif len(b) == 1:\n print(\"B\")\nelse:\n print(\"C\")", "code2": "a = list(input())\nb = list(input())\nc = list(input())\ncheck = \"a\"\nwhile True:\n if check == \"a\":\n if len(a) == 0:\n print(\"A\")\n break\n else:\n check = a[0]\n a.pop(0)\n if check == \"b\":\n if len(b) == 0:\n print(\"B\")\n break\n else:\n check = b[0]\n b.pop(0)\n if check == \"c\":\n if len(c) == 0:\n print(\"C\")\n break\n else:\n check = c[0]\n c.pop(0)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594666453", "date2": "1594667361", "bleu_score": "0.6320186821489752", "code1_test_status": [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, 1, 1, 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, 1, 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, 1, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 17, "total_score": 102, "input": "acaa\nbbab\nbcdb\n", "actual_output": "B\n", "expected_output": "A\n\n", "anno_code": ["a = list(input()) # (0): a=['a', 'c', 'a', 'a']\nb = list(input()) # (1): b=['b', 'b', 'a', 'b']\nc = list(input()) # (2): c=['b', 'c', 'd', 'b']\ncheck = \"a\" # (3): check=a\nwhile len(a) != 0 and len(b) != 0 and len(c) != 0: # (4): NO CHANGE (8): NO CHANGE ... (40): NO CHANGE\n if check == \"a\": # (5): NO CHANGE (9): NO CHANGE ... (37): NO CHANGE\n check = a[0] # (6): NO CHANGE (10): check=c ... (38): NO CHANGE\n a.pop(0) # (7): a=['c', 'a', 'a'] (11): a=['a', 'a'] ... (39): a=[]\n elif check == \"b\": # (14): NO CHANGE (19): NO CHANGE ... (29): NO CHANGE\n check = b[0] # (20): NO CHANGE (25): NO CHANGE (30): check=a\n b.pop(0) # (21): b=['b', 'a', 'b'] (26): b=['a', 'b'] (31): b=['b']\n else:\n check = c[0] # (15): check=b\n c.pop(0) # (16): c=['c', 'd', 'b']\n\nif len(a) == 1: # (41): NO CHANGE\n print(\"A\")\nelif len(b) == 1: # (42): NO CHANGE\n print(\"B\")\nelse:\n print(\"C\")"], "anno_status": [true], "diff_content": " a = list(input())\n b = list(input())\n c = list(input())\n check = \"a\"\n-while len(a) != 0 and len(b) != 0 and len(c) != 0:\n+while True:\n if check == \"a\":\n- check = a[0]\n- a.pop(0)\n- elif check == \"b\":\n- check = b[0]\n- b.pop(0)\n- else:\n- check = c[0]\n- c.pop(0)\n-\n-if len(a) == 1:\n- print(\"A\")\n-elif len(b) == 1:\n- print(\"B\")\n-else:\n- print(\"C\")\n+ if len(a) == 0:\n+ print(\"A\")\n+ break\n+ else:\n+ check = a[0]\n+ a.pop(0)\n+ if check == \"b\":\n+ if len(b) == 0:\n+ print(\"B\")\n+ break\n+ else:\n+ check = b[0]\n+ b.pop(0)\n+ if check == \"c\":\n+ if len(c) == 0:\n+ print(\"C\")\n+ break\n+ else:\n+ check = c[0]\n+ c.pop(0)\n", "FL_content": " a = list(input())\n b = list(input())\n c = list(input())\n check = \"a\"\n-while len(a) != 0 and len(b) != 0 and len(c) != 0:\n if check == \"a\":\n- check = a[0]\n- a.pop(0)\n- elif check == \"b\":\n- check = b[0]\n- b.pop(0)\n- else:\n- check = c[0]\n- c.pop(0)\n-\n-if len(a) == 1:\n- print(\"A\")\n-elif len(b) == 1:\n- print(\"B\")\n-else:\n- print(\"C\")\n", "added_lines": 21, "removed_lines": 16, "code1_lines": 21 }, { "user_id": "u320763652", "problem_id": "p03998", "submission1_id": "s589942741", "submission2_id": "s777077419", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\nb = input()\nc = input()\n\n\n\nnext = 'a'\n\nwhile True:\n\n if not a:\n print('A')\n exit()\n if not b:\n print('B')\n exit()\n if not c:\n print('C')\n exit()\n\n if next == 'a':\n next = a[-1]\n a = a[:-1]\n\n elif next == 'b':\n next = b[-1]\n b = b[:-1]\n else:\n next = c[-1]\n c = c[:-1]\n", "code2": "a = input()\nb = input()\nc = input()\n\n\nturn = 'a'\n\nA = B = C = 0\n\nwhile 1:\n\n if turn == 'a':\n if len(a) == A:\n print('A')\n break\n turn = a[A]\n A+=1\n\n elif turn == 'b':\n if len(b) == B:\n print('B')\n break\n turn = b[B]\n B+=1\n else:\n if len(c) == C:\n print('C')\n break\n turn = c[C]\n C+=1\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588204924", "date2": "1588206949", "bleu_score": "0.6365642163710068", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 71, "total_score": 102, "input": "aaca\naabb\nbccc\n", "actual_output": "C\n", "expected_output": "A\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " a = input()\n b = input()\n c = input()\n \n \n+turn = 'a'\n \n-next = 'a'\n+A = B = C = 0\n \n-while True:\n+while 1:\n \n- if not a:\n- print('A')\n- exit()\n- if not b:\n- print('B')\n- exit()\n- if not c:\n- print('C')\n- exit()\n+ if turn == 'a':\n+ if len(a) == A:\n+ print('A')\n+ break\n+ turn = a[A]\n+ A+=1\n \n- if next == 'a':\n- next = a[-1]\n- a = a[:-1]\n-\n- elif next == 'b':\n- next = b[-1]\n- b = b[:-1]\n+ elif turn == 'b':\n+ if len(b) == B:\n+ print('B')\n+ break\n+ turn = b[B]\n+ B+=1\n else:\n- next = c[-1]\n- c = c[:-1]\n+ if len(c) == C:\n+ print('C')\n+ break\n+ turn = c[C]\n+ C+=1\n \n", "FL_content": " a = input()\n b = input()\n c = input()\n \n \n \n-next = 'a'\n \n-while True:\n \n- if not a:\n- print('A')\n- exit()\n- if not b:\n- print('B')\n- exit()\n- if not c:\n- print('C')\n- exit()\n \n- if next == 'a':\n- next = a[-1]\n- a = a[:-1]\n-\n- elif next == 'b':\n- next = b[-1]\n- b = b[:-1]\n else:\n- next = c[-1]\n- c = c[:-1]\n \n", "added_lines": 20, "removed_lines": 20, "code1_lines": 31 }, { "user_id": "u350093546", "problem_id": "p03998", "submission1_id": "s907708804", "submission2_id": "s585111124", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=list(input())\nb=list(input())\nc=list(input())\norder='a'\nwhile True:\n if order=='a':\n order=a[0]\n if len(a)==1:\n print('A')\n break\n else:\n a=a[1:]\n elif order=='b':\n order=b[0]\n if len(b)==1:\n print('B')\n break\n else:\n b=b[1:]\n elif order=='c':\n order=c[0]\n if len(c)==1:\n print('C')\n break\n else:\n c=c[1:]", "code2": "a=list(input())\nb=list(input())\nc=list(input())\norder='a'\nwhile True:\n if order=='a':\n if len(a)==0:\n print('A')\n break\n else:\n order=a[0]\n a=a[1:]\n elif order=='b':\n if len(b)==0:\n print('B')\n break\n else:\n order=b[0]\n b=b[1:]\n elif order=='c':\n if len(c)==0:\n print('C')\n break\n else:\n order=c[0]\n c=c[1:]", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595383678", "date2": "1595383882", "bleu_score": "0.9650058179740167", "code1_test_status": [0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 73, "total_score": 102, "input": "babc\naaab\ncccc\n", "actual_output": "A\n", "expected_output": "C\n\n", "anno_code": ["a=list(input()) # (0): a=['b', 'a', 'b', 'c']\nb=list(input()) # (1): b=['a', 'a', 'a', 'b']\nc=list(input()) # (2): c=['c', 'c', 'c', 'c']\norder='a' # (3): order=a\nwhile True: # (4): NO CHANGE (9): NO CHANGE ... (31): NO CHANGE\n if order=='a': # (5): NO CHANGE (10): NO CHANGE ... (32): NO CHANGE\n order=a[0] # (6): order=b (17): NO CHANGE ... (33): order=c\n if len(a)==1: # (7): NO CHANGE (18): NO CHANGE ... (34): NO CHANGE\n print('A') # (35): NO CHANGE\n break\n else:\n a=a[1:] # (8): a=['a', 'b', 'c'] (19): a=['b', 'c'] (24): a=['c']\n elif order=='b': # (11): NO CHANGE (27): NO CHANGE\n order=b[0] # (12): order=a (28): order=a\n if len(b)==1: # (13): NO CHANGE (29): NO CHANGE\n print('B')\n break\n else:\n b=b[1:] # (14): b=['a', 'a', 'b'] (30): b=['a', 'b']\n elif order=='c':\n order=c[0]\n if len(c)==1:\n print('C')\n break\n else:\n c=c[1:]"], "anno_status": [true], "diff_content": " a=list(input())\n b=list(input())\n c=list(input())\n order='a'\n while True:\n if order=='a':\n- order=a[0]\n- if len(a)==1:\n+ if len(a)==0:\n print('A')\n break\n else:\n+ order=a[0]\n a=a[1:]\n elif order=='b':\n- order=b[0]\n- if len(b)==1:\n+ if len(b)==0:\n print('B')\n break\n else:\n+ order=b[0]\n b=b[1:]\n elif order=='c':\n- order=c[0]\n- if len(c)==1:\n+ if len(c)==0:\n print('C')\n break\n else:\n+ order=c[0]\n c=c[1:]\n", "FL_content": " a=list(input())\n b=list(input())\n c=list(input())\n order='a'\n while True:\n if order=='a':\n- order=a[0]\n- if len(a)==1:\n print('A')\n break\n else:\n a=a[1:]\n elif order=='b':\n- order=b[0]\n- if len(b)==1:\n print('B')\n break\n else:\n b=b[1:]\n elif order=='c':\n- order=c[0]\n- if len(c)==1:\n print('C')\n break\n else:\n c=c[1:]\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 26 }, { "user_id": "u228232845", "problem_id": "p03998", "submission1_id": "s284671020", "submission2_id": "s508358757", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nimport sys\n\n\ndef input(): return sys.stdin.readline().strip()\ndef I(): return int(input())\ndef LI(): return list(map(int, input().split()))\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef S(): return input()\ndef LS(): return input().split()\n\n\nsa = deque(list(S()))\nsb = deque(list(S()))\nsc = deque(list(S()))\n\nturn = 'a'\nwhile True:\n if len(sa) == 0 or len(sb) == 0 or len(sc) == 0:\n break\n if turn == 'a':\n turn = sa.popleft()\n if turn == 'b':\n turn = sb.popleft()\n if turn == 'c':\n turn = sc.popleft()\nprint(turn.upper())\n", "code2": "from collections import deque\nimport sys\n\n\ndef input(): return sys.stdin.readline().strip()\ndef I(): return int(input())\ndef LI(): return list(map(int, input().split()))\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef S(): return input()\ndef LS(): return input().split()\n\n\nsa = deque(list(S()))\nsb = deque(list(S()))\nsc = deque(list(S()))\n\nturn = 'a'\nwhile True:\n if turn == 'a':\n if len(sa) == 0:\n ans = 'A'\n break\n turn = sa.popleft()\n elif turn == 'b':\n if len(sb) == 0:\n ans = 'B'\n break\n turn = sb.popleft()\n elif turn == 'c':\n if len(sc) == 0:\n ans = 'C'\n break\n turn = sc.popleft()\n\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592612527", "date2": "1592613044", "bleu_score": "0.8181914215804797", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 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, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "abca\nbbba\ncccb\n", "actual_output": "A\n", "expected_output": "B\n\n", "anno_code": ["from collections import deque\nimport sys\n\n\ndef input(): return sys.stdin.readline().strip()\ndef I(): return int(input())\ndef LI(): return list(map(int, input().split()))\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef S(): return input()\ndef LS(): return input().split()\n\n\nsa = deque(list(S())) # (0): sa=deque(['c', 'a'])\nsb = deque(list(S())) # (1): sb=deque([])\nsc = deque(list(S())) # (2): sc=deque(['c', 'c', 'c', 'b'])\n\nturn = 'a' # (3): turn=a\nwhile True: # (4): NO CHANGE (10): NO CHANGE ... (35): NO CHANGE\n if len(sa) == 0 or len(sb) == 0 or len(sc) == 0: # (5): NO CHANGE (11): NO CHANGE ... (36): NO CHANGE\n break # (37): NO CHANGE\n if turn == 'a': # (6): NO CHANGE (12): NO CHANGE ... (31): NO CHANGE\n turn = sa.popleft() # (7): NO CHANGE (13): turn=b\n if turn == 'b': # (8): NO CHANGE (14): NO CHANGE ... (32): NO CHANGE\n turn = sb.popleft() # (15): NO CHANGE (21): NO CHANGE ... (33): turn=a\n if turn == 'c': # (9): NO CHANGE (16): NO CHANGE ... (34): NO CHANGE\n turn = sc.popleft()\nprint(turn.upper())\n"], "anno_status": [true], "diff_content": " from collections import deque\n import sys\n \n \n def input(): return sys.stdin.readline().strip()\n def I(): return int(input())\n def LI(): return list(map(int, input().split()))\n def IR(n): return [I() for i in range(n)]\n def LIR(n): return [LI() for i in range(n)]\n def SR(n): return [S() for i in range(n)]\n def S(): return input()\n def LS(): return input().split()\n \n \n sa = deque(list(S()))\n sb = deque(list(S()))\n sc = deque(list(S()))\n \n turn = 'a'\n while True:\n- if len(sa) == 0 or len(sb) == 0 or len(sc) == 0:\n- break\n if turn == 'a':\n+ if len(sa) == 0:\n+ ans = 'A'\n+ break\n turn = sa.popleft()\n- if turn == 'b':\n+ elif turn == 'b':\n+ if len(sb) == 0:\n+ ans = 'B'\n+ break\n turn = sb.popleft()\n- if turn == 'c':\n+ elif turn == 'c':\n+ if len(sc) == 0:\n+ ans = 'C'\n+ break\n turn = sc.popleft()\n-print(turn.upper())\n+\n+print(ans)\n \n", "FL_content": " from collections import deque\n import sys\n \n \n def input(): return sys.stdin.readline().strip()\n def I(): return int(input())\n def LI(): return list(map(int, input().split()))\n def IR(n): return [I() for i in range(n)]\n def LIR(n): return [LI() for i in range(n)]\n def SR(n): return [S() for i in range(n)]\n def S(): return input()\n def LS(): return input().split()\n \n \n sa = deque(list(S()))\n sb = deque(list(S()))\n sc = deque(list(S()))\n \n turn = 'a'\n while True:\n- if len(sa) == 0 or len(sb) == 0 or len(sc) == 0:\n- break\n if turn == 'a':\n turn = sa.popleft()\n- if turn == 'b':\n turn = sb.popleft()\n- if turn == 'c':\n turn = sc.popleft()\n-print(turn.upper())\n \n", "added_lines": 13, "removed_lines": 5, "code1_lines": 30 }, { "user_id": "u853900545", "problem_id": "p03998", "submission1_id": "s531289077", "submission2_id": "s312036034", "status1": "Wrong Answer", "status2": "Accepted", "code1": "sa = list(input())\nsb = list(input())\nsc = list(input())\n\nd = 'a'\n\nwhile 1:\n if d == 'a':\n d = sa.pop(0)\n if sa == []:\n print('A')\n break\n d = sa[0]\n elif d == 'b':\n d = sb.pop(0)\n if sb == []:\n print('B')\n break\n d = sb[0]\n else:\n d = sc.pop(0)\n if sc == []:\n print('C')\n break\n d = sc[0]", "code2": "sa = list(input())\nsb = list(input())\nsc = list(input())\n\nd = 'a'\ncnta = 0\ncntb = 0\ncntc = 0\nA = len(sa)\nB = len(sb)\nC = len(sc)\n\nwhile 1:\n if d == 'a':\n cnta += 1\n if cnta == A+1:\n print('A')\n break\n d = sa.pop(0)\n elif d == 'b':\n cntb += 1\n if cntb == B+1:\n print('B')\n break\n d = sb.pop(0)\n else:\n cntc += 1\n if cntc == C+1:\n print('C')\n break\n d = sc.pop(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1539136148", "date2": "1539136945", "bleu_score": "0.7689247640417067", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 70, "total_score": 102, "input": "aaca\nabba\nbdcc\n", "actual_output": "C\n", "expected_output": "A\n\n", "anno_code": ["sa = list(input()) # (0): sa=['a', 'a', 'c', 'a']\nsb = list(input()) # (1): sb=['a', 'b', 'b', 'a']\nsc = list(input()) # (2): sc=['b', 'd', 'c', 'c']\n\nd = 'a' # (3): d=a\n\nwhile 1: # (4): NO CHANGE (9): NO CHANGE ... (32): NO CHANGE\n if d == 'a': # (5): NO CHANGE (10): NO CHANGE ... (33): NO CHANGE\n d = sa.pop(0) # (6): sa=['a', 'c', 'a'] (11): sa=['c', 'a']\n if sa == []: # (7): NO CHANGE (12): NO CHANGE\n print('A')\n break\n d = sa[0] # (8): NO CHANGE (13): d=c\n elif d == 'b': # (16): NO CHANGE (22): NO CHANGE ... (34): NO CHANGE\n d = sb.pop(0)\n if sb == []:\n print('B')\n break\n d = sb[0]\n else:\n d = sc.pop(0) # (17): sc=['d', 'c', 'c'], d=b (23): sc=['c', 'c'] ... (35): sc=[]\n if sc == []: # (18): NO CHANGE (24): NO CHANGE ... (36): NO CHANGE\n print('C') # (37): NO CHANGE\n break\n d = sc[0] # (19): d=d (25): d=c (31): NO CHANGE\n"], "anno_status": [true], "diff_content": " sa = list(input())\n sb = list(input())\n sc = list(input())\n \n d = 'a'\n+cnta = 0\n+cntb = 0\n+cntc = 0\n+A = len(sa)\n+B = len(sb)\n+C = len(sc)\n \n while 1:\n if d == 'a':\n- d = sa.pop(0)\n- if sa == []:\n+ cnta += 1\n+ if cnta == A+1:\n print('A')\n break\n- d = sa[0]\n+ d = sa.pop(0)\n elif d == 'b':\n- d = sb.pop(0)\n- if sb == []:\n+ cntb += 1\n+ if cntb == B+1:\n print('B')\n break\n- d = sb[0]\n+ d = sb.pop(0)\n else:\n- d = sc.pop(0)\n- if sc == []:\n+ cntc += 1\n+ if cntc == C+1:\n print('C')\n break\n- d = sc[0]\n+ d = sc.pop(0)\n", "FL_content": " sa = list(input())\n sb = list(input())\n sc = list(input())\n \n d = 'a'\n \n while 1:\n if d == 'a':\n- d = sa.pop(0)\n- if sa == []:\n print('A')\n break\n- d = sa[0]\n elif d == 'b':\n- d = sb.pop(0)\n- if sb == []:\n print('B')\n break\n- d = sb[0]\n else:\n- d = sc.pop(0)\n- if sc == []:\n print('C')\n break\n- d = sc[0]\n", "added_lines": 15, "removed_lines": 9, "code1_lines": 25 }, { "user_id": "u485566817", "problem_id": "p03563", "submission1_id": "s198766719", "submission2_id": "s665985872", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r = float(input())\ng = float(input())\nprint(2*g - r)", "code2": "r = int(input())\ng = int(input())\nprint(int(2*g - r))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577664622", "date2": "1577664802", "bleu_score": "0.7643938691575248", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n3\n", "actual_output": "-4494.0\n", "expected_output": "-4494\n\n", "anno_code": ["r = float(input()) # (0): r=4500.0\ng = float(input()) # (1): g=3.0\nprint(2*g - r)"], "anno_status": [true], "diff_content": "-r = float(input())\n-g = float(input())\n-print(2*g - r)\n+r = int(input())\n+g = int(input())\n+print(int(2*g - r))\n", "FL_content": "-r = float(input())\n-g = float(input())\n-print(2*g - r)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 3 }, { "user_id": "u488934106", "problem_id": "p03563", "submission1_id": "s919203045", "submission2_id": "s187360422", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def newrating(r , g):\n\n return (r + g) / 2\n\ndef main():\n r = int(input())\n g = int(input())\n print(newrating(r , g))\n\nif __name__ == '__main__':\n main()", "code2": "def newrating(r , g):\n\n return (g - r) + g\n\ndef main():\n r = int(input())\n g = int(input())\n print(newrating(r , g))\n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582122922", "date2": "1582123021", "bleu_score": "0.9527435137717561", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n-37\n", "actual_output": "2231.5\n", "expected_output": "-4574\n\n", "anno_code": ["def newrating(r , g): # (0): newrating=\n\n return (r + g) / 2\n\ndef main(): # (1): main=\n r = int(input())\n g = int(input())\n print(newrating(r , g))\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " def newrating(r , g):\n \n- return (r + g) / 2\n+ return (g - r) + g\n \n def main():\n r = int(input())\n g = int(input())\n print(newrating(r , g))\n \n if __name__ == '__main__':\n main()\n", "FL_content": " def newrating(r , g):\n \n- return (r + g) / 2\n \n def main():\n r = int(input())\n g = int(input())\n print(newrating(r , g))\n \n if __name__ == '__main__':\n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u894694822", "problem_id": "p03563", "submission1_id": "s424770132", "submission2_id": "s438273713", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r=int(input())\ng=int(input())\nprint((g-r)*2+g)", "code2": "r=int(input())\ng=int(input())\nprint((g-r)*2+r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554948229", "date2": "1554948242", "bleu_score": "0.9604077584115635", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n0\n", "actual_output": "-9000\n", "expected_output": "-4500\n", "anno_code": ["r=int(input()) # (0): r=4500\ng=int(input()) # (1): g=0\nprint((g-r)*2+g)"], "anno_status": [true], "diff_content": " r=int(input())\n g=int(input())\n-print((g-r)*2+g)\n+print((g-r)*2+r)\n", "FL_content": " r=int(input())\n g=int(input())\n-print((g-r)*2+g)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u878138257", "problem_id": "p03563", "submission1_id": "s312706721", "submission2_id": "s232087242", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = int(input())\nprint(b*b-a)", "code2": "a = int(input())\nb = int(input())\nprint(int(b*2-a))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552686671", "date2": "1552686732", "bleu_score": "0.8307062103367787", "code1_test_status": [0, 0, 0, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 102, "input": "2002\n33\n", "actual_output": "-913\n", "expected_output": "-1936\n\n", "anno_code": ["a = int(input()) # (0): a=2002\nb = int(input()) # (1): b=33\nprint(b*b-a)"], "anno_status": [true], "diff_content": " a = int(input())\n b = int(input())\n-print(b*b-a)\n+print(int(b*2-a))\n+\n", "FL_content": " a = int(input())\n b = int(input())\n-print(b*b-a)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u790877102", "problem_id": "p03563", "submission1_id": "s850165090", "submission2_id": "s164251043", "status1": "Wrong Answer", "status2": "Accepted", "code1": "R = int(input())\nG = int(input())\n\nW = R + R - G\n\nprint(W)", "code2": "R = int(input())\nG = int(input())\n\nW = G+G-R\n\nprint(W)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1538621633", "date2": "1538621717", "bleu_score": "0.8338766509952525", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "2002\n87\n", "actual_output": "3917\n", "expected_output": "-1828\n\n", "anno_code": ["R = int(input()) # (0): R=2002\nG = int(input()) # (1): G=87\n\nW = R + R - G # (2): W=3917\n\nprint(W)"], "anno_status": [true], "diff_content": " R = int(input())\n G = int(input())\n \n-W = R + R - G\n+W = G+G-R\n \n print(W)\n+\n", "FL_content": " R = int(input())\n G = int(input())\n \n-W = R + R - G\n \n print(W)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u569742427", "problem_id": "p03563", "submission1_id": "s663626956", "submission2_id": "s346758277", "status1": "Wrong Answer", "status2": "Accepted", "code1": "R=float(input())\nG=float(input())\n\nprint(G*2-R)\n", "code2": "R=int(input())\nG=int(input())\n\nprint(G*2-R)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549135368", "date2": "1549135435", "bleu_score": "0.7656014836025073", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n12\n", "actual_output": "-4476.0\n", "expected_output": "-4476\n\n", "anno_code": ["R=float(input()) # (0): R=4500.0\nG=float(input()) # (1): G=12.0\n\nprint(G*2-R)\n"], "anno_status": [true], "diff_content": "-R=float(input())\n-G=float(input())\n+R=int(input())\n+G=int(input())\n \n print(G*2-R)\n \n", "FL_content": "-R=float(input())\n-G=float(input())\n \n print(G*2-R)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u045408189", "problem_id": "p03563", "submission1_id": "s405617852", "submission2_id": "s835519223", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r=float(input())\ng=float(input())\nprint(2*g-r)", "code2": "r=float(input())\ng=float(input())\nprint(int(2*g-r))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567080385", "date2": "1567080561", "bleu_score": "0.8811259024000274", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "2002\n-15\n", "actual_output": "-2032.0\n", "expected_output": "-2032\n\n", "anno_code": ["r=float(input()) # (0): r=2002.0\ng=float(input()) # (1): g=-15.0\nprint(2*g-r)"], "anno_status": [true], "diff_content": " r=float(input())\n g=float(input())\n-print(2*g-r)\n+print(int(2*g-r))\n+\n", "FL_content": " r=float(input())\n g=float(input())\n-print(2*g-r)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u147808483", "problem_id": "p03563", "submission1_id": "s924594991", "submission2_id": "s649999670", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nb=int(input())\nprint(a+b/2)", "code2": "print(-int(input())+2*int(input()))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586320701", "date2": "1586320928", "bleu_score": "0.633017102707685", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n-19\n", "actual_output": "4490.5\n", "expected_output": "-4538\n\n", "anno_code": ["a=int(input()) # (0): a=4500\nb=int(input()) # (1): b=-19\nprint(a+b/2)"], "anno_status": [true], "diff_content": "-a=int(input())\n-b=int(input())\n-print(a+b/2)\n+print(-int(input())+2*int(input()))\n", "FL_content": "-a=int(input())\n-b=int(input())\n-print(a+b/2)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 3 }, { "user_id": "u331036636", "problem_id": "p03563", "submission1_id": "s764346379", "submission2_id": "s975431438", "status1": "Wrong Answer", "status2": "Accepted", "code1": "nr = float(input())\np = float(input())\nprint((p-nr)+p)", "code2": "nr = int(input())\np = int(input())\nprint((p-nr)+p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1532202040", "date2": "1532202131", "bleu_score": "0.7875028735757115", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "2002\n-7\n", "actual_output": "-2016.0\n", "expected_output": "-2016\n\n", "anno_code": ["nr = float(input()) # (0): nr=2002.0\np = float(input()) # (1): p=-7.0\nprint((p-nr)+p)"], "anno_status": [true], "diff_content": "-nr = float(input())\n-p = float(input())\n+nr = int(input())\n+p = int(input())\n print((p-nr)+p)\n", "FL_content": "-nr = float(input())\n-p = float(input())\n print((p-nr)+p)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u634079249", "problem_id": "p03563", "submission1_id": "s527906073", "submission2_id": "s368610882", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport os\n\n\ndef main():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n\n R = float(sys.stdin.readline().rstrip())\n G = float(sys.stdin.readline().rstrip())\n print(R+(G-R)*2)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\nimport os\n\n\ndef main():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n\n R = float(sys.stdin.readline().rstrip())\n G = float(sys.stdin.readline().rstrip())\n print(int(R+(G-R)*2))\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583894279", "date2": "1583894296", "bleu_score": "0.9779082473405996", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n13\n", "actual_output": "-4474.0\n", "expected_output": "-4474\n\n", "anno_code": ["import sys\nimport os\n\n\ndef main(): # (0): main=\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n\n R = float(sys.stdin.readline().rstrip())\n G = float(sys.stdin.readline().rstrip())\n print(R+(G-R)*2)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n import os\n \n \n def main():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n \n R = float(sys.stdin.readline().rstrip())\n G = float(sys.stdin.readline().rstrip())\n- print(R+(G-R)*2)\n+ print(int(R+(G-R)*2))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import sys\n import os\n \n \n def main():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n \n R = float(sys.stdin.readline().rstrip())\n G = float(sys.stdin.readline().rstrip())\n- print(R+(G-R)*2)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u374802266", "problem_id": "p03563", "submission1_id": "s626516618", "submission2_id": "s138970464", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(-2*int(input())+int(input()))\n", "code2": "a,b=int(input()),int(input())\nprint(2*b-a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564508184", "date2": "1564508363", "bleu_score": "0.6673703379820295", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n3\n", "actual_output": "-8997\n", "expected_output": "-4494\n\n", "anno_code": ["print(-2*int(input())+int(input()))\n"], "anno_status": [true], "diff_content": "-print(-2*int(input())+int(input()))\n-\n+a,b=int(input()),int(input())\n+print(2*b-a)\n", "FL_content": "-print(-2*int(input())+int(input()))\n-\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u813238682", "problem_id": "p03563", "submission1_id": "s094637307", "submission2_id": "s612906791", "status1": "Wrong Answer", "status2": "Accepted", "code1": "R = float(input())\nG = float(input())\nans = 2 * G -R\nprint(ans)", "code2": "R = int(input())\nG = int(input())\nans = (2 * G) -R\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1509238983", "date2": "1509240883", "bleu_score": "0.7673117765930841", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "2002\n-17\n", "actual_output": "-2036.0\n", "expected_output": "-2036\n\n", "anno_code": ["R = float(input()) # (0): R=2002.0\nG = float(input()) # (1): G=-17.0\nans = 2 * G -R # (2): ans=-2036.0\nprint(ans)"], "anno_status": [true], "diff_content": "-R = float(input())\n-G = float(input())\n-ans = 2 * G -R\n+R = int(input())\n+G = int(input())\n+ans = (2 * G) -R\n print(ans)\n", "FL_content": "-R = float(input())\n-G = float(input())\n-ans = 2 * G -R\n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 4 }, { "user_id": "u493130708", "problem_id": "p03563", "submission1_id": "s518157337", "submission2_id": "s409793862", "status1": "Wrong Answer", "status2": "Accepted", "code1": "R = int(input())\nG = int(input())\n\nprint(R+(G-R)**2)", "code2": "R = int(input())\nG = int(input())\n\nprint(R+(G-R)*2)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589357136", "date2": "1589357436", "bleu_score": "0.964828028508443", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "2002\n3\n", "actual_output": "3998003\n", "expected_output": "-1996\n\n", "anno_code": ["R = int(input()) # (0): R=2002\nG = int(input()) # (1): G=3\n\nprint(R+(G-R)**2)"], "anno_status": [true], "diff_content": " R = int(input())\n G = int(input())\n \n-print(R+(G-R)**2)\n+print(R+(G-R)*2)\n+\n", "FL_content": " R = int(input())\n G = int(input())\n \n-print(R+(G-R)**2)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u823044869", "problem_id": "p03563", "submission1_id": "s303312001", "submission2_id": "s493006807", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r = int(input())\ng = int(input())\n\nif rg:\n print(2*abs(r-g)-r)\nelse:\n print(r)\n", "code2": "r = int(input())\ng = int(input())\n\nif rg:\n print(r-2*abs(r-g))\nelse:\n print(r)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578433063", "date2": "1578433092", "bleu_score": "0.9179591705338509", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "2002\n-9\n", "actual_output": "2020\n", "expected_output": "-2020\n\n", "anno_code": ["r = int(input()) # (0): r=2002\ng = int(input()) # (1): g=-9\n\nif rg: # (3): NO CHANGE\n print(2*abs(r-g)-r)\nelse:\n print(r)\n"], "anno_status": [true], "diff_content": " r = int(input())\n g = int(input())\n \n if rg:\n- print(2*abs(r-g)-r)\n+ print(r-2*abs(r-g))\n else:\n print(r)\n \n", "FL_content": " r = int(input())\n g = int(input())\n \n if rg:\n- print(2*abs(r-g)-r)\n else:\n print(r)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u075155299", "problem_id": "p03563", "submission1_id": "s126662027", "submission2_id": "s007967347", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r=int(input())\ng=int(input())\n\nprint((g-r)/2)", "code2": "r=int(input())\ng=int(input())\n\nprint(2*g-r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575654885", "date2": "1575655136", "bleu_score": "0.8781238536005869", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n-19\n", "actual_output": "-2259.5\n", "expected_output": "-4538\n\n", "anno_code": ["r=int(input()) # (0): r=4500\ng=int(input()) # (1): g=-19\n\nprint((g-r)/2)"], "anno_status": [true], "diff_content": " r=int(input())\n g=int(input())\n \n-print((g-r)/2)\n+print(2*g-r)\n", "FL_content": " r=int(input())\n g=int(input())\n \n-print((g-r)/2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u450883456", "problem_id": "p03563", "submission1_id": "s325532931", "submission2_id": "s590487605", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = int(input())\nprint(2*a-b)", "code2": "a = int(input())\nb = int(input())\nprint(2*b-a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557372441", "date2": "1557372526", "bleu_score": "0.9309871835665661", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n-26\n", "actual_output": "9026\n", "expected_output": "-4552\n\n", "anno_code": ["a = int(input()) # (0): a=4500\nb = int(input()) # (1): b=-26\nprint(2*a-b)"], "anno_status": [true], "diff_content": " a = int(input())\n b = int(input())\n-print(2*a-b)\n+print(2*b-a)\n", "FL_content": " a = int(input())\n b = int(input())\n-print(2*a-b)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u319984556", "problem_id": "p03563", "submission1_id": "s837149104", "submission2_id": "s104407317", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(-(int(input())+int(input()))/2)", "code2": "print(-int(input())+2*int(input()))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584257739", "date2": "1584257943", "bleu_score": "0.8043114420483283", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n-28\n", "actual_output": "-2236.0\n", "expected_output": "-4556\n\n", "anno_code": ["print(-(int(input())+int(input()))/2)"], "anno_status": [true], "diff_content": "-print(-(int(input())+int(input()))/2)\n+print(-int(input())+2*int(input()))\n", "FL_content": "-print(-(int(input())+int(input()))/2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u788856752", "problem_id": "p03563", "submission1_id": "s577567845", "submission2_id": "s188094420", "status1": "Wrong Answer", "status2": "Accepted", "code1": "R = float(input())\nG = float(input())\n\nprint(2 * G - R)\n", "code2": "R = int(input())\nG = int(input())\n\nprint(2 * G - R)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556215797", "date2": "1556216039", "bleu_score": "0.7954259279548015", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "2002\n2017\n", "actual_output": "2032.0\n", "expected_output": "2032\n", "anno_code": ["R = float(input()) # (0): R=2002.0\nG = float(input()) # (1): G=2017.0\n\nprint(2 * G - R)\n"], "anno_status": [true], "diff_content": "-R = float(input())\n-G = float(input())\n+R = int(input())\n+G = int(input())\n \n print(2 * G - R)\n \n", "FL_content": "-R = float(input())\n-G = float(input())\n \n print(2 * G - R)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u385244248", "problem_id": "p03563", "submission1_id": "s465535063", "submission2_id": "s579044028", "status1": "Wrong Answer", "status2": "Accepted", "code1": "R = int(input())\nG = int(input())\nprint(3*G -2*R)", "code2": "R = int(input())\nG = int(input())\nprint(2*G -R)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569101313", "date2": "1569101416", "bleu_score": "0.8871308750427842", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "4500\n127\n", "actual_output": "-8619\n", "expected_output": "-4246\n\n", "anno_code": ["R = int(input()) # (0): R=4500\nG = int(input()) # (1): G=127\nprint(3*G -2*R)"], "anno_status": [true], "diff_content": " R = int(input())\n G = int(input())\n-print(3*G -2*R)\n+print(2*G -R)\n", "FL_content": " R = int(input())\n G = int(input())\n-print(3*G -2*R)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u717626627", "problem_id": "p03563", "submission1_id": "s833652489", "submission2_id": "s383545204", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r = int(input())\ng = int(input())\n\nprint(abs(g - r)*2 + min(g,r))", "code2": "r = int(input())\ng = int(input())\n\nprint((g - r)*2 + r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566598126", "date2": "1566598186", "bleu_score": "0.789666008558229", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "2002\n-17\n", "actual_output": "4021\n", "expected_output": "-2036\n\n", "anno_code": ["r = int(input()) # (0): r=2002\ng = int(input()) # (1): g=-17\n\nprint(abs(g - r)*2 + min(g,r))"], "anno_status": [true], "diff_content": " r = int(input())\n g = int(input())\n \n-print(abs(g - r)*2 + min(g,r))\n+print((g - r)*2 + r)\n", "FL_content": " r = int(input())\n g = int(input())\n \n-print(abs(g - r)*2 + min(g,r))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u550535134", "problem_id": "p03573", "submission1_id": "s863313216", "submission2_id": "s926205984", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nprint(\"A\" if B == C else \"B\" if A == C else \"C\")", "code2": "A, B, C = map(int, input().split())\nprint(A if B == C else B if A == C else C)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587247343", "date2": "1587247445", "bleu_score": "0.8520210210493928", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "1 1 22\n", "actual_output": "C\n", "expected_output": "22\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=1, B=1, C=22\nprint(\"A\" if B == C else \"B\" if A == C else \"C\")"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n-print(\"A\" if B == C else \"B\" if A == C else \"C\")\n+print(A if B == C else B if A == C else C)\n+\n", "FL_content": " A, B, C = map(int, input().split())\n-print(\"A\" if B == C else \"B\" if A == C else \"C\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u066455063", "problem_id": "p03573", "submission1_id": "s748937333", "submission2_id": "s288422639", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\n\nif A == B:\n print(C)\n\nelif B == C:\n print(A)\n\nelse:\n print(A)\n", "code2": "A, B, C = map(int, input().split())\n\nif A == B:\n print(C)\n\nelif B == C:\n print(A)\n\nelse:\n print(B)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577587129", "date2": "1577587160", "bleu_score": "0.9787616489037364", "code1_test_status": [0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 83, "input": "5 6 5\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=5, B=6, C=5\n\nif A == B: # (1): NO CHANGE\n print(C)\n\nelif B == C: # (2): NO CHANGE\n print(A)\n\nelse:\n print(A)\n"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n \n if A == B:\n print(C)\n \n elif B == C:\n print(A)\n \n else:\n- print(A)\n+ print(B)\n \n", "FL_content": " A, B, C = map(int, input().split())\n \n if A == B:\n print(C)\n \n elif B == C:\n print(A)\n \n else:\n- print(A)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u467307100", "problem_id": "p03573", "submission1_id": "s070918481", "submission2_id": "s084810997", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int,input().split())\nif a == b:\n print(a)\nif b == c:\n print(b)\nif a ==c:\n print(c)", "code2": "a, b, c = map(int,input().split())\nif a == b:\n print(c)\nif b == c:\n print(a)\nif a ==c:\n print(b)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581949598", "date2": "1581949660", "bleu_score": "0.9922574821403904", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "2 2 63\n", "actual_output": "2\n", "expected_output": "63\n\n", "anno_code": ["a, b, c = map(int,input().split()) # (0): a=2, b=2, c=63\nif a == b: # (1): NO CHANGE\n print(a) # (2): NO CHANGE\nif b == c: # (3): NO CHANGE\n print(b)\nif a ==c:\n print(c)"], "anno_status": [true], "diff_content": " a, b, c = map(int,input().split())\n if a == b:\n- print(a)\n+ print(c)\n if b == c:\n- print(b)\n+ print(a)\n if a ==c:\n- print(c)\n+ print(b)\n", "FL_content": " a, b, c = map(int,input().split())\n if a == b:\n- print(a)\n if b == c:\n- print(b)\n if a ==c:\n- print(c)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u992910889", "problem_id": "p03573", "submission1_id": "s297210170", "submission2_id": "s787364186", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=list(map(int,input().split()))\nfor i in range(2):\n if S.count(S[i])==1:\n print(S[i])", "code2": "S=list(map(int,input().split()))\nfor i in range(3):\n if S.count(S[i])==1:\n print(S[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582500390", "date2": "1582500471", "bleu_score": "0.9733254474339004", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 33, "total_score": 83, "input": "2 2 41\n", "actual_output": "no output\n", "expected_output": "41\n\n", "anno_code": ["S=list(map(int,input().split())) # (0): S=[2, 2, 41]\nfor i in range(2): # (1): i=0 (3): i=1\n if S.count(S[i])==1: # (2): NO CHANGE (4): NO CHANGE\n print(S[i])"], "anno_status": [true], "diff_content": " S=list(map(int,input().split()))\n-for i in range(2):\n+for i in range(3):\n if S.count(S[i])==1:\n print(S[i])\n", "FL_content": " S=list(map(int,input().split()))\n-for i in range(2):\n if S.count(S[i])==1:\n print(S[i])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u528807020", "problem_id": "p03573", "submission1_id": "s069412762", "submission2_id": "s043235855", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nA,B,C = [int(i) for i in input().split()]\nif A == B:\n print(\"C\")\nelif A == C:\n print(\"B\")\nelif B == C:\n print(\"A\")", "code2": "A,B,C = [int(i) for i in input().split()]\nif A == B:\n print(C)\nelif A == C:\n print(B)\nelif B == C:\n print(A)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558108631", "date2": "1558108705", "bleu_score": "0.8930696971628176", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "1 1 26\n", "actual_output": "C\n", "expected_output": "26\n\n", "anno_code": ["\nA,B,C = [int(i) for i in input().split()] # (0): A=1, B=1, C=26\nif A == B: # (1): NO CHANGE\n print(\"C\")\nelif A == C:\n print(\"B\")\nelif B == C:\n print(\"A\")"], "anno_status": [true], "diff_content": "-\n A,B,C = [int(i) for i in input().split()]\n if A == B:\n- print(\"C\")\n+ print(C)\n elif A == C:\n- print(\"B\")\n+ print(B)\n elif B == C:\n- print(\"A\")\n+ print(A)\n", "FL_content": "-\n A,B,C = [int(i) for i in input().split()]\n if A == B:\n- print(\"C\")\n elif A == C:\n- print(\"B\")\n elif B == C:\n- print(\"A\")\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 8 }, { "user_id": "u470735879", "problem_id": "p03573", "submission1_id": "s121843444", "submission2_id": "s846145273", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\n\nif a == b:\n print(c)\nelif b == c:\n print(a)\nelse:\n print(a)", "code2": "a, b, c = map(int, input().split())\n \nif a == b:\n print(c)\nelif b == c:\n print(a)\nelse:\n print(b)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554681897", "date2": "1554682011", "bleu_score": "0.9590670674626737", "code1_test_status": [0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 83, "input": "5 14 5\n", "actual_output": "5\n", "expected_output": "14\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=5, b=14, c=5\n\nif a == b: # (1): NO CHANGE\n print(c)\nelif b == c: # (2): NO CHANGE\n print(a)\nelse:\n print(a)"], "anno_status": [true], "diff_content": " a, b, c = map(int, input().split())\n-\n+ \n if a == b:\n print(c)\n elif b == c:\n print(a)\n else:\n- print(a)\n+ print(b)\n", "FL_content": " a, b, c = map(int, input().split())\n-\n if a == b:\n print(c)\n elif b == c:\n print(a)\n else:\n- print(a)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u098968285", "problem_id": "p03573", "submission1_id": "s142784696", "submission2_id": "s359982017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\n\nif a == b or a == c:\n print(a)\nelse:\n print(b)\n", "code2": "\n\n\n\n\n\n\n\na, b, c = map(int, input().split())\n\nif a == b:\n print(c)\nelif b == c:\n print(a)\nelse:\n print(b)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508029341", "date2": "1508029445", "bleu_score": "0.7394684537255783", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "0 0 58\n", "actual_output": "0\n", "expected_output": "58\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=0, b=0, c=58\n\nif a == b or a == c: # (1): NO CHANGE\n print(a)\nelse:\n print(b)\n"], "anno_status": [true], "diff_content": "+\n+\n+\n+\n+\n+\n+\n+\n a, b, c = map(int, input().split())\n \n-if a == b or a == c:\n+if a == b:\n+ print(c)\n+elif b == c:\n print(a)\n else:\n print(b)\n \n", "FL_content": " a, b, c = map(int, input().split())\n \n-if a == b or a == c:\n print(a)\n else:\n print(b)\n \n", "added_lines": 11, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u290187182", "problem_id": "p03573", "submission1_id": "s888617582", "submission2_id": "s587104465", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\nif __name__ == '__main__':\n a = [int(i) for i in input().split()]\n bf =999\n for i in a:\n if bf == 999:\n bf =i\n elif bf != i:\n print(i)", "code2": "import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\nif __name__ == '__main__':\n a = [int(i) for i in input().split()]\n b = []\n\n for i in a:\n if i in b:\n b.remove(i)\n else:\n b.append(i)\n print(b[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585523415", "date2": "1585524688", "bleu_score": "0.8717682910143135", "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, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 68, "total_score": 83, "input": "-5 0 0\n", "actual_output": "0\n0\n", "expected_output": "-5\n\n", "anno_code": ["import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\nif __name__ == '__main__':\n a = [int(i) for i in input().split()]\n bf =999\n for i in a:\n if bf == 999:\n bf =i\n elif bf != i:\n print(i)"], "anno_status": [true], "diff_content": " import sys\n import copy\n import math\n import bisect\n import pprint\n import bisect\n from functools import reduce\n from copy import deepcopy\n from collections import deque\n \n if __name__ == '__main__':\n a = [int(i) for i in input().split()]\n- bf =999\n+ b = []\n+\n for i in a:\n- if bf == 999:\n- bf =i\n- elif bf != i:\n- print(i)\n+ if i in b:\n+ b.remove(i)\n+ else:\n+ b.append(i)\n+ print(b[0])\n", "FL_content": " import sys\n import copy\n import math\n import bisect\n import pprint\n import bisect\n from functools import reduce\n from copy import deepcopy\n from collections import deque\n \n if __name__ == '__main__':\n a = [int(i) for i in input().split()]\n- bf =999\n for i in a:\n- if bf == 999:\n- bf =i\n- elif bf != i:\n- print(i)\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 18 }, { "user_id": "u690536347", "problem_id": "p03573", "submission1_id": "s497469417", "submission2_id": "s046946658", "status1": "Wrong Answer", "status2": "Accepted", "code1": "l=list(map(int,input().split()))\nif l[0]!=l[1]:\n print(l[0])\nelse:\n print(l[2])", "code2": "l=list(sorted(map(int,input().split())))\nif l[0]!=l[1]:\n print(l[0])\nelse:\n print(l[2])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533090616", "date2": "1533090761", "bleu_score": "0.8896356748029378", "code1_test_status": [0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 83, "input": "5 27 5\n", "actual_output": "5\n", "expected_output": "27\n\n", "anno_code": ["l=list(map(int,input().split())) # (0): l=[5, 27, 5]\nif l[0]!=l[1]: # (1): NO CHANGE\n print(l[0])\nelse:\n print(l[2])"], "anno_status": [true], "diff_content": "-l=list(map(int,input().split()))\n+l=list(sorted(map(int,input().split())))\n if l[0]!=l[1]:\n print(l[0])\n else:\n print(l[2])\n+\n", "FL_content": "-l=list(map(int,input().split()))\n if l[0]!=l[1]:\n print(l[0])\n else:\n print(l[2])\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u086503932", "problem_id": "p03573", "submission1_id": "s736241070", "submission2_id": "s600385130", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C=map(int,input().split())\nprint(A)if A==B else print(B) if A==C else print(C) ", "code2": "A,B,C=map(int,input().split())\nprint(C)if A==B else print(B) if A==C else print(A) \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581457172", "date2": "1581457234", "bleu_score": "0.972385284530691", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 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, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 18, "total_score": 83, "input": "1 1 73\n", "actual_output": "1\n", "expected_output": "73\n\n", "anno_code": ["A,B,C=map(int,input().split()) # (0): A=1, B=1, C=73\nprint(A)if A==B else print(B) if A==C else print(C) "], "anno_status": [true], "diff_content": " A,B,C=map(int,input().split())\n-print(A)if A==B else print(B) if A==C else print(C) \n+print(C)if A==B else print(B) if A==C else print(A) \n+\n", "FL_content": " A,B,C=map(int,input().split())\n-print(A)if A==B else print(B) if A==C else print(C) \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u500279510", "problem_id": "p03573", "submission1_id": "s863571828", "submission2_id": "s564399837", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int,input().split())\nif A!=B and B==C:\n print(A)\nif A!=B and A==C:\n print(B)\nelse:\n print(C) ", "code2": "A, B, C = map(int,input().split())\nif B==C:\n print(A)\nif A==C:\n print(B)\nif A==B:\n print(C) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540142834", "date2": "1540142964", "bleu_score": "0.7981438300250132", "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, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 68, "total_score": 83, "input": "-48 100 100\n", "actual_output": "-48\n100\n", "expected_output": "-48\n\n", "anno_code": ["A, B, C = map(int,input().split()) # (0): A=-48, B=100, C=100\nif A!=B and B==C: # (1): NO CHANGE\n print(A) # (2): NO CHANGE\nif A!=B and A==C: # (3): NO CHANGE\n print(B)\nelse:\n print(C) "], "anno_status": [true], "diff_content": " A, B, C = map(int,input().split())\n-if A!=B and B==C:\n+if B==C:\n print(A)\n-if A!=B and A==C:\n+if A==C:\n print(B)\n-else:\n+if A==B:\n print(C) \n", "FL_content": " A, B, C = map(int,input().split())\n-if A!=B and B==C:\n print(A)\n-if A!=B and A==C:\n print(B)\n-else:\n print(C) \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u729133443", "problem_id": "p03573", "submission1_id": "s363270435", "submission2_id": "s741425167", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=list(input())\na.sort()\nprint(a[4] if a[2]==a[3] else a[2])", "code2": "a=input().split()\na.sort()\nprint(a[2] if a[0]==a[1] else a[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521532839", "date2": "1521532928", "bleu_score": "0.7161309825342999", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 83, "input": "1 1 15\n", "actual_output": "1\n", "expected_output": "15\n\n", "anno_code": ["a=list(input()) # (0): a=['1', ' ', '1', ' ', '1', '5']\na.sort() # (1): a=[' ', ' ', '1', '1', '1', '5']\nprint(a[4] if a[2]==a[3] else a[2])"], "anno_status": [true], "diff_content": "-a=list(input())\n+a=input().split()\n a.sort()\n-print(a[4] if a[2]==a[3] else a[2])\n+print(a[2] if a[0]==a[1] else a[0])\n", "FL_content": "-a=list(input())\n a.sort()\n-print(a[4] if a[2]==a[3] else a[2])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u117193815", "problem_id": "p03573", "submission1_id": "s232051202", "submission2_id": "s550372279", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int, input().split())\nif a==b:\n print(c)\nelse:\n print(a)", "code2": "a,b,c=map(int, input().split())\nif a==b:\n print(c)\nelif a==c:\n print(b)\nelse:\n print(a)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571781314", "date2": "1571781918", "bleu_score": "0.7429697071124194", "code1_test_status": [0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 83, "input": "5 27 5\n", "actual_output": "5\n", "expected_output": "27\n\n", "anno_code": ["a,b,c=map(int, input().split()) # (0): a=5, b=27, c=5\nif a==b: # (1): NO CHANGE\n print(c)\nelse:\n print(a)"], "anno_status": [true], "diff_content": " a,b,c=map(int, input().split())\n if a==b:\n print(c)\n+elif a==c:\n+ print(b)\n else:\n print(a)\n+\n", "FL_content": " a,b,c=map(int, input().split())\n if a==b:\n print(c)\n else:\n print(a)\n", "added_lines": 3, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u366886346", "problem_id": "p03573", "submission1_id": "s834604725", "submission2_id": "s877464181", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=list(map(int,input().split()))\nfor i in range(2):\n if a.count(a[i])!=1:\n del a[i]\nprint(int(a[0]))\n", "code2": "a=list(map(int,input().split()))\nfor i in a:\n if a.count(i)==1:\n ans=int(i)\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588499728", "date2": "1588499814", "bleu_score": "0.7141103674419668", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 33, "total_score": 83, "input": "2 2 41\n", "actual_output": "2\n", "expected_output": "41\n\n", "anno_code": ["a=list(map(int,input().split())) # (0): a=[2, 2, 41]\nfor i in range(2): # (1): i=0 (4): i=1 (6): NO CHANGE\n if a.count(a[i])!=1: # (2): NO CHANGE (5): NO CHANGE\n del a[i] # (3): a=[2, 41]\nprint(int(a[0]))\n"], "anno_status": [true], "diff_content": " a=list(map(int,input().split()))\n-for i in range(2):\n- if a.count(a[i])!=1:\n- del a[i]\n-print(int(a[0]))\n+for i in a:\n+ if a.count(i)==1:\n+ ans=int(i)\n+print(ans)\n \n", "FL_content": " a=list(map(int,input().split()))\n-for i in range(2):\n- if a.count(a[i])!=1:\n- del a[i]\n-print(int(a[0]))\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 6 }, { "user_id": "u441320782", "problem_id": "p03573", "submission1_id": "s945329750", "submission2_id": "s718729656", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = list(map(int,input().split()))\nresult = None\nfor i in set(x):\n if x.count(i)>1:\n result = i\nprint(result) ", "code2": "x = list(map(int,input().split()))\nresult = None\nfor i in set(x):\n if x.count(i)==1:\n result = i\nprint(result) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571630946", "date2": "1571631017", "bleu_score": "0.9698117965004673", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "-47 100 100\n", "actual_output": "100\n", "expected_output": "-47\n\n", "anno_code": ["x = list(map(int,input().split())) # (0): x=[-47, 100, 100]\nresult = None # (1): result=None\nfor i in set(x): # (2): i=-47 (4): i=100 (7): NO CHANGE\n if x.count(i)>1: # (3): NO CHANGE (5): NO CHANGE\n result = i # (6): result=100\nprint(result) "], "anno_status": [true], "diff_content": " x = list(map(int,input().split()))\n result = None\n for i in set(x):\n- if x.count(i)>1:\n+ if x.count(i)==1:\n result = i\n print(result) \n", "FL_content": " x = list(map(int,input().split()))\n result = None\n for i in set(x):\n- if x.count(i)>1:\n result = i\n print(result) \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u271176141", "problem_id": "p03573", "submission1_id": "s493924891", "submission2_id": "s844536103", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nA,B,C = map(int,input().split())\n\nif A == B:\n print(C)\nelif A == C:\n print(B)\nelse:\n print(C)", "code2": "\nA,B,C = map(int,input().split())\n\nif A == B:\n print(C)\nelif A == C:\n print(B)\nelse:\n print(A)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598324540", "date2": "1598324639", "bleu_score": "0.9827106619079922", "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, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 68, "total_score": 83, "input": "-23 100 100\n", "actual_output": "100\n", "expected_output": "-23\n\n", "anno_code": ["\nA,B,C = map(int,input().split()) # (0): A=-23, B=100, C=100\n\nif A == B: # (1): NO CHANGE\n print(C)\nelif A == C: # (2): NO CHANGE\n print(B)\nelse:\n print(C)"], "anno_status": [true], "diff_content": " \n A,B,C = map(int,input().split())\n \n if A == B:\n print(C)\n elif A == C:\n print(B)\n else:\n- print(C)\n+ print(A)\n", "FL_content": " \n A,B,C = map(int,input().split())\n \n if A == B:\n print(C)\n elif A == C:\n print(B)\n else:\n- print(C)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u661980786", "problem_id": "p03573", "submission1_id": "s421802268", "submission2_id": "s088547402", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int,input().split())\nif a == b:\n print(c)\nif a == c:\n print(b)\nelse:\n print(a)", "code2": "a,b,c = map(int,input().split())\nif a == b:\n print(c)\nelif a == c:\n print(b)\nelse:\n print(a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569126868", "date2": "1569126952", "bleu_score": "0.9646232151016901", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 33, "total_score": 83, "input": "1 1 21\n", "actual_output": "21\n1\n", "expected_output": "21\n\n", "anno_code": ["a,b,c = map(int,input().split()) # (0): a=1, b=1, c=21\nif a == b: # (1): NO CHANGE\n print(c) # (2): NO CHANGE\nif a == c: # (3): NO CHANGE\n print(b)\nelse:\n print(a)"], "anno_status": [true], "diff_content": " a,b,c = map(int,input().split())\n if a == b:\n print(c)\n-if a == c:\n+elif a == c:\n print(b)\n else:\n print(a)\n", "FL_content": " a,b,c = map(int,input().split())\n if a == b:\n print(c)\n-if a == c:\n print(b)\n else:\n print(a)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u740767776", "problem_id": "p03573", "submission1_id": "s980487369", "submission2_id": "s685298889", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input().split())\nif s[0] == s[1]:\n print(int(s[2]))\nelif s[1] == s[2]:\n print(int(s[0]))\nelse:\n print(int(s[0]))\n \n ", "code2": "s = list(input().split())\nif s[0] == s[1]:\n print(int(s[2]))\nelif s[1] == s[2]:\n print(int(s[0]))\nelse:\n print(int(s[1]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564950034", "date2": "1564950149", "bleu_score": "0.933197523713614", "code1_test_status": [0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 83, "input": "5 29 5\n", "actual_output": "5\n", "expected_output": "29\n\n", "anno_code": ["s = list(input().split()) # (0): s=['5', '29', '5']\nif s[0] == s[1]: # (1): NO CHANGE\n print(int(s[2]))\nelif s[1] == s[2]: # (2): NO CHANGE\n print(int(s[0]))\nelse:\n print(int(s[0]))\n \n "], "anno_status": [true], "diff_content": " s = list(input().split())\n if s[0] == s[1]:\n print(int(s[2]))\n elif s[1] == s[2]:\n print(int(s[0]))\n else:\n- print(int(s[0]))\n- \n- \n+ print(int(s[1]))\n", "FL_content": " s = list(input().split())\n if s[0] == s[1]:\n print(int(s[2]))\n elif s[1] == s[2]:\n print(int(s[0]))\n else:\n- print(int(s[0]))\n- \n- \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u860002137", "problem_id": "p03573", "submission1_id": "s093598074", "submission2_id": "s732363821", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\nprint(c if a==b else b if a==c else c)", "code2": "a, b, c = map(int, input().split())\nprint(c if a==b else b if a==c else a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590120318", "date2": "1590123212", "bleu_score": "0.9757661063776366", "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, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 68, "total_score": 83, "input": "-12 100 100\n", "actual_output": "100\n", "expected_output": "-12\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=-12, b=100, c=100\nprint(c if a==b else b if a==c else c)"], "anno_status": [true], "diff_content": " a, b, c = map(int, input().split())\n-print(c if a==b else b if a==c else c)\n+print(c if a==b else b if a==c else a)\n", "FL_content": " a, b, c = map(int, input().split())\n-print(c if a==b else b if a==c else c)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u389910364", "problem_id": "p03573", "submission1_id": "s130099978", "submission2_id": "s870010014", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import functools\n\nimport os\n\nINF = float('inf')\n\n\ndef inp():\n return int(input())\n\n\ndef inpf():\n return float(input())\n\n\ndef inps():\n return input()\n\n\ndef inl():\n return list(map(int, input().split()))\n\n\ndef inlf():\n return list(map(float, input().split()))\n\n\ndef inls():\n return input().split()\n\n\ndef inpm(line):\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line):\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line):\n return [inps() for _ in range(line)]\n\n\ndef inlm(line):\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line):\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line):\n return [inls() for _ in range(line)]\n\n\ndef debug(fn):\n if not os.getenv('LOCAL'):\n return fn\n\n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n print('DEBUG: {}({}) -> '.format(\n fn.__name__,\n ', '.join(\n list(map(str, args)) +\n ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]\n )\n ), end='')\n ret = fn(*args, **kwargs)\n print(ret)\n return ret\n\n return wrapper\n\na, b, c = inl()\nif a == b:\n print(c)\nelif a ==c:\n print(b)\nelse:print(b)\n ", "code2": "import functools\n\nimport os\n\nINF = float('inf')\n\n\ndef inp():\n return int(input())\n\n\ndef inpf():\n return float(input())\n\n\ndef inps():\n return input()\n\n\ndef inl():\n return list(map(int, input().split()))\n\n\ndef inlf():\n return list(map(float, input().split()))\n\n\ndef inls():\n return input().split()\n\n\ndef inpm(line):\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line):\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line):\n return [inps() for _ in range(line)]\n\n\ndef inlm(line):\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line):\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line):\n return [inls() for _ in range(line)]\n\n\ndef debug(fn):\n if not os.getenv('LOCAL'):\n return fn\n\n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n print('DEBUG: {}({}) -> '.format(\n fn.__name__,\n ', '.join(\n list(map(str, args)) +\n ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]\n )\n ), end='')\n ret = fn(*args, **kwargs)\n print(ret)\n return ret\n\n return wrapper\n\na, b, c = inl()\nif a == b:\n print(c)\nelif a ==c:\n print(b)\nelse:print(a)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555987696", "date2": "1555987747", "bleu_score": "0.9898471029663564", "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, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 68, "total_score": 83, "input": "-3 1 1\n", "actual_output": "1\n", "expected_output": "-3\n\n", "anno_code": ["import functools\n\nimport os\n\nINF = float('inf') # (0): INF=inf\n\n\ndef inp(): # (1): inp=\n return int(input())\n\n\ndef inpf(): # (2): inpf=\n return float(input())\n\n\ndef inps(): # (3): inps=\n return input()\n\n\ndef inl(): # (4): inl=\n return list(map(int, input().split()))\n\n\ndef inlf(): # (5): inlf=\n return list(map(float, input().split()))\n\n\ndef inls(): # (6): inls=\n return input().split()\n\n\ndef inpm(line): # (7): inpm=\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line): # (8): inpfm=\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line): # (9): inpsm=\n return [inps() for _ in range(line)]\n\n\ndef inlm(line): # (10): inlm=\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line): # (11): inlfm=\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line): # (12): inlsm=\n return [inls() for _ in range(line)]\n\n\ndef debug(fn): # (13): debug=\n if not os.getenv('LOCAL'):\n return fn\n\n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n print('DEBUG: {}({}) -> '.format(\n fn.__name__,\n ', '.join(\n list(map(str, args)) +\n ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]\n )\n ), end='')\n ret = fn(*args, **kwargs)\n print(ret)\n return ret\n\n return wrapper\n\na, b, c = inl() # (14): a=-3, b=1, c=1\nif a == b: # (15): NO CHANGE\n print(c)\nelif a ==c: # (16): NO CHANGE\n print(b)\nelse:print(b)\n "], "anno_status": [true], "diff_content": " import functools\n \n import os\n \n INF = float('inf')\n \n \n def inp():\n return int(input())\n \n \n def inpf():\n return float(input())\n \n \n def inps():\n return input()\n \n \n def inl():\n return list(map(int, input().split()))\n \n \n def inlf():\n return list(map(float, input().split()))\n \n \n def inls():\n return input().split()\n \n \n def inpm(line):\n return [inp() for _ in range(line)]\n \n \n def inpfm(line):\n return [inpf() for _ in range(line)]\n \n \n def inpsm(line):\n return [inps() for _ in range(line)]\n \n \n def inlm(line):\n return [inl() for _ in range(line)]\n \n \n def inlfm(line):\n return [inlf() for _ in range(line)]\n \n \n def inlsm(line):\n return [inls() for _ in range(line)]\n \n \n def debug(fn):\n if not os.getenv('LOCAL'):\n return fn\n \n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n print('DEBUG: {}({}) -> '.format(\n fn.__name__,\n ', '.join(\n list(map(str, args)) +\n ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]\n )\n ), end='')\n ret = fn(*args, **kwargs)\n print(ret)\n return ret\n \n return wrapper\n \n a, b, c = inl()\n if a == b:\n print(c)\n elif a ==c:\n print(b)\n-else:print(b)\n- \n+else:print(a)\n+\n", "FL_content": " import functools\n \n import os\n \n INF = float('inf')\n \n \n def inp():\n return int(input())\n \n \n def inpf():\n return float(input())\n \n \n def inps():\n return input()\n \n \n def inl():\n return list(map(int, input().split()))\n \n \n def inlf():\n return list(map(float, input().split()))\n \n \n def inls():\n return input().split()\n \n \n def inpm(line):\n return [inp() for _ in range(line)]\n \n \n def inpfm(line):\n return [inpf() for _ in range(line)]\n \n \n def inpsm(line):\n return [inps() for _ in range(line)]\n \n \n def inlm(line):\n return [inl() for _ in range(line)]\n \n \n def inlfm(line):\n return [inlf() for _ in range(line)]\n \n \n def inlsm(line):\n return [inls() for _ in range(line)]\n \n \n def debug(fn):\n if not os.getenv('LOCAL'):\n return fn\n \n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n print('DEBUG: {}({}) -> '.format(\n fn.__name__,\n ', '.join(\n list(map(str, args)) +\n ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]\n )\n ), end='')\n ret = fn(*args, **kwargs)\n print(ret)\n return ret\n \n return wrapper\n \n a, b, c = inl()\n if a == b:\n print(c)\n elif a ==c:\n print(b)\n-else:print(b)\n- \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 81 }, { "user_id": "u279605379", "problem_id": "p02297", "submission1_id": "s391171527", "submission2_id": "s898564732", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def cross(a,b):return a[0]*b[1] - a[1]*b[0]\n \nn = int(input())\nP =[]\ns = 0\nfor i in range(n):P.append([int(i) for i in input().split()])\nfor i in range(n-1):s += cross(P[i],P[i+1])\nprint(s/2)", "code2": "def cross(a,b):return a[0]*b[1] - a[1]*b[0]\n \nn = int(input())\nP =[]\ns = 0\nfor i in range(n):P.append([int(i) for i in input().split()])\nP = P*2\nfor i in range(n):s += cross(P[i],P[i+1])\nprint(abs(s)/2)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1503641850", "date2": "1503642550", "bleu_score": "0.9166118477002536", "code1_test_status": [1, 1, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 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], "code1_test_score": 15, "total_score": 102, "input": "3\n2 0\n2 2\n-1 1\n", "actual_output": "4.0\n", "expected_output": "3.0\n\n", "anno_code": ["def cross(a,b):return a[0]*b[1] - a[1]*b[0]\n \nn = int(input()) # (0): n=3\nP =[] # (1): P=[]\ns = 0 # (2): s=0\nfor i in range(n):P.append([int(i) for i in input().split()]) # (3): P=[[2, 0]], i=0 (4): P, i=1 ... (6): NO CHANGE\nfor i in range(n-1):s += cross(P[i],P[i+1]) # (7): s=4, i=0 (8): s=8, i=1 (9): NO CHANGE\nprint(s/2)"], "anno_status": [true], "diff_content": " def cross(a,b):return a[0]*b[1] - a[1]*b[0]\n \n n = int(input())\n P =[]\n s = 0\n for i in range(n):P.append([int(i) for i in input().split()])\n-for i in range(n-1):s += cross(P[i],P[i+1])\n-print(s/2)\n+P = P*2\n+for i in range(n):s += cross(P[i],P[i+1])\n+print(abs(s)/2)\n", "FL_content": " def cross(a,b):return a[0]*b[1] - a[1]*b[0]\n \n n = int(input())\n P =[]\n s = 0\n for i in range(n):P.append([int(i) for i in input().split()])\n-for i in range(n-1):s += cross(P[i],P[i+1])\n-print(s/2)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u766163292", "problem_id": "p02297", "submission1_id": "s238896185", "submission2_id": "s781601683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport cmath\n\n\ndef outer_product(v1, v2):\n return v1.real * v2.imag - v1.imag * v2.real\n\n\ndef in_place_sort_points_ccw(points):\n points.sort(key=cmath.phase)\n\n\ndef area_polygon(n, points):\n in_place_sort_points_ccw(points)\n s = sum(outer_product(points[i], points[(i + 1) % n])\n for i in range(n)) / 2.0\n return s\n\n\ndef main():\n n = int(input())\n ps = [complex(*map(float, input().split())) for _ in range(n)]\n s = area_polygon(n, ps)\n print(\"{:.1f}\".format(s))\n\n\nif __name__ == '__main__':\n main()", "code2": "\n\nimport cmath\n\n\ndef outer_product(v1, v2):\n return v1.real * v2.imag - v1.imag * v2.real\n\n\ndef area_polygon(n, points):\n s = sum(outer_product(points[i], points[(i + 1) % n])\n for i in range(n)) / 2.0\n return s\n\n\ndef main():\n n = int(input())\n ps = [complex(*map(float, input().split())) for _ in range(n)]\n s = area_polygon(n, ps)\n print(\"{:.1f}\".format(s))\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1471426448", "date2": "1471427533", "bleu_score": "0.774745711523372", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 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, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 73, "total_score": 102, "input": "4\n0 0\n-1 -1\n1 16\n-6 3\n", "actual_output": "54.0\n", "expected_output": "42.0\n\n", "anno_code": ["\n\nimport cmath\n\n\ndef outer_product(v1, v2): # (0): outer_product=\n return v1.real * v2.imag - v1.imag * v2.real\n\n\ndef in_place_sort_points_ccw(points): # (1): in_place_sort_points_ccw=\n points.sort(key=cmath.phase)\n\n\ndef area_polygon(n, points): # (2): area_polygon=\n in_place_sort_points_ccw(points)\n s = sum(outer_product(points[i], points[(i + 1) % n])\n for i in range(n)) / 2.0\n return s\n\n\ndef main(): # (3): main=\n n = int(input())\n ps = [complex(*map(float, input().split())) for _ in range(n)]\n s = area_polygon(n, ps)\n print(\"{:.1f}\".format(s))\n\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n import cmath\n \n \n def outer_product(v1, v2):\n return v1.real * v2.imag - v1.imag * v2.real\n \n \n-def in_place_sort_points_ccw(points):\n- points.sort(key=cmath.phase)\n-\n-\n def area_polygon(n, points):\n- in_place_sort_points_ccw(points)\n s = sum(outer_product(points[i], points[(i + 1) % n])\n for i in range(n)) / 2.0\n return s\n \n \n def main():\n n = int(input())\n ps = [complex(*map(float, input().split())) for _ in range(n)]\n s = area_polygon(n, ps)\n print(\"{:.1f}\".format(s))\n \n \n if __name__ == '__main__':\n main()\n", "FL_content": " \n \n import cmath\n \n \n def outer_product(v1, v2):\n return v1.real * v2.imag - v1.imag * v2.real\n \n \n-def in_place_sort_points_ccw(points):\n- points.sort(key=cmath.phase)\n-\n-\n def area_polygon(n, points):\n- in_place_sort_points_ccw(points)\n s = sum(outer_product(points[i], points[(i + 1) % n])\n for i in range(n)) / 2.0\n return s\n \n \n def main():\n n = int(input())\n ps = [complex(*map(float, input().split())) for _ in range(n)]\n s = area_polygon(n, ps)\n print(\"{:.1f}\".format(s))\n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 5, "code1_lines": 29 }, { "user_id": "u126478680", "problem_id": "p02297", "submission1_id": "s015429141", "submission2_id": "s756681432", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nclass Vector():\n def __init__(self, x, y):\n self.x = x\n self.y = y\n\n def inner_product(self, vec):\n return self.x*vec.x + self.y*vec.y\n\n def outer_product(self, vec):\n return self.x*vec.y - self.y*vec.x\n\n def norm(self):\n return math.sqrt(self.x**2 + self.y**2)\n\nn = int(input())\npoints = []\nfor i in range(n):\n x, y = list(map(int, input().split(' ')))\n points.append(Vector(x, y))\npoints.append(points[0])\n\narea = 0\nfor i in range(n-1):\n a, b = points[i], points[i+1]\n if (a.x == 0 and a.y == 0) or (b.x == 0 and b.y == 0): continue\n theta = math.atan2(a.outer_product(b), a.inner_product(b))\n if theta > 0:\n area += abs(a.outer_product(b))/2\n elif theta < 0:\n area -= abs(a.outer_product(b))/2\nprint(area)\n", "code2": "import math\n\nclass Vector():\n def __init__(self, x, y):\n self.x = x\n self.y = y\n\n def inner_product(self, vec):\n return self.x*vec.x + self.y*vec.y\n\n def outer_product(self, vec):\n return self.x*vec.y - self.y*vec.x\n\n def norm(self):\n return math.sqrt(self.x**2 + self.y**2)\n\nn = int(input())\npoints = []\nfor i in range(n):\n x, y = list(map(int, input().split(' ')))\n points.append(Vector(x, y))\npoints.append(points[0])\n\narea = 0\nfor i in range(n):\n a, b = points[i], points[i+1]\n if (a.x == 0 and a.y == 0) or (b.x == 0 and b.y == 0): continue\n theta = math.atan2(a.outer_product(b), a.inner_product(b))\n if theta > 0:\n area += abs(a.outer_product(b))/2\n elif theta < 0:\n area -= abs(a.outer_product(b))/2\nprint(area)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527511671", "date2": "1527511739", "bleu_score": "0.9956372515861668", "code1_test_status": [1, 1, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 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], "code1_test_score": 15, "total_score": 102, "input": "4\n4 0\n4 -1\n31 0\n0 6\n", "actual_output": "106.5\n", "expected_output": "94.5\n\n", "anno_code": ["import math\n\nclass Vector(): # (0): Vector=\n def __init__(self, x, y):\n self.x = x # (6): NO CHANGE (11): NO CHANGE ... (21): NO CHANGE\n self.y = y # (7): math=, Vector=, n=4, points=[], i=0 (12): math=, Vector=, n=4, points=[, ], i=1 ... (22): math=, Vector=, n=4, points, i=3\n\n def inner_product(self, vec):\n return self.x*vec.x + self.y*vec.y\n\n def outer_product(self, vec):\n return self.x*vec.y - self.y*vec.x\n\n def norm(self):\n return math.sqrt(self.x**2 + self.y**2)\n\nn = int(input()) # (1): n=4\npoints = [] # (2): points=[]\nfor i in range(n): # (3): i=0 (8): points, i=1 ... (23): points\n x, y = list(map(int, input().split(' '))) # (4): x=4, y=0 (9): points=[], y=-1 ... (19): points, x=0, y=6\n points.append(Vector(x, y)) # (5): self= (10): self= ... (20): self=\npoints.append(points[0]) # (24): points\n\narea = 0 # (25): points, area=0\nfor i in range(n-1): # (26): points=[, , , , ], i=0 (33): points, i=1 ... (45): points\n a, b = points[i], points[i+1] # (27): points=[, , , , ], a=, b= (34): points=[, , , , ], a=, b= (40): points, a=, b=\n if (a.x == 0 and a.y == 0) or (b.x == 0 and b.y == 0): continue # (28): points=[, , , , ] (35): points (41): points\n theta = math.atan2(a.outer_product(b), a.inner_product(b)) # (29): points=[, , , , ], theta=-0.244979 (36): points=[, , , , ], theta=0.244979 (42): points, theta=1.570796\n if theta > 0: # (30): points=[, , , , ] (37): points (43): points\n area += abs(a.outer_product(b))/2 # (38): points=[, , , , ], area=13.5 (44): points, area=106.5\n elif theta < 0: # (31): points\n area -= abs(a.outer_product(b))/2 # (32): points, area=-2.0\nprint(area)\n"], "anno_status": [false], "diff_content": " import math\n \n class Vector():\n def __init__(self, x, y):\n self.x = x\n self.y = y\n \n def inner_product(self, vec):\n return self.x*vec.x + self.y*vec.y\n \n def outer_product(self, vec):\n return self.x*vec.y - self.y*vec.x\n \n def norm(self):\n return math.sqrt(self.x**2 + self.y**2)\n \n n = int(input())\n points = []\n for i in range(n):\n x, y = list(map(int, input().split(' ')))\n points.append(Vector(x, y))\n points.append(points[0])\n \n area = 0\n-for i in range(n-1):\n+for i in range(n):\n a, b = points[i], points[i+1]\n if (a.x == 0 and a.y == 0) or (b.x == 0 and b.y == 0): continue\n theta = math.atan2(a.outer_product(b), a.inner_product(b))\n if theta > 0:\n area += abs(a.outer_product(b))/2\n elif theta < 0:\n area -= abs(a.outer_product(b))/2\n print(area)\n \n", "FL_content": " import math\n \n class Vector():\n def __init__(self, x, y):\n self.x = x\n self.y = y\n \n def inner_product(self, vec):\n return self.x*vec.x + self.y*vec.y\n \n def outer_product(self, vec):\n return self.x*vec.y - self.y*vec.x\n \n def norm(self):\n return math.sqrt(self.x**2 + self.y**2)\n \n n = int(input())\n points = []\n for i in range(n):\n x, y = list(map(int, input().split(' ')))\n points.append(Vector(x, y))\n points.append(points[0])\n \n area = 0\n-for i in range(n-1):\n a, b = points[i], points[i+1]\n if (a.x == 0 and a.y == 0) or (b.x == 0 and b.y == 0): continue\n theta = math.atan2(a.outer_product(b), a.inner_product(b))\n if theta > 0:\n area += abs(a.outer_product(b))/2\n elif theta < 0:\n area -= abs(a.outer_product(b))/2\n print(area)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 34 }, { "user_id": "u567380442", "problem_id": "p02297", "submission1_id": "s145029572", "submission2_id": "s035207457", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nreadline = stdin.readline\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef triangle(a, b, c):\n v1, v2 = b - a, c - a\n s = abs(v1) ** 2 * abs(v2) ** 2 - dot(v1, v2) ** 2\n return s ** 0.5 * 0.5\n\n\ndef polygon(p):\n return sum(triangle(p[0], pi, pj) for pi, pj in zip(p[1:], p[2:]))\n\n\nn = int(readline())\np = [map(int, readline().split()) for _ in range(n)]\np = [x + y * 1j for x, y in p]\nprint('{:.1f}'.format(polygon(p)))", "code2": "from sys import stdin\nreadline = stdin.readline\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef triangle(a, b, c):\n v1, v2 = b - a, c - a\n s = abs(v1) ** 2 * abs(v2) ** 2 - dot(v1, v2) ** 2\n return s ** 0.5 * 0.5\n\n\ndef polygon(p):\n return 0.5 * sum(cross(p[i - 1], p[i]) for i in range(len(p)))\n\n\nn = int(readline())\np = [map(int, readline().split()) for _ in range(n)]\np = [x + y * 1j for x, y in p]\nprint('{:.1f}'.format(polygon(p)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1428494979", "date2": "1428560586", "bleu_score": "0.8181806604510595", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 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, 1], "code1_test_score": 86, "total_score": 102, "input": "4\n2 -2\n-1 1\n-2 5\n-4 1\n", "actual_output": "19.5\n", "expected_output": "10.5\n\n", "anno_code": ["from sys import stdin\nreadline = stdin.readline # (0): readline=\n\n\ndef dot(a, b): # (1): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef triangle(a, b, c): # (2): triangle=\n v1, v2 = b - a, c - a # (8): v1=(-3+3j), v2=(-4+7j) (10): v1=(-4+7j), v2=(-6+3j)\n s = abs(v1) ** 2 * abs(v2) ** 2 - dot(v1, v2) ** 2 # (9): b=(-2+5j), c=(-4+1j)\n return s ** 0.5 * 0.5\n\n\ndef polygon(p): # (3): polygon=\n return sum(triangle(p[0], pi, pj) for pi, pj in zip(p[1:], p[2:]))\n\n\nn = int(readline()) # (4): n=4\np = [map(int, readline().split()) for _ in range(n)] # (5): p\np = [x + y * 1j for x, y in p] # (6): p=[(2-2j), (-1+1j), (-2+5j), (-4+1j)]\nprint('{:.1f}'.format(polygon(p))) # (7): a=(2-2j), b=(-1+1j), c=(-2+5j)\n"], "anno_status": [true], "diff_content": " from sys import stdin\n readline = stdin.readline\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n+def cross(a, b):\n+ return a.real * b.imag - a.imag * b.real\n+\n+\n def triangle(a, b, c):\n v1, v2 = b - a, c - a\n s = abs(v1) ** 2 * abs(v2) ** 2 - dot(v1, v2) ** 2\n return s ** 0.5 * 0.5\n \n \n def polygon(p):\n- return sum(triangle(p[0], pi, pj) for pi, pj in zip(p[1:], p[2:]))\n+ return 0.5 * sum(cross(p[i - 1], p[i]) for i in range(len(p)))\n \n \n n = int(readline())\n p = [map(int, readline().split()) for _ in range(n)]\n p = [x + y * 1j for x, y in p]\n print('{:.1f}'.format(polygon(p)))\n", "FL_content": " from sys import stdin\n readline = stdin.readline\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def triangle(a, b, c):\n v1, v2 = b - a, c - a\n s = abs(v1) ** 2 * abs(v2) ** 2 - dot(v1, v2) ** 2\n return s ** 0.5 * 0.5\n \n \n def polygon(p):\n- return sum(triangle(p[0], pi, pj) for pi, pj in zip(p[1:], p[2:]))\n \n \n n = int(readline())\n p = [map(int, readline().split()) for _ in range(n)]\n p = [x + y * 1j for x, y in p]\n print('{:.1f}'.format(polygon(p)))\n", "added_lines": 5, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u532966492", "problem_id": "p03729", "submission1_id": "s869090298", "submission2_id": "s015596460", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = input().split();print(\"YNeos\"[a[-1]!=b[0] or b[-1]!=c[0]::2])", "code2": "a,b,c = input().split();print(\"YNEOS\"[a[-1]!=b[0] or b[-1]!=c[0]::2])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557168872", "date2": "1557168907", "bleu_score": "0.9328730072843132", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "baaabaaa`` `aaaba`baa aaaaa`abab\n", "actual_output": "Yes\n", "expected_output": "YES\n\n", "anno_code": ["a,b,c = input().split();print(\"YNeos\"[a[-1]!=b[0] or b[-1]!=c[0]::2])"], "anno_status": [true], "diff_content": "-a,b,c = input().split();print(\"YNeos\"[a[-1]!=b[0] or b[-1]!=c[0]::2])\n+a,b,c = input().split();print(\"YNEOS\"[a[-1]!=b[0] or b[-1]!=c[0]::2])\n", "FL_content": "-a,b,c = input().split();print(\"YNeos\"[a[-1]!=b[0] or b[-1]!=c[0]::2])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u446711904", "problem_id": "p03729", "submission1_id": "s271837643", "submission2_id": "s643730973", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=input().split();print('NYoe s'[a[-1]==b[0] and b[-1]==c[0]::2])", "code2": "a,b,c=input().split();print('NYOE S'[a[-1]==b[0] and b[-1]==c[0]::2])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591890173", "date2": "1591890258", "bleu_score": "0.9215574141862349", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "roh allirog pepla\n", "actual_output": "No \n", "expected_output": "NO\n\n", "anno_code": ["a,b,c=input().split();print('NYoe s'[a[-1]==b[0] and b[-1]==c[0]::2])"], "anno_status": [true], "diff_content": "-a,b,c=input().split();print('NYoe s'[a[-1]==b[0] and b[-1]==c[0]::2])\n+a,b,c=input().split();print('NYOE S'[a[-1]==b[0] and b[-1]==c[0]::2])\n", "FL_content": "-a,b,c=input().split();print('NYoe s'[a[-1]==b[0] and b[-1]==c[0]::2])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u393881437", "problem_id": "p03729", "submission1_id": "s106014910", "submission2_id": "s852703877", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = list(input().split())\nprint('Yes' if a[len(a)-1] == b[0] and b[len(b)-1] == c[0] else 'No')\n", "code2": "a, b, c = list(input().split())\nprint('YES' if a[len(a)-1] == b[0] and b[len(b)-1] == c[0] else 'NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583788486", "date2": "1583788525", "bleu_score": "0.9397639612620904", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "d c `\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a, b, c = list(input().split()) # (0): a=d, b=c, c=`\nprint('Yes' if a[len(a)-1] == b[0] and b[len(b)-1] == c[0] else 'No')\n"], "anno_status": [true], "diff_content": " a, b, c = list(input().split())\n-print('Yes' if a[len(a)-1] == b[0] and b[len(b)-1] == c[0] else 'No')\n+print('YES' if a[len(a)-1] == b[0] and b[len(b)-1] == c[0] else 'NO')\n \n", "FL_content": " a, b, c = list(input().split())\n-print('Yes' if a[len(a)-1] == b[0] and b[len(b)-1] == c[0] else 'No')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u013202780", "problem_id": "p03729", "submission1_id": "s303296019", "submission2_id": "s058580771", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=input().split();print(\"Yes\" if a[-1]==b[0] and b[-1]==c[0] else \"No\")", "code2": "a,b,c=input().split();print(\"YES\" if a[-1]==b[0] and b[-1]==c[0] else \"NO\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592701171", "date2": "1592793694", "bleu_score": "0.9209568643638403", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "baaabaaa`` _aabb`abaa aabaa`abaa\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c=input().split();print(\"Yes\" if a[-1]==b[0] and b[-1]==c[0] else \"No\")"], "anno_status": [true], "diff_content": "-a,b,c=input().split();print(\"Yes\" if a[-1]==b[0] and b[-1]==c[0] else \"No\")\n+a,b,c=input().split();print(\"YES\" if a[-1]==b[0] and b[-1]==c[0] else \"NO\")\n", "FL_content": "-a,b,c=input().split();print(\"Yes\" if a[-1]==b[0] and b[-1]==c[0] else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u312025627", "problem_id": "p03729", "submission1_id": "s171821827", "submission2_id": "s554322270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = (i for i in input().split())\nprint(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")", "code2": "a, b, c = (i for i in input().split())\nprint(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566783083", "date2": "1566783347", "bleu_score": "0.9760480626894248", "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, 1, 0, 0, 0, 1, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 9, "total_score": 104, "input": "ukinhkby inagt sushi\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a, b, c = (i for i in input().split()) # (0): a=ukinhkby, b=inagt, c=sushi\nprint(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")"], "anno_status": [true], "diff_content": " a, b, c = (i for i in input().split())\n-print(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")\n+print(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"NO\")\n", "FL_content": " a, b, c = (i for i in input().split())\n-print(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u739721456", "problem_id": "p03729", "submission1_id": "s834914520", "submission2_id": "s543831561", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w=input().split()\nif w[0][-1]==w[1][0] and w[1][-1]==w[2][0]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "w=input().split()\nif w[0][-1]==w[1][0] and w[1][-1]==w[2][0]:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556563607", "date2": "1556563702", "bleu_score": "0.9411839132038929", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "baaabaaa`` `aaaba`baa aaaaa`abab\n", "actual_output": "Yes\n", "expected_output": "YES\n\n", "anno_code": ["w=input().split() # (0): w=['baaabaaa``', '`aaaba`baa', 'aaaaa`abab']\nif w[0][-1]==w[1][0] and w[1][-1]==w[2][0]: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " w=input().split()\n if w[0][-1]==w[1][0] and w[1][-1]==w[2][0]:\n- print(\"Yes\")\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": " w=input().split()\n if w[0][-1]==w[1][0] and w[1][-1]==w[2][0]:\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u540290227", "problem_id": "p03729", "submission1_id": "s110032169", "submission2_id": "s775223769", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = input().split()\n\nif a[-1] == b[0]:\n if b[-1] == c[0]:\n print('YES')\nelse:\n print('NO')", "code2": "a, b, c = input().split()\nresult = 'NO'\nif a[-1] == b[0]:\n if b[-1] == c[0]:\n result = 'YES'\nprint(result)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591235950", "date2": "1591236055", "bleu_score": "0.7417504284818677", "code1_test_status": [0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 95, "total_score": 104, "input": "baaabaaa`` `aaaba`baa baaa`aaaaa\n", "actual_output": "no output\n", "expected_output": "NO\n\n", "anno_code": ["a, b, c = input().split() # (0): a=baaabaaa``, b=`aaaba`baa, c=baaa`aaaaa\n\nif a[-1] == b[0]: # (1): NO CHANGE\n if b[-1] == c[0]:\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a, b, c = input().split()\n-\n+result = 'NO'\n if a[-1] == b[0]:\n if b[-1] == c[0]:\n- print('YES')\n-else:\n- print('NO')\n+ result = 'YES'\n+print(result)\n", "FL_content": " a, b, c = input().split()\n-\n if a[-1] == b[0]:\n if b[-1] == c[0]:\n- print('YES')\n-else:\n- print('NO')\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 7 }, { "user_id": "u921826483", "problem_id": "p03729", "submission1_id": "s275127230", "submission2_id": "s239062162", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = input().split()\n\nif a[-1] == b[0]:\n if b[-1] == c[0]:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a,b,c = input().split()\n\nif a[-1] == b[0]:\n if b[-1] == c[0]:\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": "1540485070", "date2": "1540485183", "bleu_score": "0.7785805669982007", "code1_test_status": [0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 95, "total_score": 104, "input": "ybkiniku unagi sushi\n", "actual_output": "no output\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c = input().split() # (0): a=ybkiniku, b=unagi, c=sushi\n\nif a[-1] == b[0]: # (1): NO CHANGE\n if b[-1] == c[0]:\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a,b,c = input().split()\n \n if a[-1] == b[0]:\n if b[-1] == c[0]:\n print(\"YES\")\n+ else:\n+ print(\"NO\")\n else:\n print(\"NO\")\n", "FL_content": " a,b,c = input().split()\n \n if a[-1] == b[0]:\n if b[-1] == c[0]:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u432805419", "problem_id": "p03729", "submission1_id": "s765819899", "submission2_id": "s718929088", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = input().split()\nif a[-1] == b[-1] and b[-1] == c[-1]:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a,b,c = input().split()\nif a[-1] == b[0] and b[-1] == c[0]:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1541381760", "date2": "1541381796", "bleu_score": "0.9254187207769564", "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, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 96, "total_score": 104, "input": "baaabaaa`` `aaaaaabaa aaaaa`aaab\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["a,b,c = input().split() # (0): a=baaabaaa``, b=`aaaaaabaa, c=aaaaa`aaab\nif a[-1] == b[-1] and b[-1] == c[-1]: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a,b,c = input().split()\n-if a[-1] == b[-1] and b[-1] == c[-1]:\n+if a[-1] == b[0] and b[-1] == c[0]:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": " a,b,c = input().split()\n-if a[-1] == b[-1] and b[-1] == c[-1]:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u328755070", "problem_id": "p03729", "submission1_id": "s379952215", "submission2_id": "s577349556", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = input().split()\nif A[-1] == B[0] and B[-1] == C[0]:\n ans = \"YES\"\nelse:\n print('NO')\n", "code2": "A, B, C = input().split()\nif A[-1] == B[0] and B[-1] == C[0]:\n ans = \"YES\"\n print(ans)\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540164907", "date2": "1540164959", "bleu_score": "0.8611084363632073", "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, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 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, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 95, "total_score": 104, "input": "baaabaaa`` `aaaba`baa aaaaa`abab\n", "actual_output": "no output\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = input().split() # (0): A=baaabaaa``, B=`aaaba`baa, C=aaaaa`abab\nif A[-1] == B[0] and B[-1] == C[0]: # (1): NO CHANGE\n ans = \"YES\"\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " A, B, C = input().split()\n if A[-1] == B[0] and B[-1] == C[0]:\n ans = \"YES\"\n+ print(ans)\n else:\n print('NO')\n \n", "FL_content": " A, B, C = input().split()\n if A[-1] == B[0] and B[-1] == C[0]:\n ans = \"YES\"\n else:\n print('NO')\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u959421160", "problem_id": "p03729", "submission1_id": "s460553019", "submission2_id": "s972190421", "status1": "Wrong Answer", "status2": "Accepted", "code1": "Nstr = input().split()\nresult = 'YES'\nfor i in range(2):\n print(Nstr[i][-1] , Nstr[i + 1][0])\n if Nstr[i][-1] != Nstr[i + 1][0]:\n result = 'NO'\nprint(result)", "code2": "Nstr = input().split()\nresult = 'YES'\nfor i in range(2):\n if Nstr[i][-1] != Nstr[i + 1][0]:\n result = 'NO'\nprint(result)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557237242", "date2": "1557237339", "bleu_score": "0.7351414805916845", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ukinikby inagu sushi\n", "actual_output": "y i\nu s\nNO\n", "expected_output": "NO\n\n", "anno_code": ["Nstr = input().split() # (0): Nstr=['ukinikby', 'inagu', 'sushi']\nresult = 'YES' # (1): result=YES\nfor i in range(2): # (2): i=0 (6): i=1 (10): NO CHANGE\n print(Nstr[i][-1] , Nstr[i + 1][0]) # (3): NO CHANGE (7): NO CHANGE\n if Nstr[i][-1] != Nstr[i + 1][0]: # (4): NO CHANGE (8): NO CHANGE\n result = 'NO' # (5): result=NO (9): NO CHANGE\nprint(result)"], "anno_status": [true], "diff_content": " Nstr = input().split()\n result = 'YES'\n for i in range(2):\n- print(Nstr[i][-1] , Nstr[i + 1][0])\n if Nstr[i][-1] != Nstr[i + 1][0]:\n result = 'NO'\n print(result)\n", "FL_content": " Nstr = input().split()\n result = 'YES'\n for i in range(2):\n- print(Nstr[i][-1] , Nstr[i + 1][0])\n if Nstr[i][-1] != Nstr[i + 1][0]:\n result = 'NO'\n print(result)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u313452574", "problem_id": "p03729", "submission1_id": "s856640919", "submission2_id": "s109996143", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A , B , C = input().split()\n\nif A == B and B == C:\n print(\"YES\")\n\nelse:\n print(\"NO\")", "code2": "A , B , C = input().split()\n\nif A[-1] == B[0] and B[-1] == C[0]:\n print(\"YES\")\n\nelse:\n print(\"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573178504", "date2": "1573178992", "bleu_score": "0.8030732204114506", "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, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 96, "total_score": 104, "input": "baaabaaa`` `aaaba`baa aaaaa`abab\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["A , B , C = input().split() # (0): A=baaabaaa``, B=`aaaba`baa, C=aaaaa`abab\n\nif A == B and B == C: # (1): NO CHANGE\n print(\"YES\")\n\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " A , B , C = input().split()\n \n-if A == B and B == C:\n+if A[-1] == B[0] and B[-1] == C[0]:\n print(\"YES\")\n \n else:\n print(\"NO\")\n", "FL_content": " A , B , C = input().split()\n \n-if A == B and B == C:\n print(\"YES\")\n \n else:\n print(\"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u430478288", "problem_id": "p03729", "submission1_id": "s178605486", "submission2_id": "s272275568", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = input().split()\n\nif A[-1] == B[0] and B[-1] and C[-1]:\n print('YES')\nelse:\n print('NO')", "code2": "A, B, C = input().split()\n\nif A[-1] == B[0] and B[-1] == C[0]:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493514201", "date2": "1493514967", "bleu_score": "0.9207385503731159", "code1_test_status": [0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 95, "total_score": 104, "input": "baaabaaa`` `aaaba`baa baaa`aaaaa\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["A, B, C = input().split() # (0): A=baaabaaa``, B=`aaaba`baa, C=baaa`aaaaa\n\nif A[-1] == B[0] and B[-1] and C[-1]: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " A, B, C = input().split()\n \n-if A[-1] == B[0] and B[-1] and C[-1]:\n+if A[-1] == B[0] and B[-1] == C[0]:\n print('YES')\n else:\n print('NO')\n", "FL_content": " A, B, C = input().split()\n \n-if A[-1] == B[0] and B[-1] and C[-1]:\n print('YES')\n else:\n print('NO')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u614917104", "problem_id": "p03729", "submission1_id": "s372167378", "submission2_id": "s159911676", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = input().split()\nn = 0\nif a[len(a)-1] == b[0] and b[len(b)-1] == c[0]:\n print('Yes')\nelse:\n print('No')", "code2": "a,b,c = input().split()\nn = 0\nif a[len(a)-1] == b[0] and b[len(b)-1] == c[0]:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596232895", "date2": "1596233060", "bleu_score": "0.9494591195562835", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ybkiniku inagu sushi\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c = input().split() # (0): a=ybkiniku, b=inagu, c=sushi\nn = 0 # (1): n=0\nif a[len(a)-1] == b[0] and b[len(b)-1] == c[0]: # (2): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a,b,c = input().split()\n n = 0\n if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]:\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n", "FL_content": " a,b,c = input().split()\n n = 0\n if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]:\n- print('Yes')\n else:\n- print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u485566817", "problem_id": "p03729", "submission1_id": "s505988982", "submission2_id": "s702601874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(str, input().split())\nprint(\"Yes\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")", "code2": "a, b, c = map(str, input().split())\nprint(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577688187", "date2": "1577688224", "bleu_score": "0.936645078934211", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "aaaa`aaaab aabaaaaaaa aaaaa`aaab\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a, b, c = map(str, input().split()) # (0): a=aaaa`aaaab, b=aabaaaaaaa, c=aaaaa`aaab\nprint(\"Yes\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")"], "anno_status": [true], "diff_content": " a, b, c = map(str, input().split())\n-print(\"Yes\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")\n+print(\"YES\" if a[-1] == b[0] and b[-1] == c[0] else \"NO\")\n", "FL_content": " a, b, c = map(str, input().split())\n-print(\"Yes\" if a[-1] == b[0] and b[-1] == c[0] else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u394482932", "problem_id": "p03729", "submission1_id": "s254110955", "submission2_id": "s184179226", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=input().split();print('YNEOS'[a[-1]+c[0]==b[-1]+b[0]::2])", "code2": "a,b,c=input().split();print('YNEOS'[a[-1:]+c[0]!=b[0]+b[-1:]::2])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1535993833", "date2": "1535994340", "bleu_score": "0.8570515677723762", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 104, "input": "ukinikby inagu sushi\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c=input().split();print('YNEOS'[a[-1]+c[0]==b[-1]+b[0]::2])"], "anno_status": [true], "diff_content": "-a,b,c=input().split();print('YNEOS'[a[-1]+c[0]==b[-1]+b[0]::2])\n+a,b,c=input().split();print('YNEOS'[a[-1:]+c[0]!=b[0]+b[-1:]::2])\n", "FL_content": "-a,b,c=input().split();print('YNEOS'[a[-1]+c[0]==b[-1]+b[0]::2])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u217303170", "problem_id": "p03729", "submission1_id": "s411383758", "submission2_id": "s522428112", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = input().split()\nif a[-1] == b[0] and b[-1] == c[0]:\n print('Yes')\nelse:\n print('No')\n", "code2": "a, b, c = input().split()\nif a[-1] == b[0] and b[-1] == c[0]:\n print('YES')\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591525020", "date2": "1591525153", "bleu_score": "0.9391527136563887", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ubkhnhjy in`fv svsgh\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a, b, c = input().split() # (0): a=ubkhnhjy, b=in`fv, c=svsgh\nif a[-1] == b[0] and b[-1] == c[0]: # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " a, b, c = input().split()\n if a[-1] == b[0] and b[-1] == c[0]:\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n \n", "FL_content": " a, b, c = input().split()\n if a[-1] == b[0] and b[-1] == c[0]:\n- print('Yes')\n else:\n- print('No')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u677037479", "problem_id": "p03729", "submission1_id": "s642874323", "submission2_id": "s431230885", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = input().split()\n\n\nif a[-1] == b[0]:\n if b[-1] == c[0]:\n print(\"Yes\")\n\n elif b[-1] != c[0]:\n print(\"No\")\n\nelif a[-1] != b[0]:\n print(\"No\")\n", "code2": "a,b,c = input().split()\n\n\nif a[-1] == b[0]:\n if b[-1] == c[0]:\n print(\"YES\")\n\n elif b[-1] != c[0]:\n print(\"NO\")\n\nelif a[-1] != b[0]:\n print(\"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1499726035", "date2": "1499726588", "bleu_score": "0.9488992196571886", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "b a a\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c = input().split() # (0): a=b, b=a, c=a\n\n\nif a[-1] == b[0]: # (1): NO CHANGE\n if b[-1] == c[0]:\n print(\"Yes\")\n\n elif b[-1] != c[0]:\n print(\"No\")\n\nelif a[-1] != b[0]: # (2): NO CHANGE\n print(\"No\")\n"], "anno_status": [true], "diff_content": " a,b,c = input().split()\n \n \n if a[-1] == b[0]:\n if b[-1] == c[0]:\n- print(\"Yes\")\n+ print(\"YES\")\n \n elif b[-1] != c[0]:\n- print(\"No\")\n+ print(\"NO\")\n \n elif a[-1] != b[0]:\n- print(\"No\")\n+ print(\"NO\")\n \n", "FL_content": " a,b,c = input().split()\n \n \n if a[-1] == b[0]:\n if b[-1] == c[0]:\n- print(\"Yes\")\n \n elif b[-1] != c[0]:\n- print(\"No\")\n \n elif a[-1] != b[0]:\n- print(\"No\")\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u396553339", "problem_id": "p03729", "submission1_id": "s581780979", "submission2_id": "s576950199", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(str, input().split())\n\na_last = a[len(a) - 1]\nb_last = b[len(b) - 1]\n\nif a_last == b[0] and b_last == c[0] :\n print('YES')\nelse :\n print('No')", "code2": "a, b, c = map(str, input().split())\n\na_last = a[len(a) - 1]\nb_last = b[len(b) - 1]\n\nif a_last == b[0] and b_last == c[0] :\n print('YES')\nelse :\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570852134", "date2": "1570852206", "bleu_score": "0.9859327964439626", "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, 1, 0, 0, 0, 1, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 9, "total_score": 104, "input": "ukinikby inagu sushi\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a, b, c = map(str, input().split()) # (0): a=ukinikby, b=inagu, c=sushi\n\na_last = a[len(a) - 1] # (1): a_last=y\nb_last = b[len(b) - 1] # (2): b_last=u\n\nif a_last == b[0] and b_last == c[0] : # (3): NO CHANGE\n print('YES')\nelse :\n print('No')"], "anno_status": [true], "diff_content": " a, b, c = map(str, input().split())\n \n a_last = a[len(a) - 1]\n b_last = b[len(b) - 1]\n \n if a_last == b[0] and b_last == c[0] :\n print('YES')\n else :\n- print('No')\n+ print('NO')\n", "FL_content": " a, b, c = map(str, input().split())\n \n a_last = a[len(a) - 1]\n b_last = b[len(b) - 1]\n \n if a_last == b[0] and b_last == c[0] :\n print('YES')\n else :\n- print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u403301154", "problem_id": "p03729", "submission1_id": "s945443957", "submission2_id": "s429767962", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = input().split()\nif a[-1]==b[0] and b[-1]==c[0]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "a, b, c = input().split()\nif a[-1]==b[0] and b[-1]==c[0]:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1530603880", "date2": "1530603907", "bleu_score": "0.9359388144735393", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "roh `glirok `eplp\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a, b, c = input().split() # (0): a=roh, b=`glirok, c=`eplp\nif a[-1]==b[0] and b[-1]==c[0]: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " a, b, c = input().split()\n if a[-1]==b[0] and b[-1]==c[0]:\n- print(\"Yes\")\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": " a, b, c = input().split()\n if a[-1]==b[0] and b[-1]==c[0]:\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u143509139", "problem_id": "p03734", "submission1_id": "s655410722", "submission2_id": "s101650156", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j][k] and j + 1 <= 300:\n dp[i + 1][j + 1][k] = max(dp[i + 1][j + 1][k],\n dp[i][j][k - w] + v)\n else:\n dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n else:\n dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)\n", "code2": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571265344", "date2": "1571267815", "bleu_score": "0.8319963997968902", "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, 0, 0, 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], "code1_test_score": 100, "total_score": 104, "input": "4 2\n1 100\n1 110\n1 111\n1 100\n", "actual_output": "211\n", "expected_output": "221\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k] and j + 1 <= 300:\n- dp[i + 1][j + 1][k] = max(dp[i + 1][j + 1][k],\n- dp[i][j][k - w] + v)\n+ if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n+ dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n- dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n+ dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n- dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n+ dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n \n", "FL_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k] and j + 1 <= 300:\n- dp[i + 1][j + 1][k] = max(dp[i + 1][j + 1][k],\n- dp[i][j][k - w] + v)\n else:\n- dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n else:\n- dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n \n", "added_lines": 4, "removed_lines": 5, "code1_lines": 24 }, { "user_id": "u143509139", "problem_id": "p03734", "submission1_id": "s459664114", "submission2_id": "s101650156", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(300):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j][k] = dp[i][j][k]\n else:\n dp[i + 1][j][k] = dp[i][j][k]\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)", "code2": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571098297", "date2": "1571267815", "bleu_score": "0.9556818073150892", "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, 0, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "4 6\n2 1\n3 14\n2 6\n3 8\n", "actual_output": "20\n", "expected_output": "22\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n- for k in range(300):\n+ for k in range(301):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k]:\n+ if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n+ dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n+ dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n+\n", "FL_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n- for k in range(300):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 22 }, { "user_id": "u572144347", "problem_id": "p03734", "submission1_id": "s546487923", "submission2_id": "s531241137", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,W=map(int,input().split())\nwv=[ tuple([int(j) for j in input().split()]) for _ in range(N) ]\nw1=wv[0][0]\nw2=w1+1\nw3=w1+2 \nw4=w1+3\n\nwv=sorted(wv,key=lambda x:x[1],reverse=True)\nwv=sorted(wv)\nwvv = list(map(lambda x:x[1], wv))\n\n\ninf = float(\"inf\")\nans=0\nfrom collections import defaultdict\ncounter = defaultdict(int)\n\nfor i in range(N):\n w,v = wv[i]\n counter[w] += 1\n\nfrom bisect import bisect_left as bll\n\nfor e1 in range(0, counter[w1]+1):\n for e2 in range(0, counter[w2]+1):\n for e3 in range(0,counter[w3]+1):\n for e4 in range(0, counter[w4]+1):\n tmp=0\n\n if w1*e1 + w2*e2 + w3*e3 + w4*e4 > W:\n continue\n\n i1=bll(wv, (w1,-inf))\n i2=bll(wv, (w2,-inf))\n i3=bll(wv, (w3,-inf))\n i4=bll(wv, (w4,-inf))\n\n tmp= tmp \\\n +sum(wvv[i1:i1+e1]) \\\n +sum(wvv[i2:i2+e2]) \\\n +sum(wvv[i3:i3+e3]) \\\n +sum(wvv[i4:i4+e4])\n\n ans=max(ans,tmp)\n \nprint(ans)\n\n", "code2": "N,W=map(int,input().split())\nwv=[ tuple([int(j) for j in input().split()]) for _ in range(N) ]\nw1=wv[0][0]\nw2=w1+1\nw3=w1+2 \nw4=w1+3\n\nwv=sorted(wv,key=lambda x:x[1],reverse=True)\nwv=sorted(wv,key=lambda x:x[0])\nwvv = list(map(lambda x:x[1], wv))\n\n\ninf = float(\"inf\")\nans=0\nfrom collections import defaultdict\ncounter = defaultdict(int)\n\nfor i in range(N):\n w,v = wv[i]\n counter[w] += 1\n\nfrom bisect import bisect_left as bll\n\nfor e1 in range(0, counter[w1]+1):\n for e2 in range(0, counter[w2]+1):\n for e3 in range(0,counter[w3]+1):\n for e4 in range(0, counter[w4]+1):\n tmp=0\n\n if w1*e1 + w2*e2 + w3*e3 + w4*e4 > W:\n continue\n\n i1=bll(wv, (w1,-inf))\n i2=bll(wv, (w2,-inf))\n i3=bll(wv, (w3,-inf))\n i4=bll(wv, (w4,-inf))\n\n tmp= tmp \\\n +sum(wvv[i1:i1+e1]) \\\n +sum(wvv[i2:i2+e2]) \\\n +sum(wvv[i3:i3+e3]) \\\n +sum(wvv[i4:i4+e4])\n\n ans=max(ans,tmp)\n \nprint(ans)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1551629691", "date2": "1551632711", "bleu_score": "0.980643253566406", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 104, "input": "4 6\n2 1\n3 3\n2 2\n3 1\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["N,W=map(int,input().split()) # (0): N=4, W=6\nwv=[ tuple([int(j) for j in input().split()]) for _ in range(N) ] # (1): wv=[(2, 1), (3, 3), (2, 2), (3, 1)]\nw1=wv[0][0] # (2): w1=2\nw2=w1+1 # (3): w2=3\nw3=w1+2 # (4): w3=4\nw4=w1+3 # (5): w4=5\n\nwv=sorted(wv,key=lambda x:x[1],reverse=True) # (6): wv=[(3, 3), (2, 2), (2, 1), (3, 1)]\nwv=sorted(wv) # (7): wv=[(2, 1), (2, 2), (3, 1), (3, 3)]\nwvv = list(map(lambda x:x[1], wv)) # (8): wvv=[1, 2, 1, 3]\n\n\ninf = float(\"inf\") # (9): inf=inf\nans=0 # (10): ans=0, defaultdict=\nfrom collections import defaultdict\ncounter = defaultdict(int) # (11): counter=defaultdict(, {})\n\nfor i in range(N): # (12): i=0 (15): i=1 ... (24): bll=\n w,v = wv[i] # (13): w=2, v=1 (16): v=2 ... (22): v=3\n counter[w] += 1 # (14): counter=defaultdict(, {2: 1}) (17): counter=defaultdict(, {2: 2}) ... (23): counter=defaultdict(, {2: 2, 3: 2})\n\nfrom bisect import bisect_left as bll\n\nfor e1 in range(0, counter[w1]+1): # (25): e1=0 (90): e1=1 ... (181): NO CHANGE\n for e2 in range(0, counter[w2]+1): # (26): e2=0 (47): e2=1 ... (180): NO CHANGE\n for e3 in range(0,counter[w3]+1): # (27): counter=defaultdict(, {2: 2, 3: 2, 4: 0}), e3=0 (46): NO CHANGE ... (179): NO CHANGE\n for e4 in range(0, counter[w4]+1): # (28): counter=defaultdict(, {2: 2, 3: 2, 4: 0, 5: 0}), e4=0 (45): NO CHANGE ... (178): NO CHANGE\n tmp=0 # (29): tmp=0 (50): NO CHANGE ... (175): NO CHANGE\n\n if w1*e1 + w2*e2 + w3*e3 + w4*e4 > W: # (30): NO CHANGE (51): NO CHANGE ... (176): NO CHANGE\n continue # (138): NO CHANGE (169): NO CHANGE (177): NO CHANGE\n\n i1=bll(wv, (w1,-inf)) # (31): i1=0 (52): NO CHANGE ... (148): NO CHANGE\n i2=bll(wv, (w2,-inf)) # (32): i2=2 (53): NO CHANGE ... (149): NO CHANGE\n i3=bll(wv, (w3,-inf)) # (33): i3=4 (54): NO CHANGE ... (150): NO CHANGE\n i4=bll(wv, (w4,-inf)) # (34): i4=4 (55): NO CHANGE ... (151): NO CHANGE\n\n tmp= tmp \\ # (35): NO CHANGE (37): NO CHANGE ... (160): tmp=3\n +sum(wvv[i1:i1+e1]) \\ # (36): NO CHANGE (57): NO CHANGE ... (153): NO CHANGE\n +sum(wvv[i2:i2+e2]) \\ # (38): NO CHANGE (59): NO CHANGE ... (155): NO CHANGE\n +sum(wvv[i3:i3+e3]) \\ # (40): NO CHANGE (61): NO CHANGE ... (157): NO CHANGE\n +sum(wvv[i4:i4+e4]) # (42): NO CHANGE (63): NO CHANGE ... (159): NO CHANGE\n\n ans=max(ans,tmp) # (44): NO CHANGE (65): ans=1 ... (161): NO CHANGE\n \nprint(ans)\n\n"], "anno_status": [false], "diff_content": " N,W=map(int,input().split())\n wv=[ tuple([int(j) for j in input().split()]) for _ in range(N) ]\n w1=wv[0][0]\n w2=w1+1\n w3=w1+2 \n w4=w1+3\n \n wv=sorted(wv,key=lambda x:x[1],reverse=True)\n-wv=sorted(wv)\n+wv=sorted(wv,key=lambda x:x[0])\n wvv = list(map(lambda x:x[1], wv))\n \n \n inf = float(\"inf\")\n ans=0\n from collections import defaultdict\n counter = defaultdict(int)\n \n for i in range(N):\n w,v = wv[i]\n counter[w] += 1\n \n from bisect import bisect_left as bll\n \n for e1 in range(0, counter[w1]+1):\n for e2 in range(0, counter[w2]+1):\n for e3 in range(0,counter[w3]+1):\n for e4 in range(0, counter[w4]+1):\n tmp=0\n \n if w1*e1 + w2*e2 + w3*e3 + w4*e4 > W:\n continue\n \n i1=bll(wv, (w1,-inf))\n i2=bll(wv, (w2,-inf))\n i3=bll(wv, (w3,-inf))\n i4=bll(wv, (w4,-inf))\n \n tmp= tmp \\\n +sum(wvv[i1:i1+e1]) \\\n +sum(wvv[i2:i2+e2]) \\\n +sum(wvv[i3:i3+e3]) \\\n +sum(wvv[i4:i4+e4])\n \n ans=max(ans,tmp)\n \n print(ans)\n \n \n", "FL_content": " N,W=map(int,input().split())\n wv=[ tuple([int(j) for j in input().split()]) for _ in range(N) ]\n w1=wv[0][0]\n w2=w1+1\n w3=w1+2 \n w4=w1+3\n \n wv=sorted(wv,key=lambda x:x[1],reverse=True)\n-wv=sorted(wv)\n wvv = list(map(lambda x:x[1], wv))\n \n \n inf = float(\"inf\")\n ans=0\n from collections import defaultdict\n counter = defaultdict(int)\n \n for i in range(N):\n w,v = wv[i]\n counter[w] += 1\n \n from bisect import bisect_left as bll\n \n for e1 in range(0, counter[w1]+1):\n for e2 in range(0, counter[w2]+1):\n for e3 in range(0,counter[w3]+1):\n for e4 in range(0, counter[w4]+1):\n tmp=0\n \n if w1*e1 + w2*e2 + w3*e3 + w4*e4 > W:\n continue\n \n i1=bll(wv, (w1,-inf))\n i2=bll(wv, (w2,-inf))\n i3=bll(wv, (w3,-inf))\n i4=bll(wv, (w4,-inf))\n \n tmp= tmp \\\n +sum(wvv[i1:i1+e1]) \\\n +sum(wvv[i2:i2+e2]) \\\n +sum(wvv[i3:i3+e3]) \\\n +sum(wvv[i4:i4+e4])\n \n ans=max(ans,tmp)\n \n print(ans)\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 48 }, { "user_id": "u458617779", "problem_id": "p03734", "submission1_id": "s864034470", "submission2_id": "s724635535", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ints = input().split(\" \")\nN = int(ints[0])\nmaxW = int(ints[1])\nints = input().split(\" \")\na = int(ints[0])\nb = int(ints[1])\nweight = [a, a+1, a+2, a+3] \nva = [[0,b],[0],[0],[0]]\nfor i in range(1, N):\n\tins = input().split(\" \")\n\tw = int(ins[0])\n\tv = int(ins[1])\n\tfor j in range(0, 4):\n\t\tif w == weight[j]:\n\t\t\tva[j].append(v)\nva.sort()\nsum = [[0],[0],[0],[0]]\nfor j in range(0, 4):\n\tfor i in range(1, len(va[j])):\n\t\ttry:\n\t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n\t\texcept:\n\t\t\tpass\nans = 0\nfor i in range(0, len(va[0])):\n\tfor j in range(0, len(va[1])):\n\t\tfor k in range(0, len(va[2])):\n\t\t\tfor l in range(0, len(va[3])):\n\t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n\t\t\t\tif(sumw <= maxW):\n\t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\nprint(ans)", "code2": "ints = input().split(\" \")\nN = int(ints[0])\nmaxW = int(ints[1])\nints = input().split(\" \")\na = int(ints[0])\nb = int(ints[1])\nweight = [a, a+1, a+2, a+3] \nva = [[b],[],[],[]]\nfor i in range(1, N):\n\tins = input().split(\" \")\n\tw = int(ins[0])\n\tv = int(ins[1])\n\tfor j in range(0, 4):\n\t\tif w == weight[j]:\n\t\t\tva[j].append(v)\nfor i in range(0, len(va)):\n\tva[i].sort(reverse=True)\n\tva[i].insert(0,0)\n\nsum = [[0],[0],[0],[0]]\nfor j in range(0, 4):\n\tfor i in range(1, len(va[j])):\n\t\ttry:\n\t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n\t\texcept:\n\t\t\tpass\nans = 0\n\nfor i in range(0, len(va[0])):\n\tfor j in range(0, len(va[1])):\n\t\tfor k in range(0, len(va[2])):\n\t\t\tfor l in range(0, len(va[3])):\n\t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n\t\t\t\tif(sumw <= maxW):\n\t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528595940", "date2": "1528596309", "bleu_score": "0.9090714718240344", "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, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1], "code1_test_score": 44, "total_score": 104, "input": "4 6\n2 1\n3 16\n2 8\n4 2\n", "actual_output": "16\n", "expected_output": "24\n\n", "anno_code": ["ints = input().split(\" \") # (0): ints=['4', '6']\nN = int(ints[0]) # (1): N=4\nmaxW = int(ints[1]) # (2): maxW=6\nints = input().split(\" \") # (3): ints=['2', '1']\na = int(ints[0]) # (4): a=2\nb = int(ints[1]) # (5): b=1\nweight = [a, a+1, a+2, a+3] # (6): weight=[2, 3, 4, 5]\nva = [[0,b],[0],[0],[0]] # (7): va\nfor i in range(1, N): # (8): va=[[0, 1], [0], [0], [0]], i=1 (22): va, i=2 ... (50): va\n\tins = input().split(\" \") # (9): va=[[0, 1], [0], [0], [0]], ins=['3', '16'] (23): va=[[0, 1], [0, 16], [0], [0]], ins=['2', '8'] (37): va, ins=['4', '2']\n\tw = int(ins[0]) # (10): va=[[0, 1], [0], [0], [0]], w=3 (24): va=[[0, 1], [0, 16], [0], [0]], w=2 (38): va, w=4\n\tv = int(ins[1]) # (11): va=[[0, 1], [0], [0], [0]], v=16 (25): va=[[0, 1], [0, 16], [0], [0]], v=8 (39): va, v=2\n\tfor j in range(0, 4): # (12): va, j=0 (14): va, j=1 ... (49): va\n\t\tif w == weight[j]: # (13): va (15): va ... (48): va\n\t\t\tva[j].append(v) # (16): va=[[0, 1], [0, 16], [0], [0]] (28): va (46): va\nva.sort() # (51): va\nsum = [[0],[0],[0],[0]] # (52): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum\nfor j in range(0, 4): # (53): va, j=0 (55): va, j=1 ... (73): va, sum\n\tfor i in range(1, len(va[j])): # (54): va (56): va, i=1 ... (72): va, sum\n\t\ttry: # (57): va (60): va, sum ... (70): va, sum\n\t\t\tsum[j].append(sum[j][i-1] + va[j][i]) # (58): va, sum (61): va, sum ... (71): va, sum\n\t\texcept:\n\t\t\tpass\nans = 0 # (74): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, ans=0\nfor i in range(0, len(va[0])): # (75): va, i=0, sum (136): va, sum\n\tfor j in range(0, len(va[1])): # (76): va, j=0, sum (97): va, j=1, sum ... (135): va, sum\n\t\tfor k in range(0, len(va[2])): # (77): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, k=0 (87): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, k=1 ... (134): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum\n\t\t\tfor l in range(0, len(va[3])): # (78): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, l=0 (82): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, l=1 ... (133): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum\n\t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l # (79): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, sumw=0 (83): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, sumw=5 ... (131): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, sumw=15\n\t\t\t\tif(sumw <= maxW): # (80): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum (84): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum ... (132): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum\n\t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans) # (81): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum (85): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum, ans=16 ... (121): va=[[0], [0, 1, 8], [0, 2], [0, 16]], sum\nprint(ans)"], "anno_status": [false], "diff_content": " ints = input().split(\" \")\n N = int(ints[0])\n maxW = int(ints[1])\n ints = input().split(\" \")\n a = int(ints[0])\n b = int(ints[1])\n weight = [a, a+1, a+2, a+3] \n-va = [[0,b],[0],[0],[0]]\n+va = [[b],[],[],[]]\n for i in range(1, N):\n \tins = input().split(\" \")\n \tw = int(ins[0])\n \tv = int(ins[1])\n \tfor j in range(0, 4):\n \t\tif w == weight[j]:\n \t\t\tva[j].append(v)\n-va.sort()\n+for i in range(0, len(va)):\n+\tva[i].sort(reverse=True)\n+\tva[i].insert(0,0)\n+\n sum = [[0],[0],[0],[0]]\n for j in range(0, 4):\n \tfor i in range(1, len(va[j])):\n \t\ttry:\n \t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n \t\texcept:\n \t\t\tpass\n ans = 0\n+\n for i in range(0, len(va[0])):\n \tfor j in range(0, len(va[1])):\n \t\tfor k in range(0, len(va[2])):\n \t\t\tfor l in range(0, len(va[3])):\n \t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n \t\t\t\tif(sumw <= maxW):\n \t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\n print(ans)\n", "FL_content": " ints = input().split(\" \")\n N = int(ints[0])\n maxW = int(ints[1])\n ints = input().split(\" \")\n a = int(ints[0])\n b = int(ints[1])\n weight = [a, a+1, a+2, a+3] \n-va = [[0,b],[0],[0],[0]]\n for i in range(1, N):\n \tins = input().split(\" \")\n \tw = int(ins[0])\n \tv = int(ins[1])\n \tfor j in range(0, 4):\n \t\tif w == weight[j]:\n \t\t\tva[j].append(v)\n-va.sort()\n sum = [[0],[0],[0],[0]]\n for j in range(0, 4):\n \tfor i in range(1, len(va[j])):\n \t\ttry:\n \t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n \t\texcept:\n \t\t\tpass\n ans = 0\n for i in range(0, len(va[0])):\n \tfor j in range(0, len(va[1])):\n \t\tfor k in range(0, len(va[2])):\n \t\t\tfor l in range(0, len(va[3])):\n \t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n \t\t\t\tif(sumw <= maxW):\n \t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\n print(ans)\n", "added_lines": 6, "removed_lines": 2, "code1_lines": 32 }, { "user_id": "u556160473", "problem_id": "p03734", "submission1_id": "s710473790", "submission2_id": "s593640786", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\n\nif 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\nelse:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n\nw0 = w[0]\n\nidxs = set()\nfor i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\nidxs = list(idxs) \nidx_dict = {idx:i for i,idx in enumerate(idxs)}\n\ndp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n\nfor i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n if 0:\n k = bisect.bisect_left(idxs, idxs[j]-w[i])\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n else:\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n \nprint(dp[-1][-1]%1000000009)", "code2": "\nif 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\nelse:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n\nw0 = w[0]\n\nidxs = set()\nfor i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\nidxs = sorted(list(idxs))\nidx_dict = {idx:i for i,idx in enumerate(idxs)}\n\ndp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n\nfor i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n \nprint(max([max(dp_) for dp_ in dp]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493519896", "date2": "1493520847", "bleu_score": "0.6820131562194974", "code1_test_status": [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, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 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, 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, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 104, "input": "4 9\n2 1\n3 14\n2 6\n3 8\n", "actual_output": "22\n", "expected_output": "28\n\n", "anno_code": ["import bisect\n\nif 1: # (0): NO CHANGE\n N,W = map(int, input().split(' ')) # (1): N=4, W=9\n w,v = [],[] # (2): w=[], v=[]\n for i in range(N): # (3): i=0 (7): i=1 ... (19): NO CHANGE\n w_,v_ = map(int, input().split(' ')) # (4): w_=2, v_=1 (8): w_=3, v_=14 ... (16): w_=3, v_=8\n w.append(w_) # (5): w=[2] (9): w=[2, 3] ... (17): w=[2, 3, 2, 3]\n v.append(v_) # (6): v=[1] (10): v=[1, 14] ... (18): v=[1, 14, 6, 8]\nelse:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n\nw0 = w[0] # (20): w0=2\n\nidxs = set() # (21): idxs=set()\nfor i in range(N+1): # (22): i=0 (27): i=1 ... (119): NO CHANGE\n for j in range(3*i+1): # (23): j=0 (26): NO CHANGE ... (118): NO CHANGE\n if i*w0+j <= W: # (24): NO CHANGE (29): NO CHANGE ... (117): NO CHANGE\n idxs.add(i*w0+j) # (25): idxs={0} (30): idxs={0, 2} ... (95): NO CHANGE\nidxs = list(idxs) # (120): idxs=[0, 2, 3, 4, 5, 6, 7, 8, 9]\nidx_dict = {idx:i for i,idx in enumerate(idxs)} # (121): idx_dict={0: 0, 2: 1, 3: 2, 4: 3, 5: 4, 6: 5, 7: 6, 8: 7, 9: 8}\n\ndp = [[0 for j in range(len(idxs))] for i in range(N+1)] # (122): dp\n\nfor i in range(N): # (123): i=0 (170): i=1 ... (307): NO CHANGE\n for j in range(len(idxs)): # (124): j=0 (127): j=1 ... (306): NO CHANGE\n if idxs[j] < w[i]: # (125): NO CHANGE (128): NO CHANGE ... (302): NO CHANGE\n dp[i+1][j] = dp[i][j] # (126): NO CHANGE (173): NO CHANGE ... (268): dp\n else:\n if 0: # (129): NO CHANGE (134): NO CHANGE ... (303): NO CHANGE\n k = bisect.bisect_left(idxs, idxs[j]-w[i])\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n else:\n try: # (130): NO CHANGE (135): NO CHANGE ... (304): NO CHANGE\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]]) # (131): dp (136): NO CHANGE ... (305): dp\n except: # (137): NO CHANGE (187): NO CHANGE ... (279): NO CHANGE\n dp[i+1][j] = dp[i][j] # (138): NO CHANGE (188): dp ... (280): dp\n \nprint(dp[-1][-1]%1000000009)"], "anno_status": [false], "diff_content": "-import bisect\n \n if 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\n else:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n \n w0 = w[0]\n \n idxs = set()\n for i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\n-idxs = list(idxs) \n+idxs = sorted(list(idxs))\n idx_dict = {idx:i for i,idx in enumerate(idxs)}\n \n dp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n \n for i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n- if 0:\n- k = bisect.bisect_left(idxs, idxs[j]-w[i])\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- else:\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- \n-print(dp[-1][-1]%1000000009)\n+ try:\n+ dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n+ except:\n+ dp[i+1][j] = dp[i][j]\n+ \n+print(max([max(dp_) for dp_ in dp]))\n", "FL_content": "-import bisect\n \n if 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\n else:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n \n w0 = w[0]\n \n idxs = set()\n for i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\n-idxs = list(idxs) \n idx_dict = {idx:i for i,idx in enumerate(idxs)}\n \n dp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n \n for i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n- if 0:\n- k = bisect.bisect_left(idxs, idxs[j]-w[i])\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- else:\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- \n-print(dp[-1][-1]%1000000009)\n", "added_lines": 7, "removed_lines": 15, "code1_lines": 44 }, { "user_id": "u477320129", "problem_id": "p03734", "submission1_id": "s167233001", "submission2_id": "s253494220", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\n\ndef solve(N: int, W: int, w: \"List[int]\", v: \"List[int]\"):\n from itertools import product\n base_w = w[0]\n v_list = [[] for _ in range(4)]\n for ww, vv in zip(w, v):\n v_list[ww-base_w].append(vv)\n v_list = [sorted(vv) for vv in v_list]\n acc_v = [[0] * (N+1) for _ in range(4)]\n for i, vv in enumerate(v_list):\n for j, vvv in enumerate(vv):\n acc_v[i][j+1] = acc_v[i][j] + vvv\n ans = 0\n for i, j, k, l in product(range(N+1), repeat=4):\n if i * base_w + j * (base_w + 1) + k * (base_w + 2)+ l * (base_w + 3) > W:\n continue\n ans = max(ans, acc_v[0][i] + acc_v[1][j] + acc_v[2][k] + acc_v[3][l])\n return ans\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n W = int(next(tokens)) \n w = [int()] * (N) \n v = [int()] * (N) \n for i in range(N):\n w[i] = int(next(tokens))\n v[i] = int(next(tokens))\n print(solve(N, W, w, v))\n\ndef test():\n import doctest\n doctest.testmod()\n\nif __name__ == '__main__':\n \n main()\n", "code2": "\nimport sys\n\ndef solve(N: int, W: int, w: \"List[int]\", v: \"List[int]\"):\n from itertools import groupby, product\n base_w = w[0]\n v_list = [[] for _ in range(4)]\n for ww, vv in zip(w, v):\n v_list[ww-base_w].append(vv)\n v_list = [sorted(vv, reverse=True) for vv in v_list]\n acc_v = [[0] for _ in range(4)]\n for i, vv in enumerate(v_list):\n for vvv in vv:\n acc_v[i].append(acc_v[i][-1] + vvv)\n ans = 0\n for i, j, k, l in product(*[range(len(a)) for a in acc_v]):\n if i * base_w + j * (base_w + 1) + k * (base_w + 2)+ l * (base_w + 3) > W:\n continue\n ans = max(ans, acc_v[0][i] + acc_v[1][j] + acc_v[2][k] + acc_v[3][l])\n return ans\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n W = int(next(tokens)) \n w = [int()] * (N) \n v = [int()] * (N) \n for i in range(N):\n w[i] = int(next(tokens))\n v[i] = int(next(tokens))\n print(solve(N, W, w, v))\n\ndef test():\n import doctest\n doctest.testmod()\n\nif __name__ == '__main__':\n \n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590550186", "date2": "1590551840", "bleu_score": "0.948873845110966", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 104, "input": "4 1\n1 100\n1 101\n1 011\n1 101\n", "actual_output": "11\n", "expected_output": "101\n\n", "anno_code": ["\nimport sys\n\n\ndef solve(N: int, W: int, w: \"List[int]\", v: \"List[int]\"): # (0): solve=\n from itertools import product\n base_w = w[0]\n v_list = [[] for _ in range(4)]\n for ww, vv in zip(w, v):\n v_list[ww-base_w].append(vv)\n v_list = [sorted(vv) for vv in v_list]\n acc_v = [[0] * (N+1) for _ in range(4)]\n for i, vv in enumerate(v_list):\n for j, vvv in enumerate(vv):\n acc_v[i][j+1] = acc_v[i][j] + vvv\n ans = 0\n for i, j, k, l in product(range(N+1), repeat=4):\n if i * base_w + j * (base_w + 1) + k * (base_w + 2)+ l * (base_w + 3) > W:\n continue\n ans = max(ans, acc_v[0][i] + acc_v[1][j] + acc_v[2][k] + acc_v[3][l])\n return ans\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 W = int(next(tokens)) \n w = [int()] * (N) \n v = [int()] * (N) \n for i in range(N):\n w[i] = int(next(tokens))\n v[i] = int(next(tokens))\n print(solve(N, W, w, v))\n\ndef test(): # (2): test=\n import doctest\n doctest.testmod()\n\nif __name__ == '__main__':\n \n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n \n-\n def solve(N: int, W: int, w: \"List[int]\", v: \"List[int]\"):\n- from itertools import product\n+ from itertools import groupby, product\n base_w = w[0]\n v_list = [[] for _ in range(4)]\n for ww, vv in zip(w, v):\n v_list[ww-base_w].append(vv)\n- v_list = [sorted(vv) for vv in v_list]\n- acc_v = [[0] * (N+1) for _ in range(4)]\n+ v_list = [sorted(vv, reverse=True) for vv in v_list]\n+ acc_v = [[0] for _ in range(4)]\n for i, vv in enumerate(v_list):\n- for j, vvv in enumerate(vv):\n- acc_v[i][j+1] = acc_v[i][j] + vvv\n+ for vvv in vv:\n+ acc_v[i].append(acc_v[i][-1] + vvv)\n ans = 0\n- for i, j, k, l in product(range(N+1), repeat=4):\n+ for i, j, k, l in product(*[range(len(a)) for a in acc_v]):\n if i * base_w + j * (base_w + 1) + k * (base_w + 2)+ l * (base_w + 3) > W:\n continue\n ans = max(ans, acc_v[0][i] + acc_v[1][j] + acc_v[2][k] + acc_v[3][l])\n return ans\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 W = int(next(tokens)) \n w = [int()] * (N) \n v = [int()] * (N) \n for i in range(N):\n w[i] = int(next(tokens))\n v[i] = int(next(tokens))\n print(solve(N, W, w, v))\n \n def test():\n import doctest\n doctest.testmod()\n \n if __name__ == '__main__':\n \n main()\n \n", "FL_content": " \n import sys\n \n-\n def solve(N: int, W: int, w: \"List[int]\", v: \"List[int]\"):\n- from itertools import product\n base_w = w[0]\n v_list = [[] for _ in range(4)]\n for ww, vv in zip(w, v):\n v_list[ww-base_w].append(vv)\n- v_list = [sorted(vv) for vv in v_list]\n- acc_v = [[0] * (N+1) for _ in range(4)]\n for i, vv in enumerate(v_list):\n- for j, vvv in enumerate(vv):\n- acc_v[i][j+1] = acc_v[i][j] + vvv\n ans = 0\n- for i, j, k, l in product(range(N+1), repeat=4):\n if i * base_w + j * (base_w + 1) + k * (base_w + 2)+ l * (base_w + 3) > W:\n continue\n ans = max(ans, acc_v[0][i] + acc_v[1][j] + acc_v[2][k] + acc_v[3][l])\n return ans\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 W = int(next(tokens)) \n w = [int()] * (N) \n v = [int()] * (N) \n for i in range(N):\n w[i] = int(next(tokens))\n v[i] = int(next(tokens))\n print(solve(N, W, w, v))\n \n def test():\n import doctest\n doctest.testmod()\n \n if __name__ == '__main__':\n \n main()\n \n", "added_lines": 6, "removed_lines": 7, "code1_lines": 46 }, { "user_id": "u143509139", "problem_id": "p03734", "submission1_id": "s941592048", "submission2_id": "s101650156", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)\n", "code2": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571265595", "date2": "1571267815", "bleu_score": "0.9921445939598181", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 104, "input": "4 6\n2 1\n3 2\n2 4\n3 1\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k]:\n+ if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n \n", "FL_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u579875569", "problem_id": "p03734", "submission1_id": "s927270180", "submission2_id": "s529211866", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = list(map(int, input().split()))\n\nvalues = [[] for i in range(4)]\n\nw0, v0 = list(map(int, input().split()))\nvalues[0].append(v0)\n\nfor i in range(N-1):\n w, v = list(map(int, input().split()))\n values[w-w0].append(v)\n\nfor i in range(4):\n values[i].sort()\n for j in range(len(values[i])-1):\n values[i][j+1] = values[i][j] + values[i][j+1]\n values[i].append(0)\n\nres = 0\n\nfor i1 in range(len(values[0])+1):\n for i2 in range(len(values[1])+1):\n for i3 in range(len(values[2])+1):\n for i4 in range(len(values[3])+1):\n if(w0*i1 + (w0+1)*i2 + (w0+2)*i3 + (w0+3)*i4 <= W):\n res = max(res, values[0][i1-1] + values[1][i2-1] + values[2][i3-1] + values[3][i4-1])\n\nprint(res)", "code2": "N, W = list(map(int, input().split()))\n\nvalues = [[] for i in range(4)]\n\nw0, v0 = list(map(int, input().split()))\nvalues[0].append(v0)\n\nfor i in range(N-1):\n w, v = list(map(int, input().split()))\n values[w-w0].append(v)\n\nfor i in range(4):\n values[i].sort(reverse=True)\n for j in range(len(values[i])-1):\n values[i][j+1] = values[i][j] + values[i][j+1]\n values[i].append(0)\n\nres = 0\n\nfor i1 in range(len(values[0])+1):\n for i2 in range(len(values[1])+1):\n for i3 in range(len(values[2])+1):\n for i4 in range(len(values[3])+1):\n if(w0*i1 + (w0+1)*i2 + (w0+2)*i3 + (w0+3)*i4 <= W):\n res = max(res, values[0][i1-1] + values[1][i2-1] + values[2][i3-1] + values[3][i4-1])\n\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525984621", "date2": "1525985037", "bleu_score": "0.9821039624957977", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 104, "input": "4 6\n2 1\n3 0\n2 9\n3 16\n", "actual_output": "16\n", "expected_output": "25\n\n", "anno_code": ["N, W = list(map(int, input().split())) # (0): N=4, W=6\n\nvalues = [[] for i in range(4)] # (1): values\n\nw0, v0 = list(map(int, input().split())) # (2): w0=2, v0=1\nvalues[0].append(v0) # (3): values\n\nfor i in range(N-1): # (4): values=[[1], [], [], []], i=0 (7): values, i=1 ... (13): values\n w, v = list(map(int, input().split())) # (5): values=[[1], [], [], []], w=3, v=0 (8): values=[[1], [0], [], []], w=2, v=9 (11): values, w=3, v=16\n values[w-w0].append(v) # (6): values=[[1], [0], [], []] (9): values (12): values\n\nfor i in range(4): # (14): values=[[1, 9], [0, 16], [], []], i=0 (20): values, i=1 ... (34): values\n values[i].sort() # (15): values (21): values ... (31): values\n for j in range(len(values[i])-1): # (16): values, j=0 (18): values ... (32): values\n values[i][j+1] = values[i][j] + values[i][j+1] # (17): values (23): values\n values[i].append(0) # (19): values (25): values ... (33): values\n\nres = 0 # (35): values, res=0\n\nfor i1 in range(len(values[0])+1): # (36): values, i1=0 (99): values, i1=1 ... (278): values\n for i2 in range(len(values[1])+1): # (37): values, i2=0 (54): values, i2=1 ... (277): values\n for i3 in range(len(values[2])+1): # (38): values, i3=0 (46): values, i3=1 ... (276): values\n for i4 in range(len(values[3])+1): # (39): values, i4=0 (42): values, i4=1 ... (275): values\n if(w0*i1 + (w0+1)*i2 + (w0+2)*i3 + (w0+3)*i4 <= W): # (40): values (43): values ... (274): values\n res = max(res, values[0][i1-1] + values[1][i2-1] + values[2][i3-1] + values[3][i4-1]) # (41): values (44): values ... (224): values\n\nprint(res)"], "anno_status": [true], "diff_content": " N, W = list(map(int, input().split()))\n \n values = [[] for i in range(4)]\n \n w0, v0 = list(map(int, input().split()))\n values[0].append(v0)\n \n for i in range(N-1):\n w, v = list(map(int, input().split()))\n values[w-w0].append(v)\n \n for i in range(4):\n- values[i].sort()\n+ values[i].sort(reverse=True)\n for j in range(len(values[i])-1):\n values[i][j+1] = values[i][j] + values[i][j+1]\n values[i].append(0)\n \n res = 0\n \n for i1 in range(len(values[0])+1):\n for i2 in range(len(values[1])+1):\n for i3 in range(len(values[2])+1):\n for i4 in range(len(values[3])+1):\n if(w0*i1 + (w0+1)*i2 + (w0+2)*i3 + (w0+3)*i4 <= W):\n res = max(res, values[0][i1-1] + values[1][i2-1] + values[2][i3-1] + values[3][i4-1])\n \n print(res)\n", "FL_content": " N, W = list(map(int, input().split()))\n \n values = [[] for i in range(4)]\n \n w0, v0 = list(map(int, input().split()))\n values[0].append(v0)\n \n for i in range(N-1):\n w, v = list(map(int, input().split()))\n values[w-w0].append(v)\n \n for i in range(4):\n- values[i].sort()\n for j in range(len(values[i])-1):\n values[i][j+1] = values[i][j] + values[i][j+1]\n values[i].append(0)\n \n res = 0\n \n for i1 in range(len(values[0])+1):\n for i2 in range(len(values[1])+1):\n for i3 in range(len(values[2])+1):\n for i4 in range(len(values[3])+1):\n if(w0*i1 + (w0+1)*i2 + (w0+2)*i3 + (w0+3)*i4 <= W):\n res = max(res, values[0][i1-1] + values[1][i2-1] + values[2][i3-1] + values[3][i4-1])\n \n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u343454379", "problem_id": "p03734", "submission1_id": "s419095534", "submission2_id": "s305082922", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nN,W=map(int,input().split())\nwv=[list(map(int,input().split())) for _ in range(N)]\nw1=wv[0][0]\n\nWlist=[0]+[j*(w1+i) for j in range(1,N+1) for i in range(3*j+1)]\nWlist=sorted(set(Wlist))\nLW=len(Wlist)\ndp=[[0]*LW for _ in range(N+1)]\n\n\nfor i in range(1,N+1):\n w,v=wv[i-1]\n for j in range(LW):\n if w<=Wlist[j]: \n ind=bisect.bisect_right(Wlist,Wlist[j]-w)-1\n dp[i][j]=max(dp[i-1][j],dp[i-1][ind]+v)\n else:\n dp[i][j]=dp[i-1][j]\n\nind=bisect.bisect_right(Wlist,W)-1\nprint(dp[N][ind])", "code2": "import bisect\nN,W=map(int,input().split())\nwv=[list(map(int,input().split())) for _ in range(N)]\nw1=wv[0][0]\n\nWlist=[0]+[j*w1+i for j in range(1,N+1) for i in range(3*j+1)]\nWlist=sorted(set(Wlist))\nLW=len(Wlist)\ndp=[[0]*LW for _ in range(N+1)]\n\n\nfor i in range(1,N+1):\n w,v=wv[i-1]\n for j in range(LW):\n if w<=Wlist[j]: \n ind=bisect.bisect_right(Wlist,Wlist[j]-w)-1\n dp[i][j]=max(dp[i-1][j],dp[i-1][ind]+v)\n else:\n dp[i][j]=dp[i-1][j]\n\nind=bisect.bisect_right(Wlist,W)-1\nprint(dp[N][ind])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574211607", "date2": "1574211716", "bleu_score": "0.9903042318187123", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 103, "total_score": 104, "input": "4 9\n2 1\n3 4\n4 10\n2 4\n", "actual_output": "15\n", "expected_output": "18\n\n", "anno_code": ["import bisect\nN,W=map(int,input().split()) # (0): N=4, W=9\nwv=[list(map(int,input().split())) for _ in range(N)] # (1): wv\nw1=wv[0][0] # (2): w1=2\n\nWlist=[0]+[j*(w1+i) for j in range(1,N+1) for i in range(3*j+1)] # (3): Wlist=[0, 2, ..., 52, 56]\nWlist=sorted(set(Wlist)) # (4): Wlist=[0, 2, ..., 52, 56]\nLW=len(Wlist) # (5): LW=28\ndp=[[0]*LW for _ in range(N+1)] # (6): dp\n\n\nfor i in range(1,N+1): # (7): i=1 (121): i=2 ... (460): NO CHANGE\n w,v=wv[i-1] # (8): w=2, v=1 (122): w=3, v=4 ... (347): w=2, v=4\n for j in range(LW): # (9): j=0 (12): j=1 ... (459): NO CHANGE\n if w<=Wlist[j]: # (10): NO CHANGE (13): NO CHANGE ... (456): NO CHANGE\n ind=bisect.bisect_right(Wlist,Wlist[j]-w)-1 # (14): ind=0 (18): NO CHANGE ... (457): ind=26\n dp[i][j]=max(dp[i-1][j],dp[i-1][ind]+v) # (15): dp (19): dp ... (458): dp\n else:\n dp[i][j]=dp[i-1][j] # (11): NO CHANGE (125): NO CHANGE ... (350): NO CHANGE\n\nind=bisect.bisect_right(Wlist,W)-1 # (461): ind=7\nprint(dp[N][ind])"], "anno_status": [true], "diff_content": " import bisect\n N,W=map(int,input().split())\n wv=[list(map(int,input().split())) for _ in range(N)]\n w1=wv[0][0]\n \n-Wlist=[0]+[j*(w1+i) for j in range(1,N+1) for i in range(3*j+1)]\n+Wlist=[0]+[j*w1+i for j in range(1,N+1) for i in range(3*j+1)]\n Wlist=sorted(set(Wlist))\n LW=len(Wlist)\n dp=[[0]*LW for _ in range(N+1)]\n \n \n for i in range(1,N+1):\n w,v=wv[i-1]\n for j in range(LW):\n if w<=Wlist[j]: \n ind=bisect.bisect_right(Wlist,Wlist[j]-w)-1\n dp[i][j]=max(dp[i-1][j],dp[i-1][ind]+v)\n else:\n dp[i][j]=dp[i-1][j]\n \n ind=bisect.bisect_right(Wlist,W)-1\n print(dp[N][ind])\n", "FL_content": " import bisect\n N,W=map(int,input().split())\n wv=[list(map(int,input().split())) for _ in range(N)]\n w1=wv[0][0]\n \n-Wlist=[0]+[j*(w1+i) for j in range(1,N+1) for i in range(3*j+1)]\n Wlist=sorted(set(Wlist))\n LW=len(Wlist)\n dp=[[0]*LW for _ in range(N+1)]\n \n \n for i in range(1,N+1):\n w,v=wv[i-1]\n for j in range(LW):\n if w<=Wlist[j]: \n ind=bisect.bisect_right(Wlist,Wlist[j]-w)-1\n dp[i][j]=max(dp[i-1][j],dp[i-1][ind]+v)\n else:\n dp[i][j]=dp[i-1][j]\n \n ind=bisect.bisect_right(Wlist,W)-1\n print(dp[N][ind])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u375616706", "problem_id": "p03734", "submission1_id": "s715912307", "submission2_id": "s908733910", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\nimport heapq\n\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\nN, W = map(int, input().split())\nfirst_item = list(map(int, input().split()))\nbasew = first_item[0]\nw0 = []\nw1 = []\nw2 = []\nw3 = []\nheapq.heappush(w0, first_item[1])\nfor _ in range(N-1):\n w, v = map(int, input().split())\n w -= basew\n if w == 0:\n heapq.heappush(w0, v)\n elif w == 1:\n heapq.heappush(w1, v)\n elif w == 2:\n heapq.heappush(w2, v)\n elif w == 3:\n heapq.heappush(w3, v)\n\nw0_acc = [0]+list(accumulate(reversed(w0)))\nw1_acc = [0]+list(accumulate(reversed(w1)))\nw2_acc = [0]+list(accumulate(reversed(w2)))\nw3_acc = [0]+list(accumulate(reversed(w3)))\nv = 0\nfor i0 in range(len(w0)):\n for i1 in range(len(w1)):\n for i2 in range(len(w2)):\n for i3 in range(len(w3)):\n if basew*(i0+i1+i2+i3)+3*i3 + 2*i2 + i1 > W:\n break\n else:\n v = max(v, w0_acc[i0]+w1_acc[i1]+w2_acc[i2]+w3_acc[i3])\nprint(v)\n", "code2": "from itertools import accumulate\nimport heapq\n\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\nN, W = map(int, input().split())\nfirst_item = list(map(int, input().split()))\nbasew = first_item[0]\nw0 = []\nw1 = []\nw2 = []\nw3 = []\nw0.append(first_item[1])\nfor _ in range(N-1):\n w, v = map(int, input().split())\n w -= basew\n if w == 0:\n w0.append(v)\n elif w == 1:\n w1.append(v)\n elif w == 2:\n w2.append(v)\n elif w == 3:\n w3.append(v)\n\nw0_acc = [0]+list(accumulate(sorted(w0, reverse=True)))\nw1_acc = [0]+list(accumulate(sorted(w1, reverse=True)))\nw2_acc = [0]+list(accumulate(sorted(w2, reverse=True)))\nw3_acc = [0]+list(accumulate(sorted(w3, reverse=True)))\nv = 0\nfor i0 in range(len(w0)+1):\n for i1 in range(len(w1)+1):\n for i2 in range(len(w2)+1):\n for i3 in range(len(w3)+1):\n if basew*(i0+i1+i2+i3)+3*i3 + 2*i2 + i1 > W:\n break\n else:\n v = max(v, w0_acc[i0]+w1_acc[i1]+w2_acc[i2]+w3_acc[i3])\nprint(v)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1550867366", "date2": "1550867597", "bleu_score": "0.8966714657191884", "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, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1], "code1_test_score": 18, "total_score": 104, "input": "4 3\n2 1\n3 7\n4 10\n3 6\n", "actual_output": "0\n", "expected_output": "7\n\n", "anno_code": ["from itertools import accumulate\nimport heapq\n\nimport sys\nsys.setrecursionlimit(10**9) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\nN, W = map(int, input().split()) # (2): N=4, W=3\nfirst_item = list(map(int, input().split())) # (3): first_item=[2, 1]\nbasew = first_item[0] # (4): basew=2\nw0 = [] # (5): w0=[]\nw1 = [] # (6): w1=[]\nw2 = [] # (7): w2=[]\nw3 = [] # (8): w3=[]\nheapq.heappush(w0, first_item[1]) # (9): w0=[1]\nfor _ in range(N-1): # (10): _=0 (16): _=1 ... (29): NO CHANGE\n w, v = map(int, input().split()) # (11): w=3, v=7 (17): w=4, v=10 (24): w=3, v=6\n w -= basew # (12): w=1 (18): w=2 (25): w=1\n if w == 0: # (13): NO CHANGE (19): NO CHANGE (26): NO CHANGE\n heapq.heappush(w0, v)\n elif w == 1: # (14): NO CHANGE (20): NO CHANGE (27): NO CHANGE\n heapq.heappush(w1, v) # (15): w1=[7] (28): w1=[6, 7]\n elif w == 2: # (21): NO CHANGE\n heapq.heappush(w2, v) # (22): w2=[10]\n elif w == 3:\n heapq.heappush(w3, v)\n\nw0_acc = [0]+list(accumulate(reversed(w0))) # (30): w0_acc=[0, 1]\nw1_acc = [0]+list(accumulate(reversed(w1))) # (31): w1_acc=[0, 7, 13]\nw2_acc = [0]+list(accumulate(reversed(w2))) # (32): w2_acc=[0, 10]\nw3_acc = [0]+list(accumulate(reversed(w3))) # (33): w3_acc=[0]\nv = 0 # (34): v=0\nfor i0 in range(len(w0)): # (35): i0=0 (45): NO CHANGE\n for i1 in range(len(w1)): # (36): i1=0 (40): i1=1 (44): NO CHANGE\n for i2 in range(len(w2)): # (37): i2=0 (39): NO CHANGE ... (43): NO CHANGE\n for i3 in range(len(w3)): # (38): NO CHANGE (42): NO CHANGE\n if basew*(i0+i1+i2+i3)+3*i3 + 2*i2 + i1 > W:\n break\n else:\n v = max(v, w0_acc[i0]+w1_acc[i1]+w2_acc[i2]+w3_acc[i3])\nprint(v)\n"], "anno_status": [true], "diff_content": " from itertools import accumulate\n import heapq\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n N, W = map(int, input().split())\n first_item = list(map(int, input().split()))\n basew = first_item[0]\n w0 = []\n w1 = []\n w2 = []\n w3 = []\n-heapq.heappush(w0, first_item[1])\n+w0.append(first_item[1])\n for _ in range(N-1):\n w, v = map(int, input().split())\n w -= basew\n if w == 0:\n- heapq.heappush(w0, v)\n+ w0.append(v)\n elif w == 1:\n- heapq.heappush(w1, v)\n+ w1.append(v)\n elif w == 2:\n- heapq.heappush(w2, v)\n+ w2.append(v)\n elif w == 3:\n- heapq.heappush(w3, v)\n+ w3.append(v)\n \n-w0_acc = [0]+list(accumulate(reversed(w0)))\n-w1_acc = [0]+list(accumulate(reversed(w1)))\n-w2_acc = [0]+list(accumulate(reversed(w2)))\n-w3_acc = [0]+list(accumulate(reversed(w3)))\n+w0_acc = [0]+list(accumulate(sorted(w0, reverse=True)))\n+w1_acc = [0]+list(accumulate(sorted(w1, reverse=True)))\n+w2_acc = [0]+list(accumulate(sorted(w2, reverse=True)))\n+w3_acc = [0]+list(accumulate(sorted(w3, reverse=True)))\n v = 0\n-for i0 in range(len(w0)):\n- for i1 in range(len(w1)):\n- for i2 in range(len(w2)):\n- for i3 in range(len(w3)):\n+for i0 in range(len(w0)+1):\n+ for i1 in range(len(w1)+1):\n+ for i2 in range(len(w2)+1):\n+ for i3 in range(len(w3)+1):\n if basew*(i0+i1+i2+i3)+3*i3 + 2*i2 + i1 > W:\n break\n else:\n v = max(v, w0_acc[i0]+w1_acc[i1]+w2_acc[i2]+w3_acc[i3])\n print(v)\n \n", "FL_content": " from itertools import accumulate\n import heapq\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n N, W = map(int, input().split())\n first_item = list(map(int, input().split()))\n basew = first_item[0]\n w0 = []\n w1 = []\n w2 = []\n w3 = []\n-heapq.heappush(w0, first_item[1])\n for _ in range(N-1):\n w, v = map(int, input().split())\n w -= basew\n if w == 0:\n- heapq.heappush(w0, v)\n elif w == 1:\n- heapq.heappush(w1, v)\n elif w == 2:\n- heapq.heappush(w2, v)\n elif w == 3:\n- heapq.heappush(w3, v)\n \n-w0_acc = [0]+list(accumulate(reversed(w0)))\n-w1_acc = [0]+list(accumulate(reversed(w1)))\n-w2_acc = [0]+list(accumulate(reversed(w2)))\n-w3_acc = [0]+list(accumulate(reversed(w3)))\n v = 0\n-for i0 in range(len(w0)):\n- for i1 in range(len(w1)):\n- for i2 in range(len(w2)):\n- for i3 in range(len(w3)):\n if basew*(i0+i1+i2+i3)+3*i3 + 2*i2 + i1 > W:\n break\n else:\n v = max(v, w0_acc[i0]+w1_acc[i1]+w2_acc[i2]+w3_acc[i3])\n print(v)\n \n", "added_lines": 13, "removed_lines": 13, "code1_lines": 42 }, { "user_id": "u329407311", "problem_id": "p03734", "submission1_id": "s571689901", "submission2_id": "s561924895", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,W = map(int,input().split())\ndic = {\"0\":[],\"1\":[],\"2\":[],\"3\":[]}\nfor i in range(N):\n w,v = map(int,input().split())\n if i == 0:\n Min = w\n if w == Min:\n dic[\"0\"].append(v)\n elif w == Min+1:\n dic[\"1\"].append(v)\n elif w == Min+2:\n dic[\"2\"].append(v)\n elif w == Min+3:\n dic[\"3\"].append(v)\n \ndic[\"0\"].sort()\ndic[\"1\"].sort()\ndic[\"2\"].sort()\ndic[\"3\"].sort()\n\nans = 0\nfor i in range(len(dic[\"0\"])+1):\n for j in range(len(dic[\"1\"])+1):\n for k in range(len(dic[\"2\"])+1):\n for l in range(len(dic[\"3\"])+1): \n a = int(sum(dic[\"0\"][:i])+sum(dic[\"1\"][:j])+sum(dic[\"2\"][:k])+sum(dic[\"3\"][:l])) \n b = int(i*Min+j*(Min+1)+k*(Min+2)+l*(Min+3))\n if a > ans and b <= W:\n ans = a\nprint(int(ans))", "code2": "N,W = map(int,input().split())\ndic = {\"0\":[],\"1\":[],\"2\":[],\"3\":[]}\nfor i in range(N):\n w,v = map(int,input().split())\n if i == 0:\n Min = w\n if w == Min:\n dic[\"0\"].append(v)\n elif w == Min+1:\n dic[\"1\"].append(v)\n elif w == Min+2:\n dic[\"2\"].append(v)\n elif w == Min+3:\n dic[\"3\"].append(v)\n \ndic[\"0\"].sort(reverse=True)\ndic[\"1\"].sort(reverse=True)\ndic[\"2\"].sort(reverse=True)\ndic[\"3\"].sort(reverse=True)\n\nans = 0\nfor i in range(len(dic[\"0\"])+1):\n for j in range(len(dic[\"1\"])+1):\n for k in range(len(dic[\"2\"])+1):\n for l in range(len(dic[\"3\"])+1): \n a = int(sum(dic[\"0\"][:i])+sum(dic[\"1\"][:j])+sum(dic[\"2\"][:k])+sum(dic[\"3\"][:l])) \n b = int(i*Min+j*(Min+1)+k*(Min+2)+l*(Min+3))\n if a > ans and b <= W:\n ans = a\nprint(int(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579838334", "date2": "1579838655", "bleu_score": "0.9311400276017703", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 104, "input": "4 6\n2 1\n3 8\n2 8\n4 4\n", "actual_output": "9\n", "expected_output": "16\n\n", "anno_code": ["N,W = map(int,input().split()) # (0): N=4, W=6\ndic = {\"0\":[],\"1\":[],\"2\":[],\"3\":[]} # (1): dic={'0': [], '1': [], '2': [], '3': []}\nfor i in range(N): # (2): i=0 (8): i=1 ... (26): NO CHANGE\n w,v = map(int,input().split()) # (3): w=2, v=1 (9): w=3, v=8 ... (20): w=4, v=4\n if i == 0: # (4): NO CHANGE (10): NO CHANGE ... (21): NO CHANGE\n Min = w # (5): Min=2\n if w == Min: # (6): NO CHANGE (11): NO CHANGE ... (22): NO CHANGE\n dic[\"0\"].append(v) # (7): dic={'0': [1], '1': [], '2': [], '3': []} (18): dic={'0': [1, 8], '1': [8], '2': [], '3': []}\n elif w == Min+1: # (12): NO CHANGE (23): NO CHANGE\n dic[\"1\"].append(v) # (13): dic={'0': [1], '1': [8], '2': [], '3': []}\n elif w == Min+2: # (24): NO CHANGE\n dic[\"2\"].append(v) # (25): dic={'0': [1, 8], '1': [8], '2': [4], '3': []}\n elif w == Min+3:\n dic[\"3\"].append(v)\n \ndic[\"0\"].sort() # (27): NO CHANGE\ndic[\"1\"].sort() # (28): NO CHANGE\ndic[\"2\"].sort() # (29): NO CHANGE\ndic[\"3\"].sort() # (30): NO CHANGE\n\nans = 0 # (31): ans=0\nfor i in range(len(dic[\"0\"])+1): # (32): i=0 (64): i=1 ... (125): NO CHANGE\n for j in range(len(dic[\"1\"])+1): # (33): j=0 (48): j=1 ... (124): NO CHANGE\n for k in range(len(dic[\"2\"])+1): # (34): k=0 (40): k=1 ... (123): NO CHANGE\n for l in range(len(dic[\"3\"])+1): # (35): l=0 (39): NO CHANGE ... (122): NO CHANGE\n a = int(sum(dic[\"0\"][:i])+sum(dic[\"1\"][:j])+sum(dic[\"2\"][:k])+sum(dic[\"3\"][:l])) # (36): a=0 (42): a=4 ... (119): a=21\n b = int(i*Min+j*(Min+1)+k*(Min+2)+l*(Min+3)) # (37): b=0 (43): b=4 ... (120): b=11\n if a > ans and b <= W: # (38): NO CHANGE (44): NO CHANGE ... (121): NO CHANGE\n ans = a # (45): ans=4 (54): ans=8 (85): ans=9\nprint(int(ans))"], "anno_status": [true], "diff_content": " N,W = map(int,input().split())\n dic = {\"0\":[],\"1\":[],\"2\":[],\"3\":[]}\n for i in range(N):\n w,v = map(int,input().split())\n if i == 0:\n Min = w\n if w == Min:\n dic[\"0\"].append(v)\n elif w == Min+1:\n dic[\"1\"].append(v)\n elif w == Min+2:\n dic[\"2\"].append(v)\n elif w == Min+3:\n dic[\"3\"].append(v)\n \n-dic[\"0\"].sort()\n-dic[\"1\"].sort()\n-dic[\"2\"].sort()\n-dic[\"3\"].sort()\n+dic[\"0\"].sort(reverse=True)\n+dic[\"1\"].sort(reverse=True)\n+dic[\"2\"].sort(reverse=True)\n+dic[\"3\"].sort(reverse=True)\n \n ans = 0\n for i in range(len(dic[\"0\"])+1):\n for j in range(len(dic[\"1\"])+1):\n for k in range(len(dic[\"2\"])+1):\n for l in range(len(dic[\"3\"])+1): \n a = int(sum(dic[\"0\"][:i])+sum(dic[\"1\"][:j])+sum(dic[\"2\"][:k])+sum(dic[\"3\"][:l])) \n b = int(i*Min+j*(Min+1)+k*(Min+2)+l*(Min+3))\n if a > ans and b <= W:\n ans = a\n print(int(ans))\n", "FL_content": " N,W = map(int,input().split())\n dic = {\"0\":[],\"1\":[],\"2\":[],\"3\":[]}\n for i in range(N):\n w,v = map(int,input().split())\n if i == 0:\n Min = w\n if w == Min:\n dic[\"0\"].append(v)\n elif w == Min+1:\n dic[\"1\"].append(v)\n elif w == Min+2:\n dic[\"2\"].append(v)\n elif w == Min+3:\n dic[\"3\"].append(v)\n \n-dic[\"0\"].sort()\n-dic[\"1\"].sort()\n-dic[\"2\"].sort()\n-dic[\"3\"].sort()\n \n ans = 0\n for i in range(len(dic[\"0\"])+1):\n for j in range(len(dic[\"1\"])+1):\n for k in range(len(dic[\"2\"])+1):\n for l in range(len(dic[\"3\"])+1): \n a = int(sum(dic[\"0\"][:i])+sum(dic[\"1\"][:j])+sum(dic[\"2\"][:k])+sum(dic[\"3\"][:l])) \n b = int(i*Min+j*(Min+1)+k*(Min+2)+l*(Min+3))\n if a > ans and b <= W:\n ans = a\n print(int(ans))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 30 }, { "user_id": "u533885955", "problem_id": "p03734", "submission1_id": "s834786551", "submission2_id": "s297727492", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN,W = map(int,input().split())\nWV = [list(map(int,input().split())) for i in range(N)]\n\n\nw1 = WV[0][0]\nWV.sort()\n\nvlist = [[] for i in range(4)]\nfor i in range(N):\n w,v = WV[i][0],WV[i][1]\n d = w-w1\n vlist[d].append(v)\n \nvrui = [[0] for i in range(4)]\nfor i in range(4):\n vlist[i].sort(reverse=True)\n for v in vlist[i]:\n vrui[i].append(vrui[i][-1]+v)\n \n\n\nMAX = 0\nfor i in range(min(N+1,len(vlist[0])+1)):\n for j in range(min(N-i+1,len(vlist[1])+1)):\n for k in range(min(N-i-j+1,len(vlist[2])+1)):\n l = min(N-(i+j+k),len(vlist[3]))\n \n \n if (w1*i+(w1+1)*j+(w1+2)*k+(w1+3)*l) <= W:\n MAX = max(MAX,(vrui[0][i]+vrui[1][j]+vrui[2][k]+vrui[3][l]))\n\nprint(MAX)\n ", "code2": "\nN,W = map(int,input().split())\nWV = [list(map(int,input().split())) for i in range(N)]\n\n\nw1 = WV[0][0]\nWV.sort()\n\nvlist = [[] for i in range(4)]\nfor i in range(N):\n w,v = WV[i][0],WV[i][1]\n d = w-w1\n vlist[d].append(v)\n \nvrui = [[0] for i in range(4)]\nfor i in range(4):\n vlist[i].sort(reverse=True)\n for v in vlist[i]:\n vrui[i].append(vrui[i][-1]+v)\n \n\n\nMAX = 0\nfor i in range(min(N+1,len(vlist[0])+1)):\n for j in range(min(N-i+1,len(vlist[1])+1)):\n for k in range(min(N-i-j+1,len(vlist[2])+1)):\n for l in range(min(N-(i+j+k)+1,len(vlist[3])+1)):\n \n \n \n if (w1*i+(w1+1)*j+(w1+2)*k+(w1+3)*l) <= W:\n MAX = max(MAX,(vrui[0][i]+vrui[1][j]+vrui[2][k]+vrui[3][l]))\n\nprint(MAX)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568853866", "date2": "1568854312", "bleu_score": "0.9294624586241785", "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, 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, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "4 6\n2 0\n5 6\n4 10\n3 9\n", "actual_output": "6\n", "expected_output": "10\n\n", "anno_code": ["\nN,W = map(int,input().split()) # (0): N=4, W=6\nWV = [list(map(int,input().split())) for i in range(N)] # (1): WV\n\n\nw1 = WV[0][0] # (2): w1=2\nWV.sort() # (3): WV\n\nvlist = [[] for i in range(4)] # (4): vlist\nfor i in range(N): # (5): i=0 (9): vlist, i=1 ... (21): NO CHANGE\n w,v = WV[i][0],WV[i][1] # (6): w=2, v=0 (10): vlist=[[0], [], [], []], w=3, v=9 ... (18): vlist, w=5, v=6\n d = w-w1 # (7): d=0 (11): vlist=[[0], [], [], []], d=1 ... (19): vlist, d=3\n vlist[d].append(v) # (8): vlist (12): vlist ... (20): vlist\n \nvrui = [[0] for i in range(4)] # (22): vrui\nfor i in range(4): # (23): i=0 (28): i=1, vrui ... (43): NO CHANGE\n vlist[i].sort(reverse=True) # (24): NO CHANGE (29): vrui ... (39): vrui\n for v in vlist[i]: # (25): v=0 (27): vrui ... (42): NO CHANGE\n vrui[i].append(vrui[i][-1]+v) # (26): vrui (31): vrui ... (41): vrui\n \n\n\nMAX = 0 # (44): MAX=0\nfor i in range(min(N+1,len(vlist[0])+1)): # (45): i=0 (64): i=1 (82): NO CHANGE\n for j in range(min(N-i+1,len(vlist[1])+1)): # (46): j=0 (55): j=1 ... (81): NO CHANGE\n for k in range(min(N-i-j+1,len(vlist[2])+1)): # (47): k=0 (51): k=1 ... (80): NO CHANGE\n l = min(N-(i+j+k),len(vlist[3])) # (48): l=1 (52): NO CHANGE ... (78): NO CHANGE\n \n \n if (w1*i+(w1+1)*j+(w1+2)*k+(w1+3)*l) <= W: # (49): NO CHANGE (53): NO CHANGE ... (79): NO CHANGE\n MAX = max(MAX,(vrui[0][i]+vrui[1][j]+vrui[2][k]+vrui[3][l])) # (50): MAX=6\n\nprint(MAX)\n "], "anno_status": [true], "diff_content": " \n N,W = map(int,input().split())\n WV = [list(map(int,input().split())) for i in range(N)]\n \n \n w1 = WV[0][0]\n WV.sort()\n \n vlist = [[] for i in range(4)]\n for i in range(N):\n w,v = WV[i][0],WV[i][1]\n d = w-w1\n vlist[d].append(v)\n \n vrui = [[0] for i in range(4)]\n for i in range(4):\n vlist[i].sort(reverse=True)\n for v in vlist[i]:\n vrui[i].append(vrui[i][-1]+v)\n \n \n \n MAX = 0\n for i in range(min(N+1,len(vlist[0])+1)):\n for j in range(min(N-i+1,len(vlist[1])+1)):\n for k in range(min(N-i-j+1,len(vlist[2])+1)):\n- l = min(N-(i+j+k),len(vlist[3]))\n- \n- \n- if (w1*i+(w1+1)*j+(w1+2)*k+(w1+3)*l) <= W:\n- MAX = max(MAX,(vrui[0][i]+vrui[1][j]+vrui[2][k]+vrui[3][l]))\n+ for l in range(min(N-(i+j+k)+1,len(vlist[3])+1)):\n+ \n+ \n+ \n+ if (w1*i+(w1+1)*j+(w1+2)*k+(w1+3)*l) <= W:\n+ MAX = max(MAX,(vrui[0][i]+vrui[1][j]+vrui[2][k]+vrui[3][l]))\n \n print(MAX)\n \n", "FL_content": " \n N,W = map(int,input().split())\n WV = [list(map(int,input().split())) for i in range(N)]\n \n \n w1 = WV[0][0]\n WV.sort()\n \n vlist = [[] for i in range(4)]\n for i in range(N):\n w,v = WV[i][0],WV[i][1]\n d = w-w1\n vlist[d].append(v)\n \n vrui = [[0] for i in range(4)]\n for i in range(4):\n vlist[i].sort(reverse=True)\n for v in vlist[i]:\n vrui[i].append(vrui[i][-1]+v)\n \n \n \n MAX = 0\n for i in range(min(N+1,len(vlist[0])+1)):\n for j in range(min(N-i+1,len(vlist[1])+1)):\n for k in range(min(N-i-j+1,len(vlist[2])+1)):\n- l = min(N-(i+j+k),len(vlist[3]))\n- \n- \n- if (w1*i+(w1+1)*j+(w1+2)*k+(w1+3)*l) <= W:\n- MAX = max(MAX,(vrui[0][i]+vrui[1][j]+vrui[2][k]+vrui[3][l]))\n \n print(MAX)\n \n", "added_lines": 6, "removed_lines": 5, "code1_lines": 34 }, { "user_id": "u054106284", "problem_id": "p03734", "submission1_id": "s318752486", "submission2_id": "s296130824", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = (int(i) for i in input().split())\nw = [0]*N\nv = [0]*N\nfor i in range(N):\n w[i], v[i] = (int(j) for j in input().split())\nw0 = w[0]\nwh = [a - w0 for a in w]\ndp = [[[0]*(N+1) for i in range(3*N+1)] for j in range(N+1)]\nfor i in range(N):\n for j in range(3*N+1):\n for k in range(N+1):\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])\n if j - wh[i] >=0 and k-1 >=0:\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j-wh[i]][k-1]+v[i])\nres = 0\nfor k in range(N+1):\n if w0*k <= W <= (w0+3)*k:\n Wk = W - w0*k\n ans = 0\n for j in range(Wk+1):\n ans = max(dp[N][j][k], ans)\n res = max(res, ans)\nprint(res)\n", "code2": "N, W = (int(i) for i in input().split())\nw = [0]*N\nv = [0]*N\nfor i in range(N):\n w[i], v[i] = (int(j) for j in input().split())\nw0 = w[0]\nwh = [a - w0 for a in w]\ndp = [[[-1]*(N+1) for i in range(3*N+1)] for j in range(N+1)]\ndp[0][0][0] = 0\nfor i in range(N):\n for j in range(3*N+1):\n for k in range(N+1):\n if dp[i][j][k] != -1:\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])\n if j - wh[i] >=0 and k-1 >=0 and dp[i][j-wh[i]][k-1] != -1:\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j-wh[i]][k-1]+v[i])\nres = 0\nfor j in range(3*N+1):\n for k in range(N+1):\n if j + w0*k <= W:\n res = max(dp[N][j][k], res)\nprint(res)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1549629886", "date2": "1549649399", "bleu_score": "0.8812430732816662", "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, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 86, "total_score": 104, "input": "4 13\n0 101\n1 101\n1 100\n0 101\n", "actual_output": "0\n", "expected_output": "403\n\n", "anno_code": ["N, W = (int(i) for i in input().split()) # (0): N=4, W=13\nw = [0]*N # (1): w=[0, 0, 0, 0]\nv = [0]*N # (2): v=[0, 0, 0, 0]\nfor i in range(N): # (3): i=0 (5): i=1 ... (11): NO CHANGE\n w[i], v[i] = (int(j) for j in input().split()) # (4): v=[101, 0, 0, 0] (6): w=[0, 1, 0, 0], v=[101, 101, 0, 0] ... (10): v=[101, 101, 100, 101]\nw0 = w[0] # (12): w0=0\nwh = [a - w0 for a in w] # (13): wh=[0, 1, 1, 0]\ndp = [[[0]*(N+1) for i in range(3*N+1)] for j in range(N+1)] # (14): dp\nfor i in range(N): # (15): i=0 (290): i=1 ... (1107): NO CHANGE\n for j in range(3*N+1): # (16): j=0 (37): j=1 ... (1106): NO CHANGE\n for k in range(N+1): # (17): k=0 (20): k=1 ... (1105): NO CHANGE\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]) # (18): NO CHANGE (21): NO CHANGE ... (1102): dp\n if j - wh[i] >=0 and k-1 >=0: # (19): NO CHANGE (22): NO CHANGE ... (1103): NO CHANGE\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j-wh[i]][k-1]+v[i]) # (23): dp (27): dp ... (1104): dp\nres = 0 # (1108): res=0\nfor k in range(N+1): # (1109): k=0 (1111): k=1 ... (1119): NO CHANGE\n if w0*k <= W <= (w0+3)*k: # (1110): NO CHANGE (1112): NO CHANGE ... (1118): NO CHANGE\n Wk = W - w0*k\n ans = 0\n for j in range(Wk+1):\n ans = max(dp[N][j][k], ans)\n res = max(res, ans)\nprint(res)\n"], "anno_status": [true], "diff_content": " N, W = (int(i) for i in input().split())\n w = [0]*N\n v = [0]*N\n for i in range(N):\n w[i], v[i] = (int(j) for j in input().split())\n w0 = w[0]\n wh = [a - w0 for a in w]\n-dp = [[[0]*(N+1) for i in range(3*N+1)] for j in range(N+1)]\n+dp = [[[-1]*(N+1) for i in range(3*N+1)] for j in range(N+1)]\n+dp[0][0][0] = 0\n for i in range(N):\n for j in range(3*N+1):\n for k in range(N+1):\n- dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])\n- if j - wh[i] >=0 and k-1 >=0:\n+ if dp[i][j][k] != -1:\n+ dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])\n+ if j - wh[i] >=0 and k-1 >=0 and dp[i][j-wh[i]][k-1] != -1:\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j-wh[i]][k-1]+v[i])\n res = 0\n-for k in range(N+1):\n- if w0*k <= W <= (w0+3)*k:\n- Wk = W - w0*k\n- ans = 0\n- for j in range(Wk+1):\n- ans = max(dp[N][j][k], ans)\n- res = max(res, ans)\n+for j in range(3*N+1):\n+ for k in range(N+1):\n+ if j + w0*k <= W:\n+ res = max(dp[N][j][k], res)\n print(res)\n \n", "FL_content": " N, W = (int(i) for i in input().split())\n w = [0]*N\n v = [0]*N\n for i in range(N):\n w[i], v[i] = (int(j) for j in input().split())\n w0 = w[0]\n wh = [a - w0 for a in w]\n-dp = [[[0]*(N+1) for i in range(3*N+1)] for j in range(N+1)]\n for i in range(N):\n for j in range(3*N+1):\n for k in range(N+1):\n- dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])\n- if j - wh[i] >=0 and k-1 >=0:\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j-wh[i]][k-1]+v[i])\n res = 0\n-for k in range(N+1):\n- if w0*k <= W <= (w0+3)*k:\n- Wk = W - w0*k\n- ans = 0\n- for j in range(Wk+1):\n- ans = max(dp[N][j][k], ans)\n- res = max(res, ans)\n print(res)\n \n", "added_lines": 9, "removed_lines": 10, "code1_lines": 24 }, { "user_id": "u556160473", "problem_id": "p03734", "submission1_id": "s856999339", "submission2_id": "s593640786", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\n\nif 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\nelse:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n\nw0 = w[0]\n\nidxs = set()\nfor i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\nidxs = list(idxs) \nidx_dict = {idx:i for i,idx in enumerate(idxs)}\n\ndp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n\nfor i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n if 1:\n k = bisect.bisect_left(idxs, idxs[j]-w[i])\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n else:\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n \nprint(dp[-1][-1])", "code2": "\nif 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\nelse:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n\nw0 = w[0]\n\nidxs = set()\nfor i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\nidxs = sorted(list(idxs))\nidx_dict = {idx:i for i,idx in enumerate(idxs)}\n\ndp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n\nfor i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n \nprint(max([max(dp_) for dp_ in dp]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493519718", "date2": "1493520847", "bleu_score": "0.6913035952200476", "code1_test_status": [1, 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, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 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, 0, 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, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 104, "input": "4 6\n2 1\n3 1\n2 8\n3 1\n", "actual_output": "10\n", "expected_output": "9\n\n", "anno_code": ["import bisect\n\nif 1: # (0): NO CHANGE\n N,W = map(int, input().split(' ')) # (1): N=4, W=6\n w,v = [],[] # (2): w=[], v=[]\n for i in range(N): # (3): i=0 (7): i=1 ... (19): NO CHANGE\n w_,v_ = map(int, input().split(' ')) # (4): w_=2, v_=1 (8): w_=3 ... (16): w_=3, v_=1\n w.append(w_) # (5): w=[2] (9): w=[2, 3] ... (17): w=[2, 3, 2, 3]\n v.append(v_) # (6): v=[1] (10): v=[1, 1] ... (18): v=[1, 1, 8, 1]\nelse:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n\nw0 = w[0] # (20): w0=2\n\nidxs = set() # (21): idxs=set()\nfor i in range(N+1): # (22): i=0 (27): i=1 ... (111): NO CHANGE\n for j in range(3*i+1): # (23): j=0 (26): NO CHANGE ... (110): NO CHANGE\n if i*w0+j <= W: # (24): NO CHANGE (29): NO CHANGE ... (109): NO CHANGE\n idxs.add(i*w0+j) # (25): idxs={0} (30): idxs={0, 2} ... (63): NO CHANGE\nidxs = list(idxs) # (112): idxs=[0, 2, 3, 4, 5, 6]\nidx_dict = {idx:i for i,idx in enumerate(idxs)} # (113): idx_dict={0: 0, 2: 1, 3: 2, 4: 3, 5: 4, 6: 5}\n\ndp = [[0 for j in range(len(idxs))] for i in range(N+1)] # (114): dp\n\nfor i in range(N): # (115): i=0 (150): i=1 ... (249): NO CHANGE\n for j in range(len(idxs)): # (116): j=0 (119): j=1 ... (248): NO CHANGE\n if idxs[j] < w[i]: # (117): NO CHANGE (120): NO CHANGE ... (243): NO CHANGE\n dp[i+1][j] = dp[i][j] # (118): NO CHANGE (153): NO CHANGE ... (223): dp\n else:\n if 1: # (121): NO CHANGE (127): NO CHANGE ... (244): NO CHANGE\n k = bisect.bisect_left(idxs, idxs[j]-w[i]) # (122): k=0 (128): k=1 ... (245): k=2\n try: # (123): NO CHANGE (129): NO CHANGE ... (246): NO CHANGE\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]]) # (124): dp (130): dp ... (247): dp\n except:\n dp[i+1][j] = dp[i][j]\n else:\n try:\n dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n except:\n dp[i+1][j] = dp[i][j]\n \nprint(dp[-1][-1])"], "anno_status": [true], "diff_content": "-import bisect\n \n if 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\n else:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n \n w0 = w[0]\n \n idxs = set()\n for i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\n-idxs = list(idxs) \n+idxs = sorted(list(idxs))\n idx_dict = {idx:i for i,idx in enumerate(idxs)}\n \n dp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n \n for i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n- if 1:\n- k = bisect.bisect_left(idxs, idxs[j]-w[i])\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- else:\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- \n-print(dp[-1][-1])\n+ try:\n+ dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n+ except:\n+ dp[i+1][j] = dp[i][j]\n+ \n+print(max([max(dp_) for dp_ in dp]))\n", "FL_content": "-import bisect\n \n if 1:\n N,W = map(int, input().split(' '))\n w,v = [],[]\n for i in range(N):\n w_,v_ = map(int, input().split(' '))\n w.append(w_)\n v.append(v_)\n else:\n N,W = 4,6\n w = [2,3,4,3]\n v = [1,4,10,4]\n \n w0 = w[0]\n \n idxs = set()\n for i in range(N+1):\n for j in range(3*i+1):\n if i*w0+j <= W:\n idxs.add(i*w0+j)\n-idxs = list(idxs) \n idx_dict = {idx:i for i,idx in enumerate(idxs)}\n \n dp = [[0 for j in range(len(idxs))] for i in range(N+1)]\n \n for i in range(N):\n for j in range(len(idxs)):\n if idxs[j] < w[i]:\n dp[i+1][j] = dp[i][j]\n else:\n- if 1:\n- k = bisect.bisect_left(idxs, idxs[j]-w[i])\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[k]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- else:\n- try:\n- dp[i+1][j] = max([dp[i][j],dp[i][idx_dict[idxs[j]-w[i]]]+v[i]])\n- except:\n- dp[i+1][j] = dp[i][j]\n- \n-print(dp[-1][-1])\n", "added_lines": 7, "removed_lines": 15, "code1_lines": 44 }, { "user_id": "u994988729", "problem_id": "p03734", "submission1_id": "s128842224", "submission2_id": "s505005465", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\nN, W = map(int, input().split())\nd = {i: [0] for i in range(4)}\nfor i in range(N):\n w, v = map(int, input().split())\n if i == 0:\n w0 = w\n w -= w0\n d[w].append(v)\n\nwv = [[] for _ in range(4)]\nfor k, v in d.items():\n v.sort()\n wv[k] = tuple(accumulate(v))\n\n\n\nans = 0\nfor c0, v0 in enumerate(wv[0]):\n for c1, v1 in enumerate(wv[1]):\n for c2, v2 in enumerate(wv[2]):\n for c3, v3 in enumerate(wv[3]):\n weight = w0 * (c0 + c1 + c2 + c3) + c1 + c2 * 2 + c3 * 3\n val = v0 + v1 + v2 + v3\n if weight > W:\n continue\n ans = max(ans, val)\n\nprint(ans)\n", "code2": "from itertools import accumulate\n\nN, W = map(int, input().split())\nd = {i: [] for i in range(4)}\nfor i in range(N):\n w, v = map(int, input().split())\n if i == 0:\n w0 = w\n w -= w0\n d[w].append(v)\n\nwv = [[] for _ in range(4)]\nfor k, v in d.items():\n v.sort(reverse=True)\n v = [0] + v\n wv[k] = tuple(accumulate(v))\n\n\n\nans = 0\nfor c0, v0 in enumerate(wv[0]):\n for c1, v1 in enumerate(wv[1]):\n for c2, v2 in enumerate(wv[2]):\n for c3, v3 in enumerate(wv[3]):\n weight = w0 * (c0 + c1 + c2 + c3) + c1 + c2 * 2 + c3 * 3\n val = v0 + v1 + v2 + v3\n if weight > W:\n continue\n ans = max(ans, val)\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582204949", "date2": "1582205019", "bleu_score": "0.959853998436481", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 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, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 76, "total_score": 104, "input": "4 1\n1 100\n1 101\n1 011\n1 101\n", "actual_output": "11\n", "expected_output": "101\n\n", "anno_code": ["from itertools import accumulate\n\nN, W = map(int, input().split()) # (0): N=4, W=1\nd = {i: [0] for i in range(4)} # (1): d={0: [0], 1: [0], 2: [0], 3: [0]}\nfor i in range(N): # (2): i=0 (8): i=1 ... (23): NO CHANGE\n w, v = map(int, input().split()) # (3): w=1, v=100 (9): w=1, v=101 ... (19): w=1, v=101\n if i == 0: # (4): NO CHANGE (10): NO CHANGE ... (20): NO CHANGE\n w0 = w # (5): w0=1\n w -= w0 # (6): w=0 (11): w=0 ... (21): w=0\n d[w].append(v) # (7): d={0: [0, 100], 1: [0], 2: [0], 3: [0]} (12): d={0: [0, 100, 101], 1: [0], 2: [0], 3: [0]} ... (22): d={0: [0, 100, 101, 11, 101], 1: [0], 2: [0], 3: [0]}\n\nwv = [[] for _ in range(4)] # (24): wv\nfor k, v in d.items(): # (25): v=[0, 100, 101, 11, 101], k=0 (28): v=[0], wv=[(0, 11, 111, 212, 313), [], [], []], k=1 ... (37): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n v.sort() # (26): d={0: [0, 11, 100, 101, 101], 1: [0], 2: [0], 3: [0]}, v=[0, 11, 100, 101, 101] (29): wv=[(0, 11, 111, 212, 313), [], [], []] ... (35): wv=[(0, 11, 111, 212, 313), (0,), (0,), []]\n wv[k] = tuple(accumulate(v)) # (27): wv=[(0, 11, 111, 212, 313), [], [], []] (30): wv=[(0, 11, 111, 212, 313), (0,), [], []] ... (36): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n\n\n\nans = 0 # (38): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], ans=0\nfor c0, v0 in enumerate(wv[0]): # (39): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], c0=0, v0=0 (50): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], c0=1, v0=11 ... (94): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n for c1, v1 in enumerate(wv[1]): # (40): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], c1=0, v1=0 (49): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] ... (93): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n for c2, v2 in enumerate(wv[2]): # (41): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], c2=0, v2=0 (48): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] ... (92): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n for c3, v3 in enumerate(wv[3]): # (42): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], c3=0, v3=0 (47): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] ... (91): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n weight = w0 * (c0 + c1 + c2 + c3) + c1 + c2 * 2 + c3 * 3 # (43): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], weight=0 (54): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], weight=1 ... (87): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], weight=4\n val = v0 + v1 + v2 + v3 # (44): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], val=0 (55): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], val=11 ... (88): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], val=313\n if weight > W: # (45): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] (56): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] ... (89): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n continue # (68): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] (79): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] (90): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)]\n ans = max(ans, val) # (46): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)] (57): wv=[(0, 11, 111, 212, 313), (0,), (0,), (0,)], ans=11\n\nprint(ans)\n"], "anno_status": [false], "diff_content": " from itertools import accumulate\n \n N, W = map(int, input().split())\n-d = {i: [0] for i in range(4)}\n+d = {i: [] for i in range(4)}\n for i in range(N):\n w, v = map(int, input().split())\n if i == 0:\n w0 = w\n w -= w0\n d[w].append(v)\n \n wv = [[] for _ in range(4)]\n for k, v in d.items():\n- v.sort()\n+ v.sort(reverse=True)\n+ v = [0] + v\n wv[k] = tuple(accumulate(v))\n \n \n \n ans = 0\n for c0, v0 in enumerate(wv[0]):\n for c1, v1 in enumerate(wv[1]):\n for c2, v2 in enumerate(wv[2]):\n for c3, v3 in enumerate(wv[3]):\n weight = w0 * (c0 + c1 + c2 + c3) + c1 + c2 * 2 + c3 * 3\n val = v0 + v1 + v2 + v3\n if weight > W:\n continue\n ans = max(ans, val)\n \n print(ans)\n \n", "FL_content": " from itertools import accumulate\n \n N, W = map(int, input().split())\n-d = {i: [0] for i in range(4)}\n for i in range(N):\n w, v = map(int, input().split())\n if i == 0:\n w0 = w\n w -= w0\n d[w].append(v)\n \n wv = [[] for _ in range(4)]\n for k, v in d.items():\n- v.sort()\n wv[k] = tuple(accumulate(v))\n \n \n \n ans = 0\n for c0, v0 in enumerate(wv[0]):\n for c1, v1 in enumerate(wv[1]):\n for c2, v2 in enumerate(wv[2]):\n for c3, v3 in enumerate(wv[3]):\n weight = w0 * (c0 + c1 + c2 + c3) + c1 + c2 * 2 + c3 * 3\n val = v0 + v1 + v2 + v3\n if weight > W:\n continue\n ans = max(ans, val)\n \n print(ans)\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 31 }, { "user_id": "u545368057", "problem_id": "p03734", "submission1_id": "s188607031", "submission2_id": "s653334029", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,W = map(int, input().split())\nws = []\nvs = []\nfor i in range(N):\n w,v = map(int, input().split())\n ws.append(w)\n vs.append(v)\nws_m = [w-ws[0] for w in ws]\n\n\ndp = [[[-1]*(3*N+10) for i in range(N+1)] for j in range(N+1)]\ndp[0][0][0] = 0\nfor i,(w,v) in enumerate(zip(ws_m,vs)):\n for n in range(i+1):\n for j in range(3*N):\n dp[i+1][n][j] = max(dp[i+1][n][j], dp[i][n][j])\n if dp[i][n][j] == -1: continue\n if j + n*ws[0] + w <= W:\n dp[i+1][n+1][j+w] = max(dp[i][n][j+w], dp[i][n][j] + v)\nans= 0\nfor i,As in enumerate(dp[N]):\n w = W - i*ws[0]\n if w > 0:\n ans = max(ans,max(As[:w+1]))\nprint(ans) \n", "code2": "N,W = map(int, input().split())\nws = []\nvs = []\nfor i in range(N):\n w,v = map(int, input().split())\n ws.append(w)\n vs.append(v)\nws_m = [w-ws[0] for w in ws]\n\n\ndp = [[[-1]*(3*N+10) for i in range(N+1)] for j in range(N+1)]\ndp[0][0][0] = 0\nfor i,(w,v) in enumerate(zip(ws_m,vs)):\n for n in range(i+1):\n for j in range(3*N):\n dp[i+1][n][j] = max(dp[i+1][n][j], dp[i][n][j])\n \n if j + (n+1)*ws[0] + w <= W:\n dp[i+1][n+1][j+w] = max(dp[i][n][j+w], dp[i][n][j] + v)\n\nans= 0\nfor i,As in enumerate(dp[N]):\n w = min(W - i*ws[0], sum(ws_m))\n if w >= 0:\n ans = max(ans,max(As[:w+1]))\nprint(ans) \n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585934629", "date2": "1585934836", "bleu_score": "0.9449851982073839", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 104, "input": "4 2\n1 100\n1 110\n1 111\n1 100\n", "actual_output": "111\n", "expected_output": "221\n\n", "anno_code": ["N,W = map(int, input().split()) # (0): N=4, W=2\nws = [] # (1): ws=[]\nvs = [] # (2): vs=[]\nfor i in range(N): # (3): i=0 (7): i=1 ... (19): NO CHANGE\n w,v = map(int, input().split()) # (4): w=1, v=100 (8): v=110 ... (16): v=100\n ws.append(w) # (5): ws=[1] (9): ws=[1, 1] ... (17): ws=[1, 1, 1, 1]\n vs.append(v) # (6): vs=[100] (10): vs=[100, 110] ... (18): vs=[100, 110, 111, 100]\nws_m = [w-ws[0] for w in ws] # (20): ws_m=[0, 0, 0, 0]\n\n\ndp = [[[-1]*(3*N+10) for i in range(N+1)] for j in range(N+1)] # (21): dp\ndp[0][0][0] = 0 # (22): dp\nfor i,(w,v) in enumerate(zip(ws_m,vs)): # (23): i=0, w=0 (65): i=1, v=110 ... (430): NO CHANGE\n for n in range(i+1): # (24): n=0 (64): NO CHANGE ... (429): NO CHANGE\n for j in range(3*N): # (25): j=0 (30): j=1 ... (428): NO CHANGE\n dp[i+1][n][j] = max(dp[i+1][n][j], dp[i][n][j]) # (26): dp (31): NO CHANGE ... (426): NO CHANGE\n if dp[i][n][j] == -1: continue # (27): NO CHANGE (32): NO CHANGE ... (427): NO CHANGE\n if j + n*ws[0] + w <= W: # (28): NO CHANGE (70): NO CHANGE ... (394): NO CHANGE\n dp[i+1][n+1][j+w] = max(dp[i][n][j+w], dp[i][n][j] + v) # (29): dp (71): dp ... (355): dp\nans= 0 # (431): ans=0\nfor i,As in enumerate(dp[N]): # (432): i=0, As=[0, -1, ..., -1, -1] (436): i=1, As=[111, -1, ..., -1, -1] ... (449): NO CHANGE\n w = W - i*ws[0] # (433): w=2 (437): w=1 ... (447): w=-2\n if w > 0: # (434): NO CHANGE (438): NO CHANGE ... (448): NO CHANGE\n ans = max(ans,max(As[:w+1])) # (435): NO CHANGE (439): ans=111\nprint(ans) \n"], "anno_status": [true], "diff_content": " N,W = map(int, input().split())\n ws = []\n vs = []\n for i in range(N):\n w,v = map(int, input().split())\n ws.append(w)\n vs.append(v)\n ws_m = [w-ws[0] for w in ws]\n \n \n dp = [[[-1]*(3*N+10) for i in range(N+1)] for j in range(N+1)]\n dp[0][0][0] = 0\n for i,(w,v) in enumerate(zip(ws_m,vs)):\n for n in range(i+1):\n for j in range(3*N):\n dp[i+1][n][j] = max(dp[i+1][n][j], dp[i][n][j])\n- if dp[i][n][j] == -1: continue\n- if j + n*ws[0] + w <= W:\n+ \n+ if j + (n+1)*ws[0] + w <= W:\n dp[i+1][n+1][j+w] = max(dp[i][n][j+w], dp[i][n][j] + v)\n+\n ans= 0\n for i,As in enumerate(dp[N]):\n- w = W - i*ws[0]\n- if w > 0:\n+ w = min(W - i*ws[0], sum(ws_m))\n+ if w >= 0:\n ans = max(ans,max(As[:w+1]))\n print(ans) \n \n", "FL_content": " N,W = map(int, input().split())\n ws = []\n vs = []\n for i in range(N):\n w,v = map(int, input().split())\n ws.append(w)\n vs.append(v)\n ws_m = [w-ws[0] for w in ws]\n \n \n dp = [[[-1]*(3*N+10) for i in range(N+1)] for j in range(N+1)]\n dp[0][0][0] = 0\n for i,(w,v) in enumerate(zip(ws_m,vs)):\n for n in range(i+1):\n for j in range(3*N):\n dp[i+1][n][j] = max(dp[i+1][n][j], dp[i][n][j])\n- if dp[i][n][j] == -1: continue\n- if j + n*ws[0] + w <= W:\n dp[i+1][n+1][j+w] = max(dp[i][n][j+w], dp[i][n][j] + v)\n ans= 0\n for i,As in enumerate(dp[N]):\n- w = W - i*ws[0]\n- if w > 0:\n ans = max(ans,max(As[:w+1]))\n print(ans) \n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 26 }, { "user_id": "u458617779", "problem_id": "p03734", "submission1_id": "s833364379", "submission2_id": "s724635535", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ints = input().split(\" \")\nN = int(ints[0])\nmaxW = int(ints[1])\nints = input().split(\" \")\na = int(ints[0])\nb = int(ints[1])\nweight = [a, a+1, a+2, a+3] \nva = [[0,b],[0],[0],[0]]\nfor i in range(1, N):\n\tins = input().split(\" \")\n\tw = int(ins[0])\n\tv = int(ins[1])\n\tfor j in range(0, 4):\n\t\tif w == weight[j]:\n\t\t\tva[j].append(v)\nsum = [[0],[0],[0],[0]]\nfor j in range(0, 4):\n\tfor i in range(1, len(va[j])):\n\t\ttry:\n\t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n\t\texcept:\n\t\t\tpass\nans = 0\nfor i in range(0, len(va[0])):\n\tfor j in range(0, len(va[1])):\n\t\tfor k in range(0, len(va[2])):\n\t\t\tfor l in range(0, len(va[3])):\n\t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n\t\t\t\tif(sumw <= maxW):\n\t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\nprint(ans)", "code2": "ints = input().split(\" \")\nN = int(ints[0])\nmaxW = int(ints[1])\nints = input().split(\" \")\na = int(ints[0])\nb = int(ints[1])\nweight = [a, a+1, a+2, a+3] \nva = [[b],[],[],[]]\nfor i in range(1, N):\n\tins = input().split(\" \")\n\tw = int(ins[0])\n\tv = int(ins[1])\n\tfor j in range(0, 4):\n\t\tif w == weight[j]:\n\t\t\tva[j].append(v)\nfor i in range(0, len(va)):\n\tva[i].sort(reverse=True)\n\tva[i].insert(0,0)\n\nsum = [[0],[0],[0],[0]]\nfor j in range(0, 4):\n\tfor i in range(1, len(va[j])):\n\t\ttry:\n\t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n\t\texcept:\n\t\t\tpass\nans = 0\n\nfor i in range(0, len(va[0])):\n\tfor j in range(0, len(va[1])):\n\t\tfor k in range(0, len(va[2])):\n\t\t\tfor l in range(0, len(va[3])):\n\t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n\t\t\t\tif(sumw <= maxW):\n\t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528595870", "date2": "1528596309", "bleu_score": "0.9018721331891326", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 104, "input": "4 6\n2 1\n3 12\n2 8\n3 4\n", "actual_output": "16\n", "expected_output": "20\n\n", "anno_code": ["ints = input().split(\" \") # (0): ints=['4', '6']\nN = int(ints[0]) # (1): N=4\nmaxW = int(ints[1]) # (2): maxW=6\nints = input().split(\" \") # (3): ints=['2', '1']\na = int(ints[0]) # (4): a=2\nb = int(ints[1]) # (5): b=1\nweight = [a, a+1, a+2, a+3] # (6): weight=[2, 3, 4, 5]\nva = [[0,b],[0],[0],[0]] # (7): va\nfor i in range(1, N): # (8): va=[[0, 1], [0], [0], [0]], i=1 (22): va, i=2 ... (50): va\n\tins = input().split(\" \") # (9): va=[[0, 1], [0], [0], [0]], ins=['3', '12'] (23): va=[[0, 1], [0, 12], [0], [0]], ins=['2', '8'] (37): va, ins=['3', '4']\n\tw = int(ins[0]) # (10): va=[[0, 1], [0], [0], [0]], w=3 (24): va=[[0, 1], [0, 12], [0], [0]], w=2 (38): va, w=3\n\tv = int(ins[1]) # (11): va=[[0, 1], [0], [0], [0]], v=12 (25): va=[[0, 1], [0, 12], [0], [0]], v=8 (39): va, v=4\n\tfor j in range(0, 4): # (12): va, j=0 (14): va, j=1 ... (49): va\n\t\tif w == weight[j]: # (13): va (15): va ... (48): va\n\t\t\tva[j].append(v) # (16): va=[[0, 1], [0, 12], [0], [0]] (28): va (44): va\nsum = [[0],[0],[0],[0]] # (51): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum\nfor j in range(0, 4): # (52): va, j=0 (60): va, j=1, sum ... (72): va, sum\n\tfor i in range(1, len(va[j])): # (53): va, i=1 (56): va, i=2, sum ... (71): va, sum\n\t\ttry: # (54): va (57): va, sum ... (65): va, sum\n\t\t\tsum[j].append(sum[j][i-1] + va[j][i]) # (55): va, sum (58): va, sum ... (66): va, sum\n\t\texcept:\n\t\t\tpass\nans = 0 # (73): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum, ans=0\nfor i in range(0, len(va[0])): # (74): va, i=0, sum (100): va, i=1, sum ... (149): va, sum\n\tfor j in range(0, len(va[1])): # (75): va, j=0, sum (83): va, j=1, sum ... (148): va, sum\n\t\tfor k in range(0, len(va[2])): # (76): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum, k=0 (82): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum ... (147): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum\n\t\t\tfor l in range(0, len(va[3])): # (77): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum, l=0 (81): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum ... (146): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum\n\t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l # (78): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum, sumw=0 (86): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum, sumw=3 ... (144): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum, sumw=10\n\t\t\t\tif(sumw <= maxW): # (79): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum (87): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum ... (145): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum\n\t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans) # (80): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum (88): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum, ans=12 ... (131): va=[[0, 1, 8], [0, 12, 4], [0], [0]], sum\nprint(ans)"], "anno_status": [false], "diff_content": " ints = input().split(\" \")\n N = int(ints[0])\n maxW = int(ints[1])\n ints = input().split(\" \")\n a = int(ints[0])\n b = int(ints[1])\n weight = [a, a+1, a+2, a+3] \n-va = [[0,b],[0],[0],[0]]\n+va = [[b],[],[],[]]\n for i in range(1, N):\n \tins = input().split(\" \")\n \tw = int(ins[0])\n \tv = int(ins[1])\n \tfor j in range(0, 4):\n \t\tif w == weight[j]:\n \t\t\tva[j].append(v)\n+for i in range(0, len(va)):\n+\tva[i].sort(reverse=True)\n+\tva[i].insert(0,0)\n+\n sum = [[0],[0],[0],[0]]\n for j in range(0, 4):\n \tfor i in range(1, len(va[j])):\n \t\ttry:\n \t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n \t\texcept:\n \t\t\tpass\n ans = 0\n+\n for i in range(0, len(va[0])):\n \tfor j in range(0, len(va[1])):\n \t\tfor k in range(0, len(va[2])):\n \t\t\tfor l in range(0, len(va[3])):\n \t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n \t\t\t\tif(sumw <= maxW):\n \t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\n print(ans)\n", "FL_content": " ints = input().split(\" \")\n N = int(ints[0])\n maxW = int(ints[1])\n ints = input().split(\" \")\n a = int(ints[0])\n b = int(ints[1])\n weight = [a, a+1, a+2, a+3] \n-va = [[0,b],[0],[0],[0]]\n for i in range(1, N):\n \tins = input().split(\" \")\n \tw = int(ins[0])\n \tv = int(ins[1])\n \tfor j in range(0, 4):\n \t\tif w == weight[j]:\n \t\t\tva[j].append(v)\n sum = [[0],[0],[0],[0]]\n for j in range(0, 4):\n \tfor i in range(1, len(va[j])):\n \t\ttry:\n \t\t\tsum[j].append(sum[j][i-1] + va[j][i])\n \t\texcept:\n \t\t\tpass\n ans = 0\n for i in range(0, len(va[0])):\n \tfor j in range(0, len(va[1])):\n \t\tfor k in range(0, len(va[2])):\n \t\t\tfor l in range(0, len(va[3])):\n \t\t\t\tsumw = weight[0]*i + weight[1]*j +weight[2]*k + weight[3]*l\n \t\t\t\tif(sumw <= maxW):\n \t\t\t\t\tans = max(sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l],ans)\n print(ans)\n", "added_lines": 6, "removed_lines": 1, "code1_lines": 31 }, { "user_id": "u143509139", "problem_id": "p03734", "submission1_id": "s286031006", "submission2_id": "s101650156", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j][k] = dp[i][j][k]\n else:\n dp[i + 1][j][k] = dp[i][j][k]\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)\n", "code2": "n, W = map(int, input().split())\ndp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\nli = [list(map(int, input().split())) for _ in range(n)]\np = li[0][0]\nfor i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n dp[i + 1][j + 1][k] = dp[i][j + 1][k]\nans = 0\nfor i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571098502", "date2": "1571267815", "bleu_score": "0.9606958213666288", "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, 0, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "4 2\n1 100\n1 110\n1 111\n1 100\n", "actual_output": "211\n", "expected_output": "221\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k]:\n+ if dp[i][j][k - w] + v > dp[i][j + 1][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n+ dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n+ dp[i + 1][j + 1][k] = dp[i][j + 1][k]\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n \n", "FL_content": " n, W = map(int, input().split())\n dp = [[[0] * 301 for _ in range(n + 1)] for _ in range(n + 1)]\n li = [list(map(int, input().split())) for _ in range(n)]\n p = li[0][0]\n for i, x in enumerate(li):\n w, v = x\n w -= p\n for j in range(i + 1):\n for k in range(301):\n if k >= w:\n- if dp[i][j][k - w] + v > dp[i][j][k]:\n dp[i + 1][j + 1][k] = dp[i][j][k - w] + v\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n else:\n- dp[i + 1][j][k] = dp[i][j][k]\n ans = 0\n for i in range(n + 1):\n for k in range(301):\n if i * p + k <= W:\n ans = max(dp[n][i][k], ans)\n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 23 }, { "user_id": "u334712262", "problem_id": "p03734", "submission1_id": "s568317192", "submission2_id": "s478781876", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations, accumulate\nfrom operator import add, mul, sub, itemgetter, attrgetter\n\n\nimport sys\n\n\nreadline = sys.stdin.readline\n\nINF = 2**62-1\n\n\ndef read_int():\n return int(readline())\n\n\ndef read_int_n():\n return list(map(int, readline().split()))\n\n\ndef read_float():\n return float(readline())\n\n\ndef read_float_n():\n return list(map(float, readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef ep(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n\n ep(e - s, 'sec')\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, W, WV):\n vl = {}\n vl[WV[0][0]] = list()\n vl[WV[0][0]+1] = list()\n vl[WV[0][0]+2] = list()\n vl[WV[0][0]+3] = list()\n for w, v in WV:\n vl[w].append(v)\n\n for v in vl.values():\n v.sort(reverse=True)\n v.insert(0, 0)\n\n\n wi, wj, wk, wl = vl.keys()\n ans = 0\n vis = 0\n for i, vi in enumerate(vl[wi]):\n if wi * i > W:\n break\n vis += vi\n vjs = 0\n for j, vj in enumerate(vl[wj]):\n if wi * i + wj * j > W:\n break\n vjs += vj\n vks = 0\n for k, vk in enumerate(vl[wk]):\n if wi*i + wj*j + wk*k> W:\n break\n vks += vk\n ans = max(ans, vis+vjs+vks)\n return ans\n\n\n\n\n\ndef main():\n N, W = read_int_n()\n WV = [read_int_n() for _ in range(N)]\n print(slv(N, W, WV))\n\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations, accumulate\nfrom operator import add, mul, sub, itemgetter, attrgetter\n\n\nimport sys\n\n\nreadline = sys.stdin.readline\n\nINF = 2**62-1\n\n\ndef read_int():\n return int(readline())\n\n\ndef read_int_n():\n return list(map(int, readline().split()))\n\n\ndef read_float():\n return float(readline())\n\n\ndef read_float_n():\n return list(map(float, readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef ep(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n\n ep(e - s, 'sec')\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, W, WV):\n vl = {}\n vl[WV[0][0]] = list()\n vl[WV[0][0]+1] = list()\n vl[WV[0][0]+2] = list()\n vl[WV[0][0]+3] = list()\n for w, v in WV:\n vl[w].append(v)\n\n for v in vl.values():\n v.sort(reverse=True)\n v.insert(0, 0)\n\n\n wi, wj, wk, wl = vl.keys()\n ans = 0\n vis = 0\n for i, vi in enumerate(vl[wi]):\n if wi * i > W:\n break\n vis += vi\n vjs = 0\n for j, vj in enumerate(vl[wj]):\n if wi * i + wj * j > W:\n break\n vjs += vj\n vks = 0\n for k, vk in enumerate(vl[wk]):\n if wi*i + wj*j + wk*k> W:\n break\n vks += vk\n vls = 0\n for l, vll in enumerate(vl[wl]):\n if wi*i + wj*j + wk*k + wl*l> W:\n break\n vls += vll\n ans = max(ans, vis+vjs+vks+vls)\n return ans\n\n\n\n\n\ndef main():\n N, W = read_int_n()\n WV = [read_int_n() for _ in range(N)]\n print(slv(N, W, WV))\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1599589456", "date2": "1599589537", "bleu_score": "0.9118185017311348", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 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, 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], "code1_test_score": 95, "total_score": 104, "input": "4 10\n1 100\n4 101\n1 111\n1 100\n", "actual_output": "311\n", "expected_output": "412\n\n", "anno_code": [" # (0): bisect=, heapq=, math=, random=, Counter=, defaultdict=, deque=, ROUND_CEILING=ROUND_CEILING, ROUND_HALF_UP=ROUND_HALF_UP, Decimal=, Fraction=, lru_cache=, reduce=, combinations=, combinations_with_replacement=, product=, permutations=, accumulate=, add=, mul=, sub=, itemgetter=, attrgetter=, sys=\nimport bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations, accumulate\nfrom operator import add, mul, sub, itemgetter, attrgetter\n\n\nimport sys\n\n\nreadline = sys.stdin.readline # (1): readline=\n\nINF = 2**62-1 # (2): INF=4611686018427387903\n\n\ndef read_int(): # (3): read_int=\n return int(readline())\n\n\ndef read_int_n(): # (4): read_int_n=\n return list(map(int, readline().split()))\n\n\ndef read_float(): # (5): read_float=\n return float(readline())\n\n\ndef read_float_n(): # (6): read_float_n=\n return list(map(float, readline().split()))\n\n\ndef read_str(): # (7): read_str=\n return readline().strip()\n\n\ndef read_str_n(): # (8): read_str_n=\n return readline().strip().split()\n\n\ndef ep(*args): # (9): ep=\n print(*args, file=sys.stderr)\n\n\ndef mt(f): # (10): mt=\n import time\n\n def wrap(*args, **kwargs): # (13): bisect=, heapq=, math=, random=, Counter=, defaultdict=, deque=, ROUND_CEILING=ROUND_CEILING, ROUND_HALF_UP=ROUND_HALF_UP, Decimal=, Fraction=, lru_cache=, reduce=, combinations=, combinations_with_replacement=, product=, permutations=, accumulate=, add=, mul=, sub=, itemgetter=, attrgetter=, sys=, readline=, INF=4611686018427387903, read_int=, read_int_n=, read_float=, read_float_n=, read_str=, read_str_n=, ep=, mt=, slv=.wrap at 0x0000026B0C2285E0>\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n\n ep(e - s, 'sec')\n return ret\n\n return wrap\n\n\n@mt # (11): NO CHANGE\ndef slv(N, W, WV): # (12): f=, time=\n vl = {}\n vl[WV[0][0]] = list()\n vl[WV[0][0]+1] = list()\n vl[WV[0][0]+2] = list()\n vl[WV[0][0]+3] = list()\n for w, v in WV:\n vl[w].append(v)\n\n for v in vl.values():\n v.sort(reverse=True)\n v.insert(0, 0)\n\n\n wi, wj, wk, wl = vl.keys()\n ans = 0\n vis = 0\n for i, vi in enumerate(vl[wi]):\n if wi * i > W:\n break\n vis += vi\n vjs = 0\n for j, vj in enumerate(vl[wj]):\n if wi * i + wj * j > W:\n break\n vjs += vj\n vks = 0\n for k, vk in enumerate(vl[wk]):\n if wi*i + wj*j + wk*k> W:\n break\n vks += vk\n ans = max(ans, vis+vjs+vks)\n return ans\n\n\n\n\n\ndef main(): # (14): main=\n N, W = read_int_n()\n WV = [read_int_n() for _ in range(N)]\n print(slv(N, W, WV))\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " \n import bisect\n import heapq\n import math\n import random\n from collections import Counter, defaultdict, deque\n from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\n from fractions import Fraction\n from functools import lru_cache, reduce\n from itertools import combinations, combinations_with_replacement, product, permutations, accumulate\n from operator import add, mul, sub, itemgetter, attrgetter\n \n \n import sys\n \n \n readline = sys.stdin.readline\n \n INF = 2**62-1\n \n \n def read_int():\n return int(readline())\n \n \n def read_int_n():\n return list(map(int, readline().split()))\n \n \n def read_float():\n return float(readline())\n \n \n def read_float_n():\n return list(map(float, readline().split()))\n \n \n def read_str():\n return readline().strip()\n \n \n def read_str_n():\n return readline().strip().split()\n \n \n def ep(*args):\n print(*args, file=sys.stderr)\n \n \n def mt(f):\n import time\n \n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n \n ep(e - s, 'sec')\n return ret\n \n return wrap\n \n \n @mt\n def slv(N, W, WV):\n vl = {}\n vl[WV[0][0]] = list()\n vl[WV[0][0]+1] = list()\n vl[WV[0][0]+2] = list()\n vl[WV[0][0]+3] = list()\n for w, v in WV:\n vl[w].append(v)\n \n for v in vl.values():\n v.sort(reverse=True)\n v.insert(0, 0)\n \n \n wi, wj, wk, wl = vl.keys()\n ans = 0\n vis = 0\n for i, vi in enumerate(vl[wi]):\n if wi * i > W:\n break\n vis += vi\n vjs = 0\n for j, vj in enumerate(vl[wj]):\n if wi * i + wj * j > W:\n break\n vjs += vj\n vks = 0\n for k, vk in enumerate(vl[wk]):\n if wi*i + wj*j + wk*k> W:\n break\n vks += vk\n- ans = max(ans, vis+vjs+vks)\n+ vls = 0\n+ for l, vll in enumerate(vl[wl]):\n+ if wi*i + wj*j + wk*k + wl*l> W:\n+ break\n+ vls += vll\n+ ans = max(ans, vis+vjs+vks+vls)\n return ans\n \n \n \n \n \n def main():\n N, W = read_int_n()\n WV = [read_int_n() for _ in range(N)]\n print(slv(N, W, WV))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import bisect\n import heapq\n import math\n import random\n from collections import Counter, defaultdict, deque\n from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\n from fractions import Fraction\n from functools import lru_cache, reduce\n from itertools import combinations, combinations_with_replacement, product, permutations, accumulate\n from operator import add, mul, sub, itemgetter, attrgetter\n \n \n import sys\n \n \n readline = sys.stdin.readline\n \n INF = 2**62-1\n \n \n def read_int():\n return int(readline())\n \n \n def read_int_n():\n return list(map(int, readline().split()))\n \n \n def read_float():\n return float(readline())\n \n \n def read_float_n():\n return list(map(float, readline().split()))\n \n \n def read_str():\n return readline().strip()\n \n \n def read_str_n():\n return readline().strip().split()\n \n \n def ep(*args):\n print(*args, file=sys.stderr)\n \n \n def mt(f):\n import time\n \n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n \n ep(e - s, 'sec')\n return ret\n \n return wrap\n \n \n @mt\n def slv(N, W, WV):\n vl = {}\n vl[WV[0][0]] = list()\n vl[WV[0][0]+1] = list()\n vl[WV[0][0]+2] = list()\n vl[WV[0][0]+3] = list()\n for w, v in WV:\n vl[w].append(v)\n \n for v in vl.values():\n v.sort(reverse=True)\n v.insert(0, 0)\n \n \n wi, wj, wk, wl = vl.keys()\n ans = 0\n vis = 0\n for i, vi in enumerate(vl[wi]):\n if wi * i > W:\n break\n vis += vi\n vjs = 0\n for j, vj in enumerate(vl[wj]):\n if wi * i + wj * j > W:\n break\n vjs += vj\n vks = 0\n for k, vk in enumerate(vl[wk]):\n if wi*i + wj*j + wk*k> W:\n break\n vks += vk\n- ans = max(ans, vis+vjs+vks)\n return ans\n \n \n \n \n \n def main():\n N, W = read_int_n()\n WV = [read_int_n() for _ in range(N)]\n print(slv(N, W, WV))\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 6, "removed_lines": 1, "code1_lines": 111 }, { "user_id": "u637175065", "problem_id": "p03734", "submission1_id": "s525440127", "submission2_id": "s005462520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\n\ndef main():\n n,W = LI()\n a = [LI() for _ in range(n)]\n r = 0\n d = collections.defaultdict(int)\n d[0] = 0\n for w,v in a:\n for e,f in list(d.items()):\n if e+w > W:\n continue\n if d[e+w] < d[e] + v:\n d[e+w] = d[e] + v\n\n return max(d.values())\n\n\nprint(main())\n", "code2": "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\n\ndef main():\n n,W = LI()\n a = [LI() for _ in range(n)]\n r = 0\n d = collections.defaultdict(int)\n d[0] = 0\n for w,v in a:\n for e,f in sorted(list(d.items()), key=lambda x: -x[0]):\n if e+w > W:\n continue\n if d[e+w] < d[e] + v:\n d[e+w] = d[e] + v\n\n return max(d.values())\n\n\nprint(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493514688", "date2": "1493514854", "bleu_score": "0.9645437080460734", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 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, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 64, "total_score": 104, "input": "4 6\n2 1\n3 6\n2 8\n3 4\n", "actual_output": "16\n", "expected_output": "14\n\n", "anno_code": ["import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\ninf = 10**20 # (1): inf=100000000000000000000\nmod = 10**9 + 7 # (2): mod=1000000007, LI=, LI_=, LF=, LS=, I=, F=, S=\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\n\ndef main(): # (3): main=\n n,W = LI() # (5): n=4, W=6\n a = [LI() for _ in range(n)] # (6): a\n r = 0 # (7): r=0\n d = collections.defaultdict(int) # (8): d=defaultdict(, {})\n d[0] = 0 # (9): d=defaultdict(, {0: 0})\n for w,v in a: # (10): w=2, v=1 (16): w=3, v=6 ... (43): w=3, v=4\n for e,f in list(d.items()): # (11): e=0, f=0 (15): NO CHANGE ... (60): NO CHANGE\n if e+w > W: # (12): NO CHANGE (18): NO CHANGE ... (58): NO CHANGE\n continue # (41): NO CHANGE (56): NO CHANGE (59): NO CHANGE\n if d[e+w] < d[e] + v: # (13): d=defaultdict(, {0: 0, 2: 0}) (19): d=defaultdict(, {0: 0, 2: 1, 3: 0}) ... (52): d=defaultdict(, {0: 0, 2: 8, 3: 6, 5: 14, 4: 16, 6: 0})\n d[e+w] = d[e] + v # (14): d=defaultdict(, {0: 0, 2: 1}) (20): d=defaultdict(, {0: 0, 2: 1, 3: 6}) ... (53): d=defaultdict(, {0: 0, 2: 8, 3: 6, 5: 14, 4: 16, 6: 10})\n\n return max(d.values())\n\n\nprint(main()) # (4): NO CHANGE\n"], "anno_status": [true], "diff_content": " import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n \n sys.setrecursionlimit(10**7)\n inf = 10**20\n mod = 10**9 + 7\n \n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def S(): return input()\n \n \n def main():\n n,W = LI()\n a = [LI() for _ in range(n)]\n r = 0\n d = collections.defaultdict(int)\n d[0] = 0\n for w,v in a:\n- for e,f in list(d.items()):\n+ for e,f in sorted(list(d.items()), key=lambda x: -x[0]):\n if e+w > W:\n continue\n if d[e+w] < d[e] + v:\n d[e+w] = d[e] + v\n \n return max(d.values())\n \n \n print(main())\n \n", "FL_content": " import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n \n sys.setrecursionlimit(10**7)\n inf = 10**20\n mod = 10**9 + 7\n \n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def S(): return input()\n \n \n def main():\n n,W = LI()\n a = [LI() for _ in range(n)]\n r = 0\n d = collections.defaultdict(int)\n d[0] = 0\n for w,v in a:\n- for e,f in list(d.items()):\n if e+w > W:\n continue\n if d[e+w] < d[e] + v:\n d[e+w] = d[e] + v\n \n return max(d.values())\n \n \n print(main())\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 33 }, { "user_id": "u994935583", "problem_id": "p02699", "submission1_id": "s723755036", "submission2_id": "s698622970", "status1": "Wrong Answer", "status2": "Accepted", "code1": "nums = input().split()\n\nS = int(nums[0])\nW = int(nums[1])\n\n\nif (S < W ):\n\tprint(\"unsafe\")\nelse:\n\tprint(\"safe\")", "code2": "nums = input().split()\n\nS = int(nums[0])\nW = int(nums[1])\n\n\nif (S > W ):\n\tprint(\"safe\")\nelse:\n\tprint(\"unsafe\")\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949642", "date2": "1587949725", "bleu_score": "0.9678715417213165", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 18, "total_score": 20, "input": "001 1\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["nums = input().split() # (0): nums=['001', '1']\n\nS = int(nums[0]) # (1): S=1\nW = int(nums[1]) # (2): W=1\n\n\nif (S < W ): # (3): NO CHANGE\n\tprint(\"unsafe\")\nelse:\n\tprint(\"safe\")"], "anno_status": [true], "diff_content": " nums = input().split()\n \n S = int(nums[0])\n W = int(nums[1])\n \n \n-if (S < W ):\n-\tprint(\"unsafe\")\n-else:\n+if (S > W ):\n \tprint(\"safe\")\n+else:\n+\tprint(\"unsafe\")\n+\n", "FL_content": " nums = input().split()\n \n S = int(nums[0])\n W = int(nums[1])\n \n \n-if (S < W ):\n-\tprint(\"unsafe\")\n-else:\n \tprint(\"safe\")\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u912867658", "problem_id": "p02699", "submission1_id": "s020923192", "submission2_id": "s242589989", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s,w = input().split()\nprint(\"safe\") if s < w else print(\"unsafe\")", "code2": "s,w = input().split()\nprint(\"safe\") if int(s) > int(w) else print(\"unsafe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587993363", "date2": "1587993623", "bleu_score": "0.7876084260200982", "code1_test_status": [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": 20, "input": "000 -1\n", "actual_output": "unsafe\n", "expected_output": "safe\n\n", "anno_code": ["s,w = input().split() # (0): s=000, w=-1\nprint(\"safe\") if s < w else print(\"unsafe\")"], "anno_status": [true], "diff_content": " s,w = input().split()\n-print(\"safe\") if s < w else print(\"unsafe\")\n+print(\"safe\") if int(s) > int(w) else print(\"unsafe\")\n", "FL_content": " s,w = input().split()\n-print(\"safe\") if s < w else print(\"unsafe\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u969080040", "problem_id": "p02699", "submission1_id": "s967271834", "submission2_id": "s671891861", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s,w=input().split()\nif s<=w:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "code2": "s,w=map(int, input().split())\nif s<=w:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587955526", "date2": "1587955659", "bleu_score": "0.8390176870426452", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 19, "total_score": 20, "input": "000 0\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["s,w=input().split() # (0): s=000, w=0\nif s<=w: # (1): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": "-s,w=input().split()\n+s,w=map(int, input().split())\n if s<=w:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "FL_content": "-s,w=input().split()\n if s<=w:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u686989171", "problem_id": "p02699", "submission1_id": "s776065719", "submission2_id": "s289800810", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ns, w = map(int, input().split())\nif sw:\n print('safe')\nelse:\n print('unsafe')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588423225", "date2": "1588423443", "bleu_score": "0.9579349024329277", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 2, "total_score": 20, "input": "0 -23\n", "actual_output": "unsafe\n", "expected_output": "safe\n\n", "anno_code": ["\ns, w = map(int, input().split()) # (0): s=0, w=-23\nif sw:\n print('safe')\n else:\n print('unsafe')\n", "FL_content": "-\n s, w = map(int, input().split())\n-if s= S:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "code2": "S, W = map(int, input().split())\n\nif W >= S:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588101534", "date2": "1588101564", "bleu_score": "0.9662168074201131", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 2, "total_score": 20, "input": "000 -4\n", "actual_output": "unsafe\n", "expected_output": "safe\n\n", "anno_code": ["W, S = map(int, input().split()) # (0): W=0, S=-4\n\nif W >= S: # (1): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": "-W, S = map(int, input().split())\n+S, W = map(int, input().split())\n \n if W >= S:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "FL_content": "-W, S = map(int, input().split())\n \n if W >= S:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u922952729", "problem_id": "p02699", "submission1_id": "s950544554", "submission2_id": "s984449261", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S,W=[int(i) for i in input().split(\" \")]\nif W>=S:\n print(\"unsage\")\nelse:\n print(\"safe\")", "code2": "S,W=[int(i) for i in input().split(\" \")]\nif W>=S:\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949256", "date2": "1587949282", "bleu_score": "0.961928649275358", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], "code1_test_score": 17, "total_score": 20, "input": "000 1\n", "actual_output": "unsage\n", "expected_output": "unsafe\n\n", "anno_code": ["S,W=[int(i) for i in input().split(\" \")] # (0): S=0, W=1\nif W>=S: # (1): NO CHANGE\n print(\"unsage\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": " S,W=[int(i) for i in input().split(\" \")]\n if W>=S:\n- print(\"unsage\")\n+ print(\"unsafe\")\n else:\n print(\"safe\")\n+\n", "FL_content": " S,W=[int(i) for i in input().split(\" \")]\n if W>=S:\n- print(\"unsage\")\n else:\n print(\"safe\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u853728588", "problem_id": "p02699", "submission1_id": "s264941587", "submission2_id": "s153364965", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s, w = map(int, input().split())\n\nif w > s:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "code2": "s, w = map(int, input().split())\n \nif w >= s:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1591718755", "date2": "1591718800", "bleu_score": "0.9400725118657622", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 18, "total_score": 20, "input": "001 1\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["s, w = map(int, input().split()) # (0): s=1, w=1\n\nif w > s: # (1): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": " s, w = map(int, input().split())\n-\n-if w > s:\n+ \n+if w >= s:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "FL_content": " s, w = map(int, input().split())\n-\n-if w > s:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u385826034", "problem_id": "p02699", "submission1_id": "s966688665", "submission2_id": "s439193496", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\nif b > a:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "code2": "a, b = map(int, input().split())\nif b >= a:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949273", "date2": "1587949322", "bleu_score": "0.9627138489515855", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 18, "total_score": 20, "input": "001 1\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=1, b=1\nif b > a: # (1): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n-if b > a:\n+if b >= a:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "FL_content": " a, b = map(int, input().split())\n-if b > a:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u776237437", "problem_id": "p02699", "submission1_id": "s821715006", "submission2_id": "s216198656", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S,W=map(int,input().split())\n\nif SW:\n print('safe')\nelse:\n print('unsafe')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588273737", "date2": "1588273932", "bleu_score": "0.9682406246501182", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 2, "total_score": 20, "input": "011 -2\n", "actual_output": "unsafe\n", "expected_output": "safe\n\n", "anno_code": ["S,W=map(int,input().split()) # (0): S=11, W=-2\n\nif SW:\n print('safe')\n else:\n print('unsafe')\n", "FL_content": " S,W=map(int,input().split())\n \n-if S= W:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "code2": "a = input().split()\nS = int(a[0])\nW = int(a[1])\nif S <= W:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587950628", "date2": "1587950720", "bleu_score": "0.9398998929878208", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 2, "total_score": 20, "input": "000 -5\n", "actual_output": "unsafe\n", "expected_output": "safe\n\n", "anno_code": ["a=input().split() # (0): a=['000', '-5']\nS = int(a[0]) # (1): S=0\nW = int(a[1]) # (2): W=-5\nif S >= W: # (3): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": "-a=input().split()\n+a = input().split()\n S = int(a[0])\n W = int(a[1])\n-if S >= W:\n+if S <= W:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "FL_content": "-a=input().split()\n S = int(a[0])\n W = int(a[1])\n-if S >= W:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u534527715", "problem_id": "p02699", "submission1_id": "s290871851", "submission2_id": "s577296897", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nH, O = map(int, input().split())\n\nif (H < O):\n print(\"unsafe\")\nelse:\n print(\"safe\")", "code2": "\n\nH, O = map(int, input().split())\n\nif (H <= O):\n print(\"unsafe\")\nelse:\n print(\"safe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949393", "date2": "1587949463", "bleu_score": "0.9708351611332822", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 18, "total_score": 20, "input": "000 0\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["\n\nH, O = map(int, input().split()) # (0): H=0, O=0\n\nif (H < O): # (1): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": " \n \n H, O = map(int, input().split())\n \n-if (H < O):\n+if (H <= O):\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "FL_content": " \n \n H, O = map(int, input().split())\n \n-if (H < O):\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u703886980", "problem_id": "p02699", "submission1_id": "s424643693", "submission2_id": "s404976290", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int, input().split())\n\nif a i[1]:\n print('safe')\nelse:\n print('unsafe')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949551", "date2": "1587949727", "bleu_score": "0.6675344547997187", "code1_test_status": [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": 20, "input": "001 1\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["s, w = input().split() # (0): s=001, w=1\nif s < w: # (1): NO CHANGE\n print('safe')\nelse:\n print('unsafe')"], "anno_status": [true], "diff_content": "-s, w = input().split()\n-if s < w:\n+i = list(map(int, input().split()))\n+if i[0] > i[1]:\n print('safe')\n else:\n print('unsafe')\n", "FL_content": "-s, w = input().split()\n-if s < w:\n print('safe')\n else:\n print('unsafe')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u552533086", "problem_id": "p02699", "submission1_id": "s799973620", "submission2_id": "s332576075", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S, W = map(int, input().split())\nS = int(S / 2)\n\nif S < W:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "code2": "S, W = map(int, input().split())\n\nif S <= W:\n print(\"unsafe\")\nelse:\n print(\"safe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949641", "date2": "1587950649", "bleu_score": "0.8302620191727005", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 19, "total_score": 20, "input": "000 0\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["S, W = map(int, input().split()) # (0): S=0, W=0\nS = int(S / 2) # (1): NO CHANGE\n\nif S < W: # (2): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": " S, W = map(int, input().split())\n-S = int(S / 2)\n \n-if S < W:\n+if S <= W:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "FL_content": " S, W = map(int, input().split())\n-S = int(S / 2)\n \n-if S < W:\n print(\"unsafe\")\n else:\n print(\"safe\")\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u722875240", "problem_id": "p02699", "submission1_id": "s092131370", "submission2_id": "s997751198", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\nprint(\"Yes\" if a <= b else \"No\")", "code2": "a, b = map(int, input().split())\nprint(\"safe\" if a > b else \"unsafe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588023533", "date2": "1588023594", "bleu_score": "0.7783215095518744", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 20, "input": "011 -2\n", "actual_output": "No\n", "expected_output": "safe\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=11, b=-2\nprint(\"Yes\" if a <= b else \"No\")"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n-print(\"Yes\" if a <= b else \"No\")\n+print(\"safe\" if a > b else \"unsafe\")\n", "FL_content": " a, b = map(int, input().split())\n-print(\"Yes\" if a <= b else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u136284779", "problem_id": "p02699", "submission1_id": "s214093185", "submission2_id": "s398737962", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S,W=map(int,input().split())\nif S w:\n print(\"safe\")\nelse:\n print(\"unsafe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949940", "date2": "1587950212", "bleu_score": "0.8290583120005124", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 19, "total_score": 20, "input": "000 0\n", "actual_output": "safe\n", "expected_output": "unsafe\n\n", "anno_code": ["s , w = input().split() # (0): s=000, w=0\n\nif s <= w: # (1): NO CHANGE\n print(\"unsafe\")\nelse:\n print(\"safe\")"], "anno_status": [true], "diff_content": "-s , w = input().split()\n+s , w = map(int, input().split())\n \n-if s <= w:\n- print(\"unsafe\")\n-else:\n+if s > w:\n print(\"safe\")\n+else:\n+ print(\"unsafe\")\n", "FL_content": "-s , w = input().split()\n \n-if s <= w:\n- print(\"unsafe\")\n-else:\n print(\"safe\")\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 6 }, { "user_id": "u374671031", "problem_id": "p02699", "submission1_id": "s370833199", "submission2_id": "s887601627", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S, W = map(int, input().split())\n\nprint(\"safe\" if S > W else\"unsefe\")", "code2": "S, W = map(int, input().split())\n\nprint(\"safe\" if S > W else \"unsafe\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587949778", "date2": "1587953232", "bleu_score": "0.9269207588009153", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], "code1_test_score": 17, "total_score": 20, "input": "000 1\n", "actual_output": "unsefe\n", "expected_output": "unsafe\n\n", "anno_code": ["S, W = map(int, input().split()) # (0): S=0, W=1\n\nprint(\"safe\" if S > W else\"unsefe\")"], "anno_status": [true], "diff_content": " S, W = map(int, input().split())\n \n-print(\"safe\" if S > W else\"unsefe\")\n+print(\"safe\" if S > W else \"unsafe\")\n", "FL_content": " S, W = map(int, input().split())\n \n-print(\"safe\" if S > W else\"unsefe\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u933096856", "problem_id": "p02469", "submission1_id": "s096942121", "submission2_id": "s644006664", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n while True:\n m=q%p\n if m==0:\n\n break\n p=m\n q=p\n g=p\n\n\n\n\n return g\n\nc=0\nn=int(input())\na=sorted(set(list(map(int, input().split()))))\nb=[]\nwhile len(a) > 1:\n n=len(a)\n for i in range(n-1):\n p=a[i]\n q=a[i+1]\n g=gcd(p,q)\n r=a[i]*a[i+1]\n b.append(r)\n a=sorted(b)\n b=[]\nprint(*a)", "code2": "def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n while p != q:\n if q > p:\n q = q - p\n else:\n p = p - q\n return q\n\nc=0\nn=int(input())\na=sorted(set(list(map(int, input().split()))))\nb=[]\nwhile len(a) > 1:\n p=a[0]\n q=a[1]\n g=gcd(p,q)\n if g !=0:\n a.append(p*q\n a.pop(0)\n a.pop(0)\n a=sorted(a)\nprint(*a)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1510482308", "date2": "1510483679", "bleu_score": "0.6645852327131871", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 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, 1, 0, 0, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 15, "total_score": 95, "input": "4\n1 2 5 8\n", "actual_output": "8000\n", "expected_output": "40\n\n", "anno_code": ["def gcd(x,y): # (0): gcd=\n p=min(x,y) # (11): p=1 (24): p=2 ... (96): p=20\n q=max(x,y) # (12): q=2 (25): q=5 ... (97): q=400\n while True: # (13): NO CHANGE (26): NO CHANGE ... (98): NO CHANGE\n m=q%p # (14): m=0 (27): m=1 ... (99): m=0\n if m==0: # (15): NO CHANGE (28): NO CHANGE ... (100): NO CHANGE\n\n break # (16): NO CHANGE (34): NO CHANGE ... (101): NO CHANGE\n p=m # (29): p=1 (47): p=3\n q=p # (30): q=1 (48): q=3\n g=p # (17): gcd=, c=0, n=4, a=[1, 2, 5, 8], b=[], i=0, g=1 (35): gcd=, c=0, n=4, a=[1, 2, 5, 8], b=[2], i=1, p=2, q=5, g=1, r=2 ... (102): gcd=, c=0, n=2, a=[20, 400], b=[], i=0, g=20, r=400\n\n\n\n\n return g\n\nc=0 # (1): c=0\nn=int(input()) # (2): n=4\na=sorted(set(list(map(int, input().split())))) # (3): a=[1, 2, 5, 8]\nb=[] # (4): b=[]\nwhile len(a) > 1: # (5): NO CHANGE (59): NO CHANGE ... (108): NO CHANGE\n n=len(a) # (6): NO CHANGE (60): n=3 (91): n=2\n for i in range(n-1): # (7): i=0 (20): i=1 ... (105): NO CHANGE\n p=a[i] # (8): p=1 (21): p=2 ... (93): p=20\n q=a[i+1] # (9): q=2 (22): q=5 ... (94): q=400\n g=gcd(p,q) # (10): x=1, y=2 (23): x=2, y=5 ... (95): x=20, y=400\n r=a[i]*a[i+1] # (18): r=2 (36): r=10 ... (103): r=8000\n b.append(r) # (19): b=[2] (37): b=[2, 10] ... (104): b=[8000]\n a=sorted(b) # (57): a=[2, 10, 40] (88): a=[20, 400] (106): a=[8000]\n b=[] # (58): b=[] (89): b=[] (107): b=[]\nprint(*a)"], "anno_status": [true], "diff_content": " def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n- while True:\n- m=q%p\n- if m==0:\n-\n- break\n- p=m\n- q=p\n- g=p\n-\n-\n-\n-\n- return g\n+ while p != q:\n+ if q > p:\n+ q = q - p\n+ else:\n+ p = p - q\n+ return q\n \n c=0\n n=int(input())\n a=sorted(set(list(map(int, input().split()))))\n b=[]\n while len(a) > 1:\n- n=len(a)\n- for i in range(n-1):\n- p=a[i]\n- q=a[i+1]\n- g=gcd(p,q)\n- r=a[i]*a[i+1]\n- b.append(r)\n- a=sorted(b)\n- b=[]\n+ p=a[0]\n+ q=a[1]\n+ g=gcd(p,q)\n+ if g !=0:\n+ a.append(p*q\n+ a.pop(0)\n+ a.pop(0)\n+ a=sorted(a)\n print(*a)\n", "FL_content": " def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n- while True:\n- m=q%p\n- if m==0:\n-\n- break\n- p=m\n- q=p\n- g=p\n-\n-\n-\n-\n- return g\n \n c=0\n n=int(input())\n a=sorted(set(list(map(int, input().split()))))\n b=[]\n while len(a) > 1:\n- n=len(a)\n- for i in range(n-1):\n- p=a[i]\n- q=a[i+1]\n- g=gcd(p,q)\n- r=a[i]*a[i+1]\n- b.append(r)\n- a=sorted(b)\n- b=[]\n print(*a)\n", "added_lines": 14, "removed_lines": 22, "code1_lines": 32 }, { "user_id": "u837811962", "problem_id": "p02469", "submission1_id": "s261624434", "submission2_id": "s974684925", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def GCD(x,y):\n r = x%y\n if r == 0:\n return y\n else:\n return GCD(y,r)\n\n\nn = int(input())\nlist1 = list(map(int,input().split()))\nresult = list1[0]\nfor i in list1[1:]:\n result = result*i/GCD(i,result)\n\nprint(result)", "code2": "def GCD(x,y):\n r = x%y\n if r == 0:\n return y\n else:\n return GCD(y,r)\n\n\nn = int(input())\nlist1 = list(map(int,input().split()))\nresult = list1[0]\nfor i in list1[1:]:\n result = result*i/GCD(i,result)\n\nprint(int(result))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1497073670", "date2": "1497073791", "bleu_score": "0.9792956178058593", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 95, "input": "3\n1 22 5\n", "actual_output": "110.0\n", "expected_output": "110\n\n", "anno_code": ["def GCD(x,y): # (0): GCD=\n r = x%y # (6): r=0 (10): r=5.0 ... (16): r=0.0\n if r == 0: # (7): GCD=, n=3, list1=[1, 22, 5], result=22.0, i=22 (11): x=22.0, y=5.0 ... (17): GCD=, n=3, list1=[1, 22, 5], result=110.0, i=5\n return y\n else:\n return GCD(y,r)\n\n\nn = int(input()) # (1): n=3\nlist1 = list(map(int,input().split())) # (2): list1=[1, 22, 5]\nresult = list1[0] # (3): result=1\nfor i in list1[1:]: # (4): i=22 (8): i=5 (18): NO CHANGE\n result = result*i/GCD(i,result) # (5): x=22, y=1 (9): x=5, y=22.0\n\nprint(result)"], "anno_status": [true], "diff_content": " def GCD(x,y):\n r = x%y\n if r == 0:\n return y\n else:\n return GCD(y,r)\n \n \n n = int(input())\n list1 = list(map(int,input().split()))\n result = list1[0]\n for i in list1[1:]:\n result = result*i/GCD(i,result)\n \n-print(result)\n+print(int(result))\n", "FL_content": " def GCD(x,y):\n r = x%y\n if r == 0:\n return y\n else:\n return GCD(y,r)\n \n \n n = int(input())\n list1 = list(map(int,input().split()))\n result = list1[0]\n for i in list1[1:]:\n result = result*i/GCD(i,result)\n \n-print(result)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u933096856", "problem_id": "p02469", "submission1_id": "s573042137", "submission2_id": "s644006664", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n while True:\n m=q%p\n if m==0:\n\n break\n p=m\n q=p\n\n if p==q:\n g=1\n else:\n g=p\n return g\n\nc=0\nn=int(input())\na=sorted(set(list(map(int, input().split()))))\nb=[]\nwhile len(a) > 1:\n n=len(a)\n for i in range(n-1):\n p=a[i]\n q=a[i+1]\n g=gcd(p,q)\n\n r=a[i]*a[i+1]\n b.append(r)\n a=sorted(b)\n b=[]\nprint(*a)", "code2": "def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n while p != q:\n if q > p:\n q = q - p\n else:\n p = p - q\n return q\n\nc=0\nn=int(input())\na=sorted(set(list(map(int, input().split()))))\nb=[]\nwhile len(a) > 1:\n p=a[0]\n q=a[1]\n g=gcd(p,q)\n if g !=0:\n a.append(p*q\n a.pop(0)\n a.pop(0)\n a=sorted(a)\nprint(*a)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1510482633", "date2": "1510483679", "bleu_score": "0.6189431276486483", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 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, 1, 0, 0, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 15, "total_score": 95, "input": "4\n1 2 5 44\n", "actual_output": "44000\n", "expected_output": "220\n\n", "anno_code": ["def gcd(x,y): # (0): gcd=\n p=min(x,y) # (11): p=1 (25): p=2 ... (101): p=20\n q=max(x,y) # (12): q=2 (26): q=5 ... (102): q=2200\n while True: # (13): NO CHANGE (27): NO CHANGE ... (103): NO CHANGE\n m=q%p # (14): m=0 (28): m=1 ... (104): m=0\n if m==0: # (15): NO CHANGE (29): NO CHANGE ... (105): NO CHANGE\n\n break # (16): NO CHANGE (35): NO CHANGE ... (106): NO CHANGE\n p=m # (30): p=1 (49): p=4\n q=p # (31): q=1 (50): q=4\n\n if p==q: # (17): NO CHANGE (36): NO CHANGE ... (107): NO CHANGE\n g=1 # (37): gcd=, c=0, n=4, a=[1, 2, 5, 44], b=[2], i=1, p=2, q=5, g=1, r=2 (56): gcd=, c=0, n=4, a=[1, 2, 5, 44], b=[2, 10], i=2, p=5, q=44, g=1, r=10\n else:\n g=p # (18): gcd=, c=0, n=4, a=[1, 2, 5, 44], b=[], i=0, g=1 (75): gcd=, c=0, n=3, a=[2, 10, 220], b=[], i=0, g=2, r=220 ... (108): gcd=, c=0, n=2, a=[20, 2200], b=[], i=0, g=20, r=2200\n return g\n\nc=0 # (1): c=0\nn=int(input()) # (2): n=4\na=sorted(set(list(map(int, input().split())))) # (3): a=[1, 2, 5, 44]\nb=[] # (4): b=[]\nwhile len(a) > 1: # (5): NO CHANGE (62): NO CHANGE ... (114): NO CHANGE\n n=len(a) # (6): NO CHANGE (63): n=3 (96): n=2\n for i in range(n-1): # (7): i=0 (21): i=1 ... (111): NO CHANGE\n p=a[i] # (8): p=1 (22): p=2 ... (98): p=20\n q=a[i+1] # (9): q=2 (23): q=5 ... (99): q=2200\n g=gcd(p,q) # (10): x=1, y=2 (24): x=2, y=5 ... (100): x=20, y=2200\n\n r=a[i]*a[i+1] # (19): r=2 (38): r=10 ... (109): r=44000\n b.append(r) # (20): b=[2] (39): b=[2, 10] ... (110): b=[44000]\n a=sorted(b) # (60): a=[2, 10, 220] (93): a=[20, 2200] (112): a=[44000]\n b=[] # (61): b=[] (94): b=[] (113): b=[]\nprint(*a)"], "anno_status": [true], "diff_content": " def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n- while True:\n- m=q%p\n- if m==0:\n-\n- break\n- p=m\n- q=p\n-\n- if p==q:\n- g=1\n- else:\n- g=p\n- return g\n+ while p != q:\n+ if q > p:\n+ q = q - p\n+ else:\n+ p = p - q\n+ return q\n \n c=0\n n=int(input())\n a=sorted(set(list(map(int, input().split()))))\n b=[]\n while len(a) > 1:\n- n=len(a)\n- for i in range(n-1):\n- p=a[i]\n- q=a[i+1]\n- g=gcd(p,q)\n-\n- r=a[i]*a[i+1]\n- b.append(r)\n- a=sorted(b)\n- b=[]\n+ p=a[0]\n+ q=a[1]\n+ g=gcd(p,q)\n+ if g !=0:\n+ a.append(p*q\n+ a.pop(0)\n+ a.pop(0)\n+ a=sorted(a)\n print(*a)\n", "FL_content": " def gcd(x,y):\n p=min(x,y)\n q=max(x,y)\n- while True:\n- m=q%p\n- if m==0:\n-\n- break\n- p=m\n- q=p\n-\n- if p==q:\n- g=1\n- else:\n- g=p\n- return g\n \n c=0\n n=int(input())\n a=sorted(set(list(map(int, input().split()))))\n b=[]\n while len(a) > 1:\n- n=len(a)\n- for i in range(n-1):\n- p=a[i]\n- q=a[i+1]\n- g=gcd(p,q)\n-\n- r=a[i]*a[i+1]\n- b.append(r)\n- a=sorted(b)\n- b=[]\n print(*a)\n", "added_lines": 14, "removed_lines": 23, "code1_lines": 33 }, { "user_id": "u022407960", "problem_id": "p02243", "submission1_id": "s991372012", "submission2_id": "s120645934", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = 1 << 20\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "code2": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(5e10 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1479788378", "date2": "1479788661", "bleu_score": "0.9624678402780646", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1], "code1_test_score": 66, "total_score": 101, "input": "5\n0 3 1 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 2 1 4 1\n3 4 2 0 0 1 1 1 4 3\n4 2 2 1 3 3\n", "actual_output": "0 0\n1 2\n2 5\n3 1\n4 4\n", "expected_output": "0 0\n1 2\n2 1\n3 1\n4 2\n\n", "anno_code": ["\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2 # (0): WHITE=0, GRAY=1, BLACK=2\nD_MAX = 1 << 20 # (1): D_MAX=1048576\n\n\ndef generate_adj_matrix(v_info): # (2): generate_adj_matrix=\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path(): # (3): dijkstra_path=\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = 1 << 20\n+D_MAX = int(5e10 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n+ if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "FL_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = 1 << 20\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 67 }, { "user_id": "u022407960", "problem_id": "p02243", "submission1_id": "s239420183", "submission2_id": "s120645934", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = 1 << 20\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n \n \n for j in range(0, v_adj_length * 2, 2):\n init_adj_matrix[v_index][v_adj_list[j]] = v_adj_list[j + 1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "code2": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(5e10 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1479788485", "date2": "1479788661", "bleu_score": "0.934756920057305", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1], "code1_test_score": 66, "total_score": 101, "input": "5\n0 3 2 3 3 2 1 1\n1 2 0 5 4 4\n2 2 0 3 0 2 4 2\n3 4 2 1 0 0 3 4 4 0\n4 2 2 1 3 3\n", "actual_output": "0 0\n1 1\n2 3\n3 2\n4 5\n", "expected_output": "0 0\n1 1\n2 3\n3 2\n4 2\n\n", "anno_code": ["\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2 # (0): WHITE=0, GRAY=1, BLACK=2\nD_MAX = 1 << 20 # (1): D_MAX=1048576\n\n\ndef generate_adj_matrix(v_info): # (2): generate_adj_matrix=\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n \n \n for j in range(0, v_adj_length * 2, 2):\n init_adj_matrix[v_index][v_adj_list[j]] = v_adj_list[j + 1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path(): # (3): dijkstra_path=\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = 1 << 20\n+D_MAX = int(5e10 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n- \n- \n- for j in range(0, v_adj_length * 2, 2):\n- init_adj_matrix[v_index][v_adj_list[j]] = v_adj_list[j + 1]\n+ for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n+ init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n+ if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "FL_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = 1 << 20\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n- \n- \n- for j in range(0, v_adj_length * 2, 2):\n- init_adj_matrix[v_index][v_adj_list[j]] = v_adj_list[j + 1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "added_lines": 4, "removed_lines": 8, "code1_lines": 69 }, { "user_id": "u150984829", "problem_id": "p02243", "submission1_id": "s529914353", "submission2_id": "s741090171", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import*\nn=int(input())\nA=[[]for _ in[0]*n]\nfor _ in[0]*n:\n e=list(map(int,input().split()))\n for i in range(e[1]):k=2*-~i;A[e[0]]+=[(e[k],e[k+1])]\nH=[[0,0]]\nd=[0]+[1e6]*n\nc=[1]*n\nwhile H:\n f=heappop(H)\n print(f)\n u=f[1]\n c[u]=0\n if d[u]>=f[0]:\n for s in A[u]:\n v=s[0]\n if c[v]and d[v]>d[u]+s[1]:\n d[v]=d[u]+s[1]\n heappush(H,[d[v],v])\nfor i in range(n):print(i,d[i])\n", "code2": "from heapq import*\nn=int(input())\nA=[[]for _ in[0]*n]\nfor _ in[0]*n:\n e=list(map(int,input().split()))\n for i in range(e[1]):k=2*-~i;A[e[0]]+=[(e[k],e[k+1])]\nH=[[0,0]]\nd=[0]+[1e6]*n\nc=[1]*n\nwhile H:\n f=heappop(H)\n u=f[1]\n c[u]=0\n if d[u]>=f[0]:\n for s in A[u]:\n v=s[0]\n if c[v]and d[v]>d[u]+s[1]:\n d[v]=d[u]+s[1]\n heappush(H,[d[v],v])\nfor i in range(n):print(i,d[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1520416137", "date2": "1520416161", "bleu_score": "0.9738918422192088", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n0 3 2 3 3 3 1 1\n1 2 0 2 1 4\n2 3 0 0 0 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n", "actual_output": "[0, 0]\n[1, 1]\n[3, 2]\n[3, 3]\n[4, 4]\n0 0\n1 1\n2 3\n3 3\n4 4\n", "expected_output": "0 0\n1 1\n2 3\n3 3\n4 4\n\n", "anno_code": ["from heapq import* # (0): heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=\nn=int(input()) # (1): n=5\nA=[[]for _ in[0]*n] # (2): A\nfor _ in[0]*n: # (3): _=0 (9): A ... (32): A\n e=list(map(int,input().split())) # (4): e=[0, 3, 2, 3, 3, 3, 1, 1] (10): A=[[(2, 3), (3, 3), (1, 1)], [], [], [], []], e=[1, 2, 0, 2, 1, 4] ... (28): A, e=[4, 2, 2, 1, 3, 3]\n for i in range(e[1]):k=2*-~i;A[e[0]]+=[(e[k],e[k+1])] # (5): A=[[(2, 3)], [], [], [], []], i=0, k=2 (6): A, i=1, k=4 ... (31): A\nH=[[0,0]] # (33): A=[[(2, 3), (3, 3), (1, 1)], [(0, 2), (1, 4)], [(0, 0), (0, 1), (4, 1)], [(2, 1), (0, 1), (1, 4), (4, 3)], [(2, 1), (3, 3)]], H\nd=[0]+[1e6]*n # (34): A, d=[0, 1000000.0, 1000000.0, 1000000.0, 1000000.0, 1000000.0]\nc=[1]*n # (35): A, c=[1, 1, 1, 1, 1]\nwhile H: # (36): A (58): A ... (121): A\n f=heappop(H) # (37): A=[[(2, 3), (3, 3), (1, 1)], [(0, 2), (1, 4)], [(0, 0), (0, 1), (4, 1)], [(2, 1), (0, 1), (1, 4), (4, 3)], [(2, 1), (3, 3)]], H=[], f=[0, 0] (59): A=[[(2, 3), (3, 3), (1, 1)], [(0, 2), (1, 4)], [(0, 0), (0, 1), (4, 1)], [(2, 1), (0, 1), (1, 4), (4, 3)], [(2, 1), (3, 3)]], H=[[3, 2], [3, 3]], f=[1, 1] ... (109): A=[[(2, 3), (3, 3), (1, 1)], [(0, 2), (1, 4)], [(0, 0), (0, 1), (4, 1)], [(2, 1), (0, 1), (1, 4), (4, 3)], [(2, 1), (3, 3)]], H=[], f=[4, 4]\n print(f) # (38): A (60): A ... (110): A\n u=f[1] # (39): A, u=0 (61): A, u=1 ... (111): A, u=4\n c[u]=0 # (40): A, c=[0, 1, 1, 1, 1] (62): A, c=[0, 0, 1, 1, 1] ... (112): A, c=[0, 0, 0, 0, 0]\n if d[u]>=f[0]: # (41): A (63): A ... (113): A\n for s in A[u]: # (42): A, s=(2, 3) (47): A, s=(3, 3) ... (120): A\n v=s[0] # (43): A, v=2 (48): A, v=3 ... (118): A, v=3\n if c[v]and d[v]>d[u]+s[1]: # (44): A (49): A ... (119): A\n d[v]=d[u]+s[1] # (45): A, d=[0, 1000000.0, 3, 1000000.0, 1000000.0, 1000000.0] (50): A, d=[0, 1000000.0, 3, 3, 1000000.0, 1000000.0] ... (86): A, d=[0, 1, 3, 3, 4, 1000000.0]\n heappush(H,[d[v],v]) # (46): A, H (51): A, H ... (87): A, H\nfor i in range(n):print(i,d[i]) # (122): A, i=0 (123): A, i=1 ... (126): A, i=4\n"], "anno_status": [false], "diff_content": " from heapq import*\n n=int(input())\n A=[[]for _ in[0]*n]\n for _ in[0]*n:\n e=list(map(int,input().split()))\n for i in range(e[1]):k=2*-~i;A[e[0]]+=[(e[k],e[k+1])]\n H=[[0,0]]\n d=[0]+[1e6]*n\n c=[1]*n\n while H:\n f=heappop(H)\n- print(f)\n u=f[1]\n c[u]=0\n if d[u]>=f[0]:\n for s in A[u]:\n v=s[0]\n if c[v]and d[v]>d[u]+s[1]:\n d[v]=d[u]+s[1]\n heappush(H,[d[v],v])\n for i in range(n):print(i,d[i])\n \n", "FL_content": " from heapq import*\n n=int(input())\n A=[[]for _ in[0]*n]\n for _ in[0]*n:\n e=list(map(int,input().split()))\n for i in range(e[1]):k=2*-~i;A[e[0]]+=[(e[k],e[k+1])]\n H=[[0,0]]\n d=[0]+[1e6]*n\n c=[1]*n\n while H:\n f=heappop(H)\n- print(f)\n u=f[1]\n c[u]=0\n if d[u]>=f[0]:\n for s in A[u]:\n v=s[0]\n if c[v]and d[v]>d[u]+s[1]:\n d[v]=d[u]+s[1]\n heappush(H,[d[v],v])\n for i in range(n):print(i,d[i])\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u138546245", "problem_id": "p02243", "submission1_id": "s344004382", "submission2_id": "s503772866", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import heappop, heappush\nimport sys\n\n\nclass SSSP:\n \n def __init__(self, graph):\n self.size = len(graph)\n self.tree = []\n self.weights = [0] * self.size\n self._search(graph)\n\n def weight(self, n):\n return self.weights[n]\n\n def _search(self, graph):\n h = []\n count = 1\n for i, w in graph[0]:\n heappush(h, (w, 0, i))\n\n while count < self.size:\n while len(h) > 0:\n weight, src, dst = heappop(h)\n if self.weights[dst] == 0 and dst > 0:\n self.weights[dst] = weight\n count += 1\n self.tree.append((src, dst))\n for i, w in graph[dst]:\n if self.weights[i] == 0 and dst > 0:\n heappush(h, (w+weight, dst, i))\n break\n\n\ndef run():\n n = int(input())\n\n nodes = [None] * n\n for line in sys.stdin:\n id_, deg, *edges = [int(i) for i in line.split()]\n nodes[id_] = []\n for _ in range(deg):\n tgt, wgt, *edges = edges\n nodes[id_].append((tgt, wgt))\n\n st = SSSP(nodes)\n for node in range(n):\n print('{} {}'.format(node, st.weight(node)))\n\n\nif __name__ == '__main__':\n run()\n\n", "code2": "from heapq import heappop, heappush\nimport sys\n\n\nclass SSSP:\n \n def __init__(self, graph):\n self.size = len(graph)\n self.tree = []\n self.weights = [-1] * self.size\n self._search(graph)\n\n def weight(self, n):\n return self.weights[n]\n\n def _search(self, graph):\n h = []\n self.weights[0] = 0\n count = 1\n for i, w in graph[0]:\n heappush(h, (w, 0, i))\n\n while count < self.size:\n while len(h) > 0:\n weight, src, dst = heappop(h)\n if self.weights[dst] < 0:\n self.weights[dst] = weight\n count += 1\n self.tree.append((src, dst))\n for i, w in graph[dst]:\n if self.weights[i] < 0:\n heappush(h, (w+weight, dst, i))\n break\n\n\ndef run():\n n = int(input())\n\n nodes = [None] * n\n for line in sys.stdin:\n id_, deg, *edges = [int(i) for i in line.split()]\n nodes[id_] = []\n for _ in range(deg):\n tgt, wgt, *edges = edges\n nodes[id_].append((tgt, wgt))\n\n st = SSSP(nodes)\n for node in range(n):\n print('{} {}'.format(node, st.weight(node)))\n\n\nif __name__ == '__main__':\n run()\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526724666", "date2": "1526725044", "bleu_score": "0.9765946839591801", "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, 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, 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], "code1_test_score": 95, "total_score": 101, "input": "5\n0 3 4 8 3 0 1 2\n1 2 3 2 3 4\n2 3 0 3 4 2 4 1\n3 4 2 1 0 0 2 0 4 3\n4 2 1 1 3 3\n", "actual_output": "0 0\n1 0\n2 1\n3 0\n4 1\n", "expected_output": "0 0\n1 2\n2 0\n3 0\n4 1\n\n", "anno_code": ["from heapq import heappop, heappush\nimport sys\n\n\nclass SSSP: # (0): SSSP=\n \n def __init__(self, graph):\n self.size = len(graph)\n self.tree = []\n self.weights = [0] * self.size\n self._search(graph)\n\n def weight(self, n):\n return self.weights[n]\n\n def _search(self, graph):\n h = []\n count = 1\n for i, w in graph[0]:\n heappush(h, (w, 0, i))\n\n while count < self.size:\n while len(h) > 0:\n weight, src, dst = heappop(h)\n if self.weights[dst] == 0 and dst > 0:\n self.weights[dst] = weight\n count += 1\n self.tree.append((src, dst))\n for i, w in graph[dst]:\n if self.weights[i] == 0 and dst > 0:\n heappush(h, (w+weight, dst, i))\n break\n\n\ndef run(): # (1): run=\n n = int(input())\n\n nodes = [None] * n\n for line in sys.stdin:\n id_, deg, *edges = [int(i) for i in line.split()]\n nodes[id_] = []\n for _ in range(deg):\n tgt, wgt, *edges = edges\n nodes[id_].append((tgt, wgt))\n\n st = SSSP(nodes)\n for node in range(n):\n print('{} {}'.format(node, st.weight(node)))\n\n\nif __name__ == '__main__':\n run()\n\n"], "anno_status": [true], "diff_content": " from heapq import heappop, heappush\n import sys\n \n \n class SSSP:\n \n def __init__(self, graph):\n self.size = len(graph)\n self.tree = []\n- self.weights = [0] * self.size\n+ self.weights = [-1] * self.size\n self._search(graph)\n \n def weight(self, n):\n return self.weights[n]\n \n def _search(self, graph):\n h = []\n+ self.weights[0] = 0\n count = 1\n for i, w in graph[0]:\n heappush(h, (w, 0, i))\n \n while count < self.size:\n while len(h) > 0:\n weight, src, dst = heappop(h)\n- if self.weights[dst] == 0 and dst > 0:\n+ if self.weights[dst] < 0:\n self.weights[dst] = weight\n count += 1\n self.tree.append((src, dst))\n for i, w in graph[dst]:\n- if self.weights[i] == 0 and dst > 0:\n+ if self.weights[i] < 0:\n heappush(h, (w+weight, dst, i))\n break\n \n \n def run():\n n = int(input())\n \n nodes = [None] * n\n for line in sys.stdin:\n id_, deg, *edges = [int(i) for i in line.split()]\n nodes[id_] = []\n for _ in range(deg):\n tgt, wgt, *edges = edges\n nodes[id_].append((tgt, wgt))\n \n st = SSSP(nodes)\n for node in range(n):\n print('{} {}'.format(node, st.weight(node)))\n \n \n if __name__ == '__main__':\n run()\n \n \n", "FL_content": " from heapq import heappop, heappush\n import sys\n \n \n class SSSP:\n \n def __init__(self, graph):\n self.size = len(graph)\n self.tree = []\n- self.weights = [0] * self.size\n self._search(graph)\n \n def weight(self, n):\n return self.weights[n]\n \n def _search(self, graph):\n h = []\n count = 1\n for i, w in graph[0]:\n heappush(h, (w, 0, i))\n \n while count < self.size:\n while len(h) > 0:\n weight, src, dst = heappop(h)\n- if self.weights[dst] == 0 and dst > 0:\n self.weights[dst] = weight\n count += 1\n self.tree.append((src, dst))\n for i, w in graph[dst]:\n- if self.weights[i] == 0 and dst > 0:\n heappush(h, (w+weight, dst, i))\n break\n \n \n def run():\n n = int(input())\n \n nodes = [None] * n\n for line in sys.stdin:\n id_, deg, *edges = [int(i) for i in line.split()]\n nodes[id_] = []\n for _ in range(deg):\n tgt, wgt, *edges = edges\n nodes[id_].append((tgt, wgt))\n \n st = SSSP(nodes)\n for node in range(n):\n print('{} {}'.format(node, st.weight(node)))\n \n \n if __name__ == '__main__':\n run()\n \n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 54 }, { "user_id": "u022407960", "problem_id": "p02243", "submission1_id": "s657097526", "submission2_id": "s120645934", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(5e20 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "code2": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(5e10 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1479788320", "date2": "1479788661", "bleu_score": "0.9641610872583442", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1], "code1_test_score": 66, "total_score": 101, "input": "5\n0 3 2 3 3 1 1 0\n1 2 0 2 0 4\n2 3 0 3 3 2 4 2\n3 4 2 1 0 1 1 4 4 1\n4 1 0 1 3 3\n", "actual_output": "0 0\n1 5\n2 2\n3 1\n4 2\n", "expected_output": "0 0\n1 0\n2 2\n3 1\n4 2\n\n", "anno_code": ["\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2 # (0): WHITE=0, GRAY=1, BLACK=2\nD_MAX = int(5e20 + 1) # (1): D_MAX=500000000000000000000\n\n\ndef generate_adj_matrix(v_info): # (2): generate_adj_matrix=\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path(): # (3): dijkstra_path=\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = int(5e20 + 1)\n+D_MAX = int(5e10 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n+ if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "FL_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = int(5e20 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 67 }, { "user_id": "u138577439", "problem_id": "p02243", "submission1_id": "s737418505", "submission2_id": "s020461445", "status1": "Wrong Answer", "status2": "Accepted", "code1": "V=int(input())\n\nG=[[] for i in range(V)]\nd=[1001001001 for i in range(V)]\n\nimport heapq\n\ndef dijkstra(s):\n q=[]\n d[s]=0\n heapq.heappush(q,(0, s))\n \n while(len(q)):\n print(q)\n p=heapq.heappop(q)\n v=p[1]\n if d[v]d[v]+e[1]:\n d[e[0]]=d[v]+e[1]\n \n heapq.heappush(q, (d[e[0]], e[0]))\n\nimport sys\nfor l in sys.stdin:\n l=list(map(int,l.split()))\n u=l[0]\n k=l[1]\n G[u]=zip(*[iter(l[2:])]*2)\n \ndijkstra(0)\nfor i in range(V):\n print(i, d[i])\n \n\n ", "code2": "V=int(input())\n\nG=[[] for i in range(V)]\nd=[1001001001 for i in range(V)]\n\nimport heapq\n\ndef dijkstra(s):\n q=[]\n d[s]=0\n heapq.heappush(q,(0, s))\n \n while(len(q)):\n \n p=heapq.heappop(q)\n v=p[1]\n if d[v]d[v]+e[1]:\n d[e[0]]=d[v]+e[1]\n \n heapq.heappush(q, (d[e[0]], e[0]))\n\nimport sys\nfor l in sys.stdin:\n l=list(map(int,l.split()))\n u=l[0]\n k=l[1]\n G[u]=zip(*[iter(l[2:])]*2)\n \ndijkstra(0)\nfor i in range(V):\n print(i, d[i])\n \n\n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1486833654", "date2": "1486833719", "bleu_score": "0.9846080692908441", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n0 3 1 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 2 1 4 1\n3 4 2 1 0 1 1 1 4 3\n4 2 2 1 3 3\n", "actual_output": "[(0, 0)]\n[(1, 3), (3, 1), (2, 1)]\n[(2, 1), (3, 1), (2, 2), (4, 4)]\n[(2, 2), (3, 1), (4, 4)]\n[(3, 1), (4, 4), (3, 4)]\n[(3, 4), (4, 4)]\n[(4, 4)]\n0 0\n1 2\n2 2\n3 1\n4 3\n", "expected_output": "0 0\n1 2\n2 2\n3 1\n4 3\n\n", "anno_code": ["V=int(input()) # (0): V=5\n\nG=[[] for i in range(V)] # (1): G\nd=[1001001001 for i in range(V)] # (2): d=[1001001001, 1001001001, 1001001001, 1001001001, 1001001001], heapq=\n\nimport heapq\n\ndef dijkstra(s): # (3): dijkstra=, sys=\n q=[] # (31): q=[]\n d[s]=0 # (32): NO CHANGE\n heapq.heappush(q,(0, s)) # (33): q=[(0, 0)]\n \n while(len(q)): # (34): NO CHANGE (52): NO CHANGE ... (116): V=5, G=[, , , , ], d=[0, 2, 2, 1, 3], heapq=, dijkstra=, sys=, l=[4, 2, 2, 1, 3, 3], u=4, k=2\n print(q) # (35): NO CHANGE (53): NO CHANGE ... (111): NO CHANGE\n p=heapq.heappop(q) # (36): q=[], p=(0, 0) (54): q=[(2, 1), (3, 1)], p=(1, 3) ... (112): q=[], p=(4, 4)\n v=p[1] # (37): v=0 (55): v=3 ... (113): NO CHANGE\n if d[v]d[v]+e[1]: # (40): NO CHANGE (44): NO CHANGE ... (108): NO CHANGE\n d[e[0]]=d[v]+e[1] # (41): NO CHANGE (45): NO CHANGE ... (91): NO CHANGE\n \n heapq.heappush(q, (d[e[0]], e[0])) # (42): q=[(3, 1)] (46): q=[(1, 3), (3, 1)] ... (92): q=[(3, 1), (4, 4), (3, 4)]\n\nimport sys\nfor l in sys.stdin: # (4): l=0 3 1 3 3 1 1 2 (9): G, l=1 2 0 2 3 4 ... (29): G\n l=list(map(int,l.split())) # (5): l=[0, 3, 1, 3, 3, 1, 1, 2] (10): G=[, [], [], [], []], l=[1, 2, 0, 2, 3, 4] ... (25): G, l=[4, 2, 2, 1, 3, 3]\n u=l[0] # (6): u=0 (11): G=[, [], [], [], []], u=1 ... (26): G, u=4\n k=l[1] # (7): k=3 (12): G=[, [], [], [], []], k=2 ... (27): G, k=2\n G[u]=zip(*[iter(l[2:])]*2) # (8): G (13): G ... (28): G\n \ndijkstra(0) # (30): s=0\nfor i in range(V): # (117): G=[, , , , ], i=0 (119): G=[, , , , ], i=1 ... (125): G, i=4\n print(i, d[i]) # (118): G (120): G ... (126): G\n \n\n "], "anno_status": [false], "diff_content": " V=int(input())\n \n G=[[] for i in range(V)]\n d=[1001001001 for i in range(V)]\n \n import heapq\n \n def dijkstra(s):\n q=[]\n d[s]=0\n heapq.heappush(q,(0, s))\n \n while(len(q)):\n- print(q)\n+ \n p=heapq.heappop(q)\n v=p[1]\n if d[v]d[v]+e[1]:\n d[e[0]]=d[v]+e[1]\n \n heapq.heappush(q, (d[e[0]], e[0]))\n \n import sys\n for l in sys.stdin:\n l=list(map(int,l.split()))\n u=l[0]\n k=l[1]\n G[u]=zip(*[iter(l[2:])]*2)\n \n dijkstra(0)\n for i in range(V):\n print(i, d[i])\n \n \n \n", "FL_content": " V=int(input())\n \n G=[[] for i in range(V)]\n d=[1001001001 for i in range(V)]\n \n import heapq\n \n def dijkstra(s):\n q=[]\n d[s]=0\n heapq.heappush(q,(0, s))\n \n while(len(q)):\n- print(q)\n p=heapq.heappop(q)\n v=p[1]\n if d[v]d[v]+e[1]:\n d[e[0]]=d[v]+e[1]\n \n heapq.heappush(q, (d[e[0]], e[0]))\n \n import sys\n for l in sys.stdin:\n l=list(map(int,l.split()))\n u=l[0]\n k=l[1]\n G[u]=zip(*[iter(l[2:])]*2)\n \n dijkstra(0)\n for i in range(V):\n print(i, d[i])\n \n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 37 }, { "user_id": "u022407960", "problem_id": "p02243", "submission1_id": "s647666029", "submission2_id": "s120645934", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(1e7 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "code2": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(5e10 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1479788113", "date2": "1479788661", "bleu_score": "0.9633867712372081", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1], "code1_test_score": 66, "total_score": 101, "input": "5\n0 3 2 3 3 2 1 1\n1 2 0 2 0 4\n2 3 0 3 0 0 4 1\n3 4 2 0 0 0 1 4 4 1\n4 2 4 1 3 3\n", "actual_output": "0 0\n1 1\n2 3\n3 2\n4 3\n", "expected_output": "0 0\n1 1\n2 2\n3 2\n4 3\n\n", "anno_code": ["\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2 # (0): WHITE=0, GRAY=1, BLACK=2\nD_MAX = int(1e7 + 1) # (1): D_MAX=10000001\n\n\ndef generate_adj_matrix(v_info): # (2): generate_adj_matrix=\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path(): # (3): dijkstra_path=\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = int(1e7 + 1)\n+D_MAX = int(5e10 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n+ if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "FL_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n-D_MAX = int(1e7 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 67 }, { "user_id": "u022407960", "problem_id": "p02243", "submission1_id": "s374230710", "submission2_id": "s120645934", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(5e10 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "code2": "\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2\nD_MAX = int(5e10 + 1)\n\n\ndef generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1479788291", "date2": "1479788661", "bleu_score": "0.9654485245552085", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1], "code1_test_score": 66, "total_score": 101, "input": "5\n0 3 2 3 3 2 1 1\n1 2 0 2 0 4\n2 3 0 3 0 0 4 1\n3 4 2 0 0 0 1 4 4 1\n4 2 4 1 3 3\n", "actual_output": "0 0\n1 1\n2 3\n3 2\n4 3\n", "expected_output": "0 0\n1 1\n2 2\n3 2\n4 3\n\n", "anno_code": ["\n\n\n\n\nimport sys\nimport heapq as hp\n\nWHITE, GRAY, BLACK = 0, 1, 2 # (0): WHITE=0, GRAY=1, BLACK=2\nD_MAX = int(5e10 + 1) # (1): D_MAX=50000000001\n\n\ndef generate_adj_matrix(v_info): # (2): generate_adj_matrix=\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n\n return init_adj_matrix\n\n\ndef dijkstra_path(): # (3): dijkstra_path=\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n\n color[current_vertex_index] = BLACK\n\n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n if not current_adj_weight:\n continue\n elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n\n return path_list\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n\n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n\n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n D_MAX = int(5e10 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n+ if color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "FL_content": " \n \n \n \n \n import sys\n import heapq as hp\n \n WHITE, GRAY, BLACK = 0, 1, 2\n D_MAX = int(5e10 + 1)\n \n \n def generate_adj_matrix(v_info):\n for each in v_info:\n v_index, v_adj_length, *v_adj_list = map(int, each)\n \n for pair in zip(v_adj_list[::2], v_adj_list[1::2]):\n init_adj_matrix[v_index][pair[0]] = pair[1]\n \n return init_adj_matrix\n \n \n def dijkstra_path():\n \n path_list[init_vertex_index] = 0\n path_heap = []\n \n hp.heappush(path_heap, (0, init_vertex_index))\n while len(path_heap) >= 1:\n current_vertex_index = hp.heappop(path_heap)[1]\n \n color[current_vertex_index] = BLACK\n \n current_vertex_index_info = adj_table[current_vertex_index]\n for adj_vertex_index in current_vertex_index_info.keys():\n current_adj_weight = current_vertex_index_info.get(adj_vertex_index)\n- if not current_adj_weight:\n- continue\n- elif color[adj_vertex_index] is not BLACK:\n \n alt_path = path_list[current_vertex_index] + current_adj_weight\n if alt_path < path_list[adj_vertex_index]:\n \n path_list[adj_vertex_index] = alt_path\n \n hp.heappush(path_heap, (alt_path, adj_vertex_index))\n parent_list[adj_vertex_index] = current_vertex_index\n color[adj_vertex_index] = GRAY\n \n return path_list\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n vertices_num = int(_input[0])\n init_vertices_table = map(lambda x: x.split(), _input[1:])\n \n \n parent_list, path_list = [-1] * vertices_num, [D_MAX] * vertices_num\n color = [WHITE] * vertices_num\n init_adj_matrix = tuple(dict() for _ in range(vertices_num))\n init_vertex_index = 0\n \n adj_table = generate_adj_matrix(init_vertices_table)\n ans = dijkstra_path()\n for i, v in enumerate(ans):\n print(i, v)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 67 }, { "user_id": "u666221014", "problem_id": "p02407", "submission1_id": "s647521891", "submission2_id": "s110906679", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\" \".join(reversed(input().split())))", "code2": "num = input()\nprint(\" \".join(reversed(input().split())))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1504728300", "date2": "1504728358", "bleu_score": "0.7429923631517805", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-1 2 8 5 -1 -1 12 14\n", "actual_output": "8\n", "expected_output": "14 12 -1 -1 5 8 2 -1\n\n", "anno_code": ["print(\" \".join(reversed(input().split())))"], "anno_status": [true], "diff_content": "+num = input()\n print(\" \".join(reversed(input().split())))\n", "FL_content": " print(\" \".join(reversed(input().split())))\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u215335591", "problem_id": "p02407", "submission1_id": "s814987890", "submission2_id": "s423238865", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = [int(i) for i in input().split()]\nx.sort()\nx.reverse()\nfor i in range(n):\n print(x[i],\" \",sep=\"\",end=\"\")\nprint(\"\")\n\n", "code2": "n = int(input())\nx = [int(i) for i in input().split()]\nx.reverse()\nfor i in range(n-1):\n print(x[i],\" \",sep=\"\",end=\"\")\nprint(x[n-1])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525359260", "date2": "1525359453", "bleu_score": "0.9003584710275236", "code1_test_status": [0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 101, "input": "8\n0 1 4 4 5 0 7 14\n", "actual_output": "14 7 5 4 4 1 0 0 \n", "expected_output": "14 7 0 5 4 4 1 0\n\n", "anno_code": ["n = int(input()) # (0): n=8\nx = [int(i) for i in input().split()] # (1): x=[0, 1, 4, 4, 5, 0, 7, 14]\nx.sort() # (2): x=[0, 0, 1, 4, 4, 5, 7, 14]\nx.reverse() # (3): x=[14, 7, 5, 4, 4, 1, 0, 0]\nfor i in range(n): # (4): i=0 (6): i=1 ... (20): NO CHANGE\n print(x[i],\" \",sep=\"\",end=\"\") # (5): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\nprint(\"\")\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n x = [int(i) for i in input().split()]\n-x.sort()\n x.reverse()\n-for i in range(n):\n+for i in range(n-1):\n print(x[i],\" \",sep=\"\",end=\"\")\n-print(\"\")\n+print(x[n-1])\n \n \n", "FL_content": " n = int(input())\n x = [int(i) for i in input().split()]\n-x.sort()\n x.reverse()\n-for i in range(n):\n print(x[i],\" \",sep=\"\",end=\"\")\n-print(\"\")\n \n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u907607057", "problem_id": "p02407", "submission1_id": "s079454751", "submission2_id": "s114113238", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\n\ndef main():\n sys.stdin.readline()\n list1 = list(map(str, sys.stdin.readline().split()))\n list.sort(list1, reverse=True)\n print(' '.join(list1))\n return\n\n\nif __name__ == '__main__':\n main()\n\n", "code2": "import sys\n\n\ndef main():\n sys.stdin.readline()\n list1 = list(map(str, sys.stdin.readline().split()))\n list.reverse(list1)\n print(' '.join(list1))\n\n return\n\n\nif __name__ == '__main__':\n main()\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1530878430", "date2": "1530878751", "bleu_score": "0.9249625329632378", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 101, "input": "8\n-2 6 0 25 -1 -1 95 26\n", "actual_output": "95 6 26 25 0 -2 -1 -1\n", "expected_output": "26 95 -1 -1 25 0 6 -2\n\n", "anno_code": ["import sys\n\n\ndef main(): # (0): main=\n sys.stdin.readline()\n list1 = list(map(str, sys.stdin.readline().split()))\n list.sort(list1, reverse=True)\n print(' '.join(list1))\n return\n\n\nif __name__ == '__main__':\n main()\n\n"], "anno_status": [true], "diff_content": " import sys\n \n \n def main():\n sys.stdin.readline()\n list1 = list(map(str, sys.stdin.readline().split()))\n- list.sort(list1, reverse=True)\n+ list.reverse(list1)\n print(' '.join(list1))\n+\n return\n \n \n if __name__ == '__main__':\n main()\n \n \n", "FL_content": " import sys\n \n \n def main():\n sys.stdin.readline()\n list1 = list(map(str, sys.stdin.readline().split()))\n- list.sort(list1, reverse=True)\n print(' '.join(list1))\n return\n \n \n if __name__ == '__main__':\n main()\n \n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u661284763", "problem_id": "p02407", "submission1_id": "s831426262", "submission2_id": "s984230832", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input()\na = input().split()\na.reverse()\nfor b in a:\n print(b, end='_')", "code2": "input()\na = input().split()\na.reverse()\nprint(\" \".join(a))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1469683184", "date2": "1469683945", "bleu_score": "0.6086257951229573", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-1 0 1 6 -2\n", "actual_output": "-2_6_1_0_-1_", "expected_output": "-2 6 1 0 -1\n\n", "anno_code": ["input() # (0): NO CHANGE\na = input().split() # (1): a=['-1', '0', '1', '6', '-2']\na.reverse() # (2): a=['-2', '6', '1', '0', '-1']\nfor b in a: # (3): b=-2 (5): b=6 ... (11): b=-1\n print(b, end='_') # (4): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n"], "anno_status": [true], "diff_content": " input()\n a = input().split()\n a.reverse()\n-for b in a:\n- print(b, end='_')\n+print(\" \".join(a))\n", "FL_content": " input()\n a = input().split()\n a.reverse()\n-for b in a:\n- print(b, end='_')\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u641357568", "problem_id": "p02407", "submission1_id": "s674775211", "submission2_id": "s727693465", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nlength = int(sys.stdin.readline())\nnum_seq = [ int(num) for num in sys.stdin.readline().split() ]\nprint(num_seq)\n\nfor i in range(1,length):\n print(num_seq[length - i],end=' ')\nprint(num_seq[0],end='')\n", "code2": "import sys\n\nlength = int(sys.stdin.readline())\nnum_seq = sys.stdin.readline().split()\n\nfor i in range(1, length):\n print(num_seq[length - i], end=' ')\nprint(num_seq[0])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1520594761", "date2": "1520595319", "bleu_score": "0.740812701250967", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-2 0 0 32 -1 -2 95 26\n", "actual_output": "[-2, 0, 0, 32, -1, -2, 95, 26]\n26 95 -2 -1 32 0 0 -2", "expected_output": "26 95 -2 -1 32 0 0 -2\n\n", "anno_code": ["import sys\n\nlength = int(sys.stdin.readline()) # (0): length=8\nnum_seq = [ int(num) for num in sys.stdin.readline().split() ] # (1): num_seq=[-2, 0, 0, 32, -1, -2, 95, 26]\nprint(num_seq) # (2): NO CHANGE\n\nfor i in range(1,length): # (3): i=1 (5): i=2 ... (17): NO CHANGE\n print(num_seq[length - i],end=' ') # (4): NO CHANGE (6): NO CHANGE ... (16): NO CHANGE\nprint(num_seq[0],end='')\n"], "anno_status": [true], "diff_content": " import sys\n \n length = int(sys.stdin.readline())\n-num_seq = [ int(num) for num in sys.stdin.readline().split() ]\n-print(num_seq)\n+num_seq = sys.stdin.readline().split()\n \n-for i in range(1,length):\n- print(num_seq[length - i],end=' ')\n-print(num_seq[0],end='')\n+for i in range(1, length):\n+ print(num_seq[length - i], end=' ')\n+print(num_seq[0])\n \n", "FL_content": " import sys\n \n length = int(sys.stdin.readline())\n-num_seq = [ int(num) for num in sys.stdin.readline().split() ]\n-print(num_seq)\n \n-for i in range(1,length):\n- print(num_seq[length - i],end=' ')\n-print(num_seq[0],end='')\n \n", "added_lines": 4, "removed_lines": 5, "code1_lines": 10 }, { "user_id": "u187646742", "problem_id": "p02407", "submission1_id": "s235033174", "submission2_id": "s846198358", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(map(int, input().split()))\na = list(a[i] for i in range(len(a)-1,-1,-1))\nprint(\" \".join(map(str, a)))", "code2": "_ = input()\na = list(map(int, input().split()))\na = list(a[i] for i in range(len(a)-1,-1,-1))\nprint(\" \".join(map(str, a)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1510649680", "date2": "1510649729", "bleu_score": "0.900405889351608", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-1 2 8 9 -1 -3 13 9\n", "actual_output": "8\n", "expected_output": "9 13 -3 -1 9 8 2 -1\n\n", "anno_code": ["a = list(map(int, input().split())) # (0): a=[8]\na = list(a[i] for i in range(len(a)-1,-1,-1)) # (1): NO CHANGE\nprint(\" \".join(map(str, a)))"], "anno_status": [true], "diff_content": "+_ = input()\n a = list(map(int, input().split()))\n a = list(a[i] for i in range(len(a)-1,-1,-1))\n print(\" \".join(map(str, a)))\n", "FL_content": " a = list(map(int, input().split()))\n a = list(a[i] for i in range(len(a)-1,-1,-1))\n print(\" \".join(map(str, a)))\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u811841526", "problem_id": "p02407", "submission1_id": "s984033475", "submission2_id": "s028346536", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input()\nxs = input().split()\nprint(list(reversed(xs)))", "code2": "input()\nxs = input().split()\nprint(' '.join(list(map(str, reversed(xs)))))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1449078218", "date2": "1449078245", "bleu_score": "0.6919128520312617", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 0 3 4 9\n", "actual_output": "['9', '4', '3', '0', '1']\n", "expected_output": "9 4 3 0 1\n\n", "anno_code": ["input() # (0): NO CHANGE\nxs = input().split() # (1): xs=['1', '0', '3', '4', '9']\nprint(list(reversed(xs)))"], "anno_status": [true], "diff_content": " input()\n xs = input().split()\n-print(list(reversed(xs)))\n+print(' '.join(list(map(str, reversed(xs)))))\n", "FL_content": " input()\n xs = input().split()\n-print(list(reversed(xs)))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u328199937", "problem_id": "p02407", "submission1_id": "s854109348", "submission2_id": "s528243194", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = str(input())\nlist = a.split()\nfor i in list[4:0:-1]:\n print(i, end = ' ')\nprint(list[0])\n", "code2": "n = int(input())\na = str(input())\nlist = a.split()\nfor i in list[n:0:-1]:\n print(i, end = ' ')\nprint(list[0])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524197452", "date2": "1524197475", "bleu_score": "0.9687328077143024", "code1_test_status": [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, 0], "code1_test_score": 50, "total_score": 101, "input": "8\n-1 2 0 13 -1 -3 26 15\n", "actual_output": "-1 13 0 2 -1\n", "expected_output": "15 26 -3 -1 13 0 2 -1\n\n", "anno_code": ["n = int(input()) # (0): n=8\na = str(input()) # (1): a=-1 2 0 13 -1 -3 26 15\nlist = a.split() # (2): list=['-1', '2', '0', '13', '-1', '-3', '26', '15']\nfor i in list[4:0:-1]: # (3): i=-1 (5): i=13 ... (11): NO CHANGE\n print(i, end = ' ') # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\nprint(list[0])\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = str(input())\n list = a.split()\n-for i in list[4:0:-1]:\n+for i in list[n:0:-1]:\n print(i, end = ' ')\n print(list[0])\n \n+\n", "FL_content": " n = int(input())\n a = str(input())\n list = a.split()\n-for i in list[4:0:-1]:\n print(i, end = ' ')\n print(list[0])\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u546285759", "problem_id": "p02407", "submission1_id": "s717091859", "submission2_id": "s867057271", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nprint(\" \".join(map(str, sorted(list(map(int, input().split())), reverse=True))))", "code2": "n = input()\na = [int(x) for x in input().split()]\na.reverse()\nprint(\" \".join(map(str, a)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1479887954", "date2": "1479888798", "bleu_score": "0.6233794008833446", "code1_test_status": [0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 101, "input": "5\n-1 0 1 5 -2\n", "actual_output": "5 1 0 -1 -2\n", "expected_output": "-2 5 1 0 -1\n\n", "anno_code": ["n = int(input()) # (0): n=5\nprint(\" \".join(map(str, sorted(list(map(int, input().split())), reverse=True))))"], "anno_status": [true], "diff_content": "-n = int(input())\n-print(\" \".join(map(str, sorted(list(map(int, input().split())), reverse=True))))\n+n = input()\n+a = [int(x) for x in input().split()]\n+a.reverse()\n+print(\" \".join(map(str, a)))\n", "FL_content": "-n = int(input())\n-print(\" \".join(map(str, sorted(list(map(int, input().split())), reverse=True))))\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u215335591", "problem_id": "p02407", "submission1_id": "s941240014", "submission2_id": "s423238865", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = [int(i) for i in input().split()]\nx.sort()\nx.reverse()\nfor i in range(n-1):\n print(x[i],\" \",sep=\"\",end=\"\")\nprint(x[n-1])\n\n", "code2": "n = int(input())\nx = [int(i) for i in input().split()]\nx.reverse()\nfor i in range(n-1):\n print(x[i],\" \",sep=\"\",end=\"\")\nprint(x[n-1])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525359416", "date2": "1525359453", "bleu_score": "0.9364178973112223", "code1_test_status": [0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 101, "input": "5\n0 1 4 1 0\n", "actual_output": "4 1 1 0 0\n", "expected_output": "0 1 4 1 0\n\n", "anno_code": ["n = int(input()) # (0): n=5\nx = [int(i) for i in input().split()] # (1): x=[0, 1, 4, 1, 0]\nx.sort() # (2): x=[0, 0, 1, 1, 4]\nx.reverse() # (3): x=[4, 1, 1, 0, 0]\nfor i in range(n-1): # (4): i=0 (6): i=1 ... (12): NO CHANGE\n print(x[i],\" \",sep=\"\",end=\"\") # (5): NO CHANGE (7): NO CHANGE ... (11): NO CHANGE\nprint(x[n-1])\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n x = [int(i) for i in input().split()]\n-x.sort()\n x.reverse()\n for i in range(n-1):\n print(x[i],\" \",sep=\"\",end=\"\")\n print(x[n-1])\n \n \n", "FL_content": " n = int(input())\n x = [int(i) for i in input().split()]\n-x.sort()\n x.reverse()\n for i in range(n-1):\n print(x[i],\" \",sep=\"\",end=\"\")\n print(x[n-1])\n \n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u546968095", "problem_id": "p02407", "submission1_id": "s037718921", "submission2_id": "s635764724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input()\nA = input().split()\nprint(A[::-1])\n", "code2": "input()\nprint(\" \".join(input().split()[::-1]))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1517197901", "date2": "1517200065", "bleu_score": "0.7031640569501184", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-1 1 8 5 -1 -1 12 14\n", "actual_output": "['14', '12', '-1', '-1', '5', '8', '1', '-1']\n", "expected_output": "14 12 -1 -1 5 8 1 -1\n\n", "anno_code": ["input() # (0): NO CHANGE\nA = input().split() # (1): A=['-1', '1', '8', '5', '-1', '-1', '12', '14']\nprint(A[::-1])\n"], "anno_status": [true], "diff_content": " input()\n-A = input().split()\n-print(A[::-1])\n+print(\" \".join(input().split()[::-1]))\n \n", "FL_content": " input()\n-A = input().split()\n-print(A[::-1])\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u264632995", "problem_id": "p02407", "submission1_id": "s657346479", "submission2_id": "s454484594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input()\na = input().split()\n\nprint(a)\na.reverse()\nprint(\" \".join(a))", "code2": "input()\na = input().split()\na.reverse()\nprint(\" \".join(a))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1469683999", "date2": "1469684062", "bleu_score": "0.8377788815891453", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n4 3 4 4 5 8 7 14\n", "actual_output": "['4', '3', '4', '4', '5', '8', '7', '14']\n14 7 8 5 4 4 3 4\n", "expected_output": "14 7 8 5 4 4 3 4\n\n", "anno_code": ["input() # (0): NO CHANGE\na = input().split() # (1): a=['4', '3', '4', '4', '5', '8', '7', '14']\n\nprint(a) # (2): NO CHANGE\na.reverse() # (3): a=['14', '7', '8', '5', '4', '4', '3', '4']\nprint(\" \".join(a))"], "anno_status": [true], "diff_content": " input()\n a = input().split()\n-\n-print(a)\n a.reverse()\n print(\" \".join(a))\n", "FL_content": " input()\n a = input().split()\n-\n-print(a)\n a.reverse()\n print(\" \".join(a))\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u664228906", "problem_id": "p02407", "submission1_id": "s192578819", "submission2_id": "s804541424", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nArr = list(map(int, input().split()))\nfor i in range(N):\n if i==N-1:\n print(Arr[0])\n else:\n print(str(Arr[N-1-i]) + \" \")", "code2": "N = int(input())\nArr = list(map(int, input().split()))\nfor i in range(N-1):\n print(\"{} \".format(Arr[N-1-i]), end=\"\")\nprint(Arr[0])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1506411960", "date2": "1506412100", "bleu_score": "0.7534300290004067", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n0 2 4 4 5 0 7 14\n", "actual_output": "14 \n7 \n0 \n5 \n4 \n4 \n2 \n0\n", "expected_output": "14 7 0 5 4 4 2 0\n\n", "anno_code": ["N = int(input()) # (0): N=8\nArr = list(map(int, input().split())) # (1): Arr=[0, 2, 4, 4, 5, 0, 7, 14]\nfor i in range(N): # (2): i=0 (5): i=1 ... (23): i=7\n if i==N-1: # (3): NO CHANGE (6): NO CHANGE ... (24): NO CHANGE\n print(Arr[0]) # (25): NO CHANGE\n else:\n print(str(Arr[N-1-i]) + \" \") # (4): NO CHANGE (7): NO CHANGE ... (22): NO CHANGE\n"], "anno_status": [true], "diff_content": " N = int(input())\n Arr = list(map(int, input().split()))\n-for i in range(N):\n- if i==N-1:\n- print(Arr[0])\n- else:\n- print(str(Arr[N-1-i]) + \" \")\n+for i in range(N-1):\n+ print(\"{} \".format(Arr[N-1-i]), end=\"\")\n+print(Arr[0])\n", "FL_content": " N = int(input())\n Arr = list(map(int, input().split()))\n-for i in range(N):\n- if i==N-1:\n- print(Arr[0])\n- else:\n- print(str(Arr[N-1-i]) + \" \")\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 7 }, { "user_id": "u831971779", "problem_id": "p02407", "submission1_id": "s086355108", "submission2_id": "s323682932", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nprint(\" \".join(input().split())[::-1])", "code2": "n = int(input())\nprint(\" \".join(input().split()[::-1]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1498722552", "date2": "1498722595", "bleu_score": "0.9758245965938708", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 10, "total_score": 101, "input": "5\n0 0 1 31 0\n", "actual_output": "0 13 1 0 0\n", "expected_output": "0 31 1 0 0\n\n", "anno_code": ["n = int(input()) # (0): n=5\nprint(\" \".join(input().split())[::-1])"], "anno_status": [true], "diff_content": " n = int(input())\n-print(\" \".join(input().split())[::-1])\n+print(\" \".join(input().split()[::-1]))\n", "FL_content": " n = int(input())\n-print(\" \".join(input().split())[::-1])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u299257375", "problem_id": "p02407", "submission1_id": "s411274558", "submission2_id": "s731760701", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\nprint(list(map(int, input().split()))[::-1])\n", "code2": "input()\nprint(\" \".join(input().split()[::-1]))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1516158989", "date2": "1516159810", "bleu_score": "0.614542500168871", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-1 -1 1 1 -1\n", "actual_output": "[-1, 1, 1, -1, -1]\n", "expected_output": "-1 1 1 -1 -1\n\n", "anno_code": ["n = input() # (0): n=5\nprint(list(map(int, input().split()))[::-1])\n"], "anno_status": [true], "diff_content": "-n = input()\n-print(list(map(int, input().split()))[::-1])\n+input()\n+print(\" \".join(input().split()[::-1]))\n \n", "FL_content": "-n = input()\n-print(list(map(int, input().split()))[::-1])\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u350064373", "problem_id": "p02407", "submission1_id": "s813263493", "submission2_id": "s425191855", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input()\nlist1 = list(map(int, input().split()))\nlist1.sort()\nresult=\"\"\nfor i in range(0,len(list1)):\n result += str(list1[i])+\" \"\nprint(result)", "code2": "input()\nlist1 = list(map(int, input().split()))\nlist1.reverse()\nresult=\"\"\nfor i in range(0,len(list1)):\n result += str(list1[i])\n if len(list1)-1 == i:\n pass\n else:\n result += \" \"\nprint(result)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500529644", "date2": "1500530844", "bleu_score": "0.6406447922038532", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n0 0 3 4 12\n", "actual_output": "0 0 3 4 12 \n", "expected_output": "12 4 3 0 0\n\n", "anno_code": ["input() # (0): NO CHANGE\nlist1 = list(map(int, input().split())) # (1): list1=[0, 0, 3, 4, 12]\nlist1.sort() # (2): NO CHANGE\nresult=\"\" # (3): result=\nfor i in range(0,len(list1)): # (4): i=0 (6): i=1 ... (14): NO CHANGE\n result += str(list1[i])+\" \" # (5): result=0 (7): result=0 0 ... (13): result=0 0 3 4 12 \nprint(result)"], "anno_status": [true], "diff_content": " input()\n list1 = list(map(int, input().split()))\n-list1.sort()\n+list1.reverse()\n result=\"\"\n for i in range(0,len(list1)):\n- result += str(list1[i])+\" \"\n+ result += str(list1[i])\n+ if len(list1)-1 == i:\n+ pass\n+ else:\n+ result += \" \"\n print(result)\n", "FL_content": " input()\n list1 = list(map(int, input().split()))\n-list1.sort()\n result=\"\"\n for i in range(0,len(list1)):\n- result += str(list1[i])+\" \"\n print(result)\n", "added_lines": 6, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u539789745", "problem_id": "p02407", "submission1_id": "s148733919", "submission2_id": "s127764007", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n = int(input())\n a = input()\n print(a[::-1])\n\nif __name__ == \"__main__\":\n main()", "code2": "def main():\n n = int(input())\n a = map(int, input().split())\n print(\" \".join(map(str, list(a)[::-1])))\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1512225707", "date2": "1512946116", "bleu_score": "0.6759276190988394", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 10, "total_score": 101, "input": "8\n-2 0 0 32 -1 -1 95 26\n", "actual_output": "62 59 1- 1- 23 0 0 2-\n", "expected_output": "26 95 -1 -1 32 0 0 -2\n\n", "anno_code": ["def main(): # (0): main=\n n = int(input())\n a = input()\n print(a[::-1])\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " def main():\n n = int(input())\n- a = input()\n- print(a[::-1])\n+ a = map(int, input().split())\n+ print(\" \".join(map(str, list(a)[::-1])))\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " def main():\n n = int(input())\n- a = input()\n- print(a[::-1])\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u831971779", "problem_id": "p02407", "submission1_id": "s266078536", "submission2_id": "s323682932", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\nprint(\" \".join(input().split())[::-1])", "code2": "n = int(input())\nprint(\" \".join(input().split()[::-1]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1498722513", "date2": "1498722595", "bleu_score": "0.8720359434196033", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 10, "total_score": 101, "input": "5\n-1 1 0 21 -2\n", "actual_output": "2- 12 0 1 1-\n", "expected_output": "-2 21 0 1 -1\n\n", "anno_code": ["n = input() # (0): n=5\nprint(\" \".join(input().split())[::-1])"], "anno_status": [true], "diff_content": "-n = input()\n-print(\" \".join(input().split())[::-1])\n+n = int(input())\n+print(\" \".join(input().split()[::-1]))\n", "FL_content": "-n = input()\n-print(\" \".join(input().split())[::-1])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u641357568", "problem_id": "p02407", "submission1_id": "s619354124", "submission2_id": "s727693465", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nlength = int(sys.stdin.readline())\nnum_seq = sys.stdin.readline().split()\nprint(num_seq)\n\nfor i in range(1,length):\n print(num_seq[length - i],end=' ')\nprint(num_seq[0])\n", "code2": "import sys\n\nlength = int(sys.stdin.readline())\nnum_seq = sys.stdin.readline().split()\n\nfor i in range(1, length):\n print(num_seq[length - i], end=' ')\nprint(num_seq[0])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1520594511", "date2": "1520595319", "bleu_score": "0.8984474430775924", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-1 1 4 4 5 0 7 14\n", "actual_output": "['-1', '1', '4', '4', '5', '0', '7', '14']\n14 7 0 5 4 4 1 -1\n", "expected_output": "14 7 0 5 4 4 1 -1\n\n", "anno_code": ["import sys\n\nlength = int(sys.stdin.readline()) # (0): length=8\nnum_seq = sys.stdin.readline().split() # (1): num_seq=['-1', '1', '4', '4', '5', '0', '7', '14']\nprint(num_seq) # (2): NO CHANGE\n\nfor i in range(1,length): # (3): i=1 (5): i=2 ... (17): NO CHANGE\n print(num_seq[length - i],end=' ') # (4): NO CHANGE (6): NO CHANGE ... (16): NO CHANGE\nprint(num_seq[0])\n"], "anno_status": [true], "diff_content": " import sys\n \n length = int(sys.stdin.readline())\n num_seq = sys.stdin.readline().split()\n-print(num_seq)\n \n-for i in range(1,length):\n- print(num_seq[length - i],end=' ')\n+for i in range(1, length):\n+ print(num_seq[length - i], end=' ')\n print(num_seq[0])\n \n", "FL_content": " import sys\n \n length = int(sys.stdin.readline())\n num_seq = sys.stdin.readline().split()\n-print(num_seq)\n \n-for i in range(1,length):\n- print(num_seq[length - i],end=' ')\n print(num_seq[0])\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u972637506", "problem_id": "p02407", "submission1_id": "s111581134", "submission2_id": "s381050036", "status1": "Wrong Answer", "status2": "Accepted", "code1": "_ = input()\n\nprint(\"\".join(reversed(input())))", "code2": "_ = input()\nprint(\" \".join(reversed(input().split())))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1505356946", "date2": "1505357108", "bleu_score": "0.7837451817039764", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 10, "total_score": 101, "input": "8\n-2 1 0 32 -2 -2 153 26\n", "actual_output": "62 351 2- 2- 23 0 1 2-\n", "expected_output": "26 153 -2 -2 32 0 1 -2\n\n", "anno_code": ["_ = input() # (0): _=8\n\nprint(\"\".join(reversed(input())))"], "anno_status": [true], "diff_content": " _ = input()\n-\n-print(\"\".join(reversed(input())))\n+print(\" \".join(reversed(input().split())))\n", "FL_content": " _ = input()\n-\n-print(\"\".join(reversed(input())))\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u073709667", "problem_id": "p02385", "submission1_id": "s879255025", "submission2_id": "s309460822", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\ndef E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\ndef W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\ndef S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\nDice=[int(i) for i in input().split()]\nDice2=[int(i) for i in input().split()]\nif (Dice[0] in Dice2)==False:\n print('No')\nelse:\n count=0\n for j in range(12):\n if count%2==0:\n N()\n else:\n W()\n count+=1\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n if Dice==Dice2:\n print('Yes')\n else:\n print('No')", "code2": "def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\ndef E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\ndef W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\ndef S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\nDice=[int(i) for i in input().split()]\nDice2=[int(i) for i in input().split()]\nif (Dice[0] in Dice2)==False:\n print('No')\nelse:\n for j in range(6):\n if j%2==0:\n N()\n else:\n W()\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n if Dice==Dice2:\n break \n if Dice==Dice2:\n print('Yes')\n else:\n print('No')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1476202858", "date2": "1476203175", "bleu_score": "0.9583683388256148", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["def N(): # (0): N=\n num=Dice[0] # (11): num=1 (19): num=2 ... (1049): num=1\n Dice[0]=Dice[1] # (12): NO CHANGE (20): NO CHANGE ... (1050): NO CHANGE\n Dice[1]=Dice[5] # (13): NO CHANGE (21): NO CHANGE ... (1051): NO CHANGE\n Dice[5]=Dice[4] # (14): NO CHANGE (22): NO CHANGE ... (1052): NO CHANGE\n Dice[4]=num # (15): N=, E=, W=, S=, Dice=[2, 6, 3, 4, 1, 5], Dice2=[6, 2, 4, 3, 5, 1], count=0, j=0 (23): N=, E=, W=, S=, Dice=[6, 5, 3, 4, 2, 1], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=0 ... (1053): N=, E=, W=, S=, Dice=[2, 6, 3, 4, 1, 5], Dice2=[6, 2, 4, 3, 5, 1], count=12, j=11, i=3\ndef E(): # (1): E=\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\ndef W(): # (2): W=\n num=Dice[0] # (25): num=6 (45): num=3 ... (1055): num=2\n Dice[0]=Dice[2] # (26): NO CHANGE (46): NO CHANGE ... (1056): NO CHANGE\n Dice[2]=Dice[5] # (27): NO CHANGE (47): NO CHANGE ... (1057): NO CHANGE\n Dice[5]=Dice[3] # (28): NO CHANGE (48): NO CHANGE ... (1058): NO CHANGE\n Dice[3]=num # (29): N=, E=, W=, S=, Dice=[3, 5, 1, 6, 2, 4], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=0 (49): N=, E=, W=, S=, Dice=[1, 5, 4, 3, 2, 6], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=1 ... (1059): N=, E=, W=, S=, Dice=[3, 6, 5, 2, 1, 4], Dice2=[6, 2, 4, 3, 5, 1], count=12, j=11, i=3\ndef S(): # (3): S=\n num=Dice[0] # (31): num=3 (51): num=1 ... (1061): num=3\n Dice[0]=Dice[4] # (32): NO CHANGE (52): NO CHANGE ... (1062): NO CHANGE\n Dice[4]=Dice[5] # (33): NO CHANGE (53): NO CHANGE ... (1063): NO CHANGE\n Dice[5]=Dice[1] # (34): NO CHANGE (54): NO CHANGE ... (1064): NO CHANGE\n Dice[1]=num # (35): N=, E=, W=, S=, Dice=[2, 3, 1, 6, 4, 5], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=0 (55): N=, E=, W=, S=, Dice=[2, 1, 4, 3, 6, 5], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=1 ... (1065): N=, E=, W=, S=, Dice=[1, 3, 5, 2, 4, 6], Dice2=[6, 2, 4, 3, 5, 1], count=12, j=11, i=3\nDice=[int(i) for i in input().split()] # (4): Dice=[1, 2, 3, 4, 5, 6]\nDice2=[int(i) for i in input().split()] # (5): Dice2=[6, 2, 4, 3, 5, 1]\nif (Dice[0] in Dice2)==False: # (6): NO CHANGE\n print('No')\nelse:\n count=0 # (7): count=0\n for j in range(12): # (8): j=0 (98): j=1 ... (1068): NO CHANGE\n if count%2==0: # (9): NO CHANGE (99): NO CHANGE ... (979): NO CHANGE\n N() # (10): NO CHANGE (190): NO CHANGE ... (890): NO CHANGE\n else:\n W() # (100): NO CHANGE (260): NO CHANGE ... (980): NO CHANGE\n count+=1 # (16): count=1 (106): count=2 ... (986): count=12\n for i in range(4): # (17): i=0 (37): i=1 ... (1067): NO CHANGE\n N() # (18): NO CHANGE (38): NO CHANGE ... (1048): NO CHANGE\n W() # (24): NO CHANGE (44): NO CHANGE ... (1054): NO CHANGE\n S() # (30): NO CHANGE (50): NO CHANGE ... (1060): NO CHANGE\n if Dice==Dice2: # (36): NO CHANGE (56): NO CHANGE ... (1066): NO CHANGE\n break # (257): NO CHANGE (797): NO CHANGE\n if Dice==Dice2: # (1069): NO CHANGE\n print('Yes')\n else:\n print('No')"], "anno_status": [false], "diff_content": " def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\n def E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\n def W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\n def S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\n Dice=[int(i) for i in input().split()]\n Dice2=[int(i) for i in input().split()]\n if (Dice[0] in Dice2)==False:\n print('No')\n else:\n- count=0\n- for j in range(12):\n- if count%2==0:\n+ for j in range(6):\n+ if j%2==0:\n N()\n else:\n W()\n- count+=1\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n+ if Dice==Dice2:\n+ break \n if Dice==Dice2:\n print('Yes')\n else:\n print('No')\n", "FL_content": " def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\n def E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\n def W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\n def S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\n Dice=[int(i) for i in input().split()]\n Dice2=[int(i) for i in input().split()]\n if (Dice[0] in Dice2)==False:\n print('No')\n else:\n- count=0\n- for j in range(12):\n- if count%2==0:\n N()\n else:\n W()\n- count+=1\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n if Dice==Dice2:\n print('Yes')\n else:\n print('No')\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 46 }, { "user_id": "u647634615", "problem_id": "p02385", "submission1_id": "s695248762", "submission2_id": "s068178659", "status1": "Wrong Answer", "status2": "Accepted", "code1": "dice_1 = input().split()\ndice_2 = input().split()\n\nrolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\norders = [' ', 'N', 'W', 'E', 'S', 'SS']\ntf = 0\nfor order in orders:\n for d in order:\n roll = rolls[d]\n copy_2 = [dice_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n else:\n print(order)\n print(dice_1)\n print(copy_2)\n\nif tf>0:\n print('Yes')\nelse:\n print('No')\n", "code2": "dice_1 = input().split()\ndice_2 = input().split()\n\nrolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\norders = [' ', 'N', 'W', 'E', 'S', 'NN']\ntf = 0\nfor order in orders:\n copy_2 = dice_2\n for d in order:\n roll = rolls[d]\n copy_2 = [copy_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n\n\n\n\n\n\nif tf>0:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545276778", "date2": "1545279232", "bleu_score": "0.8993214940042009", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 1 0 1 50 -1\n5 0 0 0 9 4\n", "actual_output": " \n['2', '1', '0', '1', '50', '-1']\n['5', '0', '0', '0', '9', '4']\nN\n['2', '1', '0', '1', '50', '-1']\n['0', '4', '0', '0', '5', '9']\nW\n['2', '1', '0', '1', '50', '-1']\n['0', '0', '4', '5', '9', '0']\nE\n['2', '1', '0', '1', '50', '-1']\n['0', '0', '5', '4', '9', '0']\nS\n['2', '1', '0', '1', '50', '-1']\n['9', '5', '0', '0', '4', '0']\nSS\n['2', '1', '0', '1', '50', '-1']\n['9', '5', '0', '0', '4', '0']\nNo\n", "expected_output": "No\n\n", "anno_code": ["dice_1 = input().split() # (0): dice_1=['2', '1', '0', '1', '50', '-1']\ndice_2 = input().split() # (1): dice_2=['5', '0', '0', '0', '9', '4']\n\nrolls = {' ':[0, 1, 2, 3, 4, 5], # (2): NO CHANGE (7): rolls={' ': [0, 1, 2, 3, 4, 5], 'W': [2, 1, 5, 0, 4, 3], 'N': [1, 5, 2, 3, 0, 4], 'E': [3, 1, 0, 5, 4, 2], 'S': [4, 0, 2, 3, 5, 1]}\n 'W':[2, 1, 5, 0, 4, 3], # (3): NO CHANGE\n 'N':[1, 5, 2, 3, 0, 4], # (4): NO CHANGE\n 'E':[3, 1, 0, 5, 4, 2], # (5): NO CHANGE\n 'S':[4, 0, 2, 3, 5, 1] # (6): NO CHANGE\n }\norders = [' ', 'N', 'W', 'E', 'S', 'SS'] # (8): orders=[' ', 'N', 'W', 'E', 'S', 'SS']\ntf = 0 # (9): tf=0\nfor order in orders: # (10): order= (23): order=N ... (91): NO CHANGE\n for d in order: # (11): d= (14): NO CHANGE ... (82): NO CHANGE\n roll = rolls[d] # (12): roll=[0, 1, 2, 3, 4, 5] (25): roll=[1, 5, 2, 3, 0, 4] ... (80): NO CHANGE\n copy_2 = [dice_2[i] for i in roll] # (13): copy_2=['5', '0', '0', '0', '9', '4'] (26): copy_2=['0', '4', '0', '0', '5', '9'] ... (81): NO CHANGE\n \n l = [1, 2, 4, 3] # (15): l=[1, 2, 4, 3] (28): NO CHANGE ... (83): NO CHANGE\n a0 = copy_2[0] == dice_1[0] # (16): a0=False (29): NO CHANGE ... (84): NO CHANGE\n a1 = copy_2[5] == dice_1[5] # (17): a1=False (30): NO CHANGE ... (85): NO CHANGE\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2) # (18): a2=False (31): NO CHANGE ... (86): NO CHANGE\n if a0 and a1 and a2: # (19): NO CHANGE (32): NO CHANGE ... (87): NO CHANGE\n tf += 1\n else:\n print(order) # (20): NO CHANGE (33): NO CHANGE ... (88): NO CHANGE\n print(dice_1) # (21): NO CHANGE (34): NO CHANGE ... (89): NO CHANGE\n print(copy_2) # (22): NO CHANGE (35): NO CHANGE ... (90): NO CHANGE\n\nif tf>0: # (92): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " dice_1 = input().split()\n dice_2 = input().split()\n \n rolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\n-orders = [' ', 'N', 'W', 'E', 'S', 'SS']\n+orders = [' ', 'N', 'W', 'E', 'S', 'NN']\n tf = 0\n for order in orders:\n+ copy_2 = dice_2\n for d in order:\n roll = rolls[d]\n- copy_2 = [dice_2[i] for i in roll]\n+ copy_2 = [copy_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n- else:\n- print(order)\n- print(dice_1)\n- print(copy_2)\n+\n+\n+\n+\n+\n \n if tf>0:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " dice_1 = input().split()\n dice_2 = input().split()\n \n rolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\n-orders = [' ', 'N', 'W', 'E', 'S', 'SS']\n tf = 0\n for order in orders:\n for d in order:\n roll = rolls[d]\n- copy_2 = [dice_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n- else:\n- print(order)\n- print(dice_1)\n- print(copy_2)\n \n if tf>0:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 8, "removed_lines": 6, "code1_lines": 32 }, { "user_id": "u073709667", "problem_id": "p02385", "submission1_id": "s347124527", "submission2_id": "s309460822", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\ndef E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\ndef W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\ndef S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\nDice=[int(i) for i in input().split()]\nDice2=[int(i) for i in input().split()]\nif (Dice[0] in Dice2)==False:\n print('No')\nelse:\n count=0\n for j in range(6):\n if count%2==0:\n N()\n else:\n W()\n count+=1\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n if Dice==Dice2:\n print('Yes')\n else:\n print('No')", "code2": "def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\ndef E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\ndef W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\ndef S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\nDice=[int(i) for i in input().split()]\nDice2=[int(i) for i in input().split()]\nif (Dice[0] in Dice2)==False:\n print('No')\nelse:\n for j in range(6):\n if j%2==0:\n N()\n else:\n W()\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n if Dice==Dice2:\n break \n if Dice==Dice2:\n print('Yes')\n else:\n print('No')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1476202818", "date2": "1476203175", "bleu_score": "0.9610000647004233", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["def N(): # (0): N=\n num=Dice[0] # (11): num=1 (19): num=2 ... (509): num=1\n Dice[0]=Dice[1] # (12): NO CHANGE (20): NO CHANGE ... (510): NO CHANGE\n Dice[1]=Dice[5] # (13): NO CHANGE (21): NO CHANGE ... (511): NO CHANGE\n Dice[5]=Dice[4] # (14): NO CHANGE (22): NO CHANGE ... (512): NO CHANGE\n Dice[4]=num # (15): N=, E=, W=, S=, Dice=[2, 6, 3, 4, 1, 5], Dice2=[6, 2, 4, 3, 5, 1], count=0, j=0 (23): N=, E=, W=, S=, Dice=[6, 5, 3, 4, 2, 1], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=0 ... (513): N=, E=, W=, S=, Dice=[2, 6, 3, 4, 1, 5], Dice2=[6, 2, 4, 3, 5, 1], count=6, j=5, i=3\ndef E(): # (1): E=\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\ndef W(): # (2): W=\n num=Dice[0] # (25): num=6 (45): num=3 ... (515): num=2\n Dice[0]=Dice[2] # (26): NO CHANGE (46): NO CHANGE ... (516): NO CHANGE\n Dice[2]=Dice[5] # (27): NO CHANGE (47): NO CHANGE ... (517): NO CHANGE\n Dice[5]=Dice[3] # (28): NO CHANGE (48): NO CHANGE ... (518): NO CHANGE\n Dice[3]=num # (29): N=, E=, W=, S=, Dice=[3, 5, 1, 6, 2, 4], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=0 (49): N=, E=, W=, S=, Dice=[1, 5, 4, 3, 2, 6], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=1 ... (519): N=, E=, W=, S=, Dice=[3, 6, 5, 2, 1, 4], Dice2=[6, 2, 4, 3, 5, 1], count=6, j=5, i=3\ndef S(): # (3): S=\n num=Dice[0] # (31): num=3 (51): num=1 ... (521): num=3\n Dice[0]=Dice[4] # (32): NO CHANGE (52): NO CHANGE ... (522): NO CHANGE\n Dice[4]=Dice[5] # (33): NO CHANGE (53): NO CHANGE ... (523): NO CHANGE\n Dice[5]=Dice[1] # (34): NO CHANGE (54): NO CHANGE ... (524): NO CHANGE\n Dice[1]=num # (35): N=, E=, W=, S=, Dice=[2, 3, 1, 6, 4, 5], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=0 (55): N=, E=, W=, S=, Dice=[2, 1, 4, 3, 6, 5], Dice2=[6, 2, 4, 3, 5, 1], count=1, j=0, i=1 ... (525): N=, E=, W=, S=, Dice=[1, 3, 5, 2, 4, 6], Dice2=[6, 2, 4, 3, 5, 1], count=6, j=5, i=3\nDice=[int(i) for i in input().split()] # (4): Dice=[1, 2, 3, 4, 5, 6]\nDice2=[int(i) for i in input().split()] # (5): Dice2=[6, 2, 4, 3, 5, 1]\nif (Dice[0] in Dice2)==False: # (6): NO CHANGE\n print('No')\nelse:\n count=0 # (7): count=0\n for j in range(6): # (8): j=0 (98): j=1 ... (528): NO CHANGE\n if count%2==0: # (9): NO CHANGE (99): NO CHANGE ... (439): NO CHANGE\n N() # (10): NO CHANGE (190): NO CHANGE (350): NO CHANGE\n else:\n W() # (100): NO CHANGE (260): NO CHANGE (440): NO CHANGE\n count+=1 # (16): count=1 (106): count=2 ... (446): count=6\n for i in range(4): # (17): i=0 (37): i=1 ... (527): NO CHANGE\n N() # (18): NO CHANGE (38): NO CHANGE ... (508): NO CHANGE\n W() # (24): NO CHANGE (44): NO CHANGE ... (514): NO CHANGE\n S() # (30): NO CHANGE (50): NO CHANGE ... (520): NO CHANGE\n if Dice==Dice2: # (36): NO CHANGE (56): NO CHANGE ... (526): NO CHANGE\n break # (257): NO CHANGE\n if Dice==Dice2: # (529): NO CHANGE\n print('Yes')\n else:\n print('No')"], "anno_status": [false], "diff_content": " def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\n def E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\n def W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\n def S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\n Dice=[int(i) for i in input().split()]\n Dice2=[int(i) for i in input().split()]\n if (Dice[0] in Dice2)==False:\n print('No')\n else:\n- count=0\n for j in range(6):\n- if count%2==0:\n+ if j%2==0:\n N()\n else:\n W()\n- count+=1\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n+ if Dice==Dice2:\n+ break \n if Dice==Dice2:\n print('Yes')\n else:\n print('No')\n", "FL_content": " def N():\n num=Dice[0]\n Dice[0]=Dice[1]\n Dice[1]=Dice[5]\n Dice[5]=Dice[4]\n Dice[4]=num\n def E():\n num=Dice[0]\n Dice[0]=Dice[3]\n Dice[3]=Dice[5]\n Dice[5]=Dice[2]\n Dice[2]=num\n def W():\n num=Dice[0]\n Dice[0]=Dice[2]\n Dice[2]=Dice[5]\n Dice[5]=Dice[3]\n Dice[3]=num\n def S():\n num=Dice[0]\n Dice[0]=Dice[4]\n Dice[4]=Dice[5]\n Dice[5]=Dice[1]\n Dice[1]=num\n Dice=[int(i) for i in input().split()]\n Dice2=[int(i) for i in input().split()]\n if (Dice[0] in Dice2)==False:\n print('No')\n else:\n- count=0\n for j in range(6):\n- if count%2==0:\n N()\n else:\n W()\n- count+=1\n for i in range(4):\n N()\n W()\n S()\n if Dice==Dice2:\n break\n if Dice==Dice2:\n print('Yes')\n else:\n print('No')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 46 }, { "user_id": "u400765446", "problem_id": "p02385", "submission1_id": "s439234011", "submission2_id": "s928595554", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nclass Dice:\n\n def __init__(self):\n \n \n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, t, s, e, w, n, b):\n \n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def rot(self, way):\n if way == 0: \n self.t, self.s, self.e, self.w, self.n, self.b = self.n, self.t, self.e, self.w, self.b, self.s\n elif way == 1: \n self.t, self.s, self.e, self.w, self.n, self.b = self.s, self.b, self.e, self.w, self.t, self.n\n elif way == 2: \n self.t, self.s, self.e, self.w, self.n, self.b = self.w, self.s, self.t, self.b, self.n, self.e\n elif way == 3: \n self.t, self.s, self.e, self.w, self.n, self.b = self.e, self.s, self.b, self.t, self.n, self.w\n elif way == 4: \n self.t, self.s, self.e, self.w, self.n, self.b = self.t, self.w, self.s, self.n, self.e, self.b\n \n def settop(self, num):\n \n if num not in (self.t, self.s, self.e, self.w, self.n, self.b):\n print(\"unexpected error\")\n sys.exit\n elif num == self.t: \n pass\n elif num == self.b: \n self.rot(0)\n self.rot(0)\n elif num == self.n: \n self.rot(1)\n elif num == self.s: \n self.rot(0)\n elif num == self.e: \n self.rot(2)\n elif num == self.w: \n self.rot(3)\n \n\ndef main():\n t1,s1,e1,w1,n1,b1 = map(int, input().split())\n t2,s2,e2,w2,n2,b2 = map(int, input().split())\n\n dice1 = Dice(t1,s1,e1,w1,n1,b1)\n dice2 = Dice(t2,s2,e2,w2,n2,b2)\n\n \n dice2.settop(dice1.t)\n flag = 0\n for _ in range(4):\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (dice2.t, dice2.s, dice2.e, dice2.w, dice2.n, dice2.b):\n flag = 1\n break\n else:\n dice2.rot(4)\n\n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__ == '__main__':\n main()\n\n", "code2": "class Dice:\n\n def __init__(self):\n \n \n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, t, s, e, w, n, b):\n \n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def rot(self, way):\n if way == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = self.n, self.t, self.e, self.w, self.b, self.s\n elif way == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = self.s, self.b, self.e, self.w, self.t, self.n\n elif way == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = self.w, self.s, self.t, self.b, self.n, self.e\n elif way == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = self.e, self.s, self.b, self.t, self.n, self.w\n \n \ndef main():\n import random\n\n t1,s1,e1,w1,n1,b1 = map(int, input().split())\n t2,s2,e2,w2,n2,b2 = map(int, input().split())\n\n dice1 = Dice(t1,s1,e1,w1,n1,b1)\n dice2 = Dice(t2,s2,e2,w2,n2,b2)\n\n flag = 0\n\n for _ in range(10000):\n\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (dice2.t, dice2.s, dice2.e, dice2.w, dice2.n, dice2.b):\n flag = 1\n break\n else:\n seed = random.randint(0, 3)\n dice2.rot(seed)\n\n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\n\nif __name__ == '__main__':\n main()\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531577431", "date2": "1531577763", "bleu_score": "0.6696816871144176", "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, 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, 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, 1, 1, 1, 1, 1], "code1_test_score": 58, "total_score": 102, "input": "-1 2 -1 -1 722 0\n1 0 2 1 27 2\n", "actual_output": "unexpected error\nNo\n", "expected_output": "No\n\n", "anno_code": ["import sys\nclass Dice: # (0): Dice=\n\n def __init__(self):\n \n \n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, t, s, e, w, n, b):\n \n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def rot(self, way):\n if way == 0: \n self.t, self.s, self.e, self.w, self.n, self.b = self.n, self.t, self.e, self.w, self.b, self.s\n elif way == 1: \n self.t, self.s, self.e, self.w, self.n, self.b = self.s, self.b, self.e, self.w, self.t, self.n\n elif way == 2: \n self.t, self.s, self.e, self.w, self.n, self.b = self.w, self.s, self.t, self.b, self.n, self.e\n elif way == 3: \n self.t, self.s, self.e, self.w, self.n, self.b = self.e, self.s, self.b, self.t, self.n, self.w\n elif way == 4: \n self.t, self.s, self.e, self.w, self.n, self.b = self.t, self.w, self.s, self.n, self.e, self.b\n \n def settop(self, num):\n \n if num not in (self.t, self.s, self.e, self.w, self.n, self.b):\n print(\"unexpected error\")\n sys.exit\n elif num == self.t: \n pass\n elif num == self.b: \n self.rot(0)\n self.rot(0)\n elif num == self.n: \n self.rot(1)\n elif num == self.s: \n self.rot(0)\n elif num == self.e: \n self.rot(2)\n elif num == self.w: \n self.rot(3)\n \n\ndef main(): # (1): main=\n t1,s1,e1,w1,n1,b1 = map(int, input().split())\n t2,s2,e2,w2,n2,b2 = map(int, input().split())\n\n dice1 = Dice(t1,s1,e1,w1,n1,b1)\n dice2 = Dice(t2,s2,e2,w2,n2,b2)\n\n \n dice2.settop(dice1.t)\n flag = 0\n for _ in range(4):\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (dice2.t, dice2.s, dice2.e, dice2.w, dice2.n, dice2.b):\n flag = 1\n break\n else:\n dice2.rot(4)\n\n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__ == '__main__':\n main()\n\n"], "anno_status": [false], "diff_content": "-import sys\n class Dice:\n \n def __init__(self):\n \n \n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n \n def __init__(self, t, s, e, w, n, b):\n \n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n \n def rot(self, way):\n- if way == 0: \n+ if way == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = self.n, self.t, self.e, self.w, self.b, self.s\n- elif way == 1: \n+ elif way == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = self.s, self.b, self.e, self.w, self.t, self.n\n- elif way == 2: \n+ elif way == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = self.w, self.s, self.t, self.b, self.n, self.e\n- elif way == 3: \n+ elif way == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = self.e, self.s, self.b, self.t, self.n, self.w\n- elif way == 4: \n- self.t, self.s, self.e, self.w, self.n, self.b = self.t, self.w, self.s, self.n, self.e, self.b\n- \n- def settop(self, num):\n \n- if num not in (self.t, self.s, self.e, self.w, self.n, self.b):\n- print(\"unexpected error\")\n- sys.exit\n- elif num == self.t: \n- pass\n- elif num == self.b: \n- self.rot(0)\n- self.rot(0)\n- elif num == self.n: \n- self.rot(1)\n- elif num == self.s: \n- self.rot(0)\n- elif num == self.e: \n- self.rot(2)\n- elif num == self.w: \n- self.rot(3)\n- \n-\n+ \n def main():\n+ import random\n+\n t1,s1,e1,w1,n1,b1 = map(int, input().split())\n t2,s2,e2,w2,n2,b2 = map(int, input().split())\n \n dice1 = Dice(t1,s1,e1,w1,n1,b1)\n dice2 = Dice(t2,s2,e2,w2,n2,b2)\n \n- \n- dice2.settop(dice1.t)\n flag = 0\n- for _ in range(4):\n+\n+ for _ in range(10000):\n+\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (dice2.t, dice2.s, dice2.e, dice2.w, dice2.n, dice2.b):\n flag = 1\n break\n else:\n- dice2.rot(4)\n+ seed = random.randint(0, 3)\n+ dice2.rot(seed)\n \n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n \n+\n+\n if __name__ == '__main__':\n main()\n \n \n", "FL_content": "-import sys\n class Dice:\n \n def __init__(self):\n \n \n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n \n def __init__(self, t, s, e, w, n, b):\n \n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n \n def rot(self, way):\n- if way == 0: \n self.t, self.s, self.e, self.w, self.n, self.b = self.n, self.t, self.e, self.w, self.b, self.s\n- elif way == 1: \n self.t, self.s, self.e, self.w, self.n, self.b = self.s, self.b, self.e, self.w, self.t, self.n\n- elif way == 2: \n self.t, self.s, self.e, self.w, self.n, self.b = self.w, self.s, self.t, self.b, self.n, self.e\n- elif way == 3: \n self.t, self.s, self.e, self.w, self.n, self.b = self.e, self.s, self.b, self.t, self.n, self.w\n- elif way == 4: \n- self.t, self.s, self.e, self.w, self.n, self.b = self.t, self.w, self.s, self.n, self.e, self.b\n- \n- def settop(self, num):\n \n- if num not in (self.t, self.s, self.e, self.w, self.n, self.b):\n- print(\"unexpected error\")\n- sys.exit\n- elif num == self.t: \n- pass\n- elif num == self.b: \n- self.rot(0)\n- self.rot(0)\n- elif num == self.n: \n- self.rot(1)\n- elif num == self.s: \n- self.rot(0)\n- elif num == self.e: \n- self.rot(2)\n- elif num == self.w: \n- self.rot(3)\n- \n-\n def main():\n t1,s1,e1,w1,n1,b1 = map(int, input().split())\n t2,s2,e2,w2,n2,b2 = map(int, input().split())\n \n dice1 = Dice(t1,s1,e1,w1,n1,b1)\n dice2 = Dice(t2,s2,e2,w2,n2,b2)\n \n- \n- dice2.settop(dice1.t)\n flag = 0\n- for _ in range(4):\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (dice2.t, dice2.s, dice2.e, dice2.w, dice2.n, dice2.b):\n flag = 1\n break\n else:\n- dice2.rot(4)\n \n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n \n if __name__ == '__main__':\n main()\n \n \n", "added_lines": 14, "removed_lines": 31, "code1_lines": 82 }, { "user_id": "u647634615", "problem_id": "p02385", "submission1_id": "s193501930", "submission2_id": "s068178659", "status1": "Wrong Answer", "status2": "Accepted", "code1": "dice_1 = input().split()\ndice_2 = input().split()\n\nrolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\norders = [' ', 'N', 'W', 'E', 'S', 'SS']\ntf = 0\nfor order in orders:\n for d in order:\n roll = rolls[d]\n copy_2 = [dice_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n\n\n\n\n\nif tf>0:\n print('Yes')\nelse:\n print('No')\n", "code2": "dice_1 = input().split()\ndice_2 = input().split()\n\nrolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\norders = [' ', 'N', 'W', 'E', 'S', 'NN']\ntf = 0\nfor order in orders:\n copy_2 = dice_2\n for d in order:\n roll = rolls[d]\n copy_2 = [copy_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n\n\n\n\n\n\nif tf>0:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545276825", "date2": "1545279232", "bleu_score": "0.960777073189956", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["dice_1 = input().split() # (0): dice_1=['1', '2', '3', '4', '5', '6']\ndice_2 = input().split() # (1): dice_2=['6', '2', '4', '3', '5', '1']\n\nrolls = {' ':[0, 1, 2, 3, 4, 5], # (2): NO CHANGE (7): rolls={' ': [0, 1, 2, 3, 4, 5], 'W': [2, 1, 5, 0, 4, 3], 'N': [1, 5, 2, 3, 0, 4], 'E': [3, 1, 0, 5, 4, 2], 'S': [4, 0, 2, 3, 5, 1]}\n 'W':[2, 1, 5, 0, 4, 3], # (3): NO CHANGE\n 'N':[1, 5, 2, 3, 0, 4], # (4): NO CHANGE\n 'E':[3, 1, 0, 5, 4, 2], # (5): NO CHANGE\n 'S':[4, 0, 2, 3, 5, 1] # (6): NO CHANGE\n }\norders = [' ', 'N', 'W', 'E', 'S', 'SS'] # (8): orders=[' ', 'N', 'W', 'E', 'S', 'SS']\ntf = 0 # (9): tf=0\nfor order in orders: # (10): order= (20): order=N ... (73): NO CHANGE\n for d in order: # (11): d= (14): NO CHANGE ... (67): NO CHANGE\n roll = rolls[d] # (12): roll=[0, 1, 2, 3, 4, 5] (22): roll=[1, 5, 2, 3, 0, 4] ... (65): NO CHANGE\n copy_2 = [dice_2[i] for i in roll] # (13): copy_2=['6', '2', '4', '3', '5', '1'] (23): copy_2=['2', '1', '4', '3', '6', '5'] ... (66): NO CHANGE\n \n l = [1, 2, 4, 3] # (15): l=[1, 2, 4, 3] (25): NO CHANGE ... (68): NO CHANGE\n a0 = copy_2[0] == dice_1[0] # (16): a0=False (26): NO CHANGE ... (69): NO CHANGE\n a1 = copy_2[5] == dice_1[5] # (17): a1=False (27): NO CHANGE ... (70): NO CHANGE\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2) # (18): a2=False (28): NO CHANGE ... (71): NO CHANGE\n if a0 and a1 and a2: # (19): NO CHANGE (29): NO CHANGE ... (72): NO CHANGE\n tf += 1\n\n\n\n\n\nif tf>0: # (74): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " dice_1 = input().split()\n dice_2 = input().split()\n \n rolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\n-orders = [' ', 'N', 'W', 'E', 'S', 'SS']\n+orders = [' ', 'N', 'W', 'E', 'S', 'NN']\n tf = 0\n for order in orders:\n+ copy_2 = dice_2\n for d in order:\n roll = rolls[d]\n- copy_2 = [dice_2[i] for i in roll]\n+ copy_2 = [copy_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n \n \n \n \n \n+\n if tf>0:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " dice_1 = input().split()\n dice_2 = input().split()\n \n rolls = {' ':[0, 1, 2, 3, 4, 5], \n 'W':[2, 1, 5, 0, 4, 3], \n 'N':[1, 5, 2, 3, 0, 4], \n 'E':[3, 1, 0, 5, 4, 2], \n 'S':[4, 0, 2, 3, 5, 1]\n }\n-orders = [' ', 'N', 'W', 'E', 'S', 'SS']\n tf = 0\n for order in orders:\n for d in order:\n roll = rolls[d]\n- copy_2 = [dice_2[i] for i in roll]\n \n l = [1, 2, 4, 3]\n a0 = copy_2[0] == dice_1[0]\n a1 = copy_2[5] == dice_1[5]\n a2 = ' '.join([copy_2[s]for s in l]) in ' '.join([dice_1[s]for s in l] * 2)\n if a0 and a1 and a2:\n tf += 1\n \n \n \n \n \n if tf>0:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 32 }, { "user_id": "u869301406", "problem_id": "p02385", "submission1_id": "s454944635", "submission2_id": "s853172522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Dice(object):\n \n def __init__(self, d):\n\n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n\n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n\n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \nclass DiceChecker(object):\n\n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n\n \n \n \n \n \n \n print(self.dice1.rows)\n print(self.dice1.cols)\n is_same = False\n for _ in range(4):\n for _ in range(4):\n is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n self.__rot(self.dice2)\n is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n \n if is_same_element or is_rot_same: \n is_same = True\n break\n self.dice2.move_next_cols()\n \n print(self.dice2.rows)\n\n else: \n self.dice2.move_next_rows()\n continue\n break\n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n def __find_num(self, x, dice):\n i = 0\n while x != dice.rows[0]:\n dice.move_next_rows()\n if i > 3:\n dice.move_next_cols()\n i = 0\n i+=1\n \n def __rot(self, dice):\n temp = dice.rows[1]\n dice.rows[1] = dice.rows[3]\n dice.rows[3] = temp\n\n temp = dice.cols[1]\n dice.cols[1] = dice.cols[3]\n dice.cols[3] = temp\n\n \nd1 = list(map(int, input().split(\" \")))\nd2 = list(map(int, input().split(\" \")))\ndice1 = Dice(d1)\ndice2 = Dice(d2)\n\ndice_checker = DiceChecker(dice1, dice2)\ndice_checker.check_same_dice()\n\n", "code2": "class Dice(object):\n \n def __init__(self, d):\n\n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n\n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n\n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \nclass DiceChecker(object):\n\n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n\n is_same = False\n for _ in range(4):\n for _ in range(4):\n for _ in range(4):\n is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n if is_same_element: \n is_same = True\n self.__rot(self.dice2)\n self.dice2.move_next_rows()\n self.dice2.move_next_cols()\n \n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n def __rot(self, dice):\n temp = dice.rows[1]\n dice.rows[1] = dice.cols[3]\n dice.cols[3] = dice.rows[3]\n dice.rows[3] = dice.cols[1]\n dice.cols[1] = temp\n\n \nd1 = list(map(int, input().split(\" \")))\nd2 = list(map(int, input().split(\" \")))\ndice1 = Dice(d1)\ndice2 = Dice(d2)\n\ndice_checker = DiceChecker(dice1, dice2)\ndice_checker.check_same_dice()\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1530961999", "date2": "1530964904", "bleu_score": "0.737176581764488", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2 -2 0 485 1\n3 0 4 0 9 -1\n", "actual_output": "[-1, 485, 1, 2]\n[-1, -2, 1, 0]\n[0, 0, 4, 9]\n[3, 9, -1, 0]\n[0, 0, 4, 9]\n[3, 9, -1, 0]\n[0, 3, 4, -1]\n[9, -1, 0, 3]\n[0, 3, 4, -1]\n[9, -1, 0, 3]\n[0, 9, 4, 0]\n[-1, 0, 3, 9]\n[0, 9, 4, 0]\n[-1, 0, 3, 9]\n[0, -1, 4, 3]\n[0, 3, 9, -1]\n[0, -1, 4, 3]\n[0, 3, 9, -1]\nNo\n", "expected_output": "No\n\n", "anno_code": ["class Dice(object): # (0): Dice=\n \n def __init__(self, d):\n\n self.rows = [d[0], d[4], d[5], d[1]] # (5): NO CHANGE (8): NO CHANGE\n self.cols = [d[0], d[2], d[5], d[3]] # (6): Dice=, DiceChecker=, d1=[-1, 2, -2, 0, 485, 1], d2=[3, 0, 4, 0, 9, -1], dice1= (9): Dice=, DiceChecker=, d1=[-1, 2, -2, 0, 485, 1], d2=[3, 0, 4, 0, 9, -1], dice1=, dice2=\n \n def move_next_rows(self):\n temp = self.rows.pop(0) # (94): temp=3 (175): temp=9 ... (337): temp=0\n self.rows.append(temp) # (95): NO CHANGE (176): NO CHANGE ... (338): NO CHANGE\n self.__update(self.cols, self.rows) # (96): x=[3, 4, -1, 0], y=[9, -1, 0, 3] (177): x=[9, 4, 0, 0], y=[-1, 0, 3, 9] ... (339): x=[0, 4, 9, 0], y=[3, 9, -1, 0]\n\n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0) # (32): temp=3 (50): temp=0 ... (329): temp=0\n self.cols.append(temp) # (33): NO CHANGE (51): NO CHANGE ... (330): NO CHANGE\n self.__update(self.rows, self.cols) # (34): x=[3, 0, -1, 9], y=[0, -1, 4, 3] (52): x=[0, 9, 4, 0], y=[3, 4, -1, 0] ... (331): x=[0, 3, 4, -1], y=[0, 4, 9, 0]\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n\n def __update(self, x, y):\n x[0] = y[0] # (35): x=[0, 0, -1, 9] (53): x=[3, 9, 4, 0] ... (340): x=[3, 4, 9, 0]\n x[2] = y[2] # (36): self=, is_same=False, _=0, is_same_element=False, is_rot_same=False (54): self=, is_same=False, _=1, is_same_element=False, is_rot_same=False ... (341): self=, is_same=False, _=3, is_same_element=False, is_rot_same=False\n \nclass DiceChecker(object): # (1): DiceChecker=\n\n def __init__(self, dice1, dice2):\n self.dice1 = dice1 # (11): NO CHANGE\n self.dice2 = dice2 # (12): NO CHANGE\n self.dice1_top = self.dice1.rows[0] # (13): NO CHANGE\n self.dice1_front = self.dice1.rows[3] # (14): Dice=, DiceChecker=, d1=[-1, 2, -2, 0, 485, 1], d2=[3, 0, 4, 0, 9, -1], dice_checker=\n \n def check_same_dice(self):\n\n \n \n \n \n \n \n print(self.dice1.rows) # (16): NO CHANGE\n print(self.dice1.cols) # (17): NO CHANGE\n is_same = False # (18): is_same=False\n for _ in range(4): # (19): _=0 (100): _=1 ... (343): NO CHANGE\n for _ in range(4): # (20): NO CHANGE (38): _=1 ... (335): NO CHANGE\n is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols # (21): is_same_element=False (39): NO CHANGE ... (318): NO CHANGE\n self.__rot(self.dice2) # (22): dice= (40): dice= ... (319): dice=\n is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols # (29): is_rot_same=False (47): NO CHANGE ... (326): NO CHANGE\n \n if is_same_element or is_rot_same: # (30): NO CHANGE (48): NO CHANGE ... (327): NO CHANGE\n is_same = True\n break\n self.dice2.move_next_cols() # (31): self= (49): self= ... (328): self=\n \n print(self.dice2.rows) # (37): NO CHANGE (55): NO CHANGE ... (334): NO CHANGE\n\n else: \n self.dice2.move_next_rows() # (93): self= (174): self= ... (336): self=\n continue # (99): NO CHANGE (180): NO CHANGE ... (342): NO CHANGE\n break\n if is_same: # (344): NO CHANGE\n print(\"Yes\")\n else:\n print(\"No\")\n \n def __find_num(self, x, dice):\n i = 0\n while x != dice.rows[0]:\n dice.move_next_rows()\n if i > 3:\n dice.move_next_cols()\n i = 0\n i+=1\n \n def __rot(self, dice):\n temp = dice.rows[1] # (23): temp=9 (41): temp=0 ... (320): temp=-1\n dice.rows[1] = dice.rows[3] # (24): NO CHANGE (42): NO CHANGE ... (321): NO CHANGE\n dice.rows[3] = temp # (25): NO CHANGE (43): NO CHANGE ... (322): NO CHANGE\n\n temp = dice.cols[1] # (26): temp=4 (44): temp=-1 ... (323): temp=9\n dice.cols[1] = dice.cols[3] # (27): NO CHANGE (45): NO CHANGE ... (324): NO CHANGE\n dice.cols[3] = temp # (28): is_same=False, _=0, is_same_element=False (46): is_same=False, _=1, is_same_element=False, is_rot_same=False ... (325): is_same=False, _=3, is_same_element=False, is_rot_same=False\n\n \nd1 = list(map(int, input().split(\" \"))) # (2): d1=[-1, 2, -2, 0, 485, 1]\nd2 = list(map(int, input().split(\" \"))) # (3): d2=[3, 0, 4, 0, 9, -1]\ndice1 = Dice(d1) # (4): self=, d=[-1, 2, -2, 0, 485, 1]\ndice2 = Dice(d2) # (7): self=, d=[3, 0, 4, 0, 9, -1]\n\ndice_checker = DiceChecker(dice1, dice2) # (10): self=\ndice_checker.check_same_dice() # (15): self=\n\n"], "anno_status": [false], "diff_content": " class Dice(object):\n \n def __init__(self, d):\n \n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n \n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n \n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \n class DiceChecker(object):\n \n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n \n- \n- \n- \n- \n- \n- \n- print(self.dice1.rows)\n- print(self.dice1.cols)\n is_same = False\n for _ in range(4):\n for _ in range(4):\n- is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- self.__rot(self.dice2)\n- is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- \n- if is_same_element or is_rot_same: \n- is_same = True\n- break\n- self.dice2.move_next_cols()\n- \n- print(self.dice2.rows)\n-\n- else: \n+ for _ in range(4):\n+ is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n+ if is_same_element: \n+ is_same = True\n+ self.__rot(self.dice2)\n self.dice2.move_next_rows()\n- continue\n- break\n+ self.dice2.move_next_cols()\n+ \n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n- def __find_num(self, x, dice):\n- i = 0\n- while x != dice.rows[0]:\n- dice.move_next_rows()\n- if i > 3:\n- dice.move_next_cols()\n- i = 0\n- i+=1\n- \n def __rot(self, dice):\n temp = dice.rows[1]\n- dice.rows[1] = dice.rows[3]\n- dice.rows[3] = temp\n-\n- temp = dice.cols[1]\n- dice.cols[1] = dice.cols[3]\n- dice.cols[3] = temp\n+ dice.rows[1] = dice.cols[3]\n+ dice.cols[3] = dice.rows[3]\n+ dice.rows[3] = dice.cols[1]\n+ dice.cols[1] = temp\n \n \n d1 = list(map(int, input().split(\" \")))\n d2 = list(map(int, input().split(\" \")))\n dice1 = Dice(d1)\n dice2 = Dice(d2)\n \n dice_checker = DiceChecker(dice1, dice2)\n dice_checker.check_same_dice()\n \n \n", "FL_content": " class Dice(object):\n \n def __init__(self, d):\n \n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n \n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n \n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \n class DiceChecker(object):\n \n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n \n- \n- \n- \n- \n- \n- \n- print(self.dice1.rows)\n- print(self.dice1.cols)\n is_same = False\n for _ in range(4):\n for _ in range(4):\n- is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- self.__rot(self.dice2)\n- is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- \n- if is_same_element or is_rot_same: \n- is_same = True\n- break\n- self.dice2.move_next_cols()\n- \n- print(self.dice2.rows)\n-\n- else: \n self.dice2.move_next_rows()\n- continue\n- break\n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n- def __find_num(self, x, dice):\n- i = 0\n- while x != dice.rows[0]:\n- dice.move_next_rows()\n- if i > 3:\n- dice.move_next_cols()\n- i = 0\n- i+=1\n- \n def __rot(self, dice):\n temp = dice.rows[1]\n- dice.rows[1] = dice.rows[3]\n- dice.rows[3] = temp\n-\n- temp = dice.cols[1]\n- dice.cols[1] = dice.cols[3]\n- dice.cols[3] = temp\n \n \n d1 = list(map(int, input().split(\" \")))\n d2 = list(map(int, input().split(\" \")))\n dice1 = Dice(d1)\n dice2 = Dice(d2)\n \n dice_checker = DiceChecker(dice1, dice2)\n dice_checker.check_same_dice()\n \n \n", "added_lines": 11, "removed_lines": 37, "code1_lines": 100 }, { "user_id": "u175111751", "problem_id": "p02385", "submission1_id": "s517739076", "submission2_id": "s073049877", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nclass Dice:\n def __init__(self, f):\n self.f = f[:]\n\n def roll(self, s):\n for f in s:\n n = self.f[:]\n if f == 'E':\n t = n[0]\n n[0] = n[3]\n n[3] = n[5]\n n[5] = n[2]\n n[2] = t\n elif f == 'W':\n t = n[0]\n n[0] = n[2]\n n[2] = n[5]\n n[5] = n[3]\n n[3] = t\n elif f == 'N':\n t = n[0]\n n[0] = n[1]\n n[1] = n[5]\n n[5] = n[4]\n n[4] = t\n else:\n t = n[0]\n n[0] = n[4]\n n[4] = n[5]\n n[5] = n[1]\n n[1] = t\n self.f = n\n\n def to_top(self, index):\n if index == 1:\n self.roll('N')\n elif index == 2:\n self.roll('W')\n elif index == 3:\n self.roll('E')\n elif index == 4:\n self.roll('S')\n elif index == 5:\n self.roll('NN')\n return self\n\n def side_roll(self):\n t = self.f[1]\n self.f[1] = self.f[2]\n self.f[2] = self.f[4]\n self.f[4] = self.f[3]\n self.f[3] = t\n return self\n\n def all_face(self):\n faces = []\n for i in range(0,6):\n t = Dice(self.f[:])\n faces.append(t.to_top(i).f)\n for j in range(3):\n faces.append(t.side_roll().f)\n return faces\n\nd1, d2 = (Dice(list(input().split())) for _ in range(2))\nfs = d1.all_face()\nprint('Yes' if d2.f in fs else 'No')", "code2": "import sys\nclass Dice:\n def __init__(self, f):\n self.f = f[:]\n\n def roll(self, s):\n for f in s:\n n = self.f[:]\n if f == 'E':\n t = n[0]\n n[0] = n[3]\n n[3] = n[5]\n n[5] = n[2]\n n[2] = t\n elif f == 'W':\n t = n[0]\n n[0] = n[2]\n n[2] = n[5]\n n[5] = n[3]\n n[3] = t\n elif f == 'N':\n t = n[0]\n n[0] = n[1]\n n[1] = n[5]\n n[5] = n[4]\n n[4] = t\n else:\n t = n[0]\n n[0] = n[4]\n n[4] = n[5]\n n[5] = n[1]\n n[1] = t\n self.f = n\n\n def to_top(self, index):\n if index == 1:\n self.roll('N')\n elif index == 2:\n self.roll('W')\n elif index == 3:\n self.roll('E')\n elif index == 4:\n self.roll('S')\n elif index == 5:\n self.roll('NN')\n return self\n\n def side_roll(self):\n t = self.f[1]\n self.f[1] = self.f[2]\n self.f[2] = self.f[4]\n self.f[4] = self.f[3]\n self.f[3] = t\n return self\n\n def all_face(self):\n faces = []\n for i in range(0,6):\n t = Dice(self.f[:])\n faces.append(t.to_top(i).f[:])\n for j in range(3):\n faces.append(t.side_roll().f[:])\n return faces\n\nd1, d2 = (Dice(list(input().split())) for _ in range(2))\nfs = d1.all_face()\nprint('Yes' if d2.f in fs else 'No')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1477805167", "date2": "1477805338", "bleu_score": "0.9945386388412597", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["import sys\nclass Dice: # (0): Dice=\n def __init__(self, f):\n self.f = f[:] # (2): self=, f=['6', '2', '4', '3', '5', '1'] (3): sys=, Dice=, d1=, d2= ... (202): self=, faces, i=5, t=, j=2\n\n def roll(self, s):\n for f in s: # (43): f=N (54): self=, faces=[['1', '4', '2', '5', '3', '6'], ['1', '4', '2', '5', '3', '6'], ['1', '4', '2', '5', '3', '6'], ['1', '4', '2', '5', '3', '6'], ['2', '6', '3', '4', '1', '5']], i=1, t=, j=2 ... (232): self=, faces, i=5, t=, j=2\n n = self.f[:] # (44): n=['1', '2', '3', '4', '5', '6'] (85): n=['1', '2', '3', '4', '5', '6'] ... (222): NO CHANGE\n if f == 'E': # (45): NO CHANGE (86): NO CHANGE ... (223): NO CHANGE\n t = n[0] # (128): t=1\n n[0] = n[3] # (129): n=['4', '2', '3', '4', '5', '6']\n n[3] = n[5] # (130): n=['4', '2', '3', '6', '5', '6']\n n[5] = n[2] # (131): n=['4', '2', '3', '6', '5', '3']\n n[2] = t # (132): n=['4', '2', '1', '6', '5', '3']\n elif f == 'W': # (46): NO CHANGE (87): NO CHANGE ... (224): NO CHANGE\n t = n[0] # (88): t=1\n n[0] = n[2] # (89): n=['3', '2', '3', '4', '5', '6']\n n[2] = n[5] # (90): n=['3', '2', '6', '4', '5', '6']\n n[5] = n[3] # (91): n=['3', '2', '6', '4', '5', '4']\n n[3] = t # (92): n=['3', '2', '6', '1', '5', '4']\n elif f == 'N': # (47): NO CHANGE (170): NO CHANGE ... (225): NO CHANGE\n t = n[0] # (48): t=1 (215): t=1 (226): t=2\n n[0] = n[1] # (49): n=['2', '2', '3', '4', '5', '6'] (216): n=['2', '2', '3', '4', '5', '6'] (227): n=['6', '6', '3', '4', '1', '5']\n n[1] = n[5] # (50): n=['2', '6', '3', '4', '5', '6'] (217): n=['2', '6', '3', '4', '5', '6'] (228): n=['6', '5', '3', '4', '1', '5']\n n[5] = n[4] # (51): n=['2', '6', '3', '4', '5', '5'] (218): n=['2', '6', '3', '4', '5', '5'] (229): n=['6', '5', '3', '4', '1', '1']\n n[4] = t # (52): n=['2', '6', '3', '4', '1', '5'] (219): n=['2', '6', '3', '4', '1', '5'] (230): n=['6', '5', '3', '4', '2', '1']\n else:\n t = n[0] # (171): t=1\n n[0] = n[4] # (172): n=['5', '2', '3', '4', '5', '6']\n n[4] = n[5] # (173): n=['5', '2', '3', '4', '6', '6']\n n[5] = n[1] # (174): n=['5', '2', '3', '4', '6', '2']\n n[1] = t # (175): n=['5', '1', '3', '4', '6', '2']\n self.f = n # (53): NO CHANGE (93): NO CHANGE ... (231): NO CHANGE\n\n def to_top(self, index):\n if index == 1: # (10): NO CHANGE (41): NO CHANGE ... (204): NO CHANGE\n self.roll('N') # (42): s=N\n elif index == 2: # (11): NO CHANGE (82): NO CHANGE ... (205): NO CHANGE\n self.roll('W') # (83): s=W\n elif index == 3: # (12): NO CHANGE (123): NO CHANGE ... (206): NO CHANGE\n self.roll('E') # (124): s=E\n elif index == 4: # (13): NO CHANGE (164): NO CHANGE (207): NO CHANGE\n self.roll('S') # (165): s=S\n elif index == 5: # (14): self=, faces, i=0, t= (208): NO CHANGE\n self.roll('NN') # (209): s=NN\n return self\n\n def side_roll(self):\n t = self.f[1] # (17): t=2 (24): t=3 ... (249): t=2\n self.f[1] = self.f[2] # (18): NO CHANGE (25): NO CHANGE ... (250): NO CHANGE\n self.f[2] = self.f[4] # (19): NO CHANGE (26): NO CHANGE ... (251): NO CHANGE\n self.f[4] = self.f[3] # (20): NO CHANGE (27): NO CHANGE ... (252): NO CHANGE\n self.f[3] = t # (21): self=, faces=[['1', '3', '5', '2', '4', '6'], ['1', '3', '5', '2', '4', '6']], i=0, t=, j=0 (28): self=, faces=[['1', '5', '4', '3', '2', '6'], ['1', '5', '4', '3', '2', '6'], ['1', '5', '4', '3', '2', '6']], i=0, t=, j=1 ... (253): self=, faces, i=5, t=, j=2\n return self\n\n def all_face(self):\n faces = [] # (5): faces=[]\n for i in range(0,6): # (6): i=0 (37): i=1 ... (255): sys=, Dice=, d1=, d2=, fs\n t = Dice(self.f[:]) # (7): self=, f=['1', '2', '3', '4', '5', '6'] (38): self=, f=['1', '2', '3', '4', '5', '6'] ... (201): self=, f=['1', '2', '3', '4', '5', '6']\n faces.append(t.to_top(i).f) # (9): self=, index=0 (40): self=, index=1 ... (203): self=, index=5\n for j in range(3): # (15): j=0 (22): j=1 ... (254): NO CHANGE\n faces.append(t.side_roll().f) # (16): self= (23): self= ... (248): self=\n return faces\n\nd1, d2 = (Dice(list(input().split())) for _ in range(2)) # (1): self=, f=['1', '2', '3', '4', '5', '6']\nfs = d1.all_face() # (4): self=\nprint('Yes' if d2.f in fs else 'No')"], "anno_status": [false], "diff_content": " import sys\n class Dice:\n def __init__(self, f):\n self.f = f[:]\n \n def roll(self, s):\n for f in s:\n n = self.f[:]\n if f == 'E':\n t = n[0]\n n[0] = n[3]\n n[3] = n[5]\n n[5] = n[2]\n n[2] = t\n elif f == 'W':\n t = n[0]\n n[0] = n[2]\n n[2] = n[5]\n n[5] = n[3]\n n[3] = t\n elif f == 'N':\n t = n[0]\n n[0] = n[1]\n n[1] = n[5]\n n[5] = n[4]\n n[4] = t\n else:\n t = n[0]\n n[0] = n[4]\n n[4] = n[5]\n n[5] = n[1]\n n[1] = t\n self.f = n\n \n def to_top(self, index):\n if index == 1:\n self.roll('N')\n elif index == 2:\n self.roll('W')\n elif index == 3:\n self.roll('E')\n elif index == 4:\n self.roll('S')\n elif index == 5:\n self.roll('NN')\n return self\n \n def side_roll(self):\n t = self.f[1]\n self.f[1] = self.f[2]\n self.f[2] = self.f[4]\n self.f[4] = self.f[3]\n self.f[3] = t\n return self\n \n def all_face(self):\n faces = []\n for i in range(0,6):\n t = Dice(self.f[:])\n- faces.append(t.to_top(i).f)\n+ faces.append(t.to_top(i).f[:])\n for j in range(3):\n- faces.append(t.side_roll().f)\n+ faces.append(t.side_roll().f[:])\n return faces\n \n d1, d2 = (Dice(list(input().split())) for _ in range(2))\n fs = d1.all_face()\n print('Yes' if d2.f in fs else 'No')\n", "FL_content": " import sys\n class Dice:\n def __init__(self, f):\n self.f = f[:]\n \n def roll(self, s):\n for f in s:\n n = self.f[:]\n if f == 'E':\n t = n[0]\n n[0] = n[3]\n n[3] = n[5]\n n[5] = n[2]\n n[2] = t\n elif f == 'W':\n t = n[0]\n n[0] = n[2]\n n[2] = n[5]\n n[5] = n[3]\n n[3] = t\n elif f == 'N':\n t = n[0]\n n[0] = n[1]\n n[1] = n[5]\n n[5] = n[4]\n n[4] = t\n else:\n t = n[0]\n n[0] = n[4]\n n[4] = n[5]\n n[5] = n[1]\n n[1] = t\n self.f = n\n \n def to_top(self, index):\n if index == 1:\n self.roll('N')\n elif index == 2:\n self.roll('W')\n elif index == 3:\n self.roll('E')\n elif index == 4:\n self.roll('S')\n elif index == 5:\n self.roll('NN')\n return self\n \n def side_roll(self):\n t = self.f[1]\n self.f[1] = self.f[2]\n self.f[2] = self.f[4]\n self.f[4] = self.f[3]\n self.f[3] = t\n return self\n \n def all_face(self):\n faces = []\n for i in range(0,6):\n t = Dice(self.f[:])\n- faces.append(t.to_top(i).f)\n for j in range(3):\n- faces.append(t.side_roll().f)\n return faces\n \n d1, d2 = (Dice(list(input().split())) for _ in range(2))\n fs = d1.all_face()\n print('Yes' if d2.f in fs else 'No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 67 }, { "user_id": "u949338836", "problem_id": "p02385", "submission1_id": "s019287191", "submission2_id": "s455636091", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nclass Dice:\n def __init__(self, ary):\n self.top, self.south, self.east, self.west, self.north, self.bottom = ary\n\n def roll_n(self):\n self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom\n\n def roll_e(self):\n self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom\n\n def twist(self):\n self.north, self.east, self.south, self.west = self.west, self.north, self.east, self.south\n\n def isEqual(self, dice):\n if self.top == dice.top and self.south == dice.south and self.east == dice.east and self.west == dice.west and self.north == dice.north and self.bottom == dice.bottom:\n return True\n else:\n return False\n\ndice1 = Dice(map(int,input().split()))\ndice2 = Dice(map(int,input().split()))\n\nflag = False\n\nfor i in range(6):\n if i%2 == 0:\n dice1.roll_n()\n else:\n dice1.roll_e()\n\n for j in range(4):\n if dice1.isEqual(dice2):\n flag = True\n else:\n dice1.twist\n\n if flag:\n break\n\nif flag:\n print('Yes')\nelse:\n print('No')", "code2": "\n\n\nclass Dice:\n def __init__(self, ary):\n self.top, self.south, self.east, self.west, self.north, self.bottom = ary\n\n def roll_n(self):\n self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom\n\n def roll_e(self):\n self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom\n\n def twist(self):\n self.north, self.east, self.south, self.west = self.west, self.north, self.east, self.south\n\n def isEqual(self, dice):\n if self.top == dice.top and self.south == dice.south and self.east == dice.east and self.west == dice.west and self.north == dice.north and self.bottom == dice.bottom:\n return True\n else:\n return False\n\ndice1 = Dice(map(int,input().split()))\ndice2 = Dice(map(int,input().split()))\n\nflag = False\n\nfor i in range(6):\n if i % 2 == 0:\n dice1.roll_n()\n else:\n dice1.roll_e()\n\n for j in range(4):\n if dice1.isEqual(dice2):\n flag = True\n break\n else:\n dice1.twist()\n\n if flag:\n break\n\nif flag:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1433221887", "date2": "1433252928", "bleu_score": "0.977882797008315", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["\n\n\nclass Dice: # (0): Dice=\n def __init__(self, ary):\n self.top, self.south, self.east, self.west, self.north, self.bottom = ary # (2): Dice=, dice1= (4): Dice=, dice1=, dice2=\n\n def roll_n(self):\n self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom # (9): Dice=, dice1=, dice2=, flag=False, i=0 (53): Dice=, dice1=, dice2=, flag=False, i=2, j=3 (97): Dice=, dice1=, dice2=, flag=False, i=4, j=3\n\n def roll_e(self):\n self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom # (31): Dice=, dice1=, dice2=, flag=False, i=1, j=3 (75): Dice=, dice1=, dice2=, flag=False, i=3, j=3 (119): Dice=, dice1=, dice2=, flag=False, i=5, j=3\n\n def twist(self):\n self.north, self.east, self.south, self.west = self.west, self.north, self.east, self.south\n\n def isEqual(self, dice):\n if self.top == dice.top and self.south == dice.south and self.east == dice.east and self.west == dice.west and self.north == dice.north and self.bottom == dice.bottom: # (12): Dice=, dice1=, dice2=, flag=False, i=0, j=0 (16): Dice=, dice1=, dice2=, flag=False, i=0, j=1 ... (134): Dice=, dice1=, dice2=, flag=False, i=5, j=3\n return True\n else:\n return False\n\ndice1 = Dice(map(int,input().split())) # (1): self=, ary=\ndice2 = Dice(map(int,input().split())) # (3): self=, ary=\n\nflag = False # (5): flag=False\n\nfor i in range(6): # (6): i=0 (28): i=1 ... (138): NO CHANGE\n if i%2 == 0: # (7): NO CHANGE (29): NO CHANGE ... (117): NO CHANGE\n dice1.roll_n() # (8): self= (52): self= (96): self=\n else:\n dice1.roll_e() # (30): self= (74): self= (118): self=\n\n for j in range(4): # (10): j=0 (14): j=1 ... (136): NO CHANGE\n if dice1.isEqual(dice2): # (11): self=, dice= (15): self=, dice= ... (133): self=, dice=\n flag = True\n else:\n dice1.twist # (13): NO CHANGE (17): NO CHANGE ... (135): NO CHANGE\n\n if flag: # (27): NO CHANGE (49): NO CHANGE ... (137): NO CHANGE\n break\n\nif flag: # (139): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [false], "diff_content": " \n \n \n class Dice:\n def __init__(self, ary):\n self.top, self.south, self.east, self.west, self.north, self.bottom = ary\n \n def roll_n(self):\n self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom\n \n def roll_e(self):\n self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom\n \n def twist(self):\n self.north, self.east, self.south, self.west = self.west, self.north, self.east, self.south\n \n def isEqual(self, dice):\n if self.top == dice.top and self.south == dice.south and self.east == dice.east and self.west == dice.west and self.north == dice.north and self.bottom == dice.bottom:\n return True\n else:\n return False\n \n dice1 = Dice(map(int,input().split()))\n dice2 = Dice(map(int,input().split()))\n \n flag = False\n \n for i in range(6):\n- if i%2 == 0:\n+ if i % 2 == 0:\n dice1.roll_n()\n else:\n dice1.roll_e()\n \n for j in range(4):\n if dice1.isEqual(dice2):\n flag = True\n+ break\n else:\n- dice1.twist\n+ dice1.twist()\n \n if flag:\n break\n \n if flag:\n print('Yes')\n else:\n print('No')\n", "FL_content": " \n \n \n class Dice:\n def __init__(self, ary):\n self.top, self.south, self.east, self.west, self.north, self.bottom = ary\n \n def roll_n(self):\n self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom\n \n def roll_e(self):\n self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom\n \n def twist(self):\n self.north, self.east, self.south, self.west = self.west, self.north, self.east, self.south\n \n def isEqual(self, dice):\n if self.top == dice.top and self.south == dice.south and self.east == dice.east and self.west == dice.west and self.north == dice.north and self.bottom == dice.bottom:\n return True\n else:\n return False\n \n dice1 = Dice(map(int,input().split()))\n dice2 = Dice(map(int,input().split()))\n \n flag = False\n \n for i in range(6):\n- if i%2 == 0:\n dice1.roll_n()\n else:\n dice1.roll_e()\n \n for j in range(4):\n if dice1.isEqual(dice2):\n flag = True\n else:\n- dice1.twist\n \n if flag:\n break\n \n if flag:\n print('Yes')\n else:\n print('No')\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 46 }, { "user_id": "u869301406", "problem_id": "p02385", "submission1_id": "s023054269", "submission2_id": "s853172522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Dice(object):\n \n def __init__(self, d):\n\n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n\n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n\n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \nclass DiceChecker(object):\n\n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n\n \n \n \n \n \n \n is_same = False\n for _ in range(4):\n for _ in range(4):\n is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n self.__rot(self.dice2)\n is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n \n if is_same_element or is_rot_same: \n is_same = True\n break\n self.dice2.move_next_cols()\n \n print(self.dice2.rows)\n\n else: \n self.dice2.move_next_rows()\n continue\n break\n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n def __find_num(self, x, dice):\n i = 0\n while x != dice.rows[0]:\n dice.move_next_rows()\n if i > 3:\n dice.move_next_cols()\n i = 0\n i+=1\n \n def __rot(self, dice):\n temp = dice.rows[1]\n dice.rows[1] = dice.rows[3]\n dice.rows[3] = temp\n\n temp = dice.cols[1]\n dice.cols[1] = dice.cols[3]\n dice.cols[3] = temp\n\n \nd1 = list(map(int, input().split(\" \")))\nd2 = list(map(int, input().split(\" \")))\ndice1 = Dice(d1)\ndice2 = Dice(d2)\n\ndice_checker = DiceChecker(dice1, dice2)\ndice_checker.check_same_dice()\n\n", "code2": "class Dice(object):\n \n def __init__(self, d):\n\n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n\n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n\n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \nclass DiceChecker(object):\n\n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n\n is_same = False\n for _ in range(4):\n for _ in range(4):\n for _ in range(4):\n is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n if is_same_element: \n is_same = True\n self.__rot(self.dice2)\n self.dice2.move_next_rows()\n self.dice2.move_next_cols()\n \n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n def __rot(self, dice):\n temp = dice.rows[1]\n dice.rows[1] = dice.cols[3]\n dice.cols[3] = dice.rows[3]\n dice.rows[3] = dice.cols[1]\n dice.cols[1] = temp\n\n \nd1 = list(map(int, input().split(\" \")))\nd2 = list(map(int, input().split(\" \")))\ndice1 = Dice(d1)\ndice2 = Dice(d2)\n\ndice_checker = DiceChecker(dice1, dice2)\ndice_checker.check_same_dice()\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1530962047", "date2": "1530964904", "bleu_score": "0.7609420794686372", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 0 0 0 50 -1\n5 0 0 0 9 4\n", "actual_output": "[0, 0, 0, 9]\n[5, 9, 4, 0]\n[0, 0, 0, 9]\n[5, 9, 4, 0]\n[0, 5, 0, 4]\n[9, 4, 0, 5]\n[0, 5, 0, 4]\n[9, 4, 0, 5]\n[0, 9, 0, 0]\n[4, 0, 5, 9]\n[0, 9, 0, 0]\n[4, 0, 5, 9]\n[0, 4, 0, 5]\n[0, 5, 9, 4]\n[0, 4, 0, 5]\n[0, 5, 9, 4]\nNo\n", "expected_output": "No\n\n", "anno_code": ["class Dice(object): # (0): Dice=\n \n def __init__(self, d):\n\n self.rows = [d[0], d[4], d[5], d[1]] # (5): NO CHANGE (8): NO CHANGE\n self.cols = [d[0], d[2], d[5], d[3]] # (6): Dice=, DiceChecker=, d1=[2, 0, 0, 0, 50, -1], d2=[5, 0, 0, 0, 9, 4], dice1= (9): Dice=, DiceChecker=, d1=[2, 0, 0, 0, 50, -1], d2=[5, 0, 0, 0, 9, 4], dice1=, dice2=\n \n def move_next_rows(self):\n temp = self.rows.pop(0) # (92): temp=5 (173): temp=9 ... (335): temp=0\n self.rows.append(temp) # (93): NO CHANGE (174): NO CHANGE ... (336): NO CHANGE\n self.__update(self.cols, self.rows) # (94): x=[5, 0, 4, 0], y=[9, 4, 0, 5] (175): x=[9, 0, 0, 0], y=[4, 0, 5, 9] ... (337): x=[0, 0, 9, 0], y=[5, 9, 4, 0]\n\n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0) # (30): temp=5 (48): temp=0 ... (327): temp=0\n self.cols.append(temp) # (31): NO CHANGE (49): NO CHANGE ... (328): NO CHANGE\n self.__update(self.rows, self.cols) # (32): x=[5, 0, 4, 9], y=[0, 4, 0, 5] (50): x=[0, 9, 0, 0], y=[5, 0, 4, 0] ... (329): x=[0, 5, 0, 4], y=[0, 0, 9, 0]\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n\n def __update(self, x, y):\n x[0] = y[0] # (33): x=[0, 0, 4, 9] (51): x=[5, 9, 0, 0] ... (338): x=[5, 0, 9, 0]\n x[2] = y[2] # (34): self=, is_same=False, _=0, is_same_element=False, is_rot_same=False (52): self=, is_same=False, _=1, is_same_element=False, is_rot_same=False ... (339): self=, is_same=False, _=3, is_same_element=False, is_rot_same=False\n \nclass DiceChecker(object): # (1): DiceChecker=\n\n def __init__(self, dice1, dice2):\n self.dice1 = dice1 # (11): NO CHANGE\n self.dice2 = dice2 # (12): NO CHANGE\n self.dice1_top = self.dice1.rows[0] # (13): NO CHANGE\n self.dice1_front = self.dice1.rows[3] # (14): Dice=, DiceChecker=, d1=[2, 0, 0, 0, 50, -1], d2=[5, 0, 0, 0, 9, 4], dice_checker=\n \n def check_same_dice(self):\n\n \n \n \n \n \n \n is_same = False # (16): is_same=False\n for _ in range(4): # (17): _=0 (98): _=1 ... (341): NO CHANGE\n for _ in range(4): # (18): NO CHANGE (36): _=1 ... (333): NO CHANGE\n is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols # (19): is_same_element=False (37): NO CHANGE ... (316): NO CHANGE\n self.__rot(self.dice2) # (20): dice= (38): dice= ... (317): dice=\n is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols # (27): is_rot_same=False (45): NO CHANGE ... (324): NO CHANGE\n \n if is_same_element or is_rot_same: # (28): NO CHANGE (46): NO CHANGE ... (325): NO CHANGE\n is_same = True\n break\n self.dice2.move_next_cols() # (29): self= (47): self= ... (326): self=\n \n print(self.dice2.rows) # (35): NO CHANGE (53): NO CHANGE ... (332): NO CHANGE\n\n else: \n self.dice2.move_next_rows() # (91): self= (172): self= ... (334): self=\n continue # (97): NO CHANGE (178): NO CHANGE ... (340): NO CHANGE\n break\n if is_same: # (342): NO CHANGE\n print(\"Yes\")\n else:\n print(\"No\")\n \n def __find_num(self, x, dice):\n i = 0\n while x != dice.rows[0]:\n dice.move_next_rows()\n if i > 3:\n dice.move_next_cols()\n i = 0\n i+=1\n \n def __rot(self, dice):\n temp = dice.rows[1] # (21): temp=9 (39): temp=0 ... (318): temp=4\n dice.rows[1] = dice.rows[3] # (22): NO CHANGE (40): NO CHANGE ... (319): NO CHANGE\n dice.rows[3] = temp # (23): NO CHANGE (41): NO CHANGE ... (320): NO CHANGE\n\n temp = dice.cols[1] # (24): temp=0 (42): temp=4 ... (321): temp=9\n dice.cols[1] = dice.cols[3] # (25): NO CHANGE (43): NO CHANGE ... (322): NO CHANGE\n dice.cols[3] = temp # (26): is_same=False, _=0, is_same_element=False (44): is_same=False, _=1, is_same_element=False, is_rot_same=False ... (323): is_same=False, _=3, is_same_element=False, is_rot_same=False\n\n \nd1 = list(map(int, input().split(\" \"))) # (2): d1=[2, 0, 0, 0, 50, -1]\nd2 = list(map(int, input().split(\" \"))) # (3): d2=[5, 0, 0, 0, 9, 4]\ndice1 = Dice(d1) # (4): self=, d=[2, 0, 0, 0, 50, -1]\ndice2 = Dice(d2) # (7): self=, d=[5, 0, 0, 0, 9, 4]\n\ndice_checker = DiceChecker(dice1, dice2) # (10): self=\ndice_checker.check_same_dice() # (15): self=\n\n"], "anno_status": [false], "diff_content": " class Dice(object):\n \n def __init__(self, d):\n \n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n \n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n \n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \n class DiceChecker(object):\n \n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n \n- \n- \n- \n- \n- \n- \n is_same = False\n for _ in range(4):\n for _ in range(4):\n- is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- self.__rot(self.dice2)\n- is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- \n- if is_same_element or is_rot_same: \n- is_same = True\n- break\n- self.dice2.move_next_cols()\n- \n- print(self.dice2.rows)\n-\n- else: \n+ for _ in range(4):\n+ is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n+ if is_same_element: \n+ is_same = True\n+ self.__rot(self.dice2)\n self.dice2.move_next_rows()\n- continue\n- break\n+ self.dice2.move_next_cols()\n+ \n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n- def __find_num(self, x, dice):\n- i = 0\n- while x != dice.rows[0]:\n- dice.move_next_rows()\n- if i > 3:\n- dice.move_next_cols()\n- i = 0\n- i+=1\n- \n def __rot(self, dice):\n temp = dice.rows[1]\n- dice.rows[1] = dice.rows[3]\n- dice.rows[3] = temp\n-\n- temp = dice.cols[1]\n- dice.cols[1] = dice.cols[3]\n- dice.cols[3] = temp\n+ dice.rows[1] = dice.cols[3]\n+ dice.cols[3] = dice.rows[3]\n+ dice.rows[3] = dice.cols[1]\n+ dice.cols[1] = temp\n \n \n d1 = list(map(int, input().split(\" \")))\n d2 = list(map(int, input().split(\" \")))\n dice1 = Dice(d1)\n dice2 = Dice(d2)\n \n dice_checker = DiceChecker(dice1, dice2)\n dice_checker.check_same_dice()\n \n \n", "FL_content": " class Dice(object):\n \n def __init__(self, d):\n \n self.rows = [d[0], d[4], d[5], d[1]]\n self.cols = [d[0], d[2], d[5], d[3]]\n \n def move_next_rows(self):\n temp = self.rows.pop(0)\n self.rows.append(temp)\n self.__update(self.cols, self.rows)\n \n def move_prev_rows(self):\n temp = self.rows.pop(3)\n self.rows.insert(0, temp)\n self.__update(self.cols, self.rows)\n \n def move_next_cols(self):\n temp = self.cols.pop(0)\n self.cols.append(temp)\n self.__update(self.rows, self.cols)\n \n def move_prev_cols(self):\n temp = self.cols.pop(3)\n self.cols.insert(0, temp)\n self.__update(self.rows, self.cols)\n \n def __update(self, x, y):\n x[0] = y[0]\n x[2] = y[2]\n \n class DiceChecker(object):\n \n def __init__(self, dice1, dice2):\n self.dice1 = dice1\n self.dice2 = dice2\n self.dice1_top = self.dice1.rows[0]\n self.dice1_front = self.dice1.rows[3]\n \n def check_same_dice(self):\n \n- \n- \n- \n- \n- \n- \n is_same = False\n for _ in range(4):\n for _ in range(4):\n- is_same_element = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- self.__rot(self.dice2)\n- is_rot_same = self.dice1.rows == self.dice2.rows and self.dice1.cols == self.dice2.cols\n- \n- if is_same_element or is_rot_same: \n- is_same = True\n- break\n- self.dice2.move_next_cols()\n- \n- print(self.dice2.rows)\n-\n- else: \n self.dice2.move_next_rows()\n- continue\n- break\n if is_same:\n print(\"Yes\")\n else:\n print(\"No\")\n \n- def __find_num(self, x, dice):\n- i = 0\n- while x != dice.rows[0]:\n- dice.move_next_rows()\n- if i > 3:\n- dice.move_next_cols()\n- i = 0\n- i+=1\n- \n def __rot(self, dice):\n temp = dice.rows[1]\n- dice.rows[1] = dice.rows[3]\n- dice.rows[3] = temp\n-\n- temp = dice.cols[1]\n- dice.cols[1] = dice.cols[3]\n- dice.cols[3] = temp\n \n \n d1 = list(map(int, input().split(\" \")))\n d2 = list(map(int, input().split(\" \")))\n dice1 = Dice(d1)\n dice2 = Dice(d2)\n \n dice_checker = DiceChecker(dice1, dice2)\n dice_checker.check_same_dice()\n \n \n", "added_lines": 11, "removed_lines": 35, "code1_lines": 98 }, { "user_id": "u131984977", "problem_id": "p02385", "submission1_id": "s931017909", "submission2_id": "s482498602", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n for a in range(6):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n print(self.data, value.data)\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n\n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n\n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n\n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n\n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n\n\na = Dice(input().split())\nb = Dice(input().split())\nif a == b:\n print('Yes')\nelse:\n print('No')", "code2": "class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n for a in range(0,6,5):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n\n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n\n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n\n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n\n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n\n\na = Dice(input().split())\nb = Dice(input().split())\nif a == b:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1423795832", "date2": "1423795898", "bleu_score": "0.9791197107536167", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2 -1 0 403 0\n3 0 4 0 9 0\n", "actual_output": "['-1', '2', '-1', '0', '403', '0'] ['0', '3', '0', '4', '0', '9']\n['-1', '2', '-1', '0', '403', '0'] ['0', '4', '3', '0', '0', '9']\n['-1', '2', '-1', '0', '403', '0'] ['0', '0', '4', '0', '3', '9']\n['-1', '2', '-1', '0', '403', '0'] ['0', '0', '0', '3', '4', '9']\n['-1', '2', '-1', '0', '403', '0'] ['0', '0', '0', '4', '9', '3']\n['-1', '2', '-1', '0', '403', '0'] ['0', '4', '0', '9', '0', '3']\n['-1', '2', '-1', '0', '403', '0'] ['0', '9', '4', '0', '0', '3']\n['-1', '2', '-1', '0', '403', '0'] ['0', '0', '9', '0', '4', '3']\n['0', '2', '0', '-1', '403', '-1'] ['0', '3', '0', '4', '0', '9']\n['0', '2', '0', '-1', '403', '-1'] ['0', '4', '3', '0', '0', '9']\n['0', '2', '0', '-1', '403', '-1'] ['0', '0', '4', '0', '3', '9']\n['0', '2', '0', '-1', '403', '-1'] ['0', '0', '0', '3', '4', '9']\n['0', '2', '0', '-1', '403', '-1'] ['3', '9', '0', '4', '0', '0']\n['0', '2', '0', '-1', '403', '-1'] ['3', '4', '9', '0', '0', '0']\n['0', '2', '0', '-1', '403', '-1'] ['3', '0', '4', '0', '9', '0']\n['0', '2', '0', '-1', '403', '-1'] ['3', '0', '0', '9', '4', '0']\n['2', '-1', '0', '-1', '0', '403'] ['4', '9', '3', '0', '0', '0']\n['2', '-1', '0', '-1', '0', '403'] ['4', '0', '9', '0', '3', '0']\n['2', '-1', '0', '-1', '0', '403'] ['4', '0', '0', '3', '9', '0']\n['2', '-1', '0', '-1', '0', '403'] ['4', '3', '0', '9', '0', '0']\n['403', '-1', '-1', '0', '0', '2'] ['9', '0', '3', '0', '4', '0']\n['403', '-1', '-1', '0', '0', '2'] ['9', '0', '0', '4', '3', '0']\n['403', '-1', '-1', '0', '0', '2'] ['9', '4', '0', '3', '0', '0']\n['403', '-1', '-1', '0', '0', '2'] ['9', '3', '4', '0', '0', '0']\nNo\n", "expected_output": "No\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 221, in \n\n run_script(target_script, input_file)\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 191, in run_script\n\n exec(script_content, script_globals)\n\n File \"\", line 70, in \n\n File \"\", line 70, in \n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 73, in trace_lines\n\n if var not in last_locals or not np.array_equal(last_locals[var], value):\n\n File \"G:\\Anaconda\\Anaconda\\envs\\common\\lib\\site-packages\\numpy\\core\\numeric.py\", line 2439, in array_equal\n\n return bool(asarray(a1 == a2).all())\n\n File \"\", line 8, in __eq__\n\nAttributeError: 'int' object has no attribute 'moveTopTo'\n\n"], "anno_status": [false], "diff_content": " class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n- for a in range(6):\n+ for a in range(0,6,5):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n- print(self.data, value.data)\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n \n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n \n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n \n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n \n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n \n \n a = Dice(input().split())\n b = Dice(input().split())\n if a == b:\n print('Yes')\n else:\n print('No')\n", "FL_content": " class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n- for a in range(6):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n- print(self.data, value.data)\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n \n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n \n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n \n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n \n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n \n \n a = Dice(input().split())\n b = Dice(input().split())\n if a == b:\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 70 }, { "user_id": "u589886885", "problem_id": "p02385", "submission1_id": "s797374878", "submission2_id": "s592475199", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Dice():\n\n def __init__(self, label):\n self.label = label\n\n def north(self):\n self.change([2, 6, 3, 4, 1, 5])\n\n def west(self):\n self.change([3, 2, 6, 1, 5, 4])\n\n def east(self):\n self.change([4, 2, 1, 6, 5, 3])\n\n def south(self):\n self.change([5, 1, 3, 4, 6, 2])\n\n def change(self, convert):\n num = []\n for i in range(6):\n num.append(self.label[convert[i] - 1])\n self.label = num\n\n\ndef main():\n f = [int(x) for x in input().split()]\n s = [int(x) for x in input().split()]\n dice = Dice(f)\n labels = []\n for i in range(4):\n dice.north()\n labels.append(dice.label)\n for i in range(3):\n dice.west()\n if i != 1:\n labels.append(dice.label)\n if s in labels:\n print('Yes')\n else:\n print('No')\n\n\nif __name__ == '__main__':\n main()", "code2": "class Dice():\n\n def __init__(self, label):\n self.label = label\n\n def north(self):\n self.change([2, 6, 3, 4, 1, 5])\n\n def west(self):\n self.change([3, 2, 6, 1, 5, 4])\n\n def east(self):\n self.change([4, 2, 1, 6, 5, 3])\n\n def south(self):\n self.change([5, 1, 3, 4, 6, 2])\n\n def change(self, convert):\n num = []\n for i in range(6):\n num.append(self.label[convert[i] - 1])\n self.label = num\n\n\ndef main():\n f = [int(x) for x in input().split()]\n s = [int(x) for x in input().split()]\n dice = Dice(f)\n labels = []\n for i in range(6):\n if i < 4:\n dice.north()\n elif i == 4:\n dice.east()\n dice.south()\n elif i == 5:\n dice.south()\n dice.south()\n for j in range(4):\n dice.west()\n labels.append(dice.label)\n if s in labels:\n print('Yes')\n else:\n print('No')\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1471858774", "date2": "1471861920", "bleu_score": "0.8554012274370733", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["class Dice(): # (0): Dice=\n\n def __init__(self, label):\n self.label = label\n\n def north(self):\n self.change([2, 6, 3, 4, 1, 5])\n\n def west(self):\n self.change([3, 2, 6, 1, 5, 4])\n\n def east(self):\n self.change([4, 2, 1, 6, 5, 3])\n\n def south(self):\n self.change([5, 1, 3, 4, 6, 2])\n\n def change(self, convert):\n num = []\n for i in range(6):\n num.append(self.label[convert[i] - 1])\n self.label = num\n\n\ndef main(): # (1): main=\n f = [int(x) for x in input().split()]\n s = [int(x) for x in input().split()]\n dice = Dice(f)\n labels = []\n for i in range(4):\n dice.north()\n labels.append(dice.label)\n for i in range(3):\n dice.west()\n if i != 1:\n labels.append(dice.label)\n if s in labels:\n print('Yes')\n else:\n print('No')\n\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " class Dice():\n \n def __init__(self, label):\n self.label = label\n \n def north(self):\n self.change([2, 6, 3, 4, 1, 5])\n \n def west(self):\n self.change([3, 2, 6, 1, 5, 4])\n \n def east(self):\n self.change([4, 2, 1, 6, 5, 3])\n \n def south(self):\n self.change([5, 1, 3, 4, 6, 2])\n \n def change(self, convert):\n num = []\n for i in range(6):\n num.append(self.label[convert[i] - 1])\n self.label = num\n \n \n def main():\n f = [int(x) for x in input().split()]\n s = [int(x) for x in input().split()]\n dice = Dice(f)\n labels = []\n- for i in range(4):\n- dice.north()\n- labels.append(dice.label)\n- for i in range(3):\n- dice.west()\n- if i != 1:\n+ for i in range(6):\n+ if i < 4:\n+ dice.north()\n+ elif i == 4:\n+ dice.east()\n+ dice.south()\n+ elif i == 5:\n+ dice.south()\n+ dice.south()\n+ for j in range(4):\n+ dice.west()\n labels.append(dice.label)\n if s in labels:\n print('Yes')\n else:\n print('No')\n \n \n if __name__ == '__main__':\n main()\n", "FL_content": " class Dice():\n \n def __init__(self, label):\n self.label = label\n \n def north(self):\n self.change([2, 6, 3, 4, 1, 5])\n \n def west(self):\n self.change([3, 2, 6, 1, 5, 4])\n \n def east(self):\n self.change([4, 2, 1, 6, 5, 3])\n \n def south(self):\n self.change([5, 1, 3, 4, 6, 2])\n \n def change(self, convert):\n num = []\n for i in range(6):\n num.append(self.label[convert[i] - 1])\n self.label = num\n \n \n def main():\n f = [int(x) for x in input().split()]\n s = [int(x) for x in input().split()]\n dice = Dice(f)\n labels = []\n- for i in range(4):\n- dice.north()\n- labels.append(dice.label)\n- for i in range(3):\n- dice.west()\n- if i != 1:\n labels.append(dice.label)\n if s in labels:\n print('Yes')\n else:\n print('No')\n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 11, "removed_lines": 6, "code1_lines": 44 }, { "user_id": "u659034691", "problem_id": "p02385", "submission1_id": "s222774258", "submission2_id": "s939480682", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef r(D,s):\n if s==0:\n t=D[0]\n D[0]=D[1]\n D[1]=D[5]\n D[5]=D[4]\n D[4]=t\n elif s==2:\n t=D[0]\n D[0]=D[4]\n D[4]=D[5]\n D[5]=D[1]\n D[1]=t \n elif s==3:\n t=D[0]\n D[0]=D[3]\n D[3]=D[5]\n D[5]=D[2]\n D[2]=t \n elif s==1:\n t=D[0]\n D[0]=D[2]\n D[2]=D[5]\n D[5]=D[3]\n D[3]=t\n elif s==4:\n D=r(r(D,1),1)\n return D\ndef ch(C,D):\n k=0\n while k<6 and C[k]==D[k]:\n k+=1\n if k==6:\n return 1\n else:\n return 0\nC=[int(i) for i in input().split()]\nD=[int(i) for i in input().split()]\nnd=0\nif ch(C,D)==1:\n nd=1\ni=0\nwhile i<4 and nd==0:\n D=r(D,i)\n j=i+1\n j%=4\n k=0\n while k<3 and nd==0:\n D=r(D,j)\n if ch(C,D)==1:\n nd=1\n k+=1\n D=r(D,j)\n m=i+2\n m\n D=r(D,m)\n i+=1\ni=0\nwhile nd==0 and i<4:\n D=r(r(D,i),i)\n if ch(C,D)==1:\n nd=1\n D=r(r(D,i),i)\n i+=1\nif nd==1:\n p=\"Yes\"\nelse:\n p=\"No\"\nprint(p)", "code2": "\ndef r(D,s):\n if s==0:\n t=D[0]\n D[0]=D[1]\n D[1]=D[5]\n D[5]=D[4]\n D[4]=t\n elif s==2:\n t=D[0]\n D[0]=D[4]\n D[4]=D[5]\n D[5]=D[1]\n D[1]=t \n elif s==3:\n t=D[0]\n D[0]=D[3]\n D[3]=D[5]\n D[5]=D[2]\n D[2]=t \n elif s==1:\n t=D[0]\n D[0]=D[2]\n D[2]=D[5]\n D[5]=D[3]\n D[3]=t\n elif s==4:\n D=r(r(D,1),1)\n return D\ndef ch(C,D):\n k=0\n while k<6 and C[k]==D[k]:\n k+=1\n if k==6:\n return 1\n else:\n return 0\nC=[int(i) for i in input().split()]\nD=[int(i) for i in input().split()]\nnd=0\nif ch(C,D)==1:\n nd=1\ni=0\nwhile i<4 and nd==0:\n D=r(D,i)\n j=i+1\n j%=4\n k=0\n if ch(C,D)==1:\n nd=1\n \n \n while k<3 and nd==0:\n D=r(D,j)\n if ch(C,D)==1:\n nd=1\n k+=1\n \n \n D=r(D,j)\n \n \n m=i+2\n m%=4\n \n \n D=r(D,m)\n \n \n i+=1\ni=0\nwhile nd==0 and i<4:\n D=r(D,0)\n D=r(D,1)\n D=r(D,0)\n if ch(C,D)==1:\n nd=1\n D=r(r(D,0),0)\n if ch(C,D)==1:\n nd=1\n i+=1\nif nd==1:\n p=\"Yes\"\nelse:\n p=\"No\"\nprint(p)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1503033753", "date2": "1503041751", "bleu_score": "0.8842642419610764", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["\ndef r(D,s): # (0): r=\n if s==0: # (12): NO CHANGE (23): NO CHANGE ... (479): NO CHANGE\n t=D[0] # (13): t=6 (279): t=4 ... (362): t=1\n D[0]=D[1] # (14): D=[2, 2, 4, 3, 5, 1] (280): D=[6, 6, 2, 5, 1, 3] ... (363): D=[4, 4, 2, 5, 3, 6]\n D[1]=D[5] # (15): D=[2, 1, 4, 3, 5, 1] (281): D=[6, 3, 2, 5, 1, 3] ... (364): D=[4, 6, 2, 5, 3, 6]\n D[5]=D[4] # (16): D=[2, 1, 4, 3, 5, 5] (282): D=[6, 3, 2, 5, 1, 1] ... (365): D=[4, 6, 2, 5, 3, 3]\n D[4]=t # (17): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[2, 1, 4, 3, 6, 5], nd=0, i=0 (283): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[6, 3, 2, 5, 4, 1], nd=0, i=3, j=0, k=0, m=4 ... (366): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[4, 6, 2, 5, 1, 3], nd=0, i=0, j=0, k=3, m=5\n elif s==2: # (24): NO CHANGE (40): NO CHANGE ... (480): NO CHANGE\n t=D[0] # (85): t=2 (109): t=4 ... (442): t=6\n D[0]=D[4] # (86): D=[6, 1, 4, 3, 6, 5] (110): D=[5, 2, 1, 6, 5, 3] ... (443): D=[4, 3, 2, 5, 4, 1]\n D[4]=D[5] # (87): D=[6, 1, 4, 3, 5, 5] (111): D=[5, 2, 1, 6, 3, 3] ... (444): D=[4, 3, 2, 5, 1, 1]\n D[5]=D[1] # (88): D=[6, 1, 4, 3, 5, 1] (112): D=[5, 2, 1, 6, 3, 2] ... (445): D=[4, 3, 2, 5, 1, 3]\n D[1]=t # (89): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[6, 2, 4, 3, 5, 1], nd=0, i=0, j=1, k=3, m=2 (113): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[5, 4, 1, 6, 3, 2], nd=0, i=1, j=2, k=0, m=2 ... (446): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[4, 6, 2, 5, 1, 3], nd=0, i=2, j=0, k=3, m=5\n elif s==3: # (25): NO CHANGE (41): NO CHANGE ... (481): NO CHANGE\n t=D[0] # (162): t=4 (185): t=5 ... (482): t=2\n D[0]=D[3] # (163): D=[6, 2, 1, 6, 5, 3] (186): D=[3, 6, 4, 3, 1, 2] ... (483): D=[4, 6, 3, 4, 1, 5]\n D[3]=D[5] # (164): D=[6, 2, 1, 3, 5, 3] (187): D=[3, 6, 4, 2, 1, 2] ... (484): D=[4, 6, 3, 5, 1, 5]\n D[5]=D[2] # (165): D=[6, 2, 1, 3, 5, 1] (188): D=[3, 6, 4, 2, 1, 4] ... (485): D=[4, 6, 3, 5, 1, 3]\n D[2]=t # (166): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[6, 2, 4, 3, 5, 1], nd=0, i=1, j=2, k=3, m=3 (189): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[3, 6, 5, 2, 1, 4], nd=0, i=2, j=3, k=0, m=3 ... (486): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[4, 6, 2, 5, 1, 3], nd=0, i=3, j=0, k=3, m=5\n elif s==1: # (26): NO CHANGE (42): NO CHANGE ... (405): NO CHANGE\n t=D[0] # (27): t=2 (43): t=4 ... (406): t=5\n D[0]=D[2] # (28): D=[4, 1, 4, 3, 6, 5] (44): D=[5, 1, 5, 2, 6, 3] ... (407): D=[4, 6, 4, 3, 1, 2]\n D[2]=D[5] # (29): D=[4, 1, 5, 3, 6, 5] (45): D=[5, 1, 3, 2, 6, 3] ... (408): D=[4, 6, 2, 3, 1, 2]\n D[5]=D[3] # (30): D=[4, 1, 5, 3, 6, 3] (46): D=[5, 1, 3, 2, 6, 2] ... (409): D=[4, 6, 2, 3, 1, 3]\n D[3]=t # (31): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[4, 1, 5, 2, 6, 3], nd=0, i=0, j=1, k=0 (47): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[5, 1, 3, 4, 6, 2], nd=0, i=0, j=1, k=1 ... (410): r=, ch=, C=[1, 2, 3, 4, 5, 6], D=[4, 6, 2, 5, 1, 3], nd=0, i=1, j=0, k=3, m=5\n elif s==4: # (242): NO CHANGE (332): r=, ch=, C=[1, 2, 3, 4, 5, 6], nd=0, i=3, j=0, k=3, m=5\n D=r(r(D,1),1) # (243): s=1\n return D\ndef ch(C,D): # (1): ch=\n k=0 # (6): k=0 (33): k=0 ... (467): k=0\n while k<6 and C[k]==D[k]: # (7): NO CHANGE (34): NO CHANGE ... (468): NO CHANGE\n k+=1 # (313): k=1\n if k==6: # (8): r=, ch=, nd=0 (35): r=, ch=, nd=0, i=0, j=1 ... (469): r=, ch=, nd=0, i=3, j=0, k=3, m=5\n return 1\n else:\n return 0\nC=[int(i) for i in input().split()] # (2): C=[1, 2, 3, 4, 5, 6]\nD=[int(i) for i in input().split()] # (3): D=[6, 2, 4, 3, 5, 1]\nnd=0 # (4): nd=0\nif ch(C,D)==1: # (5): NO CHANGE\n nd=1\ni=0 # (9): i=0\nwhile i<4 and nd==0: # (10): NO CHANGE (91): NO CHANGE ... (334): NO CHANGE\n D=r(D,i) # (11): s=0 (92): s=1 ... (264): s=3\n j=i+1 # (18): j=1 (102): j=2 ... (273): j=4\n j%=4 # (19): NO CHANGE (103): NO CHANGE ... (274): j=0\n k=0 # (20): k=0 (104): k=0 ... (275): k=0\n while k<3 and nd==0: # (21): NO CHANGE (37): NO CHANGE ... (317): NO CHANGE\n D=r(D,j) # (22): s=1 (38): s=1 ... (303): s=0\n if ch(C,D)==1: # (32): NO CHANGE (48): NO CHANGE ... (310): NO CHANGE\n nd=1\n k+=1 # (36): k=1 (52): k=2 ... (316): k=3\n D=r(D,j) # (70): s=1 (148): s=2 ... (318): s=0\n m=i+2 # (80): m=2 (156): m=3 ... (325): m=5\n m # (81): NO CHANGE (157): NO CHANGE ... (326): NO CHANGE\n D=r(D,m) # (82): s=2 (158): s=3 ... (327): s=5\n i+=1 # (90): i=1 (167): i=2 ... (333): i=4\ni=0 # (335): i=0\nwhile nd==0 and i<4: # (336): NO CHANGE (368): NO CHANGE ... (488): NO CHANGE\n D=r(r(D,i),i) # (337): s=0 (369): s=1 ... (449): s=3\n if ch(C,D)==1: # (350): NO CHANGE (388): NO CHANGE ... (466): NO CHANGE\n nd=1\n D=r(r(D,i),i) # (354): s=0 (392): s=1 ... (470): s=3\n i+=1 # (367): i=1 (411): i=2 ... (487): i=4\nif nd==1: # (489): NO CHANGE\n p=\"Yes\"\nelse:\n p=\"No\" # (490): p=No\nprint(p)"], "anno_status": [false], "diff_content": " \n def r(D,s):\n if s==0:\n t=D[0]\n D[0]=D[1]\n D[1]=D[5]\n D[5]=D[4]\n D[4]=t\n elif s==2:\n t=D[0]\n D[0]=D[4]\n D[4]=D[5]\n D[5]=D[1]\n D[1]=t \n elif s==3:\n t=D[0]\n D[0]=D[3]\n D[3]=D[5]\n D[5]=D[2]\n D[2]=t \n elif s==1:\n t=D[0]\n D[0]=D[2]\n D[2]=D[5]\n D[5]=D[3]\n D[3]=t\n elif s==4:\n D=r(r(D,1),1)\n return D\n def ch(C,D):\n k=0\n while k<6 and C[k]==D[k]:\n k+=1\n if k==6:\n return 1\n else:\n return 0\n C=[int(i) for i in input().split()]\n D=[int(i) for i in input().split()]\n nd=0\n if ch(C,D)==1:\n nd=1\n i=0\n while i<4 and nd==0:\n D=r(D,i)\n j=i+1\n j%=4\n k=0\n+ if ch(C,D)==1:\n+ nd=1\n+ \n+ \n while k<3 and nd==0:\n D=r(D,j)\n if ch(C,D)==1:\n nd=1\n k+=1\n+ \n+ \n D=r(D,j)\n+ \n+ \n m=i+2\n- m\n+ m%=4\n+ \n+ \n D=r(D,m)\n+ \n+ \n i+=1\n i=0\n while nd==0 and i<4:\n- D=r(r(D,i),i)\n+ D=r(D,0)\n+ D=r(D,1)\n+ D=r(D,0)\n+ if ch(C,D)==1:\n+ nd=1\n+ D=r(r(D,0),0)\n if ch(C,D)==1:\n nd=1\n- D=r(r(D,i),i)\n i+=1\n if nd==1:\n p=\"Yes\"\n else:\n p=\"No\"\n print(p)\n", "FL_content": " \n def r(D,s):\n if s==0:\n t=D[0]\n D[0]=D[1]\n D[1]=D[5]\n D[5]=D[4]\n D[4]=t\n elif s==2:\n t=D[0]\n D[0]=D[4]\n D[4]=D[5]\n D[5]=D[1]\n D[1]=t \n elif s==3:\n t=D[0]\n D[0]=D[3]\n D[3]=D[5]\n D[5]=D[2]\n D[2]=t \n elif s==1:\n t=D[0]\n D[0]=D[2]\n D[2]=D[5]\n D[5]=D[3]\n D[3]=t\n elif s==4:\n D=r(r(D,1),1)\n return D\n def ch(C,D):\n k=0\n while k<6 and C[k]==D[k]:\n k+=1\n if k==6:\n return 1\n else:\n return 0\n C=[int(i) for i in input().split()]\n D=[int(i) for i in input().split()]\n nd=0\n if ch(C,D)==1:\n nd=1\n i=0\n while i<4 and nd==0:\n D=r(D,i)\n j=i+1\n j%=4\n k=0\n while k<3 and nd==0:\n D=r(D,j)\n if ch(C,D)==1:\n nd=1\n k+=1\n D=r(D,j)\n m=i+2\n- m\n D=r(D,m)\n i+=1\n i=0\n while nd==0 and i<4:\n- D=r(r(D,i),i)\n if ch(C,D)==1:\n nd=1\n- D=r(r(D,i),i)\n i+=1\n if nd==1:\n p=\"Yes\"\n else:\n p=\"No\"\n print(p)\n", "added_lines": 19, "removed_lines": 3, "code1_lines": 70 }, { "user_id": "u131984977", "problem_id": "p02385", "submission1_id": "s701276705", "submission2_id": "s482498602", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n for a in range(0,6,5):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n print(self.data, value.data)\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n\n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n\n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n\n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n\n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n\n\na = Dice(input().split())\nb = Dice(input().split())\nif a == b:\n print('Yes')\nelse:\n print('No')", "code2": "class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n for a in range(0,6,5):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n\n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n\n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n\n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n\n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n\n\na = Dice(input().split())\nb = Dice(input().split())\nif a == b:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1423795735", "date2": "1423795898", "bleu_score": "0.980005116380216", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 0 3 2 13 11\n2 0 4 1 4 2\n", "actual_output": "['0', '11', '3', '2', '2', '13'] ['0', '2', '4', '1', '2', '4']\n['0', '11', '3', '2', '2', '13'] ['0', '1', '2', '2', '4', '4']\n['0', '11', '3', '2', '2', '13'] ['0', '2', '1', '4', '2', '4']\n['0', '11', '3', '2', '2', '13'] ['0', '4', '2', '2', '1', '4']\n['3', '11', '13', '0', '2', '2'] ['4', '2', '4', '0', '2', '1']\n['3', '11', '13', '0', '2', '2'] ['4', '0', '2', '2', '4', '1']\n['3', '11', '13', '0', '2', '2'] ['4', '2', '0', '4', '2', '1']\n['3', '11', '13', '0', '2', '2'] ['4', '4', '2', '2', '0', '1']\nNo\n", "expected_output": "No\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 221, in \n\n run_script(target_script, input_file)\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 191, in run_script\n\n exec(script_content, script_globals)\n\n File \"\", line 70, in \n\n File \"\", line 70, in \n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 73, in trace_lines\n\n if var not in last_locals or not np.array_equal(last_locals[var], value):\n\n File \"G:\\Anaconda\\Anaconda\\envs\\common\\lib\\site-packages\\numpy\\core\\numeric.py\", line 2439, in array_equal\n\n return bool(asarray(a1 == a2).all())\n\n File \"\", line 8, in __eq__\n\nAttributeError: 'int' object has no attribute 'moveTopTo'\n\n"], "anno_status": [true], "diff_content": " class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n for a in range(0,6,5):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n- print(self.data, value.data)\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n \n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n \n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n \n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n \n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n \n \n a = Dice(input().split())\n b = Dice(input().split())\n if a == b:\n print('Yes')\n else:\n print('No')\n", "FL_content": " class Dice:\n def __init__(self, data):\n self.data = data\n \n def __eq__(self, value):\n for a in range(0,6,5):\n self.moveTopTo(self.getSortedList()[a])\n value.moveTopTo(value.getSortedList()[a])\n for b in range(4):\n- print(self.data, value.data)\n if self.data == value.data:\n return True\n else:\n value.move('R')\n return False\n \n def move(self, direction):\n if direction == 'E':\n self.data[0], self.data[3], self.data[5], self.data[2] = \\\n self.data[3], self.data[5], self.data[2], self.data[0]\n elif direction == 'N':\n self.data[0], self.data[4], self.data[5], self.data[1] = \\\n self.data[1], self.data[0], self.data[4], self.data[5]\n elif direction == 'S':\n self.data[0], self.data[1], self.data[5], self.data[4] = \\\n self.data[4], self.data[0], self.data[1], self.data[5]\n elif direction == 'W':\n self.data[0], self.data[2], self.data[5], self.data[3] = \\\n self.data[2], self.data[5], self.data[3], self.data[0]\n elif direction == 'R':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[3], self.data[1], self.data[2], self.data[4]\n elif direction == 'L':\n self.data[1], self.data[2], self.data[4], self.data[3] = \\\n self.data[2], self.data[4], self.data[3], self.data[1]\n \n def moveTopTo(self, target):\n for a in range(4):\n if self.data[0] == target:\n break\n self.move('W')\n if self.data[4] == target:\n self.move('S')\n elif self.data[1] == target:\n self.move('N')\n \n def moveFrontTo(self, target):\n for a in range(4):\n if self.data[1] == target:\n break\n self.move('R')\n \n def getTop(self):\n return self.data[0]\n \n def getRight(self):\n return self.data[2]\n \n def getSortedList(self):\n tmp = self.data[:]\n tmp.sort()\n return tmp\n \n \n a = Dice(input().split())\n b = Dice(input().split())\n if a == b:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 70 }, { "user_id": "u682153677", "problem_id": "p02385", "submission1_id": "s418882082", "submission2_id": "s028117198", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nclass Dice:\n def __init__(self, n):\n self.upper = n[0]\n self.backward = n[1]\n self.right = n[2]\n self.left = n[3]\n self.ahead = n[4]\n self.bottom = n[5]\n\n def roll_north(self):\n self.upper, self.ahead, self.bottom, self.backward = self.backward, self.upper, self.ahead, self.bottom\n\n def roll_south(self):\n self.upper, self.ahead, self.bottom, self.backward = self.ahead, self.bottom, self.backward, self.upper\n\n def roll_east(self):\n self.upper, self.right, self.bottom, self.left = self.left, self.upper, self.right, self.bottom\n\n def roll_west(self):\n self.upper, self.right, self.bottom, self.left = self.right, self.bottom, self.left, self.upper\n\n def roll_side(self):\n self.ahead, self.right, self.backward, self.left = self.left, self.ahead, self.right, self.backward\n\n\ndef match_dice(dice1, dice2):\n for i in range(4):\n dice1.roll_north()\n\n for j in range(4):\n dice1.roll_east()\n\n for k in range(4):\n dice1.roll_side()\n\n if dice1 is dice2:\n return 0\n return 1\n\n\ndice1 = Dice(list(map(int, input().split())))\ndice2 = Dice(list(map(int, input().split())))\nresult = match_dice(dice1, dice2)\n\nif result is 0:\n print('Yes')\nelse:\n print('No')\n \n", "code2": "\n\n\nclass Dice:\n def __init__(self, n):\n self.upper = n[0]\n self.backward = n[1]\n self.right = n[2]\n self.left = n[3]\n self.ahead = n[4]\n self.bottom = n[5]\n\n def __eq__(self, other):\n return self.upper == other.upper and self.backward == other.backward and self.right == other.right and self.left == other.left and self.ahead == other.ahead and self.bottom == other.bottom\n\n def roll_north(self):\n self.upper, self.ahead, self.bottom, self.backward = self.backward, self.upper, self.ahead, self.bottom\n\n def roll_south(self):\n self.upper, self.ahead, self.bottom, self.backward = self.ahead, self.bottom, self.backward, self.upper\n\n def roll_east(self):\n self.upper, self.right, self.bottom, self.left = self.left, self.upper, self.right, self.bottom\n\n def roll_west(self):\n self.upper, self.right, self.bottom, self.left = self.right, self.bottom, self.left, self.upper\n\n def roll_side(self):\n self.ahead, self.right, self.backward, self.left = self.left, self.ahead, self.right, self.backward\n\n\ndef match_dice(dice1, dice2):\n for i in range(4):\n dice1.roll_north()\n\n for j in range(4):\n dice1.roll_east()\n\n for k in range(4):\n dice1.roll_side()\n\n if dice2 == dice1:\n return 0\n return 1\n\n\ndice1 = Dice(list(map(int, input().split())))\ndice2 = Dice(list(map(int, input().split())))\nresult = match_dice(dice1, dice2)\n\nif result is 0:\n print('Yes')\nelse:\n print('No')\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525499390", "date2": "1525500707", "bleu_score": "0.8548113779161168", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["\n\n\nclass Dice: # (0): Dice=\n def __init__(self, n):\n self.upper = n[0] # (3): NO CHANGE (10): NO CHANGE\n self.backward = n[1] # (4): NO CHANGE (11): NO CHANGE\n self.right = n[2] # (5): NO CHANGE (12): NO CHANGE\n self.left = n[3] # (6): NO CHANGE (13): NO CHANGE\n self.ahead = n[4] # (7): NO CHANGE (14): NO CHANGE\n self.bottom = n[5] # (8): Dice=, match_dice=, dice1= (15): Dice=, match_dice=, dice1=, dice2=\n\n def roll_north(self):\n self.upper, self.ahead, self.bottom, self.backward = self.backward, self.upper, self.ahead, self.bottom # (19): dice1=, dice2=, i=0 (103): dice1=, dice2=, i=1, j=3, k=3 ... (271): dice1=, dice2=, i=3, j=3, k=3\n\n def roll_south(self):\n self.upper, self.ahead, self.bottom, self.backward = self.ahead, self.bottom, self.backward, self.upper\n\n def roll_east(self):\n self.upper, self.right, self.bottom, self.left = self.left, self.upper, self.right, self.bottom # (22): dice1=, dice2=, i=0, j=0 (42): dice1=, dice2=, i=0, j=1, k=3 ... (334): dice1=, dice2=, i=3, j=3, k=3\n\n def roll_west(self):\n self.upper, self.right, self.bottom, self.left = self.right, self.bottom, self.left, self.upper\n\n def roll_side(self):\n self.ahead, self.right, self.backward, self.left = self.left, self.ahead, self.right, self.backward # (25): dice1=, dice2=, i=0, j=0, k=0 (29): dice1=, dice2=, i=0, j=0, k=1 ... (349): dice1=, dice2=, i=3, j=3, k=3\n\n\ndef match_dice(dice1, dice2): # (1): match_dice=\n for i in range(4): # (17): i=0 (101): i=1 ... (353): Dice=, match_dice=, result=1\n dice1.roll_north() # (18): self= (102): self= ... (270): self=\n\n for j in range(4): # (20): j=0 (40): j=1 ... (352): NO CHANGE\n dice1.roll_east() # (21): self= (41): self= ... (333): self=\n\n for k in range(4): # (23): k=0 (27): k=1 ... (351): NO CHANGE\n dice1.roll_side() # (24): self= (28): self= ... (348): self=\n\n if dice1 is dice2: # (26): NO CHANGE (30): NO CHANGE ... (350): NO CHANGE\n return 0\n return 1\n\n\ndice1 = Dice(list(map(int, input().split()))) # (2): self=, n=[1, 2, 3, 4, 5, 6]\ndice2 = Dice(list(map(int, input().split()))) # (9): self=, n=[6, 2, 4, 3, 5, 1]\nresult = match_dice(dice1, dice2) # (16): NO CHANGE\n\nif result is 0: # (354): NO CHANGE\n print('Yes')\nelse:\n print('No')\n \n"], "anno_status": [false], "diff_content": " \n \n \n class Dice:\n def __init__(self, n):\n self.upper = n[0]\n self.backward = n[1]\n self.right = n[2]\n self.left = n[3]\n self.ahead = n[4]\n self.bottom = n[5]\n \n+ def __eq__(self, other):\n+ return self.upper == other.upper and self.backward == other.backward and self.right == other.right and self.left == other.left and self.ahead == other.ahead and self.bottom == other.bottom\n+\n def roll_north(self):\n self.upper, self.ahead, self.bottom, self.backward = self.backward, self.upper, self.ahead, self.bottom\n \n def roll_south(self):\n self.upper, self.ahead, self.bottom, self.backward = self.ahead, self.bottom, self.backward, self.upper\n \n def roll_east(self):\n self.upper, self.right, self.bottom, self.left = self.left, self.upper, self.right, self.bottom\n \n def roll_west(self):\n self.upper, self.right, self.bottom, self.left = self.right, self.bottom, self.left, self.upper\n \n def roll_side(self):\n self.ahead, self.right, self.backward, self.left = self.left, self.ahead, self.right, self.backward\n \n \n def match_dice(dice1, dice2):\n for i in range(4):\n dice1.roll_north()\n \n for j in range(4):\n dice1.roll_east()\n \n for k in range(4):\n dice1.roll_side()\n \n- if dice1 is dice2:\n+ if dice2 == dice1:\n return 0\n return 1\n \n \n dice1 = Dice(list(map(int, input().split())))\n dice2 = Dice(list(map(int, input().split())))\n result = match_dice(dice1, dice2)\n \n if result is 0:\n print('Yes')\n else:\n print('No')\n- \n+\n \n", "FL_content": " \n \n \n class Dice:\n def __init__(self, n):\n self.upper = n[0]\n self.backward = n[1]\n self.right = n[2]\n self.left = n[3]\n self.ahead = n[4]\n self.bottom = n[5]\n \n def roll_north(self):\n self.upper, self.ahead, self.bottom, self.backward = self.backward, self.upper, self.ahead, self.bottom\n \n def roll_south(self):\n self.upper, self.ahead, self.bottom, self.backward = self.ahead, self.bottom, self.backward, self.upper\n \n def roll_east(self):\n self.upper, self.right, self.bottom, self.left = self.left, self.upper, self.right, self.bottom\n \n def roll_west(self):\n self.upper, self.right, self.bottom, self.left = self.right, self.bottom, self.left, self.upper\n \n def roll_side(self):\n self.ahead, self.right, self.backward, self.left = self.left, self.ahead, self.right, self.backward\n \n \n def match_dice(dice1, dice2):\n for i in range(4):\n dice1.roll_north()\n \n for j in range(4):\n dice1.roll_east()\n \n for k in range(4):\n dice1.roll_side()\n \n- if dice1 is dice2:\n return 0\n return 1\n \n \n dice1 = Dice(list(map(int, input().split())))\n dice2 = Dice(list(map(int, input().split())))\n result = match_dice(dice1, dice2)\n \n if result is 0:\n print('Yes')\n else:\n print('No')\n- \n \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 53 }, { "user_id": "u283452598", "problem_id": "p02385", "submission1_id": "s219857482", "submission2_id": "s443767663", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Dice():\n def __init__(self,ary):\n self.top = ary[0]\n self.south = ary[1]\n self.east = ary[2]\n self.west = ary[3]\n self.north = ary[4]\n self.bottom = ary[5]\n\n def get_top(self):\n return self.top\n\n def rotate_north(self):\n self.top,self.south,self.north,self.bottom = self.south,self.bottom,self.top,self.north\n \n def rotate_south(self):\n self.top,self.south,self.north,self.bottom = self.north,self.top,self.bottom,self.south\n\n def rotate_west(self):\n self.top,self.west,self.bottom,self.east = self.east,self.top,self.west,self.bottom\n\n def rotate_east(self):\n self.top,self.west,self.bottom,self.east = self.west,self.bottom,self.east,self.top\n\n def rotate_horizon(self):\n self.south,self.east,self.north,self.west = self.west,self.south,self.east,self.north\n\n def get_east(self):\n return self.east\n \ndice1 = Dice(list(map(int,input().split())))\ndice2 = Dice(list(map(int,input().split())))\n\nh=\"\"\n\nfor i in range(4):\n dice2.rotate_west()\n if dice1.top == dice2.top:\n for _ in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n if dice1.east == dice2.east:\n h = \"Yes\"\nfor _ in range(4):\n dice2.rotate_north()\n if dice1.top == dice2.top:\n for m in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n if dice1.east == dice2.east:\n h = \"Yes\"\nif h:\n print(h)\nelse:\n print(\"No\")", "code2": "class Dice():\n def __init__(self,ary):\n self.top = ary[0]\n self.south = ary[1]\n self.east = ary[2]\n self.west = ary[3]\n self.north = ary[4]\n self.bottom = ary[5]\n\n def get_top(self):\n return self.top\n\n def rotate_north(self):\n self.top,self.south,self.north,self.bottom = self.south,self.bottom,self.top,self.north\n \n def rotate_south(self):\n self.top,self.south,self.north,self.bottom = self.north,self.top,self.bottom,self.south\n\n def rotate_west(self):\n self.top,self.west,self.bottom,self.east = self.east,self.top,self.west,self.bottom\n\n def rotate_east(self):\n self.top,self.west,self.bottom,self.east = self.west,self.bottom,self.east,self.top\n\n def rotate_horizon(self):\n self.south,self.east,self.north,self.west = self.west,self.south,self.east,self.north\n\n def get_east(self):\n return self.east\n \ndice1 = Dice(list(map(int,input().split())))\ndice2 = Dice(list(map(int,input().split())))\n\nh=\"\"\n\nfor i in range(4):\n dice2.rotate_west()\n if dice1.top == dice2.top:\n for _ in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n if dice1.east == dice2.east and dice1.west == dice2.west:\n h = \"Yes\"\nfor _ in range(4):\n dice2.rotate_north()\n if dice1.top == dice2.top:\n for m in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n if dice1.east == dice2.east and dice1.west == dice2.west:\n h = \"Yes\"\nif h:\n print(h)\nelse:\n print(\"No\")", "original_language1": "Python3", "original_language2": "Python3", "date1": "1503212055", "date2": "1503212204", "bleu_score": "0.9642306684016063", "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, 0, 0, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "2 1 0 0 13 0\n3 1 8 0 4 2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["class Dice(): # (0): Dice=\n def __init__(self,ary):\n self.top = ary[0] # (2): NO CHANGE (9): NO CHANGE\n self.south = ary[1] # (3): NO CHANGE (10): NO CHANGE\n self.east = ary[2] # (4): NO CHANGE (11): NO CHANGE\n self.west = ary[3] # (5): NO CHANGE (12): NO CHANGE\n self.north = ary[4] # (6): NO CHANGE (13): NO CHANGE\n self.bottom = ary[5] # (7): Dice=, dice1= (14): Dice=, dice1=, dice2=\n\n def get_top(self):\n return self.top\n\n def rotate_north(self):\n self.top,self.south,self.north,self.bottom = self.south,self.bottom,self.top,self.north # (54): Dice=, dice1=, dice2=, h=Yes, i=3, _=0 (58): Dice=, dice1=, dice2=, h=Yes, i=3, _=1 ... (85): Dice=, dice1=, dice2=, h=Yes, i=3, _=3, m=3\n \n def rotate_south(self):\n self.top,self.south,self.north,self.bottom = self.north,self.top,self.bottom,self.south\n\n def rotate_west(self):\n self.top,self.west,self.bottom,self.east = self.east,self.top,self.west,self.bottom # (18): Dice=, dice1=, dice2=, h=, i=0 (22): Dice=, dice1=, dice2=, h=, i=1 ... (49): Dice=, dice1=, dice2=, h=Yes, i=3, _=3\n\n def rotate_east(self):\n self.top,self.west,self.bottom,self.east = self.west,self.bottom,self.east,self.top\n\n def rotate_horizon(self):\n self.south,self.east,self.north,self.west = self.west,self.south,self.east,self.north # (26): Dice=, dice1=, dice2=, h=, i=1, _=0 (30): Dice=, dice1=, dice2=, h=, i=1, _=1 ... (76): Dice=, dice1=, dice2=, h=Yes, i=3, _=1, m=3\n\n def get_east(self):\n return self.east\n \ndice1 = Dice(list(map(int,input().split()))) # (1): self=, ary=[2, 1, 0, 0, 13, 0]\ndice2 = Dice(list(map(int,input().split()))) # (8): self=, ary=[3, 1, 8, 0, 4, 2]\n\nh=\"\" # (15): h=\n\nfor i in range(4): # (16): i=0 (20): i=1 ... (51): NO CHANGE\n dice2.rotate_west() # (17): self= (21): self= ... (48): self=\n if dice1.top == dice2.top: # (19): NO CHANGE (23): NO CHANGE ... (50): NO CHANGE\n for _ in range(4): # (24): _=0 (28): _=1 ... (42): NO CHANGE\n dice2.rotate_horizon() # (25): self= (29): self= ... (37): self=\n if dice1.south == dice2.south: # (27): NO CHANGE (31): NO CHANGE ... (39): NO CHANGE\n if dice1.east == dice2.east: # (40): NO CHANGE\n h = \"Yes\" # (41): h=Yes\nfor _ in range(4): # (52): _=0 (56): _=1 ... (87): NO CHANGE\n dice2.rotate_north() # (53): self= (57): self= ... (84): self=\n if dice1.top == dice2.top: # (55): NO CHANGE (59): NO CHANGE ... (86): NO CHANGE\n for m in range(4): # (60): m=0 (64): m=1 ... (78): NO CHANGE\n dice2.rotate_horizon() # (61): self= (65): self= ... (75): self=\n if dice1.south == dice2.south: # (63): NO CHANGE (67): NO CHANGE ... (77): NO CHANGE\n if dice1.east == dice2.east: # (68): NO CHANGE\n h = \"Yes\" # (69): NO CHANGE\nif h: # (88): NO CHANGE\n print(h)\nelse:\n print(\"No\")"], "anno_status": [false], "diff_content": " class Dice():\n def __init__(self,ary):\n self.top = ary[0]\n self.south = ary[1]\n self.east = ary[2]\n self.west = ary[3]\n self.north = ary[4]\n self.bottom = ary[5]\n \n def get_top(self):\n return self.top\n \n def rotate_north(self):\n self.top,self.south,self.north,self.bottom = self.south,self.bottom,self.top,self.north\n \n def rotate_south(self):\n self.top,self.south,self.north,self.bottom = self.north,self.top,self.bottom,self.south\n \n def rotate_west(self):\n self.top,self.west,self.bottom,self.east = self.east,self.top,self.west,self.bottom\n \n def rotate_east(self):\n self.top,self.west,self.bottom,self.east = self.west,self.bottom,self.east,self.top\n \n def rotate_horizon(self):\n self.south,self.east,self.north,self.west = self.west,self.south,self.east,self.north\n \n def get_east(self):\n return self.east\n \n dice1 = Dice(list(map(int,input().split())))\n dice2 = Dice(list(map(int,input().split())))\n \n h=\"\"\n \n for i in range(4):\n dice2.rotate_west()\n if dice1.top == dice2.top:\n for _ in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n- if dice1.east == dice2.east:\n+ if dice1.east == dice2.east and dice1.west == dice2.west:\n h = \"Yes\"\n for _ in range(4):\n dice2.rotate_north()\n if dice1.top == dice2.top:\n for m in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n- if dice1.east == dice2.east:\n+ if dice1.east == dice2.east and dice1.west == dice2.west:\n h = \"Yes\"\n if h:\n print(h)\n else:\n print(\"No\")\n", "FL_content": " class Dice():\n def __init__(self,ary):\n self.top = ary[0]\n self.south = ary[1]\n self.east = ary[2]\n self.west = ary[3]\n self.north = ary[4]\n self.bottom = ary[5]\n \n def get_top(self):\n return self.top\n \n def rotate_north(self):\n self.top,self.south,self.north,self.bottom = self.south,self.bottom,self.top,self.north\n \n def rotate_south(self):\n self.top,self.south,self.north,self.bottom = self.north,self.top,self.bottom,self.south\n \n def rotate_west(self):\n self.top,self.west,self.bottom,self.east = self.east,self.top,self.west,self.bottom\n \n def rotate_east(self):\n self.top,self.west,self.bottom,self.east = self.west,self.bottom,self.east,self.top\n \n def rotate_horizon(self):\n self.south,self.east,self.north,self.west = self.west,self.south,self.east,self.north\n \n def get_east(self):\n return self.east\n \n dice1 = Dice(list(map(int,input().split())))\n dice2 = Dice(list(map(int,input().split())))\n \n h=\"\"\n \n for i in range(4):\n dice2.rotate_west()\n if dice1.top == dice2.top:\n for _ in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n- if dice1.east == dice2.east:\n h = \"Yes\"\n for _ in range(4):\n dice2.rotate_north()\n if dice1.top == dice2.top:\n for m in range(4):\n dice2.rotate_horizon()\n if dice1.south == dice2.south:\n- if dice1.east == dice2.east:\n h = \"Yes\"\n if h:\n print(h)\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 55 }, { "user_id": "u126478680", "problem_id": "p02385", "submission1_id": "s344803021", "submission2_id": "s755200495", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nclass dice():\n def __init__(self, arr):\n self.top = arr[0]\n self.south = arr[1]\n self.east = arr[2]\n self.west = arr[3]\n self.north = arr[4]\n self.bottom = arr[5]\n\n def rotate(self, ope):\n if ope == 'S':\n self.top, self.north, self.bottom, self.south = self.north, self.bottom, self.south, self.top\n elif ope == 'N':\n self.top, self.south, self.bottom, self.north = self.south, self.bottom, self.north, self.top\n elif ope == 'E':\n self.top, self.west, self.bottom, self.east = self.west, self.bottom, self.east, self.top\n elif ope == 'W':\n self.top, self.east, self.bottom, self.west = self.east, self.bottom, self.west, self.top\n\n def get_surfaces(self):\n return [self.top, self.south, self.east, self.north, self.west, self.bottom]\n\ndc1 = dice([int(x) for x in input().split(' ')])\ndc2 = dice([int(x) for x in input().split(' ')])\n\njudged = False\nif len((dc1.get_surfaces() and dc2.get_surfaces())) == 6:\n if dc2.top != dc1.top:\n opes = ['S', 'E', 'S', 'E', 'S']\n for op in opes:\n dc2.rotate(op)\n if dc2.top == dc1.top: break\n for i in range(4):\n if dc2.south == dc1.south:\n break\n dc2.rotate('R')\n if (dc1.east == dc2.east) and (dc1.north == dc2.north) and (dc1.bottom == dc2.bottom):\n judged = True\n\nif judged:\n print('Yes')\nelse:\n print('No')\n", "code2": "\n\n\nclass dice():\n def __init__(self, arr):\n self.top = arr[0]\n self.south = arr[1]\n self.east = arr[2]\n self.west = arr[3]\n self.north = arr[4]\n self.bottom = arr[5]\n\n def rotate(self, ope):\n if ope == 'S':\n self.top, self.north, self.bottom, self.south = self.north, self.bottom, self.south, self.top\n elif ope == 'N':\n self.top, self.south, self.bottom, self.north = self.south, self.bottom, self.north, self.top\n elif ope == 'E':\n self.top, self.west, self.bottom, self.east = self.west, self.bottom, self.east, self.top\n elif ope == 'W':\n self.top, self.east, self.bottom, self.west = self.east, self.bottom, self.west, self.top\n elif ope == 'R': \n self.south, self.east, self.north, self.west = self.east, self.north, self.west, self.south\n elif ope == 'L': \n self.south, self.east, self.north, self.west = self.west, self.north, self.east, self.south\n else:\n pass\n\n def get_surfaces(self):\n return [self.top, self.south, self.east, self.north, self.west, self.bottom]\n\ndc1 = dice([int(x) for x in input().split(' ')])\ndc2 = dice([int(x) for x in input().split(' ')])\n\njudged = False\nif len((dc1.get_surfaces() and dc2.get_surfaces())) == 6:\n opes = ['', 'S', 'E', 'S', 'E', 'S']\n for op in opes:\n dc2.rotate(op)\n for i in range(4):\n if dc1.get_surfaces() == dc2.get_surfaces():\n judged = True\n break\n dc2.rotate('R')\n if judged: break\n\nif judged:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524807608", "date2": "1524810315", "bleu_score": "0.8252148698157773", "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": "1 2 3 4 5 6\n6 2 4 3 5 1\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["\n\n\nclass dice(): # (0): dice=\n def __init__(self, arr):\n self.top = arr[0] # (2): NO CHANGE (9): NO CHANGE\n self.south = arr[1] # (3): NO CHANGE (10): NO CHANGE\n self.east = arr[2] # (4): NO CHANGE (11): NO CHANGE\n self.west = arr[3] # (5): NO CHANGE (12): NO CHANGE\n self.north = arr[4] # (6): NO CHANGE (13): NO CHANGE\n self.bottom = arr[5] # (7): dice=, dc1= (14): dice=, dc1=, dc2=\n\n def rotate(self, ope):\n if ope == 'S': # (21): NO CHANGE (26): NO CHANGE ... (60): NO CHANGE\n self.top, self.north, self.bottom, self.south = self.north, self.bottom, self.south, self.top # (22): dice=, dc1=, dc2=, judged=False, opes=['S', 'E', 'S', 'E', 'S'], op=S (34): dice=, dc1=, dc2=, judged=False, opes=['S', 'E', 'S', 'E', 'S'], op=S\n elif ope == 'N': # (27): NO CHANGE (40): NO CHANGE ... (61): NO CHANGE\n self.top, self.south, self.bottom, self.north = self.south, self.bottom, self.north, self.top\n elif ope == 'E': # (28): NO CHANGE (41): NO CHANGE ... (62): NO CHANGE\n self.top, self.west, self.bottom, self.east = self.west, self.bottom, self.east, self.top # (29): dice=, dc1=, dc2=, judged=False, opes=['S', 'E', 'S', 'E', 'S'], op=E\n elif ope == 'W': # (42): dice=, dc1=, dc2=, judged=False, opes=['S', 'E', 'S', 'E', 'S'], op=S, i=0 (49): dice=, dc1=, dc2=, judged=False, opes=['S', 'E', 'S', 'E', 'S'], op=S, i=1 ... (63): dice=, dc1=, dc2=, judged=False, opes=['S', 'E', 'S', 'E', 'S'], op=S, i=3\n self.top, self.east, self.bottom, self.west = self.east, self.bottom, self.west, self.top\n\n def get_surfaces(self):\n return [self.top, self.south, self.east, self.north, self.west, self.bottom]\n\ndc1 = dice([int(x) for x in input().split(' ')]) # (1): self=, arr=[1, 2, 3, 4, 5, 6]\ndc2 = dice([int(x) for x in input().split(' ')]) # (8): self=, arr=[6, 2, 4, 3, 5, 1]\n\njudged = False # (15): judged=False\nif len((dc1.get_surfaces() and dc2.get_surfaces())) == 6: # (16): NO CHANGE\n if dc2.top != dc1.top: # (17): NO CHANGE\n opes = ['S', 'E', 'S', 'E', 'S'] # (18): opes=['S', 'E', 'S', 'E', 'S']\n for op in opes: # (19): op=S (24): op=E (31): op=S\n dc2.rotate(op) # (20): self=, ope=S (25): self=, ope=E (32): self=, ope=S\n if dc2.top == dc1.top: break # (23): NO CHANGE (30): NO CHANGE (35): NO CHANGE\n for i in range(4): # (36): i=0 (43): i=1 ... (64): NO CHANGE\n if dc2.south == dc1.south: # (37): NO CHANGE (44): NO CHANGE ... (58): NO CHANGE\n break\n dc2.rotate('R') # (38): self=, ope=R (45): self=, ope=R ... (59): self=, ope=R\n if (dc1.east == dc2.east) and (dc1.north == dc2.north) and (dc1.bottom == dc2.bottom): # (65): NO CHANGE\n judged = True\n\nif judged: # (66): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [false], "diff_content": " \n \n \n class dice():\n def __init__(self, arr):\n self.top = arr[0]\n self.south = arr[1]\n self.east = arr[2]\n self.west = arr[3]\n self.north = arr[4]\n self.bottom = arr[5]\n \n def rotate(self, ope):\n if ope == 'S':\n self.top, self.north, self.bottom, self.south = self.north, self.bottom, self.south, self.top\n elif ope == 'N':\n self.top, self.south, self.bottom, self.north = self.south, self.bottom, self.north, self.top\n elif ope == 'E':\n self.top, self.west, self.bottom, self.east = self.west, self.bottom, self.east, self.top\n elif ope == 'W':\n self.top, self.east, self.bottom, self.west = self.east, self.bottom, self.west, self.top\n+ elif ope == 'R': \n+ self.south, self.east, self.north, self.west = self.east, self.north, self.west, self.south\n+ elif ope == 'L': \n+ self.south, self.east, self.north, self.west = self.west, self.north, self.east, self.south\n+ else:\n+ pass\n \n def get_surfaces(self):\n return [self.top, self.south, self.east, self.north, self.west, self.bottom]\n \n dc1 = dice([int(x) for x in input().split(' ')])\n dc2 = dice([int(x) for x in input().split(' ')])\n \n judged = False\n if len((dc1.get_surfaces() and dc2.get_surfaces())) == 6:\n- if dc2.top != dc1.top:\n- opes = ['S', 'E', 'S', 'E', 'S']\n- for op in opes:\n- dc2.rotate(op)\n- if dc2.top == dc1.top: break\n- for i in range(4):\n- if dc2.south == dc1.south:\n- break\n- dc2.rotate('R')\n- if (dc1.east == dc2.east) and (dc1.north == dc2.north) and (dc1.bottom == dc2.bottom):\n- judged = True\n+ opes = ['', 'S', 'E', 'S', 'E', 'S']\n+ for op in opes:\n+ dc2.rotate(op)\n+ for i in range(4):\n+ if dc1.get_surfaces() == dc2.get_surfaces():\n+ judged = True\n+ break\n+ dc2.rotate('R')\n+ if judged: break\n \n if judged:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " \n \n \n class dice():\n def __init__(self, arr):\n self.top = arr[0]\n self.south = arr[1]\n self.east = arr[2]\n self.west = arr[3]\n self.north = arr[4]\n self.bottom = arr[5]\n \n def rotate(self, ope):\n if ope == 'S':\n self.top, self.north, self.bottom, self.south = self.north, self.bottom, self.south, self.top\n elif ope == 'N':\n self.top, self.south, self.bottom, self.north = self.south, self.bottom, self.north, self.top\n elif ope == 'E':\n self.top, self.west, self.bottom, self.east = self.west, self.bottom, self.east, self.top\n elif ope == 'W':\n self.top, self.east, self.bottom, self.west = self.east, self.bottom, self.west, self.top\n \n def get_surfaces(self):\n return [self.top, self.south, self.east, self.north, self.west, self.bottom]\n \n dc1 = dice([int(x) for x in input().split(' ')])\n dc2 = dice([int(x) for x in input().split(' ')])\n \n judged = False\n if len((dc1.get_surfaces() and dc2.get_surfaces())) == 6:\n- if dc2.top != dc1.top:\n- opes = ['S', 'E', 'S', 'E', 'S']\n- for op in opes:\n- dc2.rotate(op)\n- if dc2.top == dc1.top: break\n- for i in range(4):\n- if dc2.south == dc1.south:\n- break\n- dc2.rotate('R')\n- if (dc1.east == dc2.east) and (dc1.north == dc2.north) and (dc1.bottom == dc2.bottom):\n- judged = True\n \n if judged:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 15, "removed_lines": 11, "code1_lines": 47 }, { "user_id": "u362104929", "problem_id": "p02385", "submission1_id": "s948747161", "submission2_id": "s518318422", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Dice:\n def __init__(self):\n self.state =[1, 2, 3, 4, 5, 6]\n\n def setState(self, li): \n self.state = li\n\n def move(self, str_direction):\n if str_direction == \"N\":\n self.state = [self.state[1], self.state[5],self.state[2],\n self.state[3], self.state[0], self.state[4]]\n if str_direction == \"W\":\n self.state = [self.state[2], self.state[1], self.state[5],\n self.state[0], self.state[4], self.state[3]]\n if str_direction == \"E\":\n self.state = [self.state[3], self.state[1], self.state[0],\n self.state[5], self.state[4], self.state[2]]\n if str_direction == \"S\":\n self.state = [self.state[4], self.state[0], self.state[2],\n self.state[3], self.state[5], self.state[1]]\n\n def rotate(self):\n self.state = [self.state[0], self.state[2], self.state[1],\n self.state[4], self.state[3], self.state[5]]\n\n def sameDice1(self, dice1):\n set1 = list()\n for _ in range(4):\n set1.append({self.state[0], self.state[1], self.state[2]})\n set1.append({self.state[4], self.state[5], self.state[3]})\n self.move(\"N\")\n d1 = {dice1.state[0], dice1.state[1], dice1.state[2]}\n d2 = {dice1.state[4], dice1.state[5], dice1.state[3]}\n if d1 in set1 or d2 in set1:\n return \"Yes\"\n return \"No\"\n\n\ndef main():\n myd1, myd2 = Dice(), Dice()\n myd1.setState(list(map(int, input().split())))\n myd2.setState(list(map(int, input().split())))\n print(myd1.sameDice1(myd2))\n return\n\nif __name__ == \"__main__\":\n main()", "code2": "class Dice:\n def __init__(self):\n self.state =[1, 2, 3, 4, 5, 6]\n\n def setState(self, li): \n self.state = li\n\n def move(self, str_direction):\n if str_direction == \"N\":\n self.state = [self.state[1], self.state[5],self.state[2],\n self.state[3], self.state[0], self.state[4]]\n if str_direction == \"W\":\n self.state = [self.state[2], self.state[1], self.state[5],\n self.state[0], self.state[4], self.state[3]]\n if str_direction == \"E\":\n self.state = [self.state[3], self.state[1], self.state[0],\n self.state[5], self.state[4], self.state[2]]\n if str_direction == \"S\":\n self.state = [self.state[4], self.state[0], self.state[2],\n self.state[3], self.state[5], self.state[1]]\n\n def rotate(self):\n self.state = [self.state[0], self.state[2], self.state[4],\n self.state[1], self.state[3], self.state[5]]\n\n def sameDice1(self, dice1):\n set1 = list()\n for _ in range(4):\n for __ in range(4):\n set1.append(self.state)\n self.rotate()\n self.move(\"N\")\n self.move(\"E\")\n for _ in range(4):\n set1.append(self.state)\n self.rotate()\n self.move(\"E\")\n self.move(\"E\")\n for _ in range(4):\n set1.append(self.state)\n self.rotate()\n if dice1.state in set1:\n return \"Yes\"\n return \"No\"\n\n\ndef main():\n myd1, myd2 = Dice(), Dice()\n myd1.setState(list(map(int, input().split())))\n myd2.setState(list(map(int, input().split())))\n print(myd1.sameDice1(myd2))\n return\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1495279559", "date2": "1495281882", "bleu_score": "0.8746961718083223", "code1_test_status": [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, 0, 0, 0, 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], "code1_test_score": 94, "total_score": 102, "input": "1 2 3 2 5 6\n6 1 4 3 2 1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["class Dice: # (0): Dice=\n def __init__(self):\n self.state =[1, 2, 3, 4, 5, 6]\n\n def setState(self, li): \n self.state = li\n\n def move(self, str_direction):\n if str_direction == \"N\":\n self.state = [self.state[1], self.state[5],self.state[2],\n self.state[3], self.state[0], self.state[4]]\n if str_direction == \"W\":\n self.state = [self.state[2], self.state[1], self.state[5],\n self.state[0], self.state[4], self.state[3]]\n if str_direction == \"E\":\n self.state = [self.state[3], self.state[1], self.state[0],\n self.state[5], self.state[4], self.state[2]]\n if str_direction == \"S\":\n self.state = [self.state[4], self.state[0], self.state[2],\n self.state[3], self.state[5], self.state[1]]\n\n def rotate(self):\n self.state = [self.state[0], self.state[2], self.state[1],\n self.state[4], self.state[3], self.state[5]]\n\n def sameDice1(self, dice1):\n set1 = list()\n for _ in range(4):\n set1.append({self.state[0], self.state[1], self.state[2]})\n set1.append({self.state[4], self.state[5], self.state[3]})\n self.move(\"N\")\n d1 = {dice1.state[0], dice1.state[1], dice1.state[2]}\n d2 = {dice1.state[4], dice1.state[5], dice1.state[3]}\n if d1 in set1 or d2 in set1:\n return \"Yes\"\n return \"No\"\n\n\ndef main(): # (1): main=\n myd1, myd2 = Dice(), Dice()\n myd1.setState(list(map(int, input().split())))\n myd2.setState(list(map(int, input().split())))\n print(myd1.sameDice1(myd2))\n return\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " class Dice:\n def __init__(self):\n self.state =[1, 2, 3, 4, 5, 6]\n \n def setState(self, li): \n self.state = li\n \n def move(self, str_direction):\n if str_direction == \"N\":\n self.state = [self.state[1], self.state[5],self.state[2],\n self.state[3], self.state[0], self.state[4]]\n if str_direction == \"W\":\n self.state = [self.state[2], self.state[1], self.state[5],\n self.state[0], self.state[4], self.state[3]]\n if str_direction == \"E\":\n self.state = [self.state[3], self.state[1], self.state[0],\n self.state[5], self.state[4], self.state[2]]\n if str_direction == \"S\":\n self.state = [self.state[4], self.state[0], self.state[2],\n self.state[3], self.state[5], self.state[1]]\n \n def rotate(self):\n- self.state = [self.state[0], self.state[2], self.state[1],\n- self.state[4], self.state[3], self.state[5]]\n+ self.state = [self.state[0], self.state[2], self.state[4],\n+ self.state[1], self.state[3], self.state[5]]\n \n def sameDice1(self, dice1):\n set1 = list()\n for _ in range(4):\n- set1.append({self.state[0], self.state[1], self.state[2]})\n- set1.append({self.state[4], self.state[5], self.state[3]})\n+ for __ in range(4):\n+ set1.append(self.state)\n+ self.rotate()\n self.move(\"N\")\n- d1 = {dice1.state[0], dice1.state[1], dice1.state[2]}\n- d2 = {dice1.state[4], dice1.state[5], dice1.state[3]}\n- if d1 in set1 or d2 in set1:\n+ self.move(\"E\")\n+ for _ in range(4):\n+ set1.append(self.state)\n+ self.rotate()\n+ self.move(\"E\")\n+ self.move(\"E\")\n+ for _ in range(4):\n+ set1.append(self.state)\n+ self.rotate()\n+ if dice1.state in set1:\n return \"Yes\"\n return \"No\"\n \n \n def main():\n myd1, myd2 = Dice(), Dice()\n myd1.setState(list(map(int, input().split())))\n myd2.setState(list(map(int, input().split())))\n print(myd1.sameDice1(myd2))\n return\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " class Dice:\n def __init__(self):\n self.state =[1, 2, 3, 4, 5, 6]\n \n def setState(self, li): \n self.state = li\n \n def move(self, str_direction):\n if str_direction == \"N\":\n self.state = [self.state[1], self.state[5],self.state[2],\n self.state[3], self.state[0], self.state[4]]\n if str_direction == \"W\":\n self.state = [self.state[2], self.state[1], self.state[5],\n self.state[0], self.state[4], self.state[3]]\n if str_direction == \"E\":\n self.state = [self.state[3], self.state[1], self.state[0],\n self.state[5], self.state[4], self.state[2]]\n if str_direction == \"S\":\n self.state = [self.state[4], self.state[0], self.state[2],\n self.state[3], self.state[5], self.state[1]]\n \n def rotate(self):\n- self.state = [self.state[0], self.state[2], self.state[1],\n- self.state[4], self.state[3], self.state[5]]\n \n def sameDice1(self, dice1):\n set1 = list()\n for _ in range(4):\n- set1.append({self.state[0], self.state[1], self.state[2]})\n- set1.append({self.state[4], self.state[5], self.state[3]})\n self.move(\"N\")\n- d1 = {dice1.state[0], dice1.state[1], dice1.state[2]}\n- d2 = {dice1.state[4], dice1.state[5], dice1.state[3]}\n- if d1 in set1 or d2 in set1:\n return \"Yes\"\n return \"No\"\n \n \n def main():\n myd1, myd2 = Dice(), Dice()\n myd1.setState(list(map(int, input().split())))\n myd2.setState(list(map(int, input().split())))\n print(myd1.sameDice1(myd2))\n return\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 15, "removed_lines": 7, "code1_lines": 47 }, { "user_id": "u764759179", "problem_id": "p02385", "submission1_id": "s807573479", "submission2_id": "s351263585", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport random\n\n\nclass Dice() :\n\n mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),\n 'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1)}\n way = (\"N\",\"E\",\"W\",\"S\")\n\n def __init__(self, data):\n self.label = data\n\n def move(self, data):\n self.label = [self.label[idx] for idx in self.mask[data]]\n\n def get_up(self):\n return self.label[0]\n\n def compare(self, dice2):\n ok = False\n for i in range(1000):\n check = True\n for i2 in range(6):\n if self.label[i2] == dice2.label[i2] :\n continue\n else:\n check = False\n break\n\n if check :\n ok = True\n break\n else:\n self.move(self.way[random.randint(0,3)])\n return ok\n\ndice1 = Dice(input().split())\ndice2 = Dice(input().split())\n\nif dice1.compare(dice2) :\n print (\"OK\")\nelse:\n print (\"NG\")\n", "code2": "\n\nimport random\n\n\nclass Dice() :\n\n mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),\n 'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1)}\n way = (\"N\",\"E\",\"W\",\"S\")\n\n def __init__(self, data):\n self.label = data\n\n def move(self, data):\n self.label = [self.label[idx] for idx in self.mask[data]]\n\n def get_up(self):\n return self.label[0]\n\n def compare(self, dice2):\n ok = False\n for i in range(1000):\n check = True\n for i2 in range(6):\n if self.label[i2] == dice2.label[i2] :\n continue\n else:\n check = False\n break\n\n if check :\n ok = True\n break\n else:\n self.move(self.way[random.randint(0,3)])\n return ok\n\ndice1 = Dice(input().split())\ndice2 = Dice(input().split())\n\nif dice1.compare(dice2) :\n print (\"Yes\")\nelse:\n print (\"No\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1558942620", "date2": "1558942662", "bleu_score": "0.9926990527068039", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2 0 0 85 -1\n5 0 1 1 16 4\n", "actual_output": "NG\n", "expected_output": "No\n\n", "anno_code": ["\n\nimport random\n\n\nclass Dice() : # (0): Dice=\n\n mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),\n 'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1)}\n way = (\"N\",\"E\",\"W\",\"S\")\n\n def __init__(self, data):\n self.label = data # (2): random=, Dice=, dice1= (4): random=, Dice=, dice1=, dice2=\n\n def move(self, data):\n self.label = [self.label[idx] for idx in self.mask[data]] # (15): dice2=, ok=False, i=0, check=False, i2=0 (24): dice2=, ok=False, i=1, check=False, i2=0 ... (9006): dice2=, ok=False, i=999, check=False, i2=0\n\n def get_up(self):\n return self.label[0]\n\n def compare(self, dice2):\n ok = False # (6): ok=False\n for i in range(1000): # (7): i=0 (16): i=1 ... (9007): random=, Dice=, dice1=\n check = True # (8): check=True (17): check=True ... (8999): check=True\n for i2 in range(6): # (9): i2=0 (18): NO CHANGE ... (9000): NO CHANGE\n if self.label[i2] == dice2.label[i2] : # (10): NO CHANGE (19): NO CHANGE ... (9001): NO CHANGE\n continue\n else:\n check = False # (11): check=False (20): check=False ... (9002): check=False\n break # (12): NO CHANGE (21): NO CHANGE ... (9003): NO CHANGE\n\n if check : # (13): NO CHANGE (22): NO CHANGE ... (9004): NO CHANGE\n ok = True\n break\n else:\n self.move(self.way[random.randint(0,3)]) # (14): data=N (23): data=N ... (9005): data=E\n return ok\n\ndice1 = Dice(input().split()) # (1): self=, data=['1', '2', '0', '0', '85', '-1']\ndice2 = Dice(input().split()) # (3): self=, data=['5', '0', '1', '1', '16', '4']\n\nif dice1.compare(dice2) : # (5): self=\n print (\"OK\")\nelse:\n print (\"NG\")\n"], "anno_status": [true], "diff_content": " \n \n import random\n \n \n class Dice() :\n \n mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),\n 'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1)}\n way = (\"N\",\"E\",\"W\",\"S\")\n \n def __init__(self, data):\n self.label = data\n \n def move(self, data):\n self.label = [self.label[idx] for idx in self.mask[data]]\n \n def get_up(self):\n return self.label[0]\n \n def compare(self, dice2):\n ok = False\n for i in range(1000):\n check = True\n for i2 in range(6):\n if self.label[i2] == dice2.label[i2] :\n continue\n else:\n check = False\n break\n \n if check :\n ok = True\n break\n else:\n self.move(self.way[random.randint(0,3)])\n return ok\n \n dice1 = Dice(input().split())\n dice2 = Dice(input().split())\n \n if dice1.compare(dice2) :\n- print (\"OK\")\n+ print (\"Yes\")\n else:\n- print (\"NG\")\n+ print (\"No\")\n \n", "FL_content": " \n \n import random\n \n \n class Dice() :\n \n mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),\n 'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1)}\n way = (\"N\",\"E\",\"W\",\"S\")\n \n def __init__(self, data):\n self.label = data\n \n def move(self, data):\n self.label = [self.label[idx] for idx in self.mask[data]]\n \n def get_up(self):\n return self.label[0]\n \n def compare(self, dice2):\n ok = False\n for i in range(1000):\n check = True\n for i2 in range(6):\n if self.label[i2] == dice2.label[i2] :\n continue\n else:\n check = False\n break\n \n if check :\n ok = True\n break\n else:\n self.move(self.way[random.randint(0,3)])\n return ok\n \n dice1 = Dice(input().split())\n dice2 = Dice(input().split())\n \n if dice1.compare(dice2) :\n- print (\"OK\")\n else:\n- print (\"NG\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 46 }, { "user_id": "u943057856", "problem_id": "p02640", "submission1_id": "s905250960", "submission2_id": "s323353051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\nfor i in range(100):\n if i*2+(x-i)*4==y:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "code2": "x,y=map(int,input().split())\nfor i in range(x+1):\n if i*2+(x-i)*4==y:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183044", "date2": "1592183456", "bleu_score": "0.9664917121101906", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 0, 0], "code1_test_score": 5, "total_score": 9, "input": "25 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=25, y=-2\nfor i in range(100): # (1): i=0 (3): i=1 ... (103): i=51\n if i*2+(x-i)*4==y: # (2): NO CHANGE (4): NO CHANGE ... (104): NO CHANGE\n print(\"Yes\") # (105): NO CHANGE\n break\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n-for i in range(100):\n+for i in range(x+1):\n if i*2+(x-i)*4==y:\n print(\"Yes\")\n break\n else:\n print(\"No\")\n", "FL_content": " x,y=map(int,input().split())\n-for i in range(100):\n if i*2+(x-i)*4==y:\n print(\"Yes\")\n break\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u856819253", "problem_id": "p02640", "submission1_id": "s861904966", "submission2_id": "s017128197", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI():return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS():return list(sys.stdin.readline().rstrip().split())\n\ndef main():\n X,Y = LI()[:]\n \n\n if ((Y-2*X) % 2) == 0:\n a = (Y-2*X) / 2\n if a<=X:\n print('Yes')\n exit()\n \n print('No')\n\nif __name__ == '__main__':\n\tmain()\n", "code2": "import sys\n\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI():return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS():return list(sys.stdin.readline().rstrip().split())\n\ndef main():\n X,Y = LI()[:]\n \n\n if ((Y-2*X) % 2) == 0:\n a = (Y-2*X) / 2\n if a<=X and a>=0:\n print('Yes')\n exit()\n \n print('No')\n\nif __name__ == '__main__':\n\tmain()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592184309", "date2": "1592184483", "bleu_score": "0.9720233513404029", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 9, "input": "51 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["import sys\n\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI():return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS():return list(sys.stdin.readline().rstrip().split())\n\ndef main(): # (0): main=\n X,Y = LI()[:]\n \n\n if ((Y-2*X) % 2) == 0:\n a = (Y-2*X) / 2\n if a<=X:\n print('Yes')\n exit()\n \n print('No')\n\nif __name__ == '__main__':\n\tmain()\n"], "anno_status": [true], "diff_content": " import sys\n \n def I(): return int(sys.stdin.readline().rstrip())\n def LI():return list(map(int,sys.stdin.readline().rstrip().split()))\n def LS():return list(sys.stdin.readline().rstrip().split())\n \n def main():\n X,Y = LI()[:]\n \n \n if ((Y-2*X) % 2) == 0:\n a = (Y-2*X) / 2\n- if a<=X:\n+ if a<=X and a>=0:\n print('Yes')\n exit()\n \n print('No')\n \n if __name__ == '__main__':\n \tmain()\n \n", "FL_content": " import sys\n \n def I(): return int(sys.stdin.readline().rstrip())\n def LI():return list(map(int,sys.stdin.readline().rstrip().split()))\n def LS():return list(sys.stdin.readline().rstrip().split())\n \n def main():\n X,Y = LI()[:]\n \n \n if ((Y-2*X) % 2) == 0:\n a = (Y-2*X) / 2\n- if a<=X:\n print('Yes')\n exit()\n \n print('No')\n \n if __name__ == '__main__':\n \tmain()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u927357863", "problem_id": "p02640", "submission1_id": "s241914799", "submission2_id": "s384039910", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\n\ncrane = (4 * X - Y) / 2\n\n\ndef is_integer_num(n):\n if isinstance(n, int):\n return True\n if isinstance(n, float):\n return n.is_integer()\n return False\n\n\nif is_integer_num(crane) and crane > 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "X, Y = map(int, input().split())\n\ncrane = (4 * X - Y) / 2\nturtle = (Y - 2 * X) / 2\n\n\ndef is_integer_num(n):\n if isinstance(n, int):\n return True\n if isinstance(n, float):\n return n.is_integer()\n return False\n\n\nif is_integer_num(crane) and crane >= 0 and is_integer_num(turtle) and turtle >= 0:\n print(\"Yes\")\n\nelse:\n print(\"No\")\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592185889", "date2": "1592188173", "bleu_score": "0.7967233763037294", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 9, "input": "16 -4\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=16, Y=-4\n\ncrane = (4 * X - Y) / 2 # (1): crane=34.0\n\n\ndef is_integer_num(n): # (2): is_integer_num=\n if isinstance(n, int): # (4): NO CHANGE\n return True\n if isinstance(n, float): # (5): X=16, Y=-4, crane=34.0, is_integer_num=\n return n.is_integer()\n return False\n\n\nif is_integer_num(crane) and crane > 0: # (3): n=34.0\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n \n crane = (4 * X - Y) / 2\n+turtle = (Y - 2 * X) / 2\n \n \n def is_integer_num(n):\n if isinstance(n, int):\n return True\n if isinstance(n, float):\n return n.is_integer()\n return False\n \n \n-if is_integer_num(crane) and crane > 0:\n+if is_integer_num(crane) and crane >= 0 and is_integer_num(turtle) and turtle >= 0:\n print(\"Yes\")\n+\n else:\n print(\"No\")\n \n", "FL_content": " X, Y = map(int, input().split())\n \n crane = (4 * X - Y) / 2\n \n \n def is_integer_num(n):\n if isinstance(n, int):\n return True\n if isinstance(n, float):\n return n.is_integer()\n return False\n \n \n-if is_integer_num(crane) and crane > 0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u072279123", "problem_id": "p02640", "submission1_id": "s075615060", "submission2_id": "s495705620", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y = map(int,input().split())\nif x==1 and y==2 and y==4:\n print(\"Yes\")\nelse:\n if y%2==1:\n print(\"No\")\n else:\n if y<=x*4:\n print(\"Yes\")\n else:\n print(\"No\")", "code2": "x,y = map(int,input().split())\nif x==1 and ( y==2 or y==4):\n print(\"Yes\")\nelse:\n if y%2==1:\n print(\"No\")\n else:\n if y<=x*4 and (y>=(x*2)):\n print(\"Yes\")\n else:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592271025", "date2": "1592271604", "bleu_score": "0.8839206786497831", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 9, "input": "16 -4\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x,y = map(int,input().split()) # (0): x=16, y=-4\nif x==1 and y==2 and y==4: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n if y%2==1: # (2): NO CHANGE\n print(\"No\")\n else:\n if y<=x*4: # (3): NO CHANGE\n print(\"Yes\")\n else:\n print(\"No\")"], "anno_status": [true], "diff_content": " x,y = map(int,input().split())\n-if x==1 and y==2 and y==4:\n+if x==1 and ( y==2 or y==4):\n print(\"Yes\")\n else:\n if y%2==1:\n print(\"No\")\n else:\n- if y<=x*4:\n+ if y<=x*4 and (y>=(x*2)):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " x,y = map(int,input().split())\n-if x==1 and y==2 and y==4:\n print(\"Yes\")\n else:\n if y%2==1:\n print(\"No\")\n else:\n- if y<=x*4:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u414376763", "problem_id": "p02640", "submission1_id": "s672365936", "submission2_id": "s099167236", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y = list(map(int,input().split()))\n\nif ((4 * x) - y) % 2 == 0 and y >= 2 * x and y >= 4 * x:\n print('Yes')\nelse:\n print('No')", "code2": "x,y = list(map(int,input().split()))\n\nif ((4 * x) - y) % 2 == 0 and y >= 2 * x and y <= 4 * x:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594664907", "date2": "1594664933", "bleu_score": "0.9804274240373088", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 8, "total_score": 9, "input": "5 110\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x,y = list(map(int,input().split())) # (0): x=5, y=110\n\nif ((4 * x) - y) % 2 == 0 and y >= 2 * x and y >= 4 * x: # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " x,y = list(map(int,input().split()))\n \n-if ((4 * x) - y) % 2 == 0 and y >= 2 * x and y >= 4 * x:\n+if ((4 * x) - y) % 2 == 0 and y >= 2 * x and y <= 4 * x:\n print('Yes')\n else:\n print('No')\n", "FL_content": " x,y = list(map(int,input().split()))\n \n-if ((4 * x) - y) % 2 == 0 and y >= 2 * x and y >= 4 * x:\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u305452255", "problem_id": "p02640", "submission1_id": "s025798421", "submission2_id": "s115830733", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\nif (y/2 - x) > x:\n print('No')\nelse:\n print('Yes')\n", "code2": "x, y = map(int, input().split())\n\nif 2*x <= y <= 4*x and y % 2 ==0 :\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594408320", "date2": "1594411269", "bleu_score": "0.7099792557219522", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 9, "input": "84 -1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=84, y=-1\n\nif (y/2 - x) > x: # (1): NO CHANGE\n print('No')\nelse:\n print('Yes')\n"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n \n-if (y/2 - x) > x:\n- print('No')\n-else:\n+if 2*x <= y <= 4*x and y % 2 ==0 :\n print('Yes')\n-\n+else:\n+ print('No')\n", "FL_content": " x, y = map(int, input().split())\n \n-if (y/2 - x) > x:\n- print('No')\n-else:\n print('Yes')\n-\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 7 }, { "user_id": "u698756732", "problem_id": "p02640", "submission1_id": "s549872887", "submission2_id": "s162097815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y = list(map(int, input(\"\").split()))\n\nif 4 * x < y:\n print(\"No\")\nelse:\n if y % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")", "code2": "x,y = list(map(int, input(\"\").split()))\n\nif 4 * x < y:\n print(\"No\")\nelse:\n if 2 * x <= y:\n if y % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183968", "date2": "1592187232", "bleu_score": "0.6897266457438931", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 9, "input": "32 -4\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x,y = list(map(int, input(\"\").split())) # (0): x=32, y=-4\n\nif 4 * x < y: # (1): NO CHANGE\n print(\"No\")\nelse:\n if y % 2 == 0: # (2): NO CHANGE\n print(\"Yes\")\n else:\n print(\"No\")"], "anno_status": [true], "diff_content": " x,y = list(map(int, input(\"\").split()))\n \n if 4 * x < y:\n print(\"No\")\n else:\n- if y % 2 == 0:\n- print(\"Yes\")\n+ if 2 * x <= y:\n+ if y % 2 == 0:\n+ print(\"Yes\")\n+ else:\n+ print(\"No\")\n else:\n print(\"No\")\n", "FL_content": " x,y = list(map(int, input(\"\").split()))\n \n if 4 * x < y:\n print(\"No\")\n else:\n- if y % 2 == 0:\n- print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u318233626", "problem_id": "p02640", "submission1_id": "s109942094", "submission2_id": "s732484489", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\ntmp = 4 * x - y\nf = 0\nif tmp % 2 == 0 and tmp >= 0:\n crane = tmp % 2\n turtle = x - crane\n if x >= 0:\n f = 1\n else:\n pass\nelse:\n pass\n\nif f == 1:\n print('Yes')\nelse: \n print('No')", "code2": "x, y = map(int, input().split())\n\ntmp = 4 * x - y\nf = 0\nif tmp % 2 == 0 and tmp >= 0:\n crane = tmp / 2\n turtle = x - crane\n if turtle >= 0:\n f = 1\n else:\n pass\nelse:\n pass\n\nif f == 1:\n print('Yes')\nelse: \n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183396", "date2": "1592183509", "bleu_score": "0.9599960233928906", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 9, "input": "25 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=25, y=-2\n\ntmp = 4 * x - y # (1): tmp=102\nf = 0 # (2): f=0\nif tmp % 2 == 0 and tmp >= 0: # (3): NO CHANGE\n crane = tmp % 2 # (4): crane=0\n turtle = x - crane # (5): turtle=25\n if x >= 0: # (6): NO CHANGE\n f = 1 # (7): f=1\n else:\n pass\nelse:\n pass\n\nif f == 1: # (8): NO CHANGE\n print('Yes')\nelse: \n print('No')"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n \n tmp = 4 * x - y\n f = 0\n if tmp % 2 == 0 and tmp >= 0:\n- crane = tmp % 2\n+ crane = tmp / 2\n turtle = x - crane\n- if x >= 0:\n+ if turtle >= 0:\n f = 1\n else:\n pass\n else:\n pass\n \n if f == 1:\n print('Yes')\n else: \n print('No')\n", "FL_content": " x, y = map(int, input().split())\n \n tmp = 4 * x - y\n f = 0\n if tmp % 2 == 0 and tmp >= 0:\n- crane = tmp % 2\n turtle = x - crane\n- if x >= 0:\n f = 1\n else:\n pass\n else:\n pass\n \n if f == 1:\n print('Yes')\n else: \n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u531599639", "problem_id": "p02640", "submission1_id": "s657574563", "submission2_id": "s870440792", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y = map(int, input().split())\nans=0\nfor i in range(x):\n if (y-i*2)/2<=x:\n ans=1\nif ans:\n print('Yes')\nelse:\n print('No')", "code2": "x,y = map(int, input().split())\nans=0\nfor i in range(x+1):\n if (y-4*i)\n ans=1\nprint('Yes' if ans else 'No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183482", "date2": "1592186514", "bleu_score": "0.7265418262737808", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 9, "input": "84 -1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x,y = map(int, input().split()) # (0): x=84, y=-1\nans=0 # (1): ans=0\nfor i in range(x): # (2): i=0 (5): i=1 ... (254): NO CHANGE\n if (y-i*2)/2<=x: # (3): NO CHANGE (6): NO CHANGE ... (252): NO CHANGE\n ans=1 # (4): ans=1 (7): NO CHANGE ... (253): NO CHANGE\nif ans: # (255): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " x,y = map(int, input().split())\n ans=0\n-for i in range(x):\n- if (y-i*2)/2<=x:\n+for i in range(x+1):\n+ if (y-4*i)\n ans=1\n-if ans:\n- print('Yes')\n-else:\n- print('No')\n+print('Yes' if ans else 'No')\n", "FL_content": " x,y = map(int, input().split())\n ans=0\n-for i in range(x):\n- if (y-i*2)/2<=x:\n ans=1\n-if ans:\n- print('Yes')\n-else:\n- print('No')\n", "added_lines": 3, "removed_lines": 6, "code1_lines": 9 }, { "user_id": "u961247631", "problem_id": "p02640", "submission1_id": "s639190006", "submission2_id": "s795187463", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input(). split ())\nif not a % 2 == 0 and not b % 2 == 0:\n print('NO')\nelif a > 100 or b > 100:\n print('NO')\nelif not isinstance(a, int) or not isinstance(b, int):\n print('NO')\nelif 2 * a <= b <= 4 * a:\n print('YES')\nelse:\n print('NO')", "code2": "a,b = map(int,input(). split ())\nif not b % 2 == 0:\n print('No')\nelif a > 100:\n print('No')\nelif b > 100:\n print('No')\nelif a < 1:\n print('No')\nelif b < 1:\n print('No')\nelif not isinstance(a, int):\n print('No')\nelif not isinstance(b, int):\n print('No')\nelif 2 * a <= b <= 4 * a:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592186085", "date2": "1592186589", "bleu_score": "0.6686224360853015", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 9, "input": "84 -1\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a,b = map(int,input(). split ()) # (0): a=84, b=-1\nif not a % 2 == 0 and not b % 2 == 0: # (1): NO CHANGE\n print('NO')\nelif a > 100 or b > 100: # (2): NO CHANGE\n print('NO')\nelif not isinstance(a, int) or not isinstance(b, int): # (3): NO CHANGE\n print('NO')\nelif 2 * a <= b <= 4 * a: # (4): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a,b = map(int,input(). split ())\n-if not a % 2 == 0 and not b % 2 == 0:\n- print('NO')\n-elif a > 100 or b > 100:\n- print('NO')\n-elif not isinstance(a, int) or not isinstance(b, int):\n- print('NO')\n+if not b % 2 == 0:\n+ print('No')\n+elif a > 100:\n+ print('No')\n+elif b > 100:\n+ print('No')\n+elif a < 1:\n+ print('No')\n+elif b < 1:\n+ print('No')\n+elif not isinstance(a, int):\n+ print('No')\n+elif not isinstance(b, int):\n+ print('No')\n elif 2 * a <= b <= 4 * a:\n- print('YES')\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": " a,b = map(int,input(). split ())\n-if not a % 2 == 0 and not b % 2 == 0:\n- print('NO')\n-elif a > 100 or b > 100:\n- print('NO')\n-elif not isinstance(a, int) or not isinstance(b, int):\n- print('NO')\n elif 2 * a <= b <= 4 * a:\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 16, "removed_lines": 8, "code1_lines": 11 }, { "user_id": "u050584166", "problem_id": "p02640", "submission1_id": "s159268133", "submission2_id": "s689848008", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int,input().split())\nif m <= 2**n and m%2 == 0 and m != 0:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "n, m = map(int,input().split())\n\nif m <= 4*n and m >= 2*n and m%2 == 0 and n <= 50 and n < m:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592186214", "date2": "1592187320", "bleu_score": "0.7612745397699942", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 9, "input": "32 -4\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["n, m = map(int,input().split()) # (0): n=32, m=-4\nif m <= 2**n and m%2 == 0 and m != 0: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " n, m = map(int,input().split())\n-if m <= 2**n and m%2 == 0 and m != 0:\n+\n+if m <= 4*n and m >= 2*n and m%2 == 0 and n <= 50 and n < m:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " n, m = map(int,input().split())\n-if m <= 2**n and m%2 == 0 and m != 0:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u383429137", "problem_id": "p02640", "submission1_id": "s579245405", "submission2_id": "s069420870", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y = map(int, input().split())\nif Y%2==1:\n print(\"NO\")\nelse:\n kame=Y\n Y-=(kame*4)\n turu=Y\n if (turu+kame)==X:\n print(\"Yes\")\n else:\n print('No')\n", "code2": "X,Y = map(int, input().split())\nif Y%2==1:\n print('No')\nelse:\n if X*2<=Y and Y<=X*4:\n print('Yes')\n else:\n print('No')\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592627635", "date2": "1592629156", "bleu_score": "0.6387991232763015", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1], "code1_test_score": 6, "total_score": 9, "input": "5 101\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["X,Y = map(int, input().split()) # (0): X=5, Y=101\nif Y%2==1: # (1): NO CHANGE\n print(\"NO\")\nelse:\n kame=Y\n Y-=(kame*4)\n turu=Y\n if (turu+kame)==X:\n print(\"Yes\")\n else:\n print('No')\n"], "anno_status": [true], "diff_content": " X,Y = map(int, input().split())\n if Y%2==1:\n- print(\"NO\")\n+ print('No')\n else:\n- kame=Y\n- Y-=(kame*4)\n- turu=Y\n- if (turu+kame)==X:\n- print(\"Yes\")\n+ if X*2<=Y and Y<=X*4:\n+ print('Yes')\n else:\n print('No')\n \n", "FL_content": " X,Y = map(int, input().split())\n if Y%2==1:\n- print(\"NO\")\n else:\n- kame=Y\n- Y-=(kame*4)\n- turu=Y\n- if (turu+kame)==X:\n- print(\"Yes\")\n else:\n print('No')\n \n", "added_lines": 3, "removed_lines": 6, "code1_lines": 12 }, { "user_id": "u675168568", "problem_id": "p02640", "submission1_id": "s008752760", "submission2_id": "s858238007", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\nif (4*x >= y and y%2 == 0):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "x, y = map(int, input().split())\n\nif (4*x >= y >= 2*x and y % 2 == 0):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183684", "date2": "1592183909", "bleu_score": "0.8796877939315182", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 9, "input": "32 -4\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=32, y=-4\n\nif (4*x >= y and y%2 == 0): # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n \n-if (4*x >= y and y%2 == 0):\n+if (4*x >= y >= 2*x and y % 2 == 0):\n print(\"Yes\")\n else:\n print(\"No\")\n+\n", "FL_content": " x, y = map(int, input().split())\n \n-if (4*x >= y and y%2 == 0):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u014139588", "problem_id": "p02640", "submission1_id": "s371483577", "submission2_id": "s373943511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\nif y%2 == 1:\n print(\"NO\")\nelse:\n if y >= 2*x and y <= 4*x:\n print(\"Yes\")\n else:\n print(\"No\")", "code2": "x, y = map(int, input().split())\nif y%2 == 1:\n print(\"No\")\nelse:\n if y >= 2*x and y <= 4*x:\n print(\"Yes\")\n else:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183475", "date2": "1592183573", "bleu_score": "0.9810218387623372", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1], "code1_test_score": 6, "total_score": 9, "input": "126 -1\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=126, y=-1\nif y%2 == 1: # (1): NO CHANGE\n print(\"NO\")\nelse:\n if y >= 2*x and y <= 4*x:\n print(\"Yes\")\n else:\n print(\"No\")"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n if y%2 == 1:\n- print(\"NO\")\n+ print(\"No\")\n else:\n if y >= 2*x and y <= 4*x:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " x, y = map(int, input().split())\n if y%2 == 1:\n- print(\"NO\")\n else:\n if y >= 2*x and y <= 4*x:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u925406312", "problem_id": "p02640", "submission1_id": "s005534087", "submission2_id": "s395422378", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split())\n\nturu = 2\nkame = 4\nflag =0\n\nfor x in range(a + 1):\n for y in range(a + 1):\n if kame * x + turu * y == b or x + y <= a:\n flag += 1\n\nif flag == 0:\n print(\"No\")\nelse:\n print(\"Yes\")", "code2": "\nX,Y = map(int,input().split())\n\nturu = 2\nkame = 4\nflag = False\nfor i in range(0, X + 1): \n \n turu_num = X - i\n \n leg_total = kame * i + turu_num * turu\n \n if(leg_total == Y):\n flag = True\n break\n\n\n\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592188380", "date2": "1592191345", "bleu_score": "0.6193777404152876", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 9, "input": "51 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a,b = map(int,input().split()) # (0): a=51, b=-2\n\nturu = 2 # (1): turu=2\nkame = 4 # (2): kame=4\nflag =0 # (3): flag=0\n\nfor x in range(a + 1): # (4): x=0 (162): x=1 ... (6894): NO CHANGE\n for y in range(a + 1): # (5): y=0 (8): y=1 ... (6893): NO CHANGE\n if kame * x + turu * y == b or x + y <= a: # (6): NO CHANGE (9): NO CHANGE ... (6892): NO CHANGE\n flag += 1 # (7): flag=1 (10): flag=2 ... (6790): flag=1378\n\nif flag == 0: # (6895): NO CHANGE\n print(\"No\")\nelse:\n print(\"Yes\")"], "anno_status": [true], "diff_content": "-a,b = map(int,input().split())\n+\n+X,Y = map(int,input().split())\n \n turu = 2\n kame = 4\n-flag =0\n+flag = False\n+for i in range(0, X + 1): \n+ \n+ turu_num = X - i\n+ \n+ leg_total = kame * i + turu_num * turu\n+ \n+ if(leg_total == Y):\n+ flag = True\n+ break\n \n-for x in range(a + 1):\n- for y in range(a + 1):\n- if kame * x + turu * y == b or x + y <= a:\n- flag += 1\n \n-if flag == 0:\n- print(\"No\")\n-else:\n+\n+\n+if flag:\n print(\"Yes\")\n+else:\n+ print(\"No\")\n", "FL_content": "-a,b = map(int,input().split())\n \n turu = 2\n kame = 4\n-flag =0\n \n-for x in range(a + 1):\n- for y in range(a + 1):\n- if kame * x + turu * y == b or x + y <= a:\n- flag += 1\n \n-if flag == 0:\n- print(\"No\")\n-else:\n print(\"Yes\")\n", "added_lines": 17, "removed_lines": 9, "code1_lines": 15 }, { "user_id": "u307083029", "problem_id": "p02640", "submission1_id": "s592284084", "submission2_id": "s311598850", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\nans = 'no'\nfor a in range(x + 1):\n b = x - a\n if 2*a + 4*b == y:\n ans = 'yes'\nprint(ans)", "code2": "x, y = map(int, input().split())\nans = 'No'\nfor a in range(x + 1):\n b = x - a\n if 2*a + 4*b == y:\n ans = 'Yes'\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592341971", "date2": "1592342087", "bleu_score": "0.961965303348603", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 9, "input": "51 -2\n", "actual_output": "no\n", "expected_output": "No\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=51, y=-2\nans = 'no' # (1): ans=no\nfor a in range(x + 1): # (2): a=0 (5): a=1 ... (158): NO CHANGE\n b = x - a # (3): b=51 (6): b=50 ... (156): b=0\n if 2*a + 4*b == y: # (4): NO CHANGE (7): NO CHANGE ... (157): NO CHANGE\n ans = 'yes'\nprint(ans)"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n-ans = 'no'\n+ans = 'No'\n for a in range(x + 1):\n b = x - a\n if 2*a + 4*b == y:\n- ans = 'yes'\n+ ans = 'Yes'\n print(ans)\n", "FL_content": " x, y = map(int, input().split())\n-ans = 'no'\n for a in range(x + 1):\n b = x - a\n if 2*a + 4*b == y:\n- ans = 'yes'\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u740267532", "problem_id": "p02640", "submission1_id": "s535970343", "submission2_id": "s779970403", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def animal(x,y):\n if x*4 >= y:\n return \"Yes\"\n return \"No\"\n\nif __name__ == \"__main__\":\n x,y = map(int,input().split())\n print(animal(x,y))", "code2": "def animal(x,y):\n if x*4==y or x*2==y:\n return \"Yes\"\n for i in range(1,x+1):\n if ((x-i)*4 + i*2) == y:\n return \"Yes\"\n return \"No\"\n\nif __name__ == \"__main__\":\n x,y = map(int,input().split())\n print(animal(x,y))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183669", "date2": "1592186826", "bleu_score": "0.6130482765526832", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 9, "input": "126 -1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["def animal(x,y): # (0): animal=\n if x*4 >= y:\n return \"Yes\"\n return \"No\"\n\nif __name__ == \"__main__\":\n x,y = map(int,input().split())\n print(animal(x,y))"], "anno_status": [true], "diff_content": " def animal(x,y):\n- if x*4 >= y:\n+ if x*4==y or x*2==y:\n return \"Yes\"\n+ for i in range(1,x+1):\n+ if ((x-i)*4 + i*2) == y:\n+ return \"Yes\"\n return \"No\"\n \n if __name__ == \"__main__\":\n x,y = map(int,input().split())\n print(animal(x,y))\n", "FL_content": " def animal(x,y):\n- if x*4 >= y:\n return \"Yes\"\n return \"No\"\n \n if __name__ == \"__main__\":\n x,y = map(int,input().split())\n print(animal(x,y))\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u141610915", "problem_id": "p02640", "submission1_id": "s090434195", "submission2_id": "s466829690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nX, Y = map(int, input().split())\nfor i in range(101):\n j = X - i\n if i * 2 + j * 4 == Y:\n print(\"Yes\")\n exit(0)\nprint(\"No\")", "code2": "import sys\ninput = sys.stdin.readline\nX, Y = map(int, input().split())\nfor i in range(X + 1):\n j = X - i\n if i * 2 + j * 4 == Y:\n print(\"Yes\")\n exit(0)\nprint(\"No\")", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592183076", "date2": "1592183227", "bleu_score": "0.9674827255728391", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 0, 0], "code1_test_score": 5, "total_score": 9, "input": "32 -4\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n X, Y = map(int, input().split())\n-for i in range(101):\n+for i in range(X + 1):\n j = X - i\n if i * 2 + j * 4 == Y:\n print(\"Yes\")\n exit(0)\n print(\"No\")\n", "FL_content": " import sys\n input = sys.stdin.readline\n X, Y = map(int, input().split())\n-for i in range(101):\n j = X - i\n if i * 2 + j * 4 == Y:\n print(\"Yes\")\n exit(0)\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u729627789", "problem_id": "p02640", "submission1_id": "s723803678", "submission2_id": "s153660417", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\nret = 'No'\nfor i in range(x):\n rem = y - 2*i\n if rem%4 == 0:\n ret = 'Yes'\n break\nprint(ret)", "code2": "x, y = map(int, input().split())\nret = 'No'\nfor i in range(x+1):\n rem = y - 2*i\n if 4*(x - i) == rem:\n ret = 'Yes'\n break\nprint(ret)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595041948", "date2": "1595042136", "bleu_score": "0.8929396859579817", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 9, "input": "16 -4\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=16, y=-4\nret = 'No' # (1): ret=No\nfor i in range(x): # (2): i=0\n rem = y - 2*i # (3): rem=-4\n if rem%4 == 0: # (4): NO CHANGE\n ret = 'Yes' # (5): ret=Yes\n break # (6): NO CHANGE\nprint(ret)"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n ret = 'No'\n-for i in range(x):\n+for i in range(x+1):\n rem = y - 2*i\n- if rem%4 == 0:\n+ if 4*(x - i) == rem:\n ret = 'Yes'\n break\n print(ret)\n", "FL_content": " x, y = map(int, input().split())\n ret = 'No'\n-for i in range(x):\n rem = y - 2*i\n- if rem%4 == 0:\n ret = 'Yes'\n break\n print(ret)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u706377526", "problem_id": "p02640", "submission1_id": "s596836110", "submission2_id": "s737118194", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nlst = s.split()\n\nex1 = int(lst[0])\nex2 = int(lst[1])\nret = \"no\"\n\nfor i in range(ex1+1):\n if 4 * (ex1 - i) + 2 * i == ex2:\n ret= \"yes\"\n\nprint(ret)\n", "code2": "s = input()\nlst = s.split()\n\nex1 = int(lst[0])\nex2 = int(lst[1])\nret = \"No\"\n\nfor i in range(ex1+1):\n if 4 * (ex1 - i) + 2 * i == ex2:\n ret= \"Yes\"\n\nprint(ret)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592185708", "date2": "1592185763", "bleu_score": "0.9697825953766553", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 9, "input": "5 110\n", "actual_output": "no\n", "expected_output": "No\n\n", "anno_code": ["s = input() # (0): s=5 110\nlst = s.split() # (1): lst=['5', '110']\n\nex1 = int(lst[0]) # (2): ex1=5\nex2 = int(lst[1]) # (3): ex2=110\nret = \"no\" # (4): ret=no\n\nfor i in range(ex1+1): # (5): i=0 (7): i=1 ... (17): NO CHANGE\n if 4 * (ex1 - i) + 2 * i == ex2: # (6): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n ret= \"yes\"\n\nprint(ret)\n"], "anno_status": [true], "diff_content": " s = input()\n lst = s.split()\n \n ex1 = int(lst[0])\n ex2 = int(lst[1])\n-ret = \"no\"\n+ret = \"No\"\n \n for i in range(ex1+1):\n if 4 * (ex1 - i) + 2 * i == ex2:\n- ret= \"yes\"\n+ ret= \"Yes\"\n \n print(ret)\n \n", "FL_content": " s = input()\n lst = s.split()\n \n ex1 = int(lst[0])\n ex2 = int(lst[1])\n-ret = \"no\"\n \n for i in range(ex1+1):\n if 4 * (ex1 - i) + 2 * i == ex2:\n- ret= \"yes\"\n \n print(ret)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u337802798", "problem_id": "p02633", "submission1_id": "s831108651", "submission2_id": "s043708320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a,b):\n if b == 0:return a\n return gcd(b,a%b)\n\na = int(input())\nprint(360/gcd(360,a))", "code2": "def gcd(a,b):\n if b == 0:return a\n return gcd(b,a%b)\n \na = int(input())\nprint(360\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592797040", "date2": "1592797067", "bleu_score": "0.8498401049952939", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "578\n", "actual_output": "180.0\n", "expected_output": "180\n\n", "anno_code": ["def gcd(a,b): # (0): gcd=\n if b == 0:return a\n return gcd(b,a%b)\n\na = int(input()) # (1): a=578\nprint(360/gcd(360,a))"], "anno_status": [true], "diff_content": " def gcd(a,b):\n if b == 0:return a\n return gcd(b,a%b)\n-\n+ \n a = int(input())\n-print(360/gcd(360,a))\n+print(360\n+\n", "FL_content": " def gcd(a,b):\n if b == 0:return a\n return gcd(b,a%b)\n-\n a = int(input())\n-print(360/gcd(360,a))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u425758699", "problem_id": "p02633", "submission1_id": "s325562347", "submission2_id": "s516915683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor i in range(360):\n if (i*n+n)%360==0:\n print(i)\n break", "code2": "n=int(input())\nfor i in range(360):\n if (i*n+n)%360==0:\n print(i+1)\n break", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592710681", "date2": "1592710723", "bleu_score": "0.9556553821185526", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "537\n", "actual_output": "119\n", "expected_output": "120\n\n", "anno_code": ["n=int(input()) # (0): n=537\nfor i in range(360): # (1): i=0 (3): i=1 ... (239): i=119\n if (i*n+n)%360==0: # (2): NO CHANGE (4): NO CHANGE ... (240): NO CHANGE\n print(i) # (241): NO CHANGE\n break"], "anno_status": [true], "diff_content": " n=int(input())\n for i in range(360):\n if (i*n+n)%360==0:\n- print(i)\n+ print(i+1)\n break\n", "FL_content": " n=int(input())\n for i in range(360):\n if (i*n+n)%360==0:\n- print(i)\n break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u771710924", "problem_id": "p02633", "submission1_id": "s376609535", "submission2_id": "s650006922", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\ndef main():\n x = int(input())\n ans = 360 \n print(ans)\n return\n\nif __name__ == \"__main__\":\n main()", "code2": "\n\n\n\n\n\n\ndef main():\n x = int(input())\n k = 1\n while ( x * k ) % 360:\n k += 1\n print(k)\n return\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596899815", "date2": "1596900035", "bleu_score": "0.6908491110816898", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0], "code1_test_score": 5, "total_score": 33, "input": "350\n", "actual_output": "360\n", "expected_output": "36\n\n", "anno_code": ["\n\n\n\n\n\n\ndef main(): # (0): main=\n x = int(input())\n ans = 360 \n print(ans)\n return\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n def main():\n x = int(input())\n- ans = 360 \n- print(ans)\n+ k = 1\n+ while ( x * k ) % 360:\n+ k += 1\n+ print(k)\n return\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " \n \n \n \n \n \n \n def main():\n x = int(input())\n- ans = 360 \n- print(ans)\n return\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u923172145", "problem_id": "p02633", "submission1_id": "s668552665", "submission2_id": "s132851538", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X = int(input())\n\nK = 1\ndire = X\nwhile True:\n if (dire % 180) == 0:\n break\n K+=1\n dire+=X\n\n \nprint(K)", "code2": "X = int(input())\n\nK = 1\ndire = X\nwhile True:\n if (dire % 360) == 0:\n break\n K+=1\n dire+=X\n\n \nprint(K)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592702044", "date2": "1592702087", "bleu_score": "0.9669614708424826", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 8, "total_score": 33, "input": "2579\n", "actual_output": "180\n", "expected_output": "360\n\n", "anno_code": ["X = int(input()) # (0): X=2579\n\nK = 1 # (1): K=1\ndire = X # (2): dire=2579\nwhile True: # (3): NO CHANGE (7): NO CHANGE ... (719): NO CHANGE\n if (dire % 180) == 0: # (4): NO CHANGE (8): NO CHANGE ... (720): NO CHANGE\n break # (721): NO CHANGE\n K+=1 # (5): K=2 (9): K=3 ... (717): K=180\n dire+=X # (6): dire=5158 (10): dire=7737 ... (718): dire=464220\n\n \nprint(K)"], "anno_status": [true], "diff_content": " X = int(input())\n \n K = 1\n dire = X\n while True:\n- if (dire % 180) == 0:\n+ if (dire % 360) == 0:\n break\n K+=1\n dire+=X\n \n \n print(K)\n", "FL_content": " X = int(input())\n \n K = 1\n dire = X\n while True:\n- if (dire % 180) == 0:\n break\n K+=1\n dire+=X\n \n \n print(K)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u008323723", "problem_id": "p02633", "submission1_id": "s651616773", "submission2_id": "s452873202", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X= int(input())\n\nif 360 % X != 0:\n print(360)\nelse:\n print(int(360/X))", "code2": "import math\n\nX= int(input())\ng = math.gcd(360,X)\n\nif 360 % g != 0:\n print(360)\nelse:\n print(int(360/g))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592704272", "date2": "1592705016", "bleu_score": "0.6366551535097623", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0], "code1_test_score": 5, "total_score": 33, "input": "1162\n", "actual_output": "360\n", "expected_output": "180\n\n", "anno_code": ["X= int(input()) # (0): X=1162\n\nif 360 % X != 0: # (1): NO CHANGE\n print(360)\nelse:\n print(int(360/X))"], "anno_status": [true], "diff_content": "+import math\n+\n X= int(input())\n+g = math.gcd(360,X)\n \n-if 360 % X != 0:\n+if 360 % g != 0:\n print(360)\n else:\n- print(int(360/X))\n+ print(int(360/g))\n", "FL_content": " X= int(input())\n \n-if 360 % X != 0:\n print(360)\n else:\n- print(int(360/X))\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u025363805", "problem_id": "p02633", "submission1_id": "s866307059", "submission2_id": "s763006949", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = 0\nfor i in range(1,361):\n i += 1\n ans = i * a\n if ans == 360:\n print(int(i))\n", "code2": "a = int(input())\nfor i in range(1,361):\n if i * a % 360 == 0:\n print(int(i))\n break\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592712124", "date2": "1592712419", "bleu_score": "0.7443888567870748", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "1874\n", "actual_output": "no output\n", "expected_output": "180\n\n", "anno_code": ["a = int(input()) # (0): a=1874\nb = 0 # (1): b=0\nfor i in range(1,361): # (2): i=1 (6): NO CHANGE ... (1438): NO CHANGE\n i += 1 # (3): i=2 (7): i=3 ... (1439): i=361\n ans = i * a # (4): ans=3748 (8): ans=5622 ... (1440): ans=676514\n if ans == 360: # (5): NO CHANGE (9): NO CHANGE ... (1441): NO CHANGE\n print(int(i))\n"], "anno_status": [true], "diff_content": " a = int(input())\n-b = 0\n for i in range(1,361):\n- i += 1\n- ans = i * a\n- if ans == 360:\n+ if i * a % 360 == 0:\n print(int(i))\n+ break\n \n", "FL_content": " a = int(input())\n-b = 0\n for i in range(1,361):\n- i += 1\n- ans = i * a\n- if ans == 360:\n print(int(i))\n \n", "added_lines": 2, "removed_lines": 4, "code1_lines": 8 }, { "user_id": "u329865314", "problem_id": "p02633", "submission1_id": "s118468146", "submission2_id": "s338186506", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nx = 0\ni = 1\nwhile(1):\n x += a\n i += 1\n x %= 360\n if x:\n continue\n else:\n print(i)\n quit()", "code2": "a=int(input())\nx = 0\ni = 0\nwhile(1):\n x += a\n i += 1\n x %= 360\n if x:\n continue\n else:\n print(i)\n quit()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597029272", "date2": "1597029303", "bleu_score": "0.9783975498178012", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "1369\n", "actual_output": "361\n", "expected_output": "360\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " a=int(input())\n x = 0\n-i = 1\n+i = 0\n while(1):\n x += a\n i += 1\n x %= 360\n if x:\n continue\n else:\n print(i)\n quit()\n", "FL_content": " a=int(input())\n x = 0\n-i = 1\n while(1):\n x += a\n i += 1\n x %= 360\n if x:\n continue\n else:\n print(i)\n quit()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u109879985", "problem_id": "p02633", "submission1_id": "s632306673", "submission2_id": "s950448589", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import gcd\nx=int(input())\ng=gcd(360,x)\nprint(360/g)\n ", "code2": "import math\nx=int(input())\ng=math.gcd(360,x)\nprint(360", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600136448", "date2": "1600136688", "bleu_score": "0.6929541330490929", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "536\n", "actual_output": "45.0\n", "expected_output": "45\n\n", "anno_code": ["from math import gcd\nx=int(input()) # (0): x=536\ng=gcd(360,x) # (1): g=8\nprint(360/g)\n "], "anno_status": [true], "diff_content": "-from math import gcd\n+import math\n x=int(input())\n-g=gcd(360,x)\n-print(360/g)\n- \n+g=math.gcd(360,x)\n+print(360\n", "FL_content": "-from math import gcd\n x=int(input())\n-g=gcd(360,x)\n-print(360/g)\n- \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 5 }, { "user_id": "u916242112", "problem_id": "p02633", "submission1_id": "s071660631", "submission2_id": "s746966101", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X=int(input())\nY =360\nwhile 1:\n\tif Y % X == 0:\n\t\tprint(Y/X)\n\t\tbreak\n\telse:\n\t\tY += 360", "code2": "X=int(input())\nY =360\nwhile 1:\n\tif Y % X == 0:\n\t\tprint(Y\n\t\tbreak\n\telse:\n\t\tY += 360\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592879961", "date2": "1592880051", "bleu_score": "0.9459568875194339", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "690\n", "actual_output": "12.0\n", "expected_output": "12\n\n", "anno_code": ["X=int(input()) # (0): X=690\nY =360 # (1): Y=360\nwhile 1: # (2): NO CHANGE (5): NO CHANGE ... (68): NO CHANGE\n\tif Y % X == 0: # (3): NO CHANGE (6): NO CHANGE ... (69): NO CHANGE\n\t\tprint(Y/X) # (70): NO CHANGE\n\t\tbreak\n\telse:\n\t\tY += 360 # (4): Y=720 (7): Y=1080 ... (67): Y=8280\n"], "anno_status": [true], "diff_content": " X=int(input())\n Y =360\n while 1:\n \tif Y % X == 0:\n-\t\tprint(Y/X)\n+\t\tprint(Y\n \t\tbreak\n \telse:\n \t\tY += 360\n+\n", "FL_content": " X=int(input())\n Y =360\n while 1:\n \tif Y % X == 0:\n-\t\tprint(Y/X)\n \t\tbreak\n \telse:\n \t\tY += 360\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u241577413", "problem_id": "p02633", "submission1_id": "s561353059", "submission2_id": "s498344766", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\n\nx = a\ni = 1\n\nwhile x % 180 != 0:\n x += a\n i += 1\n\nprint(i*2)", "code2": "a = int(input())\n\nx = a\ni = 1\n\nwhile x % 360 != 0:\n x += a\n i += 1\n\nprint(i)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592705851", "date2": "1592706016", "bleu_score": "0.9239419228551026", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 33, "input": "1168\n", "actual_output": "90\n", "expected_output": "45\n\n", "anno_code": ["a = int(input()) # (0): a=1168\n\nx = a # (1): x=1168\ni = 1 # (2): i=1\n\nwhile x % 180 != 0: # (3): NO CHANGE (6): NO CHANGE ... (135): NO CHANGE\n x += a # (4): x=2336 (7): x=3504 ... (133): x=52560\n i += 1 # (5): i=2 (8): i=3 ... (134): i=45\n\nprint(i*2)"], "anno_status": [true], "diff_content": " a = int(input())\n \n x = a\n i = 1\n \n-while x % 180 != 0:\n+while x % 360 != 0:\n x += a\n i += 1\n \n-print(i*2)\n+print(i)\n", "FL_content": " a = int(input())\n \n x = a\n i = 1\n \n-while x % 180 != 0:\n x += a\n i += 1\n \n-print(i*2)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u976420902", "problem_id": "p02633", "submission1_id": "s405458206", "submission2_id": "s336029212", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import ceil\nx = int(input())\nprint(ceil(360/x))\n", "code2": "from math import ceil\nx = int(input())\nn = 360\nwhile(n%x):\n\tn+=360\n\nprint(n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592702037", "date2": "1592702322", "bleu_score": "0.6281248979268252", "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, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 33, "input": "2383\n", "actual_output": "1\n", "expected_output": "360\n\n", "anno_code": ["from math import ceil\nx = int(input()) # (0): x=2383\nprint(ceil(360/x))\n"], "anno_status": [true], "diff_content": " from math import ceil\n x = int(input())\n-print(ceil(360/x))\n+n = 360\n+while(n%x):\n+\tn+=360\n \n+print(n\n", "FL_content": " from math import ceil\n x = int(input())\n-print(ceil(360/x))\n \n", "added_lines": 4, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u790710233", "problem_id": "p02633", "submission1_id": "s620363982", "submission2_id": "s920182060", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = int(input())\n\nfor n in range(1, 10000):\n k, y = divmod(360*n, (180-x))\n if y == 0:\n print(k)\n break\n", "code2": "x = int(input())\n\nfor k in range(1, 10000):\n if x*k % 360 == 0:\n print(k)\n break\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592846225", "date2": "1592846523", "bleu_score": "0.6857181189942488", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "1527\n", "actual_output": "-120\n", "expected_output": "120\n\n", "anno_code": ["x = int(input()) # (0): x=1527\n\nfor n in range(1, 10000): # (1): n=1 (4): n=2 ... (1345): n=449\n k, y = divmod(360*n, (180-x)) # (2): k=-1, y=-987 (5): y=-627 ... (1346): y=0\n if y == 0: # (3): NO CHANGE (6): NO CHANGE ... (1347): NO CHANGE\n print(k) # (1348): NO CHANGE\n break\n"], "anno_status": [true], "diff_content": " x = int(input())\n \n-for n in range(1, 10000):\n- k, y = divmod(360*n, (180-x))\n- if y == 0:\n+for k in range(1, 10000):\n+ if x*k % 360 == 0:\n print(k)\n break\n \n", "FL_content": " x = int(input())\n \n-for n in range(1, 10000):\n- k, y = divmod(360*n, (180-x))\n- if y == 0:\n print(k)\n break\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u455408345", "problem_id": "p02633", "submission1_id": "s056242420", "submission2_id": "s583962089", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x=int(input(\"\"))\nimport math\na=math.gcd(360,x)\nprint(int(360*x/a/a))", "code2": "x=int(input(\"\"))\nimport math\na=math.gcd(360,x)\nprint(int(360/a))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594350562", "date2": "1594350665", "bleu_score": "0.9168261117417812", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "408\n", "actual_output": "255\n", "expected_output": "15\n\n", "anno_code": ["x=int(input(\"\")) # (0): x=408, math=\nimport math\na=math.gcd(360,x) # (1): a=24\nprint(int(360*x/a/a))"], "anno_status": [true], "diff_content": " x=int(input(\"\"))\n import math\n a=math.gcd(360,x)\n-print(int(360*x/a/a))\n+print(int(360/a))\n+\n", "FL_content": " x=int(input(\"\"))\n import math\n a=math.gcd(360,x)\n-print(int(360*x/a/a))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u658905620", "problem_id": "p02633", "submission1_id": "s817415968", "submission2_id": "s590182223", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X=int(input())\nK=0\na=0\nwhile True:\n a+=X\n K+=1\n if K%360==0:\n break\nprint(K)", "code2": "X=int(input())\nK=0\na=0\nwhile True:\n a+=X\n K+=1\n if a%360==0:\n break\nprint(K)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596665818", "date2": "1596665858", "bleu_score": "0.9686391926502761", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0], "code1_test_score": 5, "total_score": 33, "input": "690\n", "actual_output": "360\n", "expected_output": "12\n\n", "anno_code": ["X=int(input()) # (0): X=690\nK=0 # (1): K=0\na=0 # (2): a=0\nwhile True: # (3): NO CHANGE (7): NO CHANGE ... (1439): NO CHANGE\n a+=X # (4): a=690 (8): a=1380 ... (1440): a=248400\n K+=1 # (5): K=1 (9): K=2 ... (1441): K=360\n if K%360==0: # (6): NO CHANGE (10): NO CHANGE ... (1442): NO CHANGE\n break # (1443): NO CHANGE\nprint(K)"], "anno_status": [true], "diff_content": " X=int(input())\n K=0\n a=0\n while True:\n a+=X\n K+=1\n- if K%360==0:\n+ if a%360==0:\n break\n print(K)\n", "FL_content": " X=int(input())\n K=0\n a=0\n while True:\n a+=X\n K+=1\n- if K%360==0:\n break\n print(K)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u998733244", "problem_id": "p02633", "submission1_id": "s404472021", "submission2_id": "s695599176", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nX = int(input())\n\nindex = 1\nwhile True:\n if X * index % 180 == 0:\n print(index*2)\n break\n index += 1\n", "code2": "\n\nX = int(input())\n\nindex = 1\nwhile True:\n if X * index % 360 == 0:\n print(index)\n break\n index += 1\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592786932", "date2": "1592786989", "bleu_score": "0.9420884998548767", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 33, "input": "536\n", "actual_output": "90\n", "expected_output": "45\n\n", "anno_code": ["\n\nX = int(input()) # (0): X=536\n\nindex = 1 # (1): index=1\nwhile True: # (2): NO CHANGE (5): NO CHANGE ... (134): NO CHANGE\n if X * index % 180 == 0: # (3): NO CHANGE (6): NO CHANGE ... (135): NO CHANGE\n print(index*2) # (136): NO CHANGE\n break\n index += 1 # (4): index=2 (7): index=3 ... (133): index=45\n"], "anno_status": [true], "diff_content": " \n \n X = int(input())\n \n index = 1\n while True:\n- if X * index % 180 == 0:\n- print(index*2)\n+ if X * index % 360 == 0:\n+ print(index)\n break\n index += 1\n \n", "FL_content": " \n \n X = int(input())\n \n index = 1\n while True:\n- if X * index % 180 == 0:\n- print(index*2)\n break\n index += 1\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u694665829", "problem_id": "p02633", "submission1_id": "s563696661", "submission2_id": "s505593673", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = int(input())\nfor i in range(1, 360):\n if (x*i)%360 == 0:\n print(i)\n exit()\n ", "code2": "x = int(input())\nfor i in range(1, 360+1):\n if (x*i)%360 == 0:\n print(i)\n exit()\n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600742949", "date2": "1600742980", "bleu_score": "0.9663255544678141", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1], "code1_test_score": 28, "total_score": 33, "input": "791\n", "actual_output": "no output\n", "expected_output": "360\n\n", "anno_code": ["x = int(input()) # (0): x=791\nfor i in range(1, 360): # (1): i=1 (3): i=2 ... (717): i=359\n if (x*i)%360 == 0: # (2): NO CHANGE (4): NO CHANGE ... (718): NO CHANGE\n print(i)\n exit()\n "], "anno_status": [true], "diff_content": " x = int(input())\n-for i in range(1, 360):\n+for i in range(1, 360+1):\n if (x*i)%360 == 0:\n print(i)\n exit()\n \n", "FL_content": " x = int(input())\n-for i in range(1, 360):\n if (x*i)%360 == 0:\n print(i)\n exit()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u019685451", "problem_id": "p02633", "submission1_id": "s030099739", "submission2_id": "s867186428", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X = int(input())\n\nfor k in range(1, 361):\n if ((180 - X) * k) % 360 == 0:\n print(k)\n break", "code2": "X = int(input())\n\nfor k in range(1, 361):\n if (X * k) % 360 == 0:\n print(k)\n break", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592701594", "date2": "1592702406", "bleu_score": "0.9008136619290726", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 22, "total_score": 33, "input": "1780\n", "actual_output": "9\n", "expected_output": "18\n\n", "anno_code": ["X = int(input()) # (0): X=1780\n\nfor k in range(1, 361): # (1): k=1 (3): k=2 ... (17): k=9\n if ((180 - X) * k) % 360 == 0: # (2): NO CHANGE (4): NO CHANGE ... (18): NO CHANGE\n print(k) # (19): NO CHANGE\n break"], "anno_status": [true], "diff_content": " X = int(input())\n \n for k in range(1, 361):\n- if ((180 - X) * k) % 360 == 0:\n+ if (X * k) % 360 == 0:\n print(k)\n break\n", "FL_content": " X = int(input())\n \n for k in range(1, 361):\n- if ((180 - X) * k) % 360 == 0:\n print(k)\n break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u075317232", "problem_id": "p02633", "submission1_id": "s055747935", "submission2_id": "s287559691", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\n \ndef Strider():\n \n NumA = int(input())\n \n count = 360/NumA\n \n NumB = 1\n \n while (count == 0):\n NumB = NumB + 1\n count = 360*NumB/NumA\n \n print(int(count))\n \nif __name__ == '__main__':\n Strider()", "code2": "\nimport math\n \ndef Strider():\n \n NumA = int(input())\n \n count = 360/NumA\n \n NumB = 1\n \n while ((360*NumB % NumA) != 0):\n NumB = NumB + 1\n count = 360*NumB/NumA\n \n print(int(count))\n \nif __name__ == '__main__':\n Strider()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592709773", "date2": "1592710180", "bleu_score": "0.9228671253221354", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 33, "input": "1158\n", "actual_output": "0\n", "expected_output": "60\n\n", "anno_code": ["\nimport math\n \ndef Strider(): # (0): Strider=\n \n NumA = int(input())\n \n count = 360/NumA\n \n NumB = 1\n \n while (count == 0):\n NumB = NumB + 1\n count = 360*NumB/NumA\n \n print(int(count))\n \nif __name__ == '__main__':\n Strider()"], "anno_status": [true], "diff_content": " \n import math\n \n def Strider():\n \n NumA = int(input())\n \n count = 360/NumA\n \n NumB = 1\n \n- while (count == 0):\n+ while ((360*NumB % NumA) != 0):\n NumB = NumB + 1\n count = 360*NumB/NumA\n \n print(int(count))\n \n if __name__ == '__main__':\n Strider()\n", "FL_content": " \n import math\n \n def Strider():\n \n NumA = int(input())\n \n count = 360/NumA\n \n NumB = 1\n \n- while (count == 0):\n NumB = NumB + 1\n count = 360*NumB/NumA\n \n print(int(count))\n \n if __name__ == '__main__':\n Strider()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u890751161", "problem_id": "p02633", "submission1_id": "s707407101", "submission2_id": "s159027643", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X=int(input())\ni=1\nwhile True:\n X=X*i\n if X%360==0:\n print(i)\n break\n i+=1", "code2": "X=int(input())\ni=1\na=0\nwhile True:\n a=a+X\n if a%360==0:\n print(i)\n break\n i+=1", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596825450", "date2": "1596825591", "bleu_score": "0.8432303271367353", "code1_test_status": [0, 1, 0, 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, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 33, "input": "1780\n", "actual_output": "6\n", "expected_output": "18\n\n", "anno_code": ["X=int(input()) # (0): X=1780\ni=1 # (1): i=1\nwhile True: # (2): NO CHANGE (6): NO CHANGE ... (22): NO CHANGE\n X=X*i # (3): NO CHANGE (7): X=3560 ... (23): X=1281600\n if X%360==0: # (4): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n print(i) # (25): NO CHANGE\n break\n i+=1 # (5): i=2 (9): i=3 ... (21): i=6\n"], "anno_status": [true], "diff_content": " X=int(input())\n i=1\n+a=0\n while True:\n- X=X*i\n- if X%360==0:\n+ a=a+X\n+ if a%360==0:\n print(i)\n break\n i+=1\n", "FL_content": " X=int(input())\n i=1\n while True:\n- X=X*i\n- if X%360==0:\n print(i)\n break\n i+=1\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u017810624", "problem_id": "p02633", "submission1_id": "s682782019", "submission2_id": "s478214378", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nx=int(input())\nct=0\nfor i in range(1000):\n ct+=(180-x)\n if ct%360==0:\n print(i+1)\n exit()", "code2": "import math\nx=int(input())\nct=0\nfor i in range(1000):\n ct+=x\n if ct%360==0:\n print(i+1)\n exit()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592702692", "date2": "1592703275", "bleu_score": "0.9222427145526827", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 22, "total_score": 33, "input": "1780\n", "actual_output": "9\n", "expected_output": "18\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import math\n x=int(input())\n ct=0\n for i in range(1000):\n- ct+=(180-x)\n+ ct+=x\n if ct%360==0:\n print(i+1)\n exit()\n", "FL_content": " import math\n x=int(input())\n ct=0\n for i in range(1000):\n- ct+=(180-x)\n if ct%360==0:\n print(i+1)\n exit()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u456595418", "problem_id": "p03079", "submission1_id": "s203194475", "submission2_id": "s801355725", "status1": "Wrong Answer", "status2": "Accepted", "code1": "l = []\nl= list(map(int,input().split()))\nls = sorted(l)\na = ls[0]\nb = ls[1]\nc = ls[2]\n\nif a + b < c:\n\tprint(\"Yes\")\nelse:\n \tprint(\"No\")", "code2": "l = []\nl= list(map(int,input().split()))\na = l[0]\nb = l[1]\nc = l[2]\n\nif a == b and a == c:\n\tprint(\"Yes\")\nelse:\n \tprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553981016", "date2": "1553981407", "bleu_score": "0.7991013803495919", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-2 0 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["l = [] # (0): l=[]\nl= list(map(int,input().split())) # (1): l=[-2, 0, -2]\nls = sorted(l) # (2): ls=[-2, -2, 0]\na = ls[0] # (3): a=-2\nb = ls[1] # (4): b=-2\nc = ls[2] # (5): c=0\n\nif a + b < c: # (6): NO CHANGE\n\tprint(\"Yes\")\nelse:\n \tprint(\"No\")"], "anno_status": [true], "diff_content": " l = []\n l= list(map(int,input().split()))\n-ls = sorted(l)\n-a = ls[0]\n-b = ls[1]\n-c = ls[2]\n+a = l[0]\n+b = l[1]\n+c = l[2]\n \n-if a + b < c:\n+if a == b and a == c:\n \tprint(\"Yes\")\n else:\n \tprint(\"No\")\n", "FL_content": " l = []\n l= list(map(int,input().split()))\n-ls = sorted(l)\n-a = ls[0]\n-b = ls[1]\n-c = ls[2]\n \n-if a + b < c:\n \tprint(\"Yes\")\n else:\n \tprint(\"No\")\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u646130340", "problem_id": "p03079", "submission1_id": "s701496519", "submission2_id": "s430984312", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nif A == B and B == C:\n print('YES')\nelse:\n print('NO')\n", "code2": "A, B, C = map(int, input().split())\nif A == B and B == C:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976266", "date2": "1553976762", "bleu_score": "0.9289462761232644", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "8 -1 2\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=8, B=-1, C=2\nif A == B and B == C: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n if A == B and B == C:\n- print('YES')\n+ print('Yes')\n else:\n- print('NO')\n-\n+ print('No')\n", "FL_content": " A, B, C = map(int, input().split())\n if A == B and B == C:\n- print('YES')\n else:\n- print('NO')\n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u114648678", "problem_id": "p03079", "submission1_id": "s702976766", "submission2_id": "s633917944", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A ,B ,C =map(int,input().split())\nif A==B and B==C:\n print('YES')\nelse :\n print('NO')\n", "code2": "A,B,C=map(int,input().split())\nif A==B and B==C:\n print('Yes')\nelse :\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553978490", "date2": "1553978575", "bleu_score": "0.8657613558300437", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "8 -1 2\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["A ,B ,C =map(int,input().split()) # (0): A=8, B=-1, C=2\nif A==B and B==C: # (1): NO CHANGE\n print('YES')\nelse :\n print('NO')\n"], "anno_status": [true], "diff_content": "-A ,B ,C =map(int,input().split())\n+A,B,C=map(int,input().split())\n if A==B and B==C:\n- print('YES')\n+ print('Yes')\n else :\n- print('NO')\n+ print('No')\n \n", "FL_content": "-A ,B ,C =map(int,input().split())\n if A==B and B==C:\n- print('YES')\n else :\n- print('NO')\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u865067466", "problem_id": "p03079", "submission1_id": "s395698137", "submission2_id": "s313108571", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split(' '))\n\nif A**2 + B**2 == C**2:\n print('Yes')\nelse:\n print('No')\n", "code2": "A, B, C = map(int, input().split(' '))\n\nif A == B and B == C:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976163", "date2": "1553976619", "bleu_score": "0.8512104166875031", "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, 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], "code1_test_score": 58, "total_score": 61, "input": "-2 0 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["A, B, C = map(int, input().split(' ')) # (0): A=-2, B=0, C=-2\n\nif A**2 + B**2 == C**2: # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split(' '))\n \n-if A**2 + B**2 == C**2:\n+if A == B and B == C:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " A, B, C = map(int, input().split(' '))\n \n-if A**2 + B**2 == C**2:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u894258749", "problem_id": "p03079", "submission1_id": "s998032863", "submission2_id": "s710331356", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inpl = lambda: list(map(int,input().split()))\n\nA, B, C = inpl()\nif A==B==C:\n print('YES')\nelse:\n print('NO')", "code2": "inpl = lambda: list(map(int,input().split()))\n\nA, B, C = inpl()\nif A==B==C:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976153", "date2": "1553976245", "bleu_score": "0.9485543946052841", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-3 10 -1\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["inpl = lambda: list(map(int,input().split())) # (0): inpl= at 0x000001C428275BD0>\n\nA, B, C = inpl() # (1): A=-3, B=10, C=-1\nif A==B==C: # (2): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " inpl = lambda: list(map(int,input().split()))\n \n A, B, C = inpl()\n if A==B==C:\n- print('YES')\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": " inpl = lambda: list(map(int,input().split()))\n \n A, B, C = inpl()\n if A==B==C:\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u619785253", "problem_id": "p03079", "submission1_id": "s185096903", "submission2_id": "s963192942", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i = input().split()\nif (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n print('YES')\nelse:\n print('NO')", "code2": "i = input().split()\nif (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555646715", "date2": "1555647442", "bleu_score": "0.9503325617976083", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-2 -1 -2\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["i = input().split() # (0): i=['-2', '-1', '-2']\nif (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])): # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " i = input().split()\n if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n- print('YES')\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": " i = input().split()\n if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u328751895", "problem_id": "p03079", "submission1_id": "s295110670", "submission2_id": "s048472376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nprint('YES' if A == B == C else 'NO')", "code2": "A, B, C = map(int, input().split())\nprint('Yes' if A == B == C else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588789605", "date2": "1588789862", "bleu_score": "0.9187200410639643", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "1 7 2\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=1, B=7, C=2\nprint('YES' if A == B == C else 'NO')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n-print('YES' if A == B == C else 'NO')\n+print('Yes' if A == B == C else 'No')\n", "FL_content": " A, B, C = map(int, input().split())\n-print('YES' if A == B == C else 'NO')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u661983922", "problem_id": "p03079", "submission1_id": "s459165530", "submission2_id": "s197534730", "status1": "Wrong Answer", "status2": "Accepted", "code1": "lst = input().split()\n\ncor_lst = sorted(lst)\n\n\n\nif int(cor_lst[0])+int(cor_lst[1]) > int(cor_lst[2]):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "lst = input().split()\n\ncor_lst = sorted(lst)\n\n\n\nif int(cor_lst[0]) == int(cor_lst[1]) and int(cor_lst[0]) == int(cor_lst[2]):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556090707", "date2": "1556090871", "bleu_score": "0.8167808701699926", "code1_test_status": [1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 49, "total_score": 61, "input": "1 15 3\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["lst = input().split() # (0): lst=['1', '15', '3']\n\ncor_lst = sorted(lst) # (1): cor_lst=['1', '15', '3']\n\n\n\nif int(cor_lst[0])+int(cor_lst[1]) > int(cor_lst[2]): # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " lst = input().split()\n \n cor_lst = sorted(lst)\n \n \n \n-if int(cor_lst[0])+int(cor_lst[1]) > int(cor_lst[2]):\n+if int(cor_lst[0]) == int(cor_lst[1]) and int(cor_lst[0]) == int(cor_lst[2]):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " lst = input().split()\n \n cor_lst = sorted(lst)\n \n \n \n-if int(cor_lst[0])+int(cor_lst[1]) > int(cor_lst[2]):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u583014981", "problem_id": "p03079", "submission1_id": "s296378527", "submission2_id": "s111860277", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def regtri(a, b, c):\n if a == b and b == c:\n return 'Yes'\n else:\n return 'No'\n \na, b, c = (int(i) for i in input().split())\nregtri(a, b, c)", "code2": "def regtri(a, b, c):\n if a == b and b == c:\n return 'Yes'\n else:\n return 'No'\n \na, b, c = (int(i) for i in input().split())\nprint(regtri(a, b, c))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553979925", "date2": "1553980093", "bleu_score": "0.937908611407773", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-3 0 -1\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["def regtri(a, b, c): # (0): regtri=\n if a == b and b == c:\n return 'Yes'\n else:\n return 'No'\n \na, b, c = (int(i) for i in input().split()) # (1): a=-3, b=0, c=-1\nregtri(a, b, c) # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " def regtri(a, b, c):\n if a == b and b == c:\n return 'Yes'\n else:\n- return 'No'\n+ return 'No'\n \n a, b, c = (int(i) for i in input().split())\n-regtri(a, b, c)\n+print(regtri(a, b, c))\n", "FL_content": " def regtri(a, b, c):\n if a == b and b == c:\n return 'Yes'\n else:\n- return 'No'\n \n a, b, c = (int(i) for i in input().split())\n-regtri(a, b, c)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u331226975", "problem_id": "p03079", "submission1_id": "s358100691", "submission2_id": "s595565087", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ABC = list(map(int, input().split()))\nif ABC[0] + ABC[1] < ABC[2] or ABC[1] + ABC[2] < ABC[0] or ABC[0] + ABC[2] < ABC[1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "ABC = list(map(int, input().split()))\nif ABC[0] == ABC[1] and ABC[1]==ABC[2] and ABC[2]==ABC[0]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553978718", "date2": "1553982137", "bleu_score": "0.6911054233299", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-5 1 -1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["ABC = list(map(int, input().split())) # (0): ABC=[-5, 1, -1]\nif ABC[0] + ABC[1] < ABC[2] or ABC[1] + ABC[2] < ABC[0] or ABC[0] + ABC[2] < ABC[1]: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " ABC = list(map(int, input().split()))\n-if ABC[0] + ABC[1] < ABC[2] or ABC[1] + ABC[2] < ABC[0] or ABC[0] + ABC[2] < ABC[1]:\n+if ABC[0] == ABC[1] and ABC[1]==ABC[2] and ABC[2]==ABC[0]:\n print(\"Yes\")\n else:\n print(\"No\")\n+\n", "FL_content": " ABC = list(map(int, input().split()))\n-if ABC[0] + ABC[1] < ABC[2] or ABC[1] + ABC[2] < ABC[0] or ABC[0] + ABC[2] < ABC[1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u174603263", "problem_id": "p03079", "submission1_id": "s408282187", "submission2_id": "s658290406", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = input().split()\n\nif(a+b > c and a+c > b and b+c > a):\n print('yes')\nelse:\n print('no')\n", "code2": "a, b, c = input().split()\n\nif(a == b and b == c):\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976238", "date2": "1553976404", "bleu_score": "0.7094823661825986", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-9 -2 0\n", "actual_output": "no\n", "expected_output": "No\n\n", "anno_code": ["a, b, c = input().split() # (0): a=-9, b=-2, c=0\n\nif(a+b > c and a+c > b and b+c > a): # (1): NO CHANGE\n print('yes')\nelse:\n print('no')\n"], "anno_status": [true], "diff_content": " a, b, c = input().split()\n \n-if(a+b > c and a+c > b and b+c > a):\n- print('yes')\n+if(a == b and b == c):\n+ print('Yes')\n else:\n- print('no')\n+ print('No')\n \n", "FL_content": " a, b, c = input().split()\n \n-if(a+b > c and a+c > b and b+c > a):\n- print('yes')\n else:\n- print('no')\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u385244248", "problem_id": "p03079", "submission1_id": "s167662321", "submission2_id": "s648367791", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = list(map(int,input().split()))\nif A[0] + A[1] > A[2]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "A = list(map(int,input().split()))\nif A[0] == A[1] == A[2]:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576293163", "date2": "1576293233", "bleu_score": "0.9268715436600964", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 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, 0, 1, 1, 1], "code1_test_score": 21, "total_score": 61, "input": "1 13 3\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["A = list(map(int,input().split())) # (0): A=[1, 13, 3]\nif A[0] + A[1] > A[2]: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " A = list(map(int,input().split()))\n-if A[0] + A[1] > A[2]:\n+if A[0] == A[1] == A[2]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " A = list(map(int,input().split()))\n-if A[0] + A[1] > A[2]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u619785253", "problem_id": "p03079", "submission1_id": "s103226440", "submission2_id": "s963192942", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i = input().split()\nif (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):\n print('YES')\nelse:\n print('NO')", "code2": "i = input().split()\nif (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555646486", "date2": "1555647442", "bleu_score": "0.7591215756831959", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-2 1 -2\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["i = input().split() # (0): i=['-2', '1', '-2']\nif (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])): # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " i = input().split()\n-if (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):\n- print('YES')\n+if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": " i = input().split()\n-if (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u307124824", "problem_id": "p03079", "submission1_id": "s727003607", "submission2_id": "s911852260", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nA, B, C = input().split()\n\nif A == B:\n if A == C:\n print('YES')\n sys.exit()\n\nprint('NO')\n", "code2": "import sys\n\nA, B, C = input().split()\na = int(A)\nb = int(B)\nc = int(C)\n\nif a == b:\n if a == c:\n print('Yes')\n sys.exit()\n\nprint('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553979974", "date2": "1553980590", "bleu_score": "0.6728154184725886", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "1 13 3\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["import sys\n\nA, B, C = input().split() # (0): A=1, B=13, C=3\n\nif A == B: # (1): NO CHANGE\n if A == C:\n print('YES')\n sys.exit()\n\nprint('NO')\n"], "anno_status": [true], "diff_content": " import sys\n \n A, B, C = input().split()\n+a = int(A)\n+b = int(B)\n+c = int(C)\n \n-if A == B:\n- if A == C:\n- print('YES')\n+if a == b:\n+ if a == c:\n+ print('Yes')\n sys.exit()\n \n-print('NO')\n+print('No')\n \n", "FL_content": " import sys\n \n A, B, C = input().split()\n \n-if A == B:\n- if A == C:\n- print('YES')\n sys.exit()\n \n-print('NO')\n \n", "added_lines": 7, "removed_lines": 4, "code1_lines": 11 }, { "user_id": "u619785253", "problem_id": "p03079", "submission1_id": "s683336349", "submission2_id": "s963192942", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i = input().split()\nif int (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):\n print('YES')\nelse:\n print('NO')", "code2": "i = input().split()\nif (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555646298", "date2": "1555647442", "bleu_score": "0.7544723060350635", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-2 10 3\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["i = input().split() # (0): i=['-2', '10', '3']\nif int (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])): # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " i = input().split()\n-if int (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):\n- print('YES')\n+if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": " i = input().split()\n-if int (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u307124824", "problem_id": "p03079", "submission1_id": "s044587225", "submission2_id": "s911852260", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nA, B, C = input().split()\na = int(A)\nb = int(B)\nc = int(C)\n\nif a == b:\n if a == c:\n print('YES')\n sys.exit()\n \nprint('NO')\n", "code2": "import sys\n\nA, B, C = input().split()\na = int(A)\nb = int(B)\nc = int(C)\n\nif a == b:\n if a == c:\n print('Yes')\n sys.exit()\n\nprint('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553977247", "date2": "1553980590", "bleu_score": "0.9003984965722287", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-1 1 -1\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["import sys\n\nA, B, C = input().split() # (0): A=-1, B=1, C=-1\na = int(A) # (1): a=-1\nb = int(B) # (2): b=1\nc = int(C) # (3): c=-1\n\nif a == b: # (4): NO CHANGE\n if a == c:\n print('YES')\n sys.exit()\n \nprint('NO')\n"], "anno_status": [true], "diff_content": " import sys\n \n A, B, C = input().split()\n a = int(A)\n b = int(B)\n c = int(C)\n \n if a == b:\n if a == c:\n- print('YES')\n+ print('Yes')\n sys.exit()\n- \n-print('NO')\n+\n+print('No')\n \n", "FL_content": " import sys\n \n A, B, C = input().split()\n a = int(A)\n b = int(B)\n c = int(C)\n \n if a == b:\n if a == c:\n- print('YES')\n sys.exit()\n- \n-print('NO')\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u231905444", "problem_id": "p03079", "submission1_id": "s098487359", "submission2_id": "s091627244", "status1": "Wrong Answer", "status2": "Accepted", "code1": "arr=list(map(int,input().split()))\nif(arr.count(arr[0])==3):\n print('yes')\nelse:\n print('no')\n ", "code2": "arr=list(map(int,input().split()))\nif(arr.count(arr[0])==3):\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554038964", "date2": "1554039138", "bleu_score": "0.9114898740225728", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "0 6 3\n", "actual_output": "no\n", "expected_output": "No\n\n", "anno_code": ["arr=list(map(int,input().split())) # (0): arr=[0, 6, 3]\nif(arr.count(arr[0])==3): # (1): NO CHANGE\n print('yes')\nelse:\n print('no')\n "], "anno_status": [true], "diff_content": " arr=list(map(int,input().split()))\n if(arr.count(arr[0])==3):\n- print('yes')\n+ print('Yes')\n else:\n- print('no')\n- \n+ print('No')\n+\n", "FL_content": " arr=list(map(int,input().split()))\n if(arr.count(arr[0])==3):\n- print('yes')\n else:\n- print('no')\n- \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u774845108", "problem_id": "p03079", "submission1_id": "s899577279", "submission2_id": "s624247118", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\ndef ria(sep = ''):\n if sep == '' :\n return list(map(int, input().split())) \n else: return list(map(int, input().split(sep)))\ndef rsa(sep = ''):\n if sep == '' :\n return input().split() \n else: return input().split(sep)\ndef ri(): return int(input())\ndef rd(): return float(input())\ndef rs(): return input()\n\n\n\nA, B, C = map(int, input().split())\nprint(\"Yes\" if (A == B and B == C) else \"NO\")\n\n", "code2": "from sys import stdin\n\ndef ria(sep = ''):\n if sep == '' :\n return list(map(int, input().split())) \n else: return list(map(int, input().split(sep)))\ndef rsa(sep = ''):\n if sep == '' :\n return input().split() \n else: return input().split(sep)\ndef ri(): return int(input())\ndef rd(): return float(input())\ndef rs(): return input()\n\n\n\nA, B, C = map(int, input().split())\nprint(\"Yes\" if (A == B and B == C) else \"No\")\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554603216", "date2": "1554603240", "bleu_score": "0.9942889011352141", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-3 10 -1\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["from sys import stdin\n\ndef ria(sep = ''): # (0): ria=\n if sep == '' :\n return list(map(int, input().split())) \n else: return list(map(int, input().split(sep)))\ndef rsa(sep = ''): # (1): rsa=, ri=, rd=, rs=\n if sep == '' :\n return input().split() \n else: return input().split(sep)\ndef ri(): return int(input())\ndef rd(): return float(input())\ndef rs(): return input()\n\n\n\nA, B, C = map(int, input().split()) # (2): A=-3, B=10, C=-1\nprint(\"Yes\" if (A == B and B == C) else \"NO\")\n\n"], "anno_status": [true], "diff_content": " from sys import stdin\n \n def ria(sep = ''):\n if sep == '' :\n return list(map(int, input().split())) \n else: return list(map(int, input().split(sep)))\n def rsa(sep = ''):\n if sep == '' :\n return input().split() \n else: return input().split(sep)\n def ri(): return int(input())\n def rd(): return float(input())\n def rs(): return input()\n \n \n \n A, B, C = map(int, input().split())\n-print(\"Yes\" if (A == B and B == C) else \"NO\")\n+print(\"Yes\" if (A == B and B == C) else \"No\")\n \n \n", "FL_content": " from sys import stdin\n \n def ria(sep = ''):\n if sep == '' :\n return list(map(int, input().split())) \n else: return list(map(int, input().split(sep)))\n def rsa(sep = ''):\n if sep == '' :\n return input().split() \n else: return input().split(sep)\n def ri(): return int(input())\n def rd(): return float(input())\n def rs(): return input()\n \n \n \n A, B, C = map(int, input().split())\n-print(\"Yes\" if (A == B and B == C) else \"NO\")\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u315703650", "problem_id": "p03079", "submission1_id": "s604184355", "submission2_id": "s612097841", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(map(int,input().split()))\na.sort()\nif a[0]>a[1]+a[2]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "a,b,c = map(int,input().split())\nif a==b==c:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557903052", "date2": "1557903516", "bleu_score": "0.6663799127556747", "code1_test_status": [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, 0, 1, 1, 1, 1, 1], "code1_test_score": 59, "total_score": 61, "input": "-1 -2 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a = list(map(int,input().split())) # (0): a=[-1, -2, -2]\na.sort() # (1): a=[-2, -2, -1]\nif a[0]>a[1]+a[2]: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": "-a = list(map(int,input().split()))\n-a.sort()\n-if a[0]>a[1]+a[2]:\n+a,b,c = map(int,input().split())\n+if a==b==c:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "FL_content": "-a = list(map(int,input().split()))\n-a.sort()\n-if a[0]>a[1]+a[2]:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u233729690", "problem_id": "p03079", "submission1_id": "s668086654", "submission2_id": "s415824197", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C = map(int, input().split())\n\nprint(A,B,C)\n\nif A == B and B == C:\n print('Yes')\nelse:\n print('No')", "code2": "A,B,C = map(int, input().split())\n\nif A == B and B == C:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976349", "date2": "1553976446", "bleu_score": "0.8574039191604413", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 61, "input": "-2 0 -2\n", "actual_output": "-2 0 -2\nNo\n", "expected_output": "No\n\n", "anno_code": ["A,B,C = map(int, input().split()) # (0): A=-2, B=0, C=-2\n\nprint(A,B,C) # (1): NO CHANGE\n\nif A == B and B == C: # (2): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " A,B,C = map(int, input().split())\n \n-print(A,B,C)\n-\n if A == B and B == C:\n print('Yes')\n else:\n print('No')\n", "FL_content": " A,B,C = map(int, input().split())\n \n-print(A,B,C)\n-\n if A == B and B == C:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u370721525", "problem_id": "p03475", "submission1_id": "s303174948", "submission2_id": "s549703941", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nl = []\nfor i in range(N-1):\n c, s, f = map(int, input().split())\n l.append([c, s, f])\n \nfor i in range(N-1):\n time = l[i][1] + l[i][0]\n for j in range(i+1, N-1):\n if time-l[j][1] >= 0:\n wait = (time-l[j][1]) % l[j][2]\n else:\n wait = l[j][1]\n time = 0\n time += wait + l[j][0]\n print(time)\nprint(0)", "code2": "N = int(input())\nl = []\nfor i in range(N-1):\n c, s, f = map(int, input().split())\n l.append([c, s, f])\n \nfor i in range(N-1):\n time = l[i][1] + l[i][0]\n for j in range(i+1, N-1):\n if time-l[j][1] >= 0:\n wait = time % l[j][2]\n if wait == 0:\n time += l[j][0]\n else:\n time += l[j][2] - wait + l[j][0]\n else:\n time = l[j][1] + l[j][0]\n print(time)\nprint(0)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596366180", "date2": "1596367195", "bleu_score": "0.8269004219459775", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n19 24 3\n32 16 4\n99 2 2\n", "actual_output": "177\n147\n101\n0\n", "expected_output": "175\n147\n101\n0\n\n", "anno_code": ["N = int(input()) # (0): N=4\nl = [] # (1): l=[]\nfor i in range(N-1): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n c, s, f = map(int, input().split()) # (3): c=19, s=24, f=3 (6): c=32, s=16, f=4 (9): c=99, s=2, f=2\n l.append([c, s, f]) # (4): l=[[19, 24, 3]] (7): l (10): l\n \nfor i in range(N-1): # (12): i=0 (24): i=1 ... (36): NO CHANGE\n time = l[i][1] + l[i][0] # (13): time=43 (25): time=48 (33): time=101\n for j in range(i+1, N-1): # (14): j=1 (18): j=2 ... (34): NO CHANGE\n if time-l[j][1] >= 0: # (15): NO CHANGE (19): NO CHANGE (27): NO CHANGE\n wait = (time-l[j][1]) % l[j][2] # (16): wait=3 (20): wait=0 (28): NO CHANGE\n else:\n wait = l[j][1]\n time = 0\n time += wait + l[j][0] # (17): time=78 (21): time=177 (29): time=147\n print(time) # (23): NO CHANGE (31): NO CHANGE (35): NO CHANGE\nprint(0)"], "anno_status": [true], "diff_content": " N = int(input())\n l = []\n for i in range(N-1):\n c, s, f = map(int, input().split())\n l.append([c, s, f])\n \n for i in range(N-1):\n time = l[i][1] + l[i][0]\n for j in range(i+1, N-1):\n if time-l[j][1] >= 0:\n- wait = (time-l[j][1]) % l[j][2]\n+ wait = time % l[j][2]\n+ if wait == 0:\n+ time += l[j][0]\n+ else:\n+ time += l[j][2] - wait + l[j][0]\n else:\n- wait = l[j][1]\n- time = 0\n- time += wait + l[j][0]\n+ time = l[j][1] + l[j][0]\n print(time)\n print(0)\n", "FL_content": " N = int(input())\n l = []\n for i in range(N-1):\n c, s, f = map(int, input().split())\n l.append([c, s, f])\n \n for i in range(N-1):\n time = l[i][1] + l[i][0]\n for j in range(i+1, N-1):\n if time-l[j][1] >= 0:\n- wait = (time-l[j][1]) % l[j][2]\n else:\n- wait = l[j][1]\n- time = 0\n- time += wait + l[j][0]\n print(time)\n print(0)\n", "added_lines": 6, "removed_lines": 4, "code1_lines": 17 }, { "user_id": "u164898518", "problem_id": "p03475", "submission1_id": "s191604475", "submission2_id": "s542705375", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nC = []\nS = []\nF = []\nfor i in range(N-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n\nfor i in range(0, N-1):\n t = S[i]\n for j in range(i, N-1):\n if t <= S[j]:\n t = S[j]\n else:\n t += F[j] - t%F[j]\n t += C[j]\n print(t)\nprint(0)", "code2": "N = int(input())\nC = []\nS = []\nF = []\nfor i in range(N-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n\nfor i in range(0, N-1):\n t = 0\n for j in range(i, N-1):\n if t <= S[j]:\n t = S[j]\n elif t%F[j] != 0:\n t += F[j] - t%F[j]\n t += C[j]\n print(t)\nprint(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514692309", "date2": "1514693092", "bleu_score": "0.9502791788037965", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 103, "input": "3\n12 26 2\n4 10 2\n", "actual_output": "44\n14\n0\n", "expected_output": "42\n14\n0\n\n", "anno_code": ["N = int(input()) # (0): N=3\nC = [] # (1): C=[]\nS = [] # (2): S=[]\nF = [] # (3): F=[]\nfor i in range(N-1): # (4): i=0 (9): i=1 (14): NO CHANGE\n c, s, f = map(int, input().split()) # (5): c=12, s=26, f=2 (10): c=4, s=10\n C.append(c) # (6): C=[12] (11): C=[12, 4]\n S.append(s) # (7): S=[26] (12): S=[26, 10]\n F.append(f) # (8): F=[2] (13): F=[2, 2]\n\nfor i in range(0, N-1): # (15): i=0 (27): i=1 (35): NO CHANGE\n t = S[i] # (16): t=26 (28): t=10\n for j in range(i, N-1): # (17): j=0 (21): j=1 ... (33): NO CHANGE\n if t <= S[j]: # (18): NO CHANGE (22): NO CHANGE (30): NO CHANGE\n t = S[j] # (19): NO CHANGE (31): NO CHANGE\n else:\n t += F[j] - t%F[j] # (23): t=40\n t += C[j] # (20): t=38 (24): t=44 (32): t=14\n print(t) # (26): NO CHANGE (34): NO CHANGE\nprint(0)"], "anno_status": [true], "diff_content": " N = int(input())\n C = []\n S = []\n F = []\n for i in range(N-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n \n for i in range(0, N-1):\n- t = S[i]\n+ t = 0\n for j in range(i, N-1):\n if t <= S[j]:\n t = S[j]\n- else:\n+ elif t%F[j] != 0:\n t += F[j] - t%F[j]\n t += C[j]\n print(t)\n print(0)\n", "FL_content": " N = int(input())\n C = []\n S = []\n F = []\n for i in range(N-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n \n for i in range(0, N-1):\n- t = S[i]\n for j in range(i, N-1):\n if t <= S[j]:\n t = S[j]\n- else:\n t += F[j] - t%F[j]\n t += C[j]\n print(t)\n print(0)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u492049124", "problem_id": "p03475", "submission1_id": "s377065541", "submission2_id": "s887940912", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nlines = []\n\nfor i in range(N-1):\n lines.append(input())\n\nC = []\nS = []\nF = []\n\nfor line in lines:\n\tc, s, f = line.split()\n\tC.append(int(c))\n\tS.append(int(s))\n\tF.append(int(f))\n\nA = []\n\nfor i in range(N-1):\n\ta = C[i] + S[i]\n\tfor j in range(i + 1, N - 1):\n\t\t\n\t\tn = S[j] - a if a <= S[j] else a % F[j]\n\t\ta = a + C[j] + n\n\tA.append(a)\n\nfor a in A:\n\tprint(a)\nprint(0)\n", "code2": "N = int(input())\nlines = []\n\nfor i in range(N-1):\n lines.append(input())\n\nC = []\nS = []\nF = []\n\nfor line in lines:\n\tc, s, f = line.split()\n\tC.append(int(c))\n\tS.append(int(s))\n\tF.append(int(f))\n\nA = []\n\nfor i in range(N-1):\n\ta = C[i] + S[i]\n\tfor j in range(i + 1, N - 1):\n\t\tn = S[j] - a if a <= S[j] else (a - S[j]) % F[j]\n\t\tn = F[j] - n if a > S[j] and n != 0 else n\n\t\t\n\t\ta = a + C[j] + n\n\tA.append(a)\n\nfor a in A:\n\tprint(a)\nprint(0)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528245869", "date2": "1528247513", "bleu_score": "0.8705414902037786", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n19 24 3\n32 16 4\n99 2 2\n", "actual_output": "177\n147\n101\n0\n", "expected_output": "175\n147\n101\n0\n\n", "anno_code": ["N = int(input()) # (0): N=4\nlines = [] # (1): lines=[]\n\nfor i in range(N-1): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n lines.append(input()) # (3): lines=['19 24 3'] (5): lines=['19 24 3', '32 16 4'] (7): lines=['19 24 3', '32 16 4', '99 2 2']\n\nC = [] # (9): C=[]\nS = [] # (10): S=[]\nF = [] # (11): F=[]\n\nfor line in lines: # (12): line=19 24 3 (17): line=32 16 4 ... (27): NO CHANGE\n\tc, s, f = line.split() # (13): c=19, s=24, f=3 (18): c=32, s=16, f=4 (23): c=99, s=2, f=2\n\tC.append(int(c)) # (14): C=[19] (19): C=[19, 32] (24): C=[19, 32, 99]\n\tS.append(int(s)) # (15): S=[24] (20): S=[24, 16] (25): S=[24, 16, 2]\n\tF.append(int(f)) # (16): F=[3] (21): F=[3, 4] (26): F=[3, 4, 2]\n\nA = [] # (28): A=[]\n\nfor i in range(N-1): # (29): i=0 (39): i=1 ... (50): NO CHANGE\n\ta = C[i] + S[i] # (30): a=43 (40): a=48 (47): a=101\n\tfor j in range(i + 1, N - 1): # (31): j=1 (34): j=2 ... (48): NO CHANGE\n\t\t\n\t\tn = S[j] - a if a <= S[j] else a % F[j] # (32): n=3 (35): n=0 (42): NO CHANGE\n\t\ta = a + C[j] + n # (33): a=78 (36): a=177 (43): a=147\n\tA.append(a) # (38): A=[177] (45): A=[177, 147] (49): A=[177, 147, 101]\n\nfor a in A: # (51): a=177 (53): a=147 ... (57): NO CHANGE\n\tprint(a) # (52): NO CHANGE (54): NO CHANGE (56): NO CHANGE\nprint(0)\n"], "anno_status": [true], "diff_content": " N = int(input())\n lines = []\n \n for i in range(N-1):\n lines.append(input())\n \n C = []\n S = []\n F = []\n \n for line in lines:\n \tc, s, f = line.split()\n \tC.append(int(c))\n \tS.append(int(s))\n \tF.append(int(f))\n \n A = []\n \n for i in range(N-1):\n \ta = C[i] + S[i]\n \tfor j in range(i + 1, N - 1):\n+\t\tn = S[j] - a if a <= S[j] else (a - S[j]) % F[j]\n+\t\tn = F[j] - n if a > S[j] and n != 0 else n\n \t\t\n-\t\tn = S[j] - a if a <= S[j] else a % F[j]\n \t\ta = a + C[j] + n\n \tA.append(a)\n \n for a in A:\n \tprint(a)\n print(0)\n \n+\n", "FL_content": " N = int(input())\n lines = []\n \n for i in range(N-1):\n lines.append(input())\n \n C = []\n S = []\n F = []\n \n for line in lines:\n \tc, s, f = line.split()\n \tC.append(int(c))\n \tS.append(int(s))\n \tF.append(int(f))\n \n A = []\n \n for i in range(N-1):\n \ta = C[i] + S[i]\n \tfor j in range(i + 1, N - 1):\n \t\t\n-\t\tn = S[j] - a if a <= S[j] else a % F[j]\n \t\ta = a + C[j] + n\n \tA.append(a)\n \n for a in A:\n \tprint(a)\n print(0)\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 30 }, { "user_id": "u552176911", "problem_id": "p03475", "submission1_id": "s799920919", "submission2_id": "s176062699", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn = int(input())\ncL = []\nsL = []\nfL = []\nfor i in range(n - 1):\n c, s, f = map(int, input().split(\" \"))\n cL.append(c)\n sL.append(s)\n fL.append(f)\n\nans = 0\nfor i in range(n - 1):\n sm = 0\n for j in range(i, n - 1):\n c = cL[j]\n s = sL[j]\n f = fL[j]\n if sm < s:\n sm = s\n sm += c + (f - ((sm - s) % f) % f)\n print(sm)\nprint(0)", "code2": "import math\n\nn = int(input())\ncL = []\nsL = []\nfL = []\nfor i in range(n - 1):\n c, s, f = map(int, input().split(\" \"))\n cL.append(c)\n sL.append(s)\n fL.append(f)\n\nans = 0\nfor i in range(n - 1):\n sm = 0\n for j in range(i, n - 1):\n c = cL[j]\n s = sL[j]\n f = fL[j]\n if sm < s:\n sm = s + c\n continue\n df = f - (sm - s) % f\n if df == f:\n df = 0\n sm += c + df\n print(sm)\nprint(0)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598727649", "date2": "1598731481", "bleu_score": "0.8212059374205929", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n6 33 1\n2 10 1\n", "actual_output": "43\n13\n0\n", "expected_output": "41\n12\n0\n\n", "anno_code": ["import math\n\nn = int(input()) # (0): n=3\ncL = [] # (1): cL=[]\nsL = [] # (2): sL=[]\nfL = [] # (3): fL=[]\nfor i in range(n - 1): # (4): i=0 (9): i=1 (14): NO CHANGE\n c, s, f = map(int, input().split(\" \")) # (5): c=6, s=33, f=1 (10): c=2, s=10\n cL.append(c) # (6): cL=[6] (11): cL=[6, 2]\n sL.append(s) # (7): sL=[33] (12): sL=[33, 10]\n fL.append(f) # (8): fL=[1] (13): fL=[1, 1]\n\nans = 0 # (15): ans=0\nfor i in range(n - 1): # (16): i=0 (33): i=1 (44): NO CHANGE\n sm = 0 # (17): sm=0 (34): sm=0\n for j in range(i, n - 1): # (18): j=0 (25): j=1 ... (42): NO CHANGE\n c = cL[j] # (19): c=6 (26): c=2 (36): NO CHANGE\n s = sL[j] # (20): s=33 (27): s=10 (37): NO CHANGE\n f = fL[j] # (21): NO CHANGE (28): NO CHANGE (38): NO CHANGE\n if sm < s: # (22): NO CHANGE (29): NO CHANGE (39): NO CHANGE\n sm = s # (23): sm=33 (40): sm=10\n sm += c + (f - ((sm - s) % f) % f) # (24): sm=40 (30): sm=43 (41): sm=13\n print(sm) # (32): NO CHANGE (43): NO CHANGE\nprint(0)"], "anno_status": [true], "diff_content": " import math\n \n n = int(input())\n cL = []\n sL = []\n fL = []\n for i in range(n - 1):\n c, s, f = map(int, input().split(\" \"))\n cL.append(c)\n sL.append(s)\n fL.append(f)\n \n ans = 0\n for i in range(n - 1):\n sm = 0\n for j in range(i, n - 1):\n c = cL[j]\n s = sL[j]\n f = fL[j]\n if sm < s:\n- sm = s\n- sm += c + (f - ((sm - s) % f) % f)\n+ sm = s + c\n+ continue\n+ df = f - (sm - s) % f\n+ if df == f:\n+ df = 0\n+ sm += c + df\n print(sm)\n print(0)\n", "FL_content": " import math\n \n n = int(input())\n cL = []\n sL = []\n fL = []\n for i in range(n - 1):\n c, s, f = map(int, input().split(\" \"))\n cL.append(c)\n sL.append(s)\n fL.append(f)\n \n ans = 0\n for i in range(n - 1):\n sm = 0\n for j in range(i, n - 1):\n c = cL[j]\n s = sL[j]\n f = fL[j]\n if sm < s:\n- sm = s\n- sm += c + (f - ((sm - s) % f) % f)\n print(sm)\n print(0)\n", "added_lines": 6, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u062484507", "problem_id": "p03475", "submission1_id": "s546551993", "submission2_id": "s876278085", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\n\nn = int(readline())\ncsf = [tuple(map(int, readline().split())) for _ in range(n-1)]\n\nfor i in range(n):\n now = 0\n for c, s, f in csf[i::]:\n if now <= s:\n now += s - now + c\n else:\n now += (now-s) % f + c\n print(now)\n", "code2": "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\n\nn = int(readline())\ncsf = [tuple(map(int, readline().split())) for _ in range(n-1)]\n\nfor i in range(n):\n now = 0\n for c, s, f in csf[i::]:\n if now <= s:\n now = s\n else:\n if now % f == 0:\n pass\n else:\n now = (now \n now += c\n print(now)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598034178", "date2": "1598035147", "bleu_score": "0.810823009969955", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n11 24 6\n52 8 4\n99 2 2\n", "actual_output": "189\n159\n101\n0\n", "expected_output": "187\n159\n101\n0\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\n\nn = int(readline()) # (3): n=4\ncsf = [tuple(map(int, readline().split())) for _ in range(n-1)] # (4): csf=[(11, 24, 6), (52, 8, 4), (99, 2, 2)]\n\nfor i in range(n): # (5): i=0 (18): i=1 ... (35): i=3\n now = 0 # (6): now=0 (19): now=0 ... (36): now=0\n for c, s, f in csf[i::]: # (7): c=11, s=24, f=6 (10): c=52, s=8, f=4 ... (37): NO CHANGE\n if now <= s: # (8): NO CHANGE (11): NO CHANGE ... (31): NO CHANGE\n now += s - now + c # (9): now=35 (22): now=60 (32): now=101\n else:\n now += (now-s) % f + c # (12): now=90 (15): now=189 (25): now=159\n print(now) # (17): NO CHANGE (27): NO CHANGE ... (38): NO CHANGE\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 \n n = int(readline())\n csf = [tuple(map(int, readline().split())) for _ in range(n-1)]\n \n for i in range(n):\n now = 0\n for c, s, f in csf[i::]:\n if now <= s:\n- now += s - now + c\n+ now = s\n else:\n- now += (now-s) % f + c\n+ if now % f == 0:\n+ pass\n+ else:\n+ now = (now \n+ now += c\n print(now)\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 \n n = int(readline())\n csf = [tuple(map(int, readline().split())) for _ in range(n-1)]\n \n for i in range(n):\n now = 0\n for c, s, f in csf[i::]:\n if now <= s:\n- now += s - now + c\n else:\n- now += (now-s) % f + c\n print(now)\n \n", "added_lines": 6, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u746849814", "problem_id": "p03475", "submission1_id": "s891968879", "submission2_id": "s464230426", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nC, S, F = [], [], []\nfor _ in range(n-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n \nfor i in range(n-1):\n t = S[i]\n while i != (n-1):\n if t < S[i]: \n wait = (S[i] - t)\n else:\n wait = (t - S[i])%F[i]\n t += wait\n move = C[i]\n t += move\n i += 1\n print(t)\nprint(0) ", "code2": "n = int(input())\nC, S, F = [], [], []\nfor _ in range(n-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n\nfor i in range(n-1):\n t = S[i]\n while i != (n-1):\n if t < S[i]: \n wait = (S[i] - t)\n else:\n r = (t - S[i])%F[i]\n if r == 0:\n wait = 0 \n else:\n wait = F[i] - r\n t += wait\n t += C[i] \n i += 1\n print(t)\nprint(0) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583081653", "date2": "1583082179", "bleu_score": "0.8151740600981763", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n11 24 6\n52 16 4\n99 2 2\n", "actual_output": "189\n167\n101\n0\n", "expected_output": "187\n167\n101\n0\n\n", "anno_code": ["n = int(input()) # (0): n=4\nC, S, F = [], [], [] # (1): C=[], S=[], F=[]\nfor _ in range(n-1): # (2): _=0 (7): _=1 ... (17): NO CHANGE\n c, s, f = map(int, input().split()) # (3): c=11, s=24, f=6 (8): c=52, s=16, f=4 (13): c=99, s=2, f=2\n C.append(c) # (4): C=[11] (9): C=[11, 52] (14): C=[11, 52, 99]\n S.append(s) # (5): S=[24] (10): S=[24, 16] (15): S=[24, 16, 2]\n F.append(f) # (6): F=[6] (11): F=[6, 4] (16): F=[6, 4, 2]\n \nfor i in range(n-1): # (18): i=0 (43): i=1 ... (72): NO CHANGE\n t = S[i] # (19): t=24 (44): t=16 (62): t=2\n while i != (n-1): # (20): NO CHANGE (27): NO CHANGE ... (70): NO CHANGE\n if t < S[i]: # (21): NO CHANGE (28): NO CHANGE ... (64): NO CHANGE\n wait = (S[i] - t)\n else:\n wait = (t - S[i])%F[i] # (22): wait=0 (29): wait=3 ... (65): NO CHANGE\n t += wait # (23): NO CHANGE (30): t=38 ... (66): NO CHANGE\n move = C[i] # (24): move=11 (31): move=52 ... (67): NO CHANGE\n t += move # (25): t=35 (32): t=90 ... (68): t=101\n i += 1 # (26): i=1 (33): i=2 ... (69): i=3\n print(t) # (42): NO CHANGE (60): NO CHANGE (71): NO CHANGE\nprint(0) "], "anno_status": [true], "diff_content": " n = int(input())\n C, S, F = [], [], []\n for _ in range(n-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n- \n+\n for i in range(n-1):\n t = S[i]\n while i != (n-1):\n if t < S[i]: \n wait = (S[i] - t)\n else:\n- wait = (t - S[i])%F[i]\n+ r = (t - S[i])%F[i]\n+ if r == 0:\n+ wait = 0 \n+ else:\n+ wait = F[i] - r\n t += wait\n- move = C[i]\n- t += move\n+ t += C[i] \n i += 1\n print(t)\n print(0) \n", "FL_content": " n = int(input())\n C, S, F = [], [], []\n for _ in range(n-1):\n c, s, f = map(int, input().split())\n C.append(c)\n S.append(s)\n F.append(f)\n- \n for i in range(n-1):\n t = S[i]\n while i != (n-1):\n if t < S[i]: \n wait = (S[i] - t)\n else:\n- wait = (t - S[i])%F[i]\n t += wait\n- move = C[i]\n- t += move\n i += 1\n print(t)\n print(0) \n", "added_lines": 7, "removed_lines": 4, "code1_lines": 21 }, { "user_id": "u950708010", "problem_id": "p03475", "submission1_id": "s038695080", "submission2_id": "s638573832", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nstack = [0]\nqueue = []\nfor i in range(n-1):\n c,s,f = (int(i) for i in input().split())\n queue.append((c,s,f))\nfor i in range(n):\n ans = 0\n for j in range(n-i-1):\n c,s,f = queue[i+j]\n \n if s >= ans:\n ans = s+c\n else:\n if ans%f == 0:\n ans +=c\n elif ans%f != 0:\n ans += ans%f+c\n if n-i-1 == 0:\n ans = 0\n print(ans)\n", "code2": "def solve():\n n = int(input())\n query = []\n for i in range(n-1):\n c,s,f = (int(i) for i in input().split())\n query.append((c,s,f))\n\n ans = []\n for i in range(n-1):\n time = 0\n for j in range(i,n-1):\n c,s,f = query[j]\n time = max(s,time)\n if not time%f == 0:\n time += f-time%f\n time += c\n ans.append(time)\n for i in ans:\n print(i)\n print(0)\nsolve()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554321004", "date2": "1566332924", "bleu_score": "0.6238681459700931", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n17 24 6\n16 16 4\n99 2 2\n", "actual_output": "157\n131\n101\n0\n", "expected_output": "159\n131\n101\n0\n\n", "anno_code": ["n = int(input()) # (0): n=4\nstack = [0] # (1): stack=[0]\nqueue = [] # (2): queue=[]\nfor i in range(n-1): # (3): i=0 (6): i=1 ... (12): NO CHANGE\n c,s,f = (int(i) for i in input().split()) # (4): c=17, s=24, f=6 (7): c=16, s=16, f=4 (10): c=99, s=2, f=2\n queue.append((c,s,f)) # (5): queue=[(17, 24, 6)] (8): queue=[(17, 24, 6), (16, 16, 4)] (11): queue=[(17, 24, 6), (16, 16, 4), (99, 2, 2)]\nfor i in range(n): # (13): i=0 (33): i=1 ... (56): i=3\n ans = 0 # (14): ans=0 (34): ans=0 ... (57): ans=0\n for j in range(n-i-1): # (15): j=0 (19): j=1 ... (58): NO CHANGE\n c,s,f = queue[i+j] # (16): c=17, s=24, f=6 (20): c=16, s=16, f=4 ... (50): NO CHANGE\n \n if s >= ans: # (17): NO CHANGE (21): NO CHANGE ... (51): NO CHANGE\n ans = s+c # (18): ans=41 (38): ans=32 (52): ans=101\n else:\n if ans%f == 0: # (22): NO CHANGE (28): NO CHANGE (42): NO CHANGE\n ans +=c # (29): ans=157 (43): ans=131\n elif ans%f != 0: # (23): NO CHANGE\n ans += ans%f+c # (24): ans=58\n if n-i-1 == 0: # (31): NO CHANGE (45): NO CHANGE ... (59): NO CHANGE\n ans = 0 # (60): NO CHANGE\n print(ans) # (32): NO CHANGE (46): NO CHANGE ... (61): NO CHANGE\n"], "anno_status": [true], "diff_content": "-n = int(input())\n-stack = [0]\n-queue = []\n-for i in range(n-1):\n- c,s,f = (int(i) for i in input().split())\n- queue.append((c,s,f))\n-for i in range(n):\n- ans = 0\n- for j in range(n-i-1):\n- c,s,f = queue[i+j]\n- \n- if s >= ans:\n- ans = s+c\n- else:\n- if ans%f == 0:\n- ans +=c\n- elif ans%f != 0:\n- ans += ans%f+c\n- if n-i-1 == 0:\n- ans = 0\n- print(ans)\n+def solve():\n+ n = int(input())\n+ query = []\n+ for i in range(n-1):\n+ c,s,f = (int(i) for i in input().split())\n+ query.append((c,s,f))\n \n+ ans = []\n+ for i in range(n-1):\n+ time = 0\n+ for j in range(i,n-1):\n+ c,s,f = query[j]\n+ time = max(s,time)\n+ if not time%f == 0:\n+ time += f-time%f\n+ time += c\n+ ans.append(time)\n+ for i in ans:\n+ print(i)\n+ print(0)\n+solve()\n", "FL_content": "-n = int(input())\n-stack = [0]\n-queue = []\n-for i in range(n-1):\n- c,s,f = (int(i) for i in input().split())\n- queue.append((c,s,f))\n-for i in range(n):\n- ans = 0\n- for j in range(n-i-1):\n- c,s,f = queue[i+j]\n- \n- if s >= ans:\n- ans = s+c\n- else:\n- if ans%f == 0:\n- ans +=c\n- elif ans%f != 0:\n- ans += ans%f+c\n- if n-i-1 == 0:\n- ans = 0\n- print(ans)\n \n", "added_lines": 20, "removed_lines": 21, "code1_lines": 22 }, { "user_id": "u706414019", "problem_id": "p03475", "submission1_id": "s339408341", "submission2_id": "s302342504", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,math\ninput = sys.stdin.readline\n\nN = int(input())\nCSF = [[0,0,0]]\nfor i in range(1,N):\n CSF.append(list(map(int,input().split())))\nfor i in range(1,N+1):\n nowtime = 0\n for j in range(i,N):\n if nowtime <=CSF[j][1]:\n depT =CSF[j][1]\n else:\n depT =CSF[j][1] + math.ceil((nowtime-CSF[j][1])/CSF[j][2])*CSF[j][2]\n\n nowtime = depT+CSF[j][0]\n print(nowtime,depT)\n print(nowtime)\n", "code2": "import sys,math\ninput = sys.stdin.readline\n\nN = int(input())\nCSF = [[0,0,0]]\nfor i in range(1,N):\n CSF.append(list(map(int,input().split())))\nfor i in range(1,N+1):\n nowtime = 0\n for j in range(i,N):\n if nowtime <=CSF[j][1]:\n depT =CSF[j][1]\n else:\n depT =CSF[j][1] + math.ceil((nowtime-CSF[j][1])/CSF[j][2])*CSF[j][2]\n\n nowtime = depT+CSF[j][0]\n \n print(nowtime)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594472999", "date2": "1594473034", "bleu_score": "0.9506421480258792", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n11 1 1\n2 3 1\n", "actual_output": "12 1\n14 12\n14\n5 3\n5\n0\n", "expected_output": "14\n5\n0\n\n", "anno_code": ["import sys,math\ninput = sys.stdin.readline # (0): input=\n\nN = int(input()) # (1): N=3\nCSF = [[0,0,0]] # (2): CSF\nfor i in range(1,N): # (3): i=1 (5): i=2 (7): NO CHANGE\n CSF.append(list(map(int,input().split()))) # (4): CSF (6): CSF\nfor i in range(1,N+1): # (8): i=1 (22): i=2 (31): i=3\n nowtime = 0 # (9): nowtime=0 (23): nowtime=0 (32): nowtime=0\n for j in range(i,N): # (10): j=1 (15): j=2 ... (33): NO CHANGE\n if nowtime <=CSF[j][1]: # (11): NO CHANGE (16): NO CHANGE (25): NO CHANGE\n depT =CSF[j][1] # (12): depT=1 (26): depT=3\n else:\n depT =CSF[j][1] + math.ceil((nowtime-CSF[j][1])/CSF[j][2])*CSF[j][2] # (17): depT=12\n\n nowtime = depT+CSF[j][0] # (13): nowtime=12 (18): nowtime=14 (27): nowtime=5\n print(nowtime,depT) # (14): NO CHANGE (19): NO CHANGE (28): NO CHANGE\n print(nowtime) # (21): NO CHANGE (30): NO CHANGE (34): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys,math\n input = sys.stdin.readline\n \n N = int(input())\n CSF = [[0,0,0]]\n for i in range(1,N):\n CSF.append(list(map(int,input().split())))\n for i in range(1,N+1):\n nowtime = 0\n for j in range(i,N):\n if nowtime <=CSF[j][1]:\n depT =CSF[j][1]\n else:\n depT =CSF[j][1] + math.ceil((nowtime-CSF[j][1])/CSF[j][2])*CSF[j][2]\n \n nowtime = depT+CSF[j][0]\n- print(nowtime,depT)\n+ \n print(nowtime)\n-\n", "FL_content": " import sys,math\n input = sys.stdin.readline\n \n N = int(input())\n CSF = [[0,0,0]]\n for i in range(1,N):\n CSF.append(list(map(int,input().split())))\n for i in range(1,N+1):\n nowtime = 0\n for j in range(i,N):\n if nowtime <=CSF[j][1]:\n depT =CSF[j][1]\n else:\n depT =CSF[j][1] + math.ceil((nowtime-CSF[j][1])/CSF[j][2])*CSF[j][2]\n \n nowtime = depT+CSF[j][0]\n- print(nowtime,depT)\n print(nowtime)\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u869919400", "problem_id": "p03475", "submission1_id": "s325276465", "submission2_id": "s901227623", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nCSF = [list(map(int, input().split())) for i in range(N-1)]\nfor i in range(N-1):\n ans = 0\n for j in range(i, N-1):\n C, S, F = CSF[j]\n if ans <= S:\n ans = S\n else:\n diff = ans - S\n if diff % F != 0:\n ans += F - diff\n ans += C\n print(ans)\nprint(0)", "code2": "N = int(input())\nCSF = [list(map(int, input().split())) for i in range(N-1)]\nfor i in range(N-1):\n ans = 0\n for j in range(i, N-1):\n C, S, F = CSF[j]\n if ans < S:\n ans = S\n else:\n if ans % F != 0:\n ans += F - (ans % F)\n ans += C\n print(ans)\nprint(0)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575249994", "date2": "1575250831", "bleu_score": "0.8907092002354001", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 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, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 103, "input": "4\n4 5 6\n130 5 2\n99 2 2\n", "actual_output": "103\n103\n101\n0\n", "expected_output": "239\n235\n101\n0\n\n", "anno_code": ["N = int(input()) # (0): N=4\nCSF = [list(map(int, input().split())) for i in range(N-1)] # (1): CSF\nfor i in range(N-1): # (2): i=0 (24): i=1 ... (49): NO CHANGE\n ans = 0 # (3): ans=0 (25): ans=0 (41): ans=0\n for j in range(i, N-1): # (4): j=0 (9): j=1 ... (47): NO CHANGE\n C, S, F = CSF[j] # (5): C=4, S=5, F=6 (10): C=130, F=2 ... (43): NO CHANGE\n if ans <= S: # (6): NO CHANGE (11): NO CHANGE ... (44): NO CHANGE\n ans = S # (7): ans=5 (29): ans=5 (45): ans=2\n else:\n diff = ans - S # (12): diff=4 (18): diff=137 (34): diff=133\n if diff % F != 0: # (13): NO CHANGE (19): NO CHANGE (35): NO CHANGE\n ans += F - diff # (20): ans=4 (36): ans=4\n ans += C # (8): ans=9 (14): ans=139 ... (46): ans=101\n print(ans) # (23): NO CHANGE (39): NO CHANGE (48): NO CHANGE\nprint(0)"], "anno_status": [true], "diff_content": " N = int(input())\n CSF = [list(map(int, input().split())) for i in range(N-1)]\n for i in range(N-1):\n ans = 0\n for j in range(i, N-1):\n C, S, F = CSF[j]\n- if ans <= S:\n+ if ans < S:\n ans = S\n else:\n- diff = ans - S\n- if diff % F != 0:\n- ans += F - diff\n+ if ans % F != 0:\n+ ans += F - (ans % F)\n ans += C\n print(ans)\n print(0)\n", "FL_content": " N = int(input())\n CSF = [list(map(int, input().split())) for i in range(N-1)]\n for i in range(N-1):\n ans = 0\n for j in range(i, N-1):\n C, S, F = CSF[j]\n- if ans <= S:\n ans = S\n else:\n- diff = ans - S\n- if diff % F != 0:\n- ans += F - diff\n ans += C\n print(ans)\n print(0)\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 15 }, { "user_id": "u729627789", "problem_id": "p03475", "submission1_id": "s184986690", "submission2_id": "s971117951", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nL = [list(map(int, input().split())) for i in range(N-1)]\nans = []\n\nfor i in range(N-1):\n time = L[i][1]\n for j in range(i, N-1):\n c, s, f = L[j]\n if time >= s:\n time += f - (time % f) \n else:\n time += s - time\n time += c\n ans.append(time)\n\nans.append(0)\nprint(*ans, sep=\"\\n\")", "code2": "N = int(input())\nL = [list(map(int, input().split())) for i in range(N-1)]\nans = []\n\nfor i in range(N-1):\n time = L[i][1]\n for j in range(i, N-1):\n c, s, f = L[j]\n if time < s:\n time = s\n elif time % f == 0:\n pass\n else:\n time += f - time % f\n time += c\n ans.append(time)\n\nans.append(0)\nprint(*ans, sep=\"\\n\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575519034", "date2": "1575519273", "bleu_score": "0.8739284139808365", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 0 1\n1 0 1\n", "actual_output": "5\n2\n0\n", "expected_output": "3\n1\n0\n\n", "anno_code": ["N = int(input()) # (0): N=3\nL = [list(map(int, input().split())) for i in range(N-1)] # (1): L\nans = [] # (2): ans=[]\n\nfor i in range(N-1): # (3): i=0 (17): i=1 (26): NO CHANGE\n time = L[i][1] # (4): time=0 (18): time=0\n for j in range(i, N-1): # (5): j=0 (10): j=1 ... (24): NO CHANGE\n c, s, f = L[j] # (6): c=2, s=0, f=1 (11): c=1 (20): NO CHANGE\n if time >= s: # (7): NO CHANGE (12): NO CHANGE (21): NO CHANGE\n time += f - (time % f) # (8): time=1 (13): time=4 (22): time=1\n else:\n time += s - time\n time += c # (9): time=3 (14): time=5 (23): time=2\n ans.append(time) # (16): ans=[5] (25): ans=[5, 2]\n\nans.append(0) # (27): ans=[5, 2, 0]\nprint(*ans, sep=\"\\n\")"], "anno_status": [true], "diff_content": " N = int(input())\n L = [list(map(int, input().split())) for i in range(N-1)]\n ans = []\n \n for i in range(N-1):\n time = L[i][1]\n for j in range(i, N-1):\n c, s, f = L[j]\n- if time >= s:\n- time += f - (time % f) \n+ if time < s:\n+ time = s\n+ elif time % f == 0:\n+ pass\n else:\n- time += s - time\n+ time += f - time % f\n time += c\n ans.append(time)\n \n ans.append(0)\n print(*ans, sep=\"\\n\")\n", "FL_content": " N = int(input())\n L = [list(map(int, input().split())) for i in range(N-1)]\n ans = []\n \n for i in range(N-1):\n time = L[i][1]\n for j in range(i, N-1):\n c, s, f = L[j]\n- if time >= s:\n- time += f - (time % f) \n else:\n- time += s - time\n time += c\n ans.append(time)\n \n ans.append(0)\n print(*ans, sep=\"\\n\")\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u311379832", "problem_id": "p03475", "submission1_id": "s085243671", "submission2_id": "s952644278", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nc = [list(map(int, input().split())) for _ in range(N - 1)]\nanslst = [0] * N\nfor i in range(N - 1):\n ans = c[i][1] + c[i][0]\n for j in range(i + 1, N - 1):\n if ans <= c[j][1]:\n ans = c[j][1] + c[j][0]\n else:\n tmp = ans - c[j][1]\n amari = tmp % c[j][2]\n if amari == 0:\n ans += c[j][0]\n else:\n ans += c[j][0] + amari\n\n anslst[i] = ans\n\nfor i in anslst:\n print(i)", "code2": "N = int(input())\nc = [list(map(int, input().split())) for _ in range(N - 1)]\nanslst = [0] * N\nfor i in range(N - 1):\n ans = c[i][1] + c[i][0]\n for j in range(i + 1, N - 1):\n if ans <= c[j][1]:\n ans += (c[j][1] - ans) + c[j][0]\n else:\n sho, amari = divmod(ans, c[j][2])\n if amari == 0:\n ans += c[j][0]\n else:\n ans += c[j][0] + (((sho + 1) * c[j][2]) - ans)\n\n anslst[i] = ans\n\nfor i in anslst:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569513360", "date2": "1569517250", "bleu_score": "0.8948796835620269", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n11 24 6\n52 16 4\n99 2 2\n", "actual_output": "189\n167\n101\n0\n", "expected_output": "187\n167\n101\n0\n\n", "anno_code": ["N = int(input()) # (0): N=4\nc = [list(map(int, input().split())) for _ in range(N - 1)] # (1): c\nanslst = [0] * N # (2): anslst=[0, 0, 0, 0]\nfor i in range(N - 1): # (3): i=0 (19): i=1 ... (33): NO CHANGE\n ans = c[i][1] + c[i][0] # (4): ans=35 (20): ans=68 (30): ans=101\n for j in range(i + 1, N - 1): # (5): j=1 (11): j=2 ... (31): NO CHANGE\n if ans <= c[j][1]: # (6): NO CHANGE (12): NO CHANGE (22): NO CHANGE\n ans = c[j][1] + c[j][0]\n else:\n tmp = ans - c[j][1] # (7): tmp=19 (13): tmp=88 (23): tmp=66\n amari = tmp % c[j][2] # (8): amari=3 (14): amari=0 (24): NO CHANGE\n if amari == 0: # (9): NO CHANGE (15): NO CHANGE (25): NO CHANGE\n ans += c[j][0] # (16): ans=189 (26): ans=167\n else:\n ans += c[j][0] + amari # (10): ans=90\n\n anslst[i] = ans # (18): anslst=[189, 0, 0, 0] (28): anslst=[189, 167, 0, 0] (32): anslst=[189, 167, 101, 0]\n\nfor i in anslst: # (34): i=189 (36): i=167 ... (40): i=0\n print(i) # (35): NO CHANGE (37): NO CHANGE ... (41): NO CHANGE\n"], "anno_status": [true], "diff_content": " N = int(input())\n c = [list(map(int, input().split())) for _ in range(N - 1)]\n anslst = [0] * N\n for i in range(N - 1):\n ans = c[i][1] + c[i][0]\n for j in range(i + 1, N - 1):\n if ans <= c[j][1]:\n- ans = c[j][1] + c[j][0]\n+ ans += (c[j][1] - ans) + c[j][0]\n else:\n- tmp = ans - c[j][1]\n- amari = tmp % c[j][2]\n+ sho, amari = divmod(ans, c[j][2])\n if amari == 0:\n ans += c[j][0]\n else:\n- ans += c[j][0] + amari\n+ ans += c[j][0] + (((sho + 1) * c[j][2]) - ans)\n \n anslst[i] = ans\n \n for i in anslst:\n print(i)\n", "FL_content": " N = int(input())\n c = [list(map(int, input().split())) for _ in range(N - 1)]\n anslst = [0] * N\n for i in range(N - 1):\n ans = c[i][1] + c[i][0]\n for j in range(i + 1, N - 1):\n if ans <= c[j][1]:\n- ans = c[j][1] + c[j][0]\n else:\n- tmp = ans - c[j][1]\n- amari = tmp % c[j][2]\n if amari == 0:\n ans += c[j][0]\n else:\n- ans += c[j][0] + amari\n \n anslst[i] = ans\n \n for i in anslst:\n print(i)\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 20 }, { "user_id": "u152638361", "problem_id": "p03475", "submission1_id": "s682910812", "submission2_id": "s073315023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nCSF = [list(map(int,input().split())) for i in range(N-1)]\nCSF.append([0,0,1])\nans=[0]*N \nfor i in range(N-1):\n for j in range(i,N-1):\n if j == i:\n ans[i]+=CSF[j][0]+CSF[j][1]\n else:\n if ans[i]<=CSF[j][1]:\n ans[i]=CSF[j][0]+CSF[j][1]\n else:\n ans[i]+=(ans[i]-CSF[j][1])%CSF[j][2]+CSF[j][0] \nfor i in range(N):\n print(ans[i])", "code2": "N = int(input())\nCSF = [list(map(int,input().split())) for i in range(N-1)]\nCSF.append([0,0,1])\nans=[0]*N \nfor i in range(N-1):\n for j in range(i,N-1):\n if j == i:\n ans[i]+=CSF[j][0]+CSF[j][1]\n else:\n if ans[i]<=CSF[j][1]:\n ans[i]=CSF[j][0]+CSF[j][1]\n elif (ans[i]-CSF[j][1])%CSF[j][2]==0:\n ans[i]+=CSF[j][0]\n else:\n ans[i]+=(CSF[j][2]-(ans[i]-CSF[j][1])%CSF[j][2])+CSF[j][0] \nfor i in range(N):\n print(ans[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571681344", "date2": "1571682083", "bleu_score": "0.8106062699289392", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n17 24 6\n16 16 4\n99 2 2\n", "actual_output": "157\n131\n101\n0\n", "expected_output": "159\n131\n101\n0\n\n", "anno_code": ["N = int(input()) # (0): N=4\nCSF = [list(map(int,input().split())) for i in range(N-1)] # (1): CSF\nCSF.append([0,0,1]) # (2): CSF\nans=[0]*N # (3): ans=[0, 0, 0, 0]\nfor i in range(N-1): # (4): i=0 (17): i=1 ... (31): NO CHANGE\n for j in range(i,N-1): # (5): j=0 (8): j=1 ... (30): NO CHANGE\n if j == i: # (6): NO CHANGE (9): NO CHANGE ... (28): NO CHANGE\n ans[i]+=CSF[j][0]+CSF[j][1] # (7): ans=[41, 0, 0, 0] (20): ans=[157, 32, 0, 0] (29): ans=[157, 131, 101, 0]\n else:\n if ans[i]<=CSF[j][1]: # (10): NO CHANGE (14): NO CHANGE (23): NO CHANGE\n ans[i]=CSF[j][0]+CSF[j][1]\n else:\n ans[i]+=(ans[i]-CSF[j][1])%CSF[j][2]+CSF[j][0] # (11): ans=[58, 0, 0, 0] (15): ans=[157, 0, 0, 0] (24): ans=[157, 131, 0, 0]\nfor i in range(N): # (32): i=0 (34): i=1 ... (38): i=3\n print(ans[i]) # (33): NO CHANGE (35): NO CHANGE ... (39): NO CHANGE\n"], "anno_status": [true], "diff_content": " N = int(input())\n CSF = [list(map(int,input().split())) for i in range(N-1)]\n CSF.append([0,0,1])\n ans=[0]*N \n for i in range(N-1):\n for j in range(i,N-1):\n if j == i:\n ans[i]+=CSF[j][0]+CSF[j][1]\n else:\n if ans[i]<=CSF[j][1]:\n ans[i]=CSF[j][0]+CSF[j][1]\n+ elif (ans[i]-CSF[j][1])%CSF[j][2]==0:\n+ ans[i]+=CSF[j][0]\n else:\n- ans[i]+=(ans[i]-CSF[j][1])%CSF[j][2]+CSF[j][0] \n+ ans[i]+=(CSF[j][2]-(ans[i]-CSF[j][1])%CSF[j][2])+CSF[j][0] \n for i in range(N):\n print(ans[i])\n", "FL_content": " N = int(input())\n CSF = [list(map(int,input().split())) for i in range(N-1)]\n CSF.append([0,0,1])\n ans=[0]*N \n for i in range(N-1):\n for j in range(i,N-1):\n if j == i:\n ans[i]+=CSF[j][0]+CSF[j][1]\n else:\n if ans[i]<=CSF[j][1]:\n ans[i]=CSF[j][0]+CSF[j][1]\n else:\n- ans[i]+=(ans[i]-CSF[j][1])%CSF[j][2]+CSF[j][0] \n for i in range(N):\n print(ans[i])\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u492049124", "problem_id": "p03475", "submission1_id": "s984924012", "submission2_id": "s887940912", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nlines = []\n\nfor i in range(N-1):\n lines.append(input())\n\nC = []\nS = []\nF = []\n\nfor line in lines:\n\tc, s, f = line.split()\n\tC.append(int(c))\n\tS.append(int(s))\n\tF.append(int(f))\n\nA = []\n\nfor i in range(N-1):\n\ta = C[i] + S[i]\n\tfor j in range(i + 1, N - 1):\n\t\t\n\t\tn = S[j] - a if a <= S[j] else F[j] - (a % F[j])\n\t\ta = a + C[j] + n\n\tA.append(a)\n\nfor a in A:\n\tprint(a)\nprint(0)\n", "code2": "N = int(input())\nlines = []\n\nfor i in range(N-1):\n lines.append(input())\n\nC = []\nS = []\nF = []\n\nfor line in lines:\n\tc, s, f = line.split()\n\tC.append(int(c))\n\tS.append(int(s))\n\tF.append(int(f))\n\nA = []\n\nfor i in range(N-1):\n\ta = C[i] + S[i]\n\tfor j in range(i + 1, N - 1):\n\t\tn = S[j] - a if a <= S[j] else (a - S[j]) % F[j]\n\t\tn = F[j] - n if a > S[j] and n != 0 else n\n\t\t\n\t\ta = a + C[j] + n\n\tA.append(a)\n\nfor a in A:\n\tprint(a)\nprint(0)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528246546", "date2": "1528247513", "bleu_score": "0.8859636967876354", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 103, "input": "4\n1 0 7\n52 8 4\n99 4 2\n", "actual_output": "161\n161\n103\n0\n", "expected_output": "159\n159\n103\n0\n\n", "anno_code": ["N = int(input()) # (0): N=4\nlines = [] # (1): lines=[]\n\nfor i in range(N-1): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n lines.append(input()) # (3): lines=['1 0 7'] (5): lines=['1 0 7', '52 8 4'] (7): lines=['1 0 7', '52 8 4', '99 4 2']\n\nC = [] # (9): C=[]\nS = [] # (10): S=[]\nF = [] # (11): F=[]\n\nfor line in lines: # (12): line=1 0 7 (17): line=52 8 4 ... (27): NO CHANGE\n\tc, s, f = line.split() # (13): c=1, s=0, f=7 (18): c=52, s=8, f=4 (23): c=99, s=4, f=2\n\tC.append(int(c)) # (14): C=[1] (19): C=[1, 52] (24): C=[1, 52, 99]\n\tS.append(int(s)) # (15): S=[0] (20): S=[0, 8] (25): S=[0, 8, 4]\n\tF.append(int(f)) # (16): F=[7] (21): F=[7, 4] (26): F=[7, 4, 2]\n\nA = [] # (28): A=[]\n\nfor i in range(N-1): # (29): i=0 (39): i=1 ... (50): NO CHANGE\n\ta = C[i] + S[i] # (30): a=1 (40): a=60 (47): a=103\n\tfor j in range(i + 1, N - 1): # (31): j=1 (34): j=2 ... (48): NO CHANGE\n\t\t\n\t\tn = S[j] - a if a <= S[j] else F[j] - (a % F[j]) # (32): n=7 (35): n=2 (42): NO CHANGE\n\t\ta = a + C[j] + n # (33): a=60 (36): a=161 (43): a=161\n\tA.append(a) # (38): A=[161] (45): A=[161, 161] (49): A=[161, 161, 103]\n\nfor a in A: # (51): a=161 (53): NO CHANGE ... (57): NO CHANGE\n\tprint(a) # (52): NO CHANGE (54): NO CHANGE (56): NO CHANGE\nprint(0)\n"], "anno_status": [true], "diff_content": " N = int(input())\n lines = []\n \n for i in range(N-1):\n lines.append(input())\n \n C = []\n S = []\n F = []\n \n for line in lines:\n \tc, s, f = line.split()\n \tC.append(int(c))\n \tS.append(int(s))\n \tF.append(int(f))\n \n A = []\n \n for i in range(N-1):\n \ta = C[i] + S[i]\n \tfor j in range(i + 1, N - 1):\n+\t\tn = S[j] - a if a <= S[j] else (a - S[j]) % F[j]\n+\t\tn = F[j] - n if a > S[j] and n != 0 else n\n \t\t\n-\t\tn = S[j] - a if a <= S[j] else F[j] - (a % F[j])\n \t\ta = a + C[j] + n\n \tA.append(a)\n \n for a in A:\n \tprint(a)\n print(0)\n \n+\n", "FL_content": " N = int(input())\n lines = []\n \n for i in range(N-1):\n lines.append(input())\n \n C = []\n S = []\n F = []\n \n for line in lines:\n \tc, s, f = line.split()\n \tC.append(int(c))\n \tS.append(int(s))\n \tF.append(int(f))\n \n A = []\n \n for i in range(N-1):\n \ta = C[i] + S[i]\n \tfor j in range(i + 1, N - 1):\n \t\t\n-\t\tn = S[j] - a if a <= S[j] else F[j] - (a % F[j])\n \t\ta = a + C[j] + n\n \tA.append(a)\n \n for a in A:\n \tprint(a)\n print(0)\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 30 }, { "user_id": "u965230804", "problem_id": "p03475", "submission1_id": "s280808969", "submission2_id": "s384072275", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ncsf = []\nfor i in range(n - 1):\n csf.append(list(map(int, input().split())))\n\nfor i in range(n):\n AnsSec = 0\n Now_Station = i\n while Now_Station < n - 1:\n if AnsSec > csf[Now_Station][1]:\n if csf[Now_Station][2] % AnsSec != 0:\n AnsSec += csf[Now_Station][2] - (AnsSec % csf[Now_Station][2] )\n else:\n AnsSec += csf[Now_Station][1] - AnsSec\n AnsSec += csf[Now_Station][0]\n Now_Station += 1\n print(AnsSec)\n", "code2": "n = int(input())\ncsf = []\nfor i in range(n - 1):\n csf.append(list(map(int, input().split())))\n\nfor i in range(n):\n AnsSec = 0\n Now_Station = i\n while Now_Station < n - 1:\n if AnsSec > csf[Now_Station][1]:\n if AnsSec % csf[Now_Station][2] != 0:\n AnsSec += csf[Now_Station][2] - (AnsSec % csf[Now_Station][2])\n else:\n AnsSec += csf[Now_Station][1] - AnsSec\n AnsSec += csf[Now_Station][0]\n Now_Station += 1\n print(AnsSec)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514692051", "date2": "1514692325", "bleu_score": "0.9889121738648614", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1], "code1_test_score": 32, "total_score": 103, "input": "4\n17 24 6\n16 16 4\n99 2 2\n", "actual_output": "161\n133\n101\n0\n", "expected_output": "159\n131\n101\n0\n\n", "anno_code": ["n = int(input()) # (0): n=4\ncsf = [] # (1): csf=[]\nfor i in range(n - 1): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n csf.append(list(map(int, input().split()))) # (3): csf=[[17, 24, 6]] (5): csf (7): csf\n\nfor i in range(n): # (9): i=0 (31): i=1 ... (57): i=3\n AnsSec = 0 # (10): AnsSec=0 (32): AnsSec=0 ... (58): AnsSec=0\n Now_Station = i # (11): Now_Station=0 (33): Now_Station=1 ... (59): NO CHANGE\n while Now_Station < n - 1: # (12): NO CHANGE (17): NO CHANGE ... (60): NO CHANGE\n if AnsSec > csf[Now_Station][1]: # (13): NO CHANGE (18): NO CHANGE ... (51): NO CHANGE\n if csf[Now_Station][2] % AnsSec != 0: # (19): NO CHANGE (25): NO CHANGE (41): NO CHANGE\n AnsSec += csf[Now_Station][2] - (AnsSec % csf[Now_Station][2] ) # (20): AnsSec=44 (26): AnsSec=62 (42): AnsSec=34\n else:\n AnsSec += csf[Now_Station][1] - AnsSec # (14): AnsSec=24 (36): AnsSec=16 (52): AnsSec=2\n AnsSec += csf[Now_Station][0] # (15): AnsSec=41 (21): AnsSec=60 ... (53): AnsSec=101\n Now_Station += 1 # (16): Now_Station=1 (22): Now_Station=2 ... (54): Now_Station=3\n print(AnsSec) # (30): NO CHANGE (46): NO CHANGE ... (61): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n csf = []\n for i in range(n - 1):\n csf.append(list(map(int, input().split())))\n \n for i in range(n):\n AnsSec = 0\n Now_Station = i\n while Now_Station < n - 1:\n if AnsSec > csf[Now_Station][1]:\n- if csf[Now_Station][2] % AnsSec != 0:\n- AnsSec += csf[Now_Station][2] - (AnsSec % csf[Now_Station][2] )\n+ if AnsSec % csf[Now_Station][2] != 0:\n+ AnsSec += csf[Now_Station][2] - (AnsSec % csf[Now_Station][2])\n else:\n AnsSec += csf[Now_Station][1] - AnsSec\n AnsSec += csf[Now_Station][0]\n Now_Station += 1\n print(AnsSec)\n \n", "FL_content": " n = int(input())\n csf = []\n for i in range(n - 1):\n csf.append(list(map(int, input().split())))\n \n for i in range(n):\n AnsSec = 0\n Now_Station = i\n while Now_Station < n - 1:\n if AnsSec > csf[Now_Station][1]:\n- if csf[Now_Station][2] % AnsSec != 0:\n- AnsSec += csf[Now_Station][2] - (AnsSec % csf[Now_Station][2] )\n else:\n AnsSec += csf[Now_Station][1] - AnsSec\n AnsSec += csf[Now_Station][0]\n Now_Station += 1\n print(AnsSec)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u780475861", "problem_id": "p03475", "submission1_id": "s631227566", "submission2_id": "s001664079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(100000)\n\nn = int(input())\nlst = []\nfor _ in range(n - 1):\n lst.append([int(i) for i in input().split()])\n\n\ntime_list = []\n\ndef time_cost(i, now, lst):\n if i == n - 1:\n return now\n if now >= lst[i][1]:\n now += now % lst[i][2] + lst[i][0]\n else:\n now = lst[i][1] + lst[i][0]\n return time_cost(i+1, now, lst)\n\nfor i in range(n):\n print(time_cost(i, 0, lst))\n", "code2": "import sys\nsys.setrecursionlimit(2000)\n\nn = int(input())\nlst = []\nfor _ in range(n - 1):\n lst.append([int(i) for i in input().split()])\n\ndef time_cost(i, now, lst):\n if i == n - 1:\n return now\n if now >= lst[i][1]:\n if now % lst[i][2] == 0:\n now += lst[i][0]\n else:\n now += lst[i][0] + lst[i][2] - now % lst[i][2]\n else:\n now = lst[i][1] + lst[i][0]\n return time_cost(i+1, now, lst)\n\nfor i in range(n):\n print(time_cost(i, 0, lst))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576114506", "date2": "1576115819", "bleu_score": "0.8372251950232183", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n15 24 6\n52 16 4\n99 2 2\n", "actual_output": "193\n167\n101\n0\n", "expected_output": "191\n167\n101\n0\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(100000) # (0): NO CHANGE\n\nn = int(input()) # (1): n=4\nlst = [] # (2): lst=[]\nfor _ in range(n - 1): # (3): _=0 (5): _=1 ... (9): NO CHANGE\n lst.append([int(i) for i in input().split()]) # (4): lst=[[15, 24, 6]] (6): lst (8): lst\n\n\ntime_list = [] # (10): time_list=[]\n\ndef time_cost(i, now, lst): # (11): time_cost=\n if i == n - 1: # (14): NO CHANGE (17): NO CHANGE ... (41): sys=, n=4, _=2, time_list=[], time_cost=\n return now\n if now >= lst[i][1]: # (15): NO CHANGE (18): NO CHANGE ... (36): NO CHANGE\n now += now % lst[i][2] + lst[i][0] # (19): i=2, now=94 (22): i=3, now=193 (31): i=3, now=167\n else:\n now = lst[i][1] + lst[i][0] # (16): i=1, now=39 (28): i=2, now=68 (37): i=3, now=101\n return time_cost(i+1, now, lst)\n\nfor i in range(n): # (12): i=0 (24): i=1 ... (39): i=3\n print(time_cost(i, 0, lst)) # (13): now=0 (25): now=0 ... (40): now=0\n"], "anno_status": [true], "diff_content": " import sys\n-sys.setrecursionlimit(100000)\n+sys.setrecursionlimit(2000)\n \n n = int(input())\n lst = []\n for _ in range(n - 1):\n lst.append([int(i) for i in input().split()])\n \n-\n-time_list = []\n-\n def time_cost(i, now, lst):\n if i == n - 1:\n return now\n if now >= lst[i][1]:\n- now += now % lst[i][2] + lst[i][0]\n+ if now % lst[i][2] == 0:\n+ now += lst[i][0]\n+ else:\n+ now += lst[i][0] + lst[i][2] - now % lst[i][2]\n else:\n now = lst[i][1] + lst[i][0]\n return time_cost(i+1, now, lst)\n \n for i in range(n):\n print(time_cost(i, 0, lst))\n \n", "FL_content": " import sys\n-sys.setrecursionlimit(100000)\n \n n = int(input())\n lst = []\n for _ in range(n - 1):\n lst.append([int(i) for i in input().split()])\n \n-\n-time_list = []\n-\n def time_cost(i, now, lst):\n if i == n - 1:\n return now\n if now >= lst[i][1]:\n- now += now % lst[i][2] + lst[i][0]\n else:\n now = lst[i][1] + lst[i][0]\n return time_cost(i+1, now, lst)\n \n for i in range(n):\n print(time_cost(i, 0, lst))\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 23 }, { "user_id": "u483722302", "problem_id": "p03475", "submission1_id": "s951061822", "submission2_id": "s106166326", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\nC = []\nS = []\nF = []\nfor i in range(N-1):\n Ci, Si, Fi = list(map(int, input().split((\" \"))))\n C.append(Ci)\n S.append(Si)\n F.append(Fi)\n\nans = []\nfor i in range(N):\n t = 0\n for j in range(i, N-1):\n if t < S[j]:\n t = S[j]\n elif t % F[j] == 0:\n pass\n else:\n t += t + F[j] - (t % F[j])\n t += C[j]\n print(t)\n\n", "code2": "\nN = int(input())\nC = []\nS = []\nF = []\nfor i in range(N-1):\n Ci, Si, Fi = list(map(int, input().split((\" \"))))\n C.append(Ci)\n S.append(Si)\n F.append(Fi)\n\nans = []\nfor i in range(N):\n t = 0\n for j in range(i, N-1):\n if t < S[j]:\n t = S[j]\n elif t % F[j] == 0:\n pass\n else:\n t = t + F[j] - (t % F[j])\n t += C[j]\n print(t)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1515956197", "date2": "1515956280", "bleu_score": "0.993783280149587", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 103, "input": "4\n26 5 6\n102 5 2\n99 2 2\n", "actual_output": "430\n314\n101\n0\n", "expected_output": "233\n207\n101\n0\n\n", "anno_code": ["\nN = int(input()) # (0): N=4\nC = [] # (1): C=[]\nS = [] # (2): S=[]\nF = [] # (3): F=[]\nfor i in range(N-1): # (4): i=0 (9): i=1 ... (19): NO CHANGE\n Ci, Si, Fi = list(map(int, input().split((\" \")))) # (5): Ci=26, Si=5, Fi=6 (10): Ci=102, Fi=2 (15): Ci=99, Si=2\n C.append(Ci) # (6): C=[26] (11): C=[26, 102] (16): C=[26, 102, 99]\n S.append(Si) # (7): S=[5] (12): S=[5, 5] (17): S=[5, 5, 2]\n F.append(Fi) # (8): F=[6] (13): F=[6, 2] (18): F=[6, 2, 2]\n\nans = [] # (20): ans=[]\nfor i in range(N): # (21): i=0 (39): i=1 ... (60): i=3\n t = 0 # (22): t=0 (40): t=0 ... (61): t=0\n for j in range(i, N-1): # (23): j=0 (27): j=1 ... (62): NO CHANGE\n if t < S[j]: # (24): NO CHANGE (28): NO CHANGE ... (55): NO CHANGE\n t = S[j] # (25): t=5 (43): t=5 (56): t=2\n elif t % F[j] == 0: # (29): NO CHANGE (34): NO CHANGE (47): NO CHANGE\n pass\n else:\n t += t + F[j] - (t % F[j]) # (30): t=63 (35): t=331 (48): t=215\n t += C[j] # (26): t=31 (31): t=165 ... (57): t=101\n print(t) # (38): NO CHANGE (51): NO CHANGE ... (63): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " \n N = int(input())\n C = []\n S = []\n F = []\n for i in range(N-1):\n Ci, Si, Fi = list(map(int, input().split((\" \"))))\n C.append(Ci)\n S.append(Si)\n F.append(Fi)\n \n ans = []\n for i in range(N):\n t = 0\n for j in range(i, N-1):\n if t < S[j]:\n t = S[j]\n elif t % F[j] == 0:\n pass\n else:\n- t += t + F[j] - (t % F[j])\n+ t = t + F[j] - (t % F[j])\n t += C[j]\n print(t)\n \n \n", "FL_content": " \n N = int(input())\n C = []\n S = []\n F = []\n for i in range(N-1):\n Ci, Si, Fi = list(map(int, input().split((\" \"))))\n C.append(Ci)\n S.append(Si)\n F.append(Fi)\n \n ans = []\n for i in range(N):\n t = 0\n for j in range(i, N-1):\n if t < S[j]:\n t = S[j]\n elif t % F[j] == 0:\n pass\n else:\n- t += t + F[j] - (t % F[j])\n t += C[j]\n print(t)\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u948374595", "problem_id": "p03475", "submission1_id": "s172674675", "submission2_id": "s676237414", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ndef gcd(a, b):\n while b:\n a,b = b,a%b\n return a\ndef lcm(a, b):\n return a*b\nCSF = []\nfor i in range(n-1):\n CSF.append(list(map(int, input().split())))\nfor i in range(n-1):\n s = CSF[i][1]\n for j in range(i,n-1):\n s += CSF[j][0]\n if j < n-2:\n if s < CSF[j+1][1]:\n s = CSF[j+1][1]\n if s%CSF[j+1][2] != 0:\n s = lcm(s, CSF[j+1][2])\n print(s)\nprint(0)\n", "code2": "n = int(input())\nCSF = []\nfor i in range(n-1):\n CSF.append(list(map(int, input().split())))\nfor i in range(n-1):\n s = CSF[i][1]\n for j in range(i,n-1):\n s += CSF[j][0]\n if j < n-2:\n if s < CSF[j+1][1]:\n s = CSF[j+1][1]\n if s%CSF[j+1][2] != 0:\n s = (s\n print(s)\nprint(0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514687835", "date2": "1514690226", "bleu_score": "0.7136448324675003", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 103, "input": "4\n12 24 3\n5 16 4\n121 0 2\n", "actual_output": "203\n163\n121\n0\n", "expected_output": "163\n143\n121\n0\n\n", "anno_code": ["n = int(input()) # (0): n=4\ndef gcd(a, b): # (1): gcd=\n while b:\n a,b = b,a%b\n return a\ndef lcm(a, b): # (2): lcm=\n return a*b\nCSF = [] # (3): CSF=[]\nfor i in range(n-1): # (4): i=0 (6): i=1 ... (10): NO CHANGE\n CSF.append(list(map(int, input().split()))) # (5): CSF=[[12, 24, 3]] (7): CSF (9): CSF\nfor i in range(n-1): # (11): i=0 (29): i=1 ... (49): NO CHANGE\n s = CSF[i][1] # (12): s=24 (30): s=16 (43): s=0\n for j in range(i,n-1): # (13): j=0 (18): j=1 ... (47): NO CHANGE\n s += CSF[j][0] # (14): s=36 (19): s=41 ... (45): s=121\n if j < n-2: # (15): NO CHANGE (20): NO CHANGE ... (46): NO CHANGE\n if s < CSF[j+1][1]: # (16): NO CHANGE (21): NO CHANGE (34): NO CHANGE\n s = CSF[j+1][1]\n if s%CSF[j+1][2] != 0: # (17): NO CHANGE (22): NO CHANGE (35): NO CHANGE\n s = lcm(s, CSF[j+1][2]) # (23): s=82 (36): s=42\n print(s) # (28): NO CHANGE (41): NO CHANGE (48): NO CHANGE\nprint(0)\n"], "anno_status": [true], "diff_content": " n = int(input())\n-def gcd(a, b):\n- while b:\n- a,b = b,a%b\n- return a\n-def lcm(a, b):\n- return a*b\n CSF = []\n for i in range(n-1):\n CSF.append(list(map(int, input().split())))\n for i in range(n-1):\n s = CSF[i][1]\n for j in range(i,n-1):\n s += CSF[j][0]\n if j < n-2:\n if s < CSF[j+1][1]:\n s = CSF[j+1][1]\n if s%CSF[j+1][2] != 0:\n- s = lcm(s, CSF[j+1][2])\n+ s = (s\n print(s)\n print(0)\n \n", "FL_content": " n = int(input())\n-def gcd(a, b):\n- while b:\n- a,b = b,a%b\n- return a\n-def lcm(a, b):\n- return a*b\n CSF = []\n for i in range(n-1):\n CSF.append(list(map(int, input().split())))\n for i in range(n-1):\n s = CSF[i][1]\n for j in range(i,n-1):\n s += CSF[j][0]\n if j < n-2:\n if s < CSF[j+1][1]:\n s = CSF[j+1][1]\n if s%CSF[j+1][2] != 0:\n- s = lcm(s, CSF[j+1][2])\n print(s)\n print(0)\n \n", "added_lines": 1, "removed_lines": 7, "code1_lines": 22 }, { "user_id": "u411858517", "problem_id": "p03475", "submission1_id": "s700309976", "submission2_id": "s917794942", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nl = [list(map(int, input().split())) for j in range(N-1)]\n\nt = []\nfor i in range(N-1):\n t.append(l[i][0]+l[i][1])\n for j in range(1, N-i-1):\n if t[i] < l[i+j][1]:\n t[i] = l[i+j][1] + l[i+j][0]\n \n else: \n t[i] += -(t[i]%(l[i+j][2])) + l[i+j][2] + l[i+j][0] \n\nt.append(0)\nfor i in range(N):\n print(t[i])\n\n", "code2": "N = int(input())\nl = [list(map(int, input().split())) for j in range(N-1)]\n\nt = []\nfor i in range(N):\n t = 0\n for j in range(i, N-1):\n if t < l[j][1]:\n t = l[j][1] \n \n elif 0 == (t%(l[j][2])): \n pass\n \n else:\n t += -(t%(l[j][2])) + l[j][2] \n \n t += l[j][0] \n\n print(t)\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528834237", "date2": "1528835831", "bleu_score": "0.7019085729586406", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 103, "input": "3\n6 5 1\n3 10 1\n", "actual_output": "15\n13\n0\n", "expected_output": "14\n13\n0\n\n", "anno_code": ["N = int(input()) # (0): N=3\nl = [list(map(int, input().split())) for j in range(N-1)] # (1): l\n\nt = [] # (2): t=[]\nfor i in range(N-1): # (3): i=0 (9): i=1 (12): NO CHANGE\n t.append(l[i][0]+l[i][1]) # (4): t=[11] (10): t=[15, 13]\n for j in range(1, N-i-1): # (5): j=1 (8): NO CHANGE (11): NO CHANGE\n if t[i] < l[i+j][1]: # (6): NO CHANGE\n t[i] = l[i+j][1] + l[i+j][0]\n \n else: \n t[i] += -(t[i]%(l[i+j][2])) + l[i+j][2] + l[i+j][0] # (7): t=[15]\n\nt.append(0) # (13): t=[15, 13, 0]\nfor i in range(N): # (14): i=0 (16): i=1 (18): i=2\n print(t[i]) # (15): NO CHANGE (17): NO CHANGE (19): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " N = int(input())\n l = [list(map(int, input().split())) for j in range(N-1)]\n \n t = []\n-for i in range(N-1):\n- t.append(l[i][0]+l[i][1])\n- for j in range(1, N-i-1):\n- if t[i] < l[i+j][1]:\n- t[i] = l[i+j][1] + l[i+j][0]\n+for i in range(N):\n+ t = 0\n+ for j in range(i, N-1):\n+ if t < l[j][1]:\n+ t = l[j][1] \n \n- else: \n- t[i] += -(t[i]%(l[i+j][2])) + l[i+j][2] + l[i+j][0] \n+ elif 0 == (t%(l[j][2])): \n+ pass\n+ \n+ else:\n+ t += -(t%(l[j][2])) + l[j][2] \n+ \n+ t += l[j][0] \n+\n+ print(t)\n \n-t.append(0)\n-for i in range(N):\n- print(t[i])\n \n \n", "FL_content": " N = int(input())\n l = [list(map(int, input().split())) for j in range(N-1)]\n \n t = []\n-for i in range(N-1):\n- t.append(l[i][0]+l[i][1])\n- for j in range(1, N-i-1):\n- if t[i] < l[i+j][1]:\n- t[i] = l[i+j][1] + l[i+j][0]\n \n- else: \n- t[i] += -(t[i]%(l[i+j][2])) + l[i+j][2] + l[i+j][0] \n \n-t.append(0)\n-for i in range(N):\n- print(t[i])\n \n \n", "added_lines": 14, "removed_lines": 10, "code1_lines": 18 }, { "user_id": "u587589241", "problem_id": "p03475", "submission1_id": "s655746235", "submission2_id": "s519475260", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nn=int(input())\nc=[]\ns=[]\nf=[]\nif n==1:\n print(0)\n sys.exit()\nfor i in range(n-1):\n C,S,F=map(int,input().split())\n c.append(C)\n s.append(S)\n f.append(F)\nfor i in range(n-1):\n tmp=0\n while is[i]:\n b=(tmp-s[i])%f[i]\n a=tmp+b\n tmp=a+c[i]\n i+=1\n print(tmp)\nprint(0)", "code2": "import sys\nn=int(input())\nc=[]\ns=[]\nf=[]\nif n==1:\n print(0)\n sys.exit()\nfor i in range(n-1):\n C,S,F=map(int,input().split())\n c.append(C)\n s.append(S)\n f.append(F)\nfor i in range(n-1):\n tmp=0\n while is[i]:\n b=f[i]-(tmp-s[i])%f[i]\n a=tmp+b\n tmp=a+c[i]\n i+=1\n print(tmp)\nprint(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591544262", "date2": "1591544696", "bleu_score": "0.9645674014772231", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1], "code1_test_score": 43, "total_score": 103, "input": "3\n9 4 1\n1 10 1\n", "actual_output": "12\n11\n0\n", "expected_output": "14\n11\n0\n\n", "anno_code": ["import sys\nn=int(input()) # (0): n=3\nc=[] # (1): c=[]\ns=[] # (2): s=[]\nf=[] # (3): f=[]\nif n==1: # (4): NO CHANGE\n print(0)\n sys.exit()\nfor i in range(n-1): # (5): i=0 (10): i=1 (15): NO CHANGE\n C,S,F=map(int,input().split()) # (6): C=9, S=4, F=1 (11): C=1, S=10\n c.append(C) # (7): c=[9] (12): c=[9, 1]\n s.append(S) # (8): s=[4] (13): s=[4, 10]\n f.append(F) # (9): f=[1] (14): f=[1, 1]\nfor i in range(n-1): # (16): i=0 (31): i=1 (40): NO CHANGE\n tmp=0 # (17): tmp=0 (32): tmp=0\n while is[i]:\n b=(tmp-s[i])%f[i]\n a=tmp+b\n tmp=a+c[i] # (21): tmp=13 (27): tmp=12 (36): tmp=11\n i+=1 # (22): i=1 (28): i=2 (37): i=2\n print(tmp) # (30): NO CHANGE (39): NO CHANGE\nprint(0)"], "anno_status": [true], "diff_content": " import sys\n n=int(input())\n c=[]\n s=[]\n f=[]\n if n==1:\n print(0)\n sys.exit()\n for i in range(n-1):\n C,S,F=map(int,input().split())\n c.append(C)\n s.append(S)\n f.append(F)\n for i in range(n-1):\n tmp=0\n while is[i]:\n- b=(tmp-s[i])%f[i]\n+ b=f[i]-(tmp-s[i])%f[i]\n a=tmp+b\n tmp=a+c[i]\n i+=1\n print(tmp)\n print(0)\n", "FL_content": " import sys\n n=int(input())\n c=[]\n s=[]\n f=[]\n if n==1:\n print(0)\n sys.exit()\n for i in range(n-1):\n C,S,F=map(int,input().split())\n c.append(C)\n s.append(S)\n f.append(F)\n for i in range(n-1):\n tmp=0\n while is[i]:\n- b=(tmp-s[i])%f[i]\n a=tmp+b\n tmp=a+c[i]\n i+=1\n print(tmp)\n print(0)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 27 }, { "user_id": "u941884460", "problem_id": "p03475", "submission1_id": "s470874498", "submission2_id": "s433010308", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())-1\ntimeLine = [[0 for x in range(3)] for y in range(N)]\nfor i in range(N):\n tmp = input().split()\n timeLine[i][0],timeLine[i][1],timeLine[i][2] = int(tmp[0]),int(tmp[1]),int(tmp[2])\nfor j in range(N):\n total = timeLine[j][0] + timeLine[j][1]\n now = j+1\n while now <= (N-1):\n if timeLine[now][1] >= total:\n total = timeLine[now][1] + timeLine[now][0]\n else:\n wait = int((total - timeLine[now][1]) % timeLine[now][2])\n total += (wait + timeLine[now][0])\n now +=1\n print(total)\nprint(0)", "code2": "N = int(input())-1\ntimeLine = [[0 for x in range(3)] for y in range(N)]\nfor i in range(N):\n tmp = input().split()\n timeLine[i][0],timeLine[i][1],timeLine[i][2] = int(tmp[0]),int(tmp[1]),int(tmp[2])\nfor j in range(N):\n total = timeLine[j][0] + timeLine[j][1]\n now = j+1\n while now <= (N-1):\n if timeLine[now][1] >= total:\n total = timeLine[now][1] + timeLine[now][0]\n else:\n if timeLine[now][1] + timeLine[now][2] >= total:\n total = timeLine[now][0] + timeLine[now][1] + timeLine[now][2]\n else:\n n = int((total-timeLine[now][1])/timeLine[now][2])\n if (total-timeLine[now][1]) % timeLine[now][2] > 0:\n n += 1\n total = timeLine[now][0] + timeLine[now][1] + timeLine[now][2] * n\n now +=1\n print(total)\nprint(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1520713196", "date2": "1520714380", "bleu_score": "0.6486287975059869", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n19 24 3\n32 16 4\n99 2 2\n", "actual_output": "177\n147\n101\n0\n", "expected_output": "175\n147\n101\n0\n\n", "anno_code": ["N = int(input())-1 # (0): N=3\ntimeLine = [[0 for x in range(3)] for y in range(N)] # (1): timeLine\nfor i in range(N): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n tmp = input().split() # (3): tmp=['19', '24', '3'] (6): tmp=['32', '16', '4'] (9): tmp=['99', '2', '2']\n timeLine[i][0],timeLine[i][1],timeLine[i][2] = int(tmp[0]),int(tmp[1]),int(tmp[2]) # (4): timeLine=[[19, 24, 3], [0, 0, 0], [0, 0, 0]] (7): timeLine (10): timeLine\nfor j in range(N): # (12): j=0 (27): j=1 ... (42): NO CHANGE\n total = timeLine[j][0] + timeLine[j][1] # (13): total=43 (28): total=48 (38): total=101\n now = j+1 # (14): now=1 (29): now=2 (39): NO CHANGE\n while now <= (N-1): # (15): NO CHANGE (20): NO CHANGE ... (40): NO CHANGE\n if timeLine[now][1] >= total: # (16): NO CHANGE (21): NO CHANGE (31): NO CHANGE\n total = timeLine[now][1] + timeLine[now][0]\n else:\n wait = int((total - timeLine[now][1]) % timeLine[now][2]) # (17): wait=3 (22): wait=0 (32): NO CHANGE\n total += (wait + timeLine[now][0]) # (18): total=78 (23): total=177 (33): total=147\n now +=1 # (19): now=2 (24): now=3 (34): now=3\n print(total) # (26): NO CHANGE (36): NO CHANGE (41): NO CHANGE\nprint(0)"], "anno_status": [true], "diff_content": " N = int(input())-1\n timeLine = [[0 for x in range(3)] for y in range(N)]\n for i in range(N):\n tmp = input().split()\n timeLine[i][0],timeLine[i][1],timeLine[i][2] = int(tmp[0]),int(tmp[1]),int(tmp[2])\n for j in range(N):\n total = timeLine[j][0] + timeLine[j][1]\n now = j+1\n while now <= (N-1):\n if timeLine[now][1] >= total:\n total = timeLine[now][1] + timeLine[now][0]\n else:\n- wait = int((total - timeLine[now][1]) % timeLine[now][2])\n- total += (wait + timeLine[now][0])\n+ if timeLine[now][1] + timeLine[now][2] >= total:\n+ total = timeLine[now][0] + timeLine[now][1] + timeLine[now][2]\n+ else:\n+ n = int((total-timeLine[now][1])/timeLine[now][2])\n+ if (total-timeLine[now][1]) % timeLine[now][2] > 0:\n+ n += 1\n+ total = timeLine[now][0] + timeLine[now][1] + timeLine[now][2] * n\n now +=1\n print(total)\n print(0)\n", "FL_content": " N = int(input())-1\n timeLine = [[0 for x in range(3)] for y in range(N)]\n for i in range(N):\n tmp = input().split()\n timeLine[i][0],timeLine[i][1],timeLine[i][2] = int(tmp[0]),int(tmp[1]),int(tmp[2])\n for j in range(N):\n total = timeLine[j][0] + timeLine[j][1]\n now = j+1\n while now <= (N-1):\n if timeLine[now][1] >= total:\n total = timeLine[now][1] + timeLine[now][0]\n else:\n- wait = int((total - timeLine[now][1]) % timeLine[now][2])\n- total += (wait + timeLine[now][0])\n now +=1\n print(total)\n print(0)\n", "added_lines": 7, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u098968285", "problem_id": "p03626", "submission1_id": "s295504884", "submission2_id": "s436548268", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ns1 = input()\ns2 = input()\n\nMOD = int(1e9) + 7\n\ntate = \"tate\"\nyoko = \"yoko\"\n\ni = 0\nans = 0\npre = \"\"\nif s1[i] == s2[i]:\n ans = 3\n i += 1\n pre = tate\nelse:\n ans = 6\n i += 2\n pre = yoko\n\nwhile i < N:\n if s1[i] == s2[i]:\n if pre == tate:\n ans *= 2\n ans %= MOD\n i += 1\n else:\n ans *= 1\n ans %= MOD\n i += 2\n pre = tate\n else:\n if pre == tate:\n ans *= 2\n ans %= MOD\n i += 1\n else:\n ans *= 2\n ans %= MOD\n i += 2\n pre = yoko\nprint(ans)\n", "code2": "N = int(input())\ns1 = input()\ns2 = input()\n\nMOD = int(1e9) + 7\n\ntate = \"tate\"\nyoko = \"yoko\"\n\ni = 0\nans = 0\npre = \"\"\nif s1[i] == s2[i]:\n ans = 3\n i += 1\n pre = tate\nelse:\n ans = 6\n i += 2\n pre = yoko\n\nwhile i < N:\n if s1[i] == s2[i]:\n if pre == tate:\n ans *= 2\n elif pre == yoko:\n ans *= 1\n i += 1\n pre = tate\n else:\n if pre == tate:\n ans *= 2\n elif pre == yoko:\n ans *= 3\n i += 2\n pre = yoko\n ans %= MOD\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1516060278", "date2": "1516061473", "bleu_score": "0.7850862139665428", "code1_test_status": [1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 68, "total_score": 103, "input": "52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXUVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n", "actual_output": "402653184\n", "expected_output": "958681902\n\n", "anno_code": ["N = int(input()) # (0): N=52\ns1 = input() # (1): s1=RvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\ns2 = input() # (2): s2=RLLwwdWIxxNNQUUXXUVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nMOD = int(1e9) + 7 # (3): MOD=1000000007\n\ntate = \"tate\" # (4): tate=tate\nyoko = \"yoko\" # (5): yoko=yoko\n\ni = 0 # (6): i=0\nans = 0 # (7): ans=0\npre = \"\" # (8): pre=\nif s1[i] == s2[i]: # (9): NO CHANGE\n ans = 3 # (10): ans=3\n i += 1 # (11): i=1\n pre = tate # (12): pre=tate\nelse:\n ans = 6\n i += 2\n pre = yoko\n\nwhile i < N: # (13): NO CHANGE (20): NO CHANGE ... (237): NO CHANGE\n if s1[i] == s2[i]: # (14): NO CHANGE (21): NO CHANGE ... (231): NO CHANGE\n if pre == tate: # (36): NO CHANGE (106): NO CHANGE ... (232): NO CHANGE\n ans *= 2 # (128): ans=49152 (135): ans=98304 ... (191): ans=12582912\n ans %= MOD # (129): NO CHANGE (136): NO CHANGE ... (192): NO CHANGE\n i += 1 # (130): i=31 (137): i=32 ... (193): i=42\n else:\n ans *= 1 # (37): NO CHANGE (107): NO CHANGE ... (233): NO CHANGE\n ans %= MOD # (38): NO CHANGE (108): NO CHANGE ... (234): NO CHANGE\n i += 2 # (39): i=8 (109): i=27 ... (235): i=53\n pre = tate # (40): pre=tate (110): pre=tate ... (236): pre=tate\n else:\n if pre == tate: # (15): NO CHANGE (22): NO CHANGE ... (225): NO CHANGE\n ans *= 2 # (16): ans=6 (44): ans=48 ... (198): ans=25165824\n ans %= MOD # (17): NO CHANGE (45): NO CHANGE ... (199): NO CHANGE\n i += 1 # (18): i=2 (46): i=9 ... (200): i=43\n else:\n ans *= 2 # (23): ans=12 (30): ans=24 ... (226): ans=402653184\n ans %= MOD # (24): NO CHANGE (31): NO CHANGE ... (227): NO CHANGE\n i += 2 # (25): i=4 (32): i=6 ... (228): i=51\n pre = yoko # (19): pre=yoko (26): NO CHANGE ... (229): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n s1 = input()\n s2 = input()\n \n MOD = int(1e9) + 7\n \n tate = \"tate\"\n yoko = \"yoko\"\n \n i = 0\n ans = 0\n pre = \"\"\n if s1[i] == s2[i]:\n ans = 3\n i += 1\n pre = tate\n else:\n ans = 6\n i += 2\n pre = yoko\n \n while i < N:\n if s1[i] == s2[i]:\n if pre == tate:\n ans *= 2\n- ans %= MOD\n- i += 1\n- else:\n+ elif pre == yoko:\n ans *= 1\n- ans %= MOD\n- i += 2\n+ i += 1\n pre = tate\n else:\n if pre == tate:\n ans *= 2\n- ans %= MOD\n- i += 1\n- else:\n- ans *= 2\n- ans %= MOD\n- i += 2\n+ elif pre == yoko:\n+ ans *= 3\n+ i += 2\n pre = yoko\n+ ans %= MOD\n print(ans)\n \n", "FL_content": " N = int(input())\n s1 = input()\n s2 = input()\n \n MOD = int(1e9) + 7\n \n tate = \"tate\"\n yoko = \"yoko\"\n \n i = 0\n ans = 0\n pre = \"\"\n if s1[i] == s2[i]:\n ans = 3\n i += 1\n pre = tate\n else:\n ans = 6\n i += 2\n pre = yoko\n \n while i < N:\n if s1[i] == s2[i]:\n if pre == tate:\n ans *= 2\n- ans %= MOD\n- i += 1\n- else:\n ans *= 1\n- ans %= MOD\n- i += 2\n pre = tate\n else:\n if pre == tate:\n ans *= 2\n- ans %= MOD\n- i += 1\n- else:\n- ans *= 2\n- ans %= MOD\n- i += 2\n pre = yoko\n print(ans)\n \n", "added_lines": 6, "removed_lines": 11, "code1_lines": 44 }, { "user_id": "u360116509", "problem_id": "p03626", "submission1_id": "s542694879", "submission2_id": "s221116740", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N = int(input())\n S1 = input()\n S2 = input()\n ans = 3\n i = 0\n while N - 1 > i:\n print(S1[i], S2[i])\n if S1[i] == S2[i]:\n if S1[i + 1] == S2[i + 1]:\n ans *= 2\n i += 1\n else:\n if N > i + 2 and S1[i + 2] != S2[i + 2]:\n ans *= 3\n else:\n ans *= 2\n i += 2\n print(ans % 1000000007)\n\n\nmain()\n", "code2": "def main():\n N = int(input())\n S1 = input()\n S2 = input()\n ans = 3\n i = 0\n while N - 1 > i:\n if S1[i] == S2[i]:\n if S1[i + 1] == S2[i + 1]:\n ans *= 2\n i += 1\n else:\n if N > i + 2 and S1[i + 2] != S2[i + 2]:\n ans *= 3\n else:\n ans *= 2\n i += 2\n print(ans % 1000000007)\n\n\nmain()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561426791", "date2": "1561426820", "bleu_score": "0.9341422777828812", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 9, "total_score": 103, "input": "3\nbaa\nbgb\n", "actual_output": "b b\na g\n6\n", "expected_output": "6\n\n", "anno_code": ["def main(): # (0): main=\n N = int(input()) # (2): N=3\n S1 = input() # (3): S1=baa\n S2 = input() # (4): S2=bgb\n ans = 3 # (5): ans=3\n i = 0 # (6): i=0\n while N - 1 > i: # (7): NO CHANGE (12): NO CHANGE (18): NO CHANGE\n print(S1[i], S2[i]) # (8): NO CHANGE (13): NO CHANGE\n if S1[i] == S2[i]: # (9): NO CHANGE (14): NO CHANGE\n if S1[i + 1] == S2[i + 1]: # (10): NO CHANGE\n ans *= 2\n i += 1 # (11): i=1\n else:\n if N > i + 2 and S1[i + 2] != S2[i + 2]: # (15): NO CHANGE\n ans *= 3\n else:\n ans *= 2 # (16): ans=6\n i += 2 # (17): i=3\n print(ans % 1000000007)\n\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n N = int(input())\n S1 = input()\n S2 = input()\n ans = 3\n i = 0\n while N - 1 > i:\n- print(S1[i], S2[i])\n if S1[i] == S2[i]:\n if S1[i + 1] == S2[i + 1]:\n ans *= 2\n i += 1\n else:\n if N > i + 2 and S1[i + 2] != S2[i + 2]:\n ans *= 3\n else:\n ans *= 2\n i += 2\n print(ans % 1000000007)\n \n \n main()\n \n", "FL_content": " def main():\n N = int(input())\n S1 = input()\n S2 = input()\n ans = 3\n i = 0\n while N - 1 > i:\n- print(S1[i], S2[i])\n if S1[i] == S2[i]:\n if S1[i + 1] == S2[i + 1]:\n ans *= 2\n i += 1\n else:\n if N > i + 2 and S1[i + 2] != S2[i + 2]:\n ans *= 3\n else:\n ans *= 2\n i += 2\n print(ans % 1000000007)\n \n \n main()\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u619458041", "problem_id": "p03626", "submission1_id": "s117133146", "submission2_id": "s483497277", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef main():\n input = sys.stdin.readline\n N = int(input())\n A = [list(map(str, input().strip())) for _ in range(2)]\n MOD = 10**9 + 7\n\n D = []\n flag = False\n for i in range(N):\n if A[0][i] != A[1][i] and flag:\n D.append('h')\n flag = False\n elif A[0][i] != A[1][i]:\n flag = True\n else:\n D.append('v')\n\n if N == 1:\n return 3\n if N == 2:\n return 6\n if N == 3:\n return 6\n\n ans = 3\n for i in range(1, len(D)):\n if D[i-1] == 'v' and D[i] == 'h':\n ans *= 2\n elif D[i-1] == 'v' and D[i] == 'v':\n ans *= 2\n elif D[i-1] == 'h' and D[i] == 'h':\n ans *= 3\n else:\n ans *= 1\n\n\n return ans % MOD\n\n\nif __name__ == '__main__':\n print(main())\n", "code2": "import sys\n\ndef main():\n input = sys.stdin.readline\n N = int(input())\n A = [list(map(str, input().strip())) for _ in range(2)]\n MOD = 10**9 + 7\n\n D = []\n flag = False\n for i in range(N):\n if A[0][i] != A[1][i] and flag:\n D.append('h')\n flag = False\n elif A[0][i] != A[1][i]:\n flag = True\n else:\n D.append('v')\n\n if D[0] == 'h':\n ans = 6\n else:\n ans = 3\n\n for i in range(1, len(D)):\n if D[i-1] == 'v' and D[i] == 'h':\n ans *= 2\n elif D[i-1] == 'v' and D[i] == 'v':\n ans *= 2\n elif D[i-1] == 'h' and D[i] == 'h':\n ans *= 3\n else:\n ans *= 1\n\n return ans % MOD\n\n\nif __name__ == '__main__':\n print(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554172012", "date2": "1554172399", "bleu_score": "0.9165880716013699", "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, 1, 1, 1, 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], "code1_test_score": 101, "total_score": 103, "input": "3\nbab\nbab\n", "actual_output": "6\n", "expected_output": "12\n\n", "anno_code": ["import sys\n\ndef main(): # (0): main=\n input = sys.stdin.readline\n N = int(input())\n A = [list(map(str, input().strip())) for _ in range(2)]\n MOD = 10**9 + 7\n\n D = []\n flag = False\n for i in range(N):\n if A[0][i] != A[1][i] and flag:\n D.append('h')\n flag = False\n elif A[0][i] != A[1][i]:\n flag = True\n else:\n D.append('v')\n\n if N == 1:\n return 3\n if N == 2:\n return 6\n if N == 3:\n return 6\n\n ans = 3\n for i in range(1, len(D)):\n if D[i-1] == 'v' and D[i] == 'h':\n ans *= 2\n elif D[i-1] == 'v' and D[i] == 'v':\n ans *= 2\n elif D[i-1] == 'h' and D[i] == 'h':\n ans *= 3\n else:\n ans *= 1\n\n\n return ans % MOD\n\n\nif __name__ == '__main__':\n print(main())\n"], "anno_status": [true], "diff_content": " import sys\n \n def main():\n input = sys.stdin.readline\n N = int(input())\n A = [list(map(str, input().strip())) for _ in range(2)]\n MOD = 10**9 + 7\n \n D = []\n flag = False\n for i in range(N):\n if A[0][i] != A[1][i] and flag:\n D.append('h')\n flag = False\n elif A[0][i] != A[1][i]:\n flag = True\n else:\n D.append('v')\n \n- if N == 1:\n- return 3\n- if N == 2:\n- return 6\n- if N == 3:\n- return 6\n-\n- ans = 3\n+ if D[0] == 'h':\n+ ans = 6\n+ else:\n+ ans = 3\n+\n for i in range(1, len(D)):\n if D[i-1] == 'v' and D[i] == 'h':\n ans *= 2\n elif D[i-1] == 'v' and D[i] == 'v':\n ans *= 2\n elif D[i-1] == 'h' and D[i] == 'h':\n ans *= 3\n else:\n ans *= 1\n \n-\n return ans % MOD\n \n \n if __name__ == '__main__':\n print(main())\n \n", "FL_content": " import sys\n \n def main():\n input = sys.stdin.readline\n N = int(input())\n A = [list(map(str, input().strip())) for _ in range(2)]\n MOD = 10**9 + 7\n \n D = []\n flag = False\n for i in range(N):\n if A[0][i] != A[1][i] and flag:\n D.append('h')\n flag = False\n elif A[0][i] != A[1][i]:\n flag = True\n else:\n D.append('v')\n \n- if N == 1:\n- return 3\n- if N == 2:\n- return 6\n- if N == 3:\n- return 6\n-\n- ans = 3\n for i in range(1, len(D)):\n if D[i-1] == 'v' and D[i] == 'h':\n ans *= 2\n elif D[i-1] == 'v' and D[i] == 'v':\n ans *= 2\n elif D[i-1] == 'h' and D[i] == 'h':\n ans *= 3\n else:\n ans *= 1\n \n-\n return ans % MOD\n \n \n if __name__ == '__main__':\n print(main())\n \n", "added_lines": 5, "removed_lines": 9, "code1_lines": 44 }, { "user_id": "u006657459", "problem_id": "p03626", "submission1_id": "s352774439", "submission2_id": "s043417231", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS1 = input()\nS2 = input()\npatterns = []\nflag = False\nfor i in range(N):\n if S1[i] == S2[i]:\n patterns.append('row')\n elif flag is False:\n patterns.append('column')\n flag = True\n else:\n flag = False\n\nprint(patterns)\nif patterns[0] == 'row':\n count = 3\nelse:\n count = 6\nfor i in range(1, len(patterns)):\n prev = patterns[i-1]\n current = patterns[i]\n if prev == 'row':\n if current == 'row':\n count *= 2\n else:\n count *= 2\n else: \n if current == 'row':\n count *= 1\n else:\n count *= 3\nprint(count % (10**9 + 7))", "code2": "N = int(input())\nS1 = input()\nS2 = input()\npatterns = []\nflag = False\nfor i in range(N):\n if S1[i] == S2[i]:\n patterns.append('row')\n elif flag is False:\n patterns.append('column')\n flag = True\n else:\n flag = False\n\nif patterns[0] == 'row':\n count = 3\nelse:\n count = 6\nfor i in range(1, len(patterns)):\n prev = patterns[i-1]\n current = patterns[i]\n if prev == 'row':\n if current == 'row':\n count *= 2\n else:\n count *= 2\n else: \n if current == 'row':\n count *= 1\n else:\n count *= 3\nprint(count % (10**9 + 7))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533870667", "date2": "1533870725", "bleu_score": "0.9739605287253958", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\nbaa\nbca\n", "actual_output": "['row', 'column', 'row']\n6\n", "expected_output": "6\n\n", "anno_code": ["N = int(input()) # (0): N=3\nS1 = input() # (1): S1=baa\nS2 = input() # (2): S2=bca\npatterns = [] # (3): patterns=[]\nflag = False # (4): flag=False\nfor i in range(N): # (5): i=0 (8): i=1 ... (16): NO CHANGE\n if S1[i] == S2[i]: # (6): NO CHANGE (9): NO CHANGE (14): NO CHANGE\n patterns.append('row') # (7): patterns=['row'] (15): patterns=['row', 'column', 'row']\n elif flag is False: # (10): NO CHANGE\n patterns.append('column') # (11): patterns=['row', 'column']\n flag = True # (12): flag=True\n else:\n flag = False\n\nprint(patterns) # (17): NO CHANGE\nif patterns[0] == 'row': # (18): NO CHANGE\n count = 3 # (19): count=3\nelse:\n count = 6\nfor i in range(1, len(patterns)): # (20): i=1 (26): i=2 (32): NO CHANGE\n prev = patterns[i-1] # (21): prev=row (27): prev=column\n current = patterns[i] # (22): current=column (28): current=row\n if prev == 'row': # (23): NO CHANGE (29): NO CHANGE\n if current == 'row': # (24): NO CHANGE\n count *= 2\n else:\n count *= 2 # (25): count=6\n else: \n if current == 'row': # (30): NO CHANGE\n count *= 1 # (31): NO CHANGE\n else:\n count *= 3\nprint(count % (10**9 + 7))"], "anno_status": [true], "diff_content": " N = int(input())\n S1 = input()\n S2 = input()\n patterns = []\n flag = False\n for i in range(N):\n if S1[i] == S2[i]:\n patterns.append('row')\n elif flag is False:\n patterns.append('column')\n flag = True\n else:\n flag = False\n \n-print(patterns)\n if patterns[0] == 'row':\n count = 3\n else:\n count = 6\n for i in range(1, len(patterns)):\n prev = patterns[i-1]\n current = patterns[i]\n if prev == 'row':\n if current == 'row':\n count *= 2\n else:\n count *= 2\n else: \n if current == 'row':\n count *= 1\n else:\n count *= 3\n print(count % (10**9 + 7))\n", "FL_content": " N = int(input())\n S1 = input()\n S2 = input()\n patterns = []\n flag = False\n for i in range(N):\n if S1[i] == S2[i]:\n patterns.append('row')\n elif flag is False:\n patterns.append('column')\n flag = True\n else:\n flag = False\n \n-print(patterns)\n if patterns[0] == 'row':\n count = 3\n else:\n count = 6\n for i in range(1, len(patterns)):\n prev = patterns[i-1]\n current = patterns[i]\n if prev == 'row':\n if current == 'row':\n count *= 2\n else:\n count *= 2\n else: \n if current == 'row':\n count *= 1\n else:\n count *= 3\n print(count % (10**9 + 7))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 33 }, { "user_id": "u989345508", "problem_id": "p03626", "submission1_id": "s904263739", "submission2_id": "s129890736", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns1=input()\ns2=input()\nx=[]\nf=0\nfor i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\nl=len(x)\n\nif l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\nelse:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n\n if x==[0]*l or x==[1]*l:\n c+=1\n\n print(c%1000000007)\n", "code2": "n=int(input())\ns1=input()\ns2=input()\nx=[]\nf=0\nfor i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\nl=len(x)\n\nif l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\nelse:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n\n print(c%1000000007)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576256035", "date2": "1576256459", "bleu_score": "0.9201927251657361", "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, 1, 1, 1, 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], "code1_test_score": 101, "total_score": 103, "input": "3\nbab\nbab\n", "actual_output": "13\n", "expected_output": "12\n\n", "anno_code": ["n=int(input()) # (0): n=3\ns1=input() # (1): s1=bab\ns2=input() # (2): s2=bab\nx=[] # (3): x=[]\nf=0 # (4): f=0\nfor i in range(n): # (5): i=0 (9): i=1 ... (17): NO CHANGE\n if f==1: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n f=0\n else:\n if s1[i]==s2[i]: # (7): NO CHANGE (11): NO CHANGE (15): NO CHANGE\n x.append(0) # (8): x=[0] (12): x=[0, 0] (16): x=[0, 0, 0]\n else:\n x.append(1)\n f=1\nl=len(x) # (18): l=3\n\nif l==1: # (19): NO CHANGE\n if x[0]==0:\n print(3)\n else:\n print(6)\nelse:\n if x[0]==0: # (20): NO CHANGE\n c=3 # (21): c=3\n else:\n c=6\n for i in range(1,l): # (22): i=1 (26): i=2 (30): NO CHANGE\n \n if x[i-1]==0: # (23): NO CHANGE (27): NO CHANGE\n c*=2 # (24): c=6 (28): c=12\n else:\n if x[i]==1:\n c*=3\n c%=1000000007 # (25): NO CHANGE (29): NO CHANGE\n\n if x==[0]*l or x==[1]*l: # (31): NO CHANGE\n c+=1 # (32): c=13\n\n print(c%1000000007)\n"], "anno_status": [true], "diff_content": " n=int(input())\n s1=input()\n s2=input()\n x=[]\n f=0\n for i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\n l=len(x)\n \n if l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\n else:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n \n- if x==[0]*l or x==[1]*l:\n- c+=1\n-\n print(c%1000000007)\n \n", "FL_content": " n=int(input())\n s1=input()\n s2=input()\n x=[]\n f=0\n for i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\n l=len(x)\n \n if l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\n else:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n \n- if x==[0]*l or x==[1]*l:\n- c+=1\n-\n print(c%1000000007)\n \n", "added_lines": 0, "removed_lines": 3, "code1_lines": 40 }, { "user_id": "u989345508", "problem_id": "p03626", "submission1_id": "s973777543", "submission2_id": "s129890736", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns1=input()\ns2=input()\nx=[]\nf=0\nfor i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\nl=len(x)\n\nif l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\nelse:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n if x==[0]*l:\n c+=3\n if x==[1]*l:\n c+=3\n\n print(c%1000000007)\n", "code2": "n=int(input())\ns1=input()\ns2=input()\nx=[]\nf=0\nfor i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\nl=len(x)\n\nif l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\nelse:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n\n print(c%1000000007)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576256207", "date2": "1576256459", "bleu_score": "0.8891274170140672", "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, 1, 1, 1, 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], "code1_test_score": 101, "total_score": 103, "input": "3\nbab\nbab\n", "actual_output": "15\n", "expected_output": "12\n\n", "anno_code": ["n=int(input()) # (0): n=3\ns1=input() # (1): s1=bab\ns2=input() # (2): s2=bab\nx=[] # (3): x=[]\nf=0 # (4): f=0\nfor i in range(n): # (5): i=0 (9): i=1 ... (17): NO CHANGE\n if f==1: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n f=0\n else:\n if s1[i]==s2[i]: # (7): NO CHANGE (11): NO CHANGE (15): NO CHANGE\n x.append(0) # (8): x=[0] (12): x=[0, 0] (16): x=[0, 0, 0]\n else:\n x.append(1)\n f=1\nl=len(x) # (18): l=3\n\nif l==1: # (19): NO CHANGE\n if x[0]==0:\n print(3)\n else:\n print(6)\nelse:\n if x[0]==0: # (20): NO CHANGE\n c=3 # (21): c=3\n else:\n c=6\n for i in range(1,l): # (22): i=1 (26): i=2 (30): NO CHANGE\n \n if x[i-1]==0: # (23): NO CHANGE (27): NO CHANGE\n c*=2 # (24): c=6 (28): c=12\n else:\n if x[i]==1:\n c*=3\n c%=1000000007 # (25): NO CHANGE (29): NO CHANGE\n if x==[0]*l: # (31): NO CHANGE\n c+=3 # (32): c=15\n if x==[1]*l: # (33): NO CHANGE\n c+=3\n\n print(c%1000000007)\n"], "anno_status": [true], "diff_content": " n=int(input())\n s1=input()\n s2=input()\n x=[]\n f=0\n for i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\n l=len(x)\n \n if l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\n else:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n- if x==[0]*l:\n- c+=3\n- if x==[1]*l:\n- c+=3\n \n print(c%1000000007)\n \n", "FL_content": " n=int(input())\n s1=input()\n s2=input()\n x=[]\n f=0\n for i in range(n):\n if f==1:\n f=0\n else:\n if s1[i]==s2[i]:\n x.append(0)\n else:\n x.append(1)\n f=1\n l=len(x)\n \n if l==1:\n if x[0]==0:\n print(3)\n else:\n print(6)\n else:\n if x[0]==0:\n c=3\n else:\n c=6\n for i in range(1,l):\n \n if x[i-1]==0:\n c*=2\n else:\n if x[i]==1:\n c*=3\n c%=1000000007\n- if x==[0]*l:\n- c+=3\n- if x==[1]*l:\n- c+=3\n \n print(c%1000000007)\n \n", "added_lines": 0, "removed_lines": 4, "code1_lines": 41 }, { "user_id": "u796424048", "problem_id": "p03626", "submission1_id": "s460557632", "submission2_id": "s052326292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS_1 = list(input())\nS_2 = list(input())\n\n\n\nif S_1[0] == S_2[0]:\n res = 3\n flag = 0\n i = 1\nelse:\n res = 6\n flag = 1\n i = 2\n\nwhile i != N:\n if S_1[i] == S_2[i]:\n if flag == 0:\n res *= 2 \n else:\n res *= 1\n flag = 0\n i += 1\n\n else:\n if flag == 0:\n res *= 2\n flag = 1\n else:\n res *= 3\n i += 2\n \nans = res%100000007\n\nprint(ans) ", "code2": "N = int(input())\nS_1 = list(input())\nS_2 = list(input())\n\n\n\nif S_1[0] == S_2[0]:\n res = 3\n flag = 0\n i = 1\nelse:\n res = 6\n flag = 1\n i = 2\n\nwhile i != N:\n if S_1[i] == S_2[i]:\n if flag == 0:\n res *= 2 \n else:\n res *= 1\n flag = 0\n i += 1\n\n else:\n if flag == 0:\n res *= 2\n flag = 1\n else:\n res *= 3\n i += 2\n \nans = res%1000000007\n\nprint(ans)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1505509847", "date2": "1505509969", "bleu_score": "0.9927228627087763", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 83, "total_score": 103, "input": "52\nnHHppJGGCCjlAhrYebbicqKDSSakkEEffssZZFFQPPyyIWdttvvR\nnzzuuJTTOOjlAhrYemmicqKDhgaBBooMMVUXXUUQNNxxIWdwwLLR\n", "actual_output": "58679949\n", "expected_output": "958681902\n\n", "anno_code": ["N = int(input()) # (0): N=52\nS_1 = list(input()) # (1): S_1=[n, H, ..., v, R]\nS_2 = list(input()) # (2): S_2=[n, z, ..., L, R]\n\n\n\nif S_1[0] == S_2[0]: # (3): NO CHANGE\n res = 3 # (4): res=3\n flag = 0 # (5): flag=0\n i = 1 # (6): i=1\nelse:\n res = 6\n flag = 1\n i = 2\n\nwhile i != N: # (7): NO CHANGE (13): NO CHANGE ... (196): NO CHANGE\n if S_1[i] == S_2[i]: # (8): NO CHANGE (14): NO CHANGE ... (191): NO CHANGE\n if flag == 0: # (20): NO CHANGE (37): NO CHANGE ... (192): NO CHANGE\n res *= 2 # (44): res=216 (49): res=432 ... (177): res=5159780352\n else:\n res *= 1 # (21): NO CHANGE (38): NO CHANGE ... (193): NO CHANGE\n flag = 0 # (22): flag=0 (39): flag=0 ... (194): flag=0\n i += 1 # (23): i=6 (40): i=11 ... (195): i=52\n\n else:\n if flag == 0: # (9): NO CHANGE (15): NO CHANGE ... (187): NO CHANGE\n res *= 2 # (10): res=6 (27): res=36 ... (182): res=10319560704\n flag = 1 # (11): flag=1 (28): flag=1 ... (183): flag=1\n else:\n res *= 3 # (16): res=18 (33): res=108 ... (188): res=30958682112\n i += 2 # (12): i=3 (17): i=5 ... (189): i=51\n \nans = res%100000007 # (197): ans=58679949\n\nprint(ans) "], "anno_status": [true], "diff_content": " N = int(input())\n S_1 = list(input())\n S_2 = list(input())\n \n \n \n if S_1[0] == S_2[0]:\n res = 3\n flag = 0\n i = 1\n else:\n res = 6\n flag = 1\n i = 2\n \n while i != N:\n if S_1[i] == S_2[i]:\n if flag == 0:\n res *= 2 \n else:\n res *= 1\n flag = 0\n i += 1\n \n else:\n if flag == 0:\n res *= 2\n flag = 1\n else:\n res *= 3\n i += 2\n \n-ans = res%100000007\n+ans = res%1000000007\n \n-print(ans) \n+print(ans)\n+ \n", "FL_content": " N = int(input())\n S_1 = list(input())\n S_2 = list(input())\n \n \n \n if S_1[0] == S_2[0]:\n res = 3\n flag = 0\n i = 1\n else:\n res = 6\n flag = 1\n i = 2\n \n while i != N:\n if S_1[i] == S_2[i]:\n if flag == 0:\n res *= 2 \n else:\n res *= 1\n flag = 0\n i += 1\n \n else:\n if flag == 0:\n res *= 2\n flag = 1\n else:\n res *= 3\n i += 2\n \n-ans = res%100000007\n \n-print(ans) \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 35 }, { "user_id": "u136090046", "problem_id": "p03626", "submission1_id": "s238758260", "submission2_id": "s793585774", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\ns1 = input()\ns2 = input()\n\nINF = 1000000009\n\nleft = None\nindex = 0\ncnt = 0\nwhile index < n:\n \n if s1[index] == s2[index]:\n index += 1\n if left is None:\n left = 1\n cnt = 3\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 1\n left = 1\n\n \n else:\n index += 2\n if left is None:\n left = 2\n cnt = 6\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 3\n left = 2\n cnt = cnt % INF\nprint(cnt)", "code2": "n = int(input())\n\ns1 = input()\ns2 = input()\n\nINF = 1000000007\n\nleft = None\nindex = 0\ncnt = 0\nwhile index < n:\n \n if s1[index] == s2[index]:\n index += 1\n if left is None:\n left = 1\n cnt = 3\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 1\n left = 1\n\n \n else:\n index += 2\n if left is None:\n left = 2\n cnt = 6\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 3\n left = 2\n cnt = cnt % INF\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572384326", "date2": "1572385518", "bleu_score": "0.9957608843432733", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 83, "total_score": 103, "input": "52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n", "actual_output": "958681842\n", "expected_output": "958681902\n", "anno_code": ["n = int(input()) # (0): n=52\n\ns1 = input() # (1): s1=RvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\ns2 = input() # (2): s2=RLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nINF = 1000000009 # (3): INF=1000000009\n\nleft = None # (4): left=None\nindex = 0 # (5): index=0\ncnt = 0 # (6): cnt=0\nwhile index < n: # (7): NO CHANGE (15): NO CHANGE ... (295): NO CHANGE\n \n if s1[index] == s2[index]: # (8): NO CHANGE (16): NO CHANGE ... (288): NO CHANGE\n index += 1 # (9): index=1 (33): index=6 ... (289): index=52\n if left is None: # (10): NO CHANGE (34): NO CHANGE ... (290): NO CHANGE\n left = 1 # (11): left=1\n cnt = 3 # (12): cnt=3\n \n elif left == 1: # (35): NO CHANGE (43): NO CHANGE ... (291): NO CHANGE\n cnt *= 2 # (44): cnt=36 (52): cnt=72 ... (244): cnt=859963392\n \n else:\n cnt *= 1 # (36): NO CHANGE (76): NO CHANGE ... (292): NO CHANGE\n left = 1 # (13): NO CHANGE (37): left=1 ... (293): left=1\n\n \n else:\n index += 2 # (17): index=3 (25): index=5 ... (281): index=51\n if left is None: # (18): NO CHANGE (26): NO CHANGE ... (282): NO CHANGE\n left = 2\n cnt = 6\n \n elif left == 1: # (19): NO CHANGE (27): NO CHANGE ... (283): NO CHANGE\n cnt *= 2 # (20): cnt=6 (60): cnt=144 ... (276): cnt=319560614\n \n else:\n cnt *= 3 # (28): cnt=18 (68): cnt=432 ... (284): cnt=958681842\n left = 2 # (21): left=2 (29): NO CHANGE ... (285): NO CHANGE\n cnt = cnt % INF # (14): NO CHANGE (22): NO CHANGE ... (294): NO CHANGE\nprint(cnt)"], "anno_status": [true], "diff_content": " n = int(input())\n \n s1 = input()\n s2 = input()\n \n-INF = 1000000009\n+INF = 1000000007\n \n left = None\n index = 0\n cnt = 0\n while index < n:\n \n if s1[index] == s2[index]:\n index += 1\n if left is None:\n left = 1\n cnt = 3\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 1\n left = 1\n \n \n else:\n index += 2\n if left is None:\n left = 2\n cnt = 6\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 3\n left = 2\n cnt = cnt % INF\n print(cnt)\n", "FL_content": " n = int(input())\n \n s1 = input()\n s2 = input()\n \n-INF = 1000000009\n \n left = None\n index = 0\n cnt = 0\n while index < n:\n \n if s1[index] == s2[index]:\n index += 1\n if left is None:\n left = 1\n cnt = 3\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 1\n left = 1\n \n \n else:\n index += 2\n if left is None:\n left = 2\n cnt = 6\n \n elif left == 1:\n cnt *= 2\n \n else:\n cnt *= 3\n left = 2\n cnt = cnt % INF\n print(cnt)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 40 }, { "user_id": "u554954744", "problem_id": "p03626", "submission1_id": "s232277236", "submission2_id": "s830183093", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = input()\nT = input()\n\nMOD = 10 ** 9\n\nptn = []\ni = 0\nwhile i < N:\n if S[i] == T[i]:\n ptn.append(1)\n i += 1\n else:\n ptn.append(2)\n i += 2\n\nif ptn[0] == 1:\n ans = 3\nelse:\n ans = 6\n\nfor s, t in zip(ptn[:], ptn[1:]):\n if s == 1 and t == 1:\n ans *= 2\n elif s == 1 and t == 2:\n ans *= 2\n elif s == 2 and t == 1:\n ans *= 1\n elif s == 2 and t == 2:\n ans *= 3\n ans %= MOD\n\nprint(ans)", "code2": "N = int(input())\nS = input()\nT = input()\n\nMOD = 10 ** 9 + 7\n\nptn = []\ni = 0\nwhile i < N:\n if S[i] == T[i]:\n ptn.append(1)\n i += 1\n else:\n ptn.append(2)\n i += 2\n\nif ptn[0] == 1:\n ans = 3\nelse:\n ans = 6\n\nfor s, t in zip(ptn[:], ptn[1:]):\n if s == 1 and t == 1:\n ans *= 2\n elif s == 1 and t == 2:\n ans *= 2\n elif s == 2 and t == 1:\n ans *= 1\n elif s == 2 and t == 2:\n ans *= 3\n ans %= MOD\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578776749", "date2": "1578777114", "bleu_score": "0.9884973995093609", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 83, "total_score": 103, "input": "52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooCBaggDKqcinmeYrhAljOOTTJuvzzn\n", "actual_output": "958682112\n", "expected_output": "958681902\n\n", "anno_code": ["N = int(input()) # (0): N=52\nS = input() # (1): S=RvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nT = input() # (2): T=RLLwwdWIxxNNQUUXXVVMMooCBaggDKqcinmeYrhAljOOTTJuvzzn\n\nMOD = 10 ** 9 # (3): MOD=1000000000\n\nptn = [] # (4): ptn=[]\ni = 0 # (5): i=0\nwhile i < N: # (6): NO CHANGE (10): NO CHANGE ... (150): NO CHANGE\n if S[i] == T[i]: # (7): NO CHANGE (11): NO CHANGE ... (147): NO CHANGE\n ptn.append(1) # (8): ptn=[1] (20): ptn=[1, 2, 2, 1] ... (148): ptn=[1, 2, ..., 2, 1]\n i += 1 # (9): i=1 (21): i=6 ... (149): i=52\n else:\n ptn.append(2) # (12): ptn=[1, 2] (16): ptn=[1, 2, 2] ... (144): ptn=[1, 2, ..., 2, 2]\n i += 2 # (13): i=3 (17): i=5 ... (145): i=51\n\nif ptn[0] == 1: # (151): NO CHANGE\n ans = 3 # (152): ans=3\nelse:\n ans = 6\n\nfor s, t in zip(ptn[:], ptn[1:]): # (153): s=1, t=2 (158): s=2 ... (341): NO CHANGE\n if s == 1 and t == 1: # (154): NO CHANGE (159): NO CHANGE ... (336): NO CHANGE\n ans *= 2 # (173): ans=36 (177): ans=72 ... (303): ans=859963392\n elif s == 1 and t == 2: # (155): NO CHANGE (160): NO CHANGE ... (337): NO CHANGE\n ans *= 2 # (156): ans=6 (182): ans=144 ... (326): ans=319560704\n elif s == 2 and t == 1: # (161): NO CHANGE (168): NO CHANGE ... (338): NO CHANGE\n ans *= 1 # (169): NO CHANGE (195): NO CHANGE ... (339): NO CHANGE\n elif s == 2 and t == 2: # (162): NO CHANGE (188): NO CHANGE ... (332): NO CHANGE\n ans *= 3 # (163): ans=18 (189): ans=432 ... (333): ans=958682112\n ans %= MOD # (157): NO CHANGE (164): NO CHANGE ... (340): NO CHANGE\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n S = input()\n T = input()\n \n-MOD = 10 ** 9\n+MOD = 10 ** 9 + 7\n \n ptn = []\n i = 0\n while i < N:\n if S[i] == T[i]:\n ptn.append(1)\n i += 1\n else:\n ptn.append(2)\n i += 2\n \n if ptn[0] == 1:\n ans = 3\n else:\n ans = 6\n \n for s, t in zip(ptn[:], ptn[1:]):\n if s == 1 and t == 1:\n ans *= 2\n elif s == 1 and t == 2:\n ans *= 2\n elif s == 2 and t == 1:\n ans *= 1\n elif s == 2 and t == 2:\n ans *= 3\n ans %= MOD\n \n print(ans)\n", "FL_content": " N = int(input())\n S = input()\n T = input()\n \n-MOD = 10 ** 9\n \n ptn = []\n i = 0\n while i < N:\n if S[i] == T[i]:\n ptn.append(1)\n i += 1\n else:\n ptn.append(2)\n i += 2\n \n if ptn[0] == 1:\n ans = 3\n else:\n ans = 6\n \n for s, t in zip(ptn[:], ptn[1:]):\n if s == 1 and t == 1:\n ans *= 2\n elif s == 1 and t == 2:\n ans *= 2\n elif s == 2 and t == 1:\n ans *= 1\n elif s == 2 and t == 2:\n ans *= 3\n ans %= MOD\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 33 }, { "user_id": "u064434060", "problem_id": "p03626", "submission1_id": "s213874119", "submission2_id": "s373277224", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nimport math\n\n\n\n\n\n\n\nmod=1000000007\nn=int(input())\ns=[input() for _ in range(2)]\nd=[]\ni=0\nwhile i= n:\n break\n if s1[i] == s2[i]:\n pat = 0\n i += 1\n else:\n pat = 1\n i += 2\n ans *= t[pre_pat][pat]\n ans %= MOD\n print(pre_pat, pat, ans, i)\n pre_pat = pat\nprint(ans)", "code2": "MOD = 10**9+7\n\nn = int(input())\ns1 = input()\ns2 = input()\nans = 1\n\nif s1[0] == s2[0]:\n i = 1\n pre_pat = 0\n ans = 3\nelse:\n i = 2\n pre_pat = 1\n ans = 6\n\nt = [[2, 2], [1, 3]]\nwhile True:\n if i >= n:\n break\n if s1[i] == s2[i]:\n pat = 0\n i += 1\n else:\n pat = 1\n i += 2\n ans *= t[pre_pat][pat]\n ans %= MOD\n \n pre_pat = pat\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586365931", "date2": "1586365939", "bleu_score": "0.9313638166603218", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 9, "total_score": 103, "input": "3\naab\nacb\n", "actual_output": "0 1 6 3\n6\n", "expected_output": "6\n\n", "anno_code": ["MOD = 10**9+7 # (0): MOD=1000000007\n\nn = int(input()) # (1): n=3\ns1 = input() # (2): s1=aab\ns2 = input() # (3): s2=acb\nans = 1 # (4): ans=1\n\nif s1[0] == s2[0]: # (5): NO CHANGE\n i = 1 # (6): i=1\n pre_pat = 0 # (7): pre_pat=0\n ans = 3 # (8): ans=3\nelse:\n i = 2\n pre_pat = 1\n ans = 6\n\nt = [[2, 2], [1, 3]] # (9): t\nwhile True: # (10): NO CHANGE (19): NO CHANGE\n if i >= n: # (11): NO CHANGE (20): NO CHANGE\n break # (21): NO CHANGE\n if s1[i] == s2[i]: # (12): NO CHANGE\n pat = 0\n i += 1\n else:\n pat = 1 # (13): pat=1\n i += 2 # (14): i=3\n ans *= t[pre_pat][pat] # (15): ans=6\n ans %= MOD # (16): NO CHANGE\n print(pre_pat, pat, ans, i) # (17): NO CHANGE\n pre_pat = pat # (18): pre_pat=1\nprint(ans)"], "anno_status": [true], "diff_content": " MOD = 10**9+7\n \n n = int(input())\n s1 = input()\n s2 = input()\n ans = 1\n \n if s1[0] == s2[0]:\n i = 1\n pre_pat = 0\n ans = 3\n else:\n i = 2\n pre_pat = 1\n ans = 6\n \n t = [[2, 2], [1, 3]]\n while True:\n if i >= n:\n break\n if s1[i] == s2[i]:\n pat = 0\n i += 1\n else:\n pat = 1\n i += 2\n ans *= t[pre_pat][pat]\n ans %= MOD\n- print(pre_pat, pat, ans, i)\n+ \n pre_pat = pat\n print(ans)\n", "FL_content": " MOD = 10**9+7\n \n n = int(input())\n s1 = input()\n s2 = input()\n ans = 1\n \n if s1[0] == s2[0]:\n i = 1\n pre_pat = 0\n ans = 3\n else:\n i = 2\n pre_pat = 1\n ans = 6\n \n t = [[2, 2], [1, 3]]\n while True:\n if i >= n:\n break\n if s1[i] == s2[i]:\n pat = 0\n i += 1\n else:\n pat = 1\n i += 2\n ans *= t[pre_pat][pat]\n ans %= MOD\n- print(pre_pat, pat, ans, i)\n pre_pat = pat\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 31 }, { "user_id": "u228223940", "problem_id": "p03626", "submission1_id": "s048587319", "submission2_id": "s823257299", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns1 = input()\ns2 = input()\n\nmod = 10**9+7\n\nif s1[0] == s2[0]:\n ans = 3\n bfr = 'T'\n idx = 1\nelse:\n ans = 6\n bfr = 'Y'\n idx = 2\n\nif n == 1:\n print(ans)\n exit()\n\nwhile idx <= n-1:\n if s1[idx] == s2[idx]:\n if bfr == 'T':\n ans *= 2\n ans %= mod\n idx += 1\n bfr = 'T'\n else:\n ans *= 3\n ans %= mod\n idx += 2\n bfr = 'Y'\n \nprint(ans%mod)", "code2": "n = int(input())\ns1 = input()\ns2 = input()\n\nmod = 10**9+7\n\nif s1[0] == s2[0]:\n ans = 3\n bfr = 'T'\n idx = 1\nelse:\n ans = 6\n bfr = 'Y'\n idx = 2\n\nif n == 1:\n print(ans)\n exit()\n\nwhile idx <= n-1:\n if s1[idx] == s2[idx]:\n if bfr == 'T':\n ans *= 2\n ans %= mod\n idx += 1\n bfr = 'T'\n else:\n if bfr == 'T':\n ans *= 2\n ans %= mod\n else:\n ans *= 3\n ans %= mod\n idx += 2\n bfr = 'Y'\n \nprint(ans%mod)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587315078", "date2": "1587315297", "bleu_score": "0.8344178171474053", "code1_test_status": [1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 33, "total_score": 103, "input": "3\nb`b\nbcb\n", "actual_output": "9\n", "expected_output": "6\n\n", "anno_code": ["n = int(input()) # (0): n=3\ns1 = input() # (1): s1=b`b\ns2 = input() # (2): s2=bcb\n\nmod = 10**9+7 # (3): mod=1000000007\n\nif s1[0] == s2[0]: # (4): NO CHANGE\n ans = 3 # (5): ans=3\n bfr = 'T' # (6): bfr=T\n idx = 1 # (7): idx=1\nelse:\n ans = 6\n bfr = 'Y'\n idx = 2\n\nif n == 1: # (8): NO CHANGE\n print(ans)\n exit()\n\nwhile idx <= n-1: # (9): NO CHANGE (15): NO CHANGE\n if s1[idx] == s2[idx]: # (10): NO CHANGE\n if bfr == 'T':\n ans *= 2\n ans %= mod\n idx += 1\n bfr = 'T'\n else:\n ans *= 3 # (11): ans=9\n ans %= mod # (12): NO CHANGE\n idx += 2 # (13): idx=3\n bfr = 'Y' # (14): bfr=Y\n \nprint(ans%mod)"], "anno_status": [true], "diff_content": " n = int(input())\n s1 = input()\n s2 = input()\n \n mod = 10**9+7\n \n if s1[0] == s2[0]:\n ans = 3\n bfr = 'T'\n idx = 1\n else:\n ans = 6\n bfr = 'Y'\n idx = 2\n \n if n == 1:\n print(ans)\n exit()\n \n while idx <= n-1:\n if s1[idx] == s2[idx]:\n if bfr == 'T':\n ans *= 2\n ans %= mod\n idx += 1\n bfr = 'T'\n else:\n- ans *= 3\n- ans %= mod\n+ if bfr == 'T':\n+ ans *= 2\n+ ans %= mod\n+ else:\n+ ans *= 3\n+ ans %= mod\n idx += 2\n bfr = 'Y'\n \n print(ans%mod)\n", "FL_content": " n = int(input())\n s1 = input()\n s2 = input()\n \n mod = 10**9+7\n \n if s1[0] == s2[0]:\n ans = 3\n bfr = 'T'\n idx = 1\n else:\n ans = 6\n bfr = 'Y'\n idx = 2\n \n if n == 1:\n print(ans)\n exit()\n \n while idx <= n-1:\n if s1[idx] == s2[idx]:\n if bfr == 'T':\n ans *= 2\n ans %= mod\n idx += 1\n bfr = 'T'\n else:\n- ans *= 3\n- ans %= mod\n idx += 2\n bfr = 'Y'\n \n print(ans%mod)\n", "added_lines": 6, "removed_lines": 2, "code1_lines": 33 }, { "user_id": "u853900545", "problem_id": "p03626", "submission1_id": "s499253433", "submission2_id": "s264310205", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns1 = input()\ns2 = input()\ncnt = 1\ni = 0\nwhile i <= n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\nprint(cnt)", "code2": "n = int(input())\ns1 = input()\ns2 = input()\ncnt = 1\ni = 0\nwhile i <= n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\nprint(cnt % (10**9+7))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551369813", "date2": "1551370154", "bleu_score": "0.9737362348459729", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 83, "total_score": 103, "input": "52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXUVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n", "actual_output": "30958682112\n", "expected_output": "958681902\n\n", "anno_code": ["n = int(input()) # (0): n=52\ns1 = input() # (1): s1=RvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\ns2 = input() # (2): s2=RLLwwdWIxxNNQUUXXUVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\ncnt = 1 # (3): cnt=1\ni = 0 # (4): i=0\nwhile i <= n-1: # (5): NO CHANGE (11): NO CHANGE ... (272): NO CHANGE\n if i == 0: # (6): NO CHANGE (12): NO CHANGE ... (266): NO CHANGE\n if s1[i] == s2[i]: # (7): NO CHANGE\n cnt *= 3 # (8): cnt=3\n s = 0 # (9): s=0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]: # (13): NO CHANGE (21): NO CHANGE ... (267): NO CHANGE\n if s == 0: # (30): NO CHANGE (37): NO CHANGE ... (268): NO CHANGE\n cnt *= 2 # (38): cnt=36 (45): cnt=72 ... (223): cnt=859963392\n else:\n cnt *= 1 # (31): NO CHANGE (68): NO CHANGE ... (269): NO CHANGE\n s = 0 # (32): s=0 (39): NO CHANGE ... (270): s=0\n else:\n if s == 0: # (14): NO CHANGE (22): NO CHANGE ... (260): NO CHANGE\n cnt *= 2 # (15): cnt=6 (52): cnt=144 ... (253): cnt=10319560704\n else:\n cnt *= 3 # (23): cnt=18 (60): cnt=432 ... (261): cnt=30958682112\n s = 1 # (16): s=1 (24): NO CHANGE ... (262): NO CHANGE\n i += 1 # (17): i=2 (25): i=4 ... (263): i=50\n i += 1 # (10): i=1 (18): i=3 ... (271): i=52\nprint(cnt)"], "anno_status": [true], "diff_content": " n = int(input())\n s1 = input()\n s2 = input()\n cnt = 1\n i = 0\n while i <= n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\n-print(cnt)\n+print(cnt % (10**9+7))\n", "FL_content": " n = int(input())\n s1 = input()\n s2 = input()\n cnt = 1\n i = 0\n while i <= n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\n-print(cnt)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 29 }, { "user_id": "u853900545", "problem_id": "p03626", "submission1_id": "s215901667", "submission2_id": "s264310205", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns1 = input()\ns2 = input()\ncnt = 1\ni = 0\nwhile i < n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\nprint(cnt)", "code2": "n = int(input())\ns1 = input()\ns2 = input()\ncnt = 1\ni = 0\nwhile i <= n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\nprint(cnt % (10**9+7))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551369854", "date2": "1551370154", "bleu_score": "0.9685770186010679", "code1_test_status": [0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0], "code1_test_score": 72, "total_score": 103, "input": "1\n\\\n\\\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["n = int(input()) # (0): n=1\ns1 = input() # (1): s1=\\\ns2 = input() # (2): s2=\\\ncnt = 1 # (3): cnt=1\ni = 0 # (4): i=0\nwhile i < n-1: # (5): NO CHANGE\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\nprint(cnt)"], "anno_status": [true], "diff_content": " n = int(input())\n s1 = input()\n s2 = input()\n cnt = 1\n i = 0\n-while i < n-1:\n+while i <= n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\n-print(cnt)\n+print(cnt % (10**9+7))\n", "FL_content": " n = int(input())\n s1 = input()\n s2 = input()\n cnt = 1\n i = 0\n-while i < n-1:\n if i == 0:\n if s1[i] == s2[i]:\n cnt *= 3\n s = 0\n else:\n cnt *= 6\n i += 1\n s = 1\n elif s1[i] == s2[i]:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 1\n s = 0\n else:\n if s == 0:\n cnt *= 2\n else:\n cnt *= 3\n s = 1\n i += 1\n i += 1\n-print(cnt)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u518064858", "problem_id": "p03626", "submission1_id": "s628006376", "submission2_id": "s978637122", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns1=input()\ns2=input()\nif n==1:\n print(3)\n exit()\ns=\"\"\ni=0\nwhile i len(E):\n ans += O[-1]\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580483065", "date2": "1580483900", "bleu_score": "0.7894953441066133", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "tsgteocrennieabrmdoctf\natcoaerqeguldrcnntest\n", "actual_output": "tastgctoeaoecrrqeengnuiledarbcrnmndtoecstt\n", "expected_output": "tastgctoeaoecrrqeengnuiledarbcrnmndtoecsttf\n\n", "anno_code": ["\n\nimport sys\n\n\n\n\nread = sys.stdin.buffer.read # (0): read=\nreadline = sys.stdin.buffer.readline # (1): readline=\nreadlines = sys.stdin.buffer.readlines # (2): readlines=\nsys.setrecursionlimit(10 ** 7) # (3): NO CHANGE\n\nO, E = read().decode('utf8').split() # (4): O=tsgteocrennieabrmdoctf, E=atcoaerqeguldrcnntest\nans = [i+j for i, j in zip(O, E)] # (5): ans=[ta, st, ..., cs, tt]\n\nprint(''.join(ans))\n"], "anno_status": [true], "diff_content": " \n \n import sys\n \n \n \n \n read = sys.stdin.buffer.read\n readline = sys.stdin.buffer.readline\n readlines = sys.stdin.buffer.readlines\n sys.setrecursionlimit(10 ** 7)\n \n O, E = read().decode('utf8').split()\n-ans = [i+j for i, j in zip(O, E)]\n \n-print(''.join(ans))\n+ans = ''\n+for i, j in zip(O, E):\n+ ans += i + j\n+\n+if len(O) > len(E):\n+ ans += O[-1]\n+\n+print(ans)\n \n", "FL_content": " \n \n import sys\n \n \n \n \n read = sys.stdin.buffer.read\n readline = sys.stdin.buffer.readline\n readlines = sys.stdin.buffer.readlines\n sys.setrecursionlimit(10 ** 7)\n \n O, E = read().decode('utf8').split()\n-ans = [i+j for i, j in zip(O, E)]\n \n-print(''.join(ans))\n \n", "added_lines": 8, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u820351940", "problem_id": "p03760", "submission1_id": "s975162949", "submission2_id": "s349187138", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input(); b = input(); \"\".join(map(\"\".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else \"\")", "code2": "a = input(); b = input(); print(\"\".join(map(\"\".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else \"\"))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1491701460", "date2": "1491701535", "bleu_score": "0.9106062278119801", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "atcoderbeeinnercontgst\natcoaerreguldrcontest\n", "actual_output": "no output\n", "expected_output": "aattccoodaeerrbreeegiunlnderrccoonnttegsstt\n\n", "anno_code": ["a = input(); b = input(); \"\".join(map(\"\".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else \"\")"], "anno_status": [true], "diff_content": "-a = input(); b = input(); \"\".join(map(\"\".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else \"\")\n+a = input(); b = input(); print(\"\".join(map(\"\".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else \"\"))\n+\n", "FL_content": "-a = input(); b = input(); \"\".join(map(\"\".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else \"\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u792720861", "problem_id": "p03760", "submission1_id": "s434429520", "submission2_id": "s233084204", "status1": "Wrong Answer", "status2": "Accepted", "code1": "O = input()\nE = input()\nprint(*[o+e for o,e in zip(O,E)], sep=\"\")\n", "code2": "O = list(input())\nE = list(input())+['']\nprint(*[o+e for o,e in zip(O,E)], sep=\"\")\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599011126", "date2": "1599011322", "bleu_score": "0.7241636452908847", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "bsoteetrengienbrmdpcta\ndsennrcatlugequcaoste\n", "actual_output": "bdssoetnenertcraetnlguigeenqburcmadopsctte\n", "expected_output": "bdssoetnenertcraetnlguigeenqburcmadopscttea\n\n", "anno_code": ["O = input() # (0): O=bsoteetrengienbrmdpcta\nE = input() # (1): E=dsennrcatlugequcaoste\nprint(*[o+e for o,e in zip(O,E)], sep=\"\")\n"], "anno_status": [true], "diff_content": "-O = input()\n-E = input()\n+O = list(input())\n+E = list(input())+['']\n print(*[o+e for o,e in zip(O,E)], sep=\"\")\n \n", "FL_content": "-O = input()\n-E = input()\n print(*[o+e for o,e in zip(O,E)], sep=\"\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u977661421", "problem_id": "p03760", "submission1_id": "s551383921", "submission2_id": "s008659945", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\no = list(input())\ne = list(input())\n\nif len(o) == len(e):\n for i in range(len(o) - 1):\n print(o[i], end = '')\n print(e[i], end = '')\n print(o[len(o) - 1], end = '')\n print(e[len(e) - 1])\n\nfor i in range(min(len(o), len(e))):\n print(o[i], end = '')\n print(e[i], end = '')\nif len(e) > len(o):\n print(e[len(e) - 1])\nif len(o) < len(e):\n print(o[len(o) - 1])\n", "code2": "\no = list(input())\ne = list(input())\n\nlen_o = len(o)\nlen_e = len(e)\n\nif len_o == len_e:\n for i in range(len_o - 1):\n print(o[i], end = '')\n print(e[i], end = '')\n print(o[len_o - 1], end = '')\n print(e[len_e - 1])\n\nelse:\n for i in range(min(len_o, len_e)):\n print(o[i], end = '')\n print(e[i], end = '')\n if len_e > len_o:\n print(e[len(e) - 1])\n if len_o > len_e:\n print(o[len(o) - 1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583505596", "date2": "1583506118", "bleu_score": "0.7719998117887605", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "xyy\nacd\n", "actual_output": "xaycyd\nxaycyd", "expected_output": "xaycyd\n\n", "anno_code": ["\n\no = list(input()) # (0): o=['x', 'y', 'y']\ne = list(input()) # (1): e=['a', 'c', 'd']\n\nif len(o) == len(e): # (2): NO CHANGE\n for i in range(len(o) - 1): # (3): i=0 (6): i=1 (9): NO CHANGE\n print(o[i], end = '') # (4): NO CHANGE (7): NO CHANGE\n print(e[i], end = '') # (5): NO CHANGE (8): NO CHANGE\n print(o[len(o) - 1], end = '') # (10): NO CHANGE\n print(e[len(e) - 1]) # (11): NO CHANGE\n\nfor i in range(min(len(o), len(e))): # (12): i=0 (15): i=1 ... (21): NO CHANGE\n print(o[i], end = '') # (13): NO CHANGE (16): NO CHANGE (19): NO CHANGE\n print(e[i], end = '') # (14): NO CHANGE (17): NO CHANGE (20): NO CHANGE\nif len(e) > len(o): # (22): NO CHANGE\n print(e[len(e) - 1])\nif len(o) < len(e):\n print(o[len(o) - 1])\n"], "anno_status": [true], "diff_content": " \n-\n o = list(input())\n e = list(input())\n \n-if len(o) == len(e):\n- for i in range(len(o) - 1):\n+len_o = len(o)\n+len_e = len(e)\n+\n+if len_o == len_e:\n+ for i in range(len_o - 1):\n print(o[i], end = '')\n print(e[i], end = '')\n- print(o[len(o) - 1], end = '')\n- print(e[len(e) - 1])\n+ print(o[len_o - 1], end = '')\n+ print(e[len_e - 1])\n \n-for i in range(min(len(o), len(e))):\n- print(o[i], end = '')\n- print(e[i], end = '')\n-if len(e) > len(o):\n- print(e[len(e) - 1])\n-if len(o) < len(e):\n- print(o[len(o) - 1])\n+else:\n+ for i in range(min(len_o, len_e)):\n+ print(o[i], end = '')\n+ print(e[i], end = '')\n+ if len_e > len_o:\n+ print(e[len(e) - 1])\n+ if len_o > len_e:\n+ print(o[len(o) - 1])\n \n", "FL_content": " \n-\n o = list(input())\n e = list(input())\n \n-if len(o) == len(e):\n- for i in range(len(o) - 1):\n print(o[i], end = '')\n print(e[i], end = '')\n- print(o[len(o) - 1], end = '')\n- print(e[len(e) - 1])\n \n-for i in range(min(len(o), len(e))):\n- print(o[i], end = '')\n- print(e[i], end = '')\n-if len(e) > len(o):\n- print(e[len(e) - 1])\n-if len(o) < len(e):\n- print(o[len(o) - 1])\n \n", "added_lines": 15, "removed_lines": 12, "code1_lines": 20 }, { "user_id": "u780206746", "problem_id": "p03760", "submission1_id": "s022090086", "submission2_id": "s541772473", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nO = list(input())\nE = list(input())\nfor o, e in zip(O, E):\n sys.stdout.write(o + e)\nif len(O) - len(E) == 1:\n sys.stdout.write(E[-1])\nprint()\n", "code2": "import sys\n\nO = list(input())\nE = list(input())\nif len(O) - len(E) == 1:\n E.append('')\nfor o, e in zip(O, E):\n sys.stdout.write(o + e)\nprint()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580776825", "date2": "1580776953", "bleu_score": "0.8543566847028464", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 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, 1, 1], "code1_test_score": 62, "total_score": 102, "input": "bsotheureqdjenbrmdpcta\netsoacgqfuuluacrnoesd\n", "actual_output": "bestostohaecugrqefqudujleunabcrrmndopecstdd\n", "expected_output": "bestostohaecugrqefqudujleunabcrrmndopecstda\n\n", "anno_code": ["import sys\n\nO = list(input()) # (0): O=[b, s, ..., t, a]\nE = list(input()) # (1): E=[e, t, ..., s, d]\nfor o, e in zip(O, E): # (2): o=b, e=e (4): o=s, e=t ... (44): NO CHANGE\n sys.stdout.write(o + e) # (3): NO CHANGE (5): NO CHANGE ... (43): NO CHANGE\nif len(O) - len(E) == 1: # (45): NO CHANGE\n sys.stdout.write(E[-1]) # (46): NO CHANGE\nprint()\n"], "anno_status": [true], "diff_content": " import sys\n \n O = list(input())\n E = list(input())\n+if len(O) - len(E) == 1:\n+ E.append('')\n for o, e in zip(O, E):\n sys.stdout.write(o + e)\n-if len(O) - len(E) == 1:\n- sys.stdout.write(E[-1])\n print()\n \n", "FL_content": " import sys\n \n O = list(input())\n E = list(input())\n for o, e in zip(O, E):\n sys.stdout.write(o + e)\n-if len(O) - len(E) == 1:\n- sys.stdout.write(E[-1])\n print()\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u224488911", "problem_id": "p03760", "submission1_id": "s637709004", "submission2_id": "s273517249", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o = list(input())\ne = list(input())\nfor (x,y) in zip(o,e) :print(x+y,end = \"\")", "code2": "o = list(input())\ne = list(input()) +[\"\"] \nfor x,y in zip(o,e) :print(x+y,end = \"\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565210858", "date2": "1565210935", "bleu_score": "0.8601805081089151", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "atcoderbeeinnercontgst\natcoderregularcontest\n", "actual_output": "aattccooddeerrbreeegiunlnaerrccoonnttegsst", "expected_output": "aattccooddeerrbreeegiunlnaerrccoonnttegsstt\n\n", "anno_code": ["o = list(input()) # (0): o=[a, t, ..., s, t]\ne = list(input()) # (1): e=[a, t, ..., s, t]\nfor (x,y) in zip(o,e) :print(x+y,end = \"\") # (2): x=a, y=a (3): x=t, y=t ... (22): x=s, y=t\n"], "anno_status": [true], "diff_content": " o = list(input())\n-e = list(input())\n-for (x,y) in zip(o,e) :print(x+y,end = \"\")\n+e = list(input()) +[\"\"] \n+for x,y in zip(o,e) :print(x+y,end = \"\")\n", "FL_content": " o = list(input())\n-e = list(input())\n-for (x,y) in zip(o,e) :print(x+y,end = \"\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u266874640", "problem_id": "p03760", "submission1_id": "s444443884", "submission2_id": "s564040307", "status1": "Wrong Answer", "status2": "Accepted", "code1": "odd = input()\neven =input()\nodd_list = []\neven_list = []\n\nfor (a,b) in zip(odd,even):\n odd_list.append(a)\n even_list.append(b)\neven_list.append(\"\")\n\nfor i in range(len(odd_list)):\n print(odd_list[i],end = \"\")\n print(even_list[i],end = \"\")\n", "code2": "odd = input()\neven =input()\nodd_list = []\neven_list = []\n\nfor i in odd:\n odd_list.append(i)\nfor j in even:\n even_list.append(j)\neven_list.append(\"\")\n\nfor i in range(len(odd_list)):\n print(odd_list[i],end = \"\")\n print(even_list[i],end = \"\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558842729", "date2": "1558843560", "bleu_score": "0.9065436480686115", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "bsotheureqdjenbrmdpcta\netsoacgqfuuluacrnoesd\n", "actual_output": "bestostohaecugrqefqudujleunabcrrmndopecstd", "expected_output": "bestostohaecugrqefqudujleunabcrrmndopecstda\n\n", "anno_code": ["odd = input() # (0): odd=bsotheureqdjenbrmdpcta\neven =input() # (1): even=etsoacgqfuuluacrnoesd\nodd_list = [] # (2): odd_list=[]\neven_list = [] # (3): even_list=[]\n\nfor (a,b) in zip(odd,even): # (4): a=b, b=e (7): a=s, b=t ... (67): NO CHANGE\n odd_list.append(a) # (5): odd_list=['b'] (8): odd_list=['b', 's'] ... (65): odd_list=[b, s, ..., c, t]\n even_list.append(b) # (6): even_list=['e'] (9): even_list=['e', 't'] ... (66): even_list=[e, t, ..., s, d]\neven_list.append(\"\") # (68): even_list=[e, t, ..., d, ]\n\nfor i in range(len(odd_list)): # (69): i=0 (72): i=1 ... (129): i=20\n print(odd_list[i],end = \"\") # (70): NO CHANGE (73): NO CHANGE ... (130): NO CHANGE\n print(even_list[i],end = \"\") # (71): NO CHANGE (74): NO CHANGE ... (131): NO CHANGE\n"], "anno_status": [true], "diff_content": " odd = input()\n even =input()\n odd_list = []\n even_list = []\n \n-for (a,b) in zip(odd,even):\n- odd_list.append(a)\n- even_list.append(b)\n+for i in odd:\n+ odd_list.append(i)\n+for j in even:\n+ even_list.append(j)\n even_list.append(\"\")\n \n for i in range(len(odd_list)):\n print(odd_list[i],end = \"\")\n print(even_list[i],end = \"\")\n \n", "FL_content": " odd = input()\n even =input()\n odd_list = []\n even_list = []\n \n-for (a,b) in zip(odd,even):\n- odd_list.append(a)\n- even_list.append(b)\n even_list.append(\"\")\n \n for i in range(len(odd_list)):\n print(odd_list[i],end = \"\")\n print(even_list[i],end = \"\")\n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u450145303", "problem_id": "p03760", "submission1_id": "s438272932", "submission2_id": "s789540234", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o = input()\ne = input()\nfor i,a in enumerate(o):\n for j,b in enumerate(e):\n if(i == j):\n print(a + b, end = '')\n if i == len(o) - 1:\n print(a)\n", "code2": "o = input()\ne = input()\nfor i,a in enumerate(o):\n for j,b in enumerate(e):\n if(i == j):\n print(a + b, end = '')\n if len(o) > len(e) and i == len(o) - 1:\n print(a)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1491771561", "date2": "1491771890", "bleu_score": "0.8921669540252677", "code1_test_status": [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, 0, 1, 0], "code1_test_score": 51, "total_score": 102, "input": "xx{\ndac\n", "actual_output": "xdxa{c{\n", "expected_output": "xdxa{c\n\n", "anno_code": ["o = input() # (0): o=xx{\ne = input() # (1): e=dac\nfor i,a in enumerate(o): # (2): i=0, a=x (12): i=1 (22): i=2, a={\n for j,b in enumerate(e): # (3): j=0, b=d (6): j=1, b=a ... (30): NO CHANGE\n if(i == j): # (4): NO CHANGE (7): NO CHANGE ... (28): NO CHANGE\n print(a + b, end = '') # (5): NO CHANGE (17): NO CHANGE (29): NO CHANGE\n if i == len(o) - 1: # (11): NO CHANGE (21): NO CHANGE (31): NO CHANGE\n print(a) # (32): NO CHANGE\n"], "anno_status": [true], "diff_content": " o = input()\n e = input()\n for i,a in enumerate(o):\n for j,b in enumerate(e):\n if(i == j):\n print(a + b, end = '')\n- if i == len(o) - 1:\n+ if len(o) > len(e) and i == len(o) - 1:\n print(a)\n \n", "FL_content": " o = input()\n e = input()\n for i,a in enumerate(o):\n for j,b in enumerate(e):\n if(i == j):\n print(a + b, end = '')\n- if i == len(o) - 1:\n print(a)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u424967964", "problem_id": "p03760", "submission1_id": "s108354809", "submission2_id": "s275270937", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o = input()\ne = input()\nprint(\"\".join([ch1 + ch2 for ch1 , ch2 in zip(o,e)]))", "code2": "o = input()\ne = input()\nif(len(o)>len(e)): e+=' '\nprint(\"\".join([ch1 + ch2 for ch1 , ch2 in zip(o,e)]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1491706498", "date2": "1491706885", "bleu_score": "0.7362536161159119", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "bsothetrepejenbrmdpcta\netsoacuqfguluacrnnesd\n", "actual_output": "bestostohaecturqefpgeujleunabcrrmndnpecstd\n", "expected_output": "bestostohaecturqefpgeujleunabcrrmndnpecstda\n\n", "anno_code": ["o = input() # (0): o=bsothetrepejenbrmdpcta\ne = input() # (1): e=etsoacuqfguluacrnnesd\nprint(\"\".join([ch1 + ch2 for ch1 , ch2 in zip(o,e)]))"], "anno_status": [true], "diff_content": " o = input()\n e = input()\n+if(len(o)>len(e)): e+=' '\n print(\"\".join([ch1 + ch2 for ch1 , ch2 in zip(o,e)]))\n", "FL_content": " o = input()\n e = input()\n print(\"\".join([ch1 + ch2 for ch1 , ch2 in zip(o,e)]))\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u713914478", "problem_id": "p03760", "submission1_id": "s308299036", "submission2_id": "s307826579", "status1": "Wrong Answer", "status2": "Accepted", "code1": "O = input()\n\n\nE = input()\n\nS = []\n\nif len(O) == len(E):\n\tfor i in range(len(O)):\n\t\tS.append(O[i] + E[i])\nelse:\n\tfor i in range(len(E)):\n\t\tS.append(O[i] + E[i])\n\t\tS.append(O[-1])\n\nprint(\"\".join(S))", "code2": "O = input()\n\n\nE = input()\n\nS = []\n\nif len(O) == len(E):\n\tfor i in range(len(O)):\n\t\tS.append(O[i] + E[i])\nelse:\n\tfor i in range(len(E)):\n\t\tS.append(O[i] + E[i])\n\tS.append(O[-1])\n\nprint(\"\".join(S))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591191728", "date2": "1591191889", "bleu_score": "0.9909960462526906", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "bsoteetrengienbrmdpcta\ndsennrcatlugfqucaoste\n", "actual_output": "bdassaoeatnaenaeratcaraaetanlaguaigaefanqabuarcamaadoapsactatea\n", "expected_output": "bdssoetnenertcraetnlguigefnqburcmadopscttea\n\n", "anno_code": ["O = input() # (0): O=bsoteetrengienbrmdpcta\n\n\nE = input() # (1): E=dsennrcatlugfqucaoste\n\nS = [] # (2): S=[]\n\nif len(O) == len(E): # (3): NO CHANGE\n\tfor i in range(len(O)):\n\t\tS.append(O[i] + E[i])\nelse:\n\tfor i in range(len(E)): # (4): i=0 (7): i=1 ... (67): NO CHANGE\n\t\tS.append(O[i] + E[i]) # (5): S=['bd'] (8): S=['bd', 'a', 'ss'] ... (65): S=[bd, a, ..., a, te]\n\t\tS.append(O[-1]) # (6): S=['bd', 'a'] (9): S=['bd', 'a', 'ss', 'a'] ... (66): S=[bd, a, ..., te, a]\n\nprint(\"\".join(S))"], "anno_status": [true], "diff_content": " O = input()\n \n \n E = input()\n \n S = []\n \n if len(O) == len(E):\n \tfor i in range(len(O)):\n \t\tS.append(O[i] + E[i])\n else:\n \tfor i in range(len(E)):\n \t\tS.append(O[i] + E[i])\n-\t\tS.append(O[-1])\n+\tS.append(O[-1])\n \n print(\"\".join(S))\n", "FL_content": " O = input()\n \n \n E = input()\n \n S = []\n \n if len(O) == len(E):\n \tfor i in range(len(O)):\n \t\tS.append(O[i] + E[i])\n else:\n \tfor i in range(len(E)):\n \t\tS.append(O[i] + E[i])\n-\t\tS.append(O[-1])\n \n print(\"\".join(S))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u102223485", "problem_id": "p03760", "submission1_id": "s973338297", "submission2_id": "s604495835", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nO = input()\nE = input()\n\nfor o, e in zip(O, E):\n print(o + e, end=\"\")", "code2": "\nO = input()\nE = input()\n\nfor o, e in zip(O, E):\n print(o + e, end=\"\")\nif abs(len(O) - len(E)) == 1:\n print(O[-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590635098", "date2": "1590635403", "bleu_score": "0.6033286058821814", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "tsgtencrenoieabrmdoctf\netcoaarqeguldrcnntest\n", "actual_output": "testgctoeanacrrqeengouiledarbcrnmndtoecstt", "expected_output": "testgctoeanacrrqeengouiledarbcrnmndtoecsttf\n\n", "anno_code": ["\nO = input() # (0): O=tsgtencrenoieabrmdoctf\nE = input() # (1): E=etcoaarqeguldrcnntest\n\nfor o, e in zip(O, E): # (2): o=t, e=e (4): o=s, e=t ... (42): o=t, e=t\n print(o + e, end=\"\") # (3): NO CHANGE (5): NO CHANGE ... (43): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n O = input()\n E = input()\n \n for o, e in zip(O, E):\n print(o + e, end=\"\")\n+if abs(len(O) - len(E)) == 1:\n+ print(O[-1])\n", "FL_content": " \n O = input()\n E = input()\n \n for o, e in zip(O, E):\n print(o + e, end=\"\")\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u022215787", "problem_id": "p03760", "submission1_id": "s869976106", "submission2_id": "s384328796", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o = input()\ne = input()\nans = ''\nfor i,j in zip(o,e):\n ans+= i+j\nif len(o) != len(e):\n ans+=e[-1]\nprint(ans)", "code2": "o = input()\ne = input()\n\nans = ''\nfor i,j in zip(o,e):\n ans+= i+j\nif len(o) != len(e):\n ans+=o[-1]\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600295456", "date2": "1600295579", "bleu_score": "0.9622298597924913", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 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, 1, 1], "code1_test_score": 62, "total_score": 102, "input": "ntcpdmrbaeionerteetgsb\ntseunrcadltgeqncaorte\n", "actual_output": "nttscepudnmrrcbaadelitogneeqrntceaeotrgtsee\n", "expected_output": "nttscepudnmrrcbaadelitogneeqrntceaeotrgtseb\n\n", "anno_code": ["o = input() # (0): o=ntcpdmrbaeionerteetgsb\ne = input() # (1): e=tseunrcadltgeqncaorte\nans = '' # (2): ans=\nfor i,j in zip(o,e): # (3): i=n, j=t (5): i=t, j=s ... (45): NO CHANGE\n ans+= i+j # (4): ans=nt (6): ans=ntts ... (44): ans=nttscepudnmrrcbaadelitogneeqrntceaeotrgtse\nif len(o) != len(e): # (46): NO CHANGE\n ans+=e[-1] # (47): ans=nttscepudnmrrcbaadelitogneeqrntceaeotrgtsee\nprint(ans)"], "anno_status": [true], "diff_content": " o = input()\n e = input()\n+\n ans = ''\n for i,j in zip(o,e):\n ans+= i+j\n if len(o) != len(e):\n- ans+=e[-1]\n+ ans+=o[-1]\n print(ans)\n", "FL_content": " o = input()\n e = input()\n ans = ''\n for i,j in zip(o,e):\n ans+= i+j\n if len(o) != len(e):\n- ans+=e[-1]\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u742729271", "problem_id": "p03760", "submission1_id": "s524083743", "submission2_id": "s288200259", "status1": "Wrong Answer", "status2": "Accepted", "code1": "O = input()\nE = input()\nans = \"\"\nfor i in range(len(E)):\n ans+=O[i]\n ans+=E[i]\n \nif len(O)%2==1:\n ans+=O[len(O)-1]\n\nprint(ans)", "code2": "O = input()\nE = input()\nans = \"\"\nfor i in range(len(E)):\n ans+=O[i]\n ans+=E[i]\n \nif len(O)>len(E):\n ans+=O[len(O)-1]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591239451", "date2": "1591239575", "bleu_score": "0.9347431509430889", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "yyx\nacd\n", "actual_output": "yaycxdx\n", "expected_output": "yaycxd\n\n", "anno_code": ["O = input() # (0): O=yyx\nE = input() # (1): E=acd\nans = \"\" # (2): ans=\nfor i in range(len(E)): # (3): i=0 (6): i=1 ... (12): NO CHANGE\n ans+=O[i] # (4): ans=y (7): ans=yay (10): ans=yaycx\n ans+=E[i] # (5): ans=ya (8): ans=yayc (11): ans=yaycxd\n \nif len(O)%2==1: # (13): NO CHANGE\n ans+=O[len(O)-1] # (14): ans=yaycxdx\n\nprint(ans)"], "anno_status": [true], "diff_content": " O = input()\n E = input()\n ans = \"\"\n for i in range(len(E)):\n ans+=O[i]\n ans+=E[i]\n \n-if len(O)%2==1:\n+if len(O)>len(E):\n ans+=O[len(O)-1]\n \n print(ans)\n", "FL_content": " O = input()\n E = input()\n ans = \"\"\n for i in range(len(E)):\n ans+=O[i]\n ans+=E[i]\n \n-if len(O)%2==1:\n ans+=O[len(O)-1]\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u344959886", "problem_id": "p03760", "submission1_id": "s962714182", "submission2_id": "s601426115", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o=input()\ne=input()\nfor i,j in zip(o,e):\n print(i+j,end=\"\")\n ", "code2": "o=input()\ne=input()\nfor i,j in zip(o,e):\n print(i+j,end=\"\")\nif len(o)!=len(e):print(o[-1:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579634150", "date2": "1579634284", "bleu_score": "0.6674260935926817", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "ftcodmrbaeinnercoetgst\natcoaerqeguldrcnntest\n", "actual_output": "fattccoodamerrbqaeegiunlnderrccnonettegsst", "expected_output": "fattccoodamerrbqaeegiunlnderrccnonettegsstt\n\n", "anno_code": ["o=input() # (0): o=ftcodmrbaeinnercoetgst\ne=input() # (1): e=atcoaerqeguldrcnntest\nfor i,j in zip(o,e): # (2): i=f, j=a (4): i=t, j=t ... (42): i=s, j=t\n print(i+j,end=\"\") # (3): NO CHANGE (5): NO CHANGE ... (43): NO CHANGE\n "], "anno_status": [true], "diff_content": " o=input()\n e=input()\n for i,j in zip(o,e):\n print(i+j,end=\"\")\n- \n+if len(o)!=len(e):print(o[-1:])\n", "FL_content": " o=input()\n e=input()\n for i,j in zip(o,e):\n print(i+j,end=\"\")\n- \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u508141157", "problem_id": "p03760", "submission1_id": "s034953432", "submission2_id": "s519845911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o=list(input())\ne=list(input())\nfor i,j in zip(o,e):print(i+j,end=\"\")", "code2": "o=list(input())\ne=list(input())+[\"\"]\nfor i,j in zip(o,e):print(i+j,end=\"\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565804718", "date2": "1565804821", "bleu_score": "0.9099302301879894", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "ntcpdmrbaeionerteetgsb\ntseunrcadltgeqncaorte\n", "actual_output": "nttscepudnmrrcbaadelitogneeqrntceaeotrgtse", "expected_output": "nttscepudnmrrcbaadelitogneeqrntceaeotrgtseb\n\n", "anno_code": ["o=list(input()) # (0): o=[n, t, ..., s, b]\ne=list(input()) # (1): e=[t, s, ..., t, e]\nfor i,j in zip(o,e):print(i+j,end=\"\") # (2): i=n, j=t (3): i=t, j=s ... (22): i=s, j=e\n"], "anno_status": [true], "diff_content": " o=list(input())\n-e=list(input())\n+e=list(input())+[\"\"]\n for i,j in zip(o,e):print(i+j,end=\"\")\n", "FL_content": " o=list(input())\n-e=list(input())\n for i,j in zip(o,e):print(i+j,end=\"\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u999669171", "problem_id": "p03760", "submission1_id": "s900359958", "submission2_id": "s750672957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o = input()\ne = input()\n\nfor x,y in zip( o, e ) : print( x+y, end=\"\" )", "code2": "o = list(input())\ne = list(input()) + [\"\"]\n\nfor x,y in zip( o, e ) : print( x+y, end=\"\" )", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565667407", "date2": "1565667533", "bleu_score": "0.7203894827027191", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "tsgteocrennieabrmdoctf\ntsetnncrdlugeqreaocta\n", "actual_output": "ttssgettenonccrrednlnuigeeaqbrremadoocctta", "expected_output": "ttssgettenonccrrednlnuigeeaqbrremadooccttaf\n\n", "anno_code": ["o = input() # (0): o=tsgteocrennieabrmdoctf\ne = input() # (1): e=tsetnncrdlugeqreaocta\n\nfor x,y in zip( o, e ) : print( x+y, end=\"\" ) # (2): x=t, y=t (3): x=s, y=s ... (22): x=t, y=a\n"], "anno_status": [true], "diff_content": "-o = input()\n-e = input()\n+o = list(input())\n+e = list(input()) + [\"\"]\n \n for x,y in zip( o, e ) : print( x+y, end=\"\" )\n", "FL_content": "-o = input()\n-e = input()\n \n for x,y in zip( o, e ) : print( x+y, end=\"\" )\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u172111219", "problem_id": "p03760", "submission1_id": "s301904439", "submission2_id": "s429008914", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o = list(str(input()))\ne = list(str(input()))\n\nfor i,j in enumerate(e):\n o.insert(1+2*i,j)\nprint(o)", "code2": "o = list(str(input()))\ne = list(str(input()))\n\nfor i,j in enumerate(e):\n o.insert(1+2*i,j)\nprint(\"\".join(o))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560030764", "date2": "1560030786", "bleu_score": "0.9108369476873872", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "bsoteetrengienbrmdpcta\netsoacuqegultacrnnesd\n", "actual_output": "['b', 'e', 's', 't', 'o', 's', 't', 'o', 'e', 'a', 'e', 'c', 't', 'u', 'r', 'q', 'e', 'e', 'n', 'g', 'g', 'u', 'i', 'l', 'e', 't', 'n', 'a', 'b', 'c', 'r', 'r', 'm', 'n', 'd', 'n', 'p', 'e', 'c', 's', 't', 'd', 'a']\n", "expected_output": "bestostoeaecturqeengguiletnabcrrmndnpecstda\n\n", "anno_code": ["o = list(str(input())) # (0): o=[b, s, ..., t, a]\ne = list(str(input())) # (1): e=[e, t, ..., s, d]\n\nfor i,j in enumerate(e): # (2): i=0, j=e (4): i=1, j=t ... (44): NO CHANGE\n o.insert(1+2*i,j) # (3): o=[b, e, ..., t, a] (5): o=[b, e, ..., t, a] ... (43): o=[b, e, ..., d, a]\nprint(o)"], "anno_status": [true], "diff_content": " o = list(str(input()))\n e = list(str(input()))\n \n for i,j in enumerate(e):\n o.insert(1+2*i,j)\n-print(o)\n+print(\"\".join(o))\n", "FL_content": " o = list(str(input()))\n e = list(str(input()))\n \n for i,j in enumerate(e):\n o.insert(1+2*i,j)\n-print(o)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u985076807", "problem_id": "p03760", "submission1_id": "s278241013", "submission2_id": "s016048346", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef solve():\n o = input()\n e = input()\n\n for l, r in zip(o, e):\n print('{}{}'.format(l, r), end=\"\")\n\n if len(o) != len(e):\n print(e[-1])\n\n\nif __name__ == '__main__':\n solve()\n", "code2": "\n\n\ndef solve():\n o = input()\n e = input()\n\n for l, r in zip(o, e):\n print('{}{}'.format(l, r), end=\"\")\n\n if len(o) != len(e):\n print(o[-1])\n else:\n print()\n\n\nif __name__ == '__main__':\n solve()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542758981", "date2": "1542759332", "bleu_score": "0.876809626376876", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 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, 1, 1], "code1_test_score": 62, "total_score": 102, "input": "bsotheureqdjenbrmdpcta\netsoacgqfuuluacrnoesd\n", "actual_output": "bestostohaecugrqefqudujleunabcrrmndopecstdd\n", "expected_output": "bestostohaecugrqefqudujleunabcrrmndopecstda\n\n", "anno_code": ["\n\n\ndef solve(): # (0): solve=\n o = input()\n e = input()\n\n for l, r in zip(o, e):\n print('{}{}'.format(l, r), end=\"\")\n\n if len(o) != len(e):\n print(e[-1])\n\n\nif __name__ == '__main__':\n solve()\n"], "anno_status": [true], "diff_content": " \n \n \n def solve():\n o = input()\n e = input()\n \n for l, r in zip(o, e):\n print('{}{}'.format(l, r), end=\"\")\n \n if len(o) != len(e):\n- print(e[-1])\n+ print(o[-1])\n+ else:\n+ print()\n \n \n if __name__ == '__main__':\n solve()\n \n", "FL_content": " \n \n \n def solve():\n o = input()\n e = input()\n \n for l, r in zip(o, e):\n print('{}{}'.format(l, r), end=\"\")\n \n if len(o) != len(e):\n- print(e[-1])\n \n \n if __name__ == '__main__':\n solve()\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u326647750", "problem_id": "p03760", "submission1_id": "s927892812", "submission2_id": "s426262554", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o = list(input())\ne = list(input()) + []\nfor i, j in zip(o, e):\n print(i + j, end=\"\")\n", "code2": "o = list(input())\ne = list(input()) + [\"\"]\nfor i, j in zip(o, e):\n print(i + j, end=\"\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565834067", "date2": "1565834100", "bleu_score": "0.9606438885644073", "code1_test_status": [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, 0, 1], "code1_test_score": 51, "total_score": 102, "input": "ntcpdmrbaeionerteetgsb\ntseunrcadltgeqncaoste\n", "actual_output": "nttscepudnmrrcbaadelitogneeqrntceaeotsgtse", "expected_output": "nttscepudnmrrcbaadelitogneeqrntceaeotsgtseb\n\n", "anno_code": ["o = list(input()) # (0): o=[n, t, ..., s, b]\ne = list(input()) + [] # (1): e=[t, s, ..., t, e]\nfor i, j in zip(o, e): # (2): i=n, j=t (4): i=t, j=s ... (42): i=s, j=e\n print(i + j, end=\"\") # (3): NO CHANGE (5): NO CHANGE ... (43): NO CHANGE\n"], "anno_status": [true], "diff_content": " o = list(input())\n-e = list(input()) + []\n+e = list(input()) + [\"\"]\n for i, j in zip(o, e):\n print(i + j, end=\"\")\n \n", "FL_content": " o = list(input())\n-e = list(input()) + []\n for i, j in zip(o, e):\n print(i + j, end=\"\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u819939299", "problem_id": "p03760", "submission1_id": "s664168365", "submission2_id": "s720885969", "status1": "Wrong Answer", "status2": "Accepted", "code1": "o=list(input())\ne=list(input())+[\"\"]\nfor x,y in zip(o,e):print(x,y,end=\"\") ", "code2": "o=list(input())\ne=list(input())+[\"\"]\nfor x,y in zip(o,e):print(x+y,end=\"\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572374433", "date2": "1572374508", "bleu_score": "0.9521844284676491", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "xx{\ndac\n", "actual_output": "x dx a{ c", "expected_output": "xdxa{c\n\n", "anno_code": ["o=list(input()) # (0): o=['x', 'x', '{']\ne=list(input())+[\"\"] # (1): e=['d', 'a', 'c', '']\nfor x,y in zip(o,e):print(x,y,end=\"\") # (2): x=x, y=d (3): y=a (4): x={, y=c\n"], "anno_status": [true], "diff_content": " o=list(input())\n e=list(input())+[\"\"]\n-for x,y in zip(o,e):print(x,y,end=\"\") \n+for x,y in zip(o,e):print(x+y,end=\"\")\n", "FL_content": " o=list(input())\n e=list(input())+[\"\"]\n-for x,y in zip(o,e):print(x,y,end=\"\") \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u527261492", "problem_id": "p03080", "submission1_id": "s103603511", "submission2_id": "s806384380", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\ns=list(input().split())\nr=s.count('R')\nb=s.count('B')\nif r>b:\n print('Yes')\nelse:\n print('No')", "code2": "N=int(input())\ns=input()\nr=s.count('R')\nb=s.count('B')\nif r>b:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554403555", "date2": "1554404445", "bleu_score": "0.845881718275478", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nARRR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N=int(input()) # (0): N=4\ns=list(input().split()) # (1): s=['ARRR']\nr=s.count('R') # (2): r=0\nb=s.count('B') # (3): b=0\nif r>b: # (4): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N=int(input())\n-s=list(input().split())\n+s=input()\n r=s.count('R')\n b=s.count('B')\n if r>b:\n print('Yes')\n else:\n print('No')\n+\n", "FL_content": " N=int(input())\n-s=list(input().split())\n r=s.count('R')\n b=s.count('B')\n if r>b:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u560464565", "problem_id": "p03080", "submission1_id": "s645915524", "submission2_id": "s020043990", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\ninput = sys.stdin.readline\nN = int(input())\ns = input().split()\nr = 0\nb = 0\n\nfor i in range(0, len(s)):\n if s[i] == 'R':\n r += 1\n else:\n b += 1\n\nif r > b:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "\n\nimport sys\n\ninput = sys.stdin.readline\nN = int(input())\ns = input().strip()\nr = 0\nb = 0\n\nfor i in range(0, len(s)):\n if s[i] == 'R':\n r += 1\n else:\n b += 1\n\nif r > b:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976691", "date2": "1553976784", "bleu_score": "0.9789298831997616", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nRRRC\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\nimport sys\n\ninput = sys.stdin.readline # (0): input=\nN = int(input()) # (1): N=4\ns = input().split() # (2): s=['RRRC']\nr = 0 # (3): r=0\nb = 0 # (4): b=0\n\nfor i in range(0, len(s)): # (5): i=0 (8): NO CHANGE\n if s[i] == 'R': # (6): NO CHANGE\n r += 1\n else:\n b += 1 # (7): b=1\n\nif r > b: # (9): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " \n \n import sys\n \n input = sys.stdin.readline\n N = int(input())\n-s = input().split()\n+s = input().strip()\n r = 0\n b = 0\n \n for i in range(0, len(s)):\n if s[i] == 'R':\n r += 1\n else:\n b += 1\n \n if r > b:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "FL_content": " \n \n import sys\n \n input = sys.stdin.readline\n N = int(input())\n-s = input().split()\n r = 0\n b = 0\n \n for i in range(0, len(s)):\n if s[i] == 'R':\n r += 1\n else:\n b += 1\n \n if r > b:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u114648678", "problem_id": "p03080", "submission1_id": "s986830621", "submission2_id": "s168051841", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\ns=list(input().split())\nfor i in s:\n n=0\n if i=='R':\n n+=1\nif N/2 0:\n print('Yes')\nelse:\n print('No')", "code2": "n=int(input())\ns=input()\n\nif len([i for i in s if i == 'R']) * 2 - n > 0:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976108", "date2": "1553976417", "bleu_score": "0.9274528225822981", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 0, 1, 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, 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, 0, 0, 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": 13, "total_score": 102, "input": "4\nRBQB\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["n=int(input()) # (0): n=4\ns=input() # (1): s=RBQB\n\nif n - len([i for i in s if i == 'R']) > 0: # (2): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " n=int(input())\n s=input()\n \n-if n - len([i for i in s if i == 'R']) > 0:\n+if len([i for i in s if i == 'R']) * 2 - n > 0:\n print('Yes')\n else:\n print('No')\n+\n", "FL_content": " n=int(input())\n s=input()\n \n-if n - len([i for i in s if i == 'R']) > 0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u754022296", "problem_id": "p03080", "submission1_id": "s092050398", "submission2_id": "s656733610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nif s.count(\"R\") > s.count(\"B\"):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "n = int(input())\ns = input()\nif s.count(\"R\") > s.count(\"B\"):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573459838", "date2": "1573459888", "bleu_score": "0.8094940031110405", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nRARR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=4\nif s.count(\"R\") > s.count(\"B\"): # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": "+n = int(input())\n s = input()\n if s.count(\"R\") > s.count(\"B\"):\n print(\"Yes\")\n else:\n print(\"No\")\n+\n", "FL_content": " s = input()\n if s.count(\"R\") > s.count(\"B\"):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u619785253", "problem_id": "p03080", "submission1_id": "s280339972", "submission2_id": "s284906672", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i = int(input())\nhat = list(input())\n\nB_count = hat.count('B')\nR_count = hat.count('R')\n\nif B_count < R_count:\n print(\"YES\")\nelse:\n print('NO')", "code2": "i = int(input())\nhat = list(input())\n\nB_count = hat.count('B')\nR_count = hat.count('R')\n\nif B_count < R_count:\n print(\"Yes\")\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555647296", "date2": "1555647391", "bleu_score": "0.9597276205623526", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\nOBAS\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["i = int(input()) # (0): i=4\nhat = list(input()) # (1): hat=['O', 'B', 'A', 'S']\n\nB_count = hat.count('B') # (2): B_count=1\nR_count = hat.count('R') # (3): R_count=0\n\nif B_count < R_count: # (4): NO CHANGE\n print(\"YES\")\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " i = int(input())\n hat = list(input())\n \n B_count = hat.count('B')\n R_count = hat.count('R')\n \n if B_count < R_count:\n- print(\"YES\")\n+ print(\"Yes\")\n else:\n- print('NO')\n+ print('No')\n", "FL_content": " i = int(input())\n hat = list(input())\n \n B_count = hat.count('B')\n R_count = hat.count('R')\n \n if B_count < R_count:\n- print(\"YES\")\n else:\n- print('NO')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u984110693", "problem_id": "p03080", "submission1_id": "s659208899", "submission2_id": "s593205036", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ns = list(input().split())\ncnt = 0\nfor a in s:\n if s == 'R':\n cnt += 1\nif N - cnt < cnt:\n print('Yes')\nelse:\n print('No')", "code2": "N = int(input())\ns = input()\ncnt = 0\nfor a in s:\n if a == 'R':\n cnt += 1\nif N - cnt < cnt:\n print('Yes')\nelse:\n print('No')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1553976592", "date2": "1553976779", "bleu_score": "0.8725528413307692", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nDRRR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=4\ns = list(input().split()) # (1): s=['DRRR']\ncnt = 0 # (2): cnt=0\nfor a in s: # (3): a=DRRR (5): NO CHANGE\n if s == 'R': # (4): NO CHANGE\n cnt += 1\nif N - cnt < cnt: # (6): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N = int(input())\n-s = list(input().split())\n+s = input()\n cnt = 0\n for a in s:\n- if s == 'R':\n+ if a == 'R':\n cnt += 1\n if N - cnt < cnt:\n print('Yes')\n else:\n print('No')\n", "FL_content": " N = int(input())\n-s = list(input().split())\n cnt = 0\n for a in s:\n- if s == 'R':\n cnt += 1\n if N - cnt < cnt:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u843932857", "problem_id": "p03080", "submission1_id": "s660588211", "submission2_id": "s682919793", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns = input().split()\n\nr = 0\nb = 0\nfor i in s:\n if i == \"R\":\n r += 1\n if i == \"B\":\n b += 1\n\nif r <= b:\n print(\"No\")\nelse:\n print(\"Yes\")", "code2": "n=int(input())\ns = input()\n\nr = 0\nb = 0\nfor i in s:\n if i == \"R\":\n r += 1\n if i == \"B\":\n b += 1\n\nif r <= b:\n print(\"No\")\nelse:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553977164", "date2": "1553977255", "bleu_score": "0.9529500681522682", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nRRAR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n=int(input()) # (0): n=4\ns = input().split() # (1): s=['RRAR']\n\nr = 0 # (2): r=0\nb = 0 # (3): b=0\nfor i in s: # (4): i=RRAR (7): NO CHANGE\n if i == \"R\": # (5): NO CHANGE\n r += 1\n if i == \"B\": # (6): NO CHANGE\n b += 1\n\nif r <= b: # (8): NO CHANGE\n print(\"No\")\nelse:\n print(\"Yes\")"], "anno_status": [true], "diff_content": " n=int(input())\n-s = input().split()\n+s = input()\n \n r = 0\n b = 0\n for i in s:\n if i == \"R\":\n r += 1\n if i == \"B\":\n b += 1\n \n if r <= b:\n print(\"No\")\n else:\n print(\"Yes\")\n", "FL_content": " n=int(input())\n-s = input().split()\n \n r = 0\n b = 0\n for i in s:\n if i == \"R\":\n r += 1\n if i == \"B\":\n b += 1\n \n if r <= b:\n print(\"No\")\n else:\n print(\"Yes\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u890638336", "problem_id": "p03080", "submission1_id": "s448965474", "submission2_id": "s091857715", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = input()\ns = input()\n\nN1 = int(N)/2\n\nimport math\nmath.floor(N1)\nN1= int(N1)\n\nlist_s = list(s)\nlist_s.sort()\nX = list_s[N1]\n\nif X=='R':\n print('Yes')\nelse:\n print('No')", "code2": "N = input()\ns = input()\n \nN1 = int(N)/2\n \nimport math\nN1= math.ceil(N1)\nN1= int(N1)-1\n \nlist_s = list(s)\nlist_s.sort()\nX = list_s[N1]\n \nif X=='R':\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553980921", "date2": "1553982181", "bleu_score": "0.8707204052677296", "code1_test_status": [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0], "code1_test_score": 96, "total_score": 102, "input": "4\nBCRS\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = input() # (0): N=4\ns = input() # (1): s=BCRS\n\nN1 = int(N)/2 # (2): N1=2.0, math=\n\nimport math\nmath.floor(N1) # (3): NO CHANGE\nN1= int(N1) # (4): NO CHANGE\n\nlist_s = list(s) # (5): list_s=['B', 'C', 'R', 'S']\nlist_s.sort() # (6): NO CHANGE\nX = list_s[N1] # (7): X=R\n\nif X=='R': # (8): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N = input()\n s = input()\n-\n+ \n N1 = int(N)/2\n-\n+ \n import math\n-math.floor(N1)\n-N1= int(N1)\n-\n+N1= math.ceil(N1)\n+N1= int(N1)-1\n+ \n list_s = list(s)\n list_s.sort()\n X = list_s[N1]\n-\n+ \n if X=='R':\n print('Yes')\n else:\n print('No')\n", "FL_content": " N = input()\n s = input()\n-\n N1 = int(N)/2\n-\n import math\n-math.floor(N1)\n-N1= int(N1)\n-\n list_s = list(s)\n list_s.sort()\n X = list_s[N1]\n-\n if X=='R':\n print('Yes')\n else:\n print('No')\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 17 }, { "user_id": "u169678167", "problem_id": "p03080", "submission1_id": "s614245282", "submission2_id": "s276901375", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nB = list(input())\n\ncount_RED = 0\nfor i in range (0, A):\n if B[i] == \"R\":\n count_RED += 1\ncount_BLUE = A - count_RED\nif (count_RED > count_BLUE):\n print('Yes')\nelse:\n print('NO') ", "code2": "A = int(input())\nB = list(input())\n\ncount_RED = 0\nfor i in range (0, A):\n if B[i] == \"R\":\n count_RED += 1\ncount_BLUE = A - count_RED\nif (count_RED > count_BLUE):\n print('Yes')\nelse:\n print('No') ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553977769", "date2": "1553977902", "bleu_score": "0.9881929457145813", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 0, 1, 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, 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, 0, 0, 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": 13, "total_score": 102, "input": "4\nCOAS\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["A = int(input()) # (0): A=4\nB = list(input()) # (1): B=['C', 'O', 'A', 'S']\n\ncount_RED = 0 # (2): count_RED=0\nfor i in range (0, A): # (3): i=0 (5): i=1 ... (11): NO CHANGE\n if B[i] == \"R\": # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\n count_RED += 1\ncount_BLUE = A - count_RED # (12): count_BLUE=4\nif (count_RED > count_BLUE): # (13): NO CHANGE\n print('Yes')\nelse:\n print('NO') "], "anno_status": [true], "diff_content": " A = int(input())\n B = list(input())\n \n count_RED = 0\n for i in range (0, A):\n if B[i] == \"R\":\n count_RED += 1\n count_BLUE = A - count_RED\n if (count_RED > count_BLUE):\n print('Yes')\n else:\n- print('NO') \n+ print('No') \n", "FL_content": " A = int(input())\n B = list(input())\n \n count_RED = 0\n for i in range (0, A):\n if B[i] == \"R\":\n count_RED += 1\n count_BLUE = A - count_RED\n if (count_RED > count_BLUE):\n print('Yes')\n else:\n- print('NO') \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u114648678", "problem_id": "p03080", "submission1_id": "s914142925", "submission2_id": "s168051841", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\ns=list(input().split())\nn=0\nfor i in range(N):\n if i=='R':\n n+=1\n else:\n n+=0\nif N/2N.count(\"B\"):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "s = int(input())\nN = [i for i in input()]\nif N.count(\"R\")>N.count(\"B\"):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553989752", "date2": "1553989801", "bleu_score": "0.8373001395286973", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nRRCR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = [i for i in input()] # (0): N=['4']\nif N.count(\"R\")>N.count(\"B\"): # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": "+s = int(input())\n N = [i for i in input()]\n if N.count(\"R\")>N.count(\"B\"):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " N = [i for i in input()]\n if N.count(\"R\")>N.count(\"B\"):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u688055251", "problem_id": "p03080", "submission1_id": "s739370397", "submission2_id": "s803347098", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\ns=input().split()\ny=0\nv=0\nfor i in s:\n if i=='R':\n y+=1\n else:\n v+=1\nif y>v:\n print('Yes')\nelse:\n print('No')", "code2": "N=int(input())\ns=input()\ny=0\nv=0\nfor i in s:\n if i=='R':\n y+=1\n elif i=='B':\n v+=1\nif y>v:\n print('Yes')\nelif v>=y:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555929946", "date2": "1555936296", "bleu_score": "0.8783572003999275", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nCRRR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N=int(input()) # (0): N=4\ns=input().split() # (1): s=['CRRR']\ny=0 # (2): y=0\nv=0 # (3): v=0\nfor i in s: # (4): i=CRRR (7): NO CHANGE\n if i=='R': # (5): NO CHANGE\n y+=1\n else:\n v+=1 # (6): v=1\nif y>v: # (8): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N=int(input())\n-s=input().split()\n+s=input()\n y=0\n v=0\n for i in s:\n if i=='R':\n y+=1\n- else:\n+ elif i=='B':\n v+=1\n if y>v:\n print('Yes')\n-else:\n+elif v>=y:\n print('No')\n", "FL_content": " N=int(input())\n-s=input().split()\n y=0\n v=0\n for i in s:\n if i=='R':\n y+=1\n- else:\n v+=1\n if y>v:\n print('Yes')\n-else:\n print('No')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u677393869", "problem_id": "p03080", "submission1_id": "s803059106", "submission2_id": "s564884671", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=input(int())\nn=input(int())\nA=n.count(\"R\")\nB=n.count(\"B\")\nif A>B:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N=input(str())\nn=input(str())\nA=n.count(\"R\")\nB=n.count(\"B\")\nif A>B:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553976780", "date2": "1553977010", "bleu_score": "0.9145943444953695", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\nDRRR\n", "actual_output": "00Yes\n", "expected_output": "Yes\n\n", "anno_code": ["N=input(int()) # (0): N=4\nn=input(int()) # (1): n=DRRR\nA=n.count(\"R\") # (2): A=3\nB=n.count(\"B\") # (3): B=0\nif A>B: # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": "-N=input(int())\n-n=input(int())\n+N=input(str())\n+n=input(str())\n A=n.count(\"R\")\n B=n.count(\"B\")\n if A>B:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "-N=input(int())\n-n=input(int())\n A=n.count(\"R\")\n B=n.count(\"B\")\n if A>B:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u138781768", "problem_id": "p03080", "submission1_id": "s816314761", "submission2_id": "s284258923", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ns = input()\nn1 = N / 2\ns1 = s.count(\"R\")\nif s1 >= n1:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N = int(input())\ns = input()\nn1 = N / 2\ns1 = s.count(\"R\")\nif s1 > n1:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554738770", "date2": "1554738804", "bleu_score": "0.9766610394532391", "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, 0], "code1_test_score": 100, "total_score": 102, "input": "4\nBRBR\n", "actual_output": "Yes\n", "expected_output": "No\n", "anno_code": ["N = int(input()) # (0): N=4\ns = input() # (1): s=BRBR\nn1 = N / 2 # (2): n1=2.0\ns1 = s.count(\"R\") # (3): s1=2\nif s1 >= n1: # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " N = int(input())\n s = input()\n n1 = N / 2\n s1 = s.count(\"R\")\n-if s1 >= n1:\n+if s1 > n1:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " N = int(input())\n s = input()\n n1 = N / 2\n s1 = s.count(\"R\")\n-if s1 >= n1:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u551692187", "problem_id": "p03080", "submission1_id": "s983692053", "submission2_id": "s327795247", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ns = input().split()\nprint('Yes') if s.count('R') * 2 > N else print('No')", "code2": "N = int(input())\ns = input()\nprint('Yes') if s.count('R')>s.count('B') else print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554129012", "date2": "1554129126", "bleu_score": "0.8262616412496223", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nDRRR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=4\ns = input().split() # (1): s=['DRRR']\nprint('Yes') if s.count('R') * 2 > N else print('No')"], "anno_status": [true], "diff_content": " N = int(input())\n-s = input().split()\n-print('Yes') if s.count('R') * 2 > N else print('No')\n+s = input()\n+print('Yes') if s.count('R')>s.count('B') else print('No')\n", "FL_content": " N = int(input())\n-s = input().split()\n-print('Yes') if s.count('R') * 2 > N else print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u163320134", "problem_id": "p03080", "submission1_id": "s633612254", "submission2_id": "s587939876", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=input()\ncount=0\nfor i in s:\n if i=='B':\n count+=1\nif count>(n-count):\n print('Yes')\nelse:\n print('No')", "code2": "n=int(input())\ns=input()\ncount=0\nfor i in s:\n if i=='R':\n count+=1\nif count>(n-count):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555226347", "date2": "1555226465", "bleu_score": "0.979629900343721", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nERRR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n=int(input()) # (0): n=4\ns=input() # (1): s=ERRR\ncount=0 # (2): count=0\nfor i in s: # (3): i=E (5): i=R ... (11): NO CHANGE\n if i=='B': # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\n count+=1\nif count>(n-count): # (12): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " n=int(input())\n s=input()\n count=0\n for i in s:\n- if i=='B':\n+ if i=='R':\n count+=1\n if count>(n-count):\n print('Yes')\n else:\n print('No')\n", "FL_content": " n=int(input())\n s=input()\n count=0\n for i in s:\n- if i=='B':\n count+=1\n if count>(n-count):\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u850266651", "problem_id": "p03080", "submission1_id": "s802658580", "submission2_id": "s539783417", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = input()\n\na = 0\nfor s in S:\n if s==\"B\":\n \t a += 1\nif a > N-a:\n\tprint(\"Yes\")\nelse:\n \tprint(\"No\")", "code2": "N = int(input())\nS = input()\n\na = 0\nfor s in S:\n if s==\"R\":\n \t a += 1\nif a > N-a:\n\tprint(\"Yes\")\nelse:\n \tprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559394995", "date2": "1559395038", "bleu_score": "0.9785826525822038", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nRRRD\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=4\nS = input() # (1): S=RRRD\n\na = 0 # (2): a=0\nfor s in S: # (3): s=R (5): NO CHANGE ... (11): NO CHANGE\n if s==\"B\": # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\n \t a += 1\nif a > N-a: # (12): NO CHANGE\n\tprint(\"Yes\")\nelse:\n \tprint(\"No\")"], "anno_status": [true], "diff_content": " N = int(input())\n S = input()\n \n a = 0\n for s in S:\n- if s==\"B\":\n+ if s==\"R\":\n \t a += 1\n if a > N-a:\n \tprint(\"Yes\")\n else:\n \tprint(\"No\")\n", "FL_content": " N = int(input())\n S = input()\n \n a = 0\n for s in S:\n- if s==\"B\":\n \t a += 1\n if a > N-a:\n \tprint(\"Yes\")\n else:\n \tprint(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u119983020", "problem_id": "p03080", "submission1_id": "s619346986", "submission2_id": "s726632355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nif s.count(\"R\")>s.count(\"B\"):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N=input()\ns = input()\nif s.count(\"R\")>s.count(\"B\"):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554098044", "date2": "1554098126", "bleu_score": "0.881634689686518", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nRRBR\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["s = input() # (0): s=4\nif s.count(\"R\")>s.count(\"B\"): # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": "+N=input()\n s = input()\n if s.count(\"R\")>s.count(\"B\"):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " s = input()\n if s.count(\"R\")>s.count(\"B\"):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u082861480", "problem_id": "p03080", "submission1_id": "s177695903", "submission2_id": "s871453781", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nred_num = 0\nfor i in input():\n if i == 'R':\n red_num += 1\nprint('Yes' if red_num > N else 'No')", "code2": "N = int(input())\nred_num = 0\nblue_num = 0\nfor i in input():\n if i == 'R':\n red_num += 1\n else:\n blue_num += 1\nprint('Yes' if red_num > blue_num else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554212345", "date2": "1554212464", "bleu_score": "0.6976971368358866", "code1_test_status": [0, 1, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 89, "total_score": 102, "input": "4\nCRRR\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=4\nred_num = 0 # (1): red_num=0\nfor i in input(): # (2): i=C (4): i=R ... (13): NO CHANGE\n if i == 'R': # (3): NO CHANGE (5): NO CHANGE ... (11): NO CHANGE\n red_num += 1 # (6): red_num=1 (9): red_num=2 (12): red_num=3\nprint('Yes' if red_num > N else 'No')"], "anno_status": [true], "diff_content": " N = int(input())\n red_num = 0\n+blue_num = 0\n for i in input():\n if i == 'R':\n red_num += 1\n-print('Yes' if red_num > N else 'No')\n+ else:\n+ blue_num += 1\n+print('Yes' if red_num > blue_num else 'No')\n", "FL_content": " N = int(input())\n red_num = 0\n for i in input():\n if i == 'R':\n red_num += 1\n-print('Yes' if red_num > N else 'No')\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u882858304", "problem_id": "p02912", "submission1_id": "s146421644", "submission2_id": "s766975980", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=[int(i) for i in input().split()]\nA = [int(i) for i in input().split()]\nfor i in range(M):\n l=A.index(max(A))\n A[l]\nprint(sum(A))", "code2": "import heapq\nN,M=[int(i) for i in input().split()]\nA=sorted([-int(i) for i in input().split()])\nfor i in range(M):heapq.heappush(A,-(-heapq.heappop(A)\nprint(-sum(A))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568599228", "date2": "1568603994", "bleu_score": "0.6169019664800344", "code1_test_status": [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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 17, "total_score": 104, "input": "3 3\n2 3 5\n", "actual_output": "10\n", "expected_output": "4\n\n", "anno_code": ["N,M=[int(i) for i in input().split()] # (0): N=3, M=3\nA = [int(i) for i in input().split()] # (1): A=[2, 3, 5]\nfor i in range(M): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n l=A.index(max(A)) # (3): l=2 (6): NO CHANGE (9): NO CHANGE\n A[l] # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\nprint(sum(A))"], "anno_status": [true], "diff_content": "+import heapq\n N,M=[int(i) for i in input().split()]\n-A = [int(i) for i in input().split()]\n-for i in range(M):\n- l=A.index(max(A))\n- A[l]\n-print(sum(A))\n+A=sorted([-int(i) for i in input().split()])\n+for i in range(M):heapq.heappush(A,-(-heapq.heappop(A)\n+print(-sum(A))\n", "FL_content": " N,M=[int(i) for i in input().split()]\n-A = [int(i) for i in input().split()]\n-for i in range(M):\n- l=A.index(max(A))\n- A[l]\n-print(sum(A))\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 6 }, { "user_id": "u202570162", "problem_id": "p02912", "submission1_id": "s479081931", "submission2_id": "s578349434", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nn,m = map(int,input().split())\nprice = [-int(i) for i in input().split()]\n\nheapq.heapify(price)\nfor i in range(m):\n a = heapq.heappop(price)\n heapq.heappush(price,a)\nprint(-sum(price))\n ", "code2": "import heapq\n\nn,m = map(int,input().split())\nprice = [-int(i) for i in input().split()]\n\nheapq.heapify(price)\n\nfor i in range(m):\n \n a = int(heapq.heappop(price)/2)\n heapq.heappush(price,a)\n \nprint(-sum(price))\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568764122", "date2": "1568764969", "bleu_score": "0.9033215032811831", "code1_test_status": [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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 17, "total_score": 104, "input": "10 1\n1000001000 1001010000 1011000000 1100000000 1000001000 1000000100 1000000000 1010010000 1000010000 1100000000\n", "actual_output": "10222032100\n", "expected_output": "9672032100\n\n", "anno_code": ["import heapq\n\nn,m = map(int,input().split()) # (0): n=10, m=1\nprice = [-int(i) for i in input().split()] # (1): price=[-1000001000, -1001010000, -1011000000, -1100000000, -1000001000, -1000000100, -1000000000, -1010010000, -1000010000, -1100000000]\n\nheapq.heapify(price) # (2): price=[-1100000000, -1100000000, -1011000000, -1010010000, -1001010000, -1000000100, -1000000000, -1000001000, -1000010000, -1000001000]\nfor i in range(m): # (3): i=0 (6): NO CHANGE\n a = heapq.heappop(price) # (4): price=[-1100000000, -1010010000, -1011000000, -1000010000, -1001010000, -1000000100, -1000000000, -1000001000, -1000001000], a=-1100000000\n heapq.heappush(price,a) # (5): price=[-1100000000, -1100000000, -1011000000, -1000010000, -1010010000, -1000000100, -1000000000, -1000001000, -1000001000, -1001010000]\nprint(-sum(price))\n "], "anno_status": [true], "diff_content": " import heapq\n \n n,m = map(int,input().split())\n price = [-int(i) for i in input().split()]\n \n heapq.heapify(price)\n+\n for i in range(m):\n- a = heapq.heappop(price)\n+ \n+ a = int(heapq.heappop(price)/2)\n heapq.heappush(price,a)\n+ \n print(-sum(price))\n \n", "FL_content": " import heapq\n \n n,m = map(int,input().split())\n price = [-int(i) for i in input().split()]\n \n heapq.heapify(price)\n for i in range(m):\n- a = heapq.heappop(price)\n heapq.heappush(price,a)\n print(-sum(price))\n \n", "added_lines": 4, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u931118906", "problem_id": "p02912", "submission1_id": "s684022595", "submission2_id": "s266426003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport heapq\ninput=sys.stdin.readline\nn,m=map(int,input().split())\na=list(map(lambda x:int(x)*(-1),input().split()))\nheapq.heapify(a)\nfor _ in range(m):\n heapq.heappush(a,(-1)*(heapq.heappop(a)/2))\nprint(int(sum(a)*(-1)))", "code2": "import sys\nimport heapq\ninput=sys.stdin.readline\nn,m=map(int,input().split())\na=list(map(lambda x:int(x)*(-1),input().split()))\nheapq.heapify(a)\nfor _ in range(m):\n mina=int(heapq.heappop(a)/2)\n heapq.heappush(a,mina)\nprint(sum(a)*(-1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568838790", "date2": "1568839379", "bleu_score": "0.9260447103595217", "code1_test_status": [1, 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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0], "code1_test_score": 19, "total_score": 104, "input": "3 3\n2 3 5\n", "actual_output": "-5\n", "expected_output": "4\n\n", "anno_code": ["import sys\nimport heapq\ninput=sys.stdin.readline # (0): input=\nn,m=map(int,input().split()) # (1): n=3, m=3\na=list(map(lambda x:int(x)*(-1),input().split())) # (2): a=[-2, -3, -5]\nheapq.heapify(a) # (3): a=[-5, -3, -2]\nfor _ in range(m): # (4): _=0 (6): _=1 ... (10): NO CHANGE\n heapq.heappush(a,(-1)*(heapq.heappop(a)/2)) # (5): a=[-3, -2, 2.5] (7): a=[-2, 2.5, 1.5] (9): a=[1.0, 2.5, 1.5]\nprint(int(sum(a)*(-1)))"], "anno_status": [true], "diff_content": " import sys\n import heapq\n input=sys.stdin.readline\n n,m=map(int,input().split())\n a=list(map(lambda x:int(x)*(-1),input().split()))\n heapq.heapify(a)\n for _ in range(m):\n- heapq.heappush(a,(-1)*(heapq.heappop(a)/2))\n-print(int(sum(a)*(-1)))\n+ mina=int(heapq.heappop(a)/2)\n+ heapq.heappush(a,mina)\n+print(sum(a)*(-1))\n", "FL_content": " import sys\n import heapq\n input=sys.stdin.readline\n n,m=map(int,input().split())\n a=list(map(lambda x:int(x)*(-1),input().split()))\n heapq.heapify(a)\n for _ in range(m):\n- heapq.heappush(a,(-1)*(heapq.heappop(a)/2))\n-print(int(sum(a)*(-1)))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u616217092", "problem_id": "p02912", "submission1_id": "s826672032", "submission2_id": "s066000343", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nfrom bisect import insort\n\n\ndef main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = [int(x) for x in stdin.readline().rstrip().split()]\n As.sort()\n for _ in range(M):\n x = As[-1] / 2\n insort(As, x)\n del As[-1]\n sum_ = 0\n for x in As:\n sum_ += x\n print(sum_)\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "from sys import stdin\nimport heapq\n\n\ndef main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = []\n for i in [int(x) for x in stdin.readline().rstrip().split()]:\n heapq.heappush(As, -i)\n for _ in range(M):\n x = heapq.heappop(As)\n heapq.heappush(As, x / 2)\n print(sum([-1 * int(x) for x in As]))\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568598842", "date2": "1568603675", "bleu_score": "0.775081181301847", "code1_test_status": [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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 17, "total_score": 104, "input": "10 1\n1000010001 1011000000 1110000000 1100000000 1000001000 0000000100 1000000000 1010010001 1000011000 1100000000\n", "actual_output": "8776032102.0\n", "expected_output": "8776032102\n\n", "anno_code": ["from sys import stdin\nfrom bisect import insort\n\n\ndef main(): # (0): main=\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = [int(x) for x in stdin.readline().rstrip().split()]\n As.sort()\n for _ in range(M):\n x = As[-1] / 2\n insort(As, x)\n del As[-1]\n sum_ = 0\n for x in As:\n sum_ += x\n print(sum_)\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " from sys import stdin\n-from bisect import insort\n+import heapq\n \n \n def main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n- As = [int(x) for x in stdin.readline().rstrip().split()]\n- As.sort()\n+ As = []\n+ for i in [int(x) for x in stdin.readline().rstrip().split()]:\n+ heapq.heappush(As, -i)\n for _ in range(M):\n- x = As[-1] / 2\n- insort(As, x)\n- del As[-1]\n- sum_ = 0\n- for x in As:\n- sum_ += x\n- print(sum_)\n+ x = heapq.heappop(As)\n+ heapq.heappush(As, x / 2)\n+ print(sum([-1 * int(x) for x in As]))\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " from sys import stdin\n-from bisect import insort\n \n \n def main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n- As = [int(x) for x in stdin.readline().rstrip().split()]\n- As.sort()\n for _ in range(M):\n- x = As[-1] / 2\n- insort(As, x)\n- del As[-1]\n- sum_ = 0\n- for x in As:\n- sum_ += x\n- print(sum_)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 7, "removed_lines": 10, "code1_lines": 21 }, { "user_id": "u917558625", "problem_id": "p02912", "submission1_id": "s128208907", "submission2_id": "s381288553", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n \ns=list(map(int,input().split()))\nt=list(map(int,input().split()))\na=0\nb=0\nc=0\nd=s[1]\nt.sort(reverse=True)\nif s[0]==1:\n for i in range(s[1]):\n t[0]=math.floor(t[0]/2)\nelse:\n c=t[0]/2\n for j in range(s[1]):\n for l in range(s[0]):\n if d>0:\n if c<=t[l]:\n t[l]=math.floor(t[l]/2)\n d=d-1\n else:\n t.sort(reverse=True)\n c=t[0]/2\n continue\n else:\n break\nprint(sum(t))", "code2": "import math\n \ns=list(map(int,input().split()))\nt=list(map(int,input().split()))\na=0\nb=0\nc=0\nd=s[1]\nt.sort(reverse=True)\nif s[0]==1:\n for i in range(s[1]):\n t[0]=math.floor(t[0]/2)\nelse:\n c=t[0]/2\n for j in range(s[1]):\n for l in range(s[0]):\n if d>0:\n if c0: # (11): NO CHANGE (16): NO CHANGE ... (38): NO CHANGE\n if c<=t[l]: # (12): NO CHANGE (17): NO CHANGE ... (30): NO CHANGE\n t[l]=math.floor(t[l]/2) # (13): t=[4, 3, 2] (24): t=[4, 3, 1] (31): t=[2, 3, 1]\n d=d-1 # (14): d=2 (25): d=1 (32): d=0\n else:\n t.sort(reverse=True) # (18): NO CHANGE\n c=t[0]/2 # (19): c=2.0\n continue # (20): NO CHANGE\n else:\n break # (35): NO CHANGE (39): NO CHANGE\nprint(sum(t))"], "anno_status": [true], "diff_content": " import math\n \n s=list(map(int,input().split()))\n t=list(map(int,input().split()))\n a=0\n b=0\n c=0\n d=s[1]\n t.sort(reverse=True)\n if s[0]==1:\n for i in range(s[1]):\n t[0]=math.floor(t[0]/2)\n else:\n c=t[0]/2\n for j in range(s[1]):\n for l in range(s[0]):\n if d>0:\n- if c<=t[l]:\n+ if c0:\n- if c<=t[l]:\n t[l]=math.floor(t[l]/2)\n d=d-1\n else:\n t.sort(reverse=True)\n c=t[0]/2\n- continue\n else:\n break\n-print(sum(t))\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 27 }, { "user_id": "u480200603", "problem_id": "p02912", "submission1_id": "s676564889", "submission2_id": "s117226079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq, math\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nar = [-i for i in a]\nheapq.heapify(ar)\n\nwhile m > 0:\n discount = heapq.heappop(ar)\n heapq.heappush(ar, discount/2)\n m -= 1\n\nprint(math.floor(-sum(ar)))\n", "code2": "import heapq, math\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nar = [-i for i in a]\nheapq.heapify(ar)\n\nfor _ in range(m):\n discount = heapq.heappop(ar)\n heapq.heappush(ar, discount/2)\n\nans = 0\nfor i in ar:\n ans += math.floor(-i)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573707658", "date2": "1573708019", "bleu_score": "0.8116080077579296", "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, 1, 0, 1], "code1_test_score": 103, "total_score": 104, "input": "4 4\n1 9 3 5\n", "actual_output": "7\n", "expected_output": "6\n", "anno_code": ["import heapq, math\nn, m = map(int, input().split()) # (0): n=4, m=4\na = list(map(int, input().split())) # (1): a=[1, 9, 3, 5]\nar = [-i for i in a] # (2): ar=[-1, -9, -3, -5]\nheapq.heapify(ar) # (3): ar=[-9, -5, -3, -1]\n\nwhile m > 0: # (4): NO CHANGE (8): NO CHANGE ... (20): NO CHANGE\n discount = heapq.heappop(ar) # (5): ar=[-5, -1, -3], discount=-9 (9): ar=[-4.5, -1, -3], discount=-5 ... (17): ar=[-2.5, -2.25, -1], discount=-3\n heapq.heappush(ar, discount/2) # (6): ar=[-5, -4.5, -3, -1] (10): ar=[-4.5, -2.5, -3, -1] ... (18): ar=[-2.5, -2.25, -1, -1.5]\n m -= 1 # (7): m=3 (11): m=2 ... (19): m=0\n\nprint(math.floor(-sum(ar)))\n"], "anno_status": [true], "diff_content": " import heapq, math\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n ar = [-i for i in a]\n heapq.heapify(ar)\n \n-while m > 0:\n+for _ in range(m):\n discount = heapq.heappop(ar)\n heapq.heappush(ar, discount/2)\n- m -= 1\n \n-print(math.floor(-sum(ar)))\n+ans = 0\n+for i in ar:\n+ ans += math.floor(-i)\n \n+print(ans)\n", "FL_content": " import heapq, math\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n ar = [-i for i in a]\n heapq.heapify(ar)\n \n-while m > 0:\n discount = heapq.heappop(ar)\n heapq.heappush(ar, discount/2)\n- m -= 1\n \n-print(math.floor(-sum(ar)))\n \n", "added_lines": 5, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u483304397", "problem_id": "p02912", "submission1_id": "s808137767", "submission2_id": "s020006695", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = map(int, input().split())\nimport heapq\nA = list(map(int, input().split()))\nA = [(-x,x) for x in A]\nheapq.heapify(A)\ndef conf(A, M):\n if M > 0:\n a = heapq.heappop(A)[1]\n heapq.heappush(A, (-int(a/2), int(a/2)))\n else:\n return A\n return conf(A, M-1)\nB = [a[1] for a in A]\nprint(sum(B))", "code2": "N,M = map(int, input().split())\nimport heapq\nA = list(map(int, input().split()))\nA = [(-x,x) for x in A]\nheapq.heapify(A)\nfor _ in range(M):\n a = heapq.heappop(A)[1]\n heapq.heappush(A, (-int(a/2), int(a/2)))\nB = [a[1] for a in A]\nprint(sum(B))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568600520", "date2": "1568775682", "bleu_score": "0.7149531358734414", "code1_test_status": [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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 17, "total_score": 104, "input": "10 1\n1000000000 1001000000 1010000000 1100000000 1000000000 1000000000 1000000000 1010010000 1000000000 1100000000\n", "actual_output": "10221010000\n", "expected_output": "9671010000\n\n", "anno_code": ["N,M = map(int, input().split()) # (0): N=10, M=1, heapq=\nimport heapq\nA = list(map(int, input().split())) # (1): A=[1000000000, 1001000000, 1010000000, 1100000000, 1000000000, 1000000000, 1000000000, 1010010000, 1000000000, 1100000000]\nA = [(-x,x) for x in A] # (2): A=[(-1000000000, 1000000000), (-1001000000, 1001000000), (-1010000000, 1010000000), (-1100000000, 1100000000), (-1000000000, 1000000000), (-1000000000, 1000000000), (-1000000000, 1000000000), (-1010010000, 1010010000), (-1000000000, 1000000000), (-1100000000, 1100000000)]\nheapq.heapify(A) # (3): A=[(-1100000000, 1100000000), (-1100000000, 1100000000), (-1010000000, 1010000000), (-1010010000, 1010010000), (-1001000000, 1001000000), (-1000000000, 1000000000), (-1000000000, 1000000000), (-1000000000, 1000000000), (-1000000000, 1000000000), (-1000000000, 1000000000)]\ndef conf(A, M): # (4): conf=\n if M > 0:\n a = heapq.heappop(A)[1]\n heapq.heappush(A, (-int(a/2), int(a/2)))\n else:\n return A\n return conf(A, M-1)\nB = [a[1] for a in A] # (5): B=[1100000000, 1100000000, 1010000000, 1010010000, 1001000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000]\nprint(sum(B))"], "anno_status": [true], "diff_content": " N,M = map(int, input().split())\n import heapq\n A = list(map(int, input().split()))\n A = [(-x,x) for x in A]\n heapq.heapify(A)\n-def conf(A, M):\n- if M > 0:\n- a = heapq.heappop(A)[1]\n- heapq.heappush(A, (-int(a/2), int(a/2)))\n- else:\n- return A\n- return conf(A, M-1)\n+for _ in range(M):\n+ a = heapq.heappop(A)[1]\n+ heapq.heappush(A, (-int(a/2), int(a/2)))\n B = [a[1] for a in A]\n print(sum(B))\n", "FL_content": " N,M = map(int, input().split())\n import heapq\n A = list(map(int, input().split()))\n A = [(-x,x) for x in A]\n heapq.heapify(A)\n-def conf(A, M):\n- if M > 0:\n- a = heapq.heappop(A)[1]\n- heapq.heappush(A, (-int(a/2), int(a/2)))\n- else:\n- return A\n- return conf(A, M-1)\n B = [a[1] for a in A]\n print(sum(B))\n", "added_lines": 3, "removed_lines": 7, "code1_lines": 14 }, { "user_id": "u489959379", "problem_id": "p02912", "submission1_id": "s978767979", "submission2_id": "s692128524", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nimport math\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nq = []\nheapq.heapify(q)\n\nfor i in range(n):\n heapq.heappush(q, -a[i])\n\nfor _ in range(m):\n b = heapq.heappop(q) / 2\n heapq.heappush(q, b)\n\nprint(math.floor(sum(q) * -1))\n", "code2": "import heapq\nimport math\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nq = []\nheapq.heapify(q)\n\nfor i in range(n):\n heapq.heappush(q, -a[i])\n\nfor _ in range(m):\n b = heapq.heappop(q) / 2\n heapq.heappush(q, math.ceil(b))\n\nprint(sum(q) * -1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574133363", "date2": "1574133510", "bleu_score": "0.961233296105149", "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, 1, 0, 1], "code1_test_score": 103, "total_score": 104, "input": "4 4\n1 9 3 5\n", "actual_output": "7\n", "expected_output": "6\n", "anno_code": ["import heapq\nimport math\n\nn, m = map(int, input().split()) # (0): n=4, m=4\na = list(map(int, input().split())) # (1): a=[1, 9, 3, 5]\nq = [] # (2): q=[]\nheapq.heapify(q) # (3): NO CHANGE\n\nfor i in range(n): # (4): i=0 (6): i=1 ... (12): NO CHANGE\n heapq.heappush(q, -a[i]) # (5): q=[-1] (7): q=[-9, -1] ... (11): q=[-9, -5, -3, -1]\n\nfor _ in range(m): # (13): _=0 (16): _=1 ... (25): NO CHANGE\n b = heapq.heappop(q) / 2 # (14): q=[-5, -1, -3], b=-4.5 (17): q=[-4.5, -1, -3], b=-2.5 ... (23): q=[-2.5, -2.25, -1], b=-1.5\n heapq.heappush(q, b) # (15): q=[-5, -4.5, -3, -1] (18): q=[-4.5, -2.5, -3, -1] ... (24): q=[-2.5, -2.25, -1, -1.5]\n\nprint(math.floor(sum(q) * -1))\n"], "anno_status": [true], "diff_content": " import heapq\n import math\n \n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n q = []\n heapq.heapify(q)\n \n for i in range(n):\n heapq.heappush(q, -a[i])\n \n for _ in range(m):\n b = heapq.heappop(q) / 2\n- heapq.heappush(q, b)\n+ heapq.heappush(q, math.ceil(b))\n \n-print(math.floor(sum(q) * -1))\n+print(sum(q) * -1)\n \n", "FL_content": " import heapq\n import math\n \n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n q = []\n heapq.heapify(q)\n \n for i in range(n):\n heapq.heappush(q, -a[i])\n \n for _ in range(m):\n b = heapq.heappop(q) / 2\n- heapq.heappush(q, b)\n \n-print(math.floor(sum(q) * -1))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u252828980", "problem_id": "p02912", "submission1_id": "s143313976", "submission2_id": "s195610984", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split())\nli = [-int(x) for x in input().split()]\nimport heapq\nheapq.heapify(li)\nfor i in range(b):\n c = heapq.heappop(li)\n heapq.heappush(li,c/2)\nprint(-int(sum(li)))", "code2": "a,b = map(int,input().split())\nli = [-int(x) for x in input().split()]\nimport heapq\nheapq.heapify(li)\nfor i in range(b):\n c = heapq.heappop(li)\n heapq.heappush(li,c/2)\nli = [int(x) for x in li]\nprint(-sum(li))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568663794", "date2": "1568664177", "bleu_score": "0.8803249107614194", "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, 1, 0, 1], "code1_test_score": 103, "total_score": 104, "input": "4 4\n1 9 3 5\n", "actual_output": "7\n", "expected_output": "6\n", "anno_code": ["a,b = map(int,input().split()) # (0): a=4, b=4\nli = [-int(x) for x in input().split()] # (1): li=[-1, -9, -3, -5], heapq=\nimport heapq\nheapq.heapify(li) # (2): li=[-9, -5, -3, -1]\nfor i in range(b): # (3): i=0 (6): i=1 ... (15): NO CHANGE\n c = heapq.heappop(li) # (4): li=[-5, -1, -3], c=-9 (7): li=[-4.5, -1, -3], c=-5 ... (13): li=[-2.5, -2.25, -1], c=-3\n heapq.heappush(li,c/2) # (5): li=[-5, -4.5, -3, -1] (8): li=[-4.5, -2.5, -3, -1] ... (14): li=[-2.5, -2.25, -1, -1.5]\nprint(-int(sum(li)))"], "anno_status": [true], "diff_content": " a,b = map(int,input().split())\n li = [-int(x) for x in input().split()]\n import heapq\n heapq.heapify(li)\n for i in range(b):\n c = heapq.heappop(li)\n heapq.heappush(li,c/2)\n-print(-int(sum(li)))\n+li = [int(x) for x in li]\n+print(-sum(li))\n", "FL_content": " a,b = map(int,input().split())\n li = [-int(x) for x in input().split()]\n import heapq\n heapq.heapify(li)\n for i in range(b):\n c = heapq.heappop(li)\n heapq.heappush(li,c/2)\n-print(-int(sum(li)))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u096983897", "problem_id": "p02912", "submission1_id": "s495725218", "submission2_id": "s336434826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nmnum, gnum = map(int, input().split())\narray = list(map(lambda a: -int(a), input().split()))\n\narray.sort()\nheapq.heapify(array)\n\nfor i in range(gnum):\n\ttemp = heapq.heappop(array)\n\ttemp = temp/2\n\theapq.heappush(array, temp)\n \nprint(sum(array)*-1)", "code2": "import math\nimport heapq\n\nN, M = list(map(int, input().split()))\nA = list(map(lambda a: -int(a), input().split()))\nA.sort()\nheapq.heapify(A)\n\nfor i in range(M):\n a = heapq.heappop(A)\n a /= 2.0\n heapq.heappush(A, a)\n\namount = 0\nfor a in A:\n amount += math.floor(-a)\nprint(amount)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568659566", "date2": "1568659862", "bleu_score": "0.6274256030110799", "code1_test_status": [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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 17, "total_score": 104, "input": "10 1\n1000010000 1001000000 1000000000 1000000000 1001000000 1000000000 1001000010 1010000000 1000000000 1000000000\n", "actual_output": "9508010010.0\n", "expected_output": "9508010010\n\n", "anno_code": ["import heapq\n\nmnum, gnum = map(int, input().split()) # (0): mnum=10, gnum=1\narray = list(map(lambda a: -int(a), input().split())) # (1): array=[-1000010000, -1001000000, -1000000000, -1000000000, -1001000000, -1000000000, -1001000010, -1010000000, -1000000000, -1000000000]\n\narray.sort() # (2): array=[-1010000000, -1001000010, -1001000000, -1001000000, -1000010000, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000]\nheapq.heapify(array) # (3): NO CHANGE\n\nfor i in range(gnum): # (4): i=0 (8): NO CHANGE\n\ttemp = heapq.heappop(array) # (5): array=[-1001000010, -1001000000, -1001000000, -1000000000, -1000010000, -1000000000, -1000000000, -1000000000, -1000000000], temp=-1010000000\n\ttemp = temp/2 # (6): temp=-505000000.0\n\theapq.heappush(array, temp) # (7): array=[-1001000010, -1001000000, -1001000000, -1000000000, -1000010000, -1000000000, -1000000000, -1000000000, -1000000000, -505000000.0]\n \nprint(sum(array)*-1)"], "anno_status": [true], "diff_content": "+import math\n import heapq\n \n-mnum, gnum = map(int, input().split())\n-array = list(map(lambda a: -int(a), input().split()))\n+N, M = list(map(int, input().split()))\n+A = list(map(lambda a: -int(a), input().split()))\n+A.sort()\n+heapq.heapify(A)\n \n-array.sort()\n-heapq.heapify(array)\n+for i in range(M):\n+ a = heapq.heappop(A)\n+ a /= 2.0\n+ heapq.heappush(A, a)\n \n-for i in range(gnum):\n-\ttemp = heapq.heappop(array)\n-\ttemp = temp/2\n-\theapq.heappush(array, temp)\n- \n-print(sum(array)*-1)\n+amount = 0\n+for a in A:\n+ amount += math.floor(-a)\n+print(amount)\n", "FL_content": " import heapq\n \n-mnum, gnum = map(int, input().split())\n-array = list(map(lambda a: -int(a), input().split()))\n \n-array.sort()\n-heapq.heapify(array)\n \n-for i in range(gnum):\n-\ttemp = heapq.heappop(array)\n-\ttemp = temp/2\n-\theapq.heappush(array, temp)\n- \n-print(sum(array)*-1)\n", "added_lines": 13, "removed_lines": 10, "code1_lines": 14 }, { "user_id": "u322229918", "problem_id": "p02912", "submission1_id": "s077943978", "submission2_id": "s522500050", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nmvals = list(map(lambda x: -int(x), input().split()))\n\nimport heapq\nheapq.heapify(mvals)\n\nfor _ in range(M):\n price = heapq.heappop(mvals)\n heapq.heappush(mvals, price / 2)\n\nres = -int(sum(mvals))\nprint(res)", "code2": "N, M = map(int, input().split())\nmvals = list(map(lambda x: -int(x), input().split()))\n\nimport heapq\nheapq.heapify(mvals)\n\nfor _ in range(M):\n price = heapq.heappop(mvals)\n heapq.heappush(mvals, price / 2)\n\nres = sum(map(lambda x:int(-x), mvals))\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586644615", "date2": "1586644913", "bleu_score": "0.9176310451145375", "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, 1, 0, 1], "code1_test_score": 103, "total_score": 104, "input": "4 4\n1 9 3 5\n", "actual_output": "7\n", "expected_output": "6\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=4, M=4\nmvals = list(map(lambda x: -int(x), input().split())) # (1): mvals=[-1, -9, -3, -5], heapq=\n\nimport heapq\nheapq.heapify(mvals) # (2): mvals=[-9, -5, -3, -1]\n\nfor _ in range(M): # (3): _=0 (6): _=1 ... (15): NO CHANGE\n price = heapq.heappop(mvals) # (4): mvals=[-5, -1, -3], price=-9 (7): mvals=[-4.5, -1, -3], price=-5 ... (13): mvals=[-2.5, -2.25, -1], price=-3\n heapq.heappush(mvals, price / 2) # (5): mvals=[-5, -4.5, -3, -1] (8): mvals=[-4.5, -2.5, -3, -1] ... (14): mvals=[-2.5, -2.25, -1, -1.5]\n\nres = -int(sum(mvals)) # (16): res=7\nprint(res)"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n mvals = list(map(lambda x: -int(x), input().split()))\n \n import heapq\n heapq.heapify(mvals)\n \n for _ in range(M):\n price = heapq.heappop(mvals)\n heapq.heappush(mvals, price / 2)\n \n-res = -int(sum(mvals))\n+res = sum(map(lambda x:int(-x), mvals))\n print(res)\n", "FL_content": " N, M = map(int, input().split())\n mvals = list(map(lambda x: -int(x), input().split()))\n \n import heapq\n heapq.heapify(mvals)\n \n for _ in range(M):\n price = heapq.heappop(mvals)\n heapq.heappush(mvals, price / 2)\n \n-res = -int(sum(mvals))\n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u931118906", "problem_id": "p02912", "submission1_id": "s904560377", "submission2_id": "s266426003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport heapq\ninput=sys.stdin.readline\nn,m=map(int,input().split())\na=list(map(lambda x:int(x)*(-1),input().split()))\nheapq.heapify(a)\nfor _ in range(m):\n heapq.heappush(a,heapq.heappop(a)/2)\nprint(int(sum(a)*(-1)))", "code2": "import sys\nimport heapq\ninput=sys.stdin.readline\nn,m=map(int,input().split())\na=list(map(lambda x:int(x)*(-1),input().split()))\nheapq.heapify(a)\nfor _ in range(m):\n mina=int(heapq.heappop(a)/2)\n heapq.heappush(a,mina)\nprint(sum(a)*(-1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568838721", "date2": "1568839379", "bleu_score": "0.9250140524351824", "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, 1, 0, 1], "code1_test_score": 103, "total_score": 104, "input": "4 4\n1 9 3 5\n", "actual_output": "7\n", "expected_output": "6\n", "anno_code": ["import sys\nimport heapq\ninput=sys.stdin.readline # (0): input=\nn,m=map(int,input().split()) # (1): n=4, m=4\na=list(map(lambda x:int(x)*(-1),input().split())) # (2): a=[-1, -9, -3, -5]\nheapq.heapify(a) # (3): a=[-9, -5, -3, -1]\nfor _ in range(m): # (4): _=0 (6): _=1 ... (12): NO CHANGE\n heapq.heappush(a,heapq.heappop(a)/2) # (5): a=[-5, -4.5, -3, -1] (7): a=[-4.5, -2.5, -3, -1] ... (11): a=[-2.5, -2.25, -1, -1.5]\nprint(int(sum(a)*(-1)))"], "anno_status": [true], "diff_content": " import sys\n import heapq\n input=sys.stdin.readline\n n,m=map(int,input().split())\n a=list(map(lambda x:int(x)*(-1),input().split()))\n heapq.heapify(a)\n for _ in range(m):\n- heapq.heappush(a,heapq.heappop(a)/2)\n-print(int(sum(a)*(-1)))\n+ mina=int(heapq.heappop(a)/2)\n+ heapq.heappush(a,mina)\n+print(sum(a)*(-1))\n", "FL_content": " import sys\n import heapq\n input=sys.stdin.readline\n n,m=map(int,input().split())\n a=list(map(lambda x:int(x)*(-1),input().split()))\n heapq.heapify(a)\n for _ in range(m):\n- heapq.heappush(a,heapq.heappop(a)/2)\n-print(int(sum(a)*(-1)))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u358254559", "problem_id": "p02912", "submission1_id": "s834457628", "submission2_id": "s290461788", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\n\nA_list = list(map(int, input().split()))\n\na = list(map(lambda x: x*(-1), A_list))\n\nimport heapq\nimport math\n\n\nheapq.heapify(a)\n\nprint(a)\n\n\nfor i in range(M):\n max_p = heapq.heappop(a)\n max_p = max_p / 2\n heapq.heappush(a, max_p)\n\nres=0\nfor i in range(N):\n a[i] = -a[i]\n res += math.floor(a[i])\n\nprint(res)", "code2": "N, M = map(int, input().split())\n\nA_list = list(map(int, input().split()))\n\na = list(map(lambda x: x*(-1), A_list))\n\nimport heapq\nimport math\n\n\nheapq.heapify(a)\n\n\n\nfor i in range(M):\n max_p = heapq.heappop(a)\n max_p = max_p / 2\n heapq.heappush(a, max_p)\n\nres=0\nfor i in range(N):\n a[i] = -a[i]\n res += math.floor(a[i])\n\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571521711", "date2": "1571521758", "bleu_score": "0.9742973317089707", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "10 1\n1000001000 1001000000 1000100000 1000000100 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n", "actual_output": "[-1001000000, -1000001000, -1000100000, -1000000100, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000]\n9500601100\n", "expected_output": "9500601100\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=10, M=1\n\nA_list = list(map(int, input().split())) # (1): A_list=[1000001000, 1001000000, 1000100000, 1000000100, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000]\n\na = list(map(lambda x: x*(-1), A_list)) # (2): a=[-1000001000, -1001000000, -1000100000, -1000000100, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000], heapq=, math=\n\nimport heapq\nimport math\n\n\nheapq.heapify(a) # (3): a=[-1001000000, -1000001000, -1000100000, -1000000100, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000]\n\nprint(a) # (4): NO CHANGE\n\n\nfor i in range(M): # (5): i=0 (9): NO CHANGE\n max_p = heapq.heappop(a) # (6): a=[-1000100000, -1000001000, -1000000000, -1000000100, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000], max_p=-1001000000\n max_p = max_p / 2 # (7): max_p=-500500000.0\n heapq.heappush(a, max_p) # (8): a=[-1000100000, -1000001000, -1000000000, -1000000100, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000, -500500000.0]\n\nres=0 # (10): res=0\nfor i in range(N): # (11): NO CHANGE (14): i=1 ... (41): NO CHANGE\n a[i] = -a[i] # (12): a=[1000100000, -1000001000, -1000000000, -1000000100, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000, -500500000.0] (15): a=[1000100000, 1000001000, -1000000000, -1000000100, -1000000000, -1000000000, -1000000000, -1000000000, -1000000000, -500500000.0] ... (39): a=[1000100000, 1000001000, 1000000000, 1000000100, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 500500000.0]\n res += math.floor(a[i]) # (13): res=1000100000 (16): res=2000101000 ... (40): res=9500601100\n\nprint(res)"], "anno_status": [false], "diff_content": " N, M = map(int, input().split())\n \n A_list = list(map(int, input().split()))\n \n a = list(map(lambda x: x*(-1), A_list))\n \n import heapq\n import math\n \n \n heapq.heapify(a)\n \n-print(a)\n \n \n for i in range(M):\n max_p = heapq.heappop(a)\n max_p = max_p / 2\n heapq.heappush(a, max_p)\n \n res=0\n for i in range(N):\n a[i] = -a[i]\n res += math.floor(a[i])\n \n print(res)\n", "FL_content": " N, M = map(int, input().split())\n \n A_list = list(map(int, input().split()))\n \n a = list(map(lambda x: x*(-1), A_list))\n \n import heapq\n import math\n \n \n heapq.heapify(a)\n \n-print(a)\n \n \n for i in range(M):\n max_p = heapq.heappop(a)\n max_p = max_p / 2\n heapq.heappush(a, max_p)\n \n res=0\n for i in range(N):\n a[i] = -a[i]\n res += math.floor(a[i])\n \n print(res)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 26 }, { "user_id": "u300538442", "problem_id": "p02912", "submission1_id": "s590096809", "submission2_id": "s788570188", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nX = list(map(int, input().split()))\nA = list(map(int, input().split()))\nheapq.heapify(A)\n\nfor i in range(X[1]):\n x = heapq.heappop(A) * (-1)\n heapq.heappush(A, int(x/2) * (-1))\n\nans = 0\nfor i in range(X[0]):\n ans += A[i]\n\nprint(ans)", "code2": "import heapq\nX = list(map(int, input().split()))\n\nA = list(map(lambda x: int(x)*(-1), input().split())) \nheapq.heapify(A)\n\nfor i in range(X[1]):\n x = heapq.heappop(A) * (-1) \n heapq.heappush(A, int(x/2) * (-1))\n\nans = 0\nfor i in range(X[0]):\n ans -= A[i]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569548673", "date2": "1569548983", "bleu_score": "0.8864799851690479", "code1_test_status": [1, 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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 21, "total_score": 104, "input": "10 1\n1000010001 1011000000 1110000000 1100000000 1000001000 1000000100 1000000000 1010010000 1000011000 1100000000\n", "actual_output": "9831032101\n", "expected_output": "9776032101\n\n", "anno_code": ["import heapq\nX = list(map(int, input().split())) # (0): X=[10, 1]\nA = list(map(int, input().split())) # (1): A=[1000010001, 1011000000, 1110000000, 1100000000, 1000001000, 1000000100, 1000000000, 1010010000, 1000011000, 1100000000]\nheapq.heapify(A) # (2): A=[1000000000, 1000001000, 1000000100, 1000011000, 1011000000, 1000010001, 1110000000, 1010010000, 1100000000, 1100000000]\n\nfor i in range(X[1]): # (3): i=0 (6): NO CHANGE\n x = heapq.heappop(A) * (-1) # (4): A=[1000000100, 1000001000, 1000010001, 1000011000, 1011000000, 1100000000, 1110000000, 1010010000, 1100000000], x=-1000000000\n heapq.heappush(A, int(x/2) * (-1)) # (5): A=[500000000, 1000000100, 1000010001, 1000011000, 1000001000, 1100000000, 1110000000, 1010010000, 1100000000, 1011000000]\n\nans = 0 # (7): ans=0\nfor i in range(X[0]): # (8): NO CHANGE (10): i=1 ... (28): NO CHANGE\n ans += A[i] # (9): ans=500000000 (11): ans=1500000100 ... (27): ans=9831032101\n\nprint(ans)"], "anno_status": [true], "diff_content": " import heapq\n X = list(map(int, input().split()))\n-A = list(map(int, input().split()))\n+\n+A = list(map(lambda x: int(x)*(-1), input().split())) \n heapq.heapify(A)\n \n for i in range(X[1]):\n- x = heapq.heappop(A) * (-1)\n+ x = heapq.heappop(A) * (-1) \n heapq.heappush(A, int(x/2) * (-1))\n \n ans = 0\n for i in range(X[0]):\n- ans += A[i]\n+ ans -= A[i]\n \n print(ans)\n", "FL_content": " import heapq\n X = list(map(int, input().split()))\n-A = list(map(int, input().split()))\n heapq.heapify(A)\n \n for i in range(X[1]):\n- x = heapq.heappop(A) * (-1)\n heapq.heappush(A, int(x/2) * (-1))\n \n ans = 0\n for i in range(X[0]):\n- ans += A[i]\n \n print(ans)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u511379665", "problem_id": "p02912", "submission1_id": "s890154115", "submission2_id": "s033935444", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=map(int,input().split())\nA=list(map(int,input().split()))\n\nans=0\ndef cheap(x,y):\n x=int(x/(2**y))\n return x\n\ni=0\nwhile(i\n x=int(x/(2**y)) # (8): N=3, M=2, A=[1, 13, 3], ans=0, cheap=, i=0 (13): N=3, M=2, A=[0, 13, 3], ans=0, cheap=, i=1\n return x\n\ni=0 # (4): i=0\nwhile(i\n n, m = map(int, input().split())\n a_list = list(map(int, input().split()))\n\n for _ in range(m):\n a_list[a_list.index(max(a_list))] /= 2\n\n print(sum(a_list))\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": "+import heapq\n+\n+\n def main():\n n, m = map(int, input().split())\n- a_list = list(map(int, input().split()))\n+ a_list = list(map(lambda x: -int(x), input().split()))\n \n+ heapq.heapify(a_list)\n for _ in range(m):\n- a_list[a_list.index(max(a_list))] /= 2\n+ a = heapq.heappop(a_list)\n+ heapq.heappush(a_list, -(-a \n \n- print(sum(a_list))\n+ print(-sum(a_list))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " def main():\n n, m = map(int, input().split())\n- a_list = list(map(int, input().split()))\n \n for _ in range(m):\n- a_list[a_list.index(max(a_list))] /= 2\n \n- print(sum(a_list))\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 8, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u616217092", "problem_id": "p02912", "submission1_id": "s535721522", "submission2_id": "s066000343", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nimport heapq\n\n\ndef main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = []\n for i in [int(x) for x in stdin.readline().rstrip().split()]:\n heapq.heappush(As, i)\n for _ in range(M):\n x = heapq.heappop(As)\n heapq.heappush(As, x / 2)\n print(sum([int(x) for x in As]))\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "from sys import stdin\nimport heapq\n\n\ndef main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = []\n for i in [int(x) for x in stdin.readline().rstrip().split()]:\n heapq.heappush(As, -i)\n for _ in range(M):\n x = heapq.heappop(As)\n heapq.heappush(As, x / 2)\n print(sum([-1 * int(x) for x in As]))\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568603112", "date2": "1568603675", "bleu_score": "0.9774401827108793", "code1_test_status": [1, 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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 21, "total_score": 104, "input": "10 1\n1000000000 1000000100 1000000000 1000100000 1000000000 1000000000 1010000000 1010010000 1000000000 1000000000\n", "actual_output": "9520110100\n", "expected_output": "9515105100\n\n", "anno_code": ["from sys import stdin\nimport heapq\n\n\ndef main(): # (0): main=\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = []\n for i in [int(x) for x in stdin.readline().rstrip().split()]:\n heapq.heappush(As, i)\n for _ in range(M):\n x = heapq.heappop(As)\n heapq.heappush(As, x / 2)\n print(sum([int(x) for x in As]))\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " from sys import stdin\n import heapq\n \n \n def main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = []\n for i in [int(x) for x in stdin.readline().rstrip().split()]:\n- heapq.heappush(As, i)\n+ heapq.heappush(As, -i)\n for _ in range(M):\n x = heapq.heappop(As)\n heapq.heappush(As, x / 2)\n- print(sum([int(x) for x in As]))\n+ print(sum([-1 * int(x) for x in As]))\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " from sys import stdin\n import heapq\n \n \n def main():\n N, M = [int(x) for x in stdin.readline().rstrip().split()]\n As = []\n for i in [int(x) for x in stdin.readline().rstrip().split()]:\n- heapq.heappush(As, i)\n for _ in range(M):\n x = heapq.heappop(As)\n heapq.heappush(As, x / 2)\n- print(sum([int(x) for x in As]))\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u423585790", "problem_id": "p02912", "submission1_id": "s450837385", "submission2_id": "s381064438", "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 = float('INF')\n\n\ndef A():\n d = {\"Sunny\":1 , \"Cloudy\":2, \"Rainy\":0}\n a = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n print(a[d[input().rstrip()]])\n return\n\n\ndef B():\n s = S()\n for i, si in enumerate(s):\n if i % 2:\n if si == \"R\":\n print(\"No\")\n return\n else:\n if si == \"L\":\n print(\"No\")\n return\n print(\"Yes\")\n return\n\n\ndef C():\n n, k, q = LI()\n d = [0] * n\n for _ in range(q):\n a = II() - 1\n d[a] += 1\n for a in d:\n if k - (q - a) > 0:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n\n\ndef D():\n n,m = LI()\n a = LI()\n q = []\n for ai in a:\n heappush(q, ai)\n for _ in range(m):\n heappush(q, heappop(q) / 2)\n ans = 0\n while q:\n ans += int(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", "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 = float('INF')\n\n\ndef A():\n d = {\"Sunny\":1 , \"Cloudy\":2, \"Rainy\":0}\n a = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n print(a[d[input().rstrip()]])\n return\n\n\ndef B():\n s = S()\n for i, si in enumerate(s):\n if i % 2:\n if si == \"R\":\n print(\"No\")\n return\n else:\n if si == \"L\":\n print(\"No\")\n return\n print(\"Yes\")\n return\n\n\ndef C():\n n, k, q = LI()\n d = [0] * n\n for _ in range(q):\n a = II() - 1\n d[a] += 1\n for a in d:\n if k - (q - a) > 0:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n\n\ndef D():\n n,m = LI()\n a = LI()\n q = []\n for ai in a:\n heappush(q, -ai)\n for _ in range(m):\n heappush(q, heappop(q) / 2)\n ans = 0\n while q:\n ans += int(-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": "1569529245", "date2": "1569529305", "bleu_score": "0.9972744574458764", "code1_test_status": [1, 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, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 21, "total_score": 104, "input": "10 1\n1000000000 1001000000 1010000000 1000000000 1000000010 1000000100 1000000010 1010110000 1000000100 1000000000\n", "actual_output": "9521110220\n", "expected_output": "9516055220\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 = float('INF') # (4): inf=inf\n\n\ndef A(): # (5): A=\n d = {\"Sunny\":1 , \"Cloudy\":2, \"Rainy\":0}\n a = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n print(a[d[input().rstrip()]])\n return\n\n\ndef B(): # (6): B=\n s = S()\n for i, si in enumerate(s):\n if i % 2:\n if si == \"R\":\n print(\"No\")\n return\n else:\n if si == \"L\":\n print(\"No\")\n return\n print(\"Yes\")\n return\n\n\ndef C(): # (7): C=\n n, k, q = LI()\n d = [0] * n\n for _ in range(q):\n a = II() - 1\n d[a] += 1\n for a in d:\n if k - (q - a) > 0:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n\n\ndef D(): # (8): D=\n n,m = LI()\n a = LI()\n q = []\n for ai in a:\n heappush(q, ai)\n for _ in range(m):\n heappush(q, heappop(q) / 2)\n ans = 0\n while q:\n ans += int(heappop(q))\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 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 = float('INF')\n \n \n def A():\n d = {\"Sunny\":1 , \"Cloudy\":2, \"Rainy\":0}\n a = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n print(a[d[input().rstrip()]])\n return\n \n \n def B():\n s = S()\n for i, si in enumerate(s):\n if i % 2:\n if si == \"R\":\n print(\"No\")\n return\n else:\n if si == \"L\":\n print(\"No\")\n return\n print(\"Yes\")\n return\n \n \n def C():\n n, k, q = LI()\n d = [0] * n\n for _ in range(q):\n a = II() - 1\n d[a] += 1\n for a in d:\n if k - (q - a) > 0:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n \n \n def D():\n n,m = LI()\n a = LI()\n q = []\n for ai in a:\n- heappush(q, ai)\n+ heappush(q, -ai)\n for _ in range(m):\n heappush(q, heappop(q) / 2)\n ans = 0\n while q:\n- ans += int(heappop(q))\n+ ans += int(-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 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 = float('INF')\n \n \n def A():\n d = {\"Sunny\":1 , \"Cloudy\":2, \"Rainy\":0}\n a = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n print(a[d[input().rstrip()]])\n return\n \n \n def B():\n s = S()\n for i, si in enumerate(s):\n if i % 2:\n if si == \"R\":\n print(\"No\")\n return\n else:\n if si == \"L\":\n print(\"No\")\n return\n print(\"Yes\")\n return\n \n \n def C():\n n, k, q = LI()\n d = [0] * n\n for _ in range(q):\n a = II() - 1\n d[a] += 1\n for a in d:\n if k - (q - a) > 0:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n \n \n def D():\n n,m = LI()\n a = LI()\n q = []\n for ai in a:\n- heappush(q, ai)\n for _ in range(m):\n heappush(q, heappop(q) / 2)\n ans = 0\n while q:\n- ans += int(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", "added_lines": 2, "removed_lines": 2, "code1_lines": 88 }, { "user_id": "u262869085", "problem_id": "p02912", "submission1_id": "s654203187", "submission2_id": "s721698216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nN , M = map(int,input().split())\nA = [-int(i) for i in input().split()]\n\nheapq.heapify(A)\nfor _ in range(M):\n a = heapq.heappop(A) >> 1\n heapq.heappush(A,a)\nprint(-sum(A))\n", "code2": "import heapq\n\nN , M = map(int,input().split())\nA = [-int(i) for i in input().split()]\nheapq.heapify(A)\nfor _ in range(M):\n a = -heapq.heappop(A) >> 1\n heapq.heappush(A,-a)\nprint(-sum(A))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575681891", "date2": "1575682042", "bleu_score": "0.9695882230847469", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 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, 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, 0, 0, 0, 1], "code1_test_score": 89, "total_score": 104, "input": "1 101000\n1000000000\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import heapq\n \n N , M = map(int,input().split())\n A = [-int(i) for i in input().split()]\n-\n heapq.heapify(A)\n for _ in range(M):\n- a = heapq.heappop(A) >> 1\n- heapq.heappush(A,a)\n+ a = -heapq.heappop(A) >> 1\n+ heapq.heappush(A,-a)\n print(-sum(A))\n-\n", "FL_content": " import heapq\n \n N , M = map(int,input().split())\n A = [-int(i) for i in input().split()]\n-\n heapq.heapify(A)\n for _ in range(M):\n- a = heapq.heappop(A) >> 1\n- heapq.heappush(A,a)\n print(-sum(A))\n-\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 11 }, { "user_id": "u263159909", "problem_id": "p02912", "submission1_id": "s233689566", "submission2_id": "s574283003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nimport math\n\nn, m = map(int, input().split())\ngoods = list(map(lambda x: int(x) * -1, input().split()))\nheapq.heapify(goods)\nfor i in range(n):\n the_most_expensive = heapq.heappop(goods)\n heapq.heappush(goods, math.ceil(the_most_expensive / 2))\n\nprint(sum(goods) * -1)\n", "code2": "import heapq\nimport math\n\nn, m = map(int, input().split())\ngoods = list(map(lambda x: int(x) * -1, input().split()))\nheapq.heapify(goods)\nfor i in range(m):\n the_most_expensive = heapq.heappop(goods)\n heapq.heappush(goods, math.ceil(the_most_expensive / 2))\n\nprint(sum(goods) * -1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569208891", "date2": "1569209064", "bleu_score": "0.9912508178196271", "code1_test_status": [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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 6, "total_score": 104, "input": "10 2\n1000000000 1001000000 1110000000 1100000000 1000001000 1000000000 1000000000 1010010000 1000000000 1100000000\n", "actual_output": "5160505500\n", "expected_output": "9216011000\n\n", "anno_code": ["import heapq\nimport math\n\nn, m = map(int, input().split()) # (0): n=10, m=2\ngoods = list(map(lambda x: int(x) * -1, input().split())) # (1): goods=[-1000000000, -1001000000, -1110000000, -1100000000, -1000001000, -1000000000, -1000000000, -1010010000, -1000000000, -1100000000]\nheapq.heapify(goods) # (2): goods=[-1110000000, -1100000000, -1000000000, -1100000000, -1001000000, -1000000000, -1000000000, -1010010000, -1000000000, -1000001000]\nfor i in range(n): # (3): i=0 (6): i=1 ... (33): NO CHANGE\n the_most_expensive = heapq.heappop(goods) # (4): goods=[-1100000000, -1100000000, -1000000000, -1010010000, -1001000000, -1000000000, -1000000000, -1000001000, -1000000000], the_most_expensive=-1110000000 (7): goods=[-1100000000, -1010010000, -1000000000, -1000001000, -1001000000, -1000000000, -1000000000, -555000000, -1000000000], the_most_expensive=-1100000000 ... (31): goods=[-555000000, -550000000, -500500000, -550000000, -500000000, -500000500, -500000000, -505005000, -500000000]\n heapq.heappush(goods, math.ceil(the_most_expensive / 2)) # (5): goods=[-1100000000, -1100000000, -1000000000, -1010010000, -1001000000, -1000000000, -1000000000, -1000001000, -1000000000, -555000000] (8): goods=[-1100000000, -1010010000, -1000000000, -1000001000, -1001000000, -1000000000, -1000000000, -555000000, -1000000000, -550000000] ... (32): goods=[-555000000, -550000000, -500500000, -550000000, -500000000, -500000500, -500000000, -505005000, -500000000, -500000000]\n\nprint(sum(goods) * -1)\n"], "anno_status": [true], "diff_content": " import heapq\n import math\n \n n, m = map(int, input().split())\n goods = list(map(lambda x: int(x) * -1, input().split()))\n heapq.heapify(goods)\n-for i in range(n):\n+for i in range(m):\n the_most_expensive = heapq.heappop(goods)\n heapq.heappush(goods, math.ceil(the_most_expensive / 2))\n \n print(sum(goods) * -1)\n \n", "FL_content": " import heapq\n import math\n \n n, m = map(int, input().split())\n goods = list(map(lambda x: int(x) * -1, input().split()))\n heapq.heapify(goods)\n-for i in range(n):\n the_most_expensive = heapq.heappop(goods)\n heapq.heappush(goods, math.ceil(the_most_expensive / 2))\n \n print(sum(goods) * -1)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u989326345", "problem_id": "p03023", "submission1_id": "s601490111", "submission2_id": "s583484396", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nans=180*(N-1)\nprint(ans)\n", "code2": "N=int(input())\nans=180*(N-2)\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559437336", "date2": "1559438184", "bleu_score": "0.933651069586263", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-135\n", "actual_output": "-24480\n", "expected_output": "-24660\n\n", "anno_code": ["N=int(input()) # (0): N=-135\nans=180*(N-1) # (1): ans=-24480\nprint(ans)\n"], "anno_status": [true], "diff_content": " N=int(input())\n-ans=180*(N-1)\n+ans=180*(N-2)\n print(ans)\n \n", "FL_content": " N=int(input())\n-ans=180*(N-1)\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u777148280", "problem_id": "p03023", "submission1_id": "s093064929", "submission2_id": "s128729055", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn = int(input())\ncount = 180 - int(360 / n)\nprint(count * n)\n", "code2": "\nn = int(input())\ncount = 180 - 360 / n\nprint( int(count * n) )\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559443084", "date2": "1559443218", "bleu_score": "0.8846314928682121", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-131\n", "actual_output": "-23842\n", "expected_output": "-23940\n\n", "anno_code": ["\nn = int(input()) # (0): n=-131\ncount = 180 - int(360 / n) # (1): count=182\nprint(count * n)\n"], "anno_status": [true], "diff_content": " \n n = int(input())\n-count = 180 - int(360 / n)\n-print(count * n)\n+count = 180 - 360 / n\n+print( int(count * n) )\n \n", "FL_content": " \n n = int(input())\n-count = 180 - int(360 / n)\n-print(count * n)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u850266651", "problem_id": "p03023", "submission1_id": "s019279677", "submission2_id": "s257573683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nprint(180*(N-1))", "code2": "N = int(input())\nprint(180*(N-2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559437496", "date2": "1559437688", "bleu_score": "0.8986118159169515", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-484\n", "actual_output": "-87300\n", "expected_output": "-87480\n\n", "anno_code": ["N = int(input()) # (0): N=-484\nprint(180*(N-1))"], "anno_status": [true], "diff_content": " N = int(input())\n-print(180*(N-1))\n+print(180*(N-2))\n+\n", "FL_content": " N = int(input())\n-print(180*(N-1))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u389679466", "problem_id": "p03023", "submission1_id": "s274266723", "submission2_id": "s543736948", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nrtn = 180 * (N-2) /N\nprint(rtn*N)\n", "code2": "N = int(input())\n\nrtn = 180 * (N-2) /N\nprint(int(rtn*N))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1559437424", "date2": "1559437878", "bleu_score": "0.9023976028400983", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-361\n", "actual_output": "-65340.0\n", "expected_output": "-65340\n\n", "anno_code": ["N = int(input()) # (0): N=-361\n\nrtn = 180 * (N-2) /N # (1): rtn=180.99723\nprint(rtn*N)\n"], "anno_status": [true], "diff_content": " N = int(input())\n \n rtn = 180 * (N-2) /N\n-print(rtn*N)\n+print(int(rtn*N))\n \n", "FL_content": " N = int(input())\n \n rtn = 180 * (N-2) /N\n-print(rtn*N)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u729707098", "problem_id": "p03023", "submission1_id": "s815434524", "submission2_id": "s049846765", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nprint((n-3)*180)", "code2": "n = int(input())\nprint((n-2)*180)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559457915", "date2": "1559457932", "bleu_score": "0.9184678024441792", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-636\n", "actual_output": "-115020\n", "expected_output": "-114840\n\n", "anno_code": ["n = int(input()) # (0): n=-636\nprint((n-3)*180)"], "anno_status": [true], "diff_content": " n = int(input())\n-print((n-3)*180)\n+print((n-2)*180)\n", "FL_content": " n = int(input())\n-print((n-3)*180)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u474514603", "problem_id": "p03023", "submission1_id": "s835586464", "submission2_id": "s656280816", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nfrom collections import defaultdict\nimport sys\nimport math\nfrom datetime import datetime\n\ndef sol(n):\n \n \n \n \n \n\n return (180 - (360 / n)) * n\n\n\ndo_submit = True\n\n\ndef input_parse(input_str):\n lines = [x.strip() for x in input_str.split(\"\\n\") if x.strip()]\n parsed_lines = [list(map(str, line.split())) for line in lines]\n print(parsed_lines)\n n = int(parsed_lines[0][0])\n \n \n \n return n\n\n\nif not do_submit:\n n = input_parse()\n print(sol(n))\n\n n = input_parse()\n print(sol(n))\n\nelse:\n \n \n \n n = int(input().strip())\n \n print(sol(n))\n\n", "code2": "\n\n\nfrom collections import defaultdict\nimport sys\nimport math\nfrom datetime import datetime\n\ndef sol(n):\n \n \n \n \n \n\n return int((180 - (360 / n)) * n)\n\n\ndo_submit = True\n\n\ndef input_parse(input_str):\n lines = [x.strip() for x in input_str.split(\"\\n\") if x.strip()]\n parsed_lines = [list(map(str, line.split())) for line in lines]\n print(parsed_lines)\n n = int(parsed_lines[0][0])\n \n \n \n return n\n\n\nif not do_submit:\n n = input_parse()\n print(sol(n))\n\n n = input_parse()\n print(sol(n))\n\nelse:\n \n \n \n n = int(input().strip())\n \n print(sol(n))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559988750", "date2": "1559988859", "bleu_score": "0.9869252272559299", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-291\n", "actual_output": "-52740.0\n", "expected_output": "-52740\n\n", "anno_code": ["\n\n\nfrom collections import defaultdict\nimport sys\nimport math\nfrom datetime import datetime\n\ndef sol(n): # (0): sol=\n \n \n \n \n \n\n return (180 - (360 / n)) * n\n\n\ndo_submit = True # (1): do_submit=True\n\n\ndef input_parse(input_str): # (2): input_parse=\n lines = [x.strip() for x in input_str.split(\"\\n\") if x.strip()]\n parsed_lines = [list(map(str, line.split())) for line in lines]\n print(parsed_lines)\n n = int(parsed_lines[0][0])\n \n \n \n return n\n\n\nif not do_submit: # (3): NO CHANGE\n n = input_parse()\n print(sol(n))\n\n n = input_parse()\n print(sol(n))\n\nelse:\n \n \n \n n = int(input().strip()) # (4): n=-291\n \n print(sol(n))\n\n"], "anno_status": [true], "diff_content": " \n \n \n from collections import defaultdict\n import sys\n import math\n from datetime import datetime\n \n def sol(n):\n \n \n \n \n \n \n- return (180 - (360 / n)) * n\n+ return int((180 - (360 / n)) * n)\n \n \n do_submit = True\n \n \n def input_parse(input_str):\n lines = [x.strip() for x in input_str.split(\"\\n\") if x.strip()]\n parsed_lines = [list(map(str, line.split())) for line in lines]\n print(parsed_lines)\n n = int(parsed_lines[0][0])\n \n \n \n return n\n \n \n if not do_submit:\n n = input_parse()\n print(sol(n))\n \n n = input_parse()\n print(sol(n))\n \n else:\n \n \n \n n = int(input().strip())\n \n print(sol(n))\n \n \n", "FL_content": " \n \n \n from collections import defaultdict\n import sys\n import math\n from datetime import datetime\n \n def sol(n):\n \n \n \n \n \n \n- return (180 - (360 / n)) * n\n \n \n do_submit = True\n \n \n def input_parse(input_str):\n lines = [x.strip() for x in input_str.split(\"\\n\") if x.strip()]\n parsed_lines = [list(map(str, line.split())) for line in lines]\n print(parsed_lines)\n n = int(parsed_lines[0][0])\n \n \n \n return n\n \n \n if not do_submit:\n n = input_parse()\n print(sol(n))\n \n n = input_parse()\n print(sol(n))\n \n else:\n \n \n \n n = int(input().strip())\n \n print(sol(n))\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 48 }, { "user_id": "u197427401", "problem_id": "p03023", "submission1_id": "s455254931", "submission2_id": "s587545148", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(int(input())-2) * 180", "code2": "print((int(input())-2) * 180)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560019974", "date2": "1560020058", "bleu_score": "0.7449602631369361", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "893\n", "actual_output": "", "expected_output": "160380\n\n", "anno_code": ["(int(input())-2) * 180"], "anno_status": [true], "diff_content": "-(int(input())-2) * 180\n+print((int(input())-2) * 180)\n", "FL_content": "-(int(input())-2) * 180\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u691018832", "problem_id": "p03023", "submission1_id": "s422331517", "submission2_id": "s621487234", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nprint(360+(n-3)*180)", "code2": "\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nprint(180+(n-3)*180)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559437303", "date2": "1559437475", "bleu_score": "0.9408228243926118", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "862\n", "actual_output": "154980\n", "expected_output": "154800\n\n", "anno_code": ["\nimport sys\ninput = sys.stdin.readline # (0): input=\n\nn = int(input()) # (1): n=862\nprint(360+(n-3)*180)"], "anno_status": [true], "diff_content": " \n import sys\n input = sys.stdin.readline\n \n n = int(input())\n-print(360+(n-3)*180)\n+print(180+(n-3)*180)\n+\n", "FL_content": " \n import sys\n input = sys.stdin.readline\n \n n = int(input())\n-print(360+(n-3)*180)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u333404917", "problem_id": "p03023", "submission1_id": "s453817557", "submission2_id": "s007139151", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nprint(N-1*90)", "code2": "N = int(input())\nprint((N-2)*180)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559530234", "date2": "1559530616", "bleu_score": "0.7549374225849442", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-166\n", "actual_output": "-256\n", "expected_output": "-30240\n\n", "anno_code": ["N = int(input()) # (0): N=-166\nprint(N-1*90)"], "anno_status": [true], "diff_content": " N = int(input())\n-print(N-1*90)\n+print((N-2)*180)\n", "FL_content": " N = int(input())\n-print(N-1*90)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u871596687", "problem_id": "p03023", "submission1_id": "s248119377", "submission2_id": "s616569676", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nprint((180-360/n)*n)", "code2": "n = int(input())\n\nprint(int((180-360/n)*n))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569101527", "date2": "1569101574", "bleu_score": "0.8794245150375142", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "893\n", "actual_output": "160380.0\n", "expected_output": "160380\n\n", "anno_code": ["n = int(input()) # (0): n=893\n\nprint((180-360/n)*n)"], "anno_status": [true], "diff_content": " n = int(input())\n \n-print((180-360/n)*n)\n+print(int((180-360/n)*n))\n", "FL_content": " n = int(input())\n \n-print((180-360/n)*n)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u657208344", "problem_id": "p03023", "submission1_id": "s708467397", "submission2_id": "s223910392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nprint(n*90)", "code2": "n=int(input())\nprint(180*(n-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581726488", "date2": "1581726695", "bleu_score": "0.6982912625524927", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-151\n", "actual_output": "-13590\n", "expected_output": "-27540\n\n", "anno_code": ["n=int(input()) # (0): n=-151\nprint(n*90)"], "anno_status": [true], "diff_content": " n=int(input())\n-print(n*90)\n+print(180*(n-2))\n", "FL_content": " n=int(input())\n-print(n*90)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u252828980", "problem_id": "p03023", "submission1_id": "s782807743", "submission2_id": "s107413161", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print((int(input())-3)*180)", "code2": "print((int(input())-2)*180)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575924900", "date2": "1575924977", "bleu_score": "0.8985396083419646", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "862\n", "actual_output": "154620\n", "expected_output": "154800\n\n", "anno_code": ["print((int(input())-3)*180)"], "anno_status": [true], "diff_content": "-print((int(input())-3)*180)\n+print((int(input())-2)*180)\n", "FL_content": "-print((int(input())-3)*180)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u657208344", "problem_id": "p03023", "submission1_id": "s381291269", "submission2_id": "s223910392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nprint(n*180)", "code2": "n=int(input())\nprint(180*(n-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581726441", "date2": "1581726695", "bleu_score": "0.7376303554524206", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-484\n", "actual_output": "-87120\n", "expected_output": "-87480\n\n", "anno_code": ["n=int(input()) # (0): n=-484\nprint(n*180)"], "anno_status": [true], "diff_content": " n=int(input())\n-print(n*180)\n+print(180*(n-2))\n", "FL_content": " n=int(input())\n-print(n*180)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u368016155", "problem_id": "p03023", "submission1_id": "s649095289", "submission2_id": "s220743936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nprint(180*(N-1))", "code2": "N = int(input())\nprint(180*(N-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559437463", "date2": "1559437475", "bleu_score": "0.9271746317040298", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-246\n", "actual_output": "-44460\n", "expected_output": "-44640\n\n", "anno_code": ["N = int(input()) # (0): N=-246\nprint(180*(N-1))"], "anno_status": [true], "diff_content": " N = int(input())\n-print(180*(N-1))\n+print(180*(N-2))\n", "FL_content": " N = int(input())\n-print(180*(N-1))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u777215291", "problem_id": "p03023", "submission1_id": "s884056559", "submission2_id": "s556078759", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nprint(180*(N-1))", "code2": "N = int(input())\nprint(180*(N-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559437475", "date2": "1559437602", "bleu_score": "0.9271746317040298", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-391\n", "actual_output": "-70560\n", "expected_output": "-70740\n\n", "anno_code": ["N = int(input()) # (0): N=-391\nprint(180*(N-1))"], "anno_status": [true], "diff_content": " N = int(input())\n-print(180*(N-1))\n+print(180*(N-2))\n", "FL_content": " N = int(input())\n-print(180*(N-1))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u869595612", "problem_id": "p03023", "submission1_id": "s241709362", "submission2_id": "s433352473", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(int(input())-2)*180", "code2": "print((int(input())-2)*180)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559442906", "date2": "1559442931", "bleu_score": "0.7248600507984249", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-192\n", "actual_output": "", "expected_output": "-34920\n\n", "anno_code": ["(int(input())-2)*180"], "anno_status": [true], "diff_content": "-(int(input())-2)*180\n+print((int(input())-2)*180)\n", "FL_content": "-(int(input())-2)*180\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u336721073", "problem_id": "p03023", "submission1_id": "s682777517", "submission2_id": "s748089493", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nprint((N-2)*360)", "code2": "N=int(input())\nprint((N-2)*180)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560894781", "date2": "1560894813", "bleu_score": "0.8881135755489994", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-135\n", "actual_output": "-49320\n", "expected_output": "-24660\n\n", "anno_code": ["N=int(input()) # (0): N=-135\nprint((N-2)*360)"], "anno_status": [true], "diff_content": " N=int(input())\n-print((N-2)*360)\n+print((N-2)*180)\n", "FL_content": " N=int(input())\n-print((N-2)*360)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u995102075", "problem_id": "p03023", "submission1_id": "s832521060", "submission2_id": "s053434965", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nprint(180 * (N - 3))\n", "code2": "N = int(input())\n\nprint(180 * (N - 2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559437661", "date2": "1559437721", "bleu_score": "0.931838481115484", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-151\n", "actual_output": "-27720\n", "expected_output": "-27540\n\n", "anno_code": ["N = int(input()) # (0): N=-151\n\nprint(180 * (N - 3))\n"], "anno_status": [true], "diff_content": " N = int(input())\n \n-print(180 * (N - 3))\n+print(180 * (N - 2))\n \n", "FL_content": " N = int(input())\n \n-print(180 * (N - 3))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u309141201", "problem_id": "p03023", "submission1_id": "s189175464", "submission2_id": "s037757475", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nprint(90*n)", "code2": "n = int(input())\nprint(180*(n-2))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597338147", "date2": "1597338275", "bleu_score": "0.717874465540124", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-391\n", "actual_output": "-35190\n", "expected_output": "-70740\n\n", "anno_code": ["n = int(input()) # (0): n=-391\nprint(90*n)"], "anno_status": [true], "diff_content": " n = int(input())\n-print(90*n)\n+print(180*(n-2))\n", "FL_content": " n = int(input())\n-print(90*n)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u663014688", "problem_id": "p03023", "submission1_id": "s220042959", "submission2_id": "s281342418", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nprint((n-1)*180)", "code2": "n = int(input())\n\nprint((n-2)*180)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559437367", "date2": "1559437690", "bleu_score": "0.9210500207490827", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 14, "input": "-729\n", "actual_output": "-131400\n", "expected_output": "-131580\n\n", "anno_code": ["n = int(input()) # (0): n=-729\n\nprint((n-1)*180)"], "anno_status": [true], "diff_content": " n = int(input())\n \n-print((n-1)*180)\n+print((n-2)*180)\n", "FL_content": " n = int(input())\n \n-print((n-1)*180)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u533883485", "problem_id": "p02287", "submission1_id": "s110485424", "submission2_id": "s680508227", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\n\nclass Tree():\n def __init__(self, key):\n self.root = key\n\nclass Node():\n def __init__(self, id, key):\n self.id = id\n self.key = key\n self.parent = None\n self.left = None\n self.right = None\n\n def set_status(self, id, key):\n global node_list\n parent_id = math.floor(id/2)\n odd = id % 2\n self.parent = node_list[parent_id]\n if odd == 0:\n self.parent.left = self\n else:\n self.parent.right = self\n\ndef print_nodes():\n global node_list\n node_list.pop(0)\n for node in node_list:\n print(\"node {}: key = {}\".format(node.id, node.key), end = \"\")\n if node.parent:\n print(\", parent key = {}\".format(node.parent.key), end = \"\")\n if node.left:\n print(\", left key = {}\".format(node.left.key), end = \"\")\n if node.right:\n print(\", right key = {}\".format(node.right.key), end = \"\")\n print()\n\nn = int(input())\ninput_num = list(map(int, input().split()))\nnode_list = [None]\n\nfor i, num in enumerate(input_num):\n i = i + 1 \n node = Node(i, num)\n node_list.append(node)\n\n if i == 1:\n tree = Tree(num)\n else:\n node.set_status(i, num)\n\nprint_nodes()", "code2": "\nimport math\n\nclass Tree():\n def __init__(self, key):\n self.root = key\n\nclass Node():\n def __init__(self, id, key):\n self.id = id\n self.key = key\n self.parent = None\n self.left = None\n self.right = None\n\n def set_status(self, id, key):\n global node_list\n parent_id = math.floor(id/2)\n odd = id % 2\n self.parent = node_list[parent_id]\n if odd == 0:\n self.parent.left = self\n else:\n self.parent.right = self\n\ndef print_nodes():\n global node_list\n node_list.pop(0)\n for node in node_list:\n print(\"node {}: key = {}\".format(node.id, node.key), end = \"\")\n if node.parent:\n print(\", parent key = {}\".format(node.parent.key), end = \"\")\n if node.left:\n print(\", left key = {}\".format(node.left.key), end = \"\")\n if node.right:\n print(\", right key = {}\".format(node.right.key), end = \"\")\n print(\", \")\n\nn = int(input())\ninput_num = list(map(int, input().split()))\nnode_list = [None]\n\nfor i, num in enumerate(input_num):\n i = i + 1 \n node = Node(i, num)\n node_list.append(node)\n\n if i == 1:\n tree = Tree(num)\n else:\n node.set_status(i, num)\n\nprint_nodes()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500955032", "date2": "1500955146", "bleu_score": "0.9956423794269539", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n2 23 0 0 1\n", "actual_output": "node 1: key = 2, left key = 23, right key = 0\nnode 2: key = 23, parent key = 2, left key = 0, right key = 1\nnode 3: key = 0, parent key = 2\nnode 4: key = 0, parent key = 23\nnode 5: key = 1, parent key = 23\n", "expected_output": "node 1: key = 2, left key = 23, right key = 0, \nnode 2: key = 23, parent key = 2, left key = 0, right key = 1, \nnode 3: key = 0, parent key = 2, \nnode 4: key = 0, parent key = 23, \nnode 5: key = 1, parent key = 23, \n\n", "anno_code": ["\nimport math\n\nclass Tree(): # (0): Tree=\n def __init__(self, key):\n self.root = key # (17): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None, ], i=1, num=2, node=, tree=\n\nclass Node(): # (1): Node=\n def __init__(self, id, key):\n self.id = id # (9): NO CHANGE (21): NO CHANGE ... (69): NO CHANGE\n self.key = key # (10): NO CHANGE (22): NO CHANGE ... (70): NO CHANGE\n self.parent = None # (11): NO CHANGE (23): NO CHANGE ... (71): NO CHANGE\n self.left = None # (12): NO CHANGE (24): NO CHANGE ... (72): NO CHANGE\n self.right = None # (13): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None], i=1, num=2, node= (25): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None, ], i=2, num=23, node=, tree= ... (73): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None, , , , ], i=5, num=1, node=, tree=\n\n def set_status(self, id, key):\n global node_list\n parent_id = math.floor(id/2) # (29): parent_id=1 (45): parent_id=1 ... (77): parent_id=2\n odd = id % 2 # (30): odd=0 (46): odd=1 ... (78): odd=1\n self.parent = node_list[parent_id] # (31): NO CHANGE (47): NO CHANGE ... (79): NO CHANGE\n if odd == 0: # (32): NO CHANGE (48): NO CHANGE ... (80): NO CHANGE\n self.parent.left = self # (33): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None, , ], i=2, num=23, node=, tree= (65): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None, , , , ], i=4, num=0, node=, tree=\n else:\n self.parent.right = self # (49): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None, , , ], i=3, num=0, node=, tree= (81): math=, Tree=, Node=, print_nodes=, n=5, input_num=[2, 23, 0, 0, 1], node_list=[None, , , , , ], i=5, num=1, node=, tree=\n\ndef print_nodes(): # (2): print_nodes=\n global node_list\n node_list.pop(0) # (84): NO CHANGE\n for node in node_list: # (85): node= (93): node= ... (116): node=\n print(\"node {}: key = {}\".format(node.id, node.key), end = \"\") # (86): NO CHANGE (94): NO CHANGE ... (117): NO CHANGE\n if node.parent: # (87): NO CHANGE (95): NO CHANGE ... (118): NO CHANGE\n print(\", parent key = {}\".format(node.parent.key), end = \"\") # (96): NO CHANGE (105): NO CHANGE ... (119): NO CHANGE\n if node.left: # (88): NO CHANGE (97): NO CHANGE ... (120): NO CHANGE\n print(\", left key = {}\".format(node.left.key), end = \"\") # (89): NO CHANGE (98): NO CHANGE\n if node.right: # (90): NO CHANGE (99): NO CHANGE ... (121): NO CHANGE\n print(\", right key = {}\".format(node.right.key), end = \"\") # (91): NO CHANGE (100): NO CHANGE\n print() # (92): NO CHANGE (101): NO CHANGE ... (122): NO CHANGE\n\nn = int(input()) # (3): n=5\ninput_num = list(map(int, input().split())) # (4): input_num=[2, 23, 0, 0, 1]\nnode_list = [None] # (5): node_list=[None]\n\nfor i, num in enumerate(input_num): # (6): i=0, num=2 (18): node_list=[None, ], num=23 ... (82): node_list=[None, , , , , ]\n i = i + 1 # (7): i=1 (19): node_list=[None, ], i=2 ... (67): node_list=[None, , , , ], i=5\n node = Node(i, num) # (8): self=, id=1, key=2 (20): self=, id=2, key=23 ... (68): self=, id=5, key=1\n node_list.append(node) # (14): node_list=[None, ] (26): node_list=[None, , ] ... (74): node_list=[None, , , , , ]\n\n if i == 1: # (15): node_list=[None, ] (27): node_list=[None, , ] ... (75): node_list=[None, , , , , ]\n tree = Tree(num) # (16): self=, key=2\n else:\n node.set_status(i, num) # (28): self=, id=2, key=23 (44): self=, id=3, key=0 ... (76): self=, id=5, key=1\n\nprint_nodes() # (83): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n import math\n \n class Tree():\n def __init__(self, key):\n self.root = key\n \n class Node():\n def __init__(self, id, key):\n self.id = id\n self.key = key\n self.parent = None\n self.left = None\n self.right = None\n \n def set_status(self, id, key):\n global node_list\n parent_id = math.floor(id/2)\n odd = id % 2\n self.parent = node_list[parent_id]\n if odd == 0:\n self.parent.left = self\n else:\n self.parent.right = self\n \n def print_nodes():\n global node_list\n node_list.pop(0)\n for node in node_list:\n print(\"node {}: key = {}\".format(node.id, node.key), end = \"\")\n if node.parent:\n print(\", parent key = {}\".format(node.parent.key), end = \"\")\n if node.left:\n print(\", left key = {}\".format(node.left.key), end = \"\")\n if node.right:\n print(\", right key = {}\".format(node.right.key), end = \"\")\n- print()\n+ print(\", \")\n \n n = int(input())\n input_num = list(map(int, input().split()))\n node_list = [None]\n \n for i, num in enumerate(input_num):\n i = i + 1 \n node = Node(i, num)\n node_list.append(node)\n \n if i == 1:\n tree = Tree(num)\n else:\n node.set_status(i, num)\n \n print_nodes()\n", "FL_content": " \n import math\n \n class Tree():\n def __init__(self, key):\n self.root = key\n \n class Node():\n def __init__(self, id, key):\n self.id = id\n self.key = key\n self.parent = None\n self.left = None\n self.right = None\n \n def set_status(self, id, key):\n global node_list\n parent_id = math.floor(id/2)\n odd = id % 2\n self.parent = node_list[parent_id]\n if odd == 0:\n self.parent.left = self\n else:\n self.parent.right = self\n \n def print_nodes():\n global node_list\n node_list.pop(0)\n for node in node_list:\n print(\"node {}: key = {}\".format(node.id, node.key), end = \"\")\n if node.parent:\n print(\", parent key = {}\".format(node.parent.key), end = \"\")\n if node.left:\n print(\", left key = {}\".format(node.left.key), end = \"\")\n if node.right:\n print(\", right key = {}\".format(node.right.key), end = \"\")\n- print()\n \n n = int(input())\n input_num = list(map(int, input().split()))\n node_list = [None]\n \n for i, num in enumerate(input_num):\n i = i + 1 \n node = Node(i, num)\n node_list.append(node)\n \n if i == 1:\n tree = Tree(num)\n else:\n node.set_status(i, num)\n \n print_nodes()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 53 }, { "user_id": "u269568674", "problem_id": "p02287", "submission1_id": "s422722224", "submission2_id": "s481560287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nklist = list(map(int,input().split()))\nplist = []\ni = 0\nk = 1\na = 2**i-1\nwhile 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\nprint(plist)\nprint(len(plist))\nfor i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+\n \", left key =\"+str(plist[1][0])+\n \", right key =\"+str(plist[1][1])+\",\")\n else :\n l = int(j/2)\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\", parent key =\"+\n str(plist[i-1][l])+\", left key =\"+str(plist[i+1][2*j])+\n \", right key =\"+str(plist[i+1][2*j+1]))\n except:\n l = int(j/2)\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n \", parent key =\"+str(plist[i-1][l]))\n k += 1\n", "code2": "n = int(input())\nklist = list(map(int,input().split()))\nplist = []\ni = 0\nk = 1\na = 2**i-1\nwhile 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\nfor i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n \", left key = \"+str(plist[1][0])+\n \", right key = \"+str(plist[1][1])+\", \")\n else :\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n print(\", right key = \"+str(plist[i+1][2*j+1])+\", \")\n except:\n print(\", \")\n except:\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", \")\n k += 1\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1532013620", "date2": "1532014283", "bleu_score": "0.8624621452060871", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 0 -3 4 0\n", "actual_output": "[[1], [0, -3], [4, 0]]\n3\nnode1: key =1, left key =0, right key =-3,\nnode2: key =0, parent key =1, left key =4, right key =0\nnode3: key =-3, parent key =1\nnode4: key =4, parent key =0\nnode5: key =0, parent key =0\n", "expected_output": "node 1: key = 1, left key = 0, right key = -3, \nnode 2: key = 0, parent key = 1, left key = 4, right key = 0, \nnode 3: key = -3, parent key = 1, \nnode 4: key = 4, parent key = 0, \nnode 5: key = 0, parent key = 0, \n\n", "anno_code": ["n = int(input()) # (0): n=5\nklist = list(map(int,input().split())) # (1): klist=[1, 0, -3, 4, 0]\nplist = [] # (2): plist=[]\ni = 0 # (3): i=0\nk = 1 # (4): k=1\na = 2**i-1 # (5): a=0\nwhile 1: # (6): NO CHANGE (11): NO CHANGE ... (21): plist\n if klist[a:a+2**i] != []: # (7): NO CHANGE (12): NO CHANGE ... (22): plist\n plist.append(klist[a:a + 2**i]) # (8): plist=[[1]] (13): plist (18): plist\n else: break # (23): plist\n a += 2**i # (9): a=1 (14): plist=[[1], [0, -3]], a=3 (19): plist, a=7\n i += 1 # (10): i=1 (15): plist=[[1], [0, -3]], i=2 (20): plist, i=3\nprint(plist) # (24): plist\nprint(len(plist)) # (25): plist\nfor i in range(len(plist)): # (26): plist, i=0 (43): plist, i=1 (79): plist, i=2\n for j in range(len(plist[i])): # (27): plist, j=0 (42): plist ... (116): plist\n try: # (28): plist (45): plist ... (99): plist\n if i==0: # (29): plist (46): plist ... (100): plist\n print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+ # (30): plist (32): plist ... (40): plist\n \", left key =\"+str(plist[1][0])+ # (31): plist (33): plist\n \", right key =\"+str(plist[1][1])+\",\") # (35): plist (37): plist (39): plist\n else :\n l = int(j/2) # (47): plist, l=0 (63): plist ... (101): plist\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\", parent key =\"+ # (48): plist (50): plist ... (106): plist\n str(plist[i-1][l])+\", left key =\"+str(plist[i+1][2*j])+ # (49): plist (51): plist ... (107): plist\n \", right key =\"+str(plist[i+1][2*j+1])) # (55): plist (57): plist\n except: # (70): plist (90): plist (108): plist\n l = int(j/2) # (71): plist (91): plist (109): plist\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+ # (72): plist (74): plist ... (114): plist\n \", parent key =\"+str(plist[i-1][l])) # (73): plist (75): plist ... (113): plist\n k += 1 # (41): plist, k=2 (59): plist, k=3 ... (115): plist, k=6\n"], "anno_status": [false], "diff_content": " n = int(input())\n klist = list(map(int,input().split()))\n plist = []\n i = 0\n k = 1\n a = 2**i-1\n while 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\n-print(plist)\n-print(len(plist))\n for i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n- print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+\n- \", left key =\"+str(plist[1][0])+\n- \", right key =\"+str(plist[1][1])+\",\")\n+ print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n+ \", left key = \"+str(plist[1][0])+\n+ \", right key = \"+str(plist[1][1])+\", \")\n else :\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\", parent key =\"+\n- str(plist[i-1][l])+\", left key =\"+str(plist[i+1][2*j])+\n- \", right key =\"+str(plist[i+1][2*j+1]))\n+ print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n+ \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n+ str(plist[i+1][2*j]),end=\"\")\n+ try:\n+ print(\", right key = \"+str(plist[i+1][2*j+1])+\", \")\n+ except:\n+ print(\", \")\n except:\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n- \", parent key =\"+str(plist[i-1][l]))\n+ print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n+ \", parent key = \"+str(plist[i-1][l])+\", \")\n k += 1\n \n", "FL_content": " n = int(input())\n klist = list(map(int,input().split()))\n plist = []\n i = 0\n k = 1\n a = 2**i-1\n while 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\n-print(plist)\n-print(len(plist))\n for i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n- print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+\n- \", left key =\"+str(plist[1][0])+\n- \", right key =\"+str(plist[1][1])+\",\")\n else :\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\", parent key =\"+\n- str(plist[i-1][l])+\", left key =\"+str(plist[i+1][2*j])+\n- \", right key =\"+str(plist[i+1][2*j+1]))\n except:\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n- \", parent key =\"+str(plist[i-1][l]))\n k += 1\n \n", "added_lines": 12, "removed_lines": 10, "code1_lines": 32 }, { "user_id": "u269568674", "problem_id": "p02287", "submission1_id": "s370282604", "submission2_id": "s481560287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nklist = list(map(int,input().split()))\nplist = []\ni = 0\nk = 1\na = 2**i-1\nwhile 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\nprint(plist)\nprint(len(plist))\nfor i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+\n \", left key =\"+str(plist[1][0])+\n \", right key =\"+str(plist[1][1])+\",\")\n else :\n l = int(j/2)\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n \", parent key =\"+str(plist[i-1][l])+\", left key =\"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n print(\", right key =\"+str(plist[i+1][2*j+1])+\",\")\n except:\n print(\",\")\n except:\n l = int(j/2)\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n \", parent key =\"+str(plist[i-1][l])+\",\")\n k += 1\n\n", "code2": "n = int(input())\nklist = list(map(int,input().split()))\nplist = []\ni = 0\nk = 1\na = 2**i-1\nwhile 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\nfor i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n \", left key = \"+str(plist[1][0])+\n \", right key = \"+str(plist[1][1])+\", \")\n else :\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n print(\", right key = \"+str(plist[i+1][2*j+1])+\", \")\n except:\n print(\", \")\n except:\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", \")\n k += 1\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1532013880", "date2": "1532014283", "bleu_score": "0.9469192212090305", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-4 5 4 7 -1\n", "actual_output": "[[-4], [5, 4], [7, -1]]\n3\nnode1: key =-4, left key =5, right key =4,\nnode2: key =5, parent key =-4, left key =7, right key =-1,\nnode3: key =4, parent key =-4,\nnode4: key =7, parent key =5,\nnode5: key =-1, parent key =5,\n", "expected_output": "node 1: key = -4, left key = 5, right key = 4, \nnode 2: key = 5, parent key = -4, left key = 7, right key = -1, \nnode 3: key = 4, parent key = -4, \nnode 4: key = 7, parent key = 5, \nnode 5: key = -1, parent key = 5, \n\n", "anno_code": ["n = int(input()) # (0): n=5\nklist = list(map(int,input().split())) # (1): klist=[-4, 5, 4, 7, -1]\nplist = [] # (2): plist=[]\ni = 0 # (3): i=0\nk = 1 # (4): k=1\na = 2**i-1 # (5): a=0\nwhile 1: # (6): NO CHANGE (11): NO CHANGE ... (21): plist\n if klist[a:a+2**i] != []: # (7): NO CHANGE (12): NO CHANGE ... (22): plist\n plist.append(klist[a:a + 2**i]) # (8): plist=[[-4]] (13): plist (18): plist\n else: break # (23): plist\n a += 2**i # (9): a=1 (14): plist=[[-4], [5, 4]], a=3 (19): plist, a=7\n i += 1 # (10): i=1 (15): plist=[[-4], [5, 4]], i=2 (20): plist, i=3\nprint(plist) # (24): plist\nprint(len(plist)) # (25): plist\nfor i in range(len(plist)): # (26): plist, i=0 (43): plist, i=1 (85): plist, i=2\n for j in range(len(plist[i])): # (27): plist, j=0 (42): plist ... (130): plist\n try: # (28): plist (45): plist ... (109): plist\n if i==0: # (29): plist (46): plist ... (110): plist\n print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+ # (30): plist (32): plist ... (40): plist\n \", left key =\"+str(plist[1][0])+ # (31): plist (33): plist\n \", right key =\"+str(plist[1][1])+\",\") # (35): plist (37): plist (39): plist\n else :\n l = int(j/2) # (47): plist, l=0 (65): plist ... (111): plist\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+ # (48): plist (50): plist ... (118): plist\n \", parent key =\"+str(plist[i-1][l])+\", left key =\"+ # (49): plist (51): plist ... (117): plist\n str(plist[i+1][2*j]),end=\"\") # (55): plist (57): plist ... (119): plist\n try: # (59): plist\n print(\", right key =\"+str(plist[i+1][2*j+1])+\",\") # (60): plist\n except:\n print(\",\")\n except: # (74): plist (98): plist (120): plist\n l = int(j/2) # (75): plist (99): plist (121): plist\n print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+ # (76): plist (78): plist ... (128): plist\n \", parent key =\"+str(plist[i-1][l])+\",\") # (77): plist (79): plist ... (127): plist\n k += 1 # (41): plist, k=2 (61): plist, k=3 ... (129): plist, k=6\n\n"], "anno_status": [false], "diff_content": " n = int(input())\n klist = list(map(int,input().split()))\n plist = []\n i = 0\n k = 1\n a = 2**i-1\n while 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\n-print(plist)\n-print(len(plist))\n for i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n- print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+\n- \", left key =\"+str(plist[1][0])+\n- \", right key =\"+str(plist[1][1])+\",\")\n+ print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n+ \", left key = \"+str(plist[1][0])+\n+ \", right key = \"+str(plist[1][1])+\", \")\n else :\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n- \", parent key =\"+str(plist[i-1][l])+\", left key =\"+\n+ print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n+ \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n- print(\", right key =\"+str(plist[i+1][2*j+1])+\",\")\n+ print(\", right key = \"+str(plist[i+1][2*j+1])+\", \")\n except:\n- print(\",\")\n+ print(\", \")\n except:\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n- \", parent key =\"+str(plist[i-1][l])+\",\")\n+ print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n+ \", parent key = \"+str(plist[i-1][l])+\", \")\n k += 1\n \n-\n", "FL_content": " n = int(input())\n klist = list(map(int,input().split()))\n plist = []\n i = 0\n k = 1\n a = 2**i-1\n while 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\n-print(plist)\n-print(len(plist))\n for i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n- print(\"node\"+str(k)+\": key =\"+str(plist[0][0])+\n- \", left key =\"+str(plist[1][0])+\n- \", right key =\"+str(plist[1][1])+\",\")\n else :\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n- \", parent key =\"+str(plist[i-1][l])+\", left key =\"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n- print(\", right key =\"+str(plist[i+1][2*j+1])+\",\")\n except:\n- print(\",\")\n except:\n l = int(j/2)\n- print(\"node\"+str(k)+\": key =\"+str(plist[i][j])+\n- \", parent key =\"+str(plist[i-1][l])+\",\")\n k += 1\n \n-\n", "added_lines": 9, "removed_lines": 12, "code1_lines": 37 }, { "user_id": "u855199458", "problem_id": "p02287", "submission1_id": "s848925146", "submission2_id": "s736016528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nfrom math import floor\nsys.setrecursionlimit(100000)\n\nN = int(input())\nheap = [None] + [int(n) for n in input().split()]\n\nfor i, h in enumerate(heap[1:]):\n i += 1\n text = \"node {}: key = {}\".format(i, h)\n if i != 1:\n text += \", parent key = {}\".format(heap[floor(i/2)])\n if 2 * i <= N:\n text += \", left key = {}\".format(heap[2*i])\n if 2 * i + 1 <= N:\n text += \", right key = {}\".format(heap[2*i + 1])\n print(text)", "code2": "\nimport sys\nfrom math import floor\nsys.setrecursionlimit(100000)\n\nN = int(input())\nheap = [None] + [int(n) for n in input().split()]\n\nfor i, h in enumerate(heap[1:]):\n i += 1\n text = \"node {}: key = {}, \".format(i, h)\n if i != 1:\n text += \"parent key = {}, \".format(heap[floor(i/2)])\n if 2 * i <= N:\n text += \"left key = {}, \".format(heap[2*i])\n if 2 * i + 1 <= N:\n text += \"right key = {}, \".format(heap[2*i + 1])\n print(text)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502767063", "date2": "1502767210", "bleu_score": "0.9647117875204987", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 0 -3 4 -2\n", "actual_output": "node 1: key = 1, left key = 0, right key = -3\nnode 2: key = 0, parent key = 1, left key = 4, right key = -2\nnode 3: key = -3, parent key = 1\nnode 4: key = 4, parent key = 0\nnode 5: key = -2, parent key = 0\n", "expected_output": "node 1: key = 1, left key = 0, right key = -3, \nnode 2: key = 0, parent key = 1, left key = 4, right key = -2, \nnode 3: key = -3, parent key = 1, \nnode 4: key = 4, parent key = 0, \nnode 5: key = -2, parent key = 0, \n\n", "anno_code": ["\nimport sys\nfrom math import floor\nsys.setrecursionlimit(100000) # (0): NO CHANGE\n\nN = int(input()) # (1): N=5\nheap = [None] + [int(n) for n in input().split()] # (2): heap=[None, 1, 0, -3, 4, -2]\n\nfor i, h in enumerate(heap[1:]): # (3): i=0, h=1 (12): h=0 ... (38): h=-2\n i += 1 # (4): i=1 (13): i=2 ... (39): i=5\n text = \"node {}: key = {}\".format(i, h) # (5): text=node 1: key = 1 (14): text=node 2: key = 0 ... (40): text=node 5: key = -2\n if i != 1: # (6): NO CHANGE (15): NO CHANGE ... (41): NO CHANGE\n text += \", parent key = {}\".format(heap[floor(i/2)]) # (16): text=node 2: key = 0, parent key = 1 (26): text=node 3: key = -3, parent key = 1 ... (42): text=node 5: key = -2, parent key = 0\n if 2 * i <= N: # (7): NO CHANGE (17): NO CHANGE ... (43): NO CHANGE\n text += \", left key = {}\".format(heap[2*i]) # (8): text=node 1: key = 1, left key = 0 (18): text=node 2: key = 0, parent key = 1, left key = 4\n if 2 * i + 1 <= N: # (9): NO CHANGE (19): NO CHANGE ... (44): NO CHANGE\n text += \", right key = {}\".format(heap[2*i + 1]) # (10): text=node 1: key = 1, left key = 0, right key = -3 (20): text=node 2: key = 0, parent key = 1, left key = 4, right key = -2\n print(text) # (11): NO CHANGE (21): NO CHANGE ... (45): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n import sys\n from math import floor\n sys.setrecursionlimit(100000)\n \n N = int(input())\n heap = [None] + [int(n) for n in input().split()]\n \n for i, h in enumerate(heap[1:]):\n i += 1\n- text = \"node {}: key = {}\".format(i, h)\n+ text = \"node {}: key = {}, \".format(i, h)\n if i != 1:\n- text += \", parent key = {}\".format(heap[floor(i/2)])\n+ text += \"parent key = {}, \".format(heap[floor(i/2)])\n if 2 * i <= N:\n- text += \", left key = {}\".format(heap[2*i])\n+ text += \"left key = {}, \".format(heap[2*i])\n if 2 * i + 1 <= N:\n- text += \", right key = {}\".format(heap[2*i + 1])\n+ text += \"right key = {}, \".format(heap[2*i + 1])\n print(text)\n", "FL_content": " \n import sys\n from math import floor\n sys.setrecursionlimit(100000)\n \n N = int(input())\n heap = [None] + [int(n) for n in input().split()]\n \n for i, h in enumerate(heap[1:]):\n i += 1\n- text = \"node {}: key = {}\".format(i, h)\n if i != 1:\n- text += \", parent key = {}\".format(heap[floor(i/2)])\n if 2 * i <= N:\n- text += \", left key = {}\".format(heap[2*i])\n if 2 * i + 1 <= N:\n- text += \", right key = {}\".format(heap[2*i + 1])\n print(text)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 18 }, { "user_id": "u269568674", "problem_id": "p02287", "submission1_id": "s083640727", "submission2_id": "s481560287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nklist = list(map(int,input().split()))\nplist = []\ni = 0\nk = 1\na = 2**i-1\nwhile 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\nprint(plist)\nprint(len(plist))\nfor i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n \", left key = \"+str(plist[1][0])+\n \", right key = \"+str(plist[1][1])+\",\")\n else :\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n print(\", right key = \"+str(plist[i+1][2*j+1])+\",\")\n except:\n print(\",\")\n except:\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\",\")\n k += 1\n", "code2": "n = int(input())\nklist = list(map(int,input().split()))\nplist = []\ni = 0\nk = 1\na = 2**i-1\nwhile 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\nfor i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n \", left key = \"+str(plist[1][0])+\n \", right key = \"+str(plist[1][1])+\", \")\n else :\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n print(\", right key = \"+str(plist[i+1][2*j+1])+\", \")\n except:\n print(\", \")\n except:\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", \")\n k += 1\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1532014012", "date2": "1532014283", "bleu_score": "0.9649321575207024", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n2 23 0 0 1\n", "actual_output": "[[2], [23, 0], [0, 1]]\n3\nnode 1: key = 2, left key = 23, right key = 0,\nnode 2: key = 23, parent key = 2, left key = 0, right key = 1,\nnode 3: key = 0, parent key = 2,\nnode 4: key = 0, parent key = 23,\nnode 5: key = 1, parent key = 23,\n", "expected_output": "node 1: key = 2, left key = 23, right key = 0, \nnode 2: key = 23, parent key = 2, left key = 0, right key = 1, \nnode 3: key = 0, parent key = 2, \nnode 4: key = 0, parent key = 23, \nnode 5: key = 1, parent key = 23, \n\n", "anno_code": ["n = int(input()) # (0): n=5\nklist = list(map(int,input().split())) # (1): klist=[2, 23, 0, 0, 1]\nplist = [] # (2): plist=[]\ni = 0 # (3): i=0\nk = 1 # (4): k=1\na = 2**i-1 # (5): a=0\nwhile 1: # (6): NO CHANGE (11): NO CHANGE ... (21): plist\n if klist[a:a+2**i] != []: # (7): NO CHANGE (12): NO CHANGE ... (22): plist\n plist.append(klist[a:a + 2**i]) # (8): plist=[[2]] (13): plist (18): plist\n else: break # (23): plist\n a += 2**i # (9): a=1 (14): plist=[[2], [23, 0]], a=3 (19): plist, a=7\n i += 1 # (10): i=1 (15): plist=[[2], [23, 0]], i=2 (20): plist, i=3\nprint(plist) # (24): plist\nprint(len(plist)) # (25): plist\nfor i in range(len(plist)): # (26): plist, i=0 (43): plist, i=1 (85): plist, i=2\n for j in range(len(plist[i])): # (27): plist, j=0 (42): plist ... (130): plist\n try: # (28): plist (45): plist ... (109): plist\n if i==0: # (29): plist (46): plist ... (110): plist\n print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+ # (30): plist (32): plist ... (40): plist\n \", left key = \"+str(plist[1][0])+ # (31): plist (33): plist\n \", right key = \"+str(plist[1][1])+\",\") # (35): plist (37): plist (39): plist\n else :\n l = int(j/2) # (47): plist, l=0 (65): plist ... (111): plist\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+ # (48): plist (50): plist ... (118): plist\n \", parent key = \"+str(plist[i-1][l])+\", left key = \"+ # (49): plist (51): plist ... (117): plist\n str(plist[i+1][2*j]),end=\"\") # (55): plist (57): plist ... (119): plist\n try: # (59): plist\n print(\", right key = \"+str(plist[i+1][2*j+1])+\",\") # (60): plist\n except:\n print(\",\")\n except: # (74): plist (98): plist (120): plist\n l = int(j/2) # (75): plist (99): plist (121): plist\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+ # (76): plist (78): plist ... (128): plist\n \", parent key = \"+str(plist[i-1][l])+\",\") # (77): plist (79): plist ... (127): plist\n k += 1 # (41): plist, k=2 (61): plist, k=3 ... (129): plist, k=6\n"], "anno_status": [false], "diff_content": " n = int(input())\n klist = list(map(int,input().split()))\n plist = []\n i = 0\n k = 1\n a = 2**i-1\n while 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\n-print(plist)\n-print(len(plist))\n for i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n \", left key = \"+str(plist[1][0])+\n- \", right key = \"+str(plist[1][1])+\",\")\n+ \", right key = \"+str(plist[1][1])+\", \")\n else :\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n- print(\", right key = \"+str(plist[i+1][2*j+1])+\",\")\n+ print(\", right key = \"+str(plist[i+1][2*j+1])+\", \")\n except:\n- print(\",\")\n+ print(\", \")\n except:\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n- \", parent key = \"+str(plist[i-1][l])+\",\")\n+ \", parent key = \"+str(plist[i-1][l])+\", \")\n k += 1\n \n", "FL_content": " n = int(input())\n klist = list(map(int,input().split()))\n plist = []\n i = 0\n k = 1\n a = 2**i-1\n while 1:\n if klist[a:a+2**i] != []:\n plist.append(klist[a:a + 2**i])\n else: break\n a += 2**i\n i += 1\n-print(plist)\n-print(len(plist))\n for i in range(len(plist)):\n for j in range(len(plist[i])):\n try:\n if i==0:\n print(\"node \"+str(k)+\": key = \"+str(plist[0][0])+\n \", left key = \"+str(plist[1][0])+\n- \", right key = \"+str(plist[1][1])+\",\")\n else :\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n \", parent key = \"+str(plist[i-1][l])+\", left key = \"+\n str(plist[i+1][2*j]),end=\"\")\n try:\n- print(\", right key = \"+str(plist[i+1][2*j+1])+\",\")\n except:\n- print(\",\")\n except:\n l = int(j/2)\n print(\"node \"+str(k)+\": key = \"+str(plist[i][j])+\n- \", parent key = \"+str(plist[i-1][l])+\",\")\n k += 1\n \n", "added_lines": 4, "removed_lines": 6, "code1_lines": 36 }, { "user_id": "u742013327", "problem_id": "p02287", "submission1_id": "s645705480", "submission2_id": "s364472522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n leaf = \"\"\n if left_index < len(target_list) and right_index < len(target_list):\n leaf = \" left key = {}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n\n print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n\n \ndef main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()", "code2": "\n\ndef decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \",\"\n \n left_index = node_index * 2 - 1\n left = \"\"\n if left_index < len(target_list):\n left = \" left key = {},\".format(target_list[left_index])\n \n right_index = node_index * 2\n right = \"\"\n if right_index < len(target_list):\n right = \" right key = {},\".format(target_list[right_index])\n\n print(\"node {}: key = {},{}{}{} \".format(node_index, key, parent, left, right))\n\n \ndef main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1481618642", "date2": "1481619016", "bleu_score": "0.8859794828077927", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-8 1 -1 3 -5\n", "actual_output": "node 1: key = -8, left key = 1, right key = -1, \nnode 2: key = 1, parent key = -8, left key = 3, right key = -5, \nnode 3: key = -1, parent key = -8, \nnode 4: key = 3, parent key = 1, \nnode 5: key = -5, parent key = 1, \n", "expected_output": "node 1: key = -8, left key = 1, right key = -1, \nnode 2: key = 1, parent key = -8, left key = 3, right key = -5, \nnode 3: key = -1, parent key = -8, \nnode 4: key = 3, parent key = 1, \nnode 5: key = -5, parent key = 1, \n\n", "anno_code": ["\n\ndef decode_heap(target_list): # (0): decode_heap=\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n leaf = \"\"\n if left_index < len(target_list) and right_index < len(target_list):\n leaf = \" left key = {}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n\n print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n\n \ndef main(): # (1): main=\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " \n \n def decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n- parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n+ parent = \" parent key = \" + str(target_list[parent_index]) + \",\"\n \n left_index = node_index * 2 - 1\n+ left = \"\"\n+ if left_index < len(target_list):\n+ left = \" left key = {},\".format(target_list[left_index])\n+ \n right_index = node_index * 2\n- leaf = \"\"\n- if left_index < len(target_list) and right_index < len(target_list):\n- leaf = \" left key = {}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n+ right = \"\"\n+ if right_index < len(target_list):\n+ right = \" right key = {},\".format(target_list[right_index])\n \n- print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n+ print(\"node {}: key = {},{}{}{} \".format(node_index, key, parent, left, right))\n \n \n def main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " \n \n def decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n- parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n- leaf = \"\"\n- if left_index < len(target_list) and right_index < len(target_list):\n- leaf = \" left key = {}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n \n- print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n \n \n def main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 26 }, { "user_id": "u126478680", "problem_id": "p02287", "submission1_id": "s800126504", "submission2_id": "s178989528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nH = list(map(int, input().split(' ')))\n\nfor i in range(n):\n node = i+1\n key = H[i]\n parent = H[int(node/2)] if node != 1 else None\n left = H[node*2-1] if node*2 <= n else None\n right = H[node*2] if node*2+1 <= n else None\n print('node %d: key = %d,'%(node, key), end='')\n if parent != None: print(' parent key = %d,'%parent, end='')\n if left != None: print(' left key = %d,'%left, end='')\n if right != None: print(' right key = %d,'%right, end='')\n print('')\n", "code2": "n = int(input())\nH = list(map(int, input().split(' ')))\n\nfor i in range(n):\n node = i+1\n key = H[i]\n parent = H[int(node/2)-1] if node != 1 else None\n left = H[node*2-1] if node*2 <= n else None\n right = H[node*2] if node*2+1 <= n else None\n print('node %d: key = %d, '%(node, key), end='')\n if parent != None: print('parent key = %d, '%parent, end='')\n if left != None: print('left key = %d, '%left, end='')\n if right != None: print('right key = %d, '%right, end='')\n print('')\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525780349", "date2": "1525780485", "bleu_score": "0.9657651875955758", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n4 23 0 0 1\n", "actual_output": "node 1: key = 4, left key = 23, right key = 0,\nnode 2: key = 23, parent key = 23, left key = 0, right key = 1,\nnode 3: key = 0, parent key = 23,\nnode 4: key = 0, parent key = 0,\nnode 5: key = 1, parent key = 0,\n", "expected_output": "node 1: key = 4, left key = 23, right key = 0, \nnode 2: key = 23, parent key = 4, left key = 0, right key = 1, \nnode 3: key = 0, parent key = 4, \nnode 4: key = 0, parent key = 23, \nnode 5: key = 1, parent key = 23, \n\n", "anno_code": ["n = int(input()) # (0): n=5\nH = list(map(int, input().split(' '))) # (1): H=[4, 23, 0, 0, 1]\n\nfor i in range(n): # (2): i=0 (13): i=1 ... (46): i=4\n node = i+1 # (3): node=1 (14): node=2 ... (47): node=5\n key = H[i] # (4): key=4 (15): key=23 ... (48): key=1\n parent = H[int(node/2)] if node != 1 else None # (5): parent=None (16): parent=23 ... (49): NO CHANGE\n left = H[node*2-1] if node*2 <= n else None # (6): left=23 (17): left=0 ... (50): NO CHANGE\n right = H[node*2] if node*2+1 <= n else None # (7): right=0 (18): right=1 ... (51): NO CHANGE\n print('node %d: key = %d,'%(node, key), end='') # (8): NO CHANGE (19): NO CHANGE ... (52): NO CHANGE\n if parent != None: print(' parent key = %d,'%parent, end='') # (9): NO CHANGE (20): NO CHANGE ... (53): NO CHANGE\n if left != None: print(' left key = %d,'%left, end='') # (10): NO CHANGE (21): NO CHANGE ... (54): NO CHANGE\n if right != None: print(' right key = %d,'%right, end='') # (11): NO CHANGE (22): NO CHANGE ... (55): NO CHANGE\n print('') # (12): NO CHANGE (23): NO CHANGE ... (56): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n H = list(map(int, input().split(' ')))\n \n for i in range(n):\n node = i+1\n key = H[i]\n- parent = H[int(node/2)] if node != 1 else None\n+ parent = H[int(node/2)-1] if node != 1 else None\n left = H[node*2-1] if node*2 <= n else None\n right = H[node*2] if node*2+1 <= n else None\n- print('node %d: key = %d,'%(node, key), end='')\n- if parent != None: print(' parent key = %d,'%parent, end='')\n- if left != None: print(' left key = %d,'%left, end='')\n- if right != None: print(' right key = %d,'%right, end='')\n+ print('node %d: key = %d, '%(node, key), end='')\n+ if parent != None: print('parent key = %d, '%parent, end='')\n+ if left != None: print('left key = %d, '%left, end='')\n+ if right != None: print('right key = %d, '%right, end='')\n print('')\n \n", "FL_content": " n = int(input())\n H = list(map(int, input().split(' ')))\n \n for i in range(n):\n node = i+1\n key = H[i]\n- parent = H[int(node/2)] if node != 1 else None\n left = H[node*2-1] if node*2 <= n else None\n right = H[node*2] if node*2+1 <= n else None\n- print('node %d: key = %d,'%(node, key), end='')\n- if parent != None: print(' parent key = %d,'%parent, end='')\n- if left != None: print(' left key = %d,'%left, end='')\n- if right != None: print(' right key = %d,'%right, end='')\n print('')\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 15 }, { "user_id": "u742013327", "problem_id": "p02287", "submission1_id": "s567335714", "submission2_id": "s364472522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \" \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n leaf = \"\"\n if left_index < len(target_list) and right_index < len(target_list):\n leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n\n print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n\n \ndef main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()", "code2": "\n\ndef decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \",\"\n \n left_index = node_index * 2 - 1\n left = \"\"\n if left_index < len(target_list):\n left = \" left key = {},\".format(target_list[left_index])\n \n right_index = node_index * 2\n right = \"\"\n if right_index < len(target_list):\n right = \" right key = {},\".format(target_list[right_index])\n\n print(\"node {}: key = {},{}{}{} \".format(node_index, key, parent, left, right))\n\n \ndef main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1481618563", "date2": "1481619016", "bleu_score": "0.8826392047839053", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n7 8 1 2 3\n", "actual_output": "node 1: key = 7, left key =8, right key = 1, \nnode 2: key = 8, parent key = 7 left key =2, right key = 3, \nnode 3: key = 1, parent key = 7 \nnode 4: key = 2, parent key = 8 \nnode 5: key = 3, parent key = 8 \n", "expected_output": "node 1: key = 7, left key = 8, right key = 1,\nnode 2: key = 8, parent key = 7, left key = 2, right key = 3,\nnode 3: key = 1, parent key = 7,\nnode 4: key = 2, parent key = 8,\nnode 5: key = 3, parent key = 8,\n", "anno_code": ["\n\ndef decode_heap(target_list): # (0): decode_heap=\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \" \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n leaf = \"\"\n if left_index < len(target_list) and right_index < len(target_list):\n leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n\n print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n\n \ndef main(): # (1): main=\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " \n \n def decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n- parent = \" parent key = \" + str(target_list[parent_index]) + \" \"\n+ parent = \" parent key = \" + str(target_list[parent_index]) + \",\"\n \n left_index = node_index * 2 - 1\n+ left = \"\"\n+ if left_index < len(target_list):\n+ left = \" left key = {},\".format(target_list[left_index])\n+ \n right_index = node_index * 2\n- leaf = \"\"\n- if left_index < len(target_list) and right_index < len(target_list):\n- leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n+ right = \"\"\n+ if right_index < len(target_list):\n+ right = \" right key = {},\".format(target_list[right_index])\n \n- print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n+ print(\"node {}: key = {},{}{}{} \".format(node_index, key, parent, left, right))\n \n \n def main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " \n \n def decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n- parent = \" parent key = \" + str(target_list[parent_index]) + \" \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n- leaf = \"\"\n- if left_index < len(target_list) and right_index < len(target_list):\n- leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n \n- print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n \n \n def main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 26 }, { "user_id": "u742013327", "problem_id": "p02287", "submission1_id": "s819338587", "submission2_id": "s364472522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n leaf = \"\"\n if left_index < len(target_list) and right_index < len(target_list):\n leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n\n print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n\n \ndef main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()", "code2": "\n\ndef decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \",\"\n \n left_index = node_index * 2 - 1\n left = \"\"\n if left_index < len(target_list):\n left = \" left key = {},\".format(target_list[left_index])\n \n right_index = node_index * 2\n right = \"\"\n if right_index < len(target_list):\n right = \" right key = {},\".format(target_list[right_index])\n\n print(\"node {}: key = {},{}{}{} \".format(node_index, key, parent, left, right))\n\n \ndef main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1481618607", "date2": "1481619016", "bleu_score": "0.8831917533339377", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n4 8 1 1 3\n", "actual_output": "node 1: key = 4, left key =8, right key = 1, \nnode 2: key = 8, parent key = 4, left key =1, right key = 3, \nnode 3: key = 1, parent key = 4, \nnode 4: key = 1, parent key = 8, \nnode 5: key = 3, parent key = 8, \n", "expected_output": "node 1: key = 4, left key = 8, right key = 1, \nnode 2: key = 8, parent key = 4, left key = 1, right key = 3, \nnode 3: key = 1, parent key = 4, \nnode 4: key = 1, parent key = 8, \nnode 5: key = 3, parent key = 8, \n\n", "anno_code": ["\n\ndef decode_heap(target_list): # (0): decode_heap=\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n leaf = \"\"\n if left_index < len(target_list) and right_index < len(target_list):\n leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n\n print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n\n \ndef main(): # (1): main=\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " \n \n def decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n- parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n+ parent = \" parent key = \" + str(target_list[parent_index]) + \",\"\n \n left_index = node_index * 2 - 1\n+ left = \"\"\n+ if left_index < len(target_list):\n+ left = \" left key = {},\".format(target_list[left_index])\n+ \n right_index = node_index * 2\n- leaf = \"\"\n- if left_index < len(target_list) and right_index < len(target_list):\n- leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n+ right = \"\"\n+ if right_index < len(target_list):\n+ right = \" right key = {},\".format(target_list[right_index])\n \n- print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n+ print(\"node {}: key = {},{}{}{} \".format(node_index, key, parent, left, right))\n \n \n def main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " \n \n def decode_heap(target_list):\n for i, key in enumerate(target_list):\n node_index = i + 1\n parent_index = int(node_index / 2) - 1\n parent = \"\"\n if not parent_index < 0:\n- parent = \" parent key = \" + str(target_list[parent_index]) + \", \"\n \n left_index = node_index * 2 - 1\n right_index = node_index * 2\n- leaf = \"\"\n- if left_index < len(target_list) and right_index < len(target_list):\n- leaf = \" left key ={}, right key = {}, \".format(target_list[left_index], target_list[right_index])\n \n- print(\"node {}: key = {},{}{}\".format(node_index, key, parent, leaf))\n \n \n def main():\n n_nodes = int(input())\n target_list = [int(a) for a in input().split()]\n decode_heap(target_list)\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 26 }, { "user_id": "u703890795", "problem_id": "p03087", "submission1_id": "s085060749", "submission2_id": "s505855337", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, Q = map(int, input().split())\nS = input()\nAClst = [] \n\nfor i in range(N-1):\n if S[i:i+2]==\"AC\":\n AClst.append(1)\n else:\n AClst.append(0)\nAClst.append(0)\n\nfor q in range(Q):\n l, r = map(int, input().split())\n print(AClst[l:r].count(1))", "code2": "N, Q = map(int, input().split())\nS = input()\nAClst = [0]\nc = 0\n\nfor i in range(N-1):\n if S[i:i+2]==\"AC\":\n c += 1\n AClst.append(c)\n\nfor q in range(Q):\n l, r = map(int, input().split())\n print(AClst[r-1]-AClst[l-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565269373", "date2": "1565270781", "bleu_score": "0.7708779590708046", "code1_test_status": [0, 1, 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, 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, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0], "code1_test_score": 11, "total_score": 101, "input": "8 3\nACACTACG\n2 7\n2 3\n2 8\n", "actual_output": "2\n1\n2\n", "expected_output": "2\n0\n2\n\n", "anno_code": ["N, Q = map(int, input().split()) # (0): N=8, Q=3\nS = input() # (1): S=ACACTACG\nAClst = [] # (2): AClst=[]\n\nfor i in range(N-1): # (3): i=0 (6): i=1 ... (24): NO CHANGE\n if S[i:i+2]==\"AC\": # (4): NO CHANGE (7): NO CHANGE ... (22): NO CHANGE\n AClst.append(1) # (5): AClst=[1] (11): AClst=[1, 0, 1] (20): AClst=[1, 0, 1, 0, 0, 1]\n else:\n AClst.append(0) # (8): AClst=[1, 0] (14): AClst=[1, 0, 1, 0] ... (23): AClst=[1, 0, 1, 0, 0, 1, 0]\nAClst.append(0) # (25): AClst=[1, 0, 1, 0, 0, 1, 0, 0]\n\nfor q in range(Q): # (26): q=0 (29): q=1 (32): q=2\n l, r = map(int, input().split()) # (27): l=2, r=7 (30): r=3 (33): r=8\n print(AClst[l:r].count(1)) # (28): NO CHANGE (31): NO CHANGE (34): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, Q = map(int, input().split())\n S = input()\n-AClst = [] \n+AClst = [0]\n+c = 0\n \n for i in range(N-1):\n if S[i:i+2]==\"AC\":\n- AClst.append(1)\n- else:\n- AClst.append(0)\n-AClst.append(0)\n+ c += 1\n+ AClst.append(c)\n \n for q in range(Q):\n l, r = map(int, input().split())\n- print(AClst[l:r].count(1))\n+ print(AClst[r-1]-AClst[l-1])\n", "FL_content": " N, Q = map(int, input().split())\n S = input()\n-AClst = [] \n \n for i in range(N-1):\n if S[i:i+2]==\"AC\":\n- AClst.append(1)\n- else:\n- AClst.append(0)\n-AClst.append(0)\n \n for q in range(Q):\n l, r = map(int, input().split())\n- print(AClst[l:r].count(1))\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 14 }, { "user_id": "u686036872", "problem_id": "p03087", "submission1_id": "s285275553", "submission2_id": "s385429136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, Q = map(int, input().split())\nS=list(input())\nlist=[]\nfor i in range(0, N-1):\n if S[i] == \"A\" and S[i+1] == \"C\":\n list.append(i)\ncount=0\nfor i in range(Q):\n l, r = map(int, input().split())\n for j in list:\n if l-1 <= j < r-1:\n count+=1\n else:\n count+=0\n print(count)", "code2": "N, Q = map(int, input().split())\nS = input()\n\nans = [0]*N\nfor i in range(N-1):\n if S[i] == \"A\" and S[i+1] == \"C\":\n ans[i+1] += (ans[i]+1)\n else:\n ans[i+1] = ans[i] \n\nfor i in range(Q):\n l, r = map(int, input().split())\n print(ans[r-1] - ans[l-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580276109", "date2": "1586838435", "bleu_score": "0.6091846794276035", "code1_test_status": [0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 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, 0, 0, 0, 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, 1, 1, 0, 0, 0], "code1_test_score": 14, "total_score": 101, "input": "8 3\nACACTACG\n3 7\n8 1\n1 6\n", "actual_output": "2\n2\n4\n", "expected_output": "2\n-3\n2\n\n", "anno_code": ["N, Q = map(int, input().split()) # (0): N=8, Q=3\nS=list(input()) # (1): S=['A', 'C', 'A', 'C', 'T', 'A', 'C', 'G']\nlist=[] # (2): list=[]\nfor i in range(0, N-1): # (3): i=0 (6): i=1 ... (20): NO CHANGE\n if S[i] == \"A\" and S[i+1] == \"C\": # (4): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n list.append(i) # (5): list=[0] (10): list=[0, 2] (17): list=[0, 2, 5]\ncount=0 # (21): count=0\nfor i in range(Q): # (22): i=0 (35): i=1 (48): i=2\n l, r = map(int, input().split()) # (23): l=3, r=7 (36): l=8, r=1 (49): l=1, r=6\n for j in list: # (24): j=0 (27): j=2 ... (59): NO CHANGE\n if l-1 <= j < r-1: # (25): NO CHANGE (28): NO CHANGE ... (57): NO CHANGE\n count+=1 # (29): count=1 (32): count=2 ... (55): count=4\n else:\n count+=0 # (26): NO CHANGE (39): NO CHANGE ... (58): NO CHANGE\n print(count) # (34): NO CHANGE (47): NO CHANGE (60): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, Q = map(int, input().split())\n-S=list(input())\n-list=[]\n-for i in range(0, N-1):\n+S = input()\n+\n+ans = [0]*N\n+for i in range(N-1):\n if S[i] == \"A\" and S[i+1] == \"C\":\n- list.append(i)\n-count=0\n+ ans[i+1] += (ans[i]+1)\n+ else:\n+ ans[i+1] = ans[i] \n+\n for i in range(Q):\n l, r = map(int, input().split())\n- for j in list:\n- if l-1 <= j < r-1:\n- count+=1\n- else:\n- count+=0\n- print(count)\n+ print(ans[r-1] - ans[l-1])\n", "FL_content": " N, Q = map(int, input().split())\n-S=list(input())\n-list=[]\n-for i in range(0, N-1):\n if S[i] == \"A\" and S[i+1] == \"C\":\n- list.append(i)\n-count=0\n for i in range(Q):\n l, r = map(int, input().split())\n- for j in list:\n- if l-1 <= j < r-1:\n- count+=1\n- else:\n- count+=0\n- print(count)\n", "added_lines": 9, "removed_lines": 11, "code1_lines": 15 }, { "user_id": "u515052479", "problem_id": "p03087", "submission1_id": "s255059009", "submission2_id": "s850664516", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,q = map(int,input().split())\ns = list(input())\nbase = [0]*n\ncount = 0\n\nfor i in range(n-1):\n if (s[i] == \"A\") and (s[i+1] == \"C\"):\n count = count + 1\n base[i] = count\n else:\n base[i] = count\n\nbase[n-1] = base[n-2]\n\nfor i in range(q):\n l,r = map(int,input().split())\n ans = base[r-1] - base[l-1]\n \n if s[r-1] == \"A\":\n ans = ans - 1\n \n if s[l-1] == \"A\":\n ans = ans + 1\n \n print(ans)", "code2": "n,q = map(int,input().split())\ns = list(input())\nbase = [0]*n\ncount = 0\n\nfor i in range(1,n):\n if (s[i-1] == \"A\") and (s[i] == \"C\"):\n count = count + 1\n base[i] = count\n else:\n base[i] = count\n\nfor i in range(q):\n l,r = map(int,input().split())\n ans = base[r-1] - base[l-1]\n \n \n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586184198", "date2": "1586184589", "bleu_score": "0.6988484217766844", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1], "code1_test_score": 78, "total_score": 101, "input": "8 3\nGCATCACA\n3 2\n2 3\n2 8\n", "actual_output": "1\n-1\n0\n", "expected_output": "0\n0\n1\n\n", "anno_code": ["n,q = map(int,input().split()) # (0): n=8, q=3\ns = list(input()) # (1): s=['G', 'C', 'A', 'T', 'C', 'A', 'C', 'A']\nbase = [0]*n # (2): base=[0, 0, 0, 0, 0, 0, 0, 0]\ncount = 0 # (3): count=0\n\nfor i in range(n-1): # (4): i=0 (7): i=1 ... (26): NO CHANGE\n if (s[i] == \"A\") and (s[i+1] == \"C\"): # (5): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n count = count + 1 # (21): count=1\n base[i] = count # (22): base=[0, 0, 0, 0, 0, 1, 0, 0]\n else:\n base[i] = count # (6): NO CHANGE (9): NO CHANGE ... (25): base=[0, 0, 0, 0, 0, 1, 1, 0]\n\nbase[n-1] = base[n-2] # (27): base=[0, 0, 0, 0, 0, 1, 1, 1]\n\nfor i in range(q): # (28): i=0 (35): i=1 (42): i=2\n l,r = map(int,input().split()) # (29): l=3, r=2 (36): l=2, r=3 (43): r=8\n ans = base[r-1] - base[l-1] # (30): ans=0 (37): ans=0 (44): ans=1\n \n if s[r-1] == \"A\": # (31): NO CHANGE (38): NO CHANGE (45): NO CHANGE\n ans = ans - 1 # (39): ans=-1 (46): ans=0\n \n if s[l-1] == \"A\": # (32): NO CHANGE (40): NO CHANGE (47): NO CHANGE\n ans = ans + 1 # (33): ans=1\n \n print(ans) # (34): NO CHANGE (41): NO CHANGE (48): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,q = map(int,input().split())\n s = list(input())\n base = [0]*n\n count = 0\n \n-for i in range(n-1):\n- if (s[i] == \"A\") and (s[i+1] == \"C\"):\n+for i in range(1,n):\n+ if (s[i-1] == \"A\") and (s[i] == \"C\"):\n count = count + 1\n base[i] = count\n else:\n base[i] = count\n \n-base[n-1] = base[n-2]\n-\n for i in range(q):\n l,r = map(int,input().split())\n ans = base[r-1] - base[l-1]\n- \n- if s[r-1] == \"A\":\n- ans = ans - 1\n- \n- if s[l-1] == \"A\":\n- ans = ans + 1\n+ \n \n print(ans)\n", "FL_content": " n,q = map(int,input().split())\n s = list(input())\n base = [0]*n\n count = 0\n \n-for i in range(n-1):\n- if (s[i] == \"A\") and (s[i+1] == \"C\"):\n count = count + 1\n base[i] = count\n else:\n base[i] = count\n \n-base[n-1] = base[n-2]\n-\n for i in range(q):\n l,r = map(int,input().split())\n ans = base[r-1] - base[l-1]\n- \n- if s[r-1] == \"A\":\n- ans = ans - 1\n- \n- if s[l-1] == \"A\":\n- ans = ans + 1\n \n print(ans)\n", "added_lines": 3, "removed_lines": 10, "code1_lines": 25 }, { "user_id": "u560867850", "problem_id": "p03087", "submission1_id": "s306099861", "submission2_id": "s138411214", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\nn, q = map(int, input().split())\n\ns = input()\n\nproblems = [list(map(int, input().split())) for _ in range(q)]\n\n\ndef count(total, i):\n return total + 1 if s[i-1] + s[i] == 'AC' else total\n\n\ncumsum = [0] + list(accumulate(range(1, n), count))\n\nfor l, r in problems:\n print(cumsum[r-1] - cumsum[l-1])\n\n", "code2": "from itertools import accumulate\n\nn, q = map(int, input().split())\n\ns = input()\n\nproblems = [list(map(int, input().split())) for _ in range(q)]\n\n\ndef count(total, i):\n return total + 1 if s[i:i+2] == 'AC' else total\n\n\ncumsum = list(accumulate([0] + list(range(n)), count))\n\nfor l, r in problems:\n print(cumsum[r-1] - cumsum[l-1])\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567707327", "date2": "1567707658", "bleu_score": "0.9494345928045318", "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, 0, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 94, "total_score": 101, "input": "8 3\nGCATCACA\n3 7\n2 3\n1 8\n", "actual_output": "1\n0\n2\n", "expected_output": "1\n0\n1\n\n", "anno_code": ["from itertools import accumulate\n\nn, q = map(int, input().split()) # (0): n=8, q=3\n\ns = input() # (1): s=GCATCACA\n\nproblems = [list(map(int, input().split())) for _ in range(q)] # (2): problems\n\n\ndef count(total, i): # (3): count=\n return total + 1 if s[i-1] + s[i] == 'AC' else total\n\n\ncumsum = [0] + list(accumulate(range(1, n), count)) # (4): cumsum=[0, 1, 1, 1, 1, 1, 2, 2]\n\nfor l, r in problems: # (5): l=3, r=7 (7): l=2, r=3 (9): l=1, r=8\n print(cumsum[r-1] - cumsum[l-1]) # (6): NO CHANGE (8): NO CHANGE (10): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " from itertools import accumulate\n \n n, q = map(int, input().split())\n \n s = input()\n \n problems = [list(map(int, input().split())) for _ in range(q)]\n \n \n def count(total, i):\n- return total + 1 if s[i-1] + s[i] == 'AC' else total\n+ return total + 1 if s[i:i+2] == 'AC' else total\n \n \n-cumsum = [0] + list(accumulate(range(1, n), count))\n+cumsum = list(accumulate([0] + list(range(n)), count))\n \n for l, r in problems:\n print(cumsum[r-1] - cumsum[l-1])\n \n \n", "FL_content": " from itertools import accumulate\n \n n, q = map(int, input().split())\n \n s = input()\n \n problems = [list(map(int, input().split())) for _ in range(q)]\n \n \n def count(total, i):\n- return total + 1 if s[i-1] + s[i] == 'AC' else total\n \n \n-cumsum = [0] + list(accumulate(range(1, n), count))\n \n for l, r in problems:\n print(cumsum[r-1] - cumsum[l-1])\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u538632589", "problem_id": "p03087", "submission1_id": "s684832909", "submission2_id": "s424366903", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, q = [int(i) for i in input().split()]\ns = input()\nl_list = []\nr_list = []\nfor i in range(q):\n l, r = [int(i) for i in input().split()]\n l_list.append(l)\n r_list.append(r)\n\nac_map = [0 for i in range(n+1)]\nfor i in range(1, n+1):\n if s[i-1:i+1] == \"AC\":\n ac_map[i] = ac_map[i-1] +1\n else:\n ac_map[i] = ac_map[i-1]\nprint(ac_map)\nfor i in range(q):\n ans = ac_map[r_list[i]-1] - ac_map[l_list[i]-1]\n print(ans)", "code2": "n, q = [int(i) for i in input().split()]\ns = input()\nl_list = []\nr_list = []\nfor i in range(q):\n l, r = [int(i) for i in input().split()]\n l_list.append(l)\n r_list.append(r)\n\nac_map = [0 for i in range(n+1)]\nfor i in range(1, n+1):\n if s[i-1:i+1] == \"AC\":\n ac_map[i] = ac_map[i-1] +1\n else:\n ac_map[i] = ac_map[i-1]\nfor i in range(q):\n ans = ac_map[r_list[i]-1] - ac_map[l_list[i]-1]\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553458544", "date2": "1553458590", "bleu_score": "0.966265491895723", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACACTACG\n3 7\n4 3\n1 2\n", "actual_output": "[0, 1, 1, 2, 2, 2, 3, 3, 3]\n2\n-1\n1\n", "expected_output": "2\n-1\n1\n\n", "anno_code": ["n, q = [int(i) for i in input().split()] # (0): n=8, q=3\ns = input() # (1): s=ACACTACG\nl_list = [] # (2): l_list=[]\nr_list = [] # (3): r_list=[]\nfor i in range(q): # (4): i=0 (8): i=1 ... (16): NO CHANGE\n l, r = [int(i) for i in input().split()] # (5): l=3, r=7 (9): l=4, r=3 (13): l=1, r=2\n l_list.append(l) # (6): l_list=[3] (10): l_list=[3, 4] (14): l_list=[3, 4, 1]\n r_list.append(r) # (7): r_list=[7] (11): r_list=[7, 3] (15): r_list=[7, 3, 2]\n\nac_map = [0 for i in range(n+1)] # (17): ac_map=[0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(1, n+1): # (18): i=1 (21): i=2 ... (42): NO CHANGE\n if s[i-1:i+1] == \"AC\": # (19): NO CHANGE (22): NO CHANGE ... (40): NO CHANGE\n ac_map[i] = ac_map[i-1] +1 # (20): ac_map=[0, 1, 0, 0, 0, 0, 0, 0, 0] (26): ac_map=[0, 1, 1, 2, 0, 0, 0, 0, 0] (35): ac_map=[0, 1, 1, 2, 2, 2, 3, 0, 0]\n else:\n ac_map[i] = ac_map[i-1] # (23): ac_map=[0, 1, 1, 0, 0, 0, 0, 0, 0] (29): ac_map=[0, 1, 1, 2, 2, 0, 0, 0, 0] ... (41): ac_map=[0, 1, 1, 2, 2, 2, 3, 3, 3]\nprint(ac_map) # (43): NO CHANGE\nfor i in range(q): # (44): i=0 (47): i=1 (50): i=2\n ans = ac_map[r_list[i]-1] - ac_map[l_list[i]-1] # (45): ans=2 (48): ans=-1 (51): ans=1\n print(ans) # (46): NO CHANGE (49): NO CHANGE (52): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, q = [int(i) for i in input().split()]\n s = input()\n l_list = []\n r_list = []\n for i in range(q):\n l, r = [int(i) for i in input().split()]\n l_list.append(l)\n r_list.append(r)\n \n ac_map = [0 for i in range(n+1)]\n for i in range(1, n+1):\n if s[i-1:i+1] == \"AC\":\n ac_map[i] = ac_map[i-1] +1\n else:\n ac_map[i] = ac_map[i-1]\n-print(ac_map)\n for i in range(q):\n ans = ac_map[r_list[i]-1] - ac_map[l_list[i]-1]\n print(ans)\n", "FL_content": " n, q = [int(i) for i in input().split()]\n s = input()\n l_list = []\n r_list = []\n for i in range(q):\n l, r = [int(i) for i in input().split()]\n l_list.append(l)\n r_list.append(r)\n \n ac_map = [0 for i in range(n+1)]\n for i in range(1, n+1):\n if s[i-1:i+1] == \"AC\":\n ac_map[i] = ac_map[i-1] +1\n else:\n ac_map[i] = ac_map[i-1]\n-print(ac_map)\n for i in range(q):\n ans = ac_map[r_list[i]-1] - ac_map[l_list[i]-1]\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u692632484", "problem_id": "p03087", "submission1_id": "s626075266", "submission2_id": "s623588245", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,Q = [int(i) for i in input().split()]\nS=input()\nlr = [[int(j)-1 for j in input().split()] for i in range(Q)]\n\nimos = [0 for i in range(N)]\nfor i in range(N-1):\n if S[i]=='A' and S[i+1]=='C':\n imos[i]=1\nfor i in range(N-1):\n imos[i+1]+=imos[i]\nfor l,r in lr:\n res = imos[r]\n if l>0:\n res-=imos[l-1]\n if S[r]=='A':\n res-=1\n print(res)\n", "code2": "N,Q = [int(i) for i in input().split()]\nS=input()\nlr = [[int(j)-1 for j in input().split()] for i in range(Q)]\n\nimos = [0 for i in range(N)]\nfor i in range(N-1):\n if S[i]=='A' and S[i+1]=='C':\n imos[i]=1\nfor i in range(N-1):\n imos[i+1]+=imos[i]\nfor l,r in lr:\n res = imos[r]\n if l>0:\n res-=imos[l-1]\n if S[r]=='A' and r0: # (37): NO CHANGE (43): NO CHANGE (50): NO CHANGE\n res-=imos[l-1] # (38): NO CHANGE (44): NO CHANGE (51): NO CHANGE\n if S[r]=='A': # (39): NO CHANGE (45): NO CHANGE (52): NO CHANGE\n res-=1 # (46): res=-1 (53): res=0\n print(res) # (40): NO CHANGE (47): NO CHANGE (54): NO CHANGE\n"], "anno_status": [true], "diff_content": " N,Q = [int(i) for i in input().split()]\n S=input()\n lr = [[int(j)-1 for j in input().split()] for i in range(Q)]\n \n imos = [0 for i in range(N)]\n for i in range(N-1):\n if S[i]=='A' and S[i+1]=='C':\n imos[i]=1\n for i in range(N-1):\n imos[i+1]+=imos[i]\n for l,r in lr:\n res = imos[r]\n if l>0:\n res-=imos[l-1]\n- if S[r]=='A':\n+ if S[r]=='A' and r0:\n res-=imos[l-1]\n- if S[r]=='A':\n res-=1\n print(res)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u572193732", "problem_id": "p03087", "submission1_id": "s047476870", "submission2_id": "s478316758", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, Q = map(int, input().split())\nS = input()\nS_list = list(S)\ncount_list = [0]*N\nprint(S_list)\n\nfor i in range(1, N):\n count_list[i] += count_list[i-1] \n if S_list[i-1] == \"A\" and S_list[i] == \"C\":\n count_list[i] += 1\n \nprint(count_list)\n\nfor i in range(Q):\n start, end = map(int, input().split())\n count = count_list[end-1] - count_list[start-1]\n print(count)", "code2": "N, Q = map(int, input().split())\nS = input()\nS_list = list(S)\ncount_list = [0]*N\n\nfor i in range(1, N):\n count_list[i] += count_list[i-1] \n if S_list[i-1] == \"A\" and S_list[i] == \"C\":\n count_list[i] += 1\n\nfor i in range(Q):\n start, end = map(int, input().split())\n count = count_list[end-1] - count_list[start-1]\n print(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568474500", "date2": "1568474548", "bleu_score": "0.884988298308358", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACACTACG\n3 7\n2 4\n2 6\n", "actual_output": "['A', 'C', 'A', 'C', 'T', 'A', 'C', 'G']\n[0, 1, 1, 2, 2, 2, 3, 3]\n2\n1\n1\n", "expected_output": "2\n1\n1\n\n", "anno_code": ["N, Q = map(int, input().split()) # (0): N=8, Q=3\nS = input() # (1): S=ACACTACG\nS_list = list(S) # (2): S_list=['A', 'C', 'A', 'C', 'T', 'A', 'C', 'G']\ncount_list = [0]*N # (3): count_list=[0, 0, 0, 0, 0, 0, 0, 0]\nprint(S_list) # (4): NO CHANGE\n\nfor i in range(1, N): # (5): i=1 (9): i=2 ... (29): NO CHANGE\n count_list[i] += count_list[i-1] # (6): NO CHANGE (10): count_list=[0, 1, 1, 0, 0, 0, 0, 0] ... (27): count_list=[0, 1, 1, 2, 2, 2, 3, 3]\n if S_list[i-1] == \"A\" and S_list[i] == \"C\": # (7): NO CHANGE (11): NO CHANGE ... (28): NO CHANGE\n count_list[i] += 1 # (8): count_list=[0, 1, 0, 0, 0, 0, 0, 0] (15): count_list=[0, 1, 1, 2, 0, 0, 0, 0] (25): count_list=[0, 1, 1, 2, 2, 2, 3, 0]\n \nprint(count_list) # (30): NO CHANGE\n\nfor i in range(Q): # (31): i=0 (35): i=1 (39): i=2\n start, end = map(int, input().split()) # (32): start=3, end=7 (36): start=2, end=4 (40): end=6\n count = count_list[end-1] - count_list[start-1] # (33): count=2 (37): count=1 (41): NO CHANGE\n print(count) # (34): NO CHANGE (38): NO CHANGE (42): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, Q = map(int, input().split())\n S = input()\n S_list = list(S)\n count_list = [0]*N\n-print(S_list)\n \n for i in range(1, N):\n count_list[i] += count_list[i-1] \n if S_list[i-1] == \"A\" and S_list[i] == \"C\":\n count_list[i] += 1\n- \n-print(count_list)\n \n for i in range(Q):\n start, end = map(int, input().split())\n count = count_list[end-1] - count_list[start-1]\n print(count)\n", "FL_content": " N, Q = map(int, input().split())\n S = input()\n S_list = list(S)\n count_list = [0]*N\n-print(S_list)\n \n for i in range(1, N):\n count_list[i] += count_list[i-1] \n if S_list[i-1] == \"A\" and S_list[i] == \"C\":\n count_list[i] += 1\n- \n-print(count_list)\n \n for i in range(Q):\n start, end = map(int, input().split())\n count = count_list[end-1] - count_list[start-1]\n print(count)\n", "added_lines": 0, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u692746605", "problem_id": "p03087", "submission1_id": "s227728523", "submission2_id": "s376211930", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,Q=[int(i) for i in input().split()]\nS=input()\n\nc=[0]\nt = 0\nfor i in range(1,N):\n t += 1 if (S[i-1]=='A' and S[i] == 'C') else 0\n c.append(t)\nc.append(t)\n\nfor _ in range(Q):\n l,r=[int(x)-1 for x in input().split()]\n print(c[r]-c[l+1])\n", "code2": "N,Q=[int(i) for i in input().split()]\nS=input()\n\nc=[0]\nt = 0\nfor i in range(1,N):\n t += 1 if (S[i-1]=='A' and S[i] == 'C') else 0\n c.append(t)\n\nfor _ in range(Q):\n l,r=[int(x)-1 for x in input().split()]\n print(c[r]-c[l])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558199782", "date2": "1558200408", "bleu_score": "0.9355487702610847", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 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, 1, 1, 0, 1, 0], "code1_test_score": 19, "total_score": 101, "input": "8 3\nACACTACG\n3 7\n2 3\n1 2\n", "actual_output": "1\n0\n0\n", "expected_output": "2\n0\n1\n\n", "anno_code": ["N,Q=[int(i) for i in input().split()] # (0): N=8, Q=3\nS=input() # (1): S=ACACTACG\n\nc=[0] # (2): c=[0]\nt = 0 # (3): t=0\nfor i in range(1,N): # (4): i=1 (7): i=2 ... (25): NO CHANGE\n t += 1 if (S[i-1]=='A' and S[i] == 'C') else 0 # (5): t=1 (8): NO CHANGE ... (23): NO CHANGE\n c.append(t) # (6): c=[0, 1] (9): c=[0, 1, 1] ... (24): c=[0, 1, 1, 2, 2, 2, 3, 3]\nc.append(t) # (26): c=[0, 1, 1, 2, 2, 2, 3, 3, 3]\n\nfor _ in range(Q): # (27): _=0 (30): _=1 (33): _=2\n l,r=[int(x)-1 for x in input().split()] # (28): l=2, r=6 (31): l=1, r=2 (34): l=0, r=1\n print(c[r]-c[l+1]) # (29): NO CHANGE (32): NO CHANGE (35): NO CHANGE\n"], "anno_status": [true], "diff_content": " N,Q=[int(i) for i in input().split()]\n S=input()\n \n c=[0]\n t = 0\n for i in range(1,N):\n t += 1 if (S[i-1]=='A' and S[i] == 'C') else 0\n c.append(t)\n-c.append(t)\n \n for _ in range(Q):\n l,r=[int(x)-1 for x in input().split()]\n- print(c[r]-c[l+1])\n+ print(c[r]-c[l])\n \n", "FL_content": " N,Q=[int(i) for i in input().split()]\n S=input()\n \n c=[0]\n t = 0\n for i in range(1,N):\n t += 1 if (S[i-1]=='A' and S[i] == 'C') else 0\n c.append(t)\n-c.append(t)\n \n for _ in range(Q):\n l,r=[int(x)-1 for x in input().split()]\n- print(c[r]-c[l+1])\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u189479417", "problem_id": "p03087", "submission1_id": "s871500072", "submission2_id": "s763204036", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, Q = map(int,input().split())\nS = input()\ncnt = [0]\nfor i in range(len(S)-1):\n cnt.append(cnt[-1])\n if S[i] == 'A' and S[i+1] == 'C':\n cnt[-1] += 1\ncnt = [0] + cnt\nprint(cnt)\n\nfor _ in range(Q):\n l, r = map(int,input().split())\n ans = cnt[r] - cnt[l-1]\n if 2 <= l and (S[l-2] == 'A' and S[l-1] == 'C'):\n ans -= 1\n print(ans)", "code2": "N, Q = map(int,input().split())\nS = input()\ncnt = [0]\nfor i in range(len(S)-1):\n cnt.append(cnt[-1])\n if S[i] == 'A' and S[i+1] == 'C':\n cnt[-1] += 1\ncnt = [0] + cnt\n\nfor _ in range(Q):\n l, r = map(int,input().split())\n ans = cnt[r] - cnt[l-1]\n if 2 <= l and (S[l-2] == 'A' and S[l-1] == 'C'):\n ans -= 1\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586810893", "date2": "1586810942", "bleu_score": "0.9666839155363091", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\n@CBCTACG\n6 7\n2 3\n1 6\n", "actual_output": "[0, 0, 0, 0, 0, 0, 0, 1, 1]\n1\n0\n0\n", "expected_output": "1\n0\n0\n\n", "anno_code": ["N, Q = map(int,input().split()) # (0): N=8, Q=3\nS = input() # (1): S=@CBCTACG\ncnt = [0] # (2): cnt=[0]\nfor i in range(len(S)-1): # (3): i=0 (6): i=1 ... (25): NO CHANGE\n cnt.append(cnt[-1]) # (4): cnt=[0, 0] (7): cnt=[0, 0, 0] ... (23): cnt=[0, 0, 0, 0, 0, 0, 1, 1]\n if S[i] == 'A' and S[i+1] == 'C': # (5): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n cnt[-1] += 1 # (21): cnt=[0, 0, 0, 0, 0, 0, 1]\ncnt = [0] + cnt # (26): cnt=[0, 0, 0, 0, 0, 0, 0, 1, 1]\nprint(cnt) # (27): NO CHANGE\n\nfor _ in range(Q): # (28): _=0 (33): _=1 (38): _=2\n l, r = map(int,input().split()) # (29): l=6, r=7 (34): l=2, r=3 (39): l=1, r=6\n ans = cnt[r] - cnt[l-1] # (30): ans=1 (35): ans=0 (40): NO CHANGE\n if 2 <= l and (S[l-2] == 'A' and S[l-1] == 'C'): # (31): NO CHANGE (36): NO CHANGE (41): NO CHANGE\n ans -= 1\n print(ans) # (32): NO CHANGE (37): NO CHANGE (42): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, Q = map(int,input().split())\n S = input()\n cnt = [0]\n for i in range(len(S)-1):\n cnt.append(cnt[-1])\n if S[i] == 'A' and S[i+1] == 'C':\n cnt[-1] += 1\n cnt = [0] + cnt\n-print(cnt)\n \n for _ in range(Q):\n l, r = map(int,input().split())\n ans = cnt[r] - cnt[l-1]\n if 2 <= l and (S[l-2] == 'A' and S[l-1] == 'C'):\n ans -= 1\n print(ans)\n", "FL_content": " N, Q = map(int,input().split())\n S = input()\n cnt = [0]\n for i in range(len(S)-1):\n cnt.append(cnt[-1])\n if S[i] == 'A' and S[i+1] == 'C':\n cnt[-1] += 1\n cnt = [0] + cnt\n-print(cnt)\n \n for _ in range(Q):\n l, r = map(int,input().split())\n ans = cnt[r] - cnt[l-1]\n if 2 <= l and (S[l-2] == 'A' and S[l-1] == 'C'):\n ans -= 1\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u883203948", "problem_id": "p03087", "submission1_id": "s848542694", "submission2_id": "s771658948", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nx = input().split()\nn = int(x[0]) \nq = int(x[1]) \ns = input()\n\ndef ind_Multi(a,b): \n global n\n global s \n index_L = []\n for i in range(a,b):\n if s[i] == \"A\":\n index_L.append(i)\n return index_L\n\n \n \nt = [0] * n\nif s[0] == \"A\":\n t[0] = 1\n \nfor i in range(0,n-1):\n if s[i:i+2] == \"AC\":\n \n if (i == 0) :\n t[i] = + 1\n else:\n t[i] = t[i-1] + 1\n else :\n if i == 0:\n t[i] = 0\n else:\n t[i] = t[i-1]\n\n\n\ndef sc():\n global t\n global s\n global n\n global q\n global idbox\n maxx = 0\n count = 0\n com = [int(s)-1 for s in input().split()]\n print(com)\n idbox = ind_Multi(com[0],com[1])\n print(t[com[1]-1] - t[com[0]-1])\n \n \n\n \n\nfor i in range(q):\n \n sc()\n", "code2": "\nx = input().split()\nn = int(x[0]) \nq = int(x[1]) \ns = input()\n\n \nt = [0] * n\nif s[0] == \"A\":\n t[0] = 1\n \nfor i in range(0,n-1):\n if s[i:i+2] == \"AC\":\n \n if (i == 0) :\n t[i] = + 1\n else:\n t[i] = t[i-1] + 1\n else :\n if i == 0:\n t[i] = 0\n else:\n t[i] = t[i-1]\n\n\n\ndef sc():\n global t\n global s\n global n\n global q\n global idbox\n maxx = 0\n count = 0\n com = [int(s)-1 for s in input().split()]\n \n \n print(t[com[1]-1] - t[com[0]-1])\n \n \n\n \n\nfor i in range(q):\n \n sc()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554476719", "date2": "1554476827", "bleu_score": "0.698443199003825", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2\nACACTACG\n3 7\n4 3\n1 2\n", "actual_output": "[2, 6]\n2\n[3, 2]\n-1\n", "expected_output": "2\n-1\n\n", "anno_code": ["\nx = input().split() # (0): x=['8', '2']\nn = int(x[0]) # (1): n=8\nq = int(x[1]) # (2): q=2\ns = input() # (3): s=ACACTACG\n\ndef ind_Multi(a,b): # (4): ind_Multi=\n global n\n global s \n index_L = [] # (45): index_L=[] (65): index_L=[]\n for i in range(a,b): # (46): i=2 (49): i=3 ... (66): maxx=0, count=0, com=[3, 2]\n if s[i] == \"A\": # (47): NO CHANGE (50): NO CHANGE ... (54): NO CHANGE\n index_L.append(i) # (48): index_L=[2] (55): index_L=[2, 5]\n return index_L\n\n \n \nt = [0] * n # (5): t=[0, 0, 0, 0, 0, 0, 0, 0]\nif s[0] == \"A\": # (6): NO CHANGE\n t[0] = 1 # (7): t=[1, 0, 0, 0, 0, 0, 0, 0]\n \nfor i in range(0,n-1): # (8): i=0 (12): i=1 ... (36): NO CHANGE\n if s[i:i+2] == \"AC\": # (9): NO CHANGE (13): NO CHANGE ... (33): NO CHANGE\n \n if (i == 0) : # (10): NO CHANGE (18): NO CHANGE (30): NO CHANGE\n t[i] = + 1 # (11): NO CHANGE\n else:\n t[i] = t[i-1] + 1 # (19): t=[1, 1, 2, 0, 0, 0, 0, 0] (31): t=[1, 1, 2, 2, 2, 3, 0, 0]\n else :\n if i == 0: # (14): NO CHANGE (22): NO CHANGE ... (34): NO CHANGE\n t[i] = 0\n else:\n t[i] = t[i-1] # (15): t=[1, 1, 0, 0, 0, 0, 0, 0] (23): t=[1, 1, 2, 2, 0, 0, 0, 0] ... (35): t=[1, 1, 2, 2, 2, 3, 3, 0]\n\n\n\ndef sc(): # (37): sc=\n global t\n global s\n global n\n global q\n global idbox\n maxx = 0 # (40): maxx=0 (60): maxx=0\n count = 0 # (41): count=0 (61): count=0\n com = [int(s)-1 for s in input().split()] # (42): com=[2, 6] (62): com=[3, 2]\n print(com) # (43): NO CHANGE (63): NO CHANGE\n idbox = ind_Multi(com[0],com[1]) # (44): a=2, b=6 (64): a=3, b=2\n print(t[com[1]-1] - t[com[0]-1]) # (57): x=['8', '2'], n=8, q=2, s=ACACTACG, ind_Multi=, t=[1, 1, 2, 2, 2, 3, 3, 0], i=0, sc=, idbox=[2, 5] (67): x=['8', '2'], n=8, q=2, s=ACACTACG, ind_Multi=, t=[1, 1, 2, 2, 2, 3, 3, 0], i=1, sc=, idbox=[]\n \n \n\n \n\nfor i in range(q): # (38): i=0 (58): i=1\n \n sc() # (39): NO CHANGE (59): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n x = input().split()\n n = int(x[0]) \n q = int(x[1]) \n s = input()\n \n-def ind_Multi(a,b): \n- global n\n- global s \n- index_L = []\n- for i in range(a,b):\n- if s[i] == \"A\":\n- index_L.append(i)\n- return index_L\n-\n- \n \n t = [0] * n\n if s[0] == \"A\":\n t[0] = 1\n \n for i in range(0,n-1):\n if s[i:i+2] == \"AC\":\n \n if (i == 0) :\n t[i] = + 1\n else:\n t[i] = t[i-1] + 1\n else :\n if i == 0:\n t[i] = 0\n else:\n t[i] = t[i-1]\n \n \n \n def sc():\n global t\n global s\n global n\n global q\n global idbox\n maxx = 0\n count = 0\n com = [int(s)-1 for s in input().split()]\n- print(com)\n- idbox = ind_Multi(com[0],com[1])\n+ \n+ \n print(t[com[1]-1] - t[com[0]-1])\n \n \n \n \n \n for i in range(q):\n \n sc()\n \n", "FL_content": " \n x = input().split()\n n = int(x[0]) \n q = int(x[1]) \n s = input()\n \n-def ind_Multi(a,b): \n- global n\n- global s \n- index_L = []\n- for i in range(a,b):\n- if s[i] == \"A\":\n- index_L.append(i)\n- return index_L\n-\n- \n \n t = [0] * n\n if s[0] == \"A\":\n t[0] = 1\n \n for i in range(0,n-1):\n if s[i:i+2] == \"AC\":\n \n if (i == 0) :\n t[i] = + 1\n else:\n t[i] = t[i-1] + 1\n else :\n if i == 0:\n t[i] = 0\n else:\n t[i] = t[i-1]\n \n \n \n def sc():\n global t\n global s\n global n\n global q\n global idbox\n maxx = 0\n count = 0\n com = [int(s)-1 for s in input().split()]\n- print(com)\n- idbox = ind_Multi(com[0],com[1])\n print(t[com[1]-1] - t[com[0]-1])\n \n \n \n \n \n for i in range(q):\n \n sc()\n \n", "added_lines": 2, "removed_lines": 12, "code1_lines": 57 }, { "user_id": "u863397945", "problem_id": "p03087", "submission1_id": "s641909806", "submission2_id": "s691571458", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nN,Q = map(int,input().split())\nS = input()\n\nl = [0]*N \nans = 0\n\nfor i in range(N-1):\n if S[i] == \"A\" and S[i+1] == \"C\":\n l[i] = 1\nprint(l)\n\nfor i in range(Q):\n lef,rig = map(int,input().split())\n print(l[lef-1:rig-1].count(1))", "code2": "\n\n\nN,Q = map(int,input().split())\nS = input()\n\nt = [0]*(N+1) \n\nfor i in range(N-1):\n if S[i:i+2] == \"AC\":\n t[i+1] = t[i] + 1\n else:\n t[i+1] = t[i]\n\nfor i in range(Q):\n l,r = map(int,input().split())\n print(t[r-1]-t[l-1]) ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596354569", "date2": "1596355074", "bleu_score": "0.7131901579158355", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACACTACG\n4 3\n2 6\n1 8\n", "actual_output": "[1, 0, 1, 0, 0, 1, 0, 0]\n0\n1\n3\n", "expected_output": "-1\n1\n3\n\n", "anno_code": ["\n\n\nN,Q = map(int,input().split()) # (0): N=8, Q=3\nS = input() # (1): S=ACACTACG\n\nl = [0]*N # (2): l=[0, 0, 0, 0, 0, 0, 0, 0]\nans = 0 # (3): ans=0\n\nfor i in range(N-1): # (4): i=0 (7): i=1 ... (21): NO CHANGE\n if S[i] == \"A\" and S[i+1] == \"C\": # (5): NO CHANGE (8): NO CHANGE ... (20): NO CHANGE\n l[i] = 1 # (6): l=[1, 0, 0, 0, 0, 0, 0, 0] (11): l=[1, 0, 1, 0, 0, 0, 0, 0] (18): l=[1, 0, 1, 0, 0, 1, 0, 0]\nprint(l) # (22): NO CHANGE\n\nfor i in range(Q): # (23): i=0 (26): i=1 (29): i=2\n lef,rig = map(int,input().split()) # (24): lef=4, rig=3 (27): lef=2, rig=6 (30): lef=1, rig=8\n print(l[lef-1:rig-1].count(1)) # (25): NO CHANGE (28): NO CHANGE (31): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n \n N,Q = map(int,input().split())\n S = input()\n \n-l = [0]*N \n-ans = 0\n+t = [0]*(N+1) \n \n for i in range(N-1):\n- if S[i] == \"A\" and S[i+1] == \"C\":\n- l[i] = 1\n-print(l)\n+ if S[i:i+2] == \"AC\":\n+ t[i+1] = t[i] + 1\n+ else:\n+ t[i+1] = t[i]\n \n for i in range(Q):\n- lef,rig = map(int,input().split())\n- print(l[lef-1:rig-1].count(1))\n+ l,r = map(int,input().split())\n+ print(t[r-1]-t[l-1]) \n", "FL_content": " \n \n \n N,Q = map(int,input().split())\n S = input()\n \n-l = [0]*N \n-ans = 0\n \n for i in range(N-1):\n- if S[i] == \"A\" and S[i+1] == \"C\":\n- l[i] = 1\n-print(l)\n \n for i in range(Q):\n- lef,rig = map(int,input().split())\n- print(l[lef-1:rig-1].count(1))\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 17 }, { "user_id": "u489762173", "problem_id": "p03087", "submission1_id": "s317498789", "submission2_id": "s528976268", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\ndef main():\n N, Q = map(int, input().split())\n S = list(input().rstrip())\n\n dec_a = [0] * (N)\n for x in range(1, N):\n if S[x] == 'C' and S[x-1] == 'A':\n S[x-1] = 'a'\n dec_a[x] = S[:x+1].count('a')\n\n\n L = [0] * Q\n R = [0] * Q\n for i in range(Q):\n L[i], R[i] = map(int, input().split())\n\n print(dec_a)\n for j in range(Q):\n print(dec_a[R[j]-1] - dec_a[L[j]-1])\n\nmain()", "code2": "import sys\ninput = sys.stdin.readline\n\ndef main():\n N, Q = map(int, input().split())\n S = input().rstrip()\n\n cnt_ac = 0\n arr_ac = [0] * (N)\n for x in range(0, N-1):\n if S[x:x+2] == 'AC':\n cnt_ac += 1\n arr_ac[x+1] = cnt_ac\n\n for i in range(Q):\n L, R = map(int, input().split())\n print(arr_ac[R-1] - arr_ac[L-1])\n\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578653440", "date2": "1578658588", "bleu_score": "0.6330913484805732", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACACTACG\n3 7\n2 3\n1 2\n", "actual_output": "[0, 1, 1, 2, 2, 2, 3, 3]\n2\n0\n1\n", "expected_output": "2\n0\n1\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\ndef main(): # (1): main=\n N, Q = map(int, input().split()) # (3): N=8, Q=3\n S = list(input().rstrip()) # (4): S=['A', 'C', 'A', 'C', 'T', 'A', 'C', 'G']\n\n dec_a = [0] * (N) # (5): dec_a=[0, 0, 0, 0, 0, 0, 0, 0]\n for x in range(1, N): # (6): x=1 (10): x=2 ... (30): NO CHANGE\n if S[x] == 'C' and S[x-1] == 'A': # (7): NO CHANGE (11): NO CHANGE ... (28): NO CHANGE\n S[x-1] = 'a' # (8): S=['a', 'C', 'A', 'C', 'T', 'A', 'C', 'G'] (15): S=['a', 'C', 'a', 'C', 'T', 'A', 'C', 'G'] (25): S=['a', 'C', 'a', 'C', 'T', 'a', 'C', 'G']\n dec_a[x] = S[:x+1].count('a') # (9): dec_a=[0, 1, 0, 0, 0, 0, 0, 0] (12): dec_a=[0, 1, 1, 0, 0, 0, 0, 0] ... (29): dec_a=[0, 1, 1, 2, 2, 2, 3, 3]\n\n\n L = [0] * Q # (31): L=[0, 0, 0]\n R = [0] * Q # (32): R=[0, 0, 0]\n for i in range(Q): # (33): i=0 (35): i=1 ... (39): NO CHANGE\n L[i], R[i] = map(int, input().split()) # (34): L=[3, 0, 0], R=[7, 0, 0] (36): L=[3, 2, 0], R=[7, 3, 0] (38): L=[3, 2, 1], R=[7, 3, 2]\n\n print(dec_a) # (40): NO CHANGE\n for j in range(Q): # (41): j=0 (43): j=1 (45): j=2\n print(dec_a[R[j]-1] - dec_a[L[j]-1]) # (42): NO CHANGE (44): NO CHANGE (46): NO CHANGE\n\nmain() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n def main():\n N, Q = map(int, input().split())\n- S = list(input().rstrip())\n+ S = input().rstrip()\n \n- dec_a = [0] * (N)\n- for x in range(1, N):\n- if S[x] == 'C' and S[x-1] == 'A':\n- S[x-1] = 'a'\n- dec_a[x] = S[:x+1].count('a')\n+ cnt_ac = 0\n+ arr_ac = [0] * (N)\n+ for x in range(0, N-1):\n+ if S[x:x+2] == 'AC':\n+ cnt_ac += 1\n+ arr_ac[x+1] = cnt_ac\n \n-\n- L = [0] * Q\n- R = [0] * Q\n for i in range(Q):\n- L[i], R[i] = map(int, input().split())\n+ L, R = map(int, input().split())\n+ print(arr_ac[R-1] - arr_ac[L-1])\n \n- print(dec_a)\n- for j in range(Q):\n- print(dec_a[R[j]-1] - dec_a[L[j]-1])\n \n main()\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n def main():\n N, Q = map(int, input().split())\n- S = list(input().rstrip())\n \n- dec_a = [0] * (N)\n- for x in range(1, N):\n- if S[x] == 'C' and S[x-1] == 'A':\n- S[x-1] = 'a'\n- dec_a[x] = S[:x+1].count('a')\n \n-\n- L = [0] * Q\n- R = [0] * Q\n for i in range(Q):\n- L[i], R[i] = map(int, input().split())\n \n- print(dec_a)\n- for j in range(Q):\n- print(dec_a[R[j]-1] - dec_a[L[j]-1])\n \n main()\n", "added_lines": 9, "removed_lines": 13, "code1_lines": 24 }, { "user_id": "u557171945", "problem_id": "p03087", "submission1_id": "s888404935", "submission2_id": "s687777876", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,q = map(int,input().split())\nS = input()\ntb = [0 for i in range(n)]\nfor i in range(n):\n if i==0 or S[i]!='C':\n tb[i] = tb[i-1]\n continue\n print(S[i])\n if S[i-1]=='A':\n tb[i] = tb[i-1]+1\nfor i in range(q):\n l,r = map(int,input().split())\n print(tb[r-1]-tb[l-1])\n", "code2": "n,q = map(int,input().split())\nS = input()\ntb = [0 for i in range(n)]\nfor i in range(1,n):\n if S[i]=='C' and S[i-1]=='A':\n tb[i] = tb[i-1]+1\n else:\n tb[i] = tb[i-1]\nfor i in range(q):\n l,r = map(int,input().split())\n print(tb[r-1]-tb[l-1])\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1554234290", "date2": "1554234890", "bleu_score": "0.8263811206618425", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACACTACG\n3 7\n8 5\n1 6\n", "actual_output": "C\nC\nC\n2\n-1\n2\n", "expected_output": "2\n-1\n2\n\n", "anno_code": ["n,q = map(int,input().split()) # (0): n=8, q=3\nS = input() # (1): S=ACACTACG\ntb = [0 for i in range(n)] # (2): tb=[0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n): # (3): i=0 (7): i=1 ... (38): NO CHANGE\n if i==0 or S[i]!='C': # (4): NO CHANGE (8): NO CHANGE ... (35): NO CHANGE\n tb[i] = tb[i-1] # (5): NO CHANGE (14): tb=[0, 1, 1, 0, 0, 0, 0, 0] ... (36): tb=[0, 1, 1, 2, 2, 2, 3, 3]\n continue # (6): NO CHANGE (15): NO CHANGE ... (37): NO CHANGE\n print(S[i]) # (9): NO CHANGE (18): NO CHANGE (31): NO CHANGE\n if S[i-1]=='A': # (10): NO CHANGE (19): NO CHANGE (32): NO CHANGE\n tb[i] = tb[i-1]+1 # (11): tb=[0, 1, 0, 0, 0, 0, 0, 0] (20): tb=[0, 1, 1, 2, 0, 0, 0, 0] (33): tb=[0, 1, 1, 2, 2, 2, 3, 0]\nfor i in range(q): # (39): i=0 (42): i=1 (45): i=2\n l,r = map(int,input().split()) # (40): l=3, r=7 (43): l=8, r=5 (46): l=1, r=6\n print(tb[r-1]-tb[l-1]) # (41): NO CHANGE (44): NO CHANGE (47): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,q = map(int,input().split())\n S = input()\n tb = [0 for i in range(n)]\n-for i in range(n):\n- if i==0 or S[i]!='C':\n- tb[i] = tb[i-1]\n- continue\n- print(S[i])\n- if S[i-1]=='A':\n+for i in range(1,n):\n+ if S[i]=='C' and S[i-1]=='A':\n tb[i] = tb[i-1]+1\n+ else:\n+ tb[i] = tb[i-1]\n for i in range(q):\n l,r = map(int,input().split())\n print(tb[r-1]-tb[l-1])\n \n+\n", "FL_content": " n,q = map(int,input().split())\n S = input()\n tb = [0 for i in range(n)]\n-for i in range(n):\n- if i==0 or S[i]!='C':\n- tb[i] = tb[i-1]\n- continue\n- print(S[i])\n- if S[i-1]=='A':\n tb[i] = tb[i-1]+1\n for i in range(q):\n l,r = map(int,input().split())\n print(tb[r-1]-tb[l-1])\n \n", "added_lines": 5, "removed_lines": 6, "code1_lines": 14 }, { "user_id": "u680851063", "problem_id": "p03087", "submission1_id": "s771549860", "submission2_id": "s395647545", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\nn, q = map(int, input().split())\ns = list(input())\n\nz = []\nfor i in range(n-1):\n if s[i] + s[i+1] == 'AC':\n z.append(1)\n else:\n z.append(0)\nprint(z)\n\nz = [0] + list(accumulate(z))\nprint(z)\n\nfor j in range(q):\n l, r = map(int, input().split())\n print(z[r-1] - z[l-1])\n", "code2": "from itertools import accumulate\n\nn, q = map(int, input().split())\ns = list(input())\n\nz = []\nfor i in range(n-1):\n if s[i] + s[i+1] == 'AC':\n z.append(1)\n else:\n z.append(0)\n\n\nz = [0] + list(accumulate(z))\n\n\nfor j in range(q):\n l, r = map(int, input().split())\n print(z[r-1] - z[l-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581841965", "date2": "1581842027", "bleu_score": "0.9423154323558083", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2\nACACTACG\n3 2\n1 5\n1 2\n", "actual_output": "[1, 0, 1, 0, 0, 1, 0]\n[0, 1, 1, 2, 2, 2, 3, 3]\n0\n2\n", "expected_output": "0\n2\n\n", "anno_code": ["from itertools import accumulate\n\nn, q = map(int, input().split()) # (0): n=8, q=2\ns = list(input()) # (1): s=['A', 'C', 'A', 'C', 'T', 'A', 'C', 'G']\n\nz = [] # (2): z=[]\nfor i in range(n-1): # (3): i=0 (6): i=1 ... (24): NO CHANGE\n if s[i] + s[i+1] == 'AC': # (4): NO CHANGE (7): NO CHANGE ... (22): NO CHANGE\n z.append(1) # (5): z=[1] (11): z=[1, 0, 1] (20): z=[1, 0, 1, 0, 0, 1]\n else:\n z.append(0) # (8): z=[1, 0] (14): z=[1, 0, 1, 0] ... (23): z=[1, 0, 1, 0, 0, 1, 0]\nprint(z) # (25): NO CHANGE\n\nz = [0] + list(accumulate(z)) # (26): z=[0, 1, 1, 2, 2, 2, 3, 3]\nprint(z) # (27): NO CHANGE\n\nfor j in range(q): # (28): j=0 (31): j=1\n l, r = map(int, input().split()) # (29): l=3, r=2 (32): l=1, r=5\n print(z[r-1] - z[l-1]) # (30): NO CHANGE (33): NO CHANGE\n"], "anno_status": [true], "diff_content": " from itertools import accumulate\n \n n, q = map(int, input().split())\n s = list(input())\n \n z = []\n for i in range(n-1):\n if s[i] + s[i+1] == 'AC':\n z.append(1)\n else:\n z.append(0)\n-print(z)\n+\n \n z = [0] + list(accumulate(z))\n-print(z)\n+\n \n for j in range(q):\n l, r = map(int, input().split())\n print(z[r-1] - z[l-1])\n \n", "FL_content": " from itertools import accumulate\n \n n, q = map(int, input().split())\n s = list(input())\n \n z = []\n for i in range(n-1):\n if s[i] + s[i+1] == 'AC':\n z.append(1)\n else:\n z.append(0)\n-print(z)\n \n z = [0] + list(accumulate(z))\n-print(z)\n \n for j in range(q):\n l, r = map(int, input().split())\n print(z[r-1] - z[l-1])\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u835482198", "problem_id": "p03087", "submission1_id": "s672417494", "submission2_id": "s229837995", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, q = map(int, input().split())\ns = input()\n\nac = [0 for i in range(n)]\nfor i in range(1, n):\n if s[i - 1] == 'A' and s[i] == 'C':\n ac[i] = 1\n\nfor i in range(n - 1):\n ac[i + 1] += ac[i]\nprint(ac)\nfor i in range(q):\n l, r = map(int, input().split())\n l -= 1\n r -= 1\n ret = ac[r] - ac[l]\n print(ret)\n", "code2": "n, q = map(int, input().split())\ns = input()\n\nac = [0 for i in range(n)]\nfor i in range(1, n):\n if s[i - 1] == 'A' and s[i] == 'C':\n ac[i] = 1\n\nfor i in range(n - 1):\n ac[i + 1] += ac[i]\nfor i in range(q):\n l, r = map(int, input().split())\n l -= 1\n r -= 1\n ret = ac[r] - ac[l]\n print(ret)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567270303", "date2": "1567270343", "bleu_score": "0.966631333322595", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACACTACG\n3 7\n2 3\n1 8\n", "actual_output": "[0, 1, 1, 2, 2, 2, 3, 3]\n2\n0\n3\n", "expected_output": "2\n0\n3\n", "anno_code": ["n, q = map(int, input().split()) # (0): n=8, q=3\ns = input() # (1): s=ACACTACG\n\nac = [0 for i in range(n)] # (2): ac=[0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(1, n): # (3): i=1 (6): i=2 ... (20): NO CHANGE\n if s[i - 1] == 'A' and s[i] == 'C': # (4): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n ac[i] = 1 # (5): ac=[0, 1, 0, 0, 0, 0, 0, 0] (10): ac=[0, 1, 0, 1, 0, 0, 0, 0] (17): ac=[0, 1, 0, 1, 0, 0, 1, 0]\n\nfor i in range(n - 1): # (21): i=0 (23): i=1 ... (35): NO CHANGE\n ac[i + 1] += ac[i] # (22): NO CHANGE (24): ac=[0, 1, 1, 1, 0, 0, 1, 0] ... (34): ac=[0, 1, 1, 2, 2, 2, 3, 3]\nprint(ac) # (36): NO CHANGE\nfor i in range(q): # (37): i=0 (43): i=1 (49): i=2\n l, r = map(int, input().split()) # (38): l=3, r=7 (44): r=3 (50): r=8\n l -= 1 # (39): l=2 (45): l=1 (51): l=0\n r -= 1 # (40): r=6 (46): r=2 (52): r=7\n ret = ac[r] - ac[l] # (41): ret=2 (47): ret=0 (53): ret=3\n print(ret) # (42): NO CHANGE (48): NO CHANGE (54): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, q = map(int, input().split())\n s = input()\n \n ac = [0 for i in range(n)]\n for i in range(1, n):\n if s[i - 1] == 'A' and s[i] == 'C':\n ac[i] = 1\n \n for i in range(n - 1):\n ac[i + 1] += ac[i]\n-print(ac)\n for i in range(q):\n l, r = map(int, input().split())\n l -= 1\n r -= 1\n ret = ac[r] - ac[l]\n print(ret)\n \n", "FL_content": " n, q = map(int, input().split())\n s = input()\n \n ac = [0 for i in range(n)]\n for i in range(1, n):\n if s[i - 1] == 'A' and s[i] == 'C':\n ac[i] = 1\n \n for i in range(n - 1):\n ac[i + 1] += ac[i]\n-print(ac)\n for i in range(q):\n l, r = map(int, input().split())\n l -= 1\n r -= 1\n ret = ac[r] - ac[l]\n print(ret)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u210827208", "problem_id": "p03087", "submission1_id": "s372193696", "submission2_id": "s529786376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,q=map(int,input().split())\ns=input()\nV=[0]*n\nX=[]\nfor i in range(q):\n l,r=map(int,input().split())\n X.append([l,r])\n\nfor i in range(n-1):\n if s[i:i+2]=='AC':\n V[i]+=1\n\nfor i in range(q):\n ans=sum(V[X[i][0]-1:X[i][1]])\n if V[X[i][1]-1]==1:\n ans-=1\nprint(ans)", "code2": "n,q=map(int,input().split())\ns=input()+'Z'\nA=[0]*(n+1)\ncnt=0\nfor i in range(n):\n A[i]=cnt\n if s[i]=='A' and s[i+1]=='C':\n cnt+=1\nANS=[]\nfor i in range(q):\n l,r=map(int,input().split())\n ANS.append(A[r-1]-A[l-1])\nfor ans in ANS:\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554064148", "date2": "1584804272", "bleu_score": "0.6511917246931338", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 4, "total_score": 101, "input": "8 3\nACACTACG\n1 7\n1 4\n2 8\n", "actual_output": "2\n", "expected_output": "3\n2\n2\n\n", "anno_code": ["n,q=map(int,input().split()) # (0): n=8, q=3\ns=input() # (1): s=ACACTACG\nV=[0]*n # (2): V=[0, 0, 0, 0, 0, 0, 0, 0]\nX=[] # (3): X=[]\nfor i in range(q): # (4): i=0 (7): i=1 ... (13): NO CHANGE\n l,r=map(int,input().split()) # (5): l=1, r=7 (8): r=4 (11): l=2, r=8\n X.append([l,r]) # (6): X=[[1, 7]] (9): X (12): X\n\nfor i in range(n-1): # (14): i=0 (17): i=1 ... (31): NO CHANGE\n if s[i:i+2]=='AC': # (15): NO CHANGE (18): NO CHANGE ... (30): NO CHANGE\n V[i]+=1 # (16): V=[1, 0, 0, 0, 0, 0, 0, 0] (21): V=[1, 0, 1, 0, 0, 0, 0, 0] (28): V=[1, 0, 1, 0, 0, 1, 0, 0]\n\nfor i in range(q): # (32): i=0 (35): i=1 ... (41): NO CHANGE\n ans=sum(V[X[i][0]-1:X[i][1]]) # (33): ans=3 (36): ans=2 (39): NO CHANGE\n if V[X[i][1]-1]==1: # (34): NO CHANGE (37): NO CHANGE (40): NO CHANGE\n ans-=1\nprint(ans)"], "anno_status": [true], "diff_content": " n,q=map(int,input().split())\n-s=input()\n-V=[0]*n\n-X=[]\n+s=input()+'Z'\n+A=[0]*(n+1)\n+cnt=0\n+for i in range(n):\n+ A[i]=cnt\n+ if s[i]=='A' and s[i+1]=='C':\n+ cnt+=1\n+ANS=[]\n for i in range(q):\n l,r=map(int,input().split())\n- X.append([l,r])\n-\n-for i in range(n-1):\n- if s[i:i+2]=='AC':\n- V[i]+=1\n-\n-for i in range(q):\n- ans=sum(V[X[i][0]-1:X[i][1]])\n- if V[X[i][1]-1]==1:\n- ans-=1\n-print(ans)\n+ ANS.append(A[r-1]-A[l-1])\n+for ans in ANS:\n+ print(ans)\n", "FL_content": " n,q=map(int,input().split())\n-s=input()\n-V=[0]*n\n-X=[]\n for i in range(q):\n l,r=map(int,input().split())\n- X.append([l,r])\n-\n-for i in range(n-1):\n- if s[i:i+2]=='AC':\n- V[i]+=1\n-\n-for i in range(q):\n- ans=sum(V[X[i][0]-1:X[i][1]])\n- if V[X[i][1]-1]==1:\n- ans-=1\n-print(ans)\n", "added_lines": 11, "removed_lines": 14, "code1_lines": 17 }, { "user_id": "u752774573", "problem_id": "p03087", "submission1_id": "s389382922", "submission2_id": "s738016607", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,Q=list(map(int, input().split()))\nS=input()\n\n\ndp=[[False, 0] for _ in range(N+1)]\nfor i in range(1,N+1):\n if S[i-1]=='A':\n dp[i][0]=True\n dp[i][1]=dp[i-1][1]\n elif S[i-1]=='C':\n dp[i][1]=dp[i-1][1]+int(dp[i-1][0])\n else:\n dp[i][1]=dp[i-1][1]\nprint(dp)\n\n\nfor i in range(Q):\n l,r=list(map(int, input().split()))\n l-=1\n print(dp[r][1]-dp[l][1]-int(dp[l][0]*(1-dp[l+1][0])))", "code2": "N,Q=list(map(int, input().split()))\nS=input()\n\ndp=[[0]*2 for _ in range(N)]\nif S[0]=='A':\n dp[0][1]=1\n\nfor i in range(1,N):\n if S[i]=='C':\n dp[i][0]=dp[i-1][0]+dp[i-1][1]\n elif S[i]=='A':\n dp[i][0]=dp[i-1][0]\n dp[i][1]=1\n else:\n dp[i][0]=dp[i-1][0]\n\n\nfor i in range(Q):\n l,r=list(map(int, input().split()))\n if l==1:\n print(dp[r-1][0]) \n elif S[l-2]=='A' and S[l-1]=='C':\n print(dp[r-1][0]-dp[l-2][0]-1)\n else:\n print(dp[r-1][0]-dp[l-2][0])", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597649886", "date2": "1598130575", "bleu_score": "0.6903859938508321", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACBCTADG\n6 1\n2 3\n1 6\n", "actual_output": "[[False, 0], [True, 0], [False, 1], [False, 1], [False, 1], [False, 1], [True, 1], [False, 1], [False, 1]]\n-1\n0\n1\n", "expected_output": "-1\n0\n1\n\n", "anno_code": ["N,Q=list(map(int, input().split())) # (0): N=8, Q=3\nS=input() # (1): S=ACBCTADG\n\n\ndp=[[False, 0] for _ in range(N+1)] # (2): dp\nfor i in range(1,N+1): # (3): i=1 (7): i=2 ... (35): NO CHANGE\n if S[i-1]=='A': # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n dp[i][0]=True # (5): dp (25): dp\n dp[i][1]=dp[i-1][1] # (6): NO CHANGE (26): dp\n elif S[i-1]=='C': # (9): NO CHANGE (13): NO CHANGE ... (33): NO CHANGE\n dp[i][1]=dp[i-1][1]+int(dp[i-1][0]) # (10): dp (18): dp\n else:\n dp[i][1]=dp[i-1][1] # (14): dp (22): dp ... (34): dp\nprint(dp) # (36): NO CHANGE\n\n\nfor i in range(Q): # (37): i=0 (41): i=1 (45): i=2\n l,r=list(map(int, input().split())) # (38): l=6, r=1 (42): l=2, r=3 (46): r=6\n l-=1 # (39): l=5 (43): l=1 (47): l=0\n print(dp[r][1]-dp[l][1]-int(dp[l][0]*(1-dp[l+1][0]))) # (40): NO CHANGE (44): NO CHANGE (48): NO CHANGE\n"], "anno_status": [true], "diff_content": " N,Q=list(map(int, input().split()))\n S=input()\n \n+dp=[[0]*2 for _ in range(N)]\n+if S[0]=='A':\n+ dp[0][1]=1\n \n-dp=[[False, 0] for _ in range(N+1)]\n-for i in range(1,N+1):\n- if S[i-1]=='A':\n- dp[i][0]=True\n- dp[i][1]=dp[i-1][1]\n- elif S[i-1]=='C':\n- dp[i][1]=dp[i-1][1]+int(dp[i-1][0])\n+for i in range(1,N):\n+ if S[i]=='C':\n+ dp[i][0]=dp[i-1][0]+dp[i-1][1]\n+ elif S[i]=='A':\n+ dp[i][0]=dp[i-1][0]\n+ dp[i][1]=1\n else:\n- dp[i][1]=dp[i-1][1]\n-print(dp)\n+ dp[i][0]=dp[i-1][0]\n \n \n for i in range(Q):\n l,r=list(map(int, input().split()))\n- l-=1\n- print(dp[r][1]-dp[l][1]-int(dp[l][0]*(1-dp[l+1][0])))\n+ if l==1:\n+ print(dp[r-1][0]) \n+ elif S[l-2]=='A' and S[l-1]=='C':\n+ print(dp[r-1][0]-dp[l-2][0]-1)\n+ else:\n+ print(dp[r-1][0]-dp[l-2][0])\n", "FL_content": " N,Q=list(map(int, input().split()))\n S=input()\n \n \n-dp=[[False, 0] for _ in range(N+1)]\n-for i in range(1,N+1):\n- if S[i-1]=='A':\n- dp[i][0]=True\n- dp[i][1]=dp[i-1][1]\n- elif S[i-1]=='C':\n- dp[i][1]=dp[i-1][1]+int(dp[i-1][0])\n else:\n- dp[i][1]=dp[i-1][1]\n-print(dp)\n \n \n for i in range(Q):\n l,r=list(map(int, input().split()))\n- l-=1\n- print(dp[r][1]-dp[l][1]-int(dp[l][0]*(1-dp[l+1][0])))\n", "added_lines": 16, "removed_lines": 11, "code1_lines": 20 }, { "user_id": "u752774573", "problem_id": "p03087", "submission1_id": "s130037485", "submission2_id": "s738016607", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,Q=list(map(int, input().split()))\nS=input()\n\n\ndp=[[False, 0] for _ in range(N+1)]\nfor i in range(1,N+1):\n if S[i-1]=='A':\n dp[i][0]=True\n dp[i][1]=dp[i-1][1]\n elif S[i-1]=='C':\n dp[i][1]=dp[i-1][1]+int(dp[i-1][0])\n else:\n dp[i][1]=dp[i-1][1]\n\n\n\nfor i in range(Q):\n l,r=list(map(int, input().split()))\n l-=1\n print(dp[r][1]-dp[l][1]-int(dp[l][0]))", "code2": "N,Q=list(map(int, input().split()))\nS=input()\n\ndp=[[0]*2 for _ in range(N)]\nif S[0]=='A':\n dp[0][1]=1\n\nfor i in range(1,N):\n if S[i]=='C':\n dp[i][0]=dp[i-1][0]+dp[i-1][1]\n elif S[i]=='A':\n dp[i][0]=dp[i-1][0]\n dp[i][1]=1\n else:\n dp[i][0]=dp[i-1][0]\n\n\nfor i in range(Q):\n l,r=list(map(int, input().split()))\n if l==1:\n print(dp[r-1][0]) \n elif S[l-2]=='A' and S[l-1]=='C':\n print(dp[r-1][0]-dp[l-2][0]-1)\n else:\n print(dp[r-1][0]-dp[l-2][0])", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597649538", "date2": "1598130575", "bleu_score": "0.671980314371187", "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], "code1_test_score": 100, "total_score": 101, "input": "8 3\nGAATCCCA\n3 7\n3 3\n2 8\n", "actual_output": "-1\n-1\n0\n", "expected_output": "0\n0\n0\n\n", "anno_code": ["N,Q=list(map(int, input().split())) # (0): N=8, Q=3\nS=input() # (1): S=GAATCCCA\n\n\ndp=[[False, 0] for _ in range(N+1)] # (2): dp\nfor i in range(1,N+1): # (3): i=1 (7): i=2 ... (35): NO CHANGE\n if S[i-1]=='A': # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n dp[i][0]=True # (9): dp=[[False, 0], [False, 0], [True, 0], [False, 0], [False, 0], [False, 0], [False, 0], [False, 0], [False, 0]] (13): dp (33): dp\n dp[i][1]=dp[i-1][1] # (10): NO CHANGE (14): NO CHANGE (34): NO CHANGE\n elif S[i-1]=='C': # (5): NO CHANGE (17): NO CHANGE ... (29): NO CHANGE\n dp[i][1]=dp[i-1][1]+int(dp[i-1][0]) # (22): NO CHANGE (26): NO CHANGE (30): NO CHANGE\n else:\n dp[i][1]=dp[i-1][1] # (6): NO CHANGE (18): NO CHANGE\n\n\n\nfor i in range(Q): # (36): i=0 (40): i=1 (44): i=2\n l,r=list(map(int, input().split())) # (37): l=3, r=7 (41): l=3, r=3 (45): r=8\n l-=1 # (38): l=2 (42): l=2 (46): l=1\n print(dp[r][1]-dp[l][1]-int(dp[l][0])) # (39): NO CHANGE (43): NO CHANGE (47): NO CHANGE\n"], "anno_status": [true], "diff_content": " N,Q=list(map(int, input().split()))\n S=input()\n \n+dp=[[0]*2 for _ in range(N)]\n+if S[0]=='A':\n+ dp[0][1]=1\n \n-dp=[[False, 0] for _ in range(N+1)]\n-for i in range(1,N+1):\n- if S[i-1]=='A':\n- dp[i][0]=True\n- dp[i][1]=dp[i-1][1]\n- elif S[i-1]=='C':\n- dp[i][1]=dp[i-1][1]+int(dp[i-1][0])\n+for i in range(1,N):\n+ if S[i]=='C':\n+ dp[i][0]=dp[i-1][0]+dp[i-1][1]\n+ elif S[i]=='A':\n+ dp[i][0]=dp[i-1][0]\n+ dp[i][1]=1\n else:\n- dp[i][1]=dp[i-1][1]\n-\n+ dp[i][0]=dp[i-1][0]\n \n \n for i in range(Q):\n l,r=list(map(int, input().split()))\n- l-=1\n- print(dp[r][1]-dp[l][1]-int(dp[l][0]))\n+ if l==1:\n+ print(dp[r-1][0]) \n+ elif S[l-2]=='A' and S[l-1]=='C':\n+ print(dp[r-1][0]-dp[l-2][0]-1)\n+ else:\n+ print(dp[r-1][0]-dp[l-2][0])\n", "FL_content": " N,Q=list(map(int, input().split()))\n S=input()\n \n \n-dp=[[False, 0] for _ in range(N+1)]\n-for i in range(1,N+1):\n- if S[i-1]=='A':\n- dp[i][0]=True\n- dp[i][1]=dp[i-1][1]\n- elif S[i-1]=='C':\n- dp[i][1]=dp[i-1][1]+int(dp[i-1][0])\n else:\n- dp[i][1]=dp[i-1][1]\n-\n \n \n for i in range(Q):\n l,r=list(map(int, input().split()))\n- l-=1\n- print(dp[r][1]-dp[l][1]-int(dp[l][0]))\n", "added_lines": 16, "removed_lines": 11, "code1_lines": 20 }, { "user_id": "u255067135", "problem_id": "p03087", "submission1_id": "s501450188", "submission2_id": "s097825973", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, Q = map(int, input().split())\nS = str(input())\n\ncount = [0]*(N)\nfor i in range(1, N):\n if S[i]=='C' and S[i-1]=='A':\n count[i] = count[i-1] + 1\n else:\n count[i] = count[i-1]\nprint(count)\nLR = [list(map(int, input().split())) for _ in range(Q)]\nfor l, r in LR:\n print(count[r-1]-count[l-1])", "code2": "N, Q = map(int, input().split())\nS = str(input())\nLR = [list(map(int, input().split())) for _ in range(Q)]\n\ncount = [0]*(N)\nfor i in range(1, N):\n if S[i]=='C' and S[i-1]=='A':\n count[i] = count[i-1] + 1\n else:\n count[i] = count[i-1]\nfor l, r in LR:\n print(count[r-1]-count[l-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553467139", "date2": "1553467257", "bleu_score": "0.953850682389896", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nACACTACG\n1 7\n8 5\n1 5\n", "actual_output": "[0, 1, 1, 2, 2, 2, 3, 3]\n3\n-1\n2\n", "expected_output": "3\n-1\n2\n\n", "anno_code": ["N, Q = map(int, input().split()) # (0): N=8, Q=3\nS = str(input()) # (1): S=ACACTACG\n\ncount = [0]*(N) # (2): count=[0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(1, N): # (3): i=1 (6): i=2 ... (24): NO CHANGE\n if S[i]=='C' and S[i-1]=='A': # (4): NO CHANGE (7): NO CHANGE ... (22): NO CHANGE\n count[i] = count[i-1] + 1 # (5): count=[0, 1, 0, 0, 0, 0, 0, 0] (11): count=[0, 1, 1, 2, 0, 0, 0, 0] (20): count=[0, 1, 1, 2, 2, 2, 3, 0]\n else:\n count[i] = count[i-1] # (8): count=[0, 1, 1, 0, 0, 0, 0, 0] (14): count=[0, 1, 1, 2, 2, 0, 0, 0] ... (23): count=[0, 1, 1, 2, 2, 2, 3, 3]\nprint(count) # (25): NO CHANGE\nLR = [list(map(int, input().split())) for _ in range(Q)] # (26): LR\nfor l, r in LR: # (27): l=1, r=7 (29): l=8, r=5 (31): l=1\n print(count[r-1]-count[l-1]) # (28): NO CHANGE (30): NO CHANGE (32): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, Q = map(int, input().split())\n S = str(input())\n+LR = [list(map(int, input().split())) for _ in range(Q)]\n \n count = [0]*(N)\n for i in range(1, N):\n if S[i]=='C' and S[i-1]=='A':\n count[i] = count[i-1] + 1\n else:\n count[i] = count[i-1]\n-print(count)\n-LR = [list(map(int, input().split())) for _ in range(Q)]\n for l, r in LR:\n print(count[r-1]-count[l-1])\n", "FL_content": " N, Q = map(int, input().split())\n S = str(input())\n \n count = [0]*(N)\n for i in range(1, N):\n if S[i]=='C' and S[i-1]=='A':\n count[i] = count[i-1] + 1\n else:\n count[i] = count[i-1]\n-print(count)\n-LR = [list(map(int, input().split())) for _ in range(Q)]\n for l, r in LR:\n print(count[r-1]-count[l-1])\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u997113115", "problem_id": "p03087", "submission1_id": "s850352580", "submission2_id": "s603815645", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, Q = map(int, input().split())\nS = input()\nflag = True\nR = [0]*N\na = 0\nfor i in range(N):\n s = S[i]\n if s == \"A\":\n flag = True\n elif s == \"C\" and flag:\n a += 1\n flag = False\n else:\n flag = False\n R[i] = a\nprint(R)\nfor i in range(Q):\n l, r = map(int, input().split())\n print(R[r-1] - R[l-1])\n", "code2": "N, Q = map(int, input().split())\nS = input()\nflag = True\nR = [0]*N\na = 0\nfor i in range(N):\n s = S[i]\n if s == \"A\":\n flag = True\n elif s == \"C\" and flag:\n a += 1\n flag = False\n else:\n flag = False\n R[i] = a\nfor i in range(Q):\n l, r = map(int, input().split())\n print(R[r-1] - R[l-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566518917", "date2": "1566518924", "bleu_score": "0.9711219574082762", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\nGCBTCACA\n3 6\n8 3\n2 1\n", "actual_output": "[0, 0, 0, 0, 0, 0, 1, 1]\n0\n-1\n0\n", "expected_output": "0\n-1\n0\n\n", "anno_code": ["N, Q = map(int, input().split()) # (0): N=8, Q=3\nS = input() # (1): S=GCBTCACA\nflag = True # (2): flag=True\nR = [0]*N # (3): R=[0, 0, 0, 0, 0, 0, 0, 0]\na = 0 # (4): a=0\nfor i in range(N): # (5): i=0 (11): i=1 ... (52): NO CHANGE\n s = S[i] # (6): s=G (12): s=C ... (48): s=A\n if s == \"A\": # (7): NO CHANGE (13): NO CHANGE ... (49): NO CHANGE\n flag = True # (38): flag=True (50): flag=True\n elif s == \"C\" and flag: # (8): NO CHANGE (14): NO CHANGE ... (43): NO CHANGE\n a += 1 # (44): a=1\n flag = False # (45): flag=False\n else:\n flag = False # (9): flag=False (15): NO CHANGE ... (33): NO CHANGE\n R[i] = a # (10): NO CHANGE (16): NO CHANGE ... (51): R=[0, 0, 0, 0, 0, 0, 1, 1]\nprint(R) # (53): NO CHANGE\nfor i in range(Q): # (54): i=0 (57): i=1 (60): i=2\n l, r = map(int, input().split()) # (55): l=3, r=6 (58): l=8, r=3 (61): l=2, r=1\n print(R[r-1] - R[l-1]) # (56): NO CHANGE (59): NO CHANGE (62): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, Q = map(int, input().split())\n S = input()\n flag = True\n R = [0]*N\n a = 0\n for i in range(N):\n s = S[i]\n if s == \"A\":\n flag = True\n elif s == \"C\" and flag:\n a += 1\n flag = False\n else:\n flag = False\n R[i] = a\n-print(R)\n for i in range(Q):\n l, r = map(int, input().split())\n print(R[r-1] - R[l-1])\n \n", "FL_content": " N, Q = map(int, input().split())\n S = input()\n flag = True\n R = [0]*N\n a = 0\n for i in range(N):\n s = S[i]\n if s == \"A\":\n flag = True\n elif s == \"C\" and flag:\n a += 1\n flag = False\n else:\n flag = False\n R[i] = a\n-print(R)\n for i in range(Q):\n l, r = map(int, input().split())\n print(R[r-1] - R[l-1])\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u497592162", "problem_id": "p02660", "submission1_id": "s643464177", "submission2_id": "s369644646", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\ndef is_prime(n):\n for i in range(2, int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n return True\n\ndef getPrimeExp(n):\n n_sqrt = int(math.sqrt(n))\n array = [True]*(n_sqrt+1)\n result = []\n for i in range(2, n_sqrt+1):\n if array[i]:\n array[i] = False\n result.append(i)\n for j in range(2, n_sqrt+1):\n ij = i**j\n if ij <= n_sqrt and array[ij]:\n result.append(ij)\n array[ij] = False\n elif ij > n:\n break\n for j in range(i*2, n_sqrt+1, i):\n array[j] = False\n\n \n \n \n \n \n return sorted(result)\n\nN = int(input())\nif N == 1:\n print(0)\nelif is_prime(N) and N != 1:\n print(1)\nelse:\n cnt = 0\n primeExp = getPrimeExp(N) \n n = N\n \n for z in primeExp:\n if n%z == 0:\n n = int(n/z)\n cnt += 1\n print(cnt)", "code2": "import math\n\n\ndef is_prime(n):\n for i in range(2, int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n return True \n\n\ndef getPrime(n):\n n_sqrt = int(math.sqrt(n))\n array = [True]*(n_sqrt+1)\n result = []\n for i in range(2, n_sqrt+1):\n if array[i]:\n array[i] = False\n result.append(i)\n for j in range(i*2, n_sqrt+1, i):\n array[j] = False\n return result\n\nN = int(input())\nn = N\nprime = getPrime(n)\nprime_exp = []\n\nfor p in prime:\n cnt = 0\n while n%p == 0:\n n = int(n/p)\n \n cnt += 1\n if cnt != 0:\n prime_exp.append([p, cnt])\nif is_prime(n) and n != 1:\n prime_exp.append([n, 1])\nans = 0\nfor pe in prime_exp:\n ans += int((-1+math.sqrt(1+8*pe[1]))/2)\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595086593", "date2": "1595181159", "bleu_score": "0.6306566991870267", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 24, "total_score": 67, "input": "4967510134\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n \n \n def is_prime(n):\n for i in range(2, int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n- return True\n+ return True \n \n-def getPrimeExp(n):\n+\n+def getPrime(n):\n n_sqrt = int(math.sqrt(n))\n array = [True]*(n_sqrt+1)\n result = []\n for i in range(2, n_sqrt+1):\n if array[i]:\n array[i] = False\n result.append(i)\n- for j in range(2, n_sqrt+1):\n- ij = i**j\n- if ij <= n_sqrt and array[ij]:\n- result.append(ij)\n- array[ij] = False\n- elif ij > n:\n- break\n for j in range(i*2, n_sqrt+1, i):\n array[j] = False\n-\n- \n- \n- \n- \n- \n- return sorted(result)\n+ return result\n \n N = int(input())\n-if N == 1:\n- print(0)\n-elif is_prime(N) and N != 1:\n- print(1)\n-else:\n+n = N\n+prime = getPrime(n)\n+prime_exp = []\n+\n+for p in prime:\n cnt = 0\n- primeExp = getPrimeExp(N) \n- n = N\n- \n- for z in primeExp:\n- if n%z == 0:\n- n = int(n/z)\n- cnt += 1\n- print(cnt)\n+ while n%p == 0:\n+ n = int(n/p)\n+ \n+ cnt += 1\n+ if cnt != 0:\n+ prime_exp.append([p, cnt])\n+if is_prime(n) and n != 1:\n+ prime_exp.append([n, 1])\n+ans = 0\n+for pe in prime_exp:\n+ ans += int((-1+math.sqrt(1+8*pe[1]))/2)\n+print(ans)\n", "FL_content": " import math\n \n \n def is_prime(n):\n for i in range(2, int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n- return True\n \n-def getPrimeExp(n):\n n_sqrt = int(math.sqrt(n))\n array = [True]*(n_sqrt+1)\n result = []\n for i in range(2, n_sqrt+1):\n if array[i]:\n array[i] = False\n result.append(i)\n- for j in range(2, n_sqrt+1):\n- ij = i**j\n- if ij <= n_sqrt and array[ij]:\n- result.append(ij)\n- array[ij] = False\n- elif ij > n:\n- break\n for j in range(i*2, n_sqrt+1, i):\n array[j] = False\n-\n- \n- \n- \n- \n- \n- return sorted(result)\n \n N = int(input())\n-if N == 1:\n- print(0)\n-elif is_prime(N) and N != 1:\n- print(1)\n-else:\n cnt = 0\n- primeExp = getPrimeExp(N) \n- n = N\n- \n- for z in primeExp:\n- if n%z == 0:\n- n = int(n/z)\n- cnt += 1\n- print(cnt)\n", "added_lines": 21, "removed_lines": 29, "code1_lines": 49 }, { "user_id": "u626891113", "problem_id": "p02660", "submission1_id": "s529730160", "submission2_id": "s316351936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nn = int(input())\nans = 0\ndef primes(n):\n is_p = [True]*(n + 1)\n is_p[0] = False\n is_p[1] = False\n for i in range(2, int(n**0.5)+1):\n if not is_p[i]:\n continue\n for j in range(i*2, n+1, i):\n is_p[j] = False\n return [i for i in range(n+1) if is_p[i]]\n\np = primes(10**6)\n\ndp = []\ncl = []\nn1 = n\nfor i in p:\n if n%i == 0:\n cl.append(i)\n while n%i == 0:\n n = n/i\n dp.append(i)\n if n == 1:\n break\n if n == n1:\n ans = 1\n\nc = Counter(dp)\n\n\nfor i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \nprint(ans)\n", "code2": "from collections import Counter\nn = int(input())\nans = 0\n\ndp = []\ncl = []\nn1 = n\nif n == 1:\n ans = 0\nelse:\n for i in range(2, int(n**0.5)+1):\n if n%i == 0:\n cl.append(i)\n while n%i == 0:\n n = n/i\n dp.append(i)\n if n == 1:\n break\n if n != 1:\n ans = 1\n\nc = Counter(dp)\n\nfor i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593927166", "date2": "1593931324", "bleu_score": "0.6314625292099728", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 36, "total_score": 67, "input": "1130063570614\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import Counter\n n = int(input())\n ans = 0\n-def primes(n):\n- is_p = [True]*(n + 1)\n- is_p[0] = False\n- is_p[1] = False\n- for i in range(2, int(n**0.5)+1):\n- if not is_p[i]:\n- continue\n- for j in range(i*2, n+1, i):\n- is_p[j] = False\n- return [i for i in range(n+1) if is_p[i]]\n-\n-p = primes(10**6)\n \n dp = []\n cl = []\n n1 = n\n-for i in p:\n- if n%i == 0:\n- cl.append(i)\n- while n%i == 0:\n- n = n/i\n- dp.append(i)\n- if n == 1:\n- break\n- if n == n1:\n+if n == 1:\n+ ans = 0\n+else:\n+ for i in range(2, int(n**0.5)+1):\n+ if n%i == 0:\n+ cl.append(i)\n+ while n%i == 0:\n+ n = n/i\n+ dp.append(i)\n+ if n == 1:\n+ break\n+ if n != 1:\n ans = 1\n \n c = Counter(dp)\n \n-\n for i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \n print(ans)\n \n", "FL_content": " from collections import Counter\n n = int(input())\n ans = 0\n-def primes(n):\n- is_p = [True]*(n + 1)\n- is_p[0] = False\n- is_p[1] = False\n- for i in range(2, int(n**0.5)+1):\n- if not is_p[i]:\n- continue\n- for j in range(i*2, n+1, i):\n- is_p[j] = False\n- return [i for i in range(n+1) if is_p[i]]\n-\n-p = primes(10**6)\n \n dp = []\n cl = []\n n1 = n\n-for i in p:\n- if n%i == 0:\n- cl.append(i)\n- while n%i == 0:\n- n = n/i\n- dp.append(i)\n- if n == 1:\n- break\n- if n == n1:\n ans = 1\n \n c = Counter(dp)\n \n-\n for i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \n print(ans)\n \n", "added_lines": 12, "removed_lines": 22, "code1_lines": 42 }, { "user_id": "u602773379", "problem_id": "p02660", "submission1_id": "s652081916", "submission2_id": "s069754836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\ndef prime(num):\n\tarray=[]\n\ttmp=int(math.sqrt(n))+1\n\tfor i in range(2,tmp):\n\t\twhile num % i == 0:\n\t\t\tnum/=i\n\t\t\tarray.append(i)\n\t\n\t\n\tif array==[]:\n\t\treturn [num]\n\telse:\n\t\tif n>1:\n\t\t\tarray.append(int(n))\n\t\treturn array\n\nn=int(input())\nP=prime(n)\nP=sorted(P)\n\n\nif 1 in P:\n\tprint(0)\nelse:\n\tans=0\n\ttmp=0\n\tfor i in range(0,len(P)):\n\t\tif i==0:\n\t\t\ttmp=P[i] \n\t\telif P[i]==P[i-1]:\n\t\t\ttmp*=P[i]\n\t\telse:\n\t\t\ttmp=P[i]\n\n\t\tif n%tmp==0:\n\t\t\tn/=tmp\n\t\t\tans+=1\n\tprint(ans)", "code2": "import math\n\ndef prime(num):\n\tarray=[]\n\ttmp=int(math.sqrt(n))+1\n\tfor i in range(2,tmp):\n\t\twhile num % i == 0:\n\t\t\tnum/=i\n\t\t\tarray.append(i)\n\t\n\t\n\tif array==[]:\n\t\treturn [num]\n\telse:\n\t\tif num>1:\n\t\t\tarray.append(int(num))\n\t\treturn array\n\nn=int(input())\nP=prime(n)\nP=sorted(P)\nnum=n\nif 1 in P:\n\tprint(0)\nelse:\n\tans=0\n\ttmp=0\n\tfor i in range(0,len(P)):\n\t\tif i==0:\n\t\t\ttmp=P[i] \n\t\telif P[i]==P[i-1]:\n\t\t\ttmp*=P[i]\n\t\telse:\n\t\t\ttmp=P[i]\n\t\t\tnum=n\n\t\tif num%tmp==0:\n\t\t\tnum/=tmp\n\t\t\tans+=1\n\t\t\t\n\tprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599494871", "date2": "1599495794", "bleu_score": "0.929277983184272", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 24, "total_score": 67, "input": "61026366052\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n \n-\n def prime(num):\n \tarray=[]\n \ttmp=int(math.sqrt(n))+1\n \tfor i in range(2,tmp):\n \t\twhile num % i == 0:\n \t\t\tnum/=i\n \t\t\tarray.append(i)\n \t\n \t\n \tif array==[]:\n \t\treturn [num]\n \telse:\n-\t\tif n>1:\n-\t\t\tarray.append(int(n))\n+\t\tif num>1:\n+\t\t\tarray.append(int(num))\n \t\treturn array\n \n n=int(input())\n P=prime(n)\n P=sorted(P)\n-\n-\n+num=n\n if 1 in P:\n \tprint(0)\n else:\n \tans=0\n \ttmp=0\n \tfor i in range(0,len(P)):\n \t\tif i==0:\n \t\t\ttmp=P[i] \n \t\telif P[i]==P[i-1]:\n \t\t\ttmp*=P[i]\n \t\telse:\n \t\t\ttmp=P[i]\n-\n-\t\tif n%tmp==0:\n-\t\t\tn/=tmp\n+\t\t\tnum=n\n+\t\tif num%tmp==0:\n+\t\t\tnum/=tmp\n \t\t\tans+=1\n+\t\t\t\n \tprint(ans)\n", "FL_content": " import math\n \n-\n def prime(num):\n \tarray=[]\n \ttmp=int(math.sqrt(n))+1\n \tfor i in range(2,tmp):\n \t\twhile num % i == 0:\n \t\t\tnum/=i\n \t\t\tarray.append(i)\n \t\n \t\n \tif array==[]:\n \t\treturn [num]\n \telse:\n-\t\tif n>1:\n-\t\t\tarray.append(int(n))\n \t\treturn array\n \n n=int(input())\n P=prime(n)\n P=sorted(P)\n-\n-\n if 1 in P:\n \tprint(0)\n else:\n \tans=0\n \ttmp=0\n \tfor i in range(0,len(P)):\n \t\tif i==0:\n \t\t\ttmp=P[i] \n \t\telif P[i]==P[i-1]:\n \t\t\ttmp*=P[i]\n \t\telse:\n \t\t\ttmp=P[i]\n-\n-\t\tif n%tmp==0:\n-\t\t\tn/=tmp\n \t\t\tans+=1\n \tprint(ans)\n", "added_lines": 7, "removed_lines": 8, "code1_lines": 41 }, { "user_id": "u958820283", "problem_id": "p02660", "submission1_id": "s954208260", "submission2_id": "s956910164", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na={}\ntemp=n\nfor i in range(2,int(n**0.5)+1):\n if temp % i ==0:\n count=0\n while temp % (i**(count+1)) ==0:\n count+=1\n temp= temp/(i**count)\n a[i]=count\n\nsum=0\nfor i in a:\n jisu= a[i]\n temp= int((2*jisu)**0.5)-1\n if temp*(temp+1) > 2*jisu:\n sum+= temp-1\n elif (temp+1)*(temp+2) > 2*jisu:\n sum+= temp\n elif (temp+2)*(temp+3)> 2*jisu:\n sum+= temp+1\nprint(sum) \n ", "code2": "n=int(input())\na={}\ntemp=n\nfor i in range(2,int(n**0.5)+1):\n if temp % i ==0:\n count=0\n while temp % (i**(count+1)) ==0:\n count+=1\n temp= temp/(i**count)\n a[i]=count\nif temp !=1:\n a[temp]=1\n\nsum=0\nfor i in a:\n jisu= a[i]\n temp=1\n while temp*(temp+1)/2<= jisu:\n temp+=1\n sum+= temp-1\nprint(sum)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590977003", "date2": "1590978176", "bleu_score": "0.6678071919778692", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0], "code1_test_score": 21, "total_score": 67, "input": "2526532339\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n=int(input())\n a={}\n temp=n\n for i in range(2,int(n**0.5)+1):\n if temp % i ==0:\n count=0\n while temp % (i**(count+1)) ==0:\n count+=1\n temp= temp/(i**count)\n a[i]=count\n+if temp !=1:\n+ a[temp]=1\n \n sum=0\n for i in a:\n- jisu= a[i]\n- temp= int((2*jisu)**0.5)-1\n- if temp*(temp+1) > 2*jisu:\n- sum+= temp-1\n- elif (temp+1)*(temp+2) > 2*jisu:\n- sum+= temp\n- elif (temp+2)*(temp+3)> 2*jisu:\n- sum+= temp+1\n-print(sum) \n- \n+ jisu= a[i]\n+ temp=1\n+ while temp*(temp+1)/2<= jisu:\n+ temp+=1\n+ sum+= temp-1\n+print(sum)\n", "FL_content": " n=int(input())\n a={}\n temp=n\n for i in range(2,int(n**0.5)+1):\n if temp % i ==0:\n count=0\n while temp % (i**(count+1)) ==0:\n count+=1\n temp= temp/(i**count)\n a[i]=count\n \n sum=0\n for i in a:\n- jisu= a[i]\n- temp= int((2*jisu)**0.5)-1\n- if temp*(temp+1) > 2*jisu:\n- sum+= temp-1\n- elif (temp+1)*(temp+2) > 2*jisu:\n- sum+= temp\n- elif (temp+2)*(temp+3)> 2*jisu:\n- sum+= temp+1\n-print(sum) \n- \n", "added_lines": 8, "removed_lines": 10, "code1_lines": 23 }, { "user_id": "u945199633", "problem_id": "p02660", "submission1_id": "s152798109", "submission2_id": "s815322852", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nN_prime = []\n\nn = N\ni = 2\nwhile i <= N**0.5:\n if n%i != 0:\n i += 1\n continue\n \n N_prime.append(i)\n n = n/i\n if n == 1:\n break\n\nif N_prime == []:\n N_prime.append(N)\nelif n != 1:\n N_prime.append(int(n))\n\nct = []\nfor i in N_prime:\n if i not in ct:\n ct.append(i)\n temp_i = 1\n continue\n temp_i *= i\n if temp_i not in ct:\n ct.append(temp_i)\n temp_i = i\n continue\n\nprint(len(ct))", "code2": "N = int(input())\nN_prime = []\n\nn = N\ni = 2\nwhile i <= N**0.5:\n if n%i != 0:\n i += 1\n continue\n \n N_prime.append(i)\n n = n/i\n if n == 1:\n break\n\nif N_prime == [] and N != 1:\n N_prime.append(N)\nelif n != 1:\n N_prime.append(int(n))\n\nct = []\nfor i in N_prime:\n if i not in ct:\n ct.append(i)\n temp_i = 1\n continue\n temp_i *= i\n if temp_i not in ct:\n ct.append(temp_i)\n temp_i = 1\n continue\n\nprint(len(ct))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1591478986", "date2": "1591480077", "bleu_score": "0.969459669634259", "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, 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": 66, "total_score": 67, "input": "153897766656\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N = int(input())\n N_prime = []\n \n n = N\n i = 2\n while i <= N**0.5:\n if n%i != 0:\n i += 1\n continue\n \n N_prime.append(i)\n n = n/i\n if n == 1:\n break\n \n-if N_prime == []:\n+if N_prime == [] and N != 1:\n N_prime.append(N)\n elif n != 1:\n N_prime.append(int(n))\n \n ct = []\n for i in N_prime:\n if i not in ct:\n ct.append(i)\n temp_i = 1\n continue\n temp_i *= i\n if temp_i not in ct:\n ct.append(temp_i)\n- temp_i = i\n+ temp_i = 1\n continue\n \n print(len(ct))\n", "FL_content": " N = int(input())\n N_prime = []\n \n n = N\n i = 2\n while i <= N**0.5:\n if n%i != 0:\n i += 1\n continue\n \n N_prime.append(i)\n n = n/i\n if n == 1:\n break\n \n-if N_prime == []:\n N_prime.append(N)\n elif n != 1:\n N_prime.append(int(n))\n \n ct = []\n for i in N_prime:\n if i not in ct:\n ct.append(i)\n temp_i = 1\n continue\n temp_i *= i\n if temp_i not in ct:\n ct.append(temp_i)\n- temp_i = i\n continue\n \n print(len(ct))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 33 }, { "user_id": "u734195782", "problem_id": "p02660", "submission1_id": "s308421491", "submission2_id": "s925649010", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\ndef check(n):\n count = 0\n end = int(math.sqrt(n)+1)\n for i in range(2,end):\n if n%i==0:\n count += 1\n n/=i\n if n%i==0:\n l = 2\n count2 = 0\n while n%i==0:\n n/=i\n count2+=1\n if count2==l:\n count+=1\n count2=0\n l+=1\n if n==1:\n return 0\n if count==0:\n return 1\n else:\n return count \nn = int(input())\nans = check(n)\nprint(ans)", "code2": "import math\ndef check(n):\n count = 0\n end = int(math.sqrt(n)+1)\n for i in range(2,end):\n if n%i==0:\n count += 1\n n/=i\n if n%i==0:\n l = 2\n count2 = 0\n while n%i==0:\n n/=i\n count2+=1\n if count2==l:\n count+=1\n count2=0\n l+=1\n if n==1:\n return count\n if n==1:\n return 0\n if count==0:\n return 1\n else:\n return count+1 \nn = int(input())\nans = check(n)\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590985878", "date2": "1590985996", "bleu_score": "0.9221494401758733", "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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 67, "input": "55993645324\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n def check(n):\n count = 0\n end = int(math.sqrt(n)+1)\n for i in range(2,end):\n if n%i==0:\n count += 1\n n/=i\n if n%i==0:\n l = 2\n count2 = 0\n while n%i==0:\n n/=i\n count2+=1\n if count2==l:\n count+=1\n count2=0\n l+=1\n+ if n==1:\n+ return count\n if n==1:\n return 0\n if count==0:\n return 1\n else:\n- return count \n+ return count+1 \n n = int(input())\n ans = check(n)\n print(ans)\n", "FL_content": " import math\n def check(n):\n count = 0\n end = int(math.sqrt(n)+1)\n for i in range(2,end):\n if n%i==0:\n count += 1\n n/=i\n if n%i==0:\n l = 2\n count2 = 0\n while n%i==0:\n n/=i\n count2+=1\n if count2==l:\n count+=1\n count2=0\n l+=1\n if n==1:\n return 0\n if count==0:\n return 1\n else:\n- return count \n n = int(input())\n ans = check(n)\n print(ans)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u506910932", "problem_id": "p02660", "submission1_id": "s419625362", "submission2_id": "s868236248", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\n\ndef is_prime(n):\n if n == 1:\n return 0\n\n for k in range(2, int(math.sqrt(n)) + 1):\n if n % k == 0:\n if k not in check:\n check[k] = 0\n return n / k\n else:\n continue\n if n in check:\n return 0\n else:\n return 1\n\n\ncheck = {}\nn = int(input())\nif n == 1:\n print(0)\nelse:\n ans = 0\n while (1):\n n = is_prime(n)\n if n == 0:\n break\n else:\n ans += 1\n print(ans)\n", "code2": "import math\n\n\n\ndef is_prime(n):\n if n == 1:\n return 0\n\n for k in range(2, int(math.sqrt(n)) + 1):\n chk = False\n while (n % k == 0):\n chk = True\n n /= k\n if k not in check:\n check[k] = 1\n else:\n check[k] += 1\n if chk:\n return n\n if n in check:\n return 0\n else:\n check[n] = 1\n return 1\n\n\ncheck = {}\nn = int(input())\nif n == 1:\n print(0)\nelse:\n while (1):\n n = is_prime(n)\n if n == 0:\n break\n ans = 0\n for k, v in check.items():\n for i in range(1, 50):\n v -= i\n if v < 0:\n break\n else:\n ans += 1\n \n print(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592162583", "date2": "1592163978", "bleu_score": "0.673876524105727", "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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 64, "total_score": 67, "input": "233433753956\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["import math\n\n\n\ndef is_prime(n): # (0): is_prime=\n if n == 1: # (7): NO CHANGE (16): NO CHANGE ... (1053): math=, is_prime=, check={2: 0, 13: 0, 53: 0, 106: 0, 251: 0}, n=0, ans=6\n return 0\n\n for k in range(2, int(math.sqrt(n)) + 1): # (8): k=2 (17): k=2 ... (1047): NO CHANGE\n if n % k == 0: # (9): NO CHANGE (18): NO CHANGE ... (1046): NO CHANGE\n if k not in check: # (10): NO CHANGE (19): NO CHANGE ... (884): NO CHANGE\n check[k] = 0 # (11): math=, is_prime=, check={2: 0}, n=116716876978.0, ans=0 (44): math=, is_prime=, check={2: 0, 13: 0}, n=8978221306.0, ans=1 ... (885): math=, is_prime=, check={2: 0, 13: 0, 53: 0, 106: 0, 251: 0}, n=6367.0, ans=4\n return n / k\n else:\n continue # (20): NO CHANGE (53): NO CHANGE ... (270): NO CHANGE\n if n in check: # (1048): math=, is_prime=, check={2: 0, 13: 0, 53: 0, 106: 0, 251: 0}, n=1, ans=5\n return 0\n else:\n return 1\n\n\ncheck = {} # (1): check={}\nn = int(input()) # (2): n=233433753956\nif n == 1: # (3): NO CHANGE\n print(0)\nelse:\n ans = 0 # (4): ans=0\n while (1): # (5): NO CHANGE (14): NO CHANGE ... (1051): NO CHANGE\n n = is_prime(n) # (6): NO CHANGE (15): NO CHANGE ... (1052): NO CHANGE\n if n == 0: # (12): NO CHANGE (45): NO CHANGE ... (1054): NO CHANGE\n break # (1055): NO CHANGE\n else:\n ans += 1 # (13): ans=1 (46): ans=2 ... (1050): ans=6\n print(ans)\n"], "anno_status": [true], "diff_content": " import math\n \n \n \n def is_prime(n):\n if n == 1:\n return 0\n \n for k in range(2, int(math.sqrt(n)) + 1):\n- if n % k == 0:\n+ chk = False\n+ while (n % k == 0):\n+ chk = True\n+ n /= k\n if k not in check:\n- check[k] = 0\n- return n / k\n+ check[k] = 1\n else:\n- continue\n+ check[k] += 1\n+ if chk:\n+ return n\n if n in check:\n return 0\n else:\n+ check[n] = 1\n return 1\n \n \n check = {}\n n = int(input())\n if n == 1:\n print(0)\n else:\n- ans = 0\n while (1):\n n = is_prime(n)\n if n == 0:\n break\n- else:\n- ans += 1\n+ ans = 0\n+ for k, v in check.items():\n+ for i in range(1, 50):\n+ v -= i\n+ if v < 0:\n+ break\n+ else:\n+ ans += 1\n+ \n print(ans)\n \n", "FL_content": " import math\n \n \n \n def is_prime(n):\n if n == 1:\n return 0\n \n for k in range(2, int(math.sqrt(n)) + 1):\n- if n % k == 0:\n if k not in check:\n- check[k] = 0\n- return n / k\n else:\n- continue\n if n in check:\n return 0\n else:\n return 1\n \n \n check = {}\n n = int(input())\n if n == 1:\n print(0)\n else:\n- ans = 0\n while (1):\n n = is_prime(n)\n if n == 0:\n break\n- else:\n- ans += 1\n print(ans)\n \n", "added_lines": 18, "removed_lines": 7, "code1_lines": 35 }, { "user_id": "u602773379", "problem_id": "p02660", "submission1_id": "s514470095", "submission2_id": "s069754836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\ndef prime(num):\n\tarray=[]\n\ttmp=int(math.sqrt(n))+1\n\tfor i in range(2,tmp):\n\t\twhile num % i == 0:\n\t\t\tnum/=i\n\t\t\tarray.append(i)\n\t\n\tif array==[]:\n\t\treturn [num]\n\telse:\n\t\treturn array\n\nn=int(input())\nP=prime(n)\nnum=n\ntmp=P[0]\n\nif 1 in P:\n\tprint(0)\nelse:\t\n\tans=1\n\tfor i in range(1,len(P)):\n\t\tif P[i]==P[i-1]:\n\t\t\ttmp*=P[i]\n\t\telse:\n\t\t\ttmp=P[i]\n\n\t\tif num%tmp==0:\n\t\t\tnum/=tmp\n\t\t\tans+=1\n\n\tprint(ans)", "code2": "import math\n\ndef prime(num):\n\tarray=[]\n\ttmp=int(math.sqrt(n))+1\n\tfor i in range(2,tmp):\n\t\twhile num % i == 0:\n\t\t\tnum/=i\n\t\t\tarray.append(i)\n\t\n\t\n\tif array==[]:\n\t\treturn [num]\n\telse:\n\t\tif num>1:\n\t\t\tarray.append(int(num))\n\t\treturn array\n\nn=int(input())\nP=prime(n)\nP=sorted(P)\nnum=n\nif 1 in P:\n\tprint(0)\nelse:\n\tans=0\n\ttmp=0\n\tfor i in range(0,len(P)):\n\t\tif i==0:\n\t\t\ttmp=P[i] \n\t\telif P[i]==P[i-1]:\n\t\t\ttmp*=P[i]\n\t\telse:\n\t\t\ttmp=P[i]\n\t\t\tnum=n\n\t\tif num%tmp==0:\n\t\t\tnum/=tmp\n\t\t\tans+=1\n\t\t\t\n\tprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599493436", "date2": "1599495794", "bleu_score": "0.7947618033038495", "code1_test_status": [1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1], "code1_test_score": 25, "total_score": 67, "input": "1130063570614\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n \n def prime(num):\n \tarray=[]\n \ttmp=int(math.sqrt(n))+1\n \tfor i in range(2,tmp):\n \t\twhile num % i == 0:\n \t\t\tnum/=i\n \t\t\tarray.append(i)\n \t\n+\t\n \tif array==[]:\n \t\treturn [num]\n \telse:\n+\t\tif num>1:\n+\t\t\tarray.append(int(num))\n \t\treturn array\n \n n=int(input())\n P=prime(n)\n+P=sorted(P)\n num=n\n-tmp=P[0]\n-\n if 1 in P:\n \tprint(0)\n-else:\t\n-\tans=1\n-\tfor i in range(1,len(P)):\n-\t\tif P[i]==P[i-1]:\n+else:\n+\tans=0\n+\ttmp=0\n+\tfor i in range(0,len(P)):\n+\t\tif i==0:\n+\t\t\ttmp=P[i] \n+\t\telif P[i]==P[i-1]:\n \t\t\ttmp*=P[i]\n \t\telse:\n \t\t\ttmp=P[i]\n-\n+\t\t\tnum=n\n \t\tif num%tmp==0:\n \t\t\tnum/=tmp\n \t\t\tans+=1\n-\n+\t\t\t\n \tprint(ans)\n", "FL_content": " import math\n \n def prime(num):\n \tarray=[]\n \ttmp=int(math.sqrt(n))+1\n \tfor i in range(2,tmp):\n \t\twhile num % i == 0:\n \t\t\tnum/=i\n \t\t\tarray.append(i)\n \t\n \tif array==[]:\n \t\treturn [num]\n \telse:\n \t\treturn array\n \n n=int(input())\n P=prime(n)\n num=n\n-tmp=P[0]\n-\n if 1 in P:\n \tprint(0)\n-else:\t\n-\tans=1\n-\tfor i in range(1,len(P)):\n-\t\tif P[i]==P[i-1]:\n \t\t\ttmp*=P[i]\n \t\telse:\n \t\t\ttmp=P[i]\n-\n \t\tif num%tmp==0:\n \t\t\tnum/=tmp\n \t\t\tans+=1\n-\n \tprint(ans)\n", "added_lines": 13, "removed_lines": 8, "code1_lines": 35 }, { "user_id": "u090068671", "problem_id": "p02660", "submission1_id": "s188461069", "submission2_id": "s728530886", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n\tanswer = 0\n\tN = int(input())\n\tif N==1:\n\t\tprint(answer)\n\telse:\n\t\t\n\t\tfor p in range(2, int(N**0.5)+2):\n\t\t\te = 0\n\t\t\twhile (N % p == 0):\n\t\t\t\tN /= p\n\t\t\t\te += 1\n\t\t\t\n\t\t\tif e>0:\n\t\t\t\t\n\t\t\t\tfor i in range(1, e+1):\n\t\t\t\t\tif e >= i:\n\t\t\t\t\t\te -= i\n\t\t\t\t\t\tanswer += 1\n\t\t\n\t\tif answer==0:\n\t\t\tanswer = 1\n\t\tprint(answer)\n \nresolve()", "code2": "def resolve():\n\tanswer = 0\n\tN = int(input())\n\tif N==1:\n\t\tprint(answer)\n\telse:\n\t\t\n\t\tfor p in range(2, int(N**0.5)+2):\n\t\t\te = 0\n\t\t\twhile (N % p == 0):\n\t\t\t\tN /= p\n\t\t\t\te += 1\n\t\t\t\n\t\t\tif e>0:\n\t\t\t\t\n\t\t\t\tfor i in range(1, e+1):\n\t\t\t\t\tif e >= i:\n\t\t\t\t\t\te -= i\n\t\t\t\t\t\tanswer += 1\n\t\t\n\t\tif N!=1:\n\t\t\tanswer += 1\n\t\tprint(answer)\n \nresolve()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1591245555", "date2": "1591327418", "bleu_score": "0.9644785360997067", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 24, "total_score": 67, "input": "108524550542\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def resolve():\n \tanswer = 0\n \tN = int(input())\n \tif N==1:\n \t\tprint(answer)\n \telse:\n \t\t\n \t\tfor p in range(2, int(N**0.5)+2):\n \t\t\te = 0\n \t\t\twhile (N % p == 0):\n \t\t\t\tN /= p\n \t\t\t\te += 1\n \t\t\t\n \t\t\tif e>0:\n \t\t\t\t\n \t\t\t\tfor i in range(1, e+1):\n \t\t\t\t\tif e >= i:\n \t\t\t\t\t\te -= i\n \t\t\t\t\t\tanswer += 1\n \t\t\n-\t\tif answer==0:\n-\t\t\tanswer = 1\n+\t\tif N!=1:\n+\t\t\tanswer += 1\n \t\tprint(answer)\n \n resolve()\n", "FL_content": " def resolve():\n \tanswer = 0\n \tN = int(input())\n \tif N==1:\n \t\tprint(answer)\n \telse:\n \t\t\n \t\tfor p in range(2, int(N**0.5)+2):\n \t\t\te = 0\n \t\t\twhile (N % p == 0):\n \t\t\t\tN /= p\n \t\t\t\te += 1\n \t\t\t\n \t\t\tif e>0:\n \t\t\t\t\n \t\t\t\tfor i in range(1, e+1):\n \t\t\t\t\tif e >= i:\n \t\t\t\t\t\te -= i\n \t\t\t\t\t\tanswer += 1\n \t\t\n-\t\tif answer==0:\n-\t\t\tanswer = 1\n \t\tprint(answer)\n \n resolve()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 25 }, { "user_id": "u082945913", "problem_id": "p02660", "submission1_id": "s842535380", "submission2_id": "s911154958", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nn = int(input())\nN = n\n\nif(n == 1):\n print(0)\n exit()\n\nyakusu = []\nmulti = []\n\ni = 2\nwhile(i <= int(math.sqrt(N))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n\nif(len(yakusu) == 0):\n yakusu.append(n)\n multi.append(1)\n \nans = 0\n\nfor j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n\nprint(ans)", "code2": "import math\n\nn = int(input())\nN = n\n\nif(n == 1):\n print(0)\n exit()\n\nyakusu = []\nmulti = []\n\ni = 2\n\nwhile(i <= math.ceil(math.sqrt(N))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n \nelse:\n yakusu.append(n)\n multi.append(1)\n\nif(len(yakusu) == 0):\n print(1)\n exit()\n \n\n\n\nans = 0\n\nfor j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590980876", "date2": "1590982795", "bleu_score": "0.9169486327304718", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 24, "total_score": 67, "input": "918292\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["import math\nn = int(input()) # (0): n=918292\nN = n # (1): N=918292\n\nif(n == 1): # (2): NO CHANGE\n print(0)\n exit()\n\nyakusu = [] # (3): yakusu=[]\nmulti = [] # (4): multi=[]\n\ni = 2 # (5): i=2\nwhile(i <= int(math.sqrt(N))): # (6): NO CHANGE (13): NO CHANGE ... (3854): NO CHANGE\n \n if(n % i == 0): # (7): NO CHANGE (14): NO CHANGE ... (3851): NO CHANGE\n if(i in yakusu): # (8): NO CHANGE (15): NO CHANGE (417): NO CHANGE\n multi[yakusu.index(i)] += 1 # (16): multi=[2]\n else:\n yakusu.append(i) # (9): yakusu=[2] (418): yakusu=[2, 101]\n multi.append(1) # (10): multi=[1] (419): multi=[2, 1]\n n = int(n / i) # (11): n=459146 (17): n=229573 (420): n=2273\n continue # (12): NO CHANGE (18): NO CHANGE (421): NO CHANGE\n \n if(n == 1): # (21): NO CHANGE (25): NO CHANGE ... (3852): NO CHANGE\n break\n \n i += 1 # (22): i=3 (26): i=4 ... (3853): i=959\n\nif(len(yakusu) == 0): # (3855): NO CHANGE\n yakusu.append(n)\n multi.append(1)\n \nans = 0 # (3856): ans=0\n\nfor j in range(len(multi)): # (3857): j=0 (3860): j=1 (3863): NO CHANGE\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2 # (3858): h=1.5 (3861): h=1.0\n ans += int(h) # (3859): ans=1 (3862): ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " import math\n+\n n = int(input())\n N = n\n \n if(n == 1):\n print(0)\n exit()\n \n yakusu = []\n multi = []\n \n i = 2\n-while(i <= int(math.sqrt(N))):\n+\n+while(i <= math.ceil(math.sqrt(N))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n-\n-if(len(yakusu) == 0):\n+ \n+else:\n yakusu.append(n)\n multi.append(1)\n+\n+if(len(yakusu) == 0):\n+ print(1)\n+ exit()\n \n+\n+\n+\n ans = 0\n \n for j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n \n print(ans)\n", "FL_content": " import math\n n = int(input())\n N = n\n \n if(n == 1):\n print(0)\n exit()\n \n yakusu = []\n multi = []\n \n i = 2\n-while(i <= int(math.sqrt(N))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n-\n-if(len(yakusu) == 0):\n yakusu.append(n)\n multi.append(1)\n \n ans = 0\n \n for j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n \n print(ans)\n", "added_lines": 12, "removed_lines": 3, "code1_lines": 39 }, { "user_id": "u617384447", "problem_id": "p02660", "submission1_id": "s005859528", "submission2_id": "s017903345", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\ndef divGame(N=n):\n if N == 1:\n return 0\n if N == 2:\n return 1\n \n factors = []\n \n count = 0\n while N % 2 == 0:\n N /= 2\n count += 1\n if count != 0:\n factors.append(count)\n\n for i in range(3, int(N**0.5 + 1), 2):\n count = 0\n while N % i == 0:\n N /= i\n count += 1\n if count != 0:\n factors.append(count)\n if N != 1:\n factors.append(1)\n\n factors.sort()\n\n answer = 0\n accum = 1\n count = 1\n for i in range(len(factors)):\n while factors[i] > accum:\n count += 1\n accum += count\n answer += count\n\n return answer\n\nprint(divGame())", "code2": "n = int(input())\n\ndef divGame(N=n):\n if N == 1:\n return 0\n if N == 2:\n return 1\n \n factors = []\n\n for i in range(2, int(N**0.5 + 1)):\n count = 0\n while N % i == 0:\n N /= i\n count += 1\n if count != 0:\n factors.append(count)\n if N != 1:\n factors.append(1)\n\n factors.sort()\n\n answer = 0\n accum = 1\n count = 1\n for i in range(len(factors)):\n while factors[i] >= accum:\n count += 1\n accum += count\n answer += count - 1\n\n return answer\n\nprint(divGame())", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1599556393", "date2": "1599557656", "bleu_score": "0.8022375135886021", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1], "code1_test_score": 46, "total_score": 67, "input": "3688232787\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n \n def divGame(N=n):\n if N == 1:\n return 0\n if N == 2:\n return 1\n \n factors = []\n- \n- count = 0\n- while N % 2 == 0:\n- N /= 2\n- count += 1\n- if count != 0:\n- factors.append(count)\n \n- for i in range(3, int(N**0.5 + 1), 2):\n+ for i in range(2, int(N**0.5 + 1)):\n count = 0\n while N % i == 0:\n N /= i\n count += 1\n if count != 0:\n factors.append(count)\n if N != 1:\n factors.append(1)\n \n factors.sort()\n \n answer = 0\n accum = 1\n count = 1\n for i in range(len(factors)):\n- while factors[i] > accum:\n+ while factors[i] >= accum:\n count += 1\n accum += count\n- answer += count\n+ answer += count - 1\n \n return answer\n \n print(divGame())\n", "FL_content": " n = int(input())\n \n def divGame(N=n):\n if N == 1:\n return 0\n if N == 2:\n return 1\n \n factors = []\n- \n- count = 0\n- while N % 2 == 0:\n- N /= 2\n- count += 1\n- if count != 0:\n- factors.append(count)\n \n- for i in range(3, int(N**0.5 + 1), 2):\n count = 0\n while N % i == 0:\n N /= i\n count += 1\n if count != 0:\n factors.append(count)\n if N != 1:\n factors.append(1)\n \n factors.sort()\n \n answer = 0\n accum = 1\n count = 1\n for i in range(len(factors)):\n- while factors[i] > accum:\n count += 1\n accum += count\n- answer += count\n \n return answer\n \n print(divGame())\n", "added_lines": 3, "removed_lines": 10, "code1_lines": 41 }, { "user_id": "u689377278", "problem_id": "p02660", "submission1_id": "s368157125", "submission2_id": "s272493072", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nimport heapq\n\ndef main():\n temp = [True] * (10 ** 6)\n temp[0] = False\n temp[1] = False\n for i in range(2, 10 ** 6):\n if temp[i]:\n cnt = 2 * i\n while cnt < 10 ** 6:\n temp[cnt] = False\n cnt += i\n prime = []\n for i in range(10 ** 6):\n if temp[i]:\n prime.append(i)\n\n n = int(input())\n if n == 1:\n print(0)\n return\n ans = 0\n tempN = n\n for i in prime:\n if i > tempN:\n break\n if tempN % i:\n continue\n div = 0\n while True:\n cnt = 1\n temp = 2\n while tempN % (i ** (div + 2 * temp)) == 0:\n cnt += 1\n temp *= 2\n if tempN % (i ** (div + cnt)):\n break\n div += cnt\n tempN = tempN \n \n if div > 2:\n div = int((div * 2) ** 0.5)\n else:\n div = 1\n \n ans += div\n if tempN > 1:\n ans += 1\n print(max(ans, 1))\n return\n\nif __name__ == \"__main__\":\n main()", "code2": "\n\n\n\n\nimport sys\nimport heapq\n\ndef main():\n temp = [True] * (10 ** 6 + 10)\n temp[0] = False\n temp[1] = False\n for i in range(2, 10 ** 6 + 10):\n if temp[i]:\n cnt = 2 * i\n while cnt < 10 ** 6 + 10:\n temp[cnt] = False\n cnt += i\n prime = []\n for i in range(10 ** 6 + 10):\n if temp[i]:\n prime.append(i)\n \n n = int(input())\n ans = 0\n tempN = n\n for i in prime:\n if i > tempN:\n break\n if tempN % i:\n continue\n div = 0\n while tempN % i == 0:\n tempN = tempN \n div += 1\n tempAns = int((div * 2) ** 0.5)\n if tempAns * (tempAns + 1) \n tempAns -= 1\n \n ans += tempAns\n if tempN > 1:\n ans += 1\n print(ans)\n return\n \nif __name__ == \"__main__\":\n main()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1590979042", "date2": "1590981293", "bleu_score": "0.7159328318391842", "code1_test_status": [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1], "code1_test_score": 29, "total_score": 67, "input": "2860683\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["\n\n\n\n\nimport sys\nimport heapq\n\ndef main(): # (0): main=\n temp = [True] * (10 ** 6)\n temp[0] = False\n temp[1] = False\n for i in range(2, 10 ** 6):\n if temp[i]:\n cnt = 2 * i\n while cnt < 10 ** 6:\n temp[cnt] = False\n cnt += i\n prime = []\n for i in range(10 ** 6):\n if temp[i]:\n prime.append(i)\n\n n = int(input())\n if n == 1:\n print(0)\n return\n ans = 0\n tempN = n\n for i in prime:\n if i > tempN:\n break\n if tempN % i:\n continue\n div = 0\n while True:\n cnt = 1\n temp = 2\n while tempN % (i ** (div + 2 * temp)) == 0:\n cnt += 1\n temp *= 2\n if tempN % (i ** (div + cnt)):\n break\n div += cnt\n tempN = tempN \n \n if div > 2:\n div = int((div * 2) ** 0.5)\n else:\n div = 1\n \n ans += div\n if tempN > 1:\n ans += 1\n print(max(ans, 1))\n return\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " \n \n \n \n \n import sys\n import heapq\n \n def main():\n- temp = [True] * (10 ** 6)\n+ temp = [True] * (10 ** 6 + 10)\n temp[0] = False\n temp[1] = False\n- for i in range(2, 10 ** 6):\n+ for i in range(2, 10 ** 6 + 10):\n if temp[i]:\n cnt = 2 * i\n- while cnt < 10 ** 6:\n+ while cnt < 10 ** 6 + 10:\n temp[cnt] = False\n cnt += i\n prime = []\n- for i in range(10 ** 6):\n+ for i in range(10 ** 6 + 10):\n if temp[i]:\n prime.append(i)\n-\n+ \n n = int(input())\n- if n == 1:\n- print(0)\n- return\n ans = 0\n tempN = n\n for i in prime:\n if i > tempN:\n break\n if tempN % i:\n continue\n div = 0\n- while True:\n- cnt = 1\n- temp = 2\n- while tempN % (i ** (div + 2 * temp)) == 0:\n- cnt += 1\n- temp *= 2\n- if tempN % (i ** (div + cnt)):\n- break\n- div += cnt\n- tempN = tempN \n- \n- if div > 2:\n- div = int((div * 2) ** 0.5)\n- else:\n- div = 1\n+ while tempN % i == 0:\n+ tempN = tempN \n+ div += 1\n+ tempAns = int((div * 2) ** 0.5)\n+ if tempAns * (tempAns + 1) \n+ tempAns -= 1\n \n- ans += div\n+ ans += tempAns\n if tempN > 1:\n ans += 1\n- print(max(ans, 1))\n+ print(ans)\n return\n-\n+ \n if __name__ == \"__main__\":\n main()\n", "FL_content": " \n \n \n \n \n import sys\n import heapq\n \n def main():\n- temp = [True] * (10 ** 6)\n temp[0] = False\n temp[1] = False\n- for i in range(2, 10 ** 6):\n if temp[i]:\n cnt = 2 * i\n- while cnt < 10 ** 6:\n temp[cnt] = False\n cnt += i\n prime = []\n- for i in range(10 ** 6):\n if temp[i]:\n prime.append(i)\n-\n n = int(input())\n- if n == 1:\n- print(0)\n- return\n ans = 0\n tempN = n\n for i in prime:\n if i > tempN:\n break\n if tempN % i:\n continue\n div = 0\n- while True:\n- cnt = 1\n- temp = 2\n- while tempN % (i ** (div + 2 * temp)) == 0:\n- cnt += 1\n- temp *= 2\n- if tempN % (i ** (div + cnt)):\n- break\n- div += cnt\n- tempN = tempN \n- \n- if div > 2:\n- div = int((div * 2) ** 0.5)\n- else:\n- div = 1\n \n- ans += div\n if tempN > 1:\n ans += 1\n- print(max(ans, 1))\n return\n-\n if __name__ == \"__main__\":\n main()\n", "added_lines": 14, "removed_lines": 26, "code1_lines": 59 }, { "user_id": "u075502030", "problem_id": "p02660", "submission1_id": "s964983531", "submission2_id": "s539049880", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\ndef is_prime(n):\n if n==1:\n return False\n nmax = int(math.sqrt(n)) + 1\n for i in range(2, nmax):\n if(n%i)==0:\n return False\n return True\n\ndef pf(n):\n sn = int(math.sqrt(n)) + 1\n ps = []\n for i in range(1, sn):\n if (n%i)==0:\n ps.append(i)\n del ps[0]\n if not ps:\n ps.append(n)\n return ps \n\nn = int(input())\nps = []\nnum = pf(n)\nfor i in num:\n if is_prime(i):\n ps.append(i)\n \nzs = [] \nfor p in ps:\n z = p\n while(z<=n):\n zs.append(z)\n z *= p\nzs.sort()\n\ncnt = 0\nfor z in zs:\n if(n>1):\n if(n%z==0):\n n /= z\n cnt += 1\nprint(cnt)", "code2": "import math\n\ndef is_prime(n):\n if n==1:\n return False\n nmax = int(math.sqrt(n)) + 1\n for i in range(2, nmax):\n if(n%i)==0:\n return False\n return True\n\ndef pf(n):\n sn = int(math.sqrt(n)) + 1\n ps = []\n for i in range(1, sn):\n if (n%i)==0:\n ps.append(i)\n ps.append(int(n/i))\n del ps[0]\n return ps \n\nn = int(input())\nps = []\nnum = pf(n)\nfor i in num:\n if is_prime(i):\n ps.append(i)\n \nzs = [] \nfor p in ps:\n z = p\n while(z<=n):\n zs.append(z)\n z *= p\nzs.sort()\n\ncnt = 0\nfor z in zs:\n if(n>1):\n if(n%z==0):\n n /= z\n cnt += 1\nprint(cnt)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593667400", "date2": "1593667458", "bleu_score": "0.980173786210818", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 24, "total_score": 67, "input": "1051373943064\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n \n def is_prime(n):\n if n==1:\n return False\n nmax = int(math.sqrt(n)) + 1\n for i in range(2, nmax):\n if(n%i)==0:\n return False\n return True\n \n def pf(n):\n sn = int(math.sqrt(n)) + 1\n ps = []\n for i in range(1, sn):\n if (n%i)==0:\n ps.append(i)\n+ ps.append(int(n/i))\n del ps[0]\n- if not ps:\n- ps.append(n)\n return ps \n \n n = int(input())\n ps = []\n num = pf(n)\n for i in num:\n if is_prime(i):\n ps.append(i)\n \n zs = [] \n for p in ps:\n z = p\n while(z<=n):\n zs.append(z)\n z *= p\n zs.sort()\n \n cnt = 0\n for z in zs:\n if(n>1):\n if(n%z==0):\n n /= z\n cnt += 1\n print(cnt)\n", "FL_content": " import math\n \n def is_prime(n):\n if n==1:\n return False\n nmax = int(math.sqrt(n)) + 1\n for i in range(2, nmax):\n if(n%i)==0:\n return False\n return True\n \n def pf(n):\n sn = int(math.sqrt(n)) + 1\n ps = []\n for i in range(1, sn):\n if (n%i)==0:\n ps.append(i)\n del ps[0]\n- if not ps:\n- ps.append(n)\n return ps \n \n n = int(input())\n ps = []\n num = pf(n)\n for i in num:\n if is_prime(i):\n ps.append(i)\n \n zs = [] \n for p in ps:\n z = p\n while(z<=n):\n zs.append(z)\n z *= p\n zs.sort()\n \n cnt = 0\n for z in zs:\n if(n>1):\n if(n%z==0):\n n /= z\n cnt += 1\n print(cnt)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 44 }, { "user_id": "u362127784", "problem_id": "p02660", "submission1_id": "s340629916", "submission2_id": "s481717319", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a =int(input())\nlist = []\nb = 1\nfor i in range(2,44):\n list.append(b)\n b = b + i\nn = 0\ne = 0\nk = 0\nfor i in range(2,1000000):\n if (a % i == 0):\n warikaisi = True\n while(warikaisi):\n if a % i == 0:\n list.append(i)\n a = a / i\n e = e + 1\n if (e == list[k]):\n n = n + 1\n k = k + 1\n else:\n e = 0\n k = 0\n warikaisi = False\nif (n == 0 and a != 1):\n n = 1\nif (a >= 1000000):\n n = 1\nprint(n)", "code2": "a =int(input())\nlist = []\nb = 1\nfor i in range(2,44):\n list.append(b)\n b = b + i\nn = 0\ne = 0\nk = 0\nfor i in range(2,1000000):\n if (a % i == 0):\n warikaisi = True\n while(warikaisi):\n if a % i == 0:\n list.append(i)\n a = a / i\n e = e + 1\n if (e == list[k]):\n n = n + 1\n k = k + 1\n else:\n e = 0\n k = 0\n warikaisi = False\nif (a >= 1000000):\n n = n + 1\nprint(n)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1591647807", "date2": "1591647870", "bleu_score": "0.9408747022591846", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1], "code1_test_score": 40, "total_score": 67, "input": "114304195595\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " a =int(input())\n list = []\n b = 1\n for i in range(2,44):\n list.append(b)\n b = b + i\n n = 0\n e = 0\n k = 0\n for i in range(2,1000000):\n if (a % i == 0):\n warikaisi = True\n while(warikaisi):\n if a % i == 0:\n list.append(i)\n a = a / i\n e = e + 1\n if (e == list[k]):\n n = n + 1\n k = k + 1\n else:\n e = 0\n k = 0\n warikaisi = False\n-if (n == 0 and a != 1):\n- n = 1\n if (a >= 1000000):\n- n = 1\n+ n = n + 1\n print(n)\n", "FL_content": " a =int(input())\n list = []\n b = 1\n for i in range(2,44):\n list.append(b)\n b = b + i\n n = 0\n e = 0\n k = 0\n for i in range(2,1000000):\n if (a % i == 0):\n warikaisi = True\n while(warikaisi):\n if a % i == 0:\n list.append(i)\n a = a / i\n e = e + 1\n if (e == list[k]):\n n = n + 1\n k = k + 1\n else:\n e = 0\n k = 0\n warikaisi = False\n-if (n == 0 and a != 1):\n- n = 1\n if (a >= 1000000):\n- n = 1\n print(n)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 29 }, { "user_id": "u090068671", "problem_id": "p02660", "submission1_id": "s414326355", "submission2_id": "s728530886", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n\timport math\n\tN = int(input())\n\tif N==1:\n\t\tprint(0)\n\telse:\n\t\t\n\t\tlst_e = []\n\t\tfor p in range(2, math.ceil(math.sqrt(N))):\n\t\t\te = 0\n\t\t\twhile (N % p == 0):\n\t\t\t\tN /= p\n\t\t\t\te += 1\n\t\t\tif e>0:\n\t\t\t\tlst_e.append(e)\n\t\t\n\t\t\n\t\tanswer = 0\n\t\tfor e in lst_e:\n\t\t\ti = 1\n\t\t\twhile e >= i:\n\t\t\t\te -= i\n\t\t\t\ti += 1\n\t\t\t\tanswer += 1\n\t\tif answer == 0:\n\t\t\tanswer = 1\n\t\tprint(answer)\n \nresolve()", "code2": "def resolve():\n\tanswer = 0\n\tN = int(input())\n\tif N==1:\n\t\tprint(answer)\n\telse:\n\t\t\n\t\tfor p in range(2, int(N**0.5)+2):\n\t\t\te = 0\n\t\t\twhile (N % p == 0):\n\t\t\t\tN /= p\n\t\t\t\te += 1\n\t\t\t\n\t\t\tif e>0:\n\t\t\t\t\n\t\t\t\tfor i in range(1, e+1):\n\t\t\t\t\tif e >= i:\n\t\t\t\t\t\te -= i\n\t\t\t\t\t\tanswer += 1\n\t\t\n\t\tif N!=1:\n\t\t\tanswer += 1\n\t\tprint(answer)\n \nresolve()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1591233190", "date2": "1591327418", "bleu_score": "0.7220302720619762", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 24, "total_score": 67, "input": "44192863218\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def resolve():\n-\timport math\n+\tanswer = 0\n \tN = int(input())\n \tif N==1:\n-\t\tprint(0)\n+\t\tprint(answer)\n \telse:\n \t\t\n-\t\tlst_e = []\n-\t\tfor p in range(2, math.ceil(math.sqrt(N))):\n+\t\tfor p in range(2, int(N**0.5)+2):\n \t\t\te = 0\n \t\t\twhile (N % p == 0):\n \t\t\t\tN /= p\n \t\t\t\te += 1\n+\t\t\t\n \t\t\tif e>0:\n-\t\t\t\tlst_e.append(e)\n-\t\t\n+\t\t\t\t\n+\t\t\t\tfor i in range(1, e+1):\n+\t\t\t\t\tif e >= i:\n+\t\t\t\t\t\te -= i\n+\t\t\t\t\t\tanswer += 1\n \t\t\n-\t\tanswer = 0\n-\t\tfor e in lst_e:\n-\t\t\ti = 1\n-\t\t\twhile e >= i:\n-\t\t\t\te -= i\n-\t\t\t\ti += 1\n-\t\t\t\tanswer += 1\n-\t\tif answer == 0:\n-\t\t\tanswer = 1\n+\t\tif N!=1:\n+\t\t\tanswer += 1\n \t\tprint(answer)\n \n resolve()\n", "FL_content": " def resolve():\n-\timport math\n \tN = int(input())\n \tif N==1:\n-\t\tprint(0)\n \telse:\n \t\t\n-\t\tlst_e = []\n-\t\tfor p in range(2, math.ceil(math.sqrt(N))):\n \t\t\te = 0\n \t\t\twhile (N % p == 0):\n \t\t\t\tN /= p\n \t\t\t\te += 1\n \t\t\tif e>0:\n-\t\t\t\tlst_e.append(e)\n-\t\t\n \t\t\n-\t\tanswer = 0\n-\t\tfor e in lst_e:\n-\t\t\ti = 1\n-\t\t\twhile e >= i:\n-\t\t\t\te -= i\n-\t\t\t\ti += 1\n-\t\t\t\tanswer += 1\n-\t\tif answer == 0:\n-\t\t\tanswer = 1\n \t\tprint(answer)\n \n resolve()\n", "added_lines": 11, "removed_lines": 15, "code1_lines": 29 }, { "user_id": "u093861603", "problem_id": "p02660", "submission1_id": "s232907283", "submission2_id": "s498589200", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nli=[0]*(10**6+1)\nflag=False\nfor i in range(2,int(N**0.5)+1):\n while N%i==0:\n flag=True\n N/=i\n li[i]+=1\nif flag==False:\n print(1)\n exit()\nans=0\nfor count in li:\n use=1\n while count-use>=0:\n ans+=1\n count-=use\n use+=1\nprint(ans)\n \n ", "code2": "N=int(input())\nfn=N\nli=[0]*(10**6+100)\nflag=False\nif N==1:\n print(0)\n exit()\nfor i in range(2,int(N**0.5)+1):\n while N%i==0:\n flag=True\n N/=i\n li[i]+=1\nif flag==False:\n print(1)\n exit()\n\nans=0\nif N>fn**0.5:\n ans+=1\n \nfor count in li:\n use=1\n while count-use>=0:\n ans+=1\n count-=use\n use+=1\nprint(ans)\n \n ", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1590974267", "date2": "1590974886", "bleu_score": "0.7986444902022677", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 24, "total_score": 67, "input": "1130063570614\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N=int(input())\n-li=[0]*(10**6+1)\n+fn=N\n+li=[0]*(10**6+100)\n flag=False\n+if N==1:\n+ print(0)\n+ exit()\n for i in range(2,int(N**0.5)+1):\n while N%i==0:\n flag=True\n N/=i\n li[i]+=1\n if flag==False:\n print(1)\n exit()\n+\n ans=0\n+if N>fn**0.5:\n+ ans+=1\n+ \n for count in li:\n use=1\n while count-use>=0:\n ans+=1\n count-=use\n use+=1\n print(ans)\n \n \n", "FL_content": " N=int(input())\n-li=[0]*(10**6+1)\n flag=False\n for i in range(2,int(N**0.5)+1):\n while N%i==0:\n flag=True\n N/=i\n li[i]+=1\n if flag==False:\n print(1)\n exit()\n ans=0\n for count in li:\n use=1\n while count-use>=0:\n ans+=1\n count-=use\n use+=1\n print(ans)\n \n \n", "added_lines": 9, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u626891113", "problem_id": "p02660", "submission1_id": "s362952496", "submission2_id": "s316351936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nn = int(input())\nans = 0\ndef primes(n):\n is_p = [True]*(n + 1)\n is_p[0] = False\n is_p[1] = False\n for i in range(2, int(n**0.5)+1):\n if not is_p[i]:\n continue\n for j in range(i*2, n+1, i):\n is_p[j] = False\n return [i for i in range(n+1) if is_p[i]]\n\np = primes(10**6)\n\ndp = []\ncl = []\nn1 = n\nfor i in p:\n if n%i == 0:\n cl.append(i)\n while n%i == 0:\n n = n/i\n dp.append(i)\n if n == 1:\n break\nif n == n1:\n dp.append(n)\n cl.append(n)\n\nc = Counter(dp)\n\nfor i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \nprint(ans)\n", "code2": "from collections import Counter\nn = int(input())\nans = 0\n\ndp = []\ncl = []\nn1 = n\nif n == 1:\n ans = 0\nelse:\n for i in range(2, int(n**0.5)+1):\n if n%i == 0:\n cl.append(i)\n while n%i == 0:\n n = n/i\n dp.append(i)\n if n == 1:\n break\n if n != 1:\n ans = 1\n\nc = Counter(dp)\n\nfor i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593928069", "date2": "1593931324", "bleu_score": "0.6043766981777513", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1], "code1_test_score": 40, "total_score": 67, "input": "3246178996\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import Counter\n n = int(input())\n ans = 0\n-def primes(n):\n- is_p = [True]*(n + 1)\n- is_p[0] = False\n- is_p[1] = False\n- for i in range(2, int(n**0.5)+1):\n- if not is_p[i]:\n- continue\n- for j in range(i*2, n+1, i):\n- is_p[j] = False\n- return [i for i in range(n+1) if is_p[i]]\n-\n-p = primes(10**6)\n \n dp = []\n cl = []\n n1 = n\n-for i in p:\n- if n%i == 0:\n- cl.append(i)\n- while n%i == 0:\n- n = n/i\n- dp.append(i)\n- if n == 1:\n- break\n-if n == n1:\n- dp.append(n)\n- cl.append(n)\n+if n == 1:\n+ ans = 0\n+else:\n+ for i in range(2, int(n**0.5)+1):\n+ if n%i == 0:\n+ cl.append(i)\n+ while n%i == 0:\n+ n = n/i\n+ dp.append(i)\n+ if n == 1:\n+ break\n+ if n != 1:\n+ ans = 1\n \n c = Counter(dp)\n \n for i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \n print(ans)\n \n", "FL_content": " from collections import Counter\n n = int(input())\n ans = 0\n-def primes(n):\n- is_p = [True]*(n + 1)\n- is_p[0] = False\n- is_p[1] = False\n- for i in range(2, int(n**0.5)+1):\n- if not is_p[i]:\n- continue\n- for j in range(i*2, n+1, i):\n- is_p[j] = False\n- return [i for i in range(n+1) if is_p[i]]\n-\n-p = primes(10**6)\n \n dp = []\n cl = []\n n1 = n\n-for i in p:\n- if n%i == 0:\n- cl.append(i)\n- while n%i == 0:\n- n = n/i\n- dp.append(i)\n- if n == 1:\n- break\n-if n == n1:\n- dp.append(n)\n- cl.append(n)\n \n c = Counter(dp)\n \n for i in cl:\n cnt = 1\n while c[i] >= cnt:\n c[i] -= cnt\n ans += 1\n cnt += 1\n \n print(ans)\n \n", "added_lines": 13, "removed_lines": 23, "code1_lines": 42 }, { "user_id": "u374935093", "problem_id": "p02660", "submission1_id": "s905812546", "submission2_id": "s236821740", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\ndata = input()\ntarget = int(data)\n\ndef primes(n):\n is_prime = [True] * (n + 1)\n is_prime[0] = False\n is_prime[1] = False\n for i in range(2, int(n**0.5) + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n return [i for i in range(n + 1) if is_prime[i]]\n\nlist = primes(1000000)\nresult =[]\nfor i in list:\n check = target\n k = 0\n while True:\n if check % i != 0:\n break\n else:\n check = check/i\n k +=1\n result.append(k)\n\nans = 0\nfor j in result:\n y = 0\n z = j\n while z > y:\n y += 1\n z -= y\n ans +=1\nif ans == 0 and target != 1:\n ans =1 \nprint(ans)", "code2": "import math\ndata = input()\ntarget = int(data)\n\ndef primes(n):\n is_prime = [True] * (n + 1)\n is_prime[0] = False\n is_prime[1] = False\n for i in range(2, int(n**0.5) + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n return [i for i in range(n + 1) if is_prime[i]]\n\nlist = primes(2000000)\nresult =[]\nfor i in list:\n check = target\n k = 0\n while True:\n if check % i != 0:\n break\n else:\n check = check/i\n k +=1\n result.append(k)\n\nans = 0\nfor j in result:\n y = 0\n z = j\n while z > y:\n y += 1\n z -= y\n ans += 1\n\n\ncover = 1\nfor i in range(len(list)):\n cover = cover*(list[i]**result[i])\nif target/cover >2000000:\n ans +=1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590977337", "date2": "1590978056", "bleu_score": "0.8827585385622418", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1], "code1_test_score": 40, "total_score": 67, "input": "911738620\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n data = input()\n target = int(data)\n \n def primes(n):\n is_prime = [True] * (n + 1)\n is_prime[0] = False\n is_prime[1] = False\n for i in range(2, int(n**0.5) + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n return [i for i in range(n + 1) if is_prime[i]]\n \n-list = primes(1000000)\n+list = primes(2000000)\n result =[]\n for i in list:\n check = target\n k = 0\n while True:\n if check % i != 0:\n break\n else:\n check = check/i\n k +=1\n result.append(k)\n \n ans = 0\n for j in result:\n y = 0\n z = j\n while z > y:\n y += 1\n z -= y\n- ans +=1\n-if ans == 0 and target != 1:\n- ans =1 \n+ ans += 1\n+\n+\n+cover = 1\n+for i in range(len(list)):\n+ cover = cover*(list[i]**result[i])\n+if target/cover >2000000:\n+ ans +=1\n print(ans)\n", "FL_content": " import math\n data = input()\n target = int(data)\n \n def primes(n):\n is_prime = [True] * (n + 1)\n is_prime[0] = False\n is_prime[1] = False\n for i in range(2, int(n**0.5) + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n return [i for i in range(n + 1) if is_prime[i]]\n \n-list = primes(1000000)\n result =[]\n for i in list:\n check = target\n k = 0\n while True:\n if check % i != 0:\n break\n else:\n check = check/i\n k +=1\n result.append(k)\n \n ans = 0\n for j in result:\n y = 0\n z = j\n while z > y:\n y += 1\n z -= y\n- ans +=1\n-if ans == 0 and target != 1:\n- ans =1 \n print(ans)\n", "added_lines": 9, "removed_lines": 4, "code1_lines": 39 }, { "user_id": "u082945913", "problem_id": "p02660", "submission1_id": "s068309001", "submission2_id": "s911154958", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn = int(input())\nN = n\n\nif(n == 1):\n print(0)\n exit()\n\nyakusu = []\nmulti = []\n\ni = 2\nwhile(i <= math.ceil(math.sqrt(n))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n\nif(len(yakusu) == 0):\n print(1)\n exit()\n \nans = 0\n\nfor j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n\nprint(ans)", "code2": "import math\n\nn = int(input())\nN = n\n\nif(n == 1):\n print(0)\n exit()\n\nyakusu = []\nmulti = []\n\ni = 2\n\nwhile(i <= math.ceil(math.sqrt(N))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n \nelse:\n yakusu.append(n)\n multi.append(1)\n\nif(len(yakusu) == 0):\n print(1)\n exit()\n \n\n\n\nans = 0\n\nfor j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590981232", "date2": "1590982795", "bleu_score": "0.9032007671594443", "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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 67, "input": "3688232787\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["import math\n\nn = int(input()) # (0): n=3688232787\nN = n # (1): N=3688232787\n\nif(n == 1): # (2): NO CHANGE\n print(0)\n exit()\n\nyakusu = [] # (3): yakusu=[]\nmulti = [] # (4): multi=[]\n\ni = 2 # (5): i=2\nwhile(i <= math.ceil(math.sqrt(n))): # (6): NO CHANGE (10): NO CHANGE ... (9590): NO CHANGE\n \n if(n % i == 0): # (7): NO CHANGE (11): NO CHANGE ... (9584): NO CHANGE\n if(i in yakusu): # (12): NO CHANGE (19): NO CHANGE (9585): NO CHANGE\n multi[yakusu.index(i)] += 1 # (20): multi=[2]\n else:\n yakusu.append(i) # (13): yakusu=[3] (9586): yakusu=[3, 2393]\n multi.append(1) # (14): multi=[1] (9587): multi=[2, 1]\n n = int(n / i) # (15): n=1229410929 (21): n=409803643 (9588): n=171251\n continue # (16): NO CHANGE (22): NO CHANGE (9589): NO CHANGE\n \n if(n == 1): # (8): NO CHANGE (25): NO CHANGE ... (9581): NO CHANGE\n break\n \n i += 1 # (9): i=3 (26): i=4 ... (9582): i=2393\n\nif(len(yakusu) == 0): # (9591): NO CHANGE\n print(1)\n exit()\n \nans = 0 # (9592): ans=0\n\nfor j in range(len(multi)): # (9593): j=0 (9596): j=1 (9599): NO CHANGE\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2 # (9594): h=1.5 (9597): h=1.0\n ans += int(h) # (9595): ans=1 (9598): ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " import math\n \n n = int(input())\n N = n\n \n if(n == 1):\n print(0)\n exit()\n \n yakusu = []\n multi = []\n \n i = 2\n-while(i <= math.ceil(math.sqrt(n))):\n+\n+while(i <= math.ceil(math.sqrt(N))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n+ \n+else:\n+ yakusu.append(n)\n+ multi.append(1)\n \n if(len(yakusu) == 0):\n print(1)\n exit()\n \n+\n+\n+\n ans = 0\n \n for j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n \n print(ans)\n", "FL_content": " import math\n \n n = int(input())\n N = n\n \n if(n == 1):\n print(0)\n exit()\n \n yakusu = []\n multi = []\n \n i = 2\n-while(i <= math.ceil(math.sqrt(n))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append(1)\n n = int(n / i)\n continue\n \n if(n == 1):\n break\n \n i += 1\n \n if(len(yakusu) == 0):\n print(1)\n exit()\n \n ans = 0\n \n for j in range(len(multi)):\n h = (-1 + int(math.sqrt(1 + 8 * multi[j]))) / 2\n ans += int(h)\n \n print(ans)\n", "added_lines": 9, "removed_lines": 1, "code1_lines": 40 }, { "user_id": "u601426916", "problem_id": "p02660", "submission1_id": "s815473208", "submission2_id": "s551435772", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\nN = int(input())\nNsyo = N\ncount = 0\ndiv = 2\ndivcount = 0\ndivlist = []\nwhile N > 1 and div <= math.sqrt(N):\n if N%div == 0:\n while N%div == 0:\n N = N/div\n divcount = divcount+1\n divlist.append(divcount)\n divcount = 0\n else:\n pass\n div = div + 1\ndiv = 1\ndivcount = 0\nfor i in divlist:\n while i >= div:\n i = i-div\n divcount = divcount + 1\n div = div + 1\n \n count = count +divcount\n divcount = 0\n div = 1\nif divlist == [] and N >0:\n count = 1\nprint(count)", "code2": "\nimport math\nN = int(input())\nNsyo = N\ncount = 0\ndiv = 2\ndivcount = 0\ndivlist = []\nwhile N > 1 and div <= math.sqrt(Nsyo)+1:\n if N%div == 0:\n while N%div == 0:\n N = N/div\n divcount = divcount+1\n divlist.append(divcount)\n divcount = 0\n else:\n pass\n div = div + 1\ndiv = 1\ndivcount = 0\nfor i in divlist:\n while i >= div:\n i = i-div\n divcount = divcount + 1\n div = div + 1\n \n count = count +divcount\n divcount = 0\n div = 1\nif N > math.sqrt(Nsyo):\n count = count + 1\nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590977410", "date2": "1591032794", "bleu_score": "0.9450828051669027", "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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 67, "input": "88143713752\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n import math\n N = int(input())\n Nsyo = N\n count = 0\n div = 2\n divcount = 0\n divlist = []\n-while N > 1 and div <= math.sqrt(N):\n+while N > 1 and div <= math.sqrt(Nsyo)+1:\n if N%div == 0:\n while N%div == 0:\n N = N/div\n divcount = divcount+1\n divlist.append(divcount)\n divcount = 0\n else:\n pass\n div = div + 1\n div = 1\n divcount = 0\n for i in divlist:\n while i >= div:\n i = i-div\n divcount = divcount + 1\n div = div + 1\n \n count = count +divcount\n divcount = 0\n div = 1\n-if divlist == [] and N >0:\n- count = 1\n+if N > math.sqrt(Nsyo):\n+ count = count + 1\n print(count)\n", "FL_content": " \n import math\n N = int(input())\n Nsyo = N\n count = 0\n div = 2\n divcount = 0\n divlist = []\n-while N > 1 and div <= math.sqrt(N):\n if N%div == 0:\n while N%div == 0:\n N = N/div\n divcount = divcount+1\n divlist.append(divcount)\n divcount = 0\n else:\n pass\n div = div + 1\n div = 1\n divcount = 0\n for i in divlist:\n while i >= div:\n i = i-div\n divcount = divcount + 1\n div = div + 1\n \n count = count +divcount\n divcount = 0\n div = 1\n-if divlist == [] and N >0:\n- count = 1\n print(count)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 32 }, { "user_id": "u084357428", "problem_id": "p03943", "submission1_id": "s727177772", "submission2_id": "s876403968", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = [int(_) for _ in input().split()]\nprint('Yes' if a[0] == a[1] + a[2] else 'Yes' if a[1] == a[0] + a[2] else 'yes' if a[2] == a[0] + a[1] else 'No')", "code2": "a = [int(_) for _ in input().split()]\nprint('Yes' if a[0] == a[1] + a[2] else 'Yes' if a[1] == a[0] + a[2] else 'Yes' if a[2] == a[0] + a[1] else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567814274", "date2": "1567814405", "bleu_score": "0.9831913138216002", "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, 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": 98, "input": "4 29 33\n", "actual_output": "yes\n", "expected_output": "Yes\n\n", "anno_code": ["a = [int(_) for _ in input().split()] # (0): a=[4, 29, 33]\nprint('Yes' if a[0] == a[1] + a[2] else 'Yes' if a[1] == a[0] + a[2] else 'yes' if a[2] == a[0] + a[1] else 'No')"], "anno_status": [true], "diff_content": " a = [int(_) for _ in input().split()]\n-print('Yes' if a[0] == a[1] + a[2] else 'Yes' if a[1] == a[0] + a[2] else 'yes' if a[2] == a[0] + a[1] else 'No')\n+print('Yes' if a[0] == a[1] + a[2] else 'Yes' if a[1] == a[0] + a[2] else 'Yes' if a[2] == a[0] + a[1] else 'No')\n", "FL_content": " a = [int(_) for _ in input().split()]\n-print('Yes' if a[0] == a[1] + a[2] else 'Yes' if a[1] == a[0] + a[2] else 'yes' if a[2] == a[0] + a[1] else 'No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u108377418", "problem_id": "p03943", "submission1_id": "s812863444", "submission2_id": "s619810631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n a, b, c = map(int, input().split() )\n\n if a == b + c | b == c + a | c == a + b:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__ == \"__main__\":\n main()", "code2": "def main():\n a, b, c = map(int, input().split() )\n\n if a == b + c or b == c + a or c == a + b:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556596782", "date2": "1556596889", "bleu_score": "0.9576367320560569", "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, 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, 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, 0, 0, 1], "code1_test_score": 91, "total_score": 98, "input": "4 24 20\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["def main(): # (0): main=\n a, b, c = map(int, input().split() )\n\n if a == b + c | b == c + a | c == a + b:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " def main():\n a, b, c = map(int, input().split() )\n \n- if a == b + c | b == c + a | c == a + b:\n+ if a == b + c or b == c + a or c == a + b:\n print(\"Yes\")\n else:\n print(\"No\")\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " def main():\n a, b, c = map(int, input().split() )\n \n- if a == b + c | b == c + a | c == a + b:\n print(\"Yes\")\n else:\n print(\"No\")\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u785578220", "problem_id": "p03943", "submission1_id": "s955553210", "submission2_id": "s854459017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "l= list(map(int, input().split()))\nl.sort()\nif l[0] == l[1] + l[2]:\n print(\"Yes\")\nelse:print(\"No\")", "code2": "l= list(map(int, input().split()))\nl.sort()\nif l[2] == l[1] + l[0]:\n print(\"Yes\")\nelse:print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546211398", "date2": "1546211975", "bleu_score": "0.9845994285876474", "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, 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, 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, 0, 0, 1], "code1_test_score": 91, "total_score": 98, "input": "10 30 20\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["l= list(map(int, input().split())) # (0): l=[10, 30, 20]\nl.sort() # (1): l=[10, 20, 30]\nif l[0] == l[1] + l[2]: # (2): NO CHANGE\n print(\"Yes\")\nelse:print(\"No\")"], "anno_status": [true], "diff_content": " l= list(map(int, input().split()))\n l.sort()\n-if l[0] == l[1] + l[2]:\n+if l[2] == l[1] + l[0]:\n print(\"Yes\")\n else:print(\"No\")\n", "FL_content": " l= list(map(int, input().split()))\n l.sort()\n-if l[0] == l[1] + l[2]:\n print(\"Yes\")\n else:print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u246661425", "problem_id": "p03943", "submission1_id": "s060875300", "submission2_id": "s973385030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\nif a + b == c or a + c ==b or b + c == a:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a, b, c = map(int, input().split())\nif a + b == c or a + c ==b or b + c == a:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588653110", "date2": "1588653147", "bleu_score": "0.9476166749627912", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "000 1 1\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=0, b=1, c=1\nif a + b == c or a + c ==b or b + c == a: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a, b, c = map(int, input().split())\n if a + b == c or a + c ==b or b + c == a:\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 if a + b == c or a + c ==b or b + c == a:\n- print(\"YES\")\n else:\n- print(\"NO\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u453642820", "problem_id": "p03943", "submission1_id": "s981469154", "submission2_id": "s953978002", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=sorted(list(map(int,input().split())))\nprint(\"Yes\" if sum(A[:1])==A[2] else \"No\")", "code2": "A=sorted(list(map(int,input().split())))\nprint(\"Yes\" if sum(A[:2])==A[2] else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590348404", "date2": "1590348431", "bleu_score": "0.9690278768043126", "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, 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, 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, 0, 0, 1], "code1_test_score": 91, "total_score": 98, "input": "56 25 31\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["A=sorted(list(map(int,input().split()))) # (0): A=[25, 31, 56]\nprint(\"Yes\" if sum(A[:1])==A[2] else \"No\")"], "anno_status": [true], "diff_content": " A=sorted(list(map(int,input().split())))\n-print(\"Yes\" if sum(A[:1])==A[2] else \"No\")\n+print(\"Yes\" if sum(A[:2])==A[2] else \"No\")\n", "FL_content": " A=sorted(list(map(int,input().split())))\n-print(\"Yes\" if sum(A[:1])==A[2] else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u143492911", "problem_id": "p03943", "submission1_id": "s962387074", "submission2_id": "s282687654", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nif a+b==c:\n print(\"Yes\")\n exit()\nif b+c==a:\n print(\"Yes\")\nif a+c==b:\n print(\"Yes\")\nprint(\"No\")\n", "code2": "a,b,c=map(int,input().split())\nif a+b==c:\n print(\"Yes\")\n exit()\nif b+c==a:\n print(\"Yes\")\n exit()\nif a+c==b:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551126772", "date2": "1551126812", "bleu_score": "0.8579838026338018", "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, 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], "code1_test_score": 94, "total_score": 98, "input": "4 24 20\n", "actual_output": "Yes\nNo\n", "expected_output": "Yes\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=4, b=24, c=20\nif a+b==c: # (1): NO CHANGE\n print(\"Yes\")\n exit()\nif b+c==a: # (2): NO CHANGE\n print(\"Yes\")\nif a+c==b: # (3): NO CHANGE\n print(\"Yes\") # (4): NO CHANGE\nprint(\"No\")\n"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n if a+b==c:\n print(\"Yes\")\n exit()\n if b+c==a:\n print(\"Yes\")\n+ exit()\n if a+c==b:\n print(\"Yes\")\n+ exit()\n print(\"No\")\n \n", "FL_content": " a,b,c=map(int,input().split())\n if a+b==c:\n print(\"Yes\")\n exit()\n if b+c==a:\n print(\"Yes\")\n if a+c==b:\n print(\"Yes\")\n print(\"No\")\n \n", "added_lines": 2, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u594956556", "problem_id": "p03943", "submission1_id": "s550965215", "submission2_id": "s704542315", "status1": "Wrong Answer", "status2": "Accepted", "code1": "abc = list(map(int, input().split()))\nif abc[0]+abc[1] == abc[2]:\n print('Yes')\nelse:\n print('No')", "code2": "abc = list(map(int, input().split()))\nabc.sort()\nif abc[0]+abc[1] == abc[2]:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590455533", "date2": "1590455566", "bleu_score": "0.8890845833735551", "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, 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], "code1_test_score": 94, "total_score": 98, "input": "10 30 20\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["abc = list(map(int, input().split())) # (0): abc=[10, 30, 20]\nif abc[0]+abc[1] == abc[2]: # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " abc = list(map(int, input().split()))\n+abc.sort()\n if abc[0]+abc[1] == abc[2]:\n print('Yes')\n else:\n print('No')\n+\n", "FL_content": " abc = list(map(int, input().split()))\n if abc[0]+abc[1] == abc[2]:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u288087195", "problem_id": "p03943", "submission1_id": "s588860606", "submission2_id": "s957655250", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = [int(i) for i in input().split()] \na.sort()\nprint(a[0])\nc = a[0] + a[1]\nif (a[2] == c):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "a = [int(i) for i in input().split()] \na.sort()\nc = a[0] + a[1]\nif (a[2] == c):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527897579", "date2": "1527897627", "bleu_score": "0.8980535169215139", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "110 1 0\n", "actual_output": "0\nNo\n", "expected_output": "No\n\n", "anno_code": ["a = [int(i) for i in input().split()] # (0): a=[110, 1, 0]\na.sort() # (1): a=[0, 1, 110]\nprint(a[0]) # (2): NO CHANGE\nc = a[0] + a[1] # (3): c=1\nif (a[2] == c): # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " a = [int(i) for i in input().split()] \n a.sort()\n-print(a[0])\n c = a[0] + a[1]\n if (a[2] == c):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " a = [int(i) for i in input().split()] \n a.sort()\n-print(a[0])\n c = a[0] + a[1]\n if (a[2] == c):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u432805419", "problem_id": "p03943", "submission1_id": "s268509969", "submission2_id": "s692086119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(map(int,input().split()))\na.sort()\nif (a[0] + a[1]) == a[2]:\n print(\"Yes\")\nelse:\n print(\"NO\")\n", "code2": "a = list(map(int,input().split()))\na.sort()\nif (a[0] + a[1]) == a[2]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540958252", "date2": "1540958434", "bleu_score": "0.9756631177112198", "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, 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, 1, 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], "code1_test_score": 7, "total_score": 98, "input": "24 25 31\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a = list(map(int,input().split())) # (0): a=[24, 25, 31]\na.sort() # (1): NO CHANGE\nif (a[0] + a[1]) == a[2]: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"NO\")\n"], "anno_status": [true], "diff_content": " a = list(map(int,input().split()))\n a.sort()\n if (a[0] + a[1]) == a[2]:\n print(\"Yes\")\n else:\n- print(\"NO\")\n+ print(\"No\")\n \n", "FL_content": " a = list(map(int,input().split()))\n a.sort()\n if (a[0] + a[1]) == a[2]:\n print(\"Yes\")\n else:\n- print(\"NO\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u761062383", "problem_id": "p03943", "submission1_id": "s833143480", "submission2_id": "s933961429", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=[int(i) for i in input().split()]\nif a[0]==sum(a[1:]) or sum(a[:2])==a[2]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "a=[int(i) for i in input().split()]\nif a[0]==sum(a[1:]) or sum(a[:2])==a[2] or a[0]+a[2]==a[1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594401293", "date2": "1594401509", "bleu_score": "0.8462031406623735", "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, 0, 1], "code1_test_score": 96, "total_score": 98, "input": "10 30 20\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["a=[int(i) for i in input().split()] # (0): a=[10, 30, 20]\nif a[0]==sum(a[1:]) or sum(a[:2])==a[2]: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " a=[int(i) for i in input().split()]\n-if a[0]==sum(a[1:]) or sum(a[:2])==a[2]:\n+if a[0]==sum(a[1:]) or sum(a[:2])==a[2] or a[0]+a[2]==a[1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " a=[int(i) for i in input().split()]\n-if a[0]==sum(a[1:]) or sum(a[:2])==a[2]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u726439578", "problem_id": "p03943", "submission1_id": "s634751594", "submission2_id": "s842107692", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=list(map(int,input().split()))\na.sort()\nif a[0]+a[1]==a[2]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "code2": "a=list(map(int,input().split()))\na.sort()\nif a[0]+a[1]==a[2]:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546063179", "date2": "1546063476", "bleu_score": "0.9397639612620904", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "001 -1 -5\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a=list(map(int,input().split())) # (0): a=[1, -1, -5]\na.sort() # (1): a=[-5, -1, 1]\nif a[0]+a[1]==a[2]: # (2): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n\n"], "anno_status": [true], "diff_content": " a=list(map(int,input().split()))\n a.sort()\n if a[0]+a[1]==a[2]:\n- print(\"YES\")\n+ print(\"Yes\")\n else:\n- print(\"NO\")\n+ print(\"No\")\n \n \n", "FL_content": " a=list(map(int,input().split()))\n a.sort()\n if a[0]+a[1]==a[2]:\n- print(\"YES\")\n else:\n- print(\"NO\")\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u641722141", "problem_id": "p03943", "submission1_id": "s665848524", "submission2_id": "s303244232", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nif abs(a-b)==c:print('Yes')\nelse:print('No')", "code2": "a,b,c=map(int,input().split())\nif abs(a-b)==c or abs(b-c) ==a:print('Yes')\nelse:print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565026126", "date2": "1565026347", "bleu_score": "0.8041438513775604", "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, 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": 98, "input": "4 29 33\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=4, b=29, c=33\nif abs(a-b)==c:print('Yes') # (1): NO CHANGE\nelse:print('No')"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n-if abs(a-b)==c:print('Yes')\n+if abs(a-b)==c or abs(b-c) ==a:print('Yes')\n else:print('No')\n", "FL_content": " a,b,c=map(int,input().split())\n-if abs(a-b)==c:print('Yes')\n else:print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u046158516", "problem_id": "p03943", "submission1_id": "s862208104", "submission2_id": "s573155076", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=list(map(int,input().split()))\na.sort()\nif a[0]+a[1]>a[2]:\n print('No')\nelse:\n print('Yes')\n", "code2": "a=list(map(int,input().split()))\na.sort()\nif a[0]+a[1]==a[2]:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1594029445", "date2": "1594029474", "bleu_score": "0.9631321533466505", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 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, 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, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0], "code1_test_score": 17, "total_score": 98, "input": "43 16 000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a=list(map(int,input().split())) # (0): a=[43, 16, 0]\na.sort() # (1): a=[0, 16, 43]\nif a[0]+a[1]>a[2]: # (2): NO CHANGE\n print('No')\nelse:\n print('Yes')\n"], "anno_status": [true], "diff_content": " a=list(map(int,input().split()))\n a.sort()\n-if a[0]+a[1]>a[2]:\n- print('No')\n-else:\n+if a[0]+a[1]==a[2]:\n print('Yes')\n+else:\n+ print('No')\n \n", "FL_content": " a=list(map(int,input().split()))\n a.sort()\n-if a[0]+a[1]>a[2]:\n- print('No')\n-else:\n print('Yes')\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u366644013", "problem_id": "p03943", "submission1_id": "s181801980", "submission2_id": "s181489652", "status1": "Wrong Answer", "status2": "Accepted", "code1": "na = lambda: list(map(int, input().split()))\na, b, c = na()\nif a + b == c or b + c == a:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "na = lambda: list(map(int, input().split()))\na, b, c = na()\nif a + b == c or b + c == a or c + a == b:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535829761", "date2": "1535829815", "bleu_score": "0.8887728822550168", "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, 0, 1], "code1_test_score": 96, "total_score": 98, "input": "4 24 20\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["na = lambda: list(map(int, input().split())) # (0): na= at 0x0000021D2D179BD0>\na, b, c = na() # (1): a=4, b=24, c=20\nif a + b == c or b + c == a: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " na = lambda: list(map(int, input().split()))\n a, b, c = na()\n-if a + b == c or b + c == a:\n+if a + b == c or b + c == a or c + a == b:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " na = lambda: list(map(int, input().split()))\n a, b, c = na()\n-if a + b == c or b + c == a:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u608726540", "problem_id": "p03943", "submission1_id": "s598114851", "submission2_id": "s242710972", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nif (a+b+c)%2==0:\n print('Yes')\nelse:\n print('No')\n", "code2": "a,b,c=map(int,input().split())\nif max(a,b,c)==a+b+c-max(a,b,c):\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577805814", "date2": "1577824611", "bleu_score": "0.7594953912169685", "code1_test_status": [0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0], "code1_test_score": 53, "total_score": 98, "input": "001 0 -5\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=1, b=0, c=-5\nif (a+b+c)%2==0: # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n-if (a+b+c)%2==0:\n+if max(a,b,c)==a+b+c-max(a,b,c):\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " a,b,c=map(int,input().split())\n-if (a+b+c)%2==0:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u239342230", "problem_id": "p03943", "submission1_id": "s697170928", "submission2_id": "s551751435", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nprint('YES' if a==(b+c) or b==(a+c) or c==(a+b) else 'NO')", "code2": "a,b,c=map(int,input().split())\nprint('Yes' if a==(b+c) or b==(a+c) or c==(a+b) else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546282523", "date2": "1546282637", "bleu_score": "0.933722206512832", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "16 2 49\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=16, b=2, c=49\nprint('YES' if a==(b+c) or b==(a+c) or c==(a+b) else 'NO')"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n-print('YES' if a==(b+c) or b==(a+c) or c==(a+b) else 'NO')\n+print('Yes' if a==(b+c) or b==(a+c) or c==(a+b) else 'No')\n", "FL_content": " a,b,c=map(int,input().split())\n-print('YES' if a==(b+c) or b==(a+c) or c==(a+b) else 'NO')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u235066013", "problem_id": "p03943", "submission1_id": "s203461786", "submission2_id": "s729940869", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=[int(i) for i in input().split()]\nif a+b==c or b+c==a or c+a==b:\n print('YES')\nelse:\n print('NO')", "code2": "a,b,c=[int(i) for i in input().split()]\nif (a+b)==c or (b+c)==a or (c+a)==b:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587683196", "date2": "1587683388", "bleu_score": "0.8056613325458167", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "24 25 31\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a,b,c=[int(i) for i in input().split()] # (0): a=24, b=25, c=31\nif a+b==c or b+c==a or c+a==b: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a,b,c=[int(i) for i in input().split()]\n-if a+b==c or b+c==a or c+a==b:\n- print('YES')\n+if (a+b)==c or (b+c)==a or (c+a)==b:\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": " a,b,c=[int(i) for i in input().split()]\n-if a+b==c or b+c==a or c+a==b:\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u936035004", "problem_id": "p03943", "submission1_id": "s490246821", "submission2_id": "s409617715", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int,input().split())\nif a+b==c:\n\tprint(\"YES\")\nelif b+c==a:\n\tprint(\"YES\")\nelif a+c==b:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "code2": "a,b,c = map(int,input().split())\nif a+b==c:\n\tprint(\"Yes\")\nelif b+c==a:\n\tprint(\"Yes\")\nelif a+c==b:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566928444", "date2": "1566928507", "bleu_score": "0.8998835786290806", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "6 16 101\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a,b,c = map(int,input().split()) # (0): a=6, b=16, c=101\nif a+b==c: # (1): NO CHANGE\n\tprint(\"YES\")\nelif b+c==a: # (2): NO CHANGE\n\tprint(\"YES\")\nelif a+c==b: # (3): NO CHANGE\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")"], "anno_status": [true], "diff_content": " a,b,c = map(int,input().split())\n if a+b==c:\n-\tprint(\"YES\")\n+\tprint(\"Yes\")\n elif b+c==a:\n-\tprint(\"YES\")\n+\tprint(\"Yes\")\n elif a+c==b:\n-\tprint(\"YES\")\n+\tprint(\"Yes\")\n else:\n-\tprint(\"NO\")\n+\tprint(\"No\")\n", "FL_content": " a,b,c = map(int,input().split())\n if a+b==c:\n-\tprint(\"YES\")\n elif b+c==a:\n-\tprint(\"YES\")\n elif a+c==b:\n-\tprint(\"YES\")\n else:\n-\tprint(\"NO\")\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u715114989", "problem_id": "p03943", "submission1_id": "s692124568", "submission2_id": "s857904207", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int,input().split())\n\nif a+b == c or a+c == b or b+c ==a:\n print(\"yes\")\nelse:\n print(\"no\")\n ", "code2": "a,b,c = map(int,input().split())\n\nif a+b == c or a+c == b or b+c ==a:\n print(\"Yes\")\nelse:\n print(\"No\")\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560396741", "date2": "1560396788", "bleu_score": "0.9521292437086781", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "106 25 31\n", "actual_output": "no\n", "expected_output": "No\n\n", "anno_code": ["a,b,c = map(int,input().split()) # (0): a=106, b=25, c=31\n\nif a+b == c or a+c == b or b+c ==a: # (1): NO CHANGE\n print(\"yes\")\nelse:\n print(\"no\")\n "], "anno_status": [true], "diff_content": " a,b,c = map(int,input().split())\n \n if a+b == c or a+c == b or b+c ==a:\n- print(\"yes\")\n+ print(\"Yes\")\n else:\n- print(\"no\")\n+ print(\"No\")\n \n", "FL_content": " a,b,c = map(int,input().split())\n \n if a+b == c or a+c == b or b+c ==a:\n- print(\"yes\")\n else:\n- print(\"no\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u337851472", "problem_id": "p03943", "submission1_id": "s806050599", "submission2_id": "s886348695", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int,input().split())\nprint(\"YES\" if (a+b) == c or (b+c) == a or (c+a) == b else \"NO\")", "code2": "a, b, c = map(int,input().split())\nprint(\"Yes\" if (a+b) == c or (b+c) == a or (c+a) == b else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550013443", "date2": "1550013505", "bleu_score": "0.9405757583550864", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "6 16 001\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a, b, c = map(int,input().split()) # (0): a=6, b=16, c=1\nprint(\"YES\" if (a+b) == c or (b+c) == a or (c+a) == b else \"NO\")"], "anno_status": [true], "diff_content": " a, b, c = map(int,input().split())\n-print(\"YES\" if (a+b) == c or (b+c) == a or (c+a) == b else \"NO\")\n+print(\"Yes\" if (a+b) == c or (b+c) == a or (c+a) == b else \"No\")\n", "FL_content": " a, b, c = map(int,input().split())\n-print(\"YES\" if (a+b) == c or (b+c) == a or (c+a) == b else \"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u707870100", "problem_id": "p03613", "submission1_id": "s082972706", "submission2_id": "s759835051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\ta=b\n\t\t\tb=c\n\t\t\tc=1\n\telse:\n\t\tc+=1\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\n\nprint(maxhoge)\n\n", "code2": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\tif(hoge[i+1]-hoge[i]==1):\n\t\t\t\ta=b\n\t\t\t\tb=c\n\t\t\t\tc=1\n\t\t\telif(hoge[i+1]-hoge[i]==2):\n\t\t\t\ta=c\n\t\t\t\tb=0\n\t\t\t\tc=1\n\t\t\telse:\n\t\t\t\ta=0\n\t\t\t\tb=0\n\t\t\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565656396", "date2": "1565657088", "bleu_score": "0.7184133943325404", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 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, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "10\n0 1 1 3 2 8 4 7 8 7\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["\n\nimport copy\nimport sys\nimport math\n\nn = int(input()) # (0): n=10\ntmp = input().split() # (1): tmp=['0', '1', '1', '3', '2', '8', '4', '7', '8', '7']\nhoge = list(map(lambda a: int(a), tmp)) # (2): hoge=[0, 1, 1, 3, 2, 8, 4, 7, 8, 7]\n\nhoge.sort() # (3): hoge=[0, 1, 1, 2, 3, 4, 7, 7, 8, 8]\nhoge.append(-1) # (4): hoge=[0, 1, 1, 2, 3, 4, 7, 7, 8, 8, -1]\na=0 # (5): a=0\nb=0 # (6): b=0\nc=1 # (7): c=1\nmaxhoge=0 # (8): maxhoge=0\nfor i in range(0,n): # (9): i=0 (16): i=1 ... (67): NO CHANGE\n\tif(hoge[i]!=hoge[i+1]): # (10): NO CHANGE (17): NO CHANGE ... (64): NO CHANGE\n\t\tif(i!=n-1): # (11): NO CHANGE (22): NO CHANGE ... (65): NO CHANGE\n\t\t\ta=b # (12): NO CHANGE (23): a=1 ... (55): NO CHANGE\n\t\t\tb=c # (13): b=1 (24): b=2 ... (56): b=2\n\t\t\tc=1 # (14): NO CHANGE (25): c=1 ... (57): c=1\n\telse:\n\t\tc+=1 # (18): c=2 (50): c=2 (61): c=2\n\tmaxhoge=max(maxhoge,a+b+c) # (15): maxhoge=2 (19): maxhoge=3 ... (66): NO CHANGE\n\n\n\n\n\nprint(maxhoge)\n\n"], "anno_status": [true], "diff_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n \t\tif(i!=n-1):\n-\t\t\ta=b\n-\t\t\tb=c\n-\t\t\tc=1\n+\t\t\tif(hoge[i+1]-hoge[i]==1):\n+\t\t\t\ta=b\n+\t\t\t\tb=c\n+\t\t\t\tc=1\n+\t\t\telif(hoge[i+1]-hoge[i]==2):\n+\t\t\t\ta=c\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n+\t\t\telse:\n+\t\t\t\ta=0\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n \telse:\n \t\tc+=1\n-\tmaxhoge=max(maxhoge,a+b+c)\n \n \n+\tmaxhoge=max(maxhoge,a+b+c)\n+\n \n \n \n print(maxhoge)\n \n \n", "FL_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n \t\tif(i!=n-1):\n-\t\t\ta=b\n-\t\t\tb=c\n-\t\t\tc=1\n \telse:\n \t\tc+=1\n-\tmaxhoge=max(maxhoge,a+b+c)\n \n \n \n \n \n print(maxhoge)\n \n \n", "added_lines": 14, "removed_lines": 4, "code1_lines": 33 }, { "user_id": "u408375121", "problem_id": "p03613", "submission1_id": "s174600321", "submission2_id": "s870084064", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nd = [0] * (10**5 + 2)\nneg_count = 0\nfor i in range(len(a)):\n d[a[i] - 1] += 1\n d[a[i]] += 1\n d[a[i] + 1] += 1\nans = max(d)", "code2": "n = int(input())\na = list(map(int, input().split()))\nd = [0] * (10**5 + 2)\nneg_count = 0\nfor i in range(len(a)):\n d[a[i] - 1] += 1\n d[a[i]] += 1\n d[a[i] + 1] += 1\nans = max(d)\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593712097", "date2": "1593712126", "bleu_score": "0.9413311822758483", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n3 1 2 1 5 9 0\n", "actual_output": "", "expected_output": "4\n\n", "anno_code": ["n = int(input()) # (0): n=7\na = list(map(int, input().split())) # (1): a=[3, 1, 2, 1, 5, 9, 0]\nd = [0] * (10**5 + 2) # (2): d=[0, 0, ..., 0, 0]\nneg_count = 0 # (3): neg_count=0\nfor i in range(len(a)): # (4): i=0 (8): i=1 ... (32): NO CHANGE\n d[a[i] - 1] += 1 # (5): d=[0, 0, ..., 0, 0] (9): d=[1, 0, ..., 0, 0] ... (29): d=[2, 3, ..., 0, 1]\n d[a[i]] += 1 # (6): d=[0, 0, ..., 0, 0] (10): d=[1, 1, ..., 0, 0] ... (30): d=[3, 3, ..., 0, 1]\n d[a[i] + 1] += 1 # (7): d=[0, 0, ..., 0, 0] (11): d=[1, 1, ..., 0, 0] ... (31): d=[3, 4, ..., 0, 1]\nans = max(d)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n d = [0] * (10**5 + 2)\n neg_count = 0\n for i in range(len(a)):\n d[a[i] - 1] += 1\n d[a[i]] += 1\n d[a[i] + 1] += 1\n ans = max(d)\n+print(ans)\n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n d = [0] * (10**5 + 2)\n neg_count = 0\n for i in range(len(a)):\n d[a[i] - 1] += 1\n d[a[i]] += 1\n d[a[i] + 1] += 1\n ans = max(d)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u707870100", "problem_id": "p03613", "submission1_id": "s378701862", "submission2_id": "s759835051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(0)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tmaxhoge=max(maxhoge,a+b+c)\n\tif(hoge[i]!=hoge[i+1]):\n\t\ta=b\n\t\tb=c\n\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\n\nprint(maxhoge)\n\n", "code2": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\tif(hoge[i+1]-hoge[i]==1):\n\t\t\t\ta=b\n\t\t\t\tb=c\n\t\t\t\tc=1\n\t\t\telif(hoge[i+1]-hoge[i]==2):\n\t\t\t\ta=c\n\t\t\t\tb=0\n\t\t\t\tc=1\n\t\t\telse:\n\t\t\t\ta=0\n\t\t\t\tb=0\n\t\t\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565656143", "date2": "1565657088", "bleu_score": "0.6661883663806761", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 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, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "10\n-1 2 1 5 8 4 8 4 17 0\n", "actual_output": "5\n", "expected_output": "3\n\n", "anno_code": ["\n\nimport copy\nimport sys\nimport math\n\nn = int(input()) # (0): n=10\ntmp = input().split() # (1): tmp=['-1', '2', '1', '5', '8', '4', '8', '4', '17', '0']\nhoge = list(map(lambda a: int(a), tmp)) # (2): hoge=[-1, 2, 1, 5, 8, 4, 8, 4, 17, 0]\n\nhoge.sort() # (3): hoge=[-1, 0, 1, 2, 4, 4, 5, 8, 8, 17]\nhoge.append(0) # (4): hoge=[-1, 0, 1, 2, 4, 4, 5, 8, 8, 17, 0]\na=0 # (5): a=0\nb=0 # (6): b=0\nc=1 # (7): c=1\nmaxhoge=0 # (8): maxhoge=0\nfor i in range(0,n): # (9): i=0 (15): i=1 ... (65): NO CHANGE\n\tmaxhoge=max(maxhoge,a+b+c) # (10): maxhoge=1 (16): maxhoge=2 ... (60): NO CHANGE\n\tif(hoge[i]!=hoge[i+1]): # (11): NO CHANGE (17): NO CHANGE ... (61): NO CHANGE\n\t\ta=b # (12): NO CHANGE (18): a=1 ... (62): a=2\n\t\tb=c # (13): b=1 (19): NO CHANGE ... (63): b=1\n\t\tc=1 # (14): NO CHANGE (20): NO CHANGE ... (64): NO CHANGE\n\telse:\n\t\tc+=1 # (36): c=2 (52): c=2\n\n\n\n\nprint(maxhoge)\n\n"], "anno_status": [true], "diff_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n-hoge.append(0)\n+hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n-\tmaxhoge=max(maxhoge,a+b+c)\n \tif(hoge[i]!=hoge[i+1]):\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n+\t\tif(i!=n-1):\n+\t\t\tif(hoge[i+1]-hoge[i]==1):\n+\t\t\t\ta=b\n+\t\t\t\tb=c\n+\t\t\t\tc=1\n+\t\t\telif(hoge[i+1]-hoge[i]==2):\n+\t\t\t\ta=c\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n+\t\t\telse:\n+\t\t\t\ta=0\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n \telse:\n \t\tc+=1\n \n \n+\tmaxhoge=max(maxhoge,a+b+c)\n+\n+\n \n \n print(maxhoge)\n \n \n", "FL_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n-hoge.append(0)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n-\tmaxhoge=max(maxhoge,a+b+c)\n \tif(hoge[i]!=hoge[i+1]):\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n \telse:\n \t\tc+=1\n \n \n \n \n print(maxhoge)\n \n \n", "added_lines": 17, "removed_lines": 5, "code1_lines": 31 }, { "user_id": "u707870100", "problem_id": "p03613", "submission1_id": "s123805855", "submission2_id": "s759835051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\ta=b\n\t\tb=c\n\t\tc=1\n\telse:\n\t\tc+=1\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "code2": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\tif(hoge[i+1]-hoge[i]==1):\n\t\t\t\ta=b\n\t\t\t\tb=c\n\t\t\t\tc=1\n\t\t\telif(hoge[i+1]-hoge[i]==2):\n\t\t\t\ta=c\n\t\t\t\tb=0\n\t\t\t\tc=1\n\t\t\telse:\n\t\t\t\ta=0\n\t\t\t\tb=0\n\t\t\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565656067", "date2": "1565657088", "bleu_score": "0.675523687780887", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 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, 0, 1, 0, 1], "code1_test_score": 86, "total_score": 103, "input": "10\n0 1 1 5 5 2 8 7 14 2\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["\n\nimport copy\nimport sys\nimport math\n\nn = int(input()) # (0): n=10\ntmp = input().split() # (1): tmp=['0', '1', '1', '5', '5', '2', '8', '7', '14', '2']\nhoge = list(map(lambda a: int(a), tmp)) # (2): hoge=[0, 1, 1, 5, 5, 2, 8, 7, 14, 2]\n\nhoge.sort() # (3): hoge=[0, 1, 1, 2, 2, 5, 5, 7, 8, 14]\nhoge.append(-1) # (4): hoge=[0, 1, 1, 2, 2, 5, 5, 7, 8, 14, -1]\na=0 # (5): a=0\nb=0 # (6): b=0\nc=1 # (7): c=1\nmaxhoge=0 # (8): maxhoge=0\nfor i in range(0,n): # (9): i=0 (15): i=1 ... (63): NO CHANGE\n\tif(hoge[i]!=hoge[i+1]): # (10): NO CHANGE (16): NO CHANGE ... (58): NO CHANGE\n\t\ta=b # (11): NO CHANGE (21): a=1 ... (59): NO CHANGE\n\t\tb=c # (12): b=1 (22): b=2 ... (60): NO CHANGE\n\t\tc=1 # (13): NO CHANGE (23): c=1 ... (61): NO CHANGE\n\telse:\n\t\tc+=1 # (17): c=2 (27): c=2 (37): c=2\n\tmaxhoge=max(maxhoge,a+b+c) # (14): maxhoge=2 (18): maxhoge=3 ... (62): NO CHANGE\n\n\n\n\nprint(maxhoge)\n\n"], "anno_status": [true], "diff_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n+\t\tif(i!=n-1):\n+\t\t\tif(hoge[i+1]-hoge[i]==1):\n+\t\t\t\ta=b\n+\t\t\t\tb=c\n+\t\t\t\tc=1\n+\t\t\telif(hoge[i+1]-hoge[i]==2):\n+\t\t\t\ta=c\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n+\t\t\telse:\n+\t\t\t\ta=0\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n \telse:\n \t\tc+=1\n+\n+\n \tmaxhoge=max(maxhoge,a+b+c)\n \n \n \n \n print(maxhoge)\n \n \n", "FL_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n \telse:\n \t\tc+=1\n \tmaxhoge=max(maxhoge,a+b+c)\n \n \n \n \n print(maxhoge)\n \n \n", "added_lines": 15, "removed_lines": 3, "code1_lines": 31 }, { "user_id": "u401487574", "problem_id": "p03613", "submission1_id": "s399541319", "submission2_id": "s027671879", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ma = lambda :map(int,input().split())\nlma = lambda :list(map(int,input().split()))\nni = lambda:int(input())\nyn = lambda fl:print(\"Yes\") if fl else print(\"No\")\nimport collections\nimport math\nimport itertools\nimport heapq as hq\nn = ni()\nA = lma()\nl = max(A)\ncnts = [0 for i in range(l+2)]\nfor a in A:\n cnts[a]+=1\n cnts[a-1] +=1\n cnts[a+1] +=1\nprint(max(cnts))\n", "code2": "ma = lambda :map(int,input().split())\nlma = lambda :list(map(int,input().split()))\nni = lambda:int(input())\nyn = lambda fl:print(\"Yes\") if fl else print(\"No\")\nimport collections\nimport math\nimport itertools\nimport heapq as hq\nn = ni()\nA = lma()\nl = max(A)\ncnts = [0 for i in range(l+3)]\nfor a in A:\n cnts[a]+=1\n cnts[a-1] +=1\n cnts[a+1] +=1\nprint(max(cnts))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597356277", "date2": "1597356397", "bleu_score": "0.9931458579304587", "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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 98, "total_score": 103, "input": "7\n1 2 2 -1 1 1 1\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["ma = lambda :map(int,input().split()) # (0): ma= at 0x000001921EB79BD0>\nlma = lambda :list(map(int,input().split())) # (1): lma= at 0x000001921EB79B40>\nni = lambda:int(input()) # (2): ni= at 0x000001921EB79C60>\nyn = lambda fl:print(\"Yes\") if fl else print(\"No\") # (3): yn= at 0x000001921EB79CF0>, collections=, math=, itertools=, hq=\nimport collections\nimport math\nimport itertools\nimport heapq as hq\nn = ni() # (4): n=7\nA = lma() # (5): A=[1, 2, 2, -1, 1, 1, 1]\nl = max(A) # (6): l=2\ncnts = [0 for i in range(l+2)] # (7): cnts=[0, 0, 0, 0]\nfor a in A: # (8): a=1 (12): a=2 ... (36): NO CHANGE\n cnts[a]+=1 # (9): cnts=[0, 1, 0, 0] (13): cnts=[1, 1, 2, 0] ... (33): cnts=[4, 6, 6, 3]\n cnts[a-1] +=1 # (10): cnts=[1, 1, 0, 0] (14): cnts=[1, 2, 2, 0] ... (34): cnts=[5, 6, 6, 3]\n cnts[a+1] +=1 # (11): cnts=[1, 1, 1, 0] (15): cnts=[1, 2, 2, 1] ... (35): cnts=[5, 6, 7, 3]\nprint(max(cnts))\n"], "anno_status": [true], "diff_content": " ma = lambda :map(int,input().split())\n lma = lambda :list(map(int,input().split()))\n ni = lambda:int(input())\n yn = lambda fl:print(\"Yes\") if fl else print(\"No\")\n import collections\n import math\n import itertools\n import heapq as hq\n n = ni()\n A = lma()\n l = max(A)\n-cnts = [0 for i in range(l+2)]\n+cnts = [0 for i in range(l+3)]\n for a in A:\n cnts[a]+=1\n cnts[a-1] +=1\n cnts[a+1] +=1\n print(max(cnts))\n \n", "FL_content": " ma = lambda :map(int,input().split())\n lma = lambda :list(map(int,input().split()))\n ni = lambda:int(input())\n yn = lambda fl:print(\"Yes\") if fl else print(\"No\")\n import collections\n import math\n import itertools\n import heapq as hq\n n = ni()\n A = lma()\n l = max(A)\n-cnts = [0 for i in range(l+2)]\n for a in A:\n cnts[a]+=1\n cnts[a-1] +=1\n cnts[a+1] +=1\n print(max(cnts))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u188745744", "problem_id": "p03613", "submission1_id": "s202165346", "submission2_id": "s790945575", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=int(input())\nn_l=list(map(int,input().split()))\nimport collections\nans=0\nn_l=collections.Counter(n_l)\nfor i in range(1,100001):\n ans=max(ans,n_l[i]+n_l[i+1]+n_l[i+2])\nprint(ans)", "code2": "A=int(input())\nn_l=list(map(int,input().split()))\nimport collections\nans=0\nn_l=collections.Counter(n_l)\nfor i in range(0,100001):\n ans=max(ans,n_l[i]+n_l[i+1]+n_l[i+2])\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589548314", "date2": "1589548446", "bleu_score": "0.986012856208516", "code1_test_status": [1, 1, 1, 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, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 103, "input": "10\n0 2 1 5 3 2 8 4 20 0\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " A=int(input())\n n_l=list(map(int,input().split()))\n import collections\n ans=0\n n_l=collections.Counter(n_l)\n-for i in range(1,100001):\n+for i in range(0,100001):\n ans=max(ans,n_l[i]+n_l[i+1]+n_l[i+2])\n print(ans)\n", "FL_content": " A=int(input())\n n_l=list(map(int,input().split()))\n import collections\n ans=0\n n_l=collections.Counter(n_l)\n-for i in range(1,100001):\n ans=max(ans,n_l[i]+n_l[i+1]+n_l[i+2])\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u707870100", "problem_id": "p03613", "submission1_id": "s665650813", "submission2_id": "s759835051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tmaxhoge=max(maxhoge,a+b+c)\n\t\ta=b\n\t\tb=c\n\t\tc=1\n\telse:\n\t\tc+=1\n\tif(i==n-1):\n\t\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "code2": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\tif(hoge[i+1]-hoge[i]==1):\n\t\t\t\ta=b\n\t\t\t\tb=c\n\t\t\t\tc=1\n\t\t\telif(hoge[i+1]-hoge[i]==2):\n\t\t\t\ta=c\n\t\t\t\tb=0\n\t\t\t\tc=1\n\t\t\telse:\n\t\t\t\ta=0\n\t\t\t\tb=0\n\t\t\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565655743", "date2": "1565657088", "bleu_score": "0.7202359832792741", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 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, 0, 1, 0, 1], "code1_test_score": 86, "total_score": 103, "input": "7\n1 1 2 -1 2 2 1\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["\n\nimport copy\nimport sys\nimport math\n\nn = int(input()) # (0): n=7\ntmp = input().split() # (1): tmp=['1', '1', '2', '-1', '2', '2', '1']\nhoge = list(map(lambda a: int(a), tmp)) # (2): hoge=[1, 1, 2, -1, 2, 2, 1]\n\nhoge.sort() # (3): hoge=[-1, 1, 1, 1, 2, 2, 2]\nhoge.append(-1) # (4): hoge=[-1, 1, 1, 1, 2, 2, 2, -1]\na=0 # (5): a=0\nb=0 # (6): b=0\nc=1 # (7): c=1\nmaxhoge=0 # (8): maxhoge=0\nfor i in range(0,n): # (9): i=0 (16): i=1 ... (47): NO CHANGE\n\tif(hoge[i]!=hoge[i+1]): # (10): NO CHANGE (17): NO CHANGE ... (40): NO CHANGE\n\t\tmaxhoge=max(maxhoge,a+b+c) # (11): maxhoge=1 (26): maxhoge=4 (41): maxhoge=7\n\t\ta=b # (12): NO CHANGE (27): a=1 (42): a=3\n\t\tb=c # (13): b=1 (28): b=3 (43): NO CHANGE\n\t\tc=1 # (14): NO CHANGE (29): c=1 (44): c=1\n\telse:\n\t\tc+=1 # (18): c=2 (22): c=3 ... (37): c=3\n\tif(i==n-1): # (15): NO CHANGE (19): NO CHANGE ... (45): NO CHANGE\n\t\tmaxhoge=max(maxhoge,a+b+c) # (46): NO CHANGE\n\n\n\n\nprint(maxhoge)\n\n"], "anno_status": [true], "diff_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n-\t\tmaxhoge=max(maxhoge,a+b+c)\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n+\t\tif(i!=n-1):\n+\t\t\tif(hoge[i+1]-hoge[i]==1):\n+\t\t\t\ta=b\n+\t\t\t\tb=c\n+\t\t\t\tc=1\n+\t\t\telif(hoge[i+1]-hoge[i]==2):\n+\t\t\t\ta=c\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n+\t\t\telse:\n+\t\t\t\ta=0\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n \telse:\n \t\tc+=1\n-\tif(i==n-1):\n-\t\tmaxhoge=max(maxhoge,a+b+c)\n+\n+\n+\tmaxhoge=max(maxhoge,a+b+c)\n \n \n \n \n print(maxhoge)\n \n \n", "FL_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n-\t\tmaxhoge=max(maxhoge,a+b+c)\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n \telse:\n \t\tc+=1\n-\tif(i==n-1):\n-\t\tmaxhoge=max(maxhoge,a+b+c)\n \n \n \n \n print(maxhoge)\n \n \n", "added_lines": 16, "removed_lines": 6, "code1_lines": 33 }, { "user_id": "u372345564", "problem_id": "p03613", "submission1_id": "s732139941", "submission2_id": "s888703499", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N = int(input())\n a = [int(i) for i in input().split()]\n \n \n \n count_ = [0] * ( max(a)+1 )\n \n \n \n \n \n for num in a:\n if(num-1 > 0):\n count_[num-1] += 1\n count_[num-2] += 1\n count_[num] += 1\n else:\n count_[num-1] += 1\n count_[num] += 1\n \n \n print(max(count_))\n \nif __name__==\"__main__\":\n main()", "code2": "def main():\n N = int(input())\n a = [int(i) for i in input().split()]\n \n \n \n count_ = [0] * ( max(a)+2 )\n \n \n \n \n \n for num in a:\n if(num > 0):\n count_[num-1] += 1\n count_[num] += 1\n count_[num+1] += 1\n else:\n count_[num] += 1\n count_[num+1] += 1\n \n \n print(max(count_))\n \nif __name__==\"__main__\":\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1505341767", "date2": "1505342500", "bleu_score": "0.9734539898199122", "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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 98, "total_score": 103, "input": "7\n3 2 2 -2 1 3 1\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["def main(): # (0): main=\n N = int(input())\n a = [int(i) for i in input().split()]\n \n \n \n count_ = [0] * ( max(a)+1 )\n \n \n \n \n \n for num in a:\n if(num-1 > 0):\n count_[num-1] += 1\n count_[num-2] += 1\n count_[num] += 1\n else:\n count_[num-1] += 1\n count_[num] += 1\n \n \n print(max(count_))\n \nif __name__==\"__main__\":\n main()"], "anno_status": [true], "diff_content": " def main():\n N = int(input())\n a = [int(i) for i in input().split()]\n \n \n \n- count_ = [0] * ( max(a)+1 )\n+ count_ = [0] * ( max(a)+2 )\n \n \n \n \n \n for num in a:\n- if(num-1 > 0):\n+ if(num > 0):\n count_[num-1] += 1\n- count_[num-2] += 1\n count_[num] += 1\n+ count_[num+1] += 1\n else:\n- count_[num-1] += 1\n count_[num] += 1\n+ count_[num+1] += 1\n \n \n print(max(count_))\n \n if __name__==\"__main__\":\n main()\n", "FL_content": " def main():\n N = int(input())\n a = [int(i) for i in input().split()]\n \n \n \n- count_ = [0] * ( max(a)+1 )\n \n \n \n \n \n for num in a:\n- if(num-1 > 0):\n count_[num-1] += 1\n- count_[num-2] += 1\n count_[num] += 1\n else:\n- count_[num-1] += 1\n count_[num] += 1\n \n \n print(max(count_))\n \n if __name__==\"__main__\":\n main()\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 26 }, { "user_id": "u707870100", "problem_id": "p03613", "submission1_id": "s509989576", "submission2_id": "s759835051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\ta=b\n\t\t\tb=c\n\t\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "code2": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\tif(hoge[i+1]-hoge[i]==1):\n\t\t\t\ta=b\n\t\t\t\tb=c\n\t\t\t\tc=1\n\t\t\telif(hoge[i+1]-hoge[i]==2):\n\t\t\t\ta=c\n\t\t\t\tb=0\n\t\t\t\tc=1\n\t\t\telse:\n\t\t\t\ta=0\n\t\t\t\tb=0\n\t\t\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565656598", "date2": "1565657088", "bleu_score": "0.7218981209541713", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 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, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "10\n-1 2 1 5 8 4 8 4 20 0\n", "actual_output": "5\n", "expected_output": "3\n\n", "anno_code": ["\n\nimport copy\nimport sys\nimport math\n\nn = int(input()) # (0): n=10\ntmp = input().split() # (1): tmp=['-1', '2', '1', '5', '8', '4', '8', '4', '20', '0']\nhoge = list(map(lambda a: int(a), tmp)) # (2): hoge=[-1, 2, 1, 5, 8, 4, 8, 4, 20, 0]\n\nhoge.sort() # (3): hoge=[-1, 0, 1, 2, 4, 4, 5, 8, 8, 20]\nhoge.append(-1) # (4): hoge=[-1, 0, 1, 2, 4, 4, 5, 8, 8, 20, -1]\na=0 # (5): a=0\nb=0 # (6): b=0\nc=1 # (7): c=1\nmaxhoge=0 # (8): maxhoge=0\nfor i in range(0,n): # (9): i=0 (16): i=1 ... (70): NO CHANGE\n\tif(hoge[i]!=hoge[i+1]): # (10): NO CHANGE (17): NO CHANGE ... (67): NO CHANGE\n\t\tif(i!=n-1): # (11): NO CHANGE (18): NO CHANGE ... (68): NO CHANGE\n\t\t\ta=b # (12): NO CHANGE (19): a=1 ... (62): a=1\n\t\t\tb=c # (13): b=1 (20): NO CHANGE ... (63): b=2\n\t\t\tc=1 # (14): NO CHANGE (21): NO CHANGE ... (64): c=1\n\telse:\n\t\tc+=1 # (39): c=2 (57): c=2\n\n\n\tmaxhoge=max(maxhoge,a+b+c) # (15): maxhoge=2 (22): maxhoge=3 ... (69): NO CHANGE\n\n\n\n\nprint(maxhoge)\n\n"], "anno_status": [true], "diff_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n \t\tif(i!=n-1):\n-\t\t\ta=b\n-\t\t\tb=c\n-\t\t\tc=1\n+\t\t\tif(hoge[i+1]-hoge[i]==1):\n+\t\t\t\ta=b\n+\t\t\t\tb=c\n+\t\t\t\tc=1\n+\t\t\telif(hoge[i+1]-hoge[i]==2):\n+\t\t\t\ta=c\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n+\t\t\telse:\n+\t\t\t\ta=0\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n \telse:\n \t\tc+=1\n \n \n \tmaxhoge=max(maxhoge,a+b+c)\n \n \n \n \n print(maxhoge)\n \n \n", "FL_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n \t\tif(i!=n-1):\n-\t\t\ta=b\n-\t\t\tb=c\n-\t\t\tc=1\n \telse:\n \t\tc+=1\n \n \n \tmaxhoge=max(maxhoge,a+b+c)\n \n \n \n \n print(maxhoge)\n \n \n", "added_lines": 12, "removed_lines": 3, "code1_lines": 34 }, { "user_id": "u276192130", "problem_id": "p03613", "submission1_id": "s289214295", "submission2_id": "s240071294", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nnum = [0 for i in range(max(a)+2)]\nfor i in a:\n num[i] += 1\ntemp = 0\nans = 0\nfor i in range(max(a)):\n temp = num[i] + num[i+1] + num[i+2]\n ans = max(temp, ans)\nprint(ans)", "code2": "n = int(input())\na = list(map(int, input().split()))\nnum = [0 for i in range(max(a)+3)]\nfor i in a:\n num[i] += 1\nans = 0\nfor i in range(max(a)+1):\n temp = num[i] + num[i+1] + num[i+2]\n ans = max(temp, ans)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521063812", "date2": "1521064039", "bleu_score": "0.9399311090617818", "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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 98, "total_score": 103, "input": "7\n1 1 2 -1 2 2 1\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["n = int(input()) # (0): n=7\na = list(map(int, input().split())) # (1): a=[1, 1, 2, -1, 2, 2, 1]\nnum = [0 for i in range(max(a)+2)] # (2): num=[0, 0, 0, 0]\nfor i in a: # (3): i=1 (5): NO CHANGE ... (17): NO CHANGE\n num[i] += 1 # (4): num=[0, 1, 0, 0] (6): num=[0, 2, 0, 0] ... (16): num=[0, 3, 3, 1]\ntemp = 0 # (18): temp=0\nans = 0 # (19): ans=0\nfor i in range(max(a)): # (20): i=0 (23): i=1 (26): NO CHANGE\n temp = num[i] + num[i+1] + num[i+2] # (21): temp=6 (24): temp=7\n ans = max(temp, ans) # (22): ans=6 (25): ans=7\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n-num = [0 for i in range(max(a)+2)]\n+num = [0 for i in range(max(a)+3)]\n for i in a:\n num[i] += 1\n-temp = 0\n ans = 0\n-for i in range(max(a)):\n+for i in range(max(a)+1):\n temp = num[i] + num[i+1] + num[i+2]\n ans = max(temp, ans)\n print(ans)\n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n-num = [0 for i in range(max(a)+2)]\n for i in a:\n num[i] += 1\n-temp = 0\n ans = 0\n-for i in range(max(a)):\n temp = num[i] + num[i+1] + num[i+2]\n ans = max(temp, ans)\n print(ans)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u707870100", "problem_id": "p03613", "submission1_id": "s407361684", "submission2_id": "s759835051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tmaxhoge=max(maxhoge,a+b+c)\n\t\ta=b\n\t\tb=c\n\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\n\nprint(maxhoge)\n\n", "code2": "\n\nimport copy\nimport sys\nimport math\n\nn = int(input())\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\n\nhoge.sort()\nhoge.append(-1)\na=0\nb=0\nc=1\nmaxhoge=0\nfor i in range(0,n):\n\tif(hoge[i]!=hoge[i+1]):\n\t\tif(i!=n-1):\n\t\t\tif(hoge[i+1]-hoge[i]==1):\n\t\t\t\ta=b\n\t\t\t\tb=c\n\t\t\t\tc=1\n\t\t\telif(hoge[i+1]-hoge[i]==2):\n\t\t\t\ta=c\n\t\t\t\tb=0\n\t\t\t\tc=1\n\t\t\telse:\n\t\t\t\ta=0\n\t\t\t\tb=0\n\t\t\t\tc=1\n\telse:\n\t\tc+=1\n\n\n\tmaxhoge=max(maxhoge,a+b+c)\n\n\n\n\nprint(maxhoge)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565655616", "date2": "1565657088", "bleu_score": "0.6749124764874362", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 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, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "10\n0 1 1 3 2 8 4 7 8 7\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["\n\nimport copy\nimport sys\nimport math\n\nn = int(input()) # (0): n=10\ntmp = input().split() # (1): tmp=['0', '1', '1', '3', '2', '8', '4', '7', '8', '7']\nhoge = list(map(lambda a: int(a), tmp)) # (2): hoge=[0, 1, 1, 3, 2, 8, 4, 7, 8, 7]\n\nhoge.sort() # (3): hoge=[0, 1, 1, 2, 3, 4, 7, 7, 8, 8]\nhoge.append(-1) # (4): hoge=[0, 1, 1, 2, 3, 4, 7, 7, 8, 8, -1]\na=0 # (5): a=0\nb=0 # (6): b=0\nc=1 # (7): c=1\nmaxhoge=0 # (8): maxhoge=0\nfor i in range(0,n): # (9): i=0 (15): i=1 ... (60): NO CHANGE\n\tif(hoge[i]!=hoge[i+1]): # (10): NO CHANGE (16): NO CHANGE ... (55): NO CHANGE\n\t\tmaxhoge=max(maxhoge,a+b+c) # (11): maxhoge=1 (20): maxhoge=3 ... (56): maxhoge=5\n\t\ta=b # (12): NO CHANGE (21): a=1 ... (57): a=2\n\t\tb=c # (13): b=1 (22): b=2 ... (58): NO CHANGE\n\t\tc=1 # (14): NO CHANGE (23): c=1 ... (59): c=1\n\telse:\n\t\tc+=1 # (17): c=2 (44): c=2 (53): c=2\n\n\n\n\nprint(maxhoge)\n\n"], "anno_status": [true], "diff_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n-\t\tmaxhoge=max(maxhoge,a+b+c)\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n+\t\tif(i!=n-1):\n+\t\t\tif(hoge[i+1]-hoge[i]==1):\n+\t\t\t\ta=b\n+\t\t\t\tb=c\n+\t\t\t\tc=1\n+\t\t\telif(hoge[i+1]-hoge[i]==2):\n+\t\t\t\ta=c\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n+\t\t\telse:\n+\t\t\t\ta=0\n+\t\t\t\tb=0\n+\t\t\t\tc=1\n \telse:\n \t\tc+=1\n \n \n+\tmaxhoge=max(maxhoge,a+b+c)\n+\n+\n \n \n print(maxhoge)\n \n \n", "FL_content": " \n \n import copy\n import sys\n import math\n \n n = int(input())\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n \n hoge.sort()\n hoge.append(-1)\n a=0\n b=0\n c=1\n maxhoge=0\n for i in range(0,n):\n \tif(hoge[i]!=hoge[i+1]):\n-\t\tmaxhoge=max(maxhoge,a+b+c)\n-\t\ta=b\n-\t\tb=c\n-\t\tc=1\n \telse:\n \t\tc+=1\n \n \n \n \n print(maxhoge)\n \n \n", "added_lines": 16, "removed_lines": 4, "code1_lines": 31 }, { "user_id": "u993435350", "problem_id": "p03613", "submission1_id": "s952791601", "submission2_id": "s346093957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\n\nN = int(input())\nA = list(map(int,input().split()))\nB = collections.Counter(A).most_common()\n\na = B[0][0]\nb = a + 1\nc = a - 1\n\nL = [a,b,c]\nC = [0,0,0]\n\nfor i in range(N):\n for j in range(3):\n d = abs(A[i] - L[j])\n if d <= 1:\n C[j] += 1\n \nprint(max(C))", "code2": "import collections\n\nN = int(input())\nA = list(map(int,input().split()))\n\nnums = []\nroll = [-1,0,1]\n\nfor i in range(N):\n for j in range(3):\n d = A[i] + roll[j]\n nums.append(d)\n\nnum = collections.Counter(nums).most_common()\nprint(num[0][1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580558318", "date2": "1580559285", "bleu_score": "0.6432967222145156", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "10\n-1 1 2 1 4 8 6 7 8 4\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["import collections\n\nN = int(input()) # (0): N=10\nA = list(map(int,input().split())) # (1): A=[-1, 1, 2, 1, 4, 8, 6, 7, 8, 4]\nB = collections.Counter(A).most_common() # (2): B=[(1, 2), (4, 2), (8, 2), (-1, 1), (2, 1), (6, 1), (7, 1)]\n\na = B[0][0] # (3): a=1\nb = a + 1 # (4): b=2\nc = a - 1 # (5): c=0\n\nL = [a,b,c] # (6): L=[1, 2, 0]\nC = [0,0,0] # (7): C=[0, 0, 0]\n\nfor i in range(N): # (8): i=0 (20): i=1 ... (127): NO CHANGE\n for j in range(3): # (9): j=0 (12): j=1 ... (126): NO CHANGE\n d = abs(A[i] - L[j]) # (10): d=2 (13): d=3 ... (124): d=4\n if d <= 1: # (11): NO CHANGE (14): NO CHANGE ... (125): NO CHANGE\n C[j] += 1 # (18): C=[0, 0, 1] (24): C=[1, 0, 1] ... (59): C=[3, 3, 3]\n \nprint(max(C))"], "anno_status": [true], "diff_content": " import collections\n \n N = int(input())\n A = list(map(int,input().split()))\n-B = collections.Counter(A).most_common()\n \n-a = B[0][0]\n-b = a + 1\n-c = a - 1\n-\n-L = [a,b,c]\n-C = [0,0,0]\n+nums = []\n+roll = [-1,0,1]\n \n for i in range(N):\n for j in range(3):\n- d = abs(A[i] - L[j])\n- if d <= 1:\n- C[j] += 1\n- \n-print(max(C))\n+ d = A[i] + roll[j]\n+ nums.append(d)\n+\n+num = collections.Counter(nums).most_common()\n+print(num[0][1])\n", "FL_content": " import collections\n \n N = int(input())\n A = list(map(int,input().split()))\n-B = collections.Counter(A).most_common()\n \n-a = B[0][0]\n-b = a + 1\n-c = a - 1\n-\n-L = [a,b,c]\n-C = [0,0,0]\n \n for i in range(N):\n for j in range(3):\n- d = abs(A[i] - L[j])\n- if d <= 1:\n- C[j] += 1\n- \n-print(max(C))\n", "added_lines": 7, "removed_lines": 12, "code1_lines": 20 }, { "user_id": "u846372029", "problem_id": "p03613", "submission1_id": "s752503336", "submission2_id": "s535849432", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN = int(input())\na = list(map(int, input().split()))\n\nb = []\n\nfor ai in a:\n b.append(ai-1)\n b.append(ai)\n b.append(ai+1)\n\n\nimport collections\ncnt = collections.Counter(b)\n\nmax(cnt.values())", "code2": "\n\nN = int(input())\na = list(map(int, input().split()))\n\nb = []\n\nfor ai in a:\n b.append(ai-1)\n b.append(ai)\n b.append(ai+1)\n\n\nimport collections\ncnt = collections.Counter(b)\n\nprint(max(cnt.values()))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1504400854", "date2": "1504400885", "bleu_score": "0.9585898986919522", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n-1 1 2 3 4 5 6 7 16 4\n", "actual_output": "", "expected_output": "4\n\n", "anno_code": ["\n\nN = int(input()) # (0): N=10\na = list(map(int, input().split())) # (1): a=[-1, 1, 2, 3, 4, 5, 6, 7, 16, 4]\n\nb = [] # (2): b=[]\n\nfor ai in a: # (3): ai=-1 (7): ai=1 ... (43): collections=\n b.append(ai-1) # (4): b=[-2] (8): b=[-2, -1, 0, 0] ... (40): b=[-2, -1, ..., 17, 3]\n b.append(ai) # (5): b=[-2, -1] (9): b=[-2, -1, 0, 0, 1] ... (41): b=[-2, -1, ..., 3, 4]\n b.append(ai+1) # (6): b=[-2, -1, 0] (10): b=[-2, -1, 0, 0, 1, 2] ... (42): b=[-2, -1, ..., 4, 5]\n\n\nimport collections\ncnt = collections.Counter(b) # (44): cnt=Counter({3: 4, 4: 4, 5: 4, 2: 3, 6: 3, 0: 2, 1: 2, 7: 2, -2: 1, -1: 1, 8: 1, 15: 1, 16: 1, 17: 1})\n\nmax(cnt.values())"], "anno_status": [true], "diff_content": " \n \n N = int(input())\n a = list(map(int, input().split()))\n \n b = []\n \n for ai in a:\n b.append(ai-1)\n b.append(ai)\n b.append(ai+1)\n \n \n import collections\n cnt = collections.Counter(b)\n \n-max(cnt.values())\n+print(max(cnt.values()))\n", "FL_content": " \n \n N = int(input())\n a = list(map(int, input().split()))\n \n b = []\n \n for ai in a:\n b.append(ai-1)\n b.append(ai)\n b.append(ai+1)\n \n \n import collections\n cnt = collections.Counter(b)\n \n-max(cnt.values())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u340781749", "problem_id": "p03613", "submission1_id": "s157232319", "submission2_id": "s732535939", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nk = [0] * 100001\nfor a in map(int, input().split()):\n k[a] += 1\nprint(max(map(sum, zip(k[1:], k[2:], k[3:]))))\n", "code2": "input()\nk = [0] * 100000\nfor a in map(int, input().split()):\n k[a] += 1\nprint(max(map(sum, zip(k, k[1:], k[2:]))))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1504401162", "date2": "1504401541", "bleu_score": "0.8545298885822501", "code1_test_status": [1, 1, 1, 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, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 103, "input": "10\n0 2 1 5 3 2 8 4 20 0\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["n = int(input()) # (0): n=10\nk = [0] * 100001 # (1): k=[0, 0, ..., 0, 0]\nfor a in map(int, input().split()): # (2): a=0 (4): a=2 ... (22): NO CHANGE\n k[a] += 1 # (3): k=[1, 0, ..., 0, 0] (5): k=[1, 0, ..., 0, 0] ... (21): k=[2, 1, ..., 0, 0]\nprint(max(map(sum, zip(k[1:], k[2:], k[3:]))))\n"], "anno_status": [true], "diff_content": "-n = int(input())\n-k = [0] * 100001\n+input()\n+k = [0] * 100000\n for a in map(int, input().split()):\n k[a] += 1\n-print(max(map(sum, zip(k[1:], k[2:], k[3:]))))\n+print(max(map(sum, zip(k, k[1:], k[2:]))))\n \n", "FL_content": "-n = int(input())\n-k = [0] * 100001\n for a in map(int, input().split()):\n k[a] += 1\n-print(max(map(sum, zip(k[1:], k[2:], k[3:]))))\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u892251744", "problem_id": "p03613", "submission1_id": "s104235737", "submission2_id": "s575722901", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n import sys\n from collections import defaultdict\n input = sys.stdin.readline\n\n N = int(input())\n A = list(map(int, input().split()))\n C = defaultdict(int)\n for a in A:\n C[a] += 1\n\n ans = 0\n for i in range(2, 10**5+1):\n ans = max(ans, C[i-1] + C[i] + C[i+1])\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "def main():\n import sys\n from collections import defaultdict\n input = sys.stdin.readline\n\n N = int(input())\n A = list(map(int, input().split()))\n C = defaultdict(int)\n for a in A:\n C[a] += 1\n\n ans = 0\n for i in range(10**5+1):\n ans = max(ans, C[i-1] + C[i] + C[i+1])\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579834986", "date2": "1579835041", "bleu_score": "0.9876400385592083", "code1_test_status": [1, 1, 1, 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, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 103, "input": "10\n0 1 0 3 5 2 4 7 14 2\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["def main(): # (0): main=\n import sys\n from collections import defaultdict\n input = sys.stdin.readline\n\n N = int(input())\n A = list(map(int, input().split()))\n C = defaultdict(int)\n for a in A:\n C[a] += 1\n\n ans = 0\n for i in range(2, 10**5+1):\n ans = max(ans, C[i-1] + C[i] + C[i+1])\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n import sys\n from collections import defaultdict\n input = sys.stdin.readline\n \n N = int(input())\n A = list(map(int, input().split()))\n C = defaultdict(int)\n for a in A:\n C[a] += 1\n \n ans = 0\n- for i in range(2, 10**5+1):\n+ for i in range(10**5+1):\n ans = max(ans, C[i-1] + C[i] + C[i+1])\n print(ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " def main():\n import sys\n from collections import defaultdict\n input = sys.stdin.readline\n \n N = int(input())\n A = list(map(int, input().split()))\n C = defaultdict(int)\n for a in A:\n C[a] += 1\n \n ans = 0\n- for i in range(2, 10**5+1):\n ans = max(ans, C[i-1] + C[i] + C[i+1])\n print(ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u707808519", "problem_id": "p02556", "submission1_id": "s702335322", "submission2_id": "s918006392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nmant = [0 for _ in range(N)]\nfor i in range(N):\n x, y = map(int, input().split())\n mant[i] = x + y\n\nprint(max(mant)-min(mant))", "code2": "n = int(input())\nz = [0 for _ in range(n)]\nw = [0 for _ in range(n)]\n\nfor i in range(n):\n x, y = map(int, input().split())\n z[i], w[i] = x+y, x-y\n\nprint(max(max(z)-min(z), max(w)-min(w)))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600030750", "date2": "1600035367", "bleu_score": "0.6240997368009884", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 97, "input": "3\n-1 -4\n1 -1\n-23 0\n", "actual_output": "23\n", "expected_output": "26\n\n", "anno_code": ["N = int(input()) # (0): N=3\nmant = [0 for _ in range(N)] # (1): mant=[0, 0, 0]\nfor i in range(N): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n x, y = map(int, input().split()) # (3): x=-1, y=-4 (6): x=1, y=-1 (9): x=-23, y=0\n mant[i] = x + y # (4): mant=[-5, 0, 0] (7): NO CHANGE (10): mant=[-5, 0, -23]\n\nprint(max(mant)-min(mant))"], "anno_status": [true], "diff_content": "-N = int(input())\n-mant = [0 for _ in range(N)]\n-for i in range(N):\n+n = int(input())\n+z = [0 for _ in range(n)]\n+w = [0 for _ in range(n)]\n+\n+for i in range(n):\n x, y = map(int, input().split())\n- mant[i] = x + y\n+ z[i], w[i] = x+y, x-y\n \n-print(max(mant)-min(mant))\n+print(max(max(z)-min(z), max(w)-min(w)))\n", "FL_content": "-N = int(input())\n-mant = [0 for _ in range(N)]\n-for i in range(N):\n x, y = map(int, input().split())\n- mant[i] = x + y\n \n-print(max(mant)-min(mant))\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 7 }, { "user_id": "u135346354", "problem_id": "p02556", "submission1_id": "s919485248", "submission2_id": "s140297921", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nN = int(input())\n\nAM, Am, BM, Bm = 0, 10**18, 0, 10**18\nfor _ in range(N):\n x, y = map(int, input().split())\n AM = max(AM, x+y)\n Am = min(Am, x+y)\n BM = max(BM, x-y)\n Bm = min(Bm, x-y)\n\n\nprint(max(AM-Am, BM-Bm))", "code2": "from collections import deque\nN = int(input())\n\nAM, Am, BM, Bm = -1*10**9*2, 10**9*2, -1*10**9*2, 10**9*2\nfor _ in range(N):\n x, y = map(int, input().split())\n AM = max(AM, x+y)\n Am = min(Am, x+y)\n BM = max(BM, x-y)\n Bm = min(Bm, x-y)\n\n\nprint(max(AM-Am, BM-Bm))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600025642", "date2": "1600025774", "bleu_score": "0.8894565388825965", "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, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 91, "total_score": 97, "input": "2\n-5 2\n-3 0\n", "actual_output": "7\n", "expected_output": "4\n\n", "anno_code": ["from collections import deque\nN = int(input()) # (0): N=2\n\nAM, Am, BM, Bm = 0, 10**18, 0, 10**18 # (1): AM=0, Am=1000000000000000000, BM=0, Bm=1000000000000000000\nfor _ in range(N): # (2): _=0 (8): _=1 (14): NO CHANGE\n x, y = map(int, input().split()) # (3): x=-5, y=2 (9): x=-3, y=0\n AM = max(AM, x+y) # (4): NO CHANGE (10): NO CHANGE\n Am = min(Am, x+y) # (5): Am=-3 (11): NO CHANGE\n BM = max(BM, x-y) # (6): NO CHANGE (12): NO CHANGE\n Bm = min(Bm, x-y) # (7): Bm=-7 (13): NO CHANGE\n\n\nprint(max(AM-Am, BM-Bm))"], "anno_status": [true], "diff_content": " from collections import deque\n N = int(input())\n \n-AM, Am, BM, Bm = 0, 10**18, 0, 10**18\n+AM, Am, BM, Bm = -1*10**9*2, 10**9*2, -1*10**9*2, 10**9*2\n for _ in range(N):\n x, y = map(int, input().split())\n AM = max(AM, x+y)\n Am = min(Am, x+y)\n BM = max(BM, x-y)\n Bm = min(Bm, x-y)\n \n \n print(max(AM-Am, BM-Bm))\n", "FL_content": " from collections import deque\n N = int(input())\n \n-AM, Am, BM, Bm = 0, 10**18, 0, 10**18\n for _ in range(N):\n x, y = map(int, input().split())\n AM = max(AM, x+y)\n Am = min(Am, x+y)\n BM = max(BM, x-y)\n Bm = min(Bm, x-y)\n \n \n print(max(AM-Am, BM-Bm))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u161164709", "problem_id": "p02556", "submission1_id": "s625870490", "submission2_id": "s558615173", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nxy_array = [list(map(int, input().split())) for _ in range(n)]\n\nth = pow(10, 9)\nright_up_max = 0\nleft_down_min = th\nleft_up_max = 0\nright_down_min = th\n\nfor x, y in xy_array:\n right_up_max = max(x + y, right_up_max)\n left_down_min = min(x + y, left_down_min)\n left_up_max = max(th - x + y, left_up_max)\n right_down_min = min(th - x + y, right_down_min)\n\nans = max(right_up_max - left_down_min, left_up_max - right_down_min)\nprint(ans)", "code2": "n = int(input())\nxy_array = [list(map(int, input().split())) for _ in range(n)]\n\nth = pow(10, 9)\nright_up_max = -th\nleft_down_min = th\nleft_up_max = -th\nright_down_min = th\n\nfor x, y in xy_array:\n right_up_max = max(x + y, right_up_max)\n left_down_min = min(x + y, left_down_min)\n left_up_max = max(x - y, left_up_max)\n right_down_min = min(x - y, right_down_min)\n\nans = max(right_up_max - left_down_min, left_up_max - right_down_min)\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600036842", "date2": "1600349016", "bleu_score": "0.9585634290042958", "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, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 91, "total_score": 97, "input": "2\n-4 1\n-3 0\n", "actual_output": "5\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=2\nxy_array = [list(map(int, input().split())) for _ in range(n)] # (1): xy_array\n\nth = pow(10, 9) # (2): th=1000000000\nright_up_max = 0 # (3): right_up_max=0\nleft_down_min = th # (4): left_down_min=1000000000\nleft_up_max = 0 # (5): left_up_max=0\nright_down_min = th # (6): right_down_min=1000000000\n\nfor x, y in xy_array: # (7): x=-4, y=1 (12): x=-3, y=0 (17): NO CHANGE\n right_up_max = max(x + y, right_up_max) # (8): NO CHANGE (13): NO CHANGE\n left_down_min = min(x + y, left_down_min) # (9): left_down_min=-3 (14): NO CHANGE\n left_up_max = max(th - x + y, left_up_max) # (10): left_up_max=1000000005 (15): NO CHANGE\n right_down_min = min(th - x + y, right_down_min) # (11): NO CHANGE (16): NO CHANGE\n\nans = max(right_up_max - left_down_min, left_up_max - right_down_min) # (18): ans=5\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n xy_array = [list(map(int, input().split())) for _ in range(n)]\n \n th = pow(10, 9)\n-right_up_max = 0\n+right_up_max = -th\n left_down_min = th\n-left_up_max = 0\n+left_up_max = -th\n right_down_min = th\n \n for x, y in xy_array:\n right_up_max = max(x + y, right_up_max)\n left_down_min = min(x + y, left_down_min)\n- left_up_max = max(th - x + y, left_up_max)\n- right_down_min = min(th - x + y, right_down_min)\n+ left_up_max = max(x - y, left_up_max)\n+ right_down_min = min(x - y, right_down_min)\n \n ans = max(right_up_max - left_down_min, left_up_max - right_down_min)\n print(ans)\n", "FL_content": " n = int(input())\n xy_array = [list(map(int, input().split())) for _ in range(n)]\n \n th = pow(10, 9)\n-right_up_max = 0\n left_down_min = th\n-left_up_max = 0\n right_down_min = th\n \n for x, y in xy_array:\n right_up_max = max(x + y, right_up_max)\n left_down_min = min(x + y, left_down_min)\n- left_up_max = max(th - x + y, left_up_max)\n- right_down_min = min(th - x + y, right_down_min)\n \n ans = max(right_up_max - left_down_min, left_up_max - right_down_min)\n print(ans)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 17 }, { "user_id": "u056977516", "problem_id": "p02556", "submission1_id": "s206605779", "submission2_id": "s851651131", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nfrom math import *\nfrom copy import * \nfrom heapq import * \nfrom string import * \nfrom random import * \nfrom bisect import * \nfrom sys import stdin \nfrom sys import maxsize \nfrom operator import * \nfrom itertools import * \nfrom decimal import Decimal \nfrom collections import Counter \nfrom collections import defaultdict \n\n\n\ndef solve(l):\n\tn = len(l)\n\td = defaultdict(int)\n\tll = []\n\tfor x,y in l:\n\t\tll.append(x+y)\n\treturn abs(min(ll) - max(ll))\n\nN = int(stdin.readline())\nL = []\nfor i in range(N):\n\ta,b = map(int, input().split())\n\tL.append([a,b])\nans = solve(L)\nprint(ans)\n\n", "code2": "\n\n\nfrom math import *\nfrom copy import * \nfrom heapq import * \nfrom string import * \nfrom random import * \nfrom bisect import * \nfrom sys import stdin \nfrom sys import maxsize \nfrom operator import * \nfrom itertools import * \nfrom decimal import Decimal \nfrom collections import Counter \nfrom collections import defaultdict \n\n\n\ndef solve(l):\n\tn = len(l)\n\td = defaultdict(int)\n\tl1,l2,l3 = [],[],[]\n\tfor x,y in l:\n\t\tl1.append(x+y)\n\t\tl2.append(x-y)\n\t\tl3.append(y-x)\n\ta = abs(max(l1) - min(l1))\n\tb = abs(max(l2) - min(l2))\n\tc = abs(max(l3) - min(l3))\n\treturn max(a,b,c)\n\nN = int(stdin.readline())\nL = []\nfor i in range(N):\n\ta,b = map(int, input().split())\n\tL.append([a,b])\nans = solve(L)\nprint(ans)\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600024595", "date2": "1600024880", "bleu_score": "0.8536394406011399", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 97, "input": "2\n1 44\n2 -1\n", "actual_output": "44\n", "expected_output": "46\n\n", "anno_code": [" # (0): acos=, acosh=, asin=, asinh=, atan=, atan2=, atanh=, ceil=, copysign=, cos=, cosh=, degrees=, dist=, erf=, erfc=, exp=, expm1=, fabs=, factorial=, floor=, fmod=, frexp=, fsum=, gamma=, gcd=, hypot=, isclose=, isfinite=, isinf=, isnan=, isqrt=, lcm=, ldexp=, lgamma=, log=, log1p=, log10=, log2=, modf=, pow=, radians=, remainder=, sin=, sinh=, sqrt=, tan=, tanh=, trunc=, prod=, perm=, comb=, nextafter=, ulp=, pi=3.141593, e=2.718282, tau=6.283185, inf=inf, nan=nan, Error=, copy=, deepcopy=, heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=, ascii_letters=abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ, ascii_lowercase=abcdefghijklmnopqrstuvwxyz, ascii_uppercase=ABCDEFGHIJKLMNOPQRSTUVWXYZ, capwords=, digits=0123456789, hexdigits=0123456789abcdefABCDEF, octdigits=01234567, printable=0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ \t \n\u000b\f, punctuation=!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~, whitespace= \t \n# (1): nan=nan, solve=\n# (12): n=2\n# (13): d=defaultdict(, {})\n# (14): ll=[]\n# (15): x=1, y=44 (17): x=2, y=-1 (19): acos=, acosh=, asin=, asinh=, atan=, atan2=, atanh=, ceil=, copysign=, cos=, cosh=, degrees=, dist=, erf=, erfc=, exp=, expm1=, fabs=, factorial=, floor=, fmod=, frexp=, fsum=, gamma=, gcd=, hypot=, isclose=, isfinite=, isinf=, isnan=, isqrt=, lcm=, ldexp=, lgamma=, log=, log1p=, log10=, log2=, modf=, pow=, radians=, remainder=, sin=, sinh=, sqrt=, tan=, tanh=, trunc=, prod=, perm=, comb=, nextafter=, ulp=, pi=3.141593, e=2.718282, tau=6.283185, inf=inf, nan=nan, Error=, copy=, deepcopy=, heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=, ascii_letters=abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ, ascii_lowercase=abcdefghijklmnopqrstuvwxyz, ascii_uppercase=ABCDEFGHIJKLMNOPQRSTUVWXYZ, capwords=, digits=0123456789, hexdigits=0123456789abcdefABCDEF, octdigits=01234567, printable=0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ \t \n#$%&'()*+,-./:;<=>?@[\\]^_`{|}~, whitespace= \t \n# (16): ll=[45] (18): ll=[45, 1]\n# (2): nan=nan, N=2\n# (3): nan=nan, L=[]\n# (4): nan=nan, i=0 (7): nan=nan, i=1 (10): nan=nan\n# (5): nan=nan, a=1, b=44 (8): nan=nan, a=2, b=-1\n# (6): nan=nan, L (9): nan=nan, L\n# (11): l\n"], "anno_status": [false], "diff_content": " \n \n \n from math import *\n from copy import * \n from heapq import * \n from string import * \n from random import * \n from bisect import * \n from sys import stdin \n from sys import maxsize \n from operator import * \n from itertools import * \n from decimal import Decimal \n from collections import Counter \n from collections import defaultdict \n \n \n \n def solve(l):\n \tn = len(l)\n \td = defaultdict(int)\n-\tll = []\n+\tl1,l2,l3 = [],[],[]\n \tfor x,y in l:\n-\t\tll.append(x+y)\n-\treturn abs(min(ll) - max(ll))\n+\t\tl1.append(x+y)\n+\t\tl2.append(x-y)\n+\t\tl3.append(y-x)\n+\ta = abs(max(l1) - min(l1))\n+\tb = abs(max(l2) - min(l2))\n+\tc = abs(max(l3) - min(l3))\n+\treturn max(a,b,c)\n \n N = int(stdin.readline())\n L = []\n for i in range(N):\n \ta,b = map(int, input().split())\n \tL.append([a,b])\n ans = solve(L)\n print(ans)\n \n \n", "FL_content": " \n \n \n from math import *\n from copy import * \n from heapq import * \n from string import * \n from random import * \n from bisect import * \n from sys import stdin \n from sys import maxsize \n from operator import * \n from itertools import * \n from decimal import Decimal \n from collections import Counter \n from collections import defaultdict \n \n \n \n def solve(l):\n \tn = len(l)\n \td = defaultdict(int)\n-\tll = []\n \tfor x,y in l:\n-\t\tll.append(x+y)\n-\treturn abs(min(ll) - max(ll))\n \n N = int(stdin.readline())\n L = []\n for i in range(N):\n \ta,b = map(int, input().split())\n \tL.append([a,b])\n ans = solve(L)\n print(ans)\n \n \n", "added_lines": 8, "removed_lines": 3, "code1_lines": 36 }, { "user_id": "u594803920", "problem_id": "p02556", "submission1_id": "s553953528", "submission2_id": "s724681939", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nl = []\nll = []\nfor _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\nl.sort()\nll.sort()\nans1 = 0\nans2 = 0\n\ncnt = 0\nwhile True:\n a = l[-cnt]\n b = l[cnt]\n if a[1] >= b[1] and a[2] >= b[2]:\n ans1 = abs(b[0]-a[0])\n break\n if cnt >= n-1:\n break\n cnt += 1\n\ncnt = 0\nwhile True:\n a = l[-cnt]\n b = l[cnt]\n if a[1] >= a[2] and b[2] >= b[1]:\n ans2 = abs(b[0]-a[0])\n break\n if cnt >= n-1:\n break\n cnt += 1\n\nprint(max(ans1, ans2))\n", "code2": "n = int(input())\nl = []\nll = []\nfor _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\nl.sort()\nll.sort()\nans1 = 0\nans2 = 0\n\n\n\ncnt = 0\nwhile True:\n a = l[n-1-cnt]\n b = l[cnt]\n \n if a[1] >= b[1] and a[2] >= b[2]:\n ans1 = abs(b[0]-a[0])\n \n break\n if cnt >= n-1:\n break\n cnt += 1\n\ncnt = 0\nwhile True:\n a = ll[n-1-cnt]\n b = ll[cnt]\n if a[1] >= b[1] and b[2] >= a[2]:\n ans2 = abs(b[0]-a[0])\n \n break\n if cnt >= n-1:\n break\n cnt += 1\n\nprint(max(ans1, ans2))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600028240", "date2": "1600028689", "bleu_score": "0.9342238992099311", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0], "code1_test_score": 1, "total_score": 97, "input": "3\n-1 -4\n1 -1\n-23 0\n", "actual_output": "0\n", "expected_output": "26\n\n", "anno_code": ["n = int(input()) # (0): n=3\nl = [] # (1): l=[]\nll = [] # (2): ll=[]\nfor _ in range(n): # (3): _=0 (7): _=1 ... (15): NO CHANGE\n x, y = map(int, input().split()) # (4): x=-1, y=-4 (8): x=1, y=-1 (12): x=-23, y=0\n l.append((x+y, x, y)) # (5): l=[(-5, -1, -4)] (9): l=[(-5, -1, -4), (0, 1, -1)] (13): l=[(-5, -1, -4), (0, 1, -1), (-23, -23, 0)]\n ll.append((x-y, x, y)) # (6): ll=[(3, -1, -4)] (10): ll=[(3, -1, -4), (2, 1, -1)] (14): ll=[(3, -1, -4), (2, 1, -1), (-23, -23, 0)]\nl.sort() # (16): l=[(-23, -23, 0), (-5, -1, -4), (0, 1, -1)]\nll.sort() # (17): ll=[(-23, -23, 0), (2, 1, -1), (3, -1, -4)]\nans1 = 0 # (18): ans1=0\nans2 = 0 # (19): ans2=0\n\ncnt = 0 # (20): cnt=0\nwhile True: # (21): NO CHANGE\n a = l[-cnt] # (22): a=(-23, -23, 0)\n b = l[cnt] # (23): b=(-23, -23, 0)\n if a[1] >= b[1] and a[2] >= b[2]: # (24): NO CHANGE\n ans1 = abs(b[0]-a[0]) # (25): NO CHANGE\n break # (26): NO CHANGE\n if cnt >= n-1:\n break\n cnt += 1\n\ncnt = 0 # (27): NO CHANGE\nwhile True: # (28): NO CHANGE (34): NO CHANGE (40): NO CHANGE\n a = l[-cnt] # (29): NO CHANGE (35): a=(0, 1, -1) (41): a=(-5, -1, -4)\n b = l[cnt] # (30): NO CHANGE (36): b=(-5, -1, -4) (42): b=(0, 1, -1)\n if a[1] >= a[2] and b[2] >= b[1]: # (31): NO CHANGE (37): NO CHANGE (43): NO CHANGE\n ans2 = abs(b[0]-a[0])\n break\n if cnt >= n-1: # (32): NO CHANGE (38): NO CHANGE (44): NO CHANGE\n break # (45): NO CHANGE\n cnt += 1 # (33): cnt=1 (39): cnt=2\n\nprint(max(ans1, ans2))\n"], "anno_status": [true], "diff_content": " n = int(input())\n l = []\n ll = []\n for _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\n l.sort()\n ll.sort()\n ans1 = 0\n ans2 = 0\n \n+\n+\n cnt = 0\n while True:\n- a = l[-cnt]\n+ a = l[n-1-cnt]\n b = l[cnt]\n+ \n if a[1] >= b[1] and a[2] >= b[2]:\n ans1 = abs(b[0]-a[0])\n+ \n break\n if cnt >= n-1:\n break\n cnt += 1\n \n cnt = 0\n while True:\n- a = l[-cnt]\n- b = l[cnt]\n- if a[1] >= a[2] and b[2] >= b[1]:\n+ a = ll[n-1-cnt]\n+ b = ll[cnt]\n+ if a[1] >= b[1] and b[2] >= a[2]:\n ans2 = abs(b[0]-a[0])\n+ \n break\n if cnt >= n-1:\n break\n cnt += 1\n \n print(max(ans1, ans2))\n \n", "FL_content": " n = int(input())\n l = []\n ll = []\n for _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\n l.sort()\n ll.sort()\n ans1 = 0\n ans2 = 0\n \n cnt = 0\n while True:\n- a = l[-cnt]\n b = l[cnt]\n if a[1] >= b[1] and a[2] >= b[2]:\n ans1 = abs(b[0]-a[0])\n break\n if cnt >= n-1:\n break\n cnt += 1\n \n cnt = 0\n while True:\n- a = l[-cnt]\n- b = l[cnt]\n- if a[1] >= a[2] and b[2] >= b[1]:\n ans2 = abs(b[0]-a[0])\n break\n if cnt >= n-1:\n break\n cnt += 1\n \n print(max(ans1, ans2))\n \n", "added_lines": 9, "removed_lines": 4, "code1_lines": 36 }, { "user_id": "u581625805", "problem_id": "p02556", "submission1_id": "s592636386", "submission2_id": "s489387701", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nplus_max = 0\nplus_min = 10**10\nminus_max = 0\nminus_min = 10**10\nfor _ in range(n):\n x, y = map(int, input().split())\n plus_max = max(plus_max, x + y)\n plus_min = min(plus_min, x + y)\n minus_max = max(minus_max, x - y)\n minus_min = min(minus_min, x - y)\nprint(max(plus_max - plus_min, minus_max - minus_min))\n", "code2": "n = int(input())\nplus_max = 10**20 * -1\nplus_min = 10**20\nminus_max = 10**20 * -1\nminus_min = 10**20\nfor _ in range(n):\n x, y = map(int, input().split())\n plus_max = max(plus_max, x + y)\n plus_min = min(plus_min, x + y)\n minus_max = max(minus_max, x - y)\n minus_min = min(minus_min, x - y)\nprint(max(plus_max - plus_min, minus_max - minus_min))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600064387", "date2": "1600064534", "bleu_score": "0.9202893532300424", "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, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 91, "total_score": 97, "input": "3\n0 -1\n0 -1\n0 -1\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["n = int(input()) # (0): n=3\nplus_max = 0 # (1): plus_max=0\nplus_min = 10**10 # (2): plus_min=10000000000\nminus_max = 0 # (3): minus_max=0\nminus_min = 10**10 # (4): minus_min=10000000000\nfor _ in range(n): # (5): _=0 (11): _=1 ... (23): NO CHANGE\n x, y = map(int, input().split()) # (6): x=0, y=-1 (12): NO CHANGE (18): NO CHANGE\n plus_max = max(plus_max, x + y) # (7): NO CHANGE (13): NO CHANGE (19): NO CHANGE\n plus_min = min(plus_min, x + y) # (8): plus_min=-1 (14): NO CHANGE (20): NO CHANGE\n minus_max = max(minus_max, x - y) # (9): minus_max=1 (15): NO CHANGE (21): NO CHANGE\n minus_min = min(minus_min, x - y) # (10): minus_min=1 (16): NO CHANGE (22): NO CHANGE\nprint(max(plus_max - plus_min, minus_max - minus_min))\n"], "anno_status": [true], "diff_content": " n = int(input())\n-plus_max = 0\n-plus_min = 10**10\n-minus_max = 0\n-minus_min = 10**10\n+plus_max = 10**20 * -1\n+plus_min = 10**20\n+minus_max = 10**20 * -1\n+minus_min = 10**20\n for _ in range(n):\n x, y = map(int, input().split())\n plus_max = max(plus_max, x + y)\n plus_min = min(plus_min, x + y)\n minus_max = max(minus_max, x - y)\n minus_min = min(minus_min, x - y)\n print(max(plus_max - plus_min, minus_max - minus_min))\n \n", "FL_content": " n = int(input())\n-plus_max = 0\n-plus_min = 10**10\n-minus_max = 0\n-minus_min = 10**10\n for _ in range(n):\n x, y = map(int, input().split())\n plus_max = max(plus_max, x + y)\n plus_min = min(plus_min, x + y)\n minus_max = max(minus_max, x - y)\n minus_min = min(minus_min, x - y)\n print(max(plus_max - plus_min, minus_max - minus_min))\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u143565147", "problem_id": "p02556", "submission1_id": "s152646556", "submission2_id": "s574899786", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def f(x, y):\n return x-y, x+y\n\n\nn = int(input())\np = [list(map(int, input().split())) for i in range(n)]\n\nmax_x = 0\nmin_x = 2000000000\nmax_y = 0\nmin_y = 2000000000\nfor xi, yi in p:\n x_, y_ = f(xi, yi)\n max_x = max(max_x, x_)\n min_x = min(min_x, x_)\n max_y = max(max_y, y_)\n min_y = min(min_y, y_)\n\nprint(max(max_x - min_x, max_y - min_y))", "code2": "def f(x, y):\n return x-y, x+y\n\n\nn = int(input())\np = [list(map(int, input().split())) for i in range(n)]\n\nmax_x = -2000000000\nmin_x = 2000000000\nmax_y = -2000000000\nmin_y = 2000000000\nfor xi, yi in p:\n f1, f2 = f(xi, yi)\n max_x = max(max_x, f1)\n min_x = min(min_x, f1)\n max_y = max(max_y, f2)\n min_y = min(min_y, f2)\n\nprint(max(max_x - min_x, max_y - min_y))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600029340", "date2": "1600029585", "bleu_score": "0.8827995553613217", "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, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 91, "total_score": 97, "input": "2\n-2 1\n-3 0\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["def f(x, y): # (0): f=\n return x-y, x+y\n\n\nn = int(input()) # (1): n=2\np = [list(map(int, input().split())) for i in range(n)] # (2): p\n\nmax_x = 0 # (3): max_x=0\nmin_x = 2000000000 # (4): min_x=2000000000\nmax_y = 0 # (5): max_y=0\nmin_y = 2000000000 # (6): min_y=2000000000\nfor xi, yi in p: # (7): xi=-2, yi=1 (13): xi=-3, yi=0 (19): NO CHANGE\n x_, y_ = f(xi, yi) # (8): x_=-3, y_=-1 (14): y_=-3\n max_x = max(max_x, x_) # (9): NO CHANGE (15): NO CHANGE\n min_x = min(min_x, x_) # (10): min_x=-3 (16): NO CHANGE\n max_y = max(max_y, y_) # (11): NO CHANGE (17): NO CHANGE\n min_y = min(min_y, y_) # (12): min_y=-1 (18): min_y=-3\n\nprint(max(max_x - min_x, max_y - min_y))"], "anno_status": [true], "diff_content": " def f(x, y):\n return x-y, x+y\n \n \n n = int(input())\n p = [list(map(int, input().split())) for i in range(n)]\n \n-max_x = 0\n+max_x = -2000000000\n min_x = 2000000000\n-max_y = 0\n+max_y = -2000000000\n min_y = 2000000000\n for xi, yi in p:\n- x_, y_ = f(xi, yi)\n- max_x = max(max_x, x_)\n- min_x = min(min_x, x_)\n- max_y = max(max_y, y_)\n- min_y = min(min_y, y_)\n+ f1, f2 = f(xi, yi)\n+ max_x = max(max_x, f1)\n+ min_x = min(min_x, f1)\n+ max_y = max(max_y, f2)\n+ min_y = min(min_y, f2)\n \n print(max(max_x - min_x, max_y - min_y))\n", "FL_content": " def f(x, y):\n return x-y, x+y\n \n \n n = int(input())\n p = [list(map(int, input().split())) for i in range(n)]\n \n-max_x = 0\n min_x = 2000000000\n-max_y = 0\n min_y = 2000000000\n for xi, yi in p:\n- x_, y_ = f(xi, yi)\n- max_x = max(max_x, x_)\n- min_x = min(min_x, x_)\n- max_y = max(max_y, y_)\n- min_y = min(min_y, y_)\n \n print(max(max_x - min_x, max_y - min_y))\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 19 }, { "user_id": "u250026974", "problem_id": "p02556", "submission1_id": "s695438223", "submission2_id": "s165223991", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nmax_f_0 = 0\nmin_f_0 = 10**10\nmax_f_1 = 0\nmin_f_1 = 10**10\n\nfor _ in range(N):\n x, y = map(int, input().split(\" \"))\n f_0 = x - y\n f_1 = x + y\n \n if max_f_0 < f_0:\n max_f_0 = f_0\n if min_f_0 > f_0:\n min_f_0 = f_0\n if max_f_1 < f_1:\n max_f_1 = f_1\n if min_f_1 > f_1:\n min_f_1 = f_1\n \nprint(max((max_f_0-min_f_0), (max_f_1-min_f_1)))\n ", "code2": "N = int(input())\n\nmax_f_0 = -10**10\nmin_f_0 = 10**10\nmax_f_1 = -10**10\nmin_f_1 = 10**10\n\nfor _ in range(N):\n x, y = map(int, input().split(\" \"))\n f_0 = x - y\n f_1 = x + y\n \n if max_f_0 < f_0:\n max_f_0 = f_0\n if min_f_0 > f_0:\n min_f_0 = f_0\n if max_f_1 < f_1:\n max_f_1 = f_1\n if min_f_1 > f_1:\n min_f_1 = f_1\n \nprint(max((max_f_0-min_f_0), (max_f_1-min_f_1)))\n \n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600028394", "date2": "1600028546", "bleu_score": "0.9598289925452195", "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, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 91, "total_score": 97, "input": "2\n-4 1\n-3 0\n", "actual_output": "5\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=2\n\nmax_f_0 = 0 # (1): max_f_0=0\nmin_f_0 = 10**10 # (2): min_f_0=10000000000\nmax_f_1 = 0 # (3): max_f_1=0\nmin_f_1 = 10**10 # (4): min_f_1=10000000000\n\nfor _ in range(N): # (5): _=0 (15): _=1 (23): NO CHANGE\n x, y = map(int, input().split(\" \")) # (6): x=-4, y=1 (16): x=-3, y=0\n f_0 = x - y # (7): f_0=-5 (17): f_0=-3\n f_1 = x + y # (8): f_1=-3 (18): NO CHANGE\n \n if max_f_0 < f_0: # (9): NO CHANGE (19): NO CHANGE\n max_f_0 = f_0\n if min_f_0 > f_0: # (10): NO CHANGE (20): NO CHANGE\n min_f_0 = f_0 # (11): min_f_0=-5\n if max_f_1 < f_1: # (12): NO CHANGE (21): NO CHANGE\n max_f_1 = f_1\n if min_f_1 > f_1: # (13): NO CHANGE (22): NO CHANGE\n min_f_1 = f_1 # (14): min_f_1=-3\n \nprint(max((max_f_0-min_f_0), (max_f_1-min_f_1)))\n "], "anno_status": [true], "diff_content": " N = int(input())\n \n-max_f_0 = 0\n+max_f_0 = -10**10\n min_f_0 = 10**10\n-max_f_1 = 0\n+max_f_1 = -10**10\n min_f_1 = 10**10\n \n for _ in range(N):\n x, y = map(int, input().split(\" \"))\n f_0 = x - y\n f_1 = x + y\n \n if max_f_0 < f_0:\n max_f_0 = f_0\n if min_f_0 > f_0:\n min_f_0 = f_0\n if max_f_1 < f_1:\n max_f_1 = f_1\n if min_f_1 > f_1:\n min_f_1 = f_1\n \n print(max((max_f_0-min_f_0), (max_f_1-min_f_1)))\n \n+ \n", "FL_content": " N = int(input())\n \n-max_f_0 = 0\n min_f_0 = 10**10\n-max_f_1 = 0\n min_f_1 = 10**10\n \n for _ in range(N):\n x, y = map(int, input().split(\" \"))\n f_0 = x - y\n f_1 = x + y\n \n if max_f_0 < f_0:\n max_f_0 = f_0\n if min_f_0 > f_0:\n min_f_0 = f_0\n if max_f_1 < f_1:\n max_f_1 = f_1\n if min_f_1 > f_1:\n min_f_1 = f_1\n \n print(max((max_f_0-min_f_0), (max_f_1-min_f_1)))\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u726285999", "problem_id": "p02556", "submission1_id": "s143148485", "submission2_id": "s289374369", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\n\ndef main():\n N = int(sys.stdin.readline().rstrip())\n\n X = [None] * N\n Y = [None] * N \n Z = [None] * N\n\n for i in range(N):\n x, y = map(int, sys.stdin.readline().rstrip().split())\n X[i] = x\n Y[i] = y\n \n X_min = min(X)\n Y_min = min(Y)\n\n for i in range(N):\n X[i] = X[i] - X_min\n Y[i] = Y[i] - Y_min\n Z[i] = X[i] + Y[i]\n\n print(max(Z) - min(Z))\n\n\nmain()", "code2": "import sys\n\n\ndef main():\n N = int(sys.stdin.readline().rstrip())\n\n X = [None] * N\n Y = [None] * N \n Z = [None] * N\n\n for i in range(N):\n x, y = map(int, sys.stdin.readline().rstrip().split())\n X[i] = x\n Y[i] = y\n \n X_min = min(X)\n Y_min = min(Y)\n\n for i in range(N):\n X[i] = X[i] - X_min\n Y[i] = Y[i] - Y_min\n Z[i] = X[i] + Y[i]\n\n ans1 = max(Z) - min(Z)\n\n X_max = max(X)\n\n for i in range(N):\n X[i] = X_max - X[i]\n Y[i] = Y[i] - Y_min\n Z[i] = X[i] + Y[i]\n\n ans2 = max(Z) - min(Z)\n\n print(max(ans1, ans2))\n\n\nmain()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600025901", "date2": "1600026870", "bleu_score": "0.7014564391672116", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 97, "input": "3\n-1 -4\n1 -1\n-23 0\n", "actual_output": "23\n", "expected_output": "26\n\n", "anno_code": ["import sys\n\n\ndef main(): # (0): main=\n N = int(sys.stdin.readline().rstrip()) # (2): N=3\n\n X = [None] * N # (3): X=[None, None, None]\n Y = [None] * N # (4): Y=[None, None, None]\n Z = [None] * N # (5): Z=[None, None, None]\n\n for i in range(N): # (6): i=0 (10): i=1 ... (18): NO CHANGE\n x, y = map(int, sys.stdin.readline().rstrip().split()) # (7): x=-1, y=-4 (11): x=1, y=-1 (15): x=-23, y=0\n X[i] = x # (8): X=[-1, None, None] (12): X=[-1, 1, None] (16): X=[-1, 1, -23]\n Y[i] = y # (9): Y=[-4, None, None] (13): Y=[-4, -1, None] (17): Y=[-4, -1, 0]\n \n X_min = min(X) # (19): X_min=-23\n Y_min = min(Y) # (20): Y_min=-4\n\n for i in range(N): # (21): i=0 (25): i=1 ... (33): NO CHANGE\n X[i] = X[i] - X_min # (22): X=[22, 1, -23] (26): X=[22, 24, -23] (30): X=[22, 24, 0]\n Y[i] = Y[i] - Y_min # (23): Y=[0, -1, 0] (27): Y=[0, 3, 0] (31): Y=[0, 3, 4]\n Z[i] = X[i] + Y[i] # (24): Z=[22, None, None] (28): Z=[22, 27, None] (32): Z=[22, 27, 4]\n\n print(max(Z) - min(Z))\n\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n \n \n def main():\n N = int(sys.stdin.readline().rstrip())\n \n X = [None] * N\n Y = [None] * N \n Z = [None] * N\n \n for i in range(N):\n x, y = map(int, sys.stdin.readline().rstrip().split())\n X[i] = x\n Y[i] = y\n \n X_min = min(X)\n Y_min = min(Y)\n \n for i in range(N):\n X[i] = X[i] - X_min\n Y[i] = Y[i] - Y_min\n Z[i] = X[i] + Y[i]\n \n- print(max(Z) - min(Z))\n+ ans1 = max(Z) - min(Z)\n+\n+ X_max = max(X)\n+\n+ for i in range(N):\n+ X[i] = X_max - X[i]\n+ Y[i] = Y[i] - Y_min\n+ Z[i] = X[i] + Y[i]\n+\n+ ans2 = max(Z) - min(Z)\n+\n+ print(max(ans1, ans2))\n \n \n main()\n", "FL_content": " import sys\n \n \n def main():\n N = int(sys.stdin.readline().rstrip())\n \n X = [None] * N\n Y = [None] * N \n Z = [None] * N\n \n for i in range(N):\n x, y = map(int, sys.stdin.readline().rstrip().split())\n X[i] = x\n Y[i] = y\n \n X_min = min(X)\n Y_min = min(Y)\n \n for i in range(N):\n X[i] = X[i] - X_min\n Y[i] = Y[i] - Y_min\n Z[i] = X[i] + Y[i]\n \n- print(max(Z) - min(Z))\n \n \n main()\n", "added_lines": 12, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u607044138", "problem_id": "p02556", "submission1_id": "s002854534", "submission2_id": "s314631926", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ntable = [[int(i) for i in input().split()] for N in range(N)]\n\na = 0\nb = 10**9 * 2\nc = 0\nd = 10**9 * 2\nfor i in range(N):\n p = table[i][0]\n q = table[i][1]\n if a < p+q:\n a = p+q\n if b > p+q:\n b = p+q\n if c < p-q:\n c = p-q\n if d > p-q:\n d = p-q\n\nprint(max(a-b,c-d))\n", "code2": "N = int(input())\ntable = [[int(i) for i in input().split()] for N in range(N)]\n\na = -1\nb = 10**10\nc = -10**10\nd = 10**10\nfor i in range(N):\n p = table[i][0]\n q = table[i][1]\n if a < p+q:\n a = p+q\n if b > p+q:\n b = p+q\n if c < p-q:\n c = p-q\n if d > p-q:\n d = p-q\n\nprint(max(a-b,c-d))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600031260", "date2": "1600031504", "bleu_score": "0.9478751440122392", "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, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 91, "total_score": 97, "input": "2\n-5 1\n-3 0\n", "actual_output": "6\n", "expected_output": "3\n\n", "anno_code": ["N = int(input()) # (0): N=2\ntable = [[int(i) for i in input().split()] for N in range(N)] # (1): table\n\na = 0 # (2): a=0\nb = 10**9 * 2 # (3): b=2000000000\nc = 0 # (4): c=0\nd = 10**9 * 2 # (5): d=2000000000\nfor i in range(N): # (6): i=0 (15): i=1 (22): NO CHANGE\n p = table[i][0] # (7): p=-5 (16): p=-3\n q = table[i][1] # (8): q=1 (17): q=0\n if a < p+q: # (9): NO CHANGE (18): NO CHANGE\n a = p+q\n if b > p+q: # (10): NO CHANGE (19): NO CHANGE\n b = p+q # (11): b=-4\n if c < p-q: # (12): NO CHANGE (20): NO CHANGE\n c = p-q\n if d > p-q: # (13): NO CHANGE (21): NO CHANGE\n d = p-q # (14): d=-6\n\nprint(max(a-b,c-d))\n"], "anno_status": [true], "diff_content": " N = int(input())\n table = [[int(i) for i in input().split()] for N in range(N)]\n \n-a = 0\n-b = 10**9 * 2\n-c = 0\n-d = 10**9 * 2\n+a = -1\n+b = 10**10\n+c = -10**10\n+d = 10**10\n for i in range(N):\n p = table[i][0]\n q = table[i][1]\n if a < p+q:\n a = p+q\n if b > p+q:\n b = p+q\n if c < p-q:\n c = p-q\n if d > p-q:\n d = p-q\n \n print(max(a-b,c-d))\n \n", "FL_content": " N = int(input())\n table = [[int(i) for i in input().split()] for N in range(N)]\n \n-a = 0\n-b = 10**9 * 2\n-c = 0\n-d = 10**9 * 2\n for i in range(N):\n p = table[i][0]\n q = table[i][1]\n if a < p+q:\n a = p+q\n if b > p+q:\n b = p+q\n if c < p-q:\n c = p-q\n if d > p-q:\n d = p-q\n \n print(max(a-b,c-d))\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 21 }, { "user_id": "u566159623", "problem_id": "p02556", "submission1_id": "s969936353", "submission2_id": "s392761529", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nz = []\nzz = []\nfor _ in range(N):\n x, y = map(int, input().split())\n zz.append(x-y)\n z.append(x+y)\nz.sort()\nzz.sort()\nans = z[-1]-z[0]\nans = max(ans, zz[-1]+zz[0])\n\nprint(ans)", "code2": "N = int(input())\nz = []\nzz = []\nfor _ in range(N):\n x, y = map(int, input().split())\n zz.append(x-y)\n z.append(x+y)\nz.sort()\nzz.sort()\nans = z[-1]-z[0]\nans = max(ans, zz[-1]-zz[0])\n\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600031645", "date2": "1600031689", "bleu_score": "0.9874205623599036", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 67, "total_score": 97, "input": "3\n-3 -1\n0 6\n9 0\n", "actual_output": "13\n", "expected_output": "15\n\n", "anno_code": ["N = int(input()) # (0): N=3\nz = [] # (1): z=[]\nzz = [] # (2): zz=[]\nfor _ in range(N): # (3): _=0 (7): _=1 ... (15): NO CHANGE\n x, y = map(int, input().split()) # (4): x=-3, y=-1 (8): x=0, y=6 (12): x=9, y=0\n zz.append(x-y) # (5): zz=[-2] (9): zz=[-2, -6] (13): zz=[-2, -6, 9]\n z.append(x+y) # (6): z=[-4] (10): z=[-4, 6] (14): z=[-4, 6, 9]\nz.sort() # (16): NO CHANGE\nzz.sort() # (17): zz=[-6, -2, 9]\nans = z[-1]-z[0] # (18): ans=13\nans = max(ans, zz[-1]+zz[0]) # (19): NO CHANGE\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n z = []\n zz = []\n for _ in range(N):\n x, y = map(int, input().split())\n zz.append(x-y)\n z.append(x+y)\n z.sort()\n zz.sort()\n ans = z[-1]-z[0]\n-ans = max(ans, zz[-1]+zz[0])\n+ans = max(ans, zz[-1]-zz[0])\n \n print(ans)\n", "FL_content": " N = int(input())\n z = []\n zz = []\n for _ in range(N):\n x, y = map(int, input().split())\n zz.append(x-y)\n z.append(x+y)\n z.sort()\n zz.sort()\n ans = z[-1]-z[0]\n-ans = max(ans, zz[-1]+zz[0])\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u588794534", "problem_id": "p02556", "submission1_id": "s005619017", "submission2_id": "s619129631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\n\nx=[]\ny=[]\nfor _ in range(n):\n xx,yy=map(int,input().split())\n x.append(xx)\n y.append(yy)\n\ndef maxAbsValExpr(arr1, arr2):\n minX, maxX = min(arr1), max(arr1)\n minY, maxY = min(arr2), max(arr2)\n \n ans = 0\n \n for point in [(minX, minY), (maxX, minY), (minX, maxY), (maxX, maxY)]:\n minD = float('inf')\n maxD = float('-inf')\n for i in range(0, len(arr1)):\n distance = abs(arr1[i]-point[0]) + abs(arr2[i]-point[1]) + i\n minD = min(minD, distance)\n maxD = max(maxD, distance)\n ans = max(ans, maxD - minD)\n return ans\n\n\nprint(maxAbsValExpr(x, y)-1)\n\n", "code2": "n=int(input())\n\nx=[]\ny=[]\nfor _ in range(n):\n xx,yy=map(int,input().split())\n x.append(xx)\n y.append(yy)\n\ndef maxAbsValExpr(arr1, arr2):\n minX, maxX = min(arr1), max(arr1)\n minY, maxY = min(arr2), max(arr2)\n \n ans = 0\n \n for point in [(minX, minY), (maxX, minY), (minX, maxY), (maxX, maxY)]:\n minD = float('inf')\n maxD = float('-inf')\n for i in range(0, len(arr1)):\n distance = abs(arr1[i]-point[0]) + abs(arr2[i]-point[1]) \n minD = min(minD, distance)\n maxD = max(maxD, distance)\n ans = max(ans, maxD - minD)\n return ans\n\n\nprint(maxAbsValExpr(x, y))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600029584", "date2": "1600030093", "bleu_score": "0.9865181340318343", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 97, "input": "3\n0 -2\n0 0\n11 2\n", "actual_output": "16\n", "expected_output": "15\n\n", "anno_code": ["n=int(input()) # (0): n=3\n\nx=[] # (1): x=[]\ny=[] # (2): y=[]\nfor _ in range(n): # (3): _=0 (7): _=1 ... (15): NO CHANGE\n xx,yy=map(int,input().split()) # (4): xx=0, yy=-2 (8): yy=0 (12): xx=11, yy=2\n x.append(xx) # (5): x=[0] (9): x=[0, 0] (13): x=[0, 0, 11]\n y.append(yy) # (6): y=[-2] (10): y=[-2, 0] (14): y=[-2, 0, 2]\n\ndef maxAbsValExpr(arr1, arr2): # (16): maxAbsValExpr=\n minX, maxX = min(arr1), max(arr1) # (18): minX=0, maxX=11\n minY, maxY = min(arr2), max(arr2) # (19): minY=-2, maxY=2\n \n ans = 0 # (20): ans=0\n \n for point in [(minX, minY), (maxX, minY), (minX, maxY), (maxX, maxY)]: # (21): point=(0, -2) (40): point=(11, -2) ... (78): point=(11, 2)\n minD = float('inf') # (22): minD=inf (41): minD=inf ... (79): minD=inf\n maxD = float('-inf') # (23): maxD=-inf (42): maxD=-inf ... (80): maxD=-inf\n for i in range(0, len(arr1)): # (24): i=0 (29): i=1 ... (96): NO CHANGE\n distance = abs(arr1[i]-point[0]) + abs(arr2[i]-point[1]) + i # (25): distance=0 (30): distance=3 ... (92): distance=2\n minD = min(minD, distance) # (26): minD=0 (31): NO CHANGE ... (93): minD=2\n maxD = max(maxD, distance) # (27): maxD=0 (32): maxD=3 ... (94): NO CHANGE\n ans = max(ans, maxD - minD) # (28): NO CHANGE (33): ans=3 ... (95): NO CHANGE\n return ans\n\n\nprint(maxAbsValExpr(x, y)-1) # (17): arr1=[0, 0, 11], arr2=[-2, 0, 2]\n\n"], "anno_status": [true], "diff_content": " n=int(input())\n \n x=[]\n y=[]\n for _ in range(n):\n xx,yy=map(int,input().split())\n x.append(xx)\n y.append(yy)\n \n def maxAbsValExpr(arr1, arr2):\n minX, maxX = min(arr1), max(arr1)\n minY, maxY = min(arr2), max(arr2)\n \n ans = 0\n \n for point in [(minX, minY), (maxX, minY), (minX, maxY), (maxX, maxY)]:\n minD = float('inf')\n maxD = float('-inf')\n for i in range(0, len(arr1)):\n- distance = abs(arr1[i]-point[0]) + abs(arr2[i]-point[1]) + i\n+ distance = abs(arr1[i]-point[0]) + abs(arr2[i]-point[1]) \n minD = min(minD, distance)\n maxD = max(maxD, distance)\n ans = max(ans, maxD - minD)\n return ans\n \n \n-print(maxAbsValExpr(x, y)-1)\n-\n+print(maxAbsValExpr(x, y))\n \n", "FL_content": " n=int(input())\n \n x=[]\n y=[]\n for _ in range(n):\n xx,yy=map(int,input().split())\n x.append(xx)\n y.append(yy)\n \n def maxAbsValExpr(arr1, arr2):\n minX, maxX = min(arr1), max(arr1)\n minY, maxY = min(arr2), max(arr2)\n \n ans = 0\n \n for point in [(minX, minY), (maxX, minY), (minX, maxY), (maxX, maxY)]:\n minD = float('inf')\n maxD = float('-inf')\n for i in range(0, len(arr1)):\n- distance = abs(arr1[i]-point[0]) + abs(arr2[i]-point[1]) + i\n minD = min(minD, distance)\n maxD = max(maxD, distance)\n ans = max(ans, maxD - minD)\n return ans\n \n \n-print(maxAbsValExpr(x, y)-1)\n-\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 29 }, { "user_id": "u412197640", "problem_id": "p02556", "submission1_id": "s034440107", "submission2_id": "s263454978", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import *\nN = int(stdin.readline())\na = []\n\nfor i in range(N):\n tmp = list(map(int, stdin.readline().split()))\n a.append(tmp)\na.sort(key = lambda k: k[0]+k[1])\nbest = 0\nfor i in range(N-1):\n best = max(best, abs(a[i][0] - a[-1][0]) + abs(a[i][1] - a[-1][1]))\n\nprint(best)\n", "code2": "from sys import *\nN = int(stdin.readline())\na,b = [],[]\nfor i in range(N):\n tmp = list(map(int, stdin.readline().split()))\n a.append(tmp[0] + tmp[1])\n b.append(tmp[0] - tmp[1])\n\na.sort()\nb.sort()\nprint(max(a[-1]-a[0], b[-1]-b[0]))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600028658", "date2": "1600046704", "bleu_score": "0.630288144676575", "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, 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], "code1_test_score": 95, "total_score": 97, "input": "3\n-1 -4\n1 -1\n-23 4\n", "actual_output": "29\n", "expected_output": "30\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 221, in \n\n run_script(target_script, input_file)\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 191, in run_script\n\n exec(script_content, script_globals)\n\n File \"\", line 2, in \n\n File \"\", line 2, in \n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 60, in trace_lines\n\n current_locals[each] = copy.deepcopy(frame.f_locals[each])\n\n File \"G:\\Anaconda\\Anaconda\\envs\\common\\lib\\copy.py\", line 146, in deepcopy\n\n y = copier(x, memo)\n\n File \"G:\\Anaconda\\Anaconda\\envs\\common\\lib\\copy.py\", line 231, in _deepcopy_dict\n\n y[deepcopy(key, memo)] = deepcopy(value, memo)\n\n File \"G:\\Anaconda\\Anaconda\\envs\\common\\lib\\copy.py\", line 161, in deepcopy\n\n rv = reductor(4)\n\nTypeError: cannot pickle 'module' object\n\n"], "anno_status": [true], "diff_content": " from sys import *\n N = int(stdin.readline())\n-a = []\n-\n+a,b = [],[]\n for i in range(N):\n tmp = list(map(int, stdin.readline().split()))\n- a.append(tmp)\n-a.sort(key = lambda k: k[0]+k[1])\n-best = 0\n-for i in range(N-1):\n- best = max(best, abs(a[i][0] - a[-1][0]) + abs(a[i][1] - a[-1][1]))\n+ a.append(tmp[0] + tmp[1])\n+ b.append(tmp[0] - tmp[1])\n \n-print(best)\n+a.sort()\n+b.sort()\n+print(max(a[-1]-a[0], b[-1]-b[0]))\n \n", "FL_content": " from sys import *\n N = int(stdin.readline())\n-a = []\n-\n for i in range(N):\n tmp = list(map(int, stdin.readline().split()))\n- a.append(tmp)\n-a.sort(key = lambda k: k[0]+k[1])\n-best = 0\n-for i in range(N-1):\n- best = max(best, abs(a[i][0] - a[-1][0]) + abs(a[i][1] - a[-1][1]))\n \n-print(best)\n \n", "added_lines": 6, "removed_lines": 8, "code1_lines": 14 }, { "user_id": "u995004106", "problem_id": "p02556", "submission1_id": "s286562045", "submission2_id": "s925020509", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import *\nimport fractions\nimport sys\nimport collections\nimport itertools\nimport pprint\nfrom collections import deque\nfrom heapq import *\nimport copy\nN=int(input())\npoints=[list(map(int,input().split())) for _ in range(N)]\n\n\nchebmax0=-float(\"inf\")\nchebmin0=float(\"inf\")\nchebmax1=-float(\"inf\")\nchebmin1=float(\"inf\")\n\n\nfor l in points:\n chebmax0=max(chebmax0,l[0]-l[1])\nfor l in points:\n chebmin0=min(chebmax0,l[0]-l[1])\nfor l in points:\n chebmax1=max(chebmax1,l[0]+l[1])\nfor l in points:\n chebmin1=min(chebmax1,l[0]+l[1])\n\nprint(max(chebmax0-chebmin0,chebmax1-chebmin1))", "code2": "from math import *\nimport fractions\nimport sys\nimport collections\nimport itertools\nimport pprint\nfrom collections import deque\nfrom heapq import *\nimport copy\nN=int(input())\npoints=[list(map(int,input().split())) for _ in range(N)]\n\n\nchebmax0=-float(\"inf\")\nchebmin0=float(\"inf\")\nchebmax1=-float(\"inf\")\nchebmin1=float(\"inf\")\n\n\nfor l in points:\n chebmax0=max(chebmax0,l[0]-l[1])\nfor l in points:\n chebmin0=min(chebmin0,l[0]-l[1])\nfor l in points:\n chebmax1=max(chebmax1,l[0]+l[1])\nfor l in points:\n chebmin1=min(chebmin1,l[0]+l[1])\n\nprint(max(chebmax0-chebmin0,chebmax1-chebmin1))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600027577", "date2": "1600027651", "bleu_score": "0.9880906982736528", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 48, "total_score": 97, "input": "3\n0 -2\n0 1\n23 -1\n", "actual_output": "0\n", "expected_output": "25\n\n", "anno_code": ["from math import *\nimport fractions\nimport sys\nimport collections\nimport itertools\nimport pprint\nfrom collections import deque\nfrom heapq import *\nimport copy\nN=int(input()) # (0): nan=nan, N=3\npoints=[list(map(int,input().split())) for _ in range(N)] # (1): nan=nan, points\n\n\nchebmax0=-float(\"inf\") # (2): nan=nan, chebmax0=-inf\nchebmin0=float(\"inf\") # (3): nan=nan, chebmin0=inf\nchebmax1=-float(\"inf\") # (4): nan=nan, chebmax1=-inf\nchebmin1=float(\"inf\") # (5): nan=nan, chebmin1=inf\n\n\nfor l in points: # (6): nan=nan, l=[0, -2] (8): nan=nan, l=[0, 1] ... (12): nan=nan\n chebmax0=max(chebmax0,l[0]-l[1]) # (7): nan=nan, chebmax0=2 (9): nan=nan (11): nan=nan, chebmax0=24\nfor l in points: # (13): nan=nan, l=[0, -2] (15): nan=nan, l=[0, 1] ... (19): nan=nan\n chebmin0=min(chebmax0,l[0]-l[1]) # (14): nan=nan, chebmin0=2 (16): nan=nan, chebmin0=-1 (18): nan=nan, chebmin0=24\nfor l in points: # (20): nan=nan, l=[0, -2] (22): nan=nan, l=[0, 1] ... (26): nan=nan\n chebmax1=max(chebmax1,l[0]+l[1]) # (21): nan=nan, chebmax1=-2 (23): nan=nan, chebmax1=1 (25): nan=nan, chebmax1=22\nfor l in points: # (27): nan=nan, l=[0, -2] (29): nan=nan, l=[0, 1] ... (33): nan=nan\n chebmin1=min(chebmax1,l[0]+l[1]) # (28): nan=nan, chebmin1=-2 (30): nan=nan, chebmin1=1 (32): nan=nan, chebmin1=22\n\nprint(max(chebmax0-chebmin0,chebmax1-chebmin1))"], "anno_status": [true], "diff_content": " from math import *\n import fractions\n import sys\n import collections\n import itertools\n import pprint\n from collections import deque\n from heapq import *\n import copy\n N=int(input())\n points=[list(map(int,input().split())) for _ in range(N)]\n \n \n chebmax0=-float(\"inf\")\n chebmin0=float(\"inf\")\n chebmax1=-float(\"inf\")\n chebmin1=float(\"inf\")\n \n \n for l in points:\n chebmax0=max(chebmax0,l[0]-l[1])\n for l in points:\n- chebmin0=min(chebmax0,l[0]-l[1])\n+ chebmin0=min(chebmin0,l[0]-l[1])\n for l in points:\n chebmax1=max(chebmax1,l[0]+l[1])\n for l in points:\n- chebmin1=min(chebmax1,l[0]+l[1])\n+ chebmin1=min(chebmin1,l[0]+l[1])\n \n print(max(chebmax0-chebmin0,chebmax1-chebmin1))\n", "FL_content": " from math import *\n import fractions\n import sys\n import collections\n import itertools\n import pprint\n from collections import deque\n from heapq import *\n import copy\n N=int(input())\n points=[list(map(int,input().split())) for _ in range(N)]\n \n \n chebmax0=-float(\"inf\")\n chebmin0=float(\"inf\")\n chebmax1=-float(\"inf\")\n chebmin1=float(\"inf\")\n \n \n for l in points:\n chebmax0=max(chebmax0,l[0]-l[1])\n for l in points:\n- chebmin0=min(chebmax0,l[0]-l[1])\n for l in points:\n chebmax1=max(chebmax1,l[0]+l[1])\n for l in points:\n- chebmin1=min(chebmax1,l[0]+l[1])\n \n print(max(chebmax0-chebmin0,chebmax1-chebmin1))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u942697937", "problem_id": "p02556", "submission1_id": "s153656241", "submission2_id": "s625029595", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nP = [[int(_) for _ in input().split()] for n in range(N)]\n\nX = []\nY = []\nfor x, y in P:\n X.append(x)\n Y.append(y)\nmx = (min(X) + max(X)) \nmy = (min(X) + max(X)) \n\nQ = []\nfor x, y in P:\n x, y = x-mx, y-my\n Q.append((x+y, x-y))\n\nans = 0\nfor x, y in Q:\n ans = max(ans, abs(x) + abs(y))\nprint(ans)\n", "code2": "N = int(input())\n\nP = [[int(_) for _ in input().split()] for n in range(N)]\n\nX = []\nY = []\nfor x, y in P:\n X.append(x)\n Y.append(y)\nmx = (min(X) + max(X)) \nmy = (min(Y) + max(Y)) \n\nQx = []\nQy = []\nfor x, y in P:\n x, y = x-mx, y-my\n Qx.append(x+y)\n Qy.append(x-y)\n\nax = max(Qx) - min(Qx)\nay = max(Qy) - min(Qy)\nans = max(ax, ay)\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600027373", "date2": "1600028439", "bleu_score": "0.7861430601708906", "code1_test_status": [0, 1, 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, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 8, "total_score": 97, "input": "2\n0 -3\n-1 1\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["N = int(input()) # (0): N=2\n\nP = [[int(_) for _ in input().split()] for n in range(N)] # (1): P\n\nX = [] # (2): X=[]\nY = [] # (3): Y=[]\nfor x, y in P: # (4): x=0, y=-3 (7): x=-1, y=1 (10): NO CHANGE\n X.append(x) # (5): X=[0] (8): X=[0, -1]\n Y.append(y) # (6): Y=[-3] (9): Y=[-3, 1]\nmx = (min(X) + max(X)) # (11): mx=-1\nmy = (min(X) + max(X)) # (12): my=-1\n\nQ = [] # (13): Q=[]\nfor x, y in P: # (14): x=0, y=-3 (17): x=-1, y=1 (20): NO CHANGE\n x, y = x-mx, y-my # (15): x=1, y=-2 (18): x=0, y=2\n Q.append((x+y, x-y)) # (16): Q=[(-1, 3)] (19): Q=[(-1, 3), (2, -2)]\n\nans = 0 # (21): ans=0\nfor x, y in Q: # (22): x=-1, y=3 (24): x=2, y=-2 (26): NO CHANGE\n ans = max(ans, abs(x) + abs(y)) # (23): ans=4 (25): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n \n P = [[int(_) for _ in input().split()] for n in range(N)]\n \n X = []\n Y = []\n for x, y in P:\n X.append(x)\n Y.append(y)\n mx = (min(X) + max(X)) \n-my = (min(X) + max(X)) \n+my = (min(Y) + max(Y)) \n \n-Q = []\n+Qx = []\n+Qy = []\n for x, y in P:\n x, y = x-mx, y-my\n- Q.append((x+y, x-y))\n+ Qx.append(x+y)\n+ Qy.append(x-y)\n \n-ans = 0\n-for x, y in Q:\n- ans = max(ans, abs(x) + abs(y))\n+ax = max(Qx) - min(Qx)\n+ay = max(Qy) - min(Qy)\n+ans = max(ax, ay)\n print(ans)\n \n", "FL_content": " N = int(input())\n \n P = [[int(_) for _ in input().split()] for n in range(N)]\n \n X = []\n Y = []\n for x, y in P:\n X.append(x)\n Y.append(y)\n mx = (min(X) + max(X)) \n-my = (min(X) + max(X)) \n \n-Q = []\n for x, y in P:\n x, y = x-mx, y-my\n- Q.append((x+y, x-y))\n \n-ans = 0\n-for x, y in Q:\n- ans = max(ans, abs(x) + abs(y))\n print(ans)\n \n", "added_lines": 8, "removed_lines": 6, "code1_lines": 22 }, { "user_id": "u249218427", "problem_id": "p02556", "submission1_id": "s461037170", "submission2_id": "s286841568", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nXY_max = -10**10\nXY_min = 10**10\nYX_max = -10**10\nYX_min = 10**10\n\nfor _ in range(N):\n x,y = map(int, input().split())\n XY_max = max(XY_max,x+y)\n XY_min = min(XY_min,x+y)\n YX_max = max(YX_max,x-y)\n YX_min = max(YX_min,x-y)\n\nprint(max(XY_max-XY_min,YX_max-YX_min))", "code2": "N = int(input())\n\nXY_max = -10**10\nXY_min = 10**10\nYX_max = -10**10\nYX_min = 10**10\n\nfor _ in range(N):\n x,y = map(int, input().split())\n XY_max = max(XY_max,x+y)\n XY_min = min(XY_min,x+y)\n YX_max = max(YX_max,x-y)\n YX_min = min(YX_min,x-y)\n\nprint(max(XY_max-XY_min,YX_max-YX_min))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600028304", "date2": "1600028345", "bleu_score": "0.987674069101253", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 97, "input": "2\n-4 1\n-3 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=2\n\nXY_max = -10**10 # (1): XY_max=-10000000000\nXY_min = 10**10 # (2): XY_min=10000000000\nYX_max = -10**10 # (3): YX_max=-10000000000\nYX_min = 10**10 # (4): YX_min=10000000000\n\nfor _ in range(N): # (5): _=0 (11): _=1 (17): NO CHANGE\n x,y = map(int, input().split()) # (6): x=-4, y=1 (12): x=-3, y=0\n XY_max = max(XY_max,x+y) # (7): XY_max=-3 (13): NO CHANGE\n XY_min = min(XY_min,x+y) # (8): XY_min=-3 (14): NO CHANGE\n YX_max = max(YX_max,x-y) # (9): YX_max=-5 (15): YX_max=-3\n YX_min = max(YX_min,x-y) # (10): NO CHANGE (16): NO CHANGE\n\nprint(max(XY_max-XY_min,YX_max-YX_min))"], "anno_status": [true], "diff_content": " N = int(input())\n \n XY_max = -10**10\n XY_min = 10**10\n YX_max = -10**10\n YX_min = 10**10\n \n for _ in range(N):\n x,y = map(int, input().split())\n XY_max = max(XY_max,x+y)\n XY_min = min(XY_min,x+y)\n YX_max = max(YX_max,x-y)\n- YX_min = max(YX_min,x-y)\n+ YX_min = min(YX_min,x-y)\n \n print(max(XY_max-XY_min,YX_max-YX_min))\n", "FL_content": " N = int(input())\n \n XY_max = -10**10\n XY_min = 10**10\n YX_max = -10**10\n YX_min = 10**10\n \n for _ in range(N):\n x,y = map(int, input().split())\n XY_max = max(XY_max,x+y)\n XY_min = min(XY_min,x+y)\n YX_max = max(YX_max,x-y)\n- YX_min = max(YX_min,x-y)\n \n print(max(XY_max-XY_min,YX_max-YX_min))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u716641520", "problem_id": "p02556", "submission1_id": "s765500891", "submission2_id": "s981938926", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nmaxx, minx, maxy, miny = -1**10, 1**10, -1**10, 1**10\nfor _ in range(n):\n\tx, y = map(int, input().split())\n\tx, y = x+y, x-y\n\tmaxx = max(maxx, x)\n\tminx = min(minx, x)\n\tmaxy = max(maxy, y)\n\tminy = min(miny, y)\nprint(max(maxx - minx, maxy - miny))\n", "code2": "n = int(input())\nmaxx, minx, maxy, miny = -10**10, 10**10, -10**10, 10**10\nfor _ in range(n):\n\tx, y = map(int, input().split())\n\tx, y = x+y, x-y\n\tmaxx = max(maxx, x)\n\tminx = min(minx, x)\n\tmaxy = max(maxy, y)\n\tminy = min(miny, y)\nprint(max(maxx - minx, maxy - miny))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600111488", "date2": "1600111768", "bleu_score": "0.9619692299527578", "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, 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, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 89, "total_score": 97, "input": "2\n-5 2\n-3 0\n", "actual_output": "6\n", "expected_output": "4\n\n", "anno_code": ["n = int(input()) # (0): n=2\nmaxx, minx, maxy, miny = -1**10, 1**10, -1**10, 1**10 # (1): maxx=-1, minx=1, maxy=-1, miny=1\nfor _ in range(n): # (2): _=0 (9): _=1 (16): NO CHANGE\n\tx, y = map(int, input().split()) # (3): x=-5, y=2 (10): y=0\n\tx, y = x+y, x-y # (4): x=-3, y=-7 (11): y=-3\n\tmaxx = max(maxx, x) # (5): NO CHANGE (12): NO CHANGE\n\tminx = min(minx, x) # (6): minx=-3 (13): NO CHANGE\n\tmaxy = max(maxy, y) # (7): NO CHANGE (14): NO CHANGE\n\tminy = min(miny, y) # (8): miny=-7 (15): NO CHANGE\nprint(max(maxx - minx, maxy - miny))\n"], "anno_status": [true], "diff_content": " n = int(input())\n-maxx, minx, maxy, miny = -1**10, 1**10, -1**10, 1**10\n+maxx, minx, maxy, miny = -10**10, 10**10, -10**10, 10**10\n for _ in range(n):\n \tx, y = map(int, input().split())\n \tx, y = x+y, x-y\n \tmaxx = max(maxx, x)\n \tminx = min(minx, x)\n \tmaxy = max(maxy, y)\n \tminy = min(miny, y)\n print(max(maxx - minx, maxy - miny))\n \n", "FL_content": " n = int(input())\n-maxx, minx, maxy, miny = -1**10, 1**10, -1**10, 1**10\n for _ in range(n):\n \tx, y = map(int, input().split())\n \tx, y = x+y, x-y\n \tmaxx = max(maxx, x)\n \tminx = min(minx, x)\n \tmaxy = max(maxy, y)\n \tminy = min(miny, y)\n print(max(maxx - minx, maxy - miny))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u761168538", "problem_id": "p02556", "submission1_id": "s825026886", "submission2_id": "s638982852", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\narr=[]\ns=set()\nfor _ in range(n):\n\tx,y=map(int,input().split())\n\tif((x,y) not in s):\n\t\tarr.append(x+y)\n\t\ts.add((x,y))\narr.sort()\nif(len(arr)==1):\n\tprint(0)\nelse:\n\tprint(arr[-1]-arr[0])", "code2": "n=int(input())\narr=[]\narr2=[]\ns=set()\nfor _ in range(n):\n\tx,y=map(int,input().split())\n\tif((x,y) not in s):\n\t\tarr.append(x+y)\n\t\tarr2.append(x-y)\n\t\ts.add((x,y))\narr.sort()\narr2.sort()\nif(len(arr)==1):\n\tprint(0)\nelse:\n\tans=arr[-1]-arr[0]\n\tans=max(ans,arr2[-1]-arr2[0])\n\tprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600026025", "date2": "1600026526", "bleu_score": "0.7106263818475568", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 97, "input": "3\n1 2\n1 4\n3 1\n", "actual_output": "2\n", "expected_output": "5\n\n", "anno_code": ["n=int(input()) # (0): n=3\narr=[] # (1): arr=[]\ns=set() # (2): s=set()\nfor _ in range(n): # (3): _=0 (8): _=1 ... (18): NO CHANGE\n\tx,y=map(int,input().split()) # (4): x=1, y=2 (9): y=4 (14): x=3, y=1\n\tif((x,y) not in s): # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n\t\tarr.append(x+y) # (6): arr=[3] (11): arr=[3, 5] (16): arr=[3, 5, 4]\n\t\ts.add((x,y)) # (7): s={(1, 2)} (12): s={(1, 2), (1, 4)} (17): s={(3, 1), (1, 2), (1, 4)}\narr.sort() # (19): arr=[3, 4, 5]\nif(len(arr)==1): # (20): NO CHANGE\n\tprint(0)\nelse:\n\tprint(arr[-1]-arr[0])"], "anno_status": [true], "diff_content": " n=int(input())\n arr=[]\n+arr2=[]\n s=set()\n for _ in range(n):\n \tx,y=map(int,input().split())\n \tif((x,y) not in s):\n \t\tarr.append(x+y)\n+\t\tarr2.append(x-y)\n \t\ts.add((x,y))\n arr.sort()\n+arr2.sort()\n if(len(arr)==1):\n \tprint(0)\n else:\n-\tprint(arr[-1]-arr[0])\n+\tans=arr[-1]-arr[0]\n+\tans=max(ans,arr2[-1]-arr2[0])\n+\tprint(ans)\n", "FL_content": " n=int(input())\n arr=[]\n s=set()\n for _ in range(n):\n \tx,y=map(int,input().split())\n \tif((x,y) not in s):\n \t\tarr.append(x+y)\n \t\ts.add((x,y))\n arr.sort()\n if(len(arr)==1):\n \tprint(0)\n else:\n-\tprint(arr[-1]-arr[0])\n", "added_lines": 6, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u547608423", "problem_id": "p02556", "submission1_id": "s536894716", "submission2_id": "s245159558", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ni = []\nj = []\nfor k in range(N):\n x, y = map(int, input().split())\n i.append(x+y)\n j.append(-x-y)\n\nprint(max(abs(max(i)+max(j)), abs(min(i)+min(j))))\n", "code2": "N = int(input())\ni = []\nj = []\nfor k in range(N):\n x, y = map(int, input().split())\n i.append(x+y)\n j.append(x-y)\n\nprint(max(max(i)-min(i), max(j)-min(j)))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600025205", "date2": "1600028898", "bleu_score": "0.8815552280109659", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 97, "input": "3\n0 2\n1 4\n3 1\n", "actual_output": "3\n", "expected_output": "5\n\n", "anno_code": ["N = int(input()) # (0): N=3\ni = [] # (1): i=[]\nj = [] # (2): j=[]\nfor k in range(N): # (3): k=0 (7): k=1 ... (15): NO CHANGE\n x, y = map(int, input().split()) # (4): x=0, y=2 (8): x=1, y=4 (12): x=3, y=1\n i.append(x+y) # (5): i=[2] (9): i=[2, 5] (13): i=[2, 5, 4]\n j.append(-x-y) # (6): j=[-2] (10): j=[-2, -5] (14): j=[-2, -5, -4]\n\nprint(max(abs(max(i)+max(j)), abs(min(i)+min(j))))\n"], "anno_status": [true], "diff_content": " N = int(input())\n i = []\n j = []\n for k in range(N):\n x, y = map(int, input().split())\n i.append(x+y)\n- j.append(-x-y)\n+ j.append(x-y)\n \n-print(max(abs(max(i)+max(j)), abs(min(i)+min(j))))\n+print(max(max(i)-min(i), max(j)-min(j)))\n \n", "FL_content": " N = int(input())\n i = []\n j = []\n for k in range(N):\n x, y = map(int, input().split())\n i.append(x+y)\n- j.append(-x-y)\n \n-print(max(abs(max(i)+max(j)), abs(min(i)+min(j))))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u594803920", "problem_id": "p02556", "submission1_id": "s962268363", "submission2_id": "s724681939", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nl = []\nll = []\nfor _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\nl.sort()\nll.sort()\nans1 = 0\nans2 = 0\n\ncnt = 0\nwhile True:\n a = l[-cnt]\n b = l[cnt]\n if a[1] >= b[1] and a[2] >= b[2]:\n ans1 = b[0]-a[0]\n break\n if cnt >= n-1:\n break\n cnt += 1\n\ncnt = 0\nwhile True:\n a = l[-cnt]\n b = l[cnt]\n if a[1] >= a[2] and b[2] >= b[1]:\n ans2 = b[0]-a[0]\n break\n if cnt >= n-1:\n break\n cnt += 1\n\nprint(max(ans1, ans2))\n", "code2": "n = int(input())\nl = []\nll = []\nfor _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\nl.sort()\nll.sort()\nans1 = 0\nans2 = 0\n\n\n\ncnt = 0\nwhile True:\n a = l[n-1-cnt]\n b = l[cnt]\n \n if a[1] >= b[1] and a[2] >= b[2]:\n ans1 = abs(b[0]-a[0])\n \n break\n if cnt >= n-1:\n break\n cnt += 1\n\ncnt = 0\nwhile True:\n a = ll[n-1-cnt]\n b = ll[cnt]\n if a[1] >= b[1] and b[2] >= a[2]:\n ans2 = abs(b[0]-a[0])\n \n break\n if cnt >= n-1:\n break\n cnt += 1\n\nprint(max(ans1, ans2))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600028188", "date2": "1600028689", "bleu_score": "0.9071407547914443", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0], "code1_test_score": 1, "total_score": 97, "input": "2\n0 2\n39 0\n", "actual_output": "0\n", "expected_output": "41\n\n", "anno_code": ["n = int(input()) # (0): n=2\nl = [] # (1): l=[]\nll = [] # (2): ll=[]\nfor _ in range(n): # (3): _=0 (7): _=1 (11): NO CHANGE\n x, y = map(int, input().split()) # (4): x=0, y=2 (8): x=39, y=0\n l.append((x+y, x, y)) # (5): l=[(2, 0, 2)] (9): l=[(2, 0, 2), (39, 39, 0)]\n ll.append((x-y, x, y)) # (6): ll=[(-2, 0, 2)] (10): ll=[(-2, 0, 2), (39, 39, 0)]\nl.sort() # (12): NO CHANGE\nll.sort() # (13): NO CHANGE\nans1 = 0 # (14): ans1=0\nans2 = 0 # (15): ans2=0\n\ncnt = 0 # (16): cnt=0\nwhile True: # (17): NO CHANGE\n a = l[-cnt] # (18): a=(2, 0, 2)\n b = l[cnt] # (19): b=(2, 0, 2)\n if a[1] >= b[1] and a[2] >= b[2]: # (20): NO CHANGE\n ans1 = b[0]-a[0] # (21): NO CHANGE\n break # (22): NO CHANGE\n if cnt >= n-1:\n break\n cnt += 1\n\ncnt = 0 # (23): NO CHANGE\nwhile True: # (24): NO CHANGE (30): NO CHANGE\n a = l[-cnt] # (25): NO CHANGE (31): a=(39, 39, 0)\n b = l[cnt] # (26): NO CHANGE (32): b=(39, 39, 0)\n if a[1] >= a[2] and b[2] >= b[1]: # (27): NO CHANGE (33): NO CHANGE\n ans2 = b[0]-a[0]\n break\n if cnt >= n-1: # (28): NO CHANGE (34): NO CHANGE\n break # (35): NO CHANGE\n cnt += 1 # (29): cnt=1\n\nprint(max(ans1, ans2))\n"], "anno_status": [true], "diff_content": " n = int(input())\n l = []\n ll = []\n for _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\n l.sort()\n ll.sort()\n ans1 = 0\n ans2 = 0\n \n+\n+\n cnt = 0\n while True:\n- a = l[-cnt]\n+ a = l[n-1-cnt]\n b = l[cnt]\n+ \n if a[1] >= b[1] and a[2] >= b[2]:\n- ans1 = b[0]-a[0]\n+ ans1 = abs(b[0]-a[0])\n+ \n break\n if cnt >= n-1:\n break\n cnt += 1\n \n cnt = 0\n while True:\n- a = l[-cnt]\n- b = l[cnt]\n- if a[1] >= a[2] and b[2] >= b[1]:\n- ans2 = b[0]-a[0]\n+ a = ll[n-1-cnt]\n+ b = ll[cnt]\n+ if a[1] >= b[1] and b[2] >= a[2]:\n+ ans2 = abs(b[0]-a[0])\n+ \n break\n if cnt >= n-1:\n break\n cnt += 1\n \n print(max(ans1, ans2))\n \n", "FL_content": " n = int(input())\n l = []\n ll = []\n for _ in range(n):\n x, y = map(int, input().split())\n l.append((x+y, x, y))\n ll.append((x-y, x, y))\n l.sort()\n ll.sort()\n ans1 = 0\n ans2 = 0\n \n cnt = 0\n while True:\n- a = l[-cnt]\n b = l[cnt]\n if a[1] >= b[1] and a[2] >= b[2]:\n- ans1 = b[0]-a[0]\n break\n if cnt >= n-1:\n break\n cnt += 1\n \n cnt = 0\n while True:\n- a = l[-cnt]\n- b = l[cnt]\n- if a[1] >= a[2] and b[2] >= b[1]:\n- ans2 = b[0]-a[0]\n break\n if cnt >= n-1:\n break\n cnt += 1\n \n print(max(ans1, ans2))\n \n", "added_lines": 11, "removed_lines": 6, "code1_lines": 36 }, { "user_id": "u466331465", "problem_id": "p02887", "submission1_id": "s827033309", "submission2_id": "s435582081", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom itertools import accumulate\ninput = sys.stdin.readline\ndef inputs():return [int(x) for x in input().split()]\nN = int(input())\nS= list(input())\ns = []\ncnt= 1\nfor i in range(len(S)-1):\n if S[i]==S[i+1]:\n cnt+=1\n else:\n s.append(cnt)\n cnt=1\ns.append(cnt)\nprint(len(s))\n\n", "code2": "import sys\nfrom itertools import accumulate\ninput = sys.stdin.readline\ndef inputs():return [int(x) for x in input().split()]\nN = int(input())\nS= list(input())\ns = []\ncnt= 1\nfor i in range(len(S)-2):\n if S[i]==S[i+1]:\n cnt+=1\n else:\n s.append(cnt)\n cnt=1\ns.append(cnt)\nprint(len(s))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571533705", "date2": "1571534238", "bleu_score": "0.9846045924651415", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n__baa\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["import sys\nfrom itertools import accumulate\ninput = sys.stdin.readline # (0): input=, inputs=\ndef inputs():return [int(x) for x in input().split()]\nN = int(input()) # (1): N=5\nS= list(input()) # (2): S=['_', '_', 'b', 'a', 'a', '\\n']\ns = [] # (3): s=[]\ncnt= 1 # (4): cnt=1\nfor i in range(len(S)-1): # (5): i=0 (8): i=1 ... (23): NO CHANGE\n if S[i]==S[i+1]: # (6): NO CHANGE (9): NO CHANGE ... (20): NO CHANGE\n cnt+=1 # (7): cnt=2 (18): cnt=2\n else:\n s.append(cnt) # (10): s=[2] (14): s=[2, 1] (21): s=[2, 1, 2]\n cnt=1 # (11): cnt=1 (15): NO CHANGE (22): cnt=1\ns.append(cnt) # (24): s=[2, 1, 2, 1]\nprint(len(s))\n\n"], "anno_status": [true], "diff_content": " import sys\n from itertools import accumulate\n input = sys.stdin.readline\n def inputs():return [int(x) for x in input().split()]\n N = int(input())\n S= list(input())\n s = []\n cnt= 1\n-for i in range(len(S)-1):\n+for i in range(len(S)-2):\n if S[i]==S[i+1]:\n cnt+=1\n else:\n s.append(cnt)\n cnt=1\n s.append(cnt)\n print(len(s))\n-\n-\n", "FL_content": " import sys\n from itertools import accumulate\n input = sys.stdin.readline\n def inputs():return [int(x) for x in input().split()]\n N = int(input())\n S= list(input())\n s = []\n cnt= 1\n-for i in range(len(S)-1):\n if S[i]==S[i+1]:\n cnt+=1\n else:\n s.append(cnt)\n cnt=1\n s.append(cnt)\n print(len(s))\n-\n-\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u333139319", "problem_id": "p02887", "submission1_id": "s322858074", "submission2_id": "s756328754", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns = input()\na = 1\nfor i in range(n-1):\n if s[i] != s[i+1]:\n a += 1", "code2": "n = int(input())\ns = input()\na = 1\nfor i in range(n-1):\n if s[i] != s[i+1]:\n a += 1\nprint(a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571543379", "date2": "1571543432", "bleu_score": "0.9047478688419959", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n_abb_\n", "actual_output": "", "expected_output": "4\n\n", "anno_code": ["n = int(input()) # (0): n=5\ns = input() # (1): s=_abb_\na = 1 # (2): a=1\nfor i in range(n-1): # (3): i=0 (6): i=1 ... (11): i=3\n if s[i] != s[i+1]: # (4): NO CHANGE (7): NO CHANGE ... (12): NO CHANGE\n a += 1 # (5): a=2 (8): a=3 (13): a=4\n"], "anno_status": [true], "diff_content": " n = int(input())\n s = input()\n a = 1\n for i in range(n-1):\n if s[i] != s[i+1]:\n a += 1\n+print(a)\n", "FL_content": " n = int(input())\n s = input()\n a = 1\n for i in range(n-1):\n if s[i] != s[i+1]:\n a += 1\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u867763103", "problem_id": "p02887", "submission1_id": "s442780225", "submission2_id": "s893585996", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve():\n N = int(input())\n S = input()\n\n ans = 1\n pre = S[0]\n for i in range(2,int(len(S))):\n if S[i] != pre:\n ans += 1\n pre = S[i]\n \n print(ans)\n\nsolve()", "code2": "def solve():\n N = int(input())\n S = input()\n\n ans = 1\n pre = S[0]\n for i in range(1,int(len(S))):\n if S[i] != pre:\n ans += 1\n pre = S[i]\n \n print(ans)\n\nsolve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571534102", "date2": "1571534218", "bleu_score": "0.9879073721675564", "code1_test_status": [1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 30, "total_score": 101, "input": "10\nacaaabaaaa\n", "actual_output": "3\n", "expected_output": "5\n\n", "anno_code": ["def solve(): # (0): solve=\n N = int(input()) # (2): N=10\n S = input() # (3): S=acaaabaaaa\n\n ans = 1 # (4): ans=1\n pre = S[0] # (5): pre=a\n for i in range(2,int(len(S))): # (6): i=2 (8): i=3 ... (26): NO CHANGE\n if S[i] != pre: # (7): NO CHANGE (9): NO CHANGE ... (25): NO CHANGE\n ans += 1 # (14): ans=2 (18): ans=3\n pre = S[i] # (15): pre=b (19): pre=a\n \n print(ans)\n\nsolve() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def solve():\n N = int(input())\n S = input()\n \n ans = 1\n pre = S[0]\n- for i in range(2,int(len(S))):\n+ for i in range(1,int(len(S))):\n if S[i] != pre:\n ans += 1\n pre = S[i]\n \n print(ans)\n \n solve()\n", "FL_content": " def solve():\n N = int(input())\n S = input()\n \n ans = 1\n pre = S[0]\n- for i in range(2,int(len(S))):\n if S[i] != pre:\n ans += 1\n pre = S[i]\n \n print(ans)\n \n solve()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u752774573", "problem_id": "p02887", "submission1_id": "s585172341", "submission2_id": "s426948630", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nS=input()\nct=0\nfor i in range(N-1):\n if S[i]!=S[i+1]:\n ct+=1\nprint(ct)", "code2": "N=int(input())\nS=input()\nct=1\nfor i in range(N-1):\n if S[i]!=S[i+1]:\n ct+=1\nprint(ct)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598415131", "date2": "1598415173", "bleu_score": "0.9601961388479883", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "20\nqlmkkkkxdeeedfezaefx\n", "actual_output": "14\n", "expected_output": "15\n\n", "anno_code": ["N=int(input()) # (0): N=20\nS=input() # (1): S=qlmkkkkxdeeedfezaefx\nct=0 # (2): ct=0\nfor i in range(N-1): # (3): i=0 (6): i=1 ... (55): NO CHANGE\n if S[i]!=S[i+1]: # (4): NO CHANGE (7): NO CHANGE ... (53): NO CHANGE\n ct+=1 # (5): ct=1 (8): ct=2 ... (54): ct=14\nprint(ct)"], "anno_status": [true], "diff_content": " N=int(input())\n S=input()\n-ct=0\n+ct=1\n for i in range(N-1):\n if S[i]!=S[i+1]:\n ct+=1\n print(ct)\n+\n", "FL_content": " N=int(input())\n S=input()\n-ct=0\n for i in range(N-1):\n if S[i]!=S[i+1]:\n ct+=1\n print(ct)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u915066452", "problem_id": "p02887", "submission1_id": "s272127715", "submission2_id": "s212760129", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nS=input()\nd=[]\nfor i in range(N):\n if i==1:\n d.append(S[i])\n elif S[i]!=S[i-1]:\n d.append(S[i])\nprint(len(d))", "code2": "N=int(input())\nS=input()\nd=[]\nfor i in range(N):\n if i==0:\n d.append(S[i])\n elif S[i]!=S[i-1]:\n d.append(S[i])\nprint(len(d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572067659", "date2": "1572067795", "bleu_score": "0.9823610456991699", "code1_test_status": [0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1], "code1_test_score": 69, "total_score": 101, "input": "10\n``bcbaaaca\n", "actual_output": "8\n", "expected_output": "7\n\n", "anno_code": ["N=int(input()) # (0): N=10\nS=input() # (1): S=``bcbaaaca\nd=[] # (2): d=[]\nfor i in range(N): # (3): i=0 (7): i=1 ... (40): NO CHANGE\n if i==1: # (4): NO CHANGE (8): NO CHANGE ... (37): NO CHANGE\n d.append(S[i]) # (9): d=['`', '`']\n elif S[i]!=S[i-1]: # (5): NO CHANGE (12): NO CHANGE ... (38): NO CHANGE\n d.append(S[i]) # (6): d=['`'] (13): d=['`', '`', 'b'] ... (39): d=['`', '`', 'b', 'c', 'b', 'a', 'c', 'a']\nprint(len(d))"], "anno_status": [true], "diff_content": " N=int(input())\n S=input()\n d=[]\n for i in range(N):\n- if i==1:\n+ if i==0:\n d.append(S[i])\n elif S[i]!=S[i-1]:\n d.append(S[i])\n print(len(d))\n", "FL_content": " N=int(input())\n S=input()\n d=[]\n for i in range(N):\n- if i==1:\n d.append(S[i])\n elif S[i]!=S[i-1]:\n d.append(S[i])\n print(len(d))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u530646758", "problem_id": "p02887", "submission1_id": "s019045363", "submission2_id": "s221923126", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = str(input())\nfusion = []\nfor i in range(N-1):\n if S[i+1] != S[i]:\n fusion +=(S[i])\nfusion +=S[N-1]\nprint(fusion)\nprint(len(fusion))", "code2": "N = int(input())\nS = str(input())\nfusion = []\nfor i in range(N-1):\n if S[i+1] != S[i]:\n fusion +=(S[i])\nfusion +=S[N-1]\n\nprint(len(fusion))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571535191", "date2": "1571535225", "bleu_score": "0.907049320392282", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "20\nwkeklzfmedendeedbkjx\n", "actual_output": "['w', 'k', 'e', 'k', 'l', 'z', 'f', 'm', 'e', 'd', 'e', 'n', 'd', 'e', 'd', 'b', 'k', 'j', 'x']\n19\n", "expected_output": "19\n\n", "anno_code": ["N = int(input()) # (0): N=20\nS = str(input()) # (1): S=wkeklzfmedendeedbkjx\nfusion = [] # (2): fusion=[]\nfor i in range(N-1): # (3): i=0 (6): i=1 ... (59): NO CHANGE\n if S[i+1] != S[i]: # (4): NO CHANGE (7): NO CHANGE ... (57): NO CHANGE\n fusion +=(S[i]) # (5): fusion=['w'] (8): fusion=['w', 'k'] ... (58): fusion=['w', 'k', 'e', 'k', 'l', 'z', 'f', 'm', 'e', 'd', 'e', 'n', 'd', 'e', 'd', 'b', 'k', 'j']\nfusion +=S[N-1] # (60): fusion=['w', 'k', 'e', 'k', 'l', 'z', 'f', 'm', 'e', 'd', 'e', 'n', 'd', 'e', 'd', 'b', 'k', 'j', 'x']\nprint(fusion) # (61): NO CHANGE\nprint(len(fusion))"], "anno_status": [true], "diff_content": " N = int(input())\n S = str(input())\n fusion = []\n for i in range(N-1):\n if S[i+1] != S[i]:\n fusion +=(S[i])\n fusion +=S[N-1]\n-print(fusion)\n+\n print(len(fusion))\n", "FL_content": " N = int(input())\n S = str(input())\n fusion = []\n for i in range(N-1):\n if S[i+1] != S[i]:\n fusion +=(S[i])\n fusion +=S[N-1]\n-print(fusion)\n print(len(fusion))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u492749916", "problem_id": "p02887", "submission1_id": "s416360263", "submission2_id": "s848225851", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = str(input())\n\nans = \"\"\nans += S[0]\n\nfor i in range(1,N-1):\n if S[i] != S[i+1]:\n ans += S[i+1]\nprint(len(ans))\n", "code2": "N = int(input())\nS = str(input())\n\nans = \"\"\nans += S[0]\n\nfor i in range(N-1):\n if S[i] != S[i+1]:\n ans += S[i+1]\nprint(len(ans))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594768623", "date2": "1594768681", "bleu_score": "0.9661833476494254", "code1_test_status": [1, 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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 0, 0, 1, 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, 1, 1, 1], "code1_test_score": 16, "total_score": 101, "input": "5\ncaaa_\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["N = int(input()) # (0): N=5\nS = str(input()) # (1): S=caaa_\n\nans = \"\" # (2): ans=\nans += S[0] # (3): ans=c\n\nfor i in range(1,N-1): # (4): i=1 (6): i=2 ... (11): NO CHANGE\n if S[i] != S[i+1]: # (5): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n ans += S[i+1] # (10): ans=c_\nprint(len(ans))\n"], "anno_status": [true], "diff_content": " N = int(input())\n S = str(input())\n \n ans = \"\"\n ans += S[0]\n \n-for i in range(1,N-1):\n+for i in range(N-1):\n if S[i] != S[i+1]:\n ans += S[i+1]\n print(len(ans))\n-\n", "FL_content": " N = int(input())\n S = str(input())\n \n ans = \"\"\n ans += S[0]\n \n-for i in range(1,N-1):\n if S[i] != S[i+1]:\n ans += S[i+1]\n print(len(ans))\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u011555727", "problem_id": "p02887", "submission1_id": "s383581698", "submission2_id": "s701692558", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=input()\nk=0\nl=set(s)\nif len(l)==1:\n print(len(l))\n exit()\nfor i in range(n-1):\n if s[i]==s[i+1]:\n k+=1\nprint(k)", "code2": "n=int(input())\ns=input()\nk=0\nl=set(s)\nk=s[0]\nans=1\nif len(l)==1:\n print(\"1\")\n exit()\nfor i in range(1,n):\n if k!=s[i]:\n ans+=1\n k=s[i]\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598850935", "date2": "1598851795", "bleu_score": "0.7114998631184148", "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, 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, 1, 1, 1], "code1_test_score": 8, "total_score": 101, "input": "20\nqlmkkkkxdeeedfezaefx\n", "actual_output": "5\n", "expected_output": "15\n\n", "anno_code": ["n=int(input()) # (0): n=20\ns=input() # (1): s=qlmkkkkxdeeedfezaefx\nk=0 # (2): k=0\nl=set(s) # (3): l={'x', 'l', 'e', 'a', 'k', 'd', 'z', 'q', 'm', 'f'}\nif len(l)==1: # (4): NO CHANGE\n print(len(l))\n exit()\nfor i in range(n-1): # (5): i=0 (7): i=1 ... (48): NO CHANGE\n if s[i]==s[i+1]: # (6): NO CHANGE (8): NO CHANGE ... (47): NO CHANGE\n k+=1 # (13): k=1 (16): k=2 ... (31): k=5\nprint(k)"], "anno_status": [true], "diff_content": " n=int(input())\n s=input()\n k=0\n l=set(s)\n+k=s[0]\n+ans=1\n if len(l)==1:\n- print(len(l))\n+ print(\"1\")\n exit()\n-for i in range(n-1):\n- if s[i]==s[i+1]:\n- k+=1\n-print(k)\n+for i in range(1,n):\n+ if k!=s[i]:\n+ ans+=1\n+ k=s[i]\n+print(ans)\n+\n", "FL_content": " n=int(input())\n s=input()\n k=0\n l=set(s)\n if len(l)==1:\n- print(len(l))\n exit()\n-for i in range(n-1):\n- if s[i]==s[i+1]:\n- k+=1\n-print(k)\n", "added_lines": 9, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u268792407", "problem_id": "p02887", "submission1_id": "s094790296", "submission2_id": "s058960071", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = list(input().split())\n \nans = 1\nfor i in range(N - 1):\n if i != i + 1:\n ans = ans + 1\nprint(ans)", "code2": "N = int(input())\nS = input()\n \nans = 1\nfor i in range(N - 1):\n if S[i] != S[i + 1]:\n ans = ans + 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571646174", "date2": "1571646352", "bleu_score": "0.8298355221226449", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 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, 1, 0, 0, 1, 0, 0, 1, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 12, "total_score": 101, "input": "20\nxekbdekdeeedmfzlkpkw\n", "actual_output": "20\n", "expected_output": "18\n\n", "anno_code": ["N = int(input()) # (0): N=20\nS = list(input().split()) # (1): S=['xekbdekdeeedmfzlkpkw']\n \nans = 1 # (2): ans=1\nfor i in range(N - 1): # (3): i=0 (6): i=1 ... (60): NO CHANGE\n if i != i + 1: # (4): NO CHANGE (7): NO CHANGE ... (58): NO CHANGE\n ans = ans + 1 # (5): ans=2 (8): ans=3 ... (59): ans=20\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n-S = list(input().split())\n+S = input()\n \n ans = 1\n for i in range(N - 1):\n- if i != i + 1:\n+ if S[i] != S[i + 1]:\n ans = ans + 1\n print(ans)\n", "FL_content": " N = int(input())\n-S = list(input().split())\n \n ans = 1\n for i in range(N - 1):\n- if i != i + 1:\n ans = ans + 1\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u185948224", "problem_id": "p02887", "submission1_id": "s904461337", "submission2_id": "s135057709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nN = int(input())\ns= list(input())\n\ns0 = s.pop()\n\ncnt = 1\n\nwhile s:\n s1 = s.pop()\n if s1!=s0:\n cnt += 1\n s0 = s1\nprint(cnt)\n", "code2": "N = int(input())\ns= list(input())\n\ns0 = s.pop()\n\ncnt = 1\n\nwhile s:\n s1 = s.pop()\n if s1!=s0:\n cnt += 1\n s0 = s1\nprint(cnt)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571534147", "date2": "1571537390", "bleu_score": "0.7613003866968737", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\naab__\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nN = int(input()) # (1): N=5\ns= list(input()) # (2): s=['a', 'a', 'b', '_', '_', '\\n']\n\ns0 = s.pop() # (3): s=['a', 'a', 'b', '_', '_'], s0= \n\ncnt = 1 # (4): cnt=1\n\nwhile s: # (5): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n s1 = s.pop() # (6): s=['a', 'a', 'b', '_'], s1=_ (11): s=['a', 'a', 'b'] ... (24): s=[]\n if s1!=s0: # (7): NO CHANGE (12): NO CHANGE ... (25): NO CHANGE\n cnt += 1 # (8): cnt=2 (16): cnt=3 (21): cnt=4\n s0 = s1 # (9): s0=_ (17): s0=b (22): s0=a\nprint(cnt)\n"], "anno_status": [true], "diff_content": "-import sys\n-input = sys.stdin.readline\n-\n N = int(input())\n s= list(input())\n \n s0 = s.pop()\n \n cnt = 1\n \n while s:\n s1 = s.pop()\n if s1!=s0:\n cnt += 1\n s0 = s1\n print(cnt)\n \n", "FL_content": "-import sys\n-input = sys.stdin.readline\n-\n N = int(input())\n s= list(input())\n \n s0 = s.pop()\n \n cnt = 1\n \n while s:\n s1 = s.pop()\n if s1!=s0:\n cnt += 1\n s0 = s1\n print(cnt)\n \n", "added_lines": 0, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u658987783", "problem_id": "p02887", "submission1_id": "s936914101", "submission2_id": "s936797709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=input()\n\ncount=0\nfor i in range(1,n-1):\n if s[i-1]==s[i]:\n count=count+1\nprint(count)", "code2": "n=int(input())\ns=input()\n\ncount=1\nfor i in range(1,n):\n if s[i-1]==s[i]:\n count=count+0\n else:\n count+=1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586654167", "date2": "1586655554", "bleu_score": "0.7903863185797271", "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, 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, 0], "code1_test_score": 6, "total_score": 101, "input": "10\nacaaabbaab\n", "actual_output": "4\n", "expected_output": "6\n\n", "anno_code": ["n=int(input()) # (0): n=10\ns=input() # (1): s=acaaabbaab\n\ncount=0 # (2): count=0\nfor i in range(1,n-1): # (3): i=1 (5): i=2 ... (23): NO CHANGE\n if s[i-1]==s[i]: # (4): NO CHANGE (6): NO CHANGE ... (21): NO CHANGE\n count=count+1 # (9): count=1 (12): count=2 ... (22): count=4\nprint(count)"], "anno_status": [true], "diff_content": " n=int(input())\n s=input()\n \n-count=0\n-for i in range(1,n-1):\n+count=1\n+for i in range(1,n):\n if s[i-1]==s[i]:\n- count=count+1\n+ count=count+0\n+ else:\n+ count+=1\n print(count)\n", "FL_content": " n=int(input())\n s=input()\n \n-count=0\n-for i in range(1,n-1):\n if s[i-1]==s[i]:\n- count=count+1\n print(count)\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u183256664", "problem_id": "p02887", "submission1_id": "s827332777", "submission2_id": "s707133056", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = input()\ntmp = ''\ncount = 0\nfor s in S:\n if s == tmp:\n count += 1\n tmp = s\nprint(count)", "code2": "N = int(input())\nS = input()\ntmp = ''\ncount = 0\nfor s in S:\n if s != tmp:\n count += 1\n tmp = s\nprint(count)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571534163", "date2": "1571534232", "bleu_score": "0.978764609552155", "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, 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, 1, 1, 0], "code1_test_score": 7, "total_score": 101, "input": "20\nmlqkkzkxdeeedfekaefx\n", "actual_output": "3\n", "expected_output": "17\n\n", "anno_code": ["N = int(input()) # (0): N=20\nS = input() # (1): S=mlqkkzkxdeeedfekaefx\ntmp = '' # (2): tmp=\ncount = 0 # (3): count=0\nfor s in S: # (4): s=m (7): s=l ... (67): NO CHANGE\n if s == tmp: # (5): NO CHANGE (8): NO CHANGE ... (65): NO CHANGE\n count += 1 # (18): count=1 (37): count=2 (41): count=3\n tmp = s # (6): tmp=m (9): tmp=l ... (66): tmp=x\nprint(count)"], "anno_status": [true], "diff_content": " N = int(input())\n S = input()\n tmp = ''\n count = 0\n for s in S:\n- if s == tmp:\n+ if s != tmp:\n count += 1\n tmp = s\n print(count)\n", "FL_content": " N = int(input())\n S = input()\n tmp = ''\n count = 0\n for s in S:\n- if s == tmp:\n count += 1\n tmp = s\n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u923270446", "problem_id": "p02887", "submission1_id": "s357190975", "submission2_id": "s476311010", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns = input()\ncur = s[0]\nl = []\nfor i in range(n - 1):\n if cur != s[i + 1]:\n l.append(cur)\nprint(len(l))", "code2": "n = int(input())\ns = input()\ncur = s[0]\nl = []\nfor i in range(n - 1):\n if cur != s[i + 1]:\n l.append(cur)\n cur = s[i + 1]\nl.append(cur)\nprint(len(l))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591125443", "date2": "1591125546", "bleu_score": "0.7750640892052529", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 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], "code1_test_score": 20, "total_score": 101, "input": "10\nacaa`baaaa\n", "actual_output": "3\n", "expected_output": "6\n\n", "anno_code": ["n = int(input()) # (0): n=10\ns = input() # (1): s=acaa`baaaa\ncur = s[0] # (2): cur=a\nl = [] # (3): l=[]\nfor i in range(n - 1): # (4): i=0 (7): i=1 ... (25): NO CHANGE\n if cur != s[i + 1]: # (5): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n l.append(cur) # (6): l=['a'] (13): l=['a', 'a'] (16): l=['a', 'a', 'a']\nprint(len(l))"], "anno_status": [true], "diff_content": " n = int(input())\n s = input()\n cur = s[0]\n l = []\n for i in range(n - 1):\n if cur != s[i + 1]:\n l.append(cur)\n+ cur = s[i + 1]\n+l.append(cur)\n print(len(l))\n", "FL_content": " n = int(input())\n s = input()\n cur = s[0]\n l = []\n for i in range(n - 1):\n if cur != s[i + 1]:\n l.append(cur)\n print(len(l))\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u036531287", "problem_id": "p02887", "submission1_id": "s143467708", "submission2_id": "s623897284", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input().split()[0])\nb = list(map(str, input().split()[0]))\nk = 0\ns = 1\n\n\nwhile k\nfrom itertools import combinations\nans=0 # (2): ans=0\ncomb=combinations(D,2) # (3): comb=\nfor c in comb: # (4): c=(0, -1) (6): c=(0, 54) ... (46): NO CHANGE\n ans+=c[0]+c[1] # (5): ans=-1 (7): ans=53 ... (45): ans=414\nprint(ans)"], "anno_status": [true], "diff_content": " N=int(input())\n D=list(map(int,input().split()))\n from itertools import combinations\n+comb=combinations(D, 2)\n ans=0\n-comb=combinations(D,2)\n for c in comb:\n- ans+=c[0]+c[1]\n+ ans+=c[0]*c[1]\n print(ans)\n", "FL_content": " N=int(input())\n D=list(map(int,input().split()))\n from itertools import combinations\n ans=0\n-comb=combinations(D,2)\n for c in comb:\n- ans+=c[0]+c[1]\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u106311097", "problem_id": "p02886", "submission1_id": "s383080756", "submission2_id": "s978346306", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\nfrom itertools import product\n\ns2nn = lambda s: [int(c) for c in s.split(' ')]\nss2nn = lambda ss: [int(s) for s in list(ss)]\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [i2s() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\ndef main():\n N = i2n()\n d = i2nn()\n r = 0\n for i, j in product(range(N), range(N)):\n r += d[i] * d[j] if i == j else 0\n print(r)\nmain()\n", "code2": "\n\nimport sys\nfrom itertools import combinations\n\ns2nn = lambda s: [int(c) for c in s.split(' ')]\nss2nn = lambda ss: [int(s) for s in list(ss)]\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [i2s() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\ndef main():\n N = i2n()\n d = i2nn()\n print(sum(a*b for a, b in combinations(d, 2)))\nmain()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571533568", "date2": "1571533899", "bleu_score": "0.8240948955451961", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n-1 -1 395 -2 0 10 9\n", "actual_output": "156212\n", "expected_output": "5944\n\n", "anno_code": ["\n\nimport sys\nfrom itertools import product\n\ns2nn = lambda s: [int(c) for c in s.split(' ')] # (0): s2nn= at 0x00000182FFA89BD0>\nss2nn = lambda ss: [int(s) for s in list(ss)] # (1): ss2nn= at 0x00000182FFA89B40>\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)] # (2): ss2nnn= at 0x00000182FFA89C60>\ni2s = lambda: sys.stdin.readline().rstrip() # (3): i2s= at 0x00000182FFA89CF0>\ni2n = lambda: int(i2s()) # (4): i2n= at 0x00000182FFA89D80>\ni2nn = lambda: s2nn(i2s()) # (5): i2nn= at 0x00000182FFA89E10>\nii2ss = lambda n: [i2s() for _ in range(n)] # (6): ii2ss= at 0x00000182FFA89EA0>\nii2nn = lambda n: ss2nn(ii2ss(n)) # (7): ii2nn= at 0x00000182FFA89F30>\nii2nnn = lambda n: ss2nnn(ii2ss(n)) # (8): ii2nnn= at 0x00000182FFA89FC0>\n\ndef main(): # (9): main=\n N = i2n() # (11): N=7\n d = i2nn() # (12): d=[-1, -1, 395, -2, 0, 10, 9]\n r = 0 # (13): r=0\n for i, j in product(range(N), range(N)): # (14): i=0, j=0 (16): j=1 ... (112): NO CHANGE\n r += d[i] * d[j] if i == j else 0 # (15): r=1 (17): NO CHANGE ... (111): r=156212\n print(r)\nmain() # (10): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n import sys\n-from itertools import product\n+from itertools import combinations\n \n s2nn = lambda s: [int(c) for c in s.split(' ')]\n ss2nn = lambda ss: [int(s) for s in list(ss)]\n ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\n i2s = lambda: sys.stdin.readline().rstrip()\n i2n = lambda: int(i2s())\n i2nn = lambda: s2nn(i2s())\n ii2ss = lambda n: [i2s() for _ in range(n)]\n ii2nn = lambda n: ss2nn(ii2ss(n))\n ii2nnn = lambda n: ss2nnn(ii2ss(n))\n \n def main():\n N = i2n()\n d = i2nn()\n- r = 0\n- for i, j in product(range(N), range(N)):\n- r += d[i] * d[j] if i == j else 0\n- print(r)\n+ print(sum(a*b for a, b in combinations(d, 2)))\n main()\n \n", "FL_content": " \n \n import sys\n-from itertools import product\n \n s2nn = lambda s: [int(c) for c in s.split(' ')]\n ss2nn = lambda ss: [int(s) for s in list(ss)]\n ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\n i2s = lambda: sys.stdin.readline().rstrip()\n i2n = lambda: int(i2s())\n i2nn = lambda: s2nn(i2s())\n ii2ss = lambda n: [i2s() for _ in range(n)]\n ii2nn = lambda n: ss2nn(ii2ss(n))\n ii2nnn = lambda n: ss2nnn(ii2ss(n))\n \n def main():\n N = i2n()\n d = i2nn()\n- r = 0\n- for i, j in product(range(N), range(N)):\n- r += d[i] * d[j] if i == j else 0\n- print(r)\n main()\n \n", "added_lines": 2, "removed_lines": 5, "code1_lines": 24 }, { "user_id": "u533713111", "problem_id": "p02886", "submission1_id": "s812498382", "submission2_id": "s374616416", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nd=list(map(int, input().split()))\na=(sum(d))**2\n\ndef square(list):\n return [i ** 2 for i in list]\n\nb=sum(square(d))\nresult=(a-b)/2\nprint(result)", "code2": "N=int(input())\nd=list(map(int, input().split()))\na=(sum(d))**2\n\ndef square(list):\n return [i ** 2 for i in list]\n\nb=sum(square(d))\nresult=(a-b)/2\nprint(int(result))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571535385", "date2": "1571535478", "bleu_score": "0.9697871193028889", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n-1 -1 395 -2 0 10 9\n", "actual_output": "5944.0\n", "expected_output": "5944\n\n", "anno_code": ["N=int(input()) # (0): N=7\nd=list(map(int, input().split())) # (1): d=[-1, -1, 395, -2, 0, 10, 9]\na=(sum(d))**2 # (2): a=168100\n\ndef square(list): # (3): square=\n return [i ** 2 for i in list]\n\nb=sum(square(d)) # (4): b=156212\nresult=(a-b)/2 # (5): result=5944.0\nprint(result)"], "anno_status": [true], "diff_content": " N=int(input())\n d=list(map(int, input().split()))\n a=(sum(d))**2\n \n def square(list):\n return [i ** 2 for i in list]\n \n b=sum(square(d))\n result=(a-b)/2\n-print(result)\n+print(int(result))\n", "FL_content": " N=int(input())\n d=list(map(int, input().split()))\n a=(sum(d))**2\n \n def square(list):\n return [i ** 2 for i in list]\n \n b=sum(square(d))\n result=(a-b)/2\n-print(result)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u766783496", "problem_id": "p02886", "submission1_id": "s121331508", "submission2_id": "s820466971", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\nx = input()\ny = list(map(int,input().split()))\n\nresult = 0\nfor i, j in enumerate(y):\n if i == (len(y) - 1):\n break\n array = copy.deepcopy(y)\n b = array.pop(i)\n a_sum = sum(array)\n result = result + b * len(y) + a_sum\n\nprint(result)\n", "code2": "import copy\nx = int(input())\ny = list(map(int,input().split()))\n\nresult = 0\nfor (i, v) in enumerate(y):\n z = copy.deepcopy(y)\n c = copy.deepcopy(x) - 1 - i\n r = 0\n for j in range(c):\n r = r + z.pop()\n result = result + r * v\n\nprint(result)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571987259", "date2": "1571988877", "bleu_score": "0.6770511517572276", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 1, "total_score": 87, "input": "7\n0 -1 105 1 3 5 8\n", "actual_output": "1404\n", "expected_output": "1758\n\n", "anno_code": ["import copy\nx = input() # (0): x=7\ny = list(map(int,input().split())) # (1): y=[0, -1, 105, 1, 3, 5, 8]\n\nresult = 0 # (2): result=0\nfor i, j in enumerate(y): # (3): i=0, j=0 (9): i=1, j=-1 ... (39): i=6, j=8\n if i == (len(y) - 1): # (4): NO CHANGE (10): NO CHANGE ... (40): NO CHANGE\n break # (41): NO CHANGE\n array = copy.deepcopy(y) # (5): array=[0, -1, 105, 1, 3, 5, 8] (11): array=[0, -1, 105, 1, 3, 5, 8] ... (35): array=[0, -1, 105, 1, 3, 5, 8]\n b = array.pop(i) # (6): array=[-1, 105, 1, 3, 5, 8], b=0 (12): array=[0, 105, 1, 3, 5, 8], b=-1 ... (36): array=[0, -1, 105, 1, 3, 8], b=5\n a_sum = sum(array) # (7): a_sum=121 (13): a_sum=122 ... (37): a_sum=116\n result = result + b * len(y) + a_sum # (8): result=121 (14): result=236 ... (38): result=1404\n\nprint(result)\n"], "anno_status": [true], "diff_content": " import copy\n-x = input()\n+x = int(input())\n y = list(map(int,input().split()))\n \n result = 0\n-for i, j in enumerate(y):\n- if i == (len(y) - 1):\n- break\n- array = copy.deepcopy(y)\n- b = array.pop(i)\n- a_sum = sum(array)\n- result = result + b * len(y) + a_sum\n+for (i, v) in enumerate(y):\n+ z = copy.deepcopy(y)\n+ c = copy.deepcopy(x) - 1 - i\n+ r = 0\n+ for j in range(c):\n+ r = r + z.pop()\n+ result = result + r * v\n \n print(result)\n \n+\n", "FL_content": " import copy\n-x = input()\n y = list(map(int,input().split()))\n \n result = 0\n-for i, j in enumerate(y):\n- if i == (len(y) - 1):\n- break\n- array = copy.deepcopy(y)\n- b = array.pop(i)\n- a_sum = sum(array)\n- result = result + b * len(y) + a_sum\n \n print(result)\n \n", "added_lines": 9, "removed_lines": 8, "code1_lines": 15 }, { "user_id": "u725359833", "problem_id": "p02886", "submission1_id": "s407130933", "submission2_id": "s622830015", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nd=map(int,input().split(\" \"))\nwa=[]\nfor i in range(1,n+1):\n for j in range(i,n+1):\n wa.append(i*j)\nprint(sum(wa))\n", "code2": "n=int(input())\nd=list(map(int,input().split(\" \")))\nwa=[]\nfor i in range(0,n):\n for j in range(i+1,n):\n wa.append(d[i]*d[j])\n\nprint(sum(wa))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587605259", "date2": "1587605724", "bleu_score": "0.8131809074372477", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n0 -1 281 -2 1 6 9\n", "actual_output": "462\n", "expected_output": "3676\n\n", "anno_code": ["n=int(input()) # (0): n=7\nd=map(int,input().split(\" \")) # (1): d=\nwa=[] # (2): wa=[]\nfor i in range(1,n+1): # (3): i=1 (19): i=2 ... (73): NO CHANGE\n for j in range(i,n+1): # (4): j=1 (6): j=2 ... (72): NO CHANGE\n wa.append(i*j) # (5): wa=[1] (7): wa=[1, 2] ... (71): wa=[1, 2, ..., 42, 49]\nprint(sum(wa))\n"], "anno_status": [true], "diff_content": " n=int(input())\n-d=map(int,input().split(\" \"))\n+d=list(map(int,input().split(\" \")))\n wa=[]\n-for i in range(1,n+1):\n- for j in range(i,n+1):\n- wa.append(i*j)\n-print(sum(wa))\n+for i in range(0,n):\n+ for j in range(i+1,n):\n+ wa.append(d[i]*d[j])\n \n+print(sum(wa))\n", "FL_content": " n=int(input())\n-d=map(int,input().split(\" \"))\n wa=[]\n-for i in range(1,n+1):\n- for j in range(i,n+1):\n- wa.append(i*j)\n-print(sum(wa))\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 8 }, { "user_id": "u840988663", "problem_id": "p02886", "submission1_id": "s504259615", "submission2_id": "s402533444", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nd=map(int,input().split())\nd=list(d)\nkotae=0\nfor i in range(n):\n for j in range(n-i-1):\n kotae=kotae+d[i]*d[j]\nprint(kotae)", "code2": "n=int(input())\nd=list(map(int,input().split()))\n\nkotae=0\nfor i in range(n):\n for j in range(i+1,n):\n kotae=kotae+d[i]*d[j]\nprint(kotae)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577820799", "date2": "1581796654", "bleu_score": "0.910015868350903", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "3\n0 -4 -17\n", "actual_output": "0\n", "expected_output": "68\n\n", "anno_code": ["n=int(input()) # (0): n=3\nd=map(int,input().split()) # (1): d=\nd=list(d) # (2): d=[0, -4, -17]\nkotae=0 # (3): kotae=0\nfor i in range(n): # (4): i=0 (10): i=1 ... (16): NO CHANGE\n for j in range(n-i-1): # (5): j=0 (7): j=1 ... (15): NO CHANGE\n kotae=kotae+d[i]*d[j] # (6): NO CHANGE (8): NO CHANGE (12): NO CHANGE\nprint(kotae)"], "anno_status": [true], "diff_content": " n=int(input())\n-d=map(int,input().split())\n-d=list(d)\n+d=list(map(int,input().split()))\n+\n kotae=0\n for i in range(n):\n- for j in range(n-i-1):\n+ for j in range(i+1,n):\n kotae=kotae+d[i]*d[j]\n print(kotae)\n+\n", "FL_content": " n=int(input())\n-d=map(int,input().split())\n-d=list(d)\n kotae=0\n for i in range(n):\n- for j in range(n-i-1):\n kotae=kotae+d[i]*d[j]\n print(kotae)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u470542271", "problem_id": "p02886", "submission1_id": "s623286367", "submission2_id": "s351352708", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input(int())\nd = list(map(int, input().split()))\n\nans = 0\nfor i in range(len(d)):\n for j in range(i+1, len(d)):\n ans += d[i] * d[j]\n\nprint(ans)\n", "code2": "n = int(input())\nd = list(map(int, input().split()))\n\nans = 0\nfor i in range(len(d)):\n for j in range(i+1, len(d)):\n ans += d[i] * d[j]\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571535532", "date2": "1571535631", "bleu_score": "0.9934849952472267", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n0 -1 50 0 3 5 8\n", "actual_output": "0813\n", "expected_output": "813\n\n", "anno_code": ["n = input(int()) # (0): n=7\nd = list(map(int, input().split())) # (1): d=[0, -1, 50, 0, 3, 5, 8]\n\nans = 0 # (2): ans=0\nfor i in range(len(d)): # (3): i=0 (17): i=1 ... (59): NO CHANGE\n for j in range(i+1, len(d)): # (4): j=1 (6): j=2 ... (58): NO CHANGE\n ans += d[i] * d[j] # (5): NO CHANGE (7): NO CHANGE ... (55): ans=813\n\nprint(ans)\n"], "anno_status": [true], "diff_content": "-n = input(int())\n+n = int(input())\n d = list(map(int, input().split()))\n \n ans = 0\n for i in range(len(d)):\n for j in range(i+1, len(d)):\n ans += d[i] * d[j]\n \n print(ans)\n \n", "FL_content": "-n = input(int())\n d = list(map(int, input().split()))\n \n ans = 0\n for i in range(len(d)):\n for j in range(i+1, len(d)):\n ans += d[i] * d[j]\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u453815934", "problem_id": "p02886", "submission1_id": "s364858162", "submission2_id": "s758906039", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nimport sys\nfrom collections import deque\nimport heapq\nimport copy\nimport itertools\nfrom itertools import permutations\ndef mi() : return map(int,sys.stdin.readline().split())\ndef ii() : return int(sys.stdin.readline().rstrip())\ndef i() : return sys.stdin.readline().rstrip()\na=ii()\nl=list(mi())\ns=0\nt=0\nfor i in l:\n s+=i\n t+=i**2\nprint(s**2-t)", "code2": "import math\nimport sys\nfrom collections import deque\nimport heapq\nimport copy\nimport itertools\nfrom itertools import permutations\ndef mi() : return map(int,sys.stdin.readline().split())\ndef ii() : return int(sys.stdin.readline().rstrip())\ndef i() : return sys.stdin.readline().rstrip()\na=ii()\nl=list(mi())\ns=0\nt=0\nfor i in l:\n s+=i\n t+=i**2\nprint(int((s**2-t)/2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592422181", "date2": "1592422662", "bleu_score": "0.9731676916850137", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n0 0 68 -3 0 5 13\n", "actual_output": "2062\n", "expected_output": "1031\n\n", "anno_code": ["import math\nimport sys\nfrom collections import deque\nimport heapq\nimport copy\nimport itertools\nfrom itertools import permutations\ndef mi() : return map(int,sys.stdin.readline().split())\ndef ii() : return int(sys.stdin.readline().rstrip())\ndef i() : return sys.stdin.readline().rstrip()\na=ii() # (0): a=7\nl=list(mi()) # (1): l=[0, 0, 68, -3, 0, 5, 13]\ns=0 # (2): s=0\nt=0 # (3): t=0\nfor i in l: # (4): i=0 (7): NO CHANGE ... (25): NO CHANGE\n s+=i # (5): NO CHANGE (8): NO CHANGE ... (23): s=83\n t+=i**2 # (6): NO CHANGE (9): NO CHANGE ... (24): t=4827\nprint(s**2-t)"], "anno_status": [true], "diff_content": " import math\n import sys\n from collections import deque\n import heapq\n import copy\n import itertools\n from itertools import permutations\n def mi() : return map(int,sys.stdin.readline().split())\n def ii() : return int(sys.stdin.readline().rstrip())\n def i() : return sys.stdin.readline().rstrip()\n a=ii()\n l=list(mi())\n s=0\n t=0\n for i in l:\n s+=i\n t+=i**2\n-print(s**2-t)\n+print(int((s**2-t)/2))\n", "FL_content": " import math\n import sys\n from collections import deque\n import heapq\n import copy\n import itertools\n from itertools import permutations\n def mi() : return map(int,sys.stdin.readline().split())\n def ii() : return int(sys.stdin.readline().rstrip())\n def i() : return sys.stdin.readline().rstrip()\n a=ii()\n l=list(mi())\n s=0\n t=0\n for i in l:\n s+=i\n t+=i**2\n-print(s**2-t)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u168416324", "problem_id": "p02886", "submission1_id": "s957060167", "submission2_id": "s311499695", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ans=0\nn=int(input())\nli=list(map(int,input().split()))\nfor i in li:\n for j in li:\n if i==j:\n break\n ans+=i*j\nprint(ans)\n", "code2": "ans=0\nn=int(input())\nli=list(map(int,input().split()))\nfor i in range(len(li)):\n for j in range(len(li)):\n if i==j:\n break\n ans+=li[i]*li[j]\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595023383", "date2": "1595027562", "bleu_score": "0.7448910414806306", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 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, 1, 1, 0], "code1_test_score": 60, "total_score": 87, "input": "7\n-1 -1 281 -2 0 6 9\n", "actual_output": "3089\n", "expected_output": "3090\n\n", "anno_code": ["ans=0 # (0): ans=0\nn=int(input()) # (1): n=7\nli=list(map(int,input().split())) # (2): li=[-1, -1, 281, -2, 0, 6, 9]\nfor i in li: # (3): i=-1 (7): NO CHANGE ... (91): NO CHANGE\n for j in li: # (4): j=-1 (8): NO CHANGE ... (88): j=9\n if i==j: # (5): NO CHANGE (9): NO CHANGE ... (89): NO CHANGE\n break # (6): NO CHANGE (10): NO CHANGE ... (90): NO CHANGE\n ans+=i*j # (14): ans=-281 (17): ans=-562 ... (87): ans=3089\nprint(ans)\n"], "anno_status": [true], "diff_content": " ans=0\n n=int(input())\n li=list(map(int,input().split()))\n-for i in li:\n- for j in li:\n+for i in range(len(li)):\n+ for j in range(len(li)):\n if i==j:\n break\n- ans+=i*j\n+ ans+=li[i]*li[j]\n print(ans)\n \n", "FL_content": " ans=0\n n=int(input())\n li=list(map(int,input().split()))\n-for i in li:\n- for j in li:\n if i==j:\n break\n- ans+=i*j\n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u663710122", "problem_id": "p02886", "submission1_id": "s679041750", "submission2_id": "s460398229", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nD = list(map(int, input().split()))\n\nret = 0\n\nfor i in range(N):\n for j in range(N):\n if i == j:\n continue\n \n ret += D[i] * D[j]\n \nprint(ret)", "code2": "N = int(input())\nD = list(map(int, input().split()))\n\nret = 0\n\nfor i in range(N):\n for j in range(i+1, N):\n if i == j:\n continue\n\n ret += D[i] * D[j]\n\nprint(ret)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576451551", "date2": "1576451574", "bleu_score": "0.8966054772568552", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n1 -1 7 2 23 3 2\n", "actual_output": "772\n", "expected_output": "386\n\n", "anno_code": ["N = int(input()) # (0): N=7\nD = list(map(int, input().split())) # (1): D=[1, -1, 7, 2, 23, 3, 2]\n\nret = 0 # (2): ret=0\n\nfor i in range(N): # (3): i=0 (26): i=1 ... (164): NO CHANGE\n for j in range(N): # (4): j=0 (7): j=1 ... (163): NO CHANGE\n if i == j: # (5): NO CHANGE (8): NO CHANGE ... (161): NO CHANGE\n continue # (6): NO CHANGE (32): NO CHANGE ... (162): NO CHANGE\n \n ret += D[i] * D[j] # (9): ret=-1 (12): ret=6 ... (159): ret=772\n \nprint(ret)"], "anno_status": [true], "diff_content": " N = int(input())\n D = list(map(int, input().split()))\n \n ret = 0\n \n for i in range(N):\n- for j in range(N):\n+ for j in range(i+1, N):\n if i == j:\n continue\n- \n+\n ret += D[i] * D[j]\n- \n+\n print(ret)\n", "FL_content": " N = int(input())\n D = list(map(int, input().split()))\n \n ret = 0\n \n for i in range(N):\n- for j in range(N):\n if i == j:\n continue\n- \n ret += D[i] * D[j]\n- \n print(ret)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u368074441", "problem_id": "p02886", "submission1_id": "s401839933", "submission2_id": "s116886476", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nd = list(map(int, input().split()))\n\nprint(n)\ni = 0\nj = 0\np = 0\n\nwhile i < n - 1:\n while j < n - 1:\n p += d[i] * d[j + 1]\n j = j + 1 \n i = i + 1\n j = i\nprint(p)", "code2": "n = int(input())\nd = list(map(int, input().split()))\n\ni = 0\nj = 0\np = 0\n\nwhile i < n - 1:\n while j < n - 1:\n p += d[i] * d[j + 1]\n j = j + 1 \n i = i + 1\n j = i\nprint(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572114350", "date2": "1572114400", "bleu_score": "0.9501641648752667", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n0 -1 54 1 3 8 4\n", "actual_output": "7\n877\n", "expected_output": "877\n\n", "anno_code": ["n = int(input()) # (0): n=7\nd = list(map(int, input().split())) # (1): d=[0, -1, 54, 1, 3, 8, 4]\n\nprint(n) # (2): NO CHANGE\ni = 0 # (3): i=0\nj = 0 # (4): j=0\np = 0 # (5): p=0\n\nwhile i < n - 1: # (6): NO CHANGE (28): NO CHANGE ... (93): NO CHANGE\n while j < n - 1: # (7): NO CHANGE (10): NO CHANGE ... (90): NO CHANGE\n p += d[i] * d[j + 1] # (8): NO CHANGE (11): NO CHANGE ... (88): p=877\n j = j + 1 # (9): j=1 (12): j=2 ... (89): j=6\n i = i + 1 # (26): i=1 (45): i=2 ... (91): i=6\n j = i # (27): j=1 (46): j=2 ... (92): NO CHANGE\nprint(p)"], "anno_status": [true], "diff_content": " n = int(input())\n d = list(map(int, input().split()))\n \n-print(n)\n i = 0\n j = 0\n p = 0\n \n while i < n - 1:\n while j < n - 1:\n p += d[i] * d[j + 1]\n j = j + 1 \n i = i + 1\n j = i\n print(p)\n", "FL_content": " n = int(input())\n d = list(map(int, input().split()))\n \n-print(n)\n i = 0\n j = 0\n p = 0\n \n while i < n - 1:\n while j < n - 1:\n p += d[i] * d[j + 1]\n j = j + 1 \n i = i + 1\n j = i\n print(p)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u633450100", "problem_id": "p02886", "submission1_id": "s113352882", "submission2_id": "s732381434", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nd = [int(i) for i in input().split()]\nsum = 0\n\nfor i in range(N):\n for j in range(N):\n if i != j:\n sum += d[i] * d[j]\n\nprint(sum)", "code2": "N = int(input())\nd = [int(i) for i in input().split()]\nsum = 0\n\nfor i in range(N):\n for j in range(N):\n if i != j:\n sum += d[i] * d[j]\n\nprint(int(sum/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572445491", "date2": "1572445733", "bleu_score": "0.9457988827282768", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n5 0 7 8 6 3 2\n", "actual_output": "774\n", "expected_output": "387\n\n", "anno_code": ["N = int(input()) # (0): N=7\nd = [int(i) for i in input().split()] # (1): d=[5, 0, 7, 8, 6, 3, 2]\nsum = 0 # (2): sum=0\n\nfor i in range(N): # (3): i=0 (25): i=1 ... (157): NO CHANGE\n for j in range(N): # (4): j=0 (6): j=1 ... (156): NO CHANGE\n if i != j: # (5): NO CHANGE (7): NO CHANGE ... (155): NO CHANGE\n sum += d[i] * d[j] # (8): NO CHANGE (11): sum=35 ... (153): sum=774\n\nprint(sum)"], "anno_status": [true], "diff_content": " N = int(input())\n d = [int(i) for i in input().split()]\n sum = 0\n \n for i in range(N):\n for j in range(N):\n if i != j:\n sum += d[i] * d[j]\n \n-print(sum)\n+print(int(sum/2))\n+\n", "FL_content": " N = int(input())\n d = [int(i) for i in input().split()]\n sum = 0\n \n for i in range(N):\n for j in range(N):\n if i != j:\n sum += d[i] * d[j]\n \n-print(sum)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u438160186", "problem_id": "p02886", "submission1_id": "s904315782", "submission2_id": "s126568413", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nd = [int(i) for i in input().split()]\ns = n * (n-1)\n\nans = 0\nfor i in range(n):\n for j in range(s):\n if j < n:\n ans += d[i] * d[j]\n\nprint(ans)", "code2": "n = int(input())\nd = [int(i) for i in input().split()]\ns = n * (n-1)\n\nans = 0\nfor i in range(n):\n for j in range(s):\n if j < i:\n ans += d[i] * d[j]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572209346", "date2": "1572209410", "bleu_score": "0.9852711397709147", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n-2 0 165 -4 -1 5 12\n", "actual_output": "30625\n", "expected_output": "1605\n\n", "anno_code": ["n = int(input()) # (0): n=7\nd = [int(i) for i in input().split()] # (1): d=[-2, 0, 165, -4, -1, 5, 12]\ns = n * (n-1) # (2): s=42\n\nans = 0 # (3): ans=0\nfor i in range(n): # (4): i=0 (97): i=1 ... (655): NO CHANGE\n for j in range(s): # (5): j=0 (8): j=1 ... (654): NO CHANGE\n if j < n: # (6): NO CHANGE (9): NO CHANGE ... (653): NO CHANGE\n ans += d[i] * d[j] # (7): ans=4 (10): NO CHANGE ... (583): ans=30625\n\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n d = [int(i) for i in input().split()]\n s = n * (n-1)\n \n ans = 0\n for i in range(n):\n for j in range(s):\n- if j < n:\n+ if j < i:\n ans += d[i] * d[j]\n \n print(ans)\n", "FL_content": " n = int(input())\n d = [int(i) for i in input().split()]\n s = n * (n-1)\n \n ans = 0\n for i in range(n):\n for j in range(s):\n- if j < n:\n ans += d[i] * d[j]\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u424967964", "problem_id": "p02886", "submission1_id": "s305353885", "submission2_id": "s495308323", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = [int(i) for i in input().split()]\nans = 0\nfor i in range(a):\n ans += b[i]*(sum(b)-b[i])\nprint(ans)", "code2": "a = int(input())\nb = [int(i) for i in input().split()]\nans = 0\nfor i in range(a):\n ans += b[i]*(sum(b)-b[i])\nprint(ans", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571796057", "date2": "1571796206", "bleu_score": "0.9916318482011999", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n-1 0 395 -2 0 10 9\n", "actual_output": "12710\n", "expected_output": "6355\n\n", "anno_code": ["a = int(input()) # (0): a=7\nb = [int(i) for i in input().split()] # (1): b=[-1, 0, 395, -2, 0, 10, 9]\nans = 0 # (2): ans=0\nfor i in range(a): # (3): i=0 (5): i=1 ... (17): NO CHANGE\n ans += b[i]*(sum(b)-b[i]) # (4): ans=-412 (6): NO CHANGE ... (16): ans=12710\nprint(ans)"], "anno_status": [true], "diff_content": " a = int(input())\n b = [int(i) for i in input().split()]\n ans = 0\n for i in range(a):\n ans += b[i]*(sum(b)-b[i])\n-print(ans)\n+print(ans\n", "FL_content": " a = int(input())\n b = [int(i) for i in input().split()]\n ans = 0\n for i in range(a):\n ans += b[i]*(sum(b)-b[i])\n-print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u370721525", "problem_id": "p02886", "submission1_id": "s464995952", "submission2_id": "s076548275", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nD = list(map(int, input().split()))\n\nsum_all = 0\nfor i in range(N):\n for s in range(i, N):\n sum_all += D[i] * D[s]\n \nprint(sum_all)", "code2": "N = int(input())\nD = list(map(int, input().split()))\n\nsum_all = 0\nfor i in range(N):\n for s in range(i+1, N):\n sum_all += D[i] * D[s]\n \nprint(sum_all)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582491439", "date2": "1582491618", "bleu_score": "0.9774114419330406", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n0 -1 136 1 5 5 8\n", "actual_output": "21164\n", "expected_output": "2552\n\n", "anno_code": ["N = int(input()) # (0): N=7\nD = list(map(int, input().split())) # (1): D=[0, -1, 136, 1, 5, 5, 8]\n\nsum_all = 0 # (2): sum_all=0\nfor i in range(N): # (3): i=0 (19): i=1 ... (73): NO CHANGE\n for s in range(i, N): # (4): s=0 (6): s=1 ... (72): NO CHANGE\n sum_all += D[i] * D[s] # (5): NO CHANGE (7): NO CHANGE ... (71): sum_all=21164\n \nprint(sum_all)"], "anno_status": [true], "diff_content": " N = int(input())\n D = list(map(int, input().split()))\n \n sum_all = 0\n for i in range(N):\n- for s in range(i, N):\n+ for s in range(i+1, N):\n sum_all += D[i] * D[s]\n \n print(sum_all)\n", "FL_content": " N = int(input())\n D = list(map(int, input().split()))\n \n sum_all = 0\n for i in range(N):\n- for s in range(i, N):\n sum_all += D[i] * D[s]\n \n print(sum_all)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u365013885", "problem_id": "p02886", "submission1_id": "s433917335", "submission2_id": "s182405092", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split())) \nX = 0\nfor a in range(1,N+1):\n if a < N:\n X += A[a]*(sum(A[(a+1):(N+1)]))\nprint(X)", "code2": "N = int(input())\nA = list(map(int, input().split())) \nX = 0\nfor a in range(N):\n if a+1 < N:\n x = A[a]\n y = sum(A[(a+1):(N+1)])\n X += x*y\n\nprint(X)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571537687", "date2": "1571538225", "bleu_score": "0.7747077594278972", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 37, "total_score": 87, "input": "3\n1 -12 -11\n", "actual_output": "132\n", "expected_output": "109\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[1, -12, -11]\nX = 0 # (2): X=0\nfor a in range(1,N+1): # (3): a=1 (6): a=2 ... (11): NO CHANGE\n if a < N: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n X += A[a]*(sum(A[(a+1):(N+1)])) # (5): X=132 (8): NO CHANGE\nprint(X)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split())) \n X = 0\n-for a in range(1,N+1):\n- if a < N:\n- X += A[a]*(sum(A[(a+1):(N+1)]))\n+for a in range(N):\n+ if a+1 < N:\n+ x = A[a]\n+ y = sum(A[(a+1):(N+1)])\n+ X += x*y\n+\n print(X)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split())) \n X = 0\n-for a in range(1,N+1):\n- if a < N:\n- X += A[a]*(sum(A[(a+1):(N+1)]))\n print(X)\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u854175276", "problem_id": "p02886", "submission1_id": "s348742076", "submission2_id": "s798574608", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nd = list(map(int, input().split()))\nans = 0\nfor i in range(n - 1):\n for j in range(i + 1, n):\n print(i, j)\n ans += d[i] * d[j]\nprint(ans)\n ", "code2": "n = int(input())\nd = list(map(int, input().split()))\nans = 0\nfor i in range(n - 1):\n for j in range(i + 1, n):\n ans += d[i] * d[j]\nprint(ans)\n ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571533968", "date2": "1571534018", "bleu_score": "0.8988252314716089", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n0 0 68 -2 0 3 15\n", "actual_output": "0 1\n0 2\n0 3\n0 4\n0 5\n0 6\n1 2\n1 3\n1 4\n1 5\n1 6\n2 3\n2 4\n2 5\n2 6\n3 4\n3 5\n3 6\n4 5\n4 6\n5 6\n1097\n", "expected_output": "1097\n\n", "anno_code": ["n = int(input()) # (0): n=7\nd = list(map(int, input().split())) # (1): d=[0, 0, 68, -2, 0, 3, 15]\nans = 0 # (2): ans=0\nfor i in range(n - 1): # (3): i=0 (23): i=1 ... (78): NO CHANGE\n for j in range(i + 1, n): # (4): j=1 (7): j=2 ... (77): NO CHANGE\n print(i, j) # (5): NO CHANGE (8): NO CHANGE ... (75): NO CHANGE\n ans += d[i] * d[j] # (6): NO CHANGE (9): NO CHANGE ... (76): ans=1097\nprint(ans)\n "], "anno_status": [true], "diff_content": " n = int(input())\n d = list(map(int, input().split()))\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n- print(i, j)\n ans += d[i] * d[j]\n print(ans)\n \n", "FL_content": " n = int(input())\n d = list(map(int, input().split()))\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n- print(i, j)\n ans += d[i] * d[j]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u533713111", "problem_id": "p02886", "submission1_id": "s673333456", "submission2_id": "s374616416", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nd=list(map(int, input().split()))\na=(sum(d))**2\n\ndef square(list):\n return [i ** 2 for i in list]\n\nb=sum(square(d))\nresult=a-b\nprint(result)", "code2": "N=int(input())\nd=list(map(int, input().split()))\na=(sum(d))**2\n\ndef square(list):\n return [i ** 2 for i in list]\n\nb=sum(square(d))\nresult=(a-b)/2\nprint(int(result))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571535284", "date2": "1571535478", "bleu_score": "0.9272921270115448", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "7\n0 -1 105 1 5 5 8\n", "actual_output": "3988\n", "expected_output": "1994\n\n", "anno_code": ["N=int(input()) # (0): N=7\nd=list(map(int, input().split())) # (1): d=[0, -1, 105, 1, 5, 5, 8]\na=(sum(d))**2 # (2): a=15129\n\ndef square(list): # (3): square=\n return [i ** 2 for i in list]\n\nb=sum(square(d)) # (4): b=11141\nresult=a-b # (5): result=3988\nprint(result)"], "anno_status": [true], "diff_content": " N=int(input())\n d=list(map(int, input().split()))\n a=(sum(d))**2\n \n def square(list):\n return [i ** 2 for i in list]\n \n b=sum(square(d))\n-result=a-b\n-print(result)\n+result=(a-b)/2\n+print(int(result))\n", "FL_content": " N=int(input())\n d=list(map(int, input().split()))\n a=(sum(d))**2\n \n def square(list):\n return [i ** 2 for i in list]\n \n b=sum(square(d))\n-result=a-b\n-print(result)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u519227872", "problem_id": "p02299", "submission1_id": "s020243394", "submission2_id": "s949300132", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ng = []\nfor i in range(n):\n g.append([int(i) for i in input().split()])\nq = int(input())\n\ndef dot(a, b):\n return sum([i * j for i,j in zip(a, b)])\ndef sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\ndef cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\ndef contains(g, p):\n x = False\n for i in range(n):\n a = sub(g[i], p)\n b = sub(g[(i+1)%n], p)\n if abs(cross(a, b)) == 0 and dot(a, b) < 0: \n return 1\n if a[1] > b[1]:\n a,b=b,a\n if a[1] < 0 and 0 < b[1] and abs(cross(a,b)) > 0:\n x = not x\n return 2 if x else 0\nfor i in range(q):\n x,y = map(int, input().split())\n print(contains(g, [x,y]))\n\n", "code2": "n = int(input())\ng = []\nfor i in range(n):\n g.append([int(i) for i in input().split()])\nq = int(input())\nEPS = 0.001\ndef dot(a, b):\n return sum([i * j for i,j in zip(a, b)])\ndef sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\ndef cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\ndef contains(g, p):\n x = False\n for i in range(n):\n a = sub(g[i], p)\n b = sub(g[(i+1)%n], p)\n if abs(cross(a, b)) < EPS and dot(a, b) < EPS: \n return 1\n if a[1] > b[1]:\n a,b=b,a\n if a[1] < EPS and EPS < b[1] and cross(a,b) > EPS:\n x = not x\n return 2 if x else 0\nfor i in range(q):\n x,y = map(int, input().split())\n print(contains(g, [x,y]))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1519050891", "date2": "1519051125", "bleu_score": "0.9478574233783231", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 54, "total_score": 101, "input": "4\n0 0\n3 -1\n2 7\n0 1\n3\n2 2\n0 2\n0 2\n", "actual_output": "0\n0\n0\n", "expected_output": "2\n0\n0\n\n", "anno_code": ["n = int(input()) # (0): n=4\ng = [] # (1): g=[]\nfor i in range(n): # (2): i=0 (4): i=1 ... (10): NO CHANGE\n g.append([int(i) for i in input().split()]) # (3): g (5): g ... (9): g\nq = int(input()) # (11): q=3\n\ndef dot(a, b): # (12): dot=\n return sum([i * j for i,j in zip(a, b)])\ndef sub(a, b): # (13): sub=\n return [a[0] - b[0],a[1] - b[1]]\ndef cross(a, b): # (14): cross=\n return a[0] * b[1] - a[1] * b[0]\ndef contains(g, p): # (15): contains=\n x = False # (19): x=False (53): x=False (87): x=False\n for i in range(n): # (20): i=0 (27): i=1 ... (117): n=4, i=2, q=3, dot=, sub=, cross=, contains=, y=2\n a = sub(g[i], p) # (21): a=[-2, -2] (28): NO CHANGE ... (111): NO CHANGE\n b = sub(g[(i+1)%n], p) # (22): b=[1, -3] (29): b=[0, 5] ... (112): b=[0, -2]\n if abs(cross(a, b)) == 0 and dot(a, b) < 0: # (23): NO CHANGE (30): NO CHANGE ... (113): NO CHANGE\n return 1\n if a[1] > b[1]: # (24): NO CHANGE (31): NO CHANGE ... (114): NO CHANGE\n a,b=b,a # (25): a=[1, -3], b=[-2, -2] (39): a=[-2, -1], b=[0, 5] ... (115): a=[0, -2], b=[0, -1]\n if a[1] < 0 and 0 < b[1] and abs(cross(a,b)) > 0: # (26): NO CHANGE (32): NO CHANGE ... (116): NO CHANGE\n x = not x # (33): x=True (41): x=False ... (109): x=False\n return 2 if x else 0\nfor i in range(q): # (16): i=0 (50): i=1 (84): i=2\n x,y = map(int, input().split()) # (17): x=2, y=2 (51): x=0 (85): NO CHANGE\n print(contains(g, [x,y])) # (18): p=[2, 2] (52): p=[0, 2] (86): p=[0, 2]\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n g = []\n for i in range(n):\n g.append([int(i) for i in input().split()])\n q = int(input())\n-\n+EPS = 0.001\n def dot(a, b):\n return sum([i * j for i,j in zip(a, b)])\n def sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n def cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n def contains(g, p):\n x = False\n for i in range(n):\n a = sub(g[i], p)\n b = sub(g[(i+1)%n], p)\n- if abs(cross(a, b)) == 0 and dot(a, b) < 0: \n+ if abs(cross(a, b)) < EPS and dot(a, b) < EPS: \n return 1\n if a[1] > b[1]:\n a,b=b,a\n- if a[1] < 0 and 0 < b[1] and abs(cross(a,b)) > 0:\n+ if a[1] < EPS and EPS < b[1] and cross(a,b) > EPS:\n x = not x\n return 2 if x else 0\n for i in range(q):\n x,y = map(int, input().split())\n print(contains(g, [x,y]))\n \n \n", "FL_content": " n = int(input())\n g = []\n for i in range(n):\n g.append([int(i) for i in input().split()])\n q = int(input())\n-\n def dot(a, b):\n return sum([i * j for i,j in zip(a, b)])\n def sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n def cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n def contains(g, p):\n x = False\n for i in range(n):\n a = sub(g[i], p)\n b = sub(g[(i+1)%n], p)\n- if abs(cross(a, b)) == 0 and dot(a, b) < 0: \n return 1\n if a[1] > b[1]:\n a,b=b,a\n- if a[1] < 0 and 0 < b[1] and abs(cross(a,b)) > 0:\n x = not x\n return 2 if x else 0\n for i in range(q):\n x,y = map(int, input().split())\n print(contains(g, [x,y]))\n \n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 29 }, { "user_id": "u567380442", "problem_id": "p02299", "submission1_id": "s861812158", "submission2_id": "s807514392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nreadline = stdin.readline\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 eq(a, b):\n return abs(a - b) < 1e-10\n\n\ndef on_line(p, s, e):\n d = dot(p - s, e - s)\n c = cross(p - s, e - s)\n if c == 0 and 0 <= d <= abs(e - s) ** 2:\n return True\n return False\n\n\ndef on_polygon_line(xy, p):\n for i in range(len(p)):\n j = i - 1\n if on_line(xy, p[i], p[j]):\n return True\n return False\n\n\ndef in_polygon(xy, p):\n wn = 0\n for i in range(len(p)):\n j = i - 1\n if 0 == (p[i] - p[j]).imag:\n continue\n vt = (xy - p[j]).imag / (p[i] - p[j]).imag\n tmp = p[i] + vt * (p[i] - p[j])\n if xy.real < tmp.real:\n wn += 1 if p[j].imag < xy.imag <= p[i].imag else\\\n -1 if p[i].imag < xy.imag <= p[j].imag else 0\n return wn\n\nn = int(readline())\np = [map(int, readline().split()) for _ in range(n)]\np = [x + y * 1j for x, y in p]\n\nq = int(readline())\nfor _ in range(q):\n x, y = map(int, readline().split())\n xy = x + y * 1j\n print(1 if on_polygon_line(xy, p) else 2 if in_polygon(xy, p) else 0)", "code2": "from sys import stdin\nreadline = stdin.readline\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 eq(a, b):\n return abs(a - b) < 1e-10\n\n\ndef on_line(p, s, e):\n d = dot(p - s, e - s)\n c = cross(p - s, e - s)\n if c == 0 and 0 <= d <= abs(e - s) ** 2:\n return True\n return False\n\n\ndef on_polygon_line(xy, p):\n for i in range(len(p)):\n j = i - 1\n if on_line(xy, p[i], p[j]):\n return True\n return False\n\n\ndef in_polygon(xy, p):\n wn = 0\n for i in range(len(p)):\n j = i - 1\n if 0 == (p[i] - p[j]).imag:\n continue\n vt = (xy - p[j]).imag / (p[i] - p[j]).imag\n tmp = p[j] + vt * (p[i] - p[j])\n if xy.real < tmp.real:\n wn += 1 if p[j].imag <= xy.imag < p[i].imag else\\\n -1 if p[i].imag <= xy.imag < p[j].imag else 0\n return wn\n\nn = int(readline())\np = [map(int, readline().split()) for _ in range(n)]\np = [x + y * 1j for x, y in p]\n\nq = int(readline())\nfor _ in range(q):\n x, y = map(int, readline().split())\n xy = x + y * 1j\n print(1 if on_polygon_line(xy, p) else 2 if in_polygon(xy, p) else 0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1428580044", "date2": "1428580838", "bleu_score": "0.9954427796448769", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 52, "total_score": 101, "input": "4\n0 0\n3 0\n2 7\n0 1\n3\n2 1\n0 2\n0 2\n", "actual_output": "0\n2\n2\n", "expected_output": "2\n0\n0\n\n", "anno_code": ["from sys import stdin\nreadline = stdin.readline # (0): readline=\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 eq(a, b): # (3): eq=\n return abs(a - b) < 1e-10\n\n\ndef on_line(p, s, e): # (4): on_line=\n d = dot(p - s, e - s) # (18): d=1.0 (24): d=3.0 ... (143): d=6.0\n c = cross(p - s, e - s) # (19): c=2.0 (25): c=3.0 ... (144): c=-2.0\n if c == 0 and 0 <= d <= abs(e - s) ** 2: # (20): xy=(2+1j), p=[0j, (3+0j), (2+7j), 1j], i=0, j=-1 (26): xy=(2+1j), p=[0j, (3+0j), (2+7j), 1j], i=1, j=0 ... (145): xy=2j, p=[0j, (3+0j), (2+7j), 1j], i=3, j=2\n return True\n return False\n\n\ndef on_polygon_line(xy, p): # (5): on_polygon_line=\n for i in range(len(p)): # (15): i=0 (21): i=1 ... (146): NO CHANGE\n j = i - 1 # (16): j=-1 (22): j=0 ... (141): j=2\n if on_line(xy, p[i], p[j]): # (17): p=(2+1j), s=0j, e=1j (23): p=(2+1j), s=(3+0j), e=0j ... (142): p=2j, s=1j, e=(2+7j)\n return True\n return False\n\n\ndef in_polygon(xy, p): # (6): in_polygon=\n wn = 0 # (40): wn=0 (93): wn=0 (147): wn=0\n for i in range(len(p)): # (41): i=0 (47): i=1 ... (171): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p02299\\\\input_s861812158.txt' mode='r' encoding='utf-8'>, readline=, cross=, dot=, eq=, on_line=, on_polygon_line=, in_polygon=, n=4, q=3, _=2, x=0, y=2\n j = i - 1 # (42): j=-1 (48): j=0 ... (166): j=2\n if 0 == (p[i] - p[j]).imag: # (43): NO CHANGE (49): NO CHANGE ... (167): NO CHANGE\n continue # (50): NO CHANGE (103): NO CHANGE (157): NO CHANGE\n vt = (xy - p[j]).imag / (p[i] - p[j]).imag # (44): vt=-0.0 (54): vt=0.142857 ... (168): vt=0.833333\n tmp = p[i] + vt * (p[i] - p[j]) # (45): tmp=0j (55): tmp=(1.8571428571428572+8j) ... (169): tmp=(-1.6666666666666667-4j)\n if xy.real < tmp.real: # (46): NO CHANGE (56): NO CHANGE ... (170): NO CHANGE\n wn += 1 if p[j].imag < xy.imag <= p[i].imag else\\ # (110): wn=1 (164): wn=1\n -1 if p[i].imag < xy.imag <= p[j].imag else 0\n return wn\n\nn = int(readline()) # (7): n=4\np = [map(int, readline().split()) for _ in range(n)] # (8): p\np = [x + y * 1j for x, y in p] # (9): p=[0j, (3+0j), (2+7j), 1j]\n\nq = int(readline()) # (10): q=3\nfor _ in range(q): # (11): _=0 (64): _=1 (118): _=2\n x, y = map(int, readline().split()) # (12): x=2, y=1 (65): x=0, y=2 (119): NO CHANGE\n xy = x + y * 1j # (13): xy=(2+1j) (66): xy=2j (120): NO CHANGE\n print(1 if on_polygon_line(xy, p) else 2 if in_polygon(xy, p) else 0) # (14): NO CHANGE (67): NO CHANGE (121): NO CHANGE\n"], "anno_status": [false], "diff_content": " from sys import stdin\n readline = stdin.readline\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 eq(a, b):\n return abs(a - b) < 1e-10\n \n \n def on_line(p, s, e):\n d = dot(p - s, e - s)\n c = cross(p - s, e - s)\n if c == 0 and 0 <= d <= abs(e - s) ** 2:\n return True\n return False\n \n \n def on_polygon_line(xy, p):\n for i in range(len(p)):\n j = i - 1\n if on_line(xy, p[i], p[j]):\n return True\n return False\n \n \n def in_polygon(xy, p):\n wn = 0\n for i in range(len(p)):\n j = i - 1\n if 0 == (p[i] - p[j]).imag:\n continue\n vt = (xy - p[j]).imag / (p[i] - p[j]).imag\n- tmp = p[i] + vt * (p[i] - p[j])\n+ tmp = p[j] + vt * (p[i] - p[j])\n if xy.real < tmp.real:\n- wn += 1 if p[j].imag < xy.imag <= p[i].imag else\\\n- -1 if p[i].imag < xy.imag <= p[j].imag else 0\n+ wn += 1 if p[j].imag <= xy.imag < p[i].imag else\\\n+ -1 if p[i].imag <= xy.imag < p[j].imag else 0\n return wn\n \n n = int(readline())\n p = [map(int, readline().split()) for _ in range(n)]\n p = [x + y * 1j for x, y in p]\n \n q = int(readline())\n for _ in range(q):\n x, y = map(int, readline().split())\n xy = x + y * 1j\n print(1 if on_polygon_line(xy, p) else 2 if in_polygon(xy, p) else 0)\n", "FL_content": " from sys import stdin\n readline = stdin.readline\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 eq(a, b):\n return abs(a - b) < 1e-10\n \n \n def on_line(p, s, e):\n d = dot(p - s, e - s)\n c = cross(p - s, e - s)\n if c == 0 and 0 <= d <= abs(e - s) ** 2:\n return True\n return False\n \n \n def on_polygon_line(xy, p):\n for i in range(len(p)):\n j = i - 1\n if on_line(xy, p[i], p[j]):\n return True\n return False\n \n \n def in_polygon(xy, p):\n wn = 0\n for i in range(len(p)):\n j = i - 1\n if 0 == (p[i] - p[j]).imag:\n continue\n vt = (xy - p[j]).imag / (p[i] - p[j]).imag\n- tmp = p[i] + vt * (p[i] - p[j])\n if xy.real < tmp.real:\n- wn += 1 if p[j].imag < xy.imag <= p[i].imag else\\\n- -1 if p[i].imag < xy.imag <= p[j].imag else 0\n return wn\n \n n = int(readline())\n p = [map(int, readline().split()) for _ in range(n)]\n p = [x + y * 1j for x, y in p]\n \n q = int(readline())\n for _ in range(q):\n x, y = map(int, readline().split())\n xy = x + y * 1j\n print(1 if on_polygon_line(xy, p) else 2 if in_polygon(xy, p) else 0)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 54 }, { "user_id": "u698771758", "problem_id": "p03103", "submission1_id": "s360286480", "submission2_id": "s540360483", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b=map(int,input().split())\ne=[]\nfor i in range(a):\n c,d=map(int, input().split())\n e+=[[c,d]]\ne.sort()\nprint(e)\na=i=j=0\nwhile i < b:\n a+=(e[j][0]*e[j][1])\n i+=e[j][1]\n j+=1\nprint(a-((i-b)*e[j-1][0]))", "code2": "a,b=map(int,input().split())\ne=[]\nfor i in range(a):\n c,d=map(int, input().split())\n e+=[[c,d]]\ne.sort()\na=i=j=0\nwhile i < b:\n a+=(e[j][0]*e[j][1])\n i+=e[j][1]\n j+=1\nprint(a-((i-b)*e[j-1][0]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556830526", "date2": "1556830596", "bleu_score": "0.956277855271303", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 12\n10 18\n1 0\n3 9\n13 0\n", "actual_output": "[[1, 0], [3, 9], [10, 18], [13, 0]]\n57\n", "expected_output": "57\n\n", "anno_code": ["a,b=map(int,input().split()) # (0): a=4, b=12\ne=[] # (1): e=[]\nfor i in range(a): # (2): i=0 (5): i=1 ... (14): NO CHANGE\n c,d=map(int, input().split()) # (3): c=10, d=18 (6): c=1, d=0 ... (12): c=13, d=0\n e+=[[c,d]] # (4): e (7): e ... (13): e\ne.sort() # (15): e\nprint(e) # (16): NO CHANGE\na=i=j=0 # (17): a=0, i=0, j=0\nwhile i < b: # (18): NO CHANGE (22): NO CHANGE ... (30): NO CHANGE\n a+=(e[j][0]*e[j][1]) # (19): NO CHANGE (23): a=27 (27): a=207\n i+=e[j][1] # (20): NO CHANGE (24): i=9 (28): i=27\n j+=1 # (21): j=1 (25): j=2 (29): j=3\nprint(a-((i-b)*e[j-1][0]))"], "anno_status": [true], "diff_content": " a,b=map(int,input().split())\n e=[]\n for i in range(a):\n c,d=map(int, input().split())\n e+=[[c,d]]\n e.sort()\n-print(e)\n a=i=j=0\n while i < b:\n a+=(e[j][0]*e[j][1])\n i+=e[j][1]\n j+=1\n print(a-((i-b)*e[j-1][0]))\n", "FL_content": " a,b=map(int,input().split())\n e=[]\n for i in range(a):\n c,d=map(int, input().split())\n e+=[[c,d]]\n e.sort()\n-print(e)\n a=i=j=0\n while i < b:\n a+=(e[j][0]*e[j][1])\n i+=e[j][1]\n j+=1\n print(a-((i-b)*e[j-1][0]))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u434664398", "problem_id": "p03103", "submission1_id": "s182277830", "submission2_id": "s819864960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = [int(x) for x in input().split(' ')]\nAB = {}\nfor i in range(N):\n a,b = [int(x) for x in input().split(' ')]\n AB[a] = b\n \ndc = sorted(AB.items())\n\nc = 0\nm = M\nfor s in dc:\n d = m - s[1]\n if d >= 0:\n m -= s[1]\n c += s[0] * s[1]\n \n if d == 0:\n break\n else:\n print(s[1] + d,\"xx\")\n c += s[0] * (s[1] + d)\n \n break\nprint(c)", "code2": "N,M = [int(x) for x in input().split(' ')]\nAB = {}\nfor i in range(N):\n a,b = [int(x) for x in input().split(' ')]\n if a in AB:\n AB[a] += b\n else:\n AB[a] = b\n \ndc = sorted(AB.items())\n\nc = 0\nm = M\nfor s in dc:\n price, stock = s\n if stock >= m:\n c += price * m\n break\n else:\n c += stock * price\n m -= stock\n \nprint(c)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552174044", "date2": "1552174622", "bleu_score": "0.7820919148107693", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 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, 1, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 10, "total_score": 103, "input": "4 30\n6 12\n2 1\n3 10\n7 9\n", "actual_output": "7 xx\n153\n", "expected_output": "153\n\n", "anno_code": ["N,M = [int(x) for x in input().split(' ')] # (0): N=4, M=30\nAB = {} # (1): AB={}\nfor i in range(N): # (2): i=0 (5): i=1 ... (14): NO CHANGE\n a,b = [int(x) for x in input().split(' ')] # (3): a=6, b=12 (6): a=2, b=1 ... (12): a=7, b=9\n AB[a] = b # (4): AB={6: 12} (7): AB={6: 12, 2: 1} ... (13): AB={6: 12, 2: 1, 3: 10, 7: 9}\n \ndc = sorted(AB.items()) # (15): dc=[(2, 1), (3, 10), (6, 12), (7, 9)]\n\nc = 0 # (16): c=0\nm = M # (17): m=30\nfor s in dc: # (18): s=(2, 1) (24): s=(3, 10) ... (36): s=(7, 9)\n d = m - s[1] # (19): d=29 (25): d=19 ... (37): d=-2\n if d >= 0: # (20): NO CHANGE (26): NO CHANGE ... (38): NO CHANGE\n m -= s[1] # (21): m=29 (27): m=19 (33): m=7\n c += s[0] * s[1] # (22): c=2 (28): c=32 (34): c=104\n \n if d == 0: # (23): NO CHANGE (29): NO CHANGE (35): NO CHANGE\n break\n else:\n print(s[1] + d,\"xx\") # (39): NO CHANGE\n c += s[0] * (s[1] + d) # (40): c=153\n \n break # (41): NO CHANGE\nprint(c)"], "anno_status": [true], "diff_content": " N,M = [int(x) for x in input().split(' ')]\n AB = {}\n for i in range(N):\n a,b = [int(x) for x in input().split(' ')]\n- AB[a] = b\n- \n+ if a in AB:\n+ AB[a] += b\n+ else:\n+ AB[a] = b\n+ \n dc = sorted(AB.items())\n \n c = 0\n m = M\n for s in dc:\n- d = m - s[1]\n- if d >= 0:\n- m -= s[1]\n- c += s[0] * s[1]\n- \n- if d == 0:\n- break\n+ price, stock = s\n+ if stock >= m:\n+ c += price * m\n+ break\n else:\n- print(s[1] + d,\"xx\")\n- c += s[0] * (s[1] + d)\n+ c += stock * price\n+ m -= stock\n \n- break\n print(c)\n+ \n", "FL_content": " N,M = [int(x) for x in input().split(' ')]\n AB = {}\n for i in range(N):\n a,b = [int(x) for x in input().split(' ')]\n- AB[a] = b\n- \n dc = sorted(AB.items())\n \n c = 0\n m = M\n for s in dc:\n- d = m - s[1]\n- if d >= 0:\n- m -= s[1]\n- c += s[0] * s[1]\n- \n- if d == 0:\n- break\n else:\n- print(s[1] + d,\"xx\")\n- c += s[0] * (s[1] + d)\n \n- break\n print(c)\n", "added_lines": 12, "removed_lines": 12, "code1_lines": 24 }, { "user_id": "u641406334", "problem_id": "p03103", "submission1_id": "s495510870", "submission2_id": "s621564654", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int,input().split())\nL = []\nans, cnt = 0, 0\nfor i in range(n):\n ab = list(map(int,input().split()))\n L.append(ab)\nL.sort()\nfor j in range(n):\n if m-cnt>=L[j][1]:\n cnt+=L[j][1]\n ans+=L[j][0]*L[j][1]\n else:\n ans+=L[j][0]*(m-cnt)\n break\n if ans==m:\n break\nprint(ans)", "code2": "n, m = map(int,input().split())\nL = []\nans, cnt = 0, 0\nfor i in range(n):\n ab = list(map(int,input().split()))\n L.append(ab)\nL.sort()\nfor j in range(n):\n if m-cnt>L[j][1]:\n cnt+=L[j][1]\n ans+=L[j][0]*L[j][1]\n else:\n ans+=L[j][0]*(m-cnt)\n break\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565653361", "date2": "1565653482", "bleu_score": "0.9098117714677961", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 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, 1, 1, 1, 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], "code1_test_score": 95, "total_score": 103, "input": "4 30\n6 18\n2 0\n3 10\n7 9\n", "actual_output": "30\n", "expected_output": "152\n\n", "anno_code": ["n, m = map(int,input().split()) # (0): n=4, m=30\nL = [] # (1): L=[]\nans, cnt = 0, 0 # (2): ans=0, cnt=0\nfor i in range(n): # (3): i=0 (6): i=1 ... (15): NO CHANGE\n ab = list(map(int,input().split())) # (4): ab=[6, 18] (7): ab=[2, 0] ... (13): ab=[7, 9]\n L.append(ab) # (5): L (8): L ... (14): L\nL.sort() # (16): L\nfor j in range(n): # (17): j=0 (22): j=1\n if m-cnt>=L[j][1]: # (18): NO CHANGE (23): NO CHANGE\n cnt+=L[j][1] # (19): NO CHANGE (24): cnt=10\n ans+=L[j][0]*L[j][1] # (20): NO CHANGE (25): ans=30\n else:\n ans+=L[j][0]*(m-cnt)\n break\n if ans==m: # (21): NO CHANGE (26): NO CHANGE\n break # (27): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " n, m = map(int,input().split())\n L = []\n ans, cnt = 0, 0\n for i in range(n):\n ab = list(map(int,input().split()))\n L.append(ab)\n L.sort()\n for j in range(n):\n- if m-cnt>=L[j][1]:\n+ if m-cnt>L[j][1]:\n cnt+=L[j][1]\n ans+=L[j][0]*L[j][1]\n else:\n ans+=L[j][0]*(m-cnt)\n break\n- if ans==m:\n- break\n print(ans)\n", "FL_content": " n, m = map(int,input().split())\n L = []\n ans, cnt = 0, 0\n for i in range(n):\n ab = list(map(int,input().split()))\n L.append(ab)\n L.sort()\n for j in range(n):\n- if m-cnt>=L[j][1]:\n cnt+=L[j][1]\n ans+=L[j][0]*L[j][1]\n else:\n ans+=L[j][0]*(m-cnt)\n break\n- if ans==m:\n- break\n print(ans)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u375282392", "problem_id": "p03103", "submission1_id": "s187794140", "submission2_id": "s658070246", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\nab = []\nfor i in range(n):\n\tab.append(list(map(int,input().split())))\n \nsab = sorted(ab,key=lambda x:x[0])\ncost = 0\nfor i in sab:\n\tprint(cost,m)\n\tif m - i[1] > 0:\n\t\tm -= i[1]\n\t\tcost += i[0] * i[1]\n\telse:\n\t\tfor j in range(m):\n\t\t\tcost += i[0]\n\t\tbreak\nprint(cost)", "code2": "n,m = map(int,input().split())\nab = []\nfor i in range(n):\n\tab.append(list(map(int,input().split())))\n \nsab = sorted(ab,key=lambda x:x[0])\ncost = 0\nfor i in sab:\n\tif m - i[1] > 0:\n\t\tm -= i[1]\n\t\tcost += i[0] * i[1]\n\telse:\n\t\tfor j in range(m):\n\t\t\tcost += i[0]\n\t\tbreak\nprint(cost)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565957541", "date2": "1565957564", "bleu_score": "0.9467967036926119", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 25\n6 18\n2 6\n3 10\n7 9\n", "actual_output": "0 25\n12 19\n42 9\n96\n", "expected_output": "96\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=4, m=25\nab = [] # (1): ab=[]\nfor i in range(n): # (2): i=0 (4): i=1 ... (10): NO CHANGE\n\tab.append(list(map(int,input().split()))) # (3): ab (5): ab ... (9): ab\n \nsab = sorted(ab,key=lambda x:x[0]) # (11): sab\ncost = 0 # (12): cost=0\nfor i in sab: # (13): i=[2, 6] (18): i=[3, 10] (23): i=[6, 18]\n\tprint(cost,m) # (14): NO CHANGE (19): NO CHANGE (24): NO CHANGE\n\tif m - i[1] > 0: # (15): NO CHANGE (20): NO CHANGE (25): NO CHANGE\n\t\tm -= i[1] # (16): m=19 (21): m=9\n\t\tcost += i[0] * i[1] # (17): cost=12 (22): cost=42\n\telse:\n\t\tfor j in range(m): # (26): j=0 (28): j=1 ... (44): NO CHANGE\n\t\t\tcost += i[0] # (27): cost=48 (29): cost=54 ... (43): cost=96\n\t\tbreak # (45): NO CHANGE\nprint(cost)"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n ab = []\n for i in range(n):\n \tab.append(list(map(int,input().split())))\n \n sab = sorted(ab,key=lambda x:x[0])\n cost = 0\n for i in sab:\n-\tprint(cost,m)\n \tif m - i[1] > 0:\n \t\tm -= i[1]\n \t\tcost += i[0] * i[1]\n \telse:\n \t\tfor j in range(m):\n \t\t\tcost += i[0]\n \t\tbreak\n print(cost)\n", "FL_content": " n,m = map(int,input().split())\n ab = []\n for i in range(n):\n \tab.append(list(map(int,input().split())))\n \n sab = sorted(ab,key=lambda x:x[0])\n cost = 0\n for i in sab:\n-\tprint(cost,m)\n \tif m - i[1] > 0:\n \t\tm -= i[1]\n \t\tcost += i[0] * i[1]\n \telse:\n \t\tfor j in range(m):\n \t\t\tcost += i[0]\n \t\tbreak\n print(cost)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u396971285", "problem_id": "p03103", "submission1_id": "s247556399", "submission2_id": "s862157824", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=map(int,input().split())\n\n\nAB=[]\nfor i in range(N):\n ab=list(map(int,input().split()))\n AB.append(ab)\n\n\nlist.sort(AB,key=lambda x:x[0])\n\n\nm=0 \ncost=0 \nfor i in range(N):\n \n if M-m==AB[i][1]:\n m+=AB[i][1]\n cost+=AB[i][0]*AB[i][1]\n break\n\n elif M-m b:\n total += a * b\n M -= b\n else:\n total += a * M\n break\nprint(total)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552164965", "date2": "1552171324", "bleu_score": "0.8019793016473303", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 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, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 86, "total_score": 103, "input": "4 30\n6 18\n2 3\n3 10\n2 9\n", "actual_output": "114\n", "expected_output": "102\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=4, M=30\n\nshop_dic = {} # (1): shop_dic={}\nfor _ in range(N): # (2): _=0 (5): _=1 ... (14): NO CHANGE\n a, b = map(int, input().split()) # (3): a=6, b=18 (6): a=2, b=3 ... (12): a=2, b=9\n shop_dic[a] = b # (4): shop_dic={6: 18} (7): shop_dic={6: 18, 2: 3} ... (13): shop_dic={6: 18, 2: 9, 3: 10}\n\ntotal = 0 # (15): total=0\nfor a in sorted(shop_dic.keys()): # (16): NO CHANGE (21): a=3 (26): a=6\n b = shop_dic[a] # (17): NO CHANGE (22): b=10 (27): b=18\n if M < b: # (18): NO CHANGE (23): NO CHANGE (28): NO CHANGE\n total += a * M # (29): total=114\n break # (30): NO CHANGE\n else:\n total += a * b # (19): total=18 (24): total=48\n M -= b # (20): M=21 (25): M=11\nprint(total)\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n \n-shop_dic = {}\n-for _ in range(N):\n+shop_list = [None] * N\n+for n in range(N):\n a, b = map(int, input().split())\n- shop_dic[a] = b\n+ shop_list[n] = [a, b]\n \n total = 0\n-for a in sorted(shop_dic.keys()):\n- b = shop_dic[a]\n- if M < b:\n- total += a * M\n- break\n- else:\n+for a, b in sorted(shop_list, key = lambda x: x[0]):\n+ if M > b:\n total += a * b\n M -= b\n+ else:\n+ total += a * M\n+ break\n print(total)\n \n", "FL_content": " N, M = map(int, input().split())\n \n-shop_dic = {}\n-for _ in range(N):\n a, b = map(int, input().split())\n- shop_dic[a] = b\n \n total = 0\n-for a in sorted(shop_dic.keys()):\n- b = shop_dic[a]\n- if M < b:\n- total += a * M\n- break\n- else:\n total += a * b\n M -= b\n print(total)\n \n", "added_lines": 8, "removed_lines": 9, "code1_lines": 18 }, { "user_id": "u179169725", "problem_id": "p03103", "submission1_id": "s786314208", "submission2_id": "s929690723", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nread = sys.stdin.readline\n\n\ndef readln():\n return list(map(int, read().split()))\n\n\nN, M = readln()\n\ndata = {}\nfor _ in range(N):\n a, b = readln()\n data[a] = b\n\nans = 0\ndrink = 0\nfor k, v in sorted(data.items()):\n ans += k * v\n drink += v\n if drink > M:\n break\nprint(ans-k*(drink-M))\n", "code2": "import sys\nread = sys.stdin.readline\n\n\ndef readln():\n return list(map(int, read().split()))\n\n\nN, M = readln()\n\nA = []\nB = []\ndata = {}\nfor _ in range(N):\n a, b = readln()\n A.append(a)\n B.append(b)\n data[a] = 0\n\nfor a, b in zip(A, B):\n data[a] += b\n\nans = 0\ndrink = 0\nfor k, v in sorted(data.items()):\n ans += k * v\n drink += v\n if drink > M:\n break\nprint(ans-k*(drink-M))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552162890", "date2": "1552163177", "bleu_score": "0.782429900793624", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 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, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 89, "total_score": 103, "input": "4 30\n5 18\n2 8\n4 10\n2 9\n", "actual_output": "113\n", "expected_output": "89\n\n", "anno_code": ["import sys\nread = sys.stdin.readline # (0): read=\n\n\ndef readln(): # (1): readln=\n return list(map(int, read().split()))\n\n\nN, M = readln() # (2): N=4, M=30\n\ndata = {} # (3): data={}\nfor _ in range(N): # (4): _=0 (7): _=1 ... (16): NO CHANGE\n a, b = readln() # (5): a=5, b=18 (8): a=2, b=8 ... (14): a=2, b=9\n data[a] = b # (6): data={5: 18} (9): data={5: 18, 2: 8} ... (15): data={5: 18, 2: 9, 4: 10}\n\nans = 0 # (17): ans=0\ndrink = 0 # (18): drink=0\nfor k, v in sorted(data.items()): # (19): k=2, v=9 (23): k=4, v=10 (27): k=5, v=18\n ans += k * v # (20): ans=18 (24): ans=58 (28): ans=148\n drink += v # (21): drink=9 (25): drink=19 (29): drink=37\n if drink > M: # (22): NO CHANGE (26): NO CHANGE (30): NO CHANGE\n break # (31): NO CHANGE\nprint(ans-k*(drink-M))\n"], "anno_status": [true], "diff_content": " import sys\n read = sys.stdin.readline\n \n \n def readln():\n return list(map(int, read().split()))\n \n \n N, M = readln()\n \n+A = []\n+B = []\n data = {}\n for _ in range(N):\n a, b = readln()\n- data[a] = b\n+ A.append(a)\n+ B.append(b)\n+ data[a] = 0\n+\n+for a, b in zip(A, B):\n+ data[a] += b\n \n ans = 0\n drink = 0\n for k, v in sorted(data.items()):\n ans += k * v\n drink += v\n if drink > M:\n break\n print(ans-k*(drink-M))\n \n", "FL_content": " import sys\n read = sys.stdin.readline\n \n \n def readln():\n return list(map(int, read().split()))\n \n \n N, M = readln()\n \n data = {}\n for _ in range(N):\n a, b = readln()\n- data[a] = b\n \n ans = 0\n drink = 0\n for k, v in sorted(data.items()):\n ans += k * v\n drink += v\n if drink > M:\n break\n print(ans-k*(drink-M))\n \n", "added_lines": 8, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u129492036", "problem_id": "p03103", "submission1_id": "s531552127", "submission2_id": "s106482706", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN, M = map(int, input().split())\n\nA = [list(map(int, input().split())) for i in range(N)]\nA = sorted(dict(A).items())\n\nans = 0\nm = M\nfor a, b in A:\n if m <= b:\n ans += m*a\n break\n else:\n ans += b*a\n m -= b\n\nprint(ans)\n", "code2": "\n\nN, M = map(int, input().split())\n\nA = [list(map(int, input().split())) for i in range(N)]\nA = sorted(A)\n\nans = 0\nm = M\nfor a, b in A:\n if m <= b:\n ans += m*a\n break\n else:\n ans += b*a\n m -= b\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552163650", "date2": "1552163980", "bleu_score": "0.9373500576955623", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 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, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 86, "total_score": 103, "input": "4 30\n5 18\n2 8\n5 10\n2 9\n", "actual_output": "68\n", "expected_output": "99\n\n", "anno_code": ["\n\nN, M = map(int, input().split()) # (0): N=4, M=30\n\nA = [list(map(int, input().split())) for i in range(N)] # (1): A\nA = sorted(dict(A).items()) # (2): A=[(2, 9), (5, 10)]\n\nans = 0 # (3): ans=0\nm = M # (4): m=30\nfor a, b in A: # (5): a=2, b=9 (9): a=5, b=10 (13): NO CHANGE\n if m <= b: # (6): NO CHANGE (10): NO CHANGE\n ans += m*a\n break\n else:\n ans += b*a # (7): ans=18 (11): ans=68\n m -= b # (8): m=21 (12): m=11\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n \n N, M = map(int, input().split())\n \n A = [list(map(int, input().split())) for i in range(N)]\n-A = sorted(dict(A).items())\n+A = sorted(A)\n \n ans = 0\n m = M\n for a, b in A:\n if m <= b:\n ans += m*a\n break\n else:\n ans += b*a\n m -= b\n \n print(ans)\n \n", "FL_content": " \n \n N, M = map(int, input().split())\n \n A = [list(map(int, input().split())) for i in range(N)]\n-A = sorted(dict(A).items())\n \n ans = 0\n m = M\n for a, b in A:\n if m <= b:\n ans += m*a\n break\n else:\n ans += b*a\n m -= b\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u460386402", "problem_id": "p03103", "submission1_id": "s747729727", "submission2_id": "s027152802", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m=map(int,input().split())\ndic={}\ndoll=0\nfor i in range(n):\n a,b=map(int,input().split())\n dic[a]=b\n \ncon=sorted(dic.items())\n\nfor k,v in con:\n if v, heapq=, re=, bisect=, random=, math=, itertools=, defaultdict=, deque=, deepcopy=, getcontext=, setcontext=, localcontext=, Decimal=, Context=, DecimalTuple=, DecimalException=, Clamped=, Rounded=, Inexact=, Subnormal=, Underflow=, Overflow=, DivisionByZero=, FloatOperation=, InvalidOperation=, ConversionSyntax=, DivisionImpossible=, DivisionUndefined=, InvalidContext=, DefaultContext=Context(prec=28, rounding=ROUND_HALF_EVEN, Emin=-999999, Emax=999999, capitals=1, clamp=0, flags=[], traps=[InvalidOperation, DivisionByZero, Overflow]), HAVE_CONTEXTVAR=True, HAVE_THREADS=True, BasicContext=Context(prec=9, rounding=ROUND_HALF_UP, Emin=-999999, Emax=999999, capitals=1, clamp=0, flags=[], traps=[Clamped, InvalidOperation, DivisionByZero, Overflow, Underflow]), ExtendedContext=Context(prec=9, rounding=ROUND_HALF_EVEN, Emin=-999999, Emax=999999, capitals=1, clamp=0, flags=[], traps=[]), MAX_PREC=999999999999999999, MAX_EMAX=999999999999999999, MIN_EMIN=-999999999999999999, MIN_ETINY=-1999999999999999997, ROUND_UP=ROUND_UP, ROUND_DOWN=ROUND_DOWN, ROUND_CEILING=ROUND_CEILING, ROUND_FLOOR=ROUND_FLOOR, ROUND_HALF_UP=ROUND_HALF_UP, ROUND_HALF_DOWN=ROUND_HALF_DOWN, ROUND_HALF_EVEN=ROUND_HALF_EVEN, ROUND_05UP=ROUND_05UP\nimport sys\n\nimport heapq\nimport re\nimport bisect\nimport random\nimport math\nimport itertools\nfrom collections import defaultdict, deque\nfrom copy import deepcopy\nfrom decimal import *\n\na, b = map(int, input().split()) # (1): a=4, b=30\nd = defaultdict(list) # (2): d=defaultdict(, {})\narray = [] # (3): array=[]\nfor i in range(a): # (4): i=0 (8): i=1 ... (20): NO CHANGE\n x, y = map(int, input().split()) # (5): x=6, y=18 (9): x=2, y=5 ... (17): x=2\n d[x].append(y) # (6): d=defaultdict(, {6: [18]}) (10): d=defaultdict(, {6: [18], 2: [5]}) ... (18): d=defaultdict(, {6: [18], 2: [5, 10], 3: [10]})\n array.append(x) # (7): array=[6] (11): array=[6, 2] ... (19): array=[6, 2, 3, 2]\narray.sort() # (21): array=[2, 2, 3, 6]\ncount = 0 # (22): count=0\nfor i in array: # (23): i=2 (29): NO CHANGE ... (41): i=6\n if b <= d[i][0]: # (24): NO CHANGE (30): NO CHANGE ... (42): NO CHANGE\n count += max(b, 0) * i # (43): count=110\n break # (44): NO CHANGE\n else:\n t = d[i][0] # (25): t=5 (31): NO CHANGE (37): t=10\n b -= t # (26): b=25 (32): b=20 (38): b=10\n count += t * i # (27): count=10 (33): count=20 (39): count=50\n d[i].pop() # (28): d=defaultdict(, {6: [18], 2: [5], 3: [10]}) (34): d=defaultdict(, {6: [18], 2: [], 3: [10]}) (40): d=defaultdict(, {6: [18], 2: [], 3: []})\nprint(count)"], "anno_status": [false], "diff_content": " \n import sys\n \n import heapq\n import re\n import bisect\n import random\n import math\n import itertools\n from collections import defaultdict, deque\n from copy import deepcopy\n from decimal import *\n \n a, b = map(int, input().split())\n-d = defaultdict(list)\n-array = []\n+d = []\n for i in range(a):\n x, y = map(int, input().split())\n- d[x].append(y)\n- array.append(x)\n-array.sort()\n+ d.append((x, y))\n+d.sort()\n count = 0\n-for i in array:\n- if b <= d[i][0]:\n- count += max(b, 0) * i\n+for i in range(a):\n+ if b <= d[i][1]:\n+ count += b * d[i][0]\n break\n else:\n- t = d[i][0]\n- b -= t\n- count += t * i\n- d[i].pop()\n+ b -= d[i][1]\n+ count += d[i][0] * d[i][1]\n print(count)\n", "FL_content": " \n import sys\n \n import heapq\n import re\n import bisect\n import random\n import math\n import itertools\n from collections import defaultdict, deque\n from copy import deepcopy\n from decimal import *\n \n a, b = map(int, input().split())\n-d = defaultdict(list)\n-array = []\n for i in range(a):\n x, y = map(int, input().split())\n- d[x].append(y)\n- array.append(x)\n-array.sort()\n count = 0\n-for i in array:\n- if b <= d[i][0]:\n- count += max(b, 0) * i\n break\n else:\n- t = d[i][0]\n- b -= t\n- count += t * i\n- d[i].pop()\n print(count)\n", "added_lines": 8, "removed_lines": 12, "code1_lines": 32 }, { "user_id": "u682730715", "problem_id": "p03103", "submission1_id": "s839803871", "submission2_id": "s831622541", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\nimport heapq\nimport re\nimport bisect\nimport random\nimport math\nimport itertools\nfrom collections import defaultdict, deque\nfrom copy import deepcopy\nfrom decimal import *\n\na, b = map(int, input().split())\nd = defaultdict(int)\narray = []\nfor i in range(a):\n x, y = map(int, input().split())\n d[x] = y\n array.append(x)\narray.sort()\n\n\ncount = 0\nfor i in array:\n if b <= d[i]:\n count += max(b, 0) * i\n break\n else:\n t = d[i]\n b -= t\n count += t * i\nprint(count)", "code2": "\nimport sys\n\nimport heapq\nimport re\nimport bisect\nimport random\nimport math\nimport itertools\nfrom collections import defaultdict, deque\nfrom copy import deepcopy\nfrom decimal import *\n\na, b = map(int, input().split())\nd = []\nfor i in range(a):\n x, y = map(int, input().split())\n d.append((x, y))\nd.sort()\ncount = 0\nfor i in range(a):\n if b <= d[i][1]:\n count += b * d[i][0]\n break\n else:\n b -= d[i][1]\n count += d[i][0] * d[i][1]\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552164093", "date2": "1552169131", "bleu_score": "0.8280531644391339", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 87, "total_score": 103, "input": "4 10\n10 25\n2 0\n2 2\n1 1\n", "actual_output": "59\n", "expected_output": "75\n\n", "anno_code": [" # (0): sys=, heapq=, re=, bisect=, random=, math=, itertools=, defaultdict=, deque=, deepcopy=, getcontext=, setcontext=, localcontext=, Decimal=, Context=, DecimalTuple=, DecimalException=, Clamped=, Rounded=, Inexact=, Subnormal=, Underflow=, Overflow=, DivisionByZero=, FloatOperation=, InvalidOperation=, ConversionSyntax=, DivisionImpossible=, DivisionUndefined=, InvalidContext=, DefaultContext=Context(prec=28, rounding=ROUND_HALF_EVEN, Emin=-999999, Emax=999999, capitals=1, clamp=0, flags=[], traps=[InvalidOperation, DivisionByZero, Overflow]), HAVE_CONTEXTVAR=True, HAVE_THREADS=True, BasicContext=Context(prec=9, rounding=ROUND_HALF_UP, Emin=-999999, Emax=999999, capitals=1, clamp=0, flags=[], traps=[Clamped, InvalidOperation, DivisionByZero, Overflow, Underflow]), ExtendedContext=Context(prec=9, rounding=ROUND_HALF_EVEN, Emin=-999999, Emax=999999, capitals=1, clamp=0, flags=[], traps=[]), MAX_PREC=999999999999999999, MAX_EMAX=999999999999999999, MIN_EMIN=-999999999999999999, MIN_ETINY=-1999999999999999997, ROUND_UP=ROUND_UP, ROUND_DOWN=ROUND_DOWN, ROUND_CEILING=ROUND_CEILING, ROUND_FLOOR=ROUND_FLOOR, ROUND_HALF_UP=ROUND_HALF_UP, ROUND_HALF_DOWN=ROUND_HALF_DOWN, ROUND_HALF_EVEN=ROUND_HALF_EVEN, ROUND_05UP=ROUND_05UP\nimport sys\n\nimport heapq\nimport re\nimport bisect\nimport random\nimport math\nimport itertools\nfrom collections import defaultdict, deque\nfrom copy import deepcopy\nfrom decimal import *\n\na, b = map(int, input().split()) # (1): a=4, b=10\nd = defaultdict(int) # (2): d=defaultdict(, {})\narray = [] # (3): array=[]\nfor i in range(a): # (4): i=0 (8): i=1 ... (20): NO CHANGE\n x, y = map(int, input().split()) # (5): x=10, y=25 (9): x=2, y=0 ... (17): x=1, y=1\n d[x] = y # (6): d=defaultdict(, {10: 25}) (10): d=defaultdict(, {10: 25, 2: 0}) ... (18): d=defaultdict(, {10: 25, 2: 2, 1: 1})\n array.append(x) # (7): array=[10] (11): array=[10, 2] ... (19): array=[10, 2, 2, 1]\narray.sort() # (21): array=[1, 2, 2, 10]\n\n\ncount = 0 # (22): count=0\nfor i in array: # (23): i=1 (28): i=2 ... (38): i=10\n if b <= d[i]: # (24): NO CHANGE (29): NO CHANGE ... (39): NO CHANGE\n count += max(b, 0) * i # (40): count=59\n break # (41): NO CHANGE\n else:\n t = d[i] # (25): t=1 (30): t=2 (35): NO CHANGE\n b -= t # (26): b=9 (31): b=7 (36): b=5\n count += t * i # (27): count=1 (32): count=5 (37): count=9\nprint(count)"], "anno_status": [false], "diff_content": " \n import sys\n \n import heapq\n import re\n import bisect\n import random\n import math\n import itertools\n from collections import defaultdict, deque\n from copy import deepcopy\n from decimal import *\n \n a, b = map(int, input().split())\n-d = defaultdict(int)\n-array = []\n+d = []\n for i in range(a):\n x, y = map(int, input().split())\n- d[x] = y\n- array.append(x)\n-array.sort()\n-\n-\n+ d.append((x, y))\n+d.sort()\n count = 0\n-for i in array:\n- if b <= d[i]:\n- count += max(b, 0) * i\n+for i in range(a):\n+ if b <= d[i][1]:\n+ count += b * d[i][0]\n break\n else:\n- t = d[i]\n- b -= t\n- count += t * i\n+ b -= d[i][1]\n+ count += d[i][0] * d[i][1]\n print(count)\n", "FL_content": " \n import sys\n \n import heapq\n import re\n import bisect\n import random\n import math\n import itertools\n from collections import defaultdict, deque\n from copy import deepcopy\n from decimal import *\n \n a, b = map(int, input().split())\n-d = defaultdict(int)\n-array = []\n for i in range(a):\n x, y = map(int, input().split())\n- d[x] = y\n- array.append(x)\n-array.sort()\n-\n-\n count = 0\n-for i in array:\n- if b <= d[i]:\n- count += max(b, 0) * i\n break\n else:\n- t = d[i]\n- b -= t\n- count += t * i\n print(count)\n", "added_lines": 8, "removed_lines": 13, "code1_lines": 33 }, { "user_id": "u686036872", "problem_id": "p03103", "submission1_id": "s129916145", "submission2_id": "s487895633", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\n\nA = []\nfor i in range(N):\n a, b = map(int, input().split())\n A.append([a, b])\n\nA.sort(key=lambda x:x[0])\n\nmoney = 0\ncnt = 0\nfor i in range(N):\n for j in range(A[i][1]):\n money += A[i][0]\n if cnt == N:\n print(money)\n break", "code2": "N, M = map(int, input().split())\n\nA = []\nfor i in range(N):\n a, b = map(int, input().split())\n A.append([a, b])\n\nA.sort(key=lambda x:x[0])\n\nmoney = 0\ncnt = 0\nfor i in range(N):\n if cnt + A[i][1] < M: \n money += A[i][0]*A[i][1]\n cnt += A[i][1]\n else: \n money += A[i][0]*(M-cnt)\n print(money)\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586891572", "date2": "1586892272", "bleu_score": "0.8015031055963473", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3\n3 4\n1 6\n", "actual_output": "", "expected_output": "3\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=2, M=3\n\nA = [] # (1): A=[]\nfor i in range(N): # (2): i=0 (5): i=1 (8): NO CHANGE\n a, b = map(int, input().split()) # (3): a=3, b=4 (6): a=1, b=6\n A.append([a, b]) # (4): A (7): A\n\nA.sort(key=lambda x:x[0]) # (9): A\n\nmoney = 0 # (10): money=0\ncnt = 0 # (11): cnt=0\nfor i in range(N): # (12): i=0 (32): i=1\n for j in range(A[i][1]): # (13): j=0 (16): j=1 ... (45): NO CHANGE\n money += A[i][0] # (14): money=1 (17): money=2 ... (43): money=18\n if cnt == N: # (15): NO CHANGE (18): NO CHANGE ... (44): NO CHANGE\n print(money)\n break"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n \n A = []\n for i in range(N):\n a, b = map(int, input().split())\n A.append([a, b])\n \n A.sort(key=lambda x:x[0])\n \n money = 0\n cnt = 0\n for i in range(N):\n- for j in range(A[i][1]):\n- money += A[i][0]\n- if cnt == N:\n- print(money)\n- break\n+ if cnt + A[i][1] < M: \n+ money += A[i][0]*A[i][1]\n+ cnt += A[i][1]\n+ else: \n+ money += A[i][0]*(M-cnt)\n+ print(money)\n+ break\n", "FL_content": " N, M = map(int, input().split())\n \n A = []\n for i in range(N):\n a, b = map(int, input().split())\n A.append([a, b])\n \n A.sort(key=lambda x:x[0])\n \n money = 0\n cnt = 0\n for i in range(N):\n- for j in range(A[i][1]):\n- money += A[i][0]\n- if cnt == N:\n- print(money)\n- break\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 17 }, { "user_id": "u708255304", "problem_id": "p03103", "submission1_id": "s658794787", "submission2_id": "s463840392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split()) \n\nans = 0\n\n\n\n\n\nshop_list = []\nfor _ in range(N):\n hoge = {}\n A, B = map(int, input().split())\n hoge['price'] = A\n hoge['amount'] = B\n shop_list.append(hoge)\n hoge = {}\n\nshop_list.sort(key=lambda x: x['price'])\n\nquontity = 0\nmoney = 0\nfor i in range(len(shop_list)):\n money += shop_list[i]['price']*shop_list[i]['amount']\n \n quontity += shop_list[i]['amount']\n \n if quontity >= M:\n money -= shop_list[i]['price']*(quontity-M)\n\nprint(money)\n", "code2": "N, M = map(int, input().split()) \n\nans = 0\n\n\n\n\n\nshop_list = []\nfor _ in range(N):\n hoge = {}\n A, B = map(int, input().split())\n hoge['price'] = A\n hoge['amount'] = B\n shop_list.append(hoge)\n hoge = {}\n\nshop_list.sort(key=lambda x: x['price'])\n\nquontity = 0\nmoney = 0\nfor i in range(N):\n money += shop_list[i]['price']*shop_list[i]['amount']\n \n quontity += shop_list[i]['amount']\n \n if quontity >= M:\n money -= shop_list[i]['price']*(quontity-M)\n break\n\nprint(money)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555352572", "date2": "1555352697", "bleu_score": "0.9668094177034876", "code1_test_status": [0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1], "code1_test_score": 68, "total_score": 103, "input": "2 5\n3 4\n1 6\n", "actual_output": "2\n", "expected_output": "5\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=2, M=5\n\nans = 0 # (1): ans=0\n\n\n\n\n\nshop_list = [] # (2): shop_list=[]\nfor _ in range(N): # (3): _=0 (10): _=1 (17): NO CHANGE\n hoge = {} # (4): hoge={} (11): NO CHANGE\n A, B = map(int, input().split()) # (5): A=3, B=4 (12): A=1, B=6\n hoge['price'] = A # (6): hoge={'price': 3} (13): hoge={'price': 1}\n hoge['amount'] = B # (7): hoge={'price': 3, 'amount': 4} (14): hoge={'price': 1, 'amount': 6}\n shop_list.append(hoge) # (8): shop_list=[{'price': 3, 'amount': 4}] (15): shop_list=[{'price': 3, 'amount': 4}, {'price': 1, 'amount': 6}]\n hoge = {} # (9): hoge={} (16): hoge={}\n\nshop_list.sort(key=lambda x: x['price']) # (18): shop_list=[{'price': 1, 'amount': 6}, {'price': 3, 'amount': 4}]\n\nquontity = 0 # (19): quontity=0\nmoney = 0 # (20): money=0\nfor i in range(len(shop_list)): # (21): i=0 (26): i=1 (31): NO CHANGE\n money += shop_list[i]['price']*shop_list[i]['amount'] # (22): money=6 (27): money=17\n \n quontity += shop_list[i]['amount'] # (23): quontity=6 (28): quontity=10\n \n if quontity >= M: # (24): NO CHANGE (29): NO CHANGE\n money -= shop_list[i]['price']*(quontity-M) # (25): money=5 (30): money=2\n\nprint(money)\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split()) \n \n ans = 0\n \n \n \n \n \n shop_list = []\n for _ in range(N):\n hoge = {}\n A, B = map(int, input().split())\n hoge['price'] = A\n hoge['amount'] = B\n shop_list.append(hoge)\n hoge = {}\n \n shop_list.sort(key=lambda x: x['price'])\n \n quontity = 0\n money = 0\n-for i in range(len(shop_list)):\n+for i in range(N):\n money += shop_list[i]['price']*shop_list[i]['amount']\n \n quontity += shop_list[i]['amount']\n \n if quontity >= M:\n money -= shop_list[i]['price']*(quontity-M)\n+ break\n \n print(money)\n \n", "FL_content": " N, M = map(int, input().split()) \n \n ans = 0\n \n \n \n \n \n shop_list = []\n for _ in range(N):\n hoge = {}\n A, B = map(int, input().split())\n hoge['price'] = A\n hoge['amount'] = B\n shop_list.append(hoge)\n hoge = {}\n \n shop_list.sort(key=lambda x: x['price'])\n \n quontity = 0\n money = 0\n-for i in range(len(shop_list)):\n money += shop_list[i]['price']*shop_list[i]['amount']\n \n quontity += shop_list[i]['amount']\n \n if quontity >= M:\n money -= shop_list[i]['price']*(quontity-M)\n \n print(money)\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 31 }, { "user_id": "u293198424", "problem_id": "p03103", "submission1_id": "s553275677", "submission2_id": "s270935740", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\ndrink = dict()\ncost = set()\nans = 0\nfor i in range(n):\n ab = [int(i) for i in input().split()]\n cost.add(ab[0])\n if ab[0] in drink:\n drink[ab[0]] += ab[1]\n else:\n drink[ab[0]] = ab[1]\n\nsorted(cost)\nfor i in cost:\n if m <= drink[i]:\n ans += m*i\n break\n else:\n m -= drink[i]\n ans += i * drink[i] \n \nprint(ans)", "code2": "n,m = map(int,input().split())\ndrink = dict()\ncost = list()\nans = 0\nfor i in range(n):\n ab = [int(i) for i in input().split()]\n if ab[0] in drink:\n drink[ab[0]] += ab[1]\n else:\n cost.append(ab[0])\n drink[ab[0]] = ab[1]\n\ncost.sort()\nfor i in cost:\n if m <= drink[i]:\n ans += m*i\n break\n else:\n m -= drink[i]\n ans += i * drink[i] \n \nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582478143", "date2": "1582478270", "bleu_score": "0.9512272697251152", "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, 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, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 103, "input": "4 11\n6 25\n0 0\n4 4\n8 1\n", "actual_output": "60\n", "expected_output": "58\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=4, m=11\ndrink = dict() # (1): drink={}\ncost = set() # (2): cost=set()\nans = 0 # (3): ans=0\nfor i in range(n): # (4): i=0 (9): i=1 ... (24): NO CHANGE\n ab = [int(i) for i in input().split()] # (5): ab=[6, 25] (10): ab=[0, 0] ... (20): ab=[8, 1]\n cost.add(ab[0]) # (6): cost={6} (11): cost={0, 6} ... (21): cost={0, 8, 4, 6}\n if ab[0] in drink: # (7): NO CHANGE (12): NO CHANGE ... (22): NO CHANGE\n drink[ab[0]] += ab[1]\n else:\n drink[ab[0]] = ab[1] # (8): drink={6: 25} (13): drink={6: 25, 0: 0} ... (23): drink={6: 25, 0: 0, 4: 4, 8: 1}\n\nsorted(cost) # (25): NO CHANGE\nfor i in cost: # (26): i=0 (30): i=8 ... (38): i=6\n if m <= drink[i]: # (27): NO CHANGE (31): NO CHANGE ... (39): NO CHANGE\n ans += m*i # (40): ans=60\n break # (41): NO CHANGE\n else:\n m -= drink[i] # (28): NO CHANGE (32): m=10 (36): m=6\n ans += i * drink[i] # (29): NO CHANGE (33): ans=8 (37): ans=24\n \nprint(ans)"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n drink = dict()\n-cost = set()\n+cost = list()\n ans = 0\n for i in range(n):\n ab = [int(i) for i in input().split()]\n- cost.add(ab[0])\n if ab[0] in drink:\n drink[ab[0]] += ab[1]\n else:\n+ cost.append(ab[0])\n drink[ab[0]] = ab[1]\n \n-sorted(cost)\n+cost.sort()\n for i in cost:\n if m <= drink[i]:\n ans += m*i\n break\n else:\n m -= drink[i]\n ans += i * drink[i] \n \n print(ans)\n", "FL_content": " n,m = map(int,input().split())\n drink = dict()\n-cost = set()\n ans = 0\n for i in range(n):\n ab = [int(i) for i in input().split()]\n- cost.add(ab[0])\n if ab[0] in drink:\n drink[ab[0]] += ab[1]\n else:\n drink[ab[0]] = ab[1]\n \n-sorted(cost)\n for i in cost:\n if m <= drink[i]:\n ans += m*i\n break\n else:\n m -= drink[i]\n ans += i * drink[i] \n \n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 22 }, { "user_id": "u712082626", "problem_id": "p03103", "submission1_id": "s226645524", "submission2_id": "s808421243", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nt = {}\nfor i in range(n):\n a,b = map(int, input().split())\n t[a] = b\nt = sorted(t.items())\nprint(t)\nr = 0\nfor i in t:\n if i[1] < m:\n r += i[0]*i[1]\n m -= i[1]\n else:\n r += i[0]*(m)\n break\nprint(r)\n", "code2": "n, m = map(int, input().split())\nl = []\nfor i in range(n):\n a, b = map(int, input().split())\n l.append((a, b))\n\nl = sorted(l)\n\n\nr = 0\nfor i in l:\n if i[1] < m:\n r += i[0]*i[1]\n m -= i[1]\n else:\n r += i[0]*(m)\n break\nprint(r)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559654202", "date2": "1559657626", "bleu_score": "0.8624161688666923", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 30\n0 18\n2 5\n3 10\n7 9\n", "actual_output": "[(0, 18), (2, 5), (3, 10), (7, 9)]\n31\n", "expected_output": "31\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=4, m=30\nt = {} # (1): t={}\nfor i in range(n): # (2): i=0 (5): i=1 ... (14): NO CHANGE\n a,b = map(int, input().split()) # (3): a=0, b=18 (6): a=2, b=5 ... (12): a=7, b=9\n t[a] = b # (4): t={0: 18} (7): t={0: 18, 2: 5} ... (13): t={0: 18, 2: 5, 3: 10, 7: 9}\nt = sorted(t.items()) # (15): t=[(0, 18), (2, 5), (3, 10), (7, 9)]\nprint(t) # (16): NO CHANGE\nr = 0 # (17): r=0\nfor i in t: # (18): i=(0, 18) (22): i=(2, 5) (26): i=(3, 10)\n if i[1] < m: # (19): NO CHANGE (23): NO CHANGE (27): NO CHANGE\n r += i[0]*i[1] # (20): NO CHANGE (24): r=10\n m -= i[1] # (21): m=12 (25): m=7\n else:\n r += i[0]*(m) # (28): r=31\n break # (29): NO CHANGE\nprint(r)\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n-t = {}\n+l = []\n for i in range(n):\n- a,b = map(int, input().split())\n- t[a] = b\n-t = sorted(t.items())\n-print(t)\n+ a, b = map(int, input().split())\n+ l.append((a, b))\n+\n+l = sorted(l)\n+\n+\n r = 0\n-for i in t:\n+for i in l:\n if i[1] < m:\n r += i[0]*i[1]\n m -= i[1]\n else:\n r += i[0]*(m)\n break\n print(r)\n \n", "FL_content": " n, m = map(int, input().split())\n-t = {}\n for i in range(n):\n- a,b = map(int, input().split())\n- t[a] = b\n-t = sorted(t.items())\n-print(t)\n r = 0\n-for i in t:\n if i[1] < m:\n r += i[0]*i[1]\n m -= i[1]\n else:\n r += i[0]*(m)\n break\n print(r)\n \n", "added_lines": 8, "removed_lines": 6, "code1_lines": 17 }, { "user_id": "u145145077", "problem_id": "p03103", "submission1_id": "s736214835", "submission2_id": "s628195042", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m=map(int,input().split())\nab=[list(map(int,input().split())) for i in range(n)]\n\nab_sorted = sorted(ab, key=lambda x:(x[0], -x[1]))\nprint(ab_sorted)\n\nnum = 0\namount_of_money = 0\nfor i in range(n):\n buy = min(ab_sorted[i][1], m-num)\n num += buy\n amount_of_money += ab_sorted[i][0] * buy\n \n if num >= m:\n print(amount_of_money)\n", "code2": "n,m=map(int,input().split())\nab=[list(map(int,input().split())) for i in range(n)]\n\nab_sorted = sorted(ab, key=lambda x:(x[0], -x[1]))\n\nnum = 0\namount_of_money = 0\nfor i in range(n):\n buy = min(ab_sorted[i][1], m-num)\n num += buy\n amount_of_money += ab_sorted[i][0] * buy\n \n if num >= m:\n print(amount_of_money)\n exit(0)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599550152", "date2": "1599550244", "bleu_score": "0.9547128263187648", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 1\n4 9\n1 2\n", "actual_output": "[[1, 2], [4, 9]]\n1\n1\n", "expected_output": "1\n\n", "anno_code": ["n,m=map(int,input().split()) # (0): n=2, m=1\nab=[list(map(int,input().split())) for i in range(n)] # (1): ab\n\nab_sorted = sorted(ab, key=lambda x:(x[0], -x[1])) # (2): ab_sorted\nprint(ab_sorted) # (3): NO CHANGE\n\nnum = 0 # (4): num=0\namount_of_money = 0 # (5): amount_of_money=0\nfor i in range(n): # (6): i=0 (12): i=1\n buy = min(ab_sorted[i][1], m-num) # (7): buy=1 (13): buy=0\n num += buy # (8): num=1 (14): NO CHANGE\n amount_of_money += ab_sorted[i][0] * buy # (9): amount_of_money=1 (15): NO CHANGE\n \n if num >= m: # (10): NO CHANGE (16): NO CHANGE\n print(amount_of_money) # (11): NO CHANGE (17): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m=map(int,input().split())\n ab=[list(map(int,input().split())) for i in range(n)]\n \n ab_sorted = sorted(ab, key=lambda x:(x[0], -x[1]))\n-print(ab_sorted)\n \n num = 0\n amount_of_money = 0\n for i in range(n):\n buy = min(ab_sorted[i][1], m-num)\n num += buy\n amount_of_money += ab_sorted[i][0] * buy\n \n if num >= m:\n print(amount_of_money)\n+ exit(0)\n \n", "FL_content": " n,m=map(int,input().split())\n ab=[list(map(int,input().split())) for i in range(n)]\n \n ab_sorted = sorted(ab, key=lambda x:(x[0], -x[1]))\n-print(ab_sorted)\n \n num = 0\n amount_of_money = 0\n for i in range(n):\n buy = min(ab_sorted[i][1], m-num)\n num += buy\n amount_of_money += ab_sorted[i][0] * buy\n \n if num >= m:\n print(amount_of_money)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u033602950", "problem_id": "p03103", "submission1_id": "s111334685", "submission2_id": "s576382095", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = map(int,input().split())\nli={}\nfor i in range(N):\n\ta,b = map(int,input().split())\n\tli[a]=b\nli=sorted(li.items())\nm_sum=0\nfor k,v in li:\n\tif v 0:\n if A[mise][1] >= nokori: \n yen += A[mise][0]*nokori\n break\n else:\n yen += A[mise][0]*A[mise][1]\n nokori -= A[mise][1]\n mise += 1\nprint(yen)\n ", "code2": "N, M = map(int,input().split())\n\nA = []\nfor i in range(N):\n a,b = map(int,input().split())\n A.append([a,b])\n\nA.sort()\n\n\nnokori = M\nyen = 0\nmise = 0\nwhile nokori > 0:\n if A[mise][1] >= nokori: \n yen += A[mise][0]*nokori\n break\n else:\n yen += A[mise][0]*A[mise][1]\n nokori -= A[mise][1]\n mise += 1\nprint(yen)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589829008", "date2": "1589829025", "bleu_score": "0.9721526881925584", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 9\n6 9\n2 6\n", "actual_output": "[[2, 6], [6, 9]]\n30\n", "expected_output": "30\n\n", "anno_code": ["N, M = map(int,input().split()) # (0): N=2, M=9\n\nA = [] # (1): A=[]\nfor i in range(N): # (2): i=0 (5): i=1 (8): NO CHANGE\n a,b = map(int,input().split()) # (3): a=6, b=9 (6): a=2, b=6\n A.append([a,b]) # (4): A (7): A\n\nA.sort() # (9): A\nprint(A) # (10): NO CHANGE\n\nnokori = M # (11): nokori=9\nyen = 0 # (12): yen=0\nmise = 0 # (13): mise=0\nwhile nokori > 0: # (14): NO CHANGE (19): NO CHANGE\n if A[mise][1] >= nokori: # (15): NO CHANGE (20): NO CHANGE\n yen += A[mise][0]*nokori # (21): yen=30\n break # (22): NO CHANGE\n else:\n yen += A[mise][0]*A[mise][1] # (16): yen=12\n nokori -= A[mise][1] # (17): nokori=3\n mise += 1 # (18): mise=1\nprint(yen)\n "], "anno_status": [true], "diff_content": " N, M = map(int,input().split())\n \n A = []\n for i in range(N):\n a,b = map(int,input().split())\n A.append([a,b])\n \n A.sort()\n-print(A)\n+\n \n nokori = M\n yen = 0\n mise = 0\n while nokori > 0:\n if A[mise][1] >= nokori: \n yen += A[mise][0]*nokori\n break\n else:\n yen += A[mise][0]*A[mise][1]\n nokori -= A[mise][1]\n mise += 1\n print(yen)\n \n", "FL_content": " N, M = map(int,input().split())\n \n A = []\n for i in range(N):\n a,b = map(int,input().split())\n A.append([a,b])\n \n A.sort()\n-print(A)\n \n nokori = M\n yen = 0\n mise = 0\n while nokori > 0:\n if A[mise][1] >= nokori: \n yen += A[mise][0]*nokori\n break\n else:\n yen += A[mise][0]*A[mise][1]\n nokori -= A[mise][1]\n mise += 1\n print(yen)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u081688405", "problem_id": "p03103", "submission1_id": "s028846453", "submission2_id": "s347757773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split(\" \"))\nstores = []\n\nfor i in range(N):\n Ai, Bi = map(int, input().split(\" \"))\n stores.append((Ai, Bi)) \n\nprice = 0\nfor a, b in stores:\n if M <= b:\n price += a * M\n break\n else:\n price += a * b\n M -= b\nprint(price)\n", "code2": "N, M = map(int, input().split(\" \"))\nstores = []\n\nfor i in range(N):\n Ai, Bi = map(int, input().split(\" \"))\n stores.append((Ai, Bi)) \n\nprice = 0\nfor a, b in sorted(stores, key=lambda x: x[0]):\n if M <= b:\n price += a * M\n break\n else:\n price += a * b\n M -= b\nprint(price)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556303487", "date2": "1556303549", "bleu_score": "0.903153626421547", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1], "code1_test_score": 45, "total_score": 103, "input": "2 9\n4 4\n1 12\n", "actual_output": "21\n", "expected_output": "9\n\n", "anno_code": ["N, M = map(int, input().split(\" \")) # (0): N=2, M=9\nstores = [] # (1): stores=[]\n\nfor i in range(N): # (2): i=0 (5): i=1 (8): NO CHANGE\n Ai, Bi = map(int, input().split(\" \")) # (3): Ai=4, Bi=4 (6): Ai=1, Bi=12\n stores.append((Ai, Bi)) # (4): stores=[(4, 4)] (7): stores=[(4, 4), (1, 12)]\n\nprice = 0 # (9): price=0\nfor a, b in stores: # (10): a=4, b=4 (14): a=1, b=12\n if M <= b: # (11): NO CHANGE (15): NO CHANGE\n price += a * M # (16): price=21\n break # (17): NO CHANGE\n else:\n price += a * b # (12): price=16\n M -= b # (13): M=5\nprint(price)\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split(\" \"))\n stores = []\n \n for i in range(N):\n Ai, Bi = map(int, input().split(\" \"))\n stores.append((Ai, Bi)) \n \n price = 0\n-for a, b in stores:\n+for a, b in sorted(stores, key=lambda x: x[0]):\n if M <= b:\n price += a * M\n break\n else:\n price += a * b\n M -= b\n print(price)\n \n", "FL_content": " N, M = map(int, input().split(\" \"))\n stores = []\n \n for i in range(N):\n Ai, Bi = map(int, input().split(\" \"))\n stores.append((Ai, Bi)) \n \n price = 0\n-for a, b in stores:\n if M <= b:\n price += a * M\n break\n else:\n price += a * b\n M -= b\n print(price)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u285443936", "problem_id": "p03633", "submission1_id": "s064383062", "submission2_id": "s246709876", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nT = [int(input()) for i in range(N)]\n\ndvs = []\ndvs_all = []\n\ndef gcd(m,n):\n x = max(m,n)\n y = min(m,n)\n if x%y == 0:\n return y\n else:\n while x%y != 0:\n z = x%y\n x = y\n y = z\n else:\n return z\n\ndef lcm(m,n):\n return m * n / gcd(m,n)\n\nif N == 1:\n ans = T[0]\nelse:\n for i in range(N - 1):\n T[i+1] = lcm(T[i], T[i+1])\n ans = T[i+1]\n\nprint(ans)", "code2": "N = int(input())\nT = [int(input()) for i in range(N)]\n\ndef gcd(m,n):\n x = max(m,n)\n y = min(m,n)\n if x%y == 0:\n return y\n else:\n while x%y != 0:\n z = x%y\n x = y\n y = z\n else:\n return z\n\ndef lcm(m,n):\n return int(m * n \n\nans = 1\nfor i in range(N):\n ans = lcm(T[i], ans)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553897535", "date2": "1553897916", "bleu_score": "0.7402344897223895", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 86, "input": "5\n1\n14\n3\n1101000001000001000\n1100000010001011000\n", "actual_output": "9.934804786848983e+34\n", "expected_output": "1211100012111114221001021001011000\n\n", "anno_code": ["N = int(input()) # (0): N=5\nT = [int(input()) for i in range(N)] # (1): T=[1, 14, 3, 1101000001000001000, 1100000010001011000]\n\ndvs = [] # (2): dvs=[]\ndvs_all = [] # (3): dvs_all=[]\n\ndef gcd(m,n): # (4): gcd=\n x = max(m,n) # (9): x=14 (15): x=14.0 ... (45): x=23121000021000019968\n y = min(m,n) # (10): y=1 (16): y=3 ... (46): y=1100000010001011000\n if x%y == 0: # (11): N=5, T=[1, 14.0, 3, 1101000001000001000, 1100000010001011000], dvs=[], dvs_all=[], gcd=, lcm=, i=0 (17): NO CHANGE ... (47): NO CHANGE\n return y\n else:\n while x%y != 0: # (18): NO CHANGE (22): NO CHANGE ... (168): N=5, T=[1, 14.0, 42.0, 2.312100002100002e+19, 9.934804786848983e+34], dvs=[], dvs_all=[], gcd=, lcm=, i=3, ans=23121000021000019968\n z = x%y # (19): z=2.0 (23): z=1.0 ... (165): z=256.0\n x = y # (20): x=3 (24): x=2.0 ... (166): x=512.0\n y = z # (21): y=2.0 (25): y=1.0 ... (167): y=256.0\n else:\n return z\n\ndef lcm(m,n): # (5): lcm=\n return m * n / gcd(m,n)\n\nif N == 1: # (6): NO CHANGE\n ans = T[0]\nelse:\n for i in range(N - 1): # (7): i=0 (13): i=1 ... (170): NO CHANGE\n T[i+1] = lcm(T[i], T[i+1]) # (8): m=1, n=14 (14): m=14.0, n=3 ... (44): m=23121000021000019968, n=1100000010001011000\n ans = T[i+1] # (12): ans=14.0 (27): ans=42.0 ... (169): ans=99348047868489828343438808604213248\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n T = [int(input()) for i in range(N)]\n \n-dvs = []\n-dvs_all = []\n-\n def gcd(m,n):\n x = max(m,n)\n y = min(m,n)\n if x%y == 0:\n return y\n else:\n while x%y != 0:\n z = x%y\n x = y\n y = z\n else:\n return z\n \n def lcm(m,n):\n- return m * n / gcd(m,n)\n+ return int(m * n \n \n-if N == 1:\n- ans = T[0]\n-else:\n- for i in range(N - 1):\n- T[i+1] = lcm(T[i], T[i+1])\n- ans = T[i+1]\n+ans = 1\n+for i in range(N):\n+ ans = lcm(T[i], ans)\n \n print(ans)\n", "FL_content": " N = int(input())\n T = [int(input()) for i in range(N)]\n \n-dvs = []\n-dvs_all = []\n-\n def gcd(m,n):\n x = max(m,n)\n y = min(m,n)\n if x%y == 0:\n return y\n else:\n while x%y != 0:\n z = x%y\n x = y\n y = z\n else:\n return z\n \n def lcm(m,n):\n- return m * n / gcd(m,n)\n \n-if N == 1:\n- ans = T[0]\n-else:\n- for i in range(N - 1):\n- T[i+1] = lcm(T[i], T[i+1])\n- ans = T[i+1]\n \n print(ans)\n", "added_lines": 4, "removed_lines": 10, "code1_lines": 30 }, { "user_id": "u905510147", "problem_id": "p03633", "submission1_id": "s242129472", "submission2_id": "s133329058", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(100000)\n\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\nlcm = 1\nfor i in T:\n lcm = lcm * i / gcd(lcm, i)\n\nprint(lcm)", "code2": "import sys\nsys.setrecursionlimit(100000)\n\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\nlcm = 1\nfor i in T:\n lcm = int(lcm * i \n\nprint(lcm)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1539397919", "date2": "1539398019", "bleu_score": "0.939129593171834", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 86, "input": "5\n1\n13\n3\n0101000001000001000\n1100000000011011000\n", "actual_output": "3.3850781585495427e+34\n", "expected_output": "1444300014314471743143143143143000\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(100000) # (0): NO CHANGE\n\nN = int(input()) # (1): N=5\nT = [] # (2): T=[]\nfor i in range(N): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n T.append(int(input())) # (4): T=[1] (6): T=[1, 13] ... (12): T=[1, 13, 3, 101000001000001000, 1100000000011011000]\n\ndef gcd(a, b): # (14): gcd=\n while b: # (18): NO CHANGE (20): sys=, N=5, T=[1, 13, 3, 101000001000001000, 1100000000011011000], i=1, gcd=, lcm=1.0 ... (120): sys=, N=5, T=[1, 13, 3, 101000001000001000, 1100000000011011000], i=1100000000011011000, gcd=, lcm=33850781585495426811987734204252160\n a, b = b, a % b # (19): b=0 (24): a=13, b=1.0 ... (119): a=128.0, b=0.0\n return a\n\nlcm = 1 # (15): lcm=1\nfor i in T: # (16): i=1 (21): i=13 ... (121): NO CHANGE\n lcm = lcm * i / gcd(lcm, i) # (17): a=1, b=1 (22): a=1.0, b=13 ... (53): a=3939000039000038912, b=1100000000011011000\n\nprint(lcm)"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(100000)\n \n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n \n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n \n lcm = 1\n for i in T:\n- lcm = lcm * i / gcd(lcm, i)\n+ lcm = int(lcm * i \n \n print(lcm)\n", "FL_content": " import sys\n sys.setrecursionlimit(100000)\n \n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n \n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n \n lcm = 1\n for i in T:\n- lcm = lcm * i / gcd(lcm, i)\n \n print(lcm)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u415905784", "problem_id": "p03633", "submission1_id": "s960432154", "submission2_id": "s130550244", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import functools\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a, b):\n if a < b:\n a, b = b, a\n if b == 0:\n return a\n return gcd(b, b % a)\n \ndef lcm(A, B):\n return A * B \n \nprint(functools.reduce(lcm, T))", "code2": "import functools\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\ndef gcd(A, B):\n while(True):\n if A and B:\n if A > B:\n A = A % B\n else:\n B = B % A\n else:\n return max(A, B)\n \ndef lcm(A, B):\n return (A \n \nprint(functools.reduce(lcm, sorted(T, reverse=True)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1530417030", "date2": "1530417489", "bleu_score": "0.608084964788778", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 3, "total_score": 86, "input": "5\n1\n5\n10\n0000000001000000000\n1000001000000000000\n", "actual_output": "50000050000000000000000000000\n", "expected_output": "1000001000000000000\n\n", "anno_code": ["import functools\nN = int(input()) # (0): N=5\nT = [] # (1): T=[]\nfor i in range(N): # (2): i=0 (4): i=1 ... (12): NO CHANGE\n T.append(int(input())) # (3): T=[1] (5): T=[1, 5] ... (11): T=[1, 5, 10, 1000000000, 1000001000000000000]\n\ndef gcd(a, b): # (13): gcd=\n if a < b:\n a, b = b, a\n if b == 0:\n return a\n return gcd(b, b % a)\n \ndef lcm(A, B): # (14): lcm=\n return A * B \n \nprint(functools.reduce(lcm, T))"], "anno_status": [true], "diff_content": " import functools\n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n-\n-def gcd(a, b):\n- if a < b:\n- a, b = b, a\n- if b == 0:\n- return a\n- return gcd(b, b % a)\n+def gcd(A, B):\n+ while(True):\n+ if A and B:\n+ if A > B:\n+ A = A % B\n+ else:\n+ B = B % A\n+ else:\n+ return max(A, B)\n \n def lcm(A, B):\n- return A * B \n+ return (A \n \n-print(functools.reduce(lcm, T))\n+print(functools.reduce(lcm, sorted(T, reverse=True)))\n", "FL_content": " import functools\n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n-\n-def gcd(a, b):\n- if a < b:\n- a, b = b, a\n- if b == 0:\n- return a\n- return gcd(b, b % a)\n \n def lcm(A, B):\n- return A * B \n \n-print(functools.reduce(lcm, T))\n", "added_lines": 11, "removed_lines": 9, "code1_lines": 17 }, { "user_id": "u462329577", "problem_id": "p03633", "submission1_id": "s161876678", "submission2_id": "s154730078", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a,b):\n mi = min(a,b)\n ma = max(a,b)\n ans = 1\n \n while True:\n print(ma,mi)\n if (ma % mi) == 0:\n ans = mi\n break\n else:\n mi = ma%mi\n ma = mi\n \n return ans\n\n\n\ndef lcm(a,b):\n \n g = gcd(a,b)\n print(g)\n return int(a*b/g)\nans = T[0]\nfor i in range(1,len(T)):\n ans = lcm(ans,T[i])\nprint(ans)\n", "code2": "\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a,b): \n if min(a,b) == 0:\n return max(a,b)\n else:\n return gcd(min(a,b),max(a,b)%min(a,b))\n \n\n\n\ndef lcm(a,b):\n \n g = gcd(a,b)\n \n return int(a*b\nans = T[0]\nfor i in range(1,len(T)):\n ans = lcm(ans,T[i])\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1561430264", "date2": "1561430776", "bleu_score": "0.6329006220562572", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 86, "input": "2\n7\n9\n", "actual_output": "9 7\n2 2\n2\n31\n", "expected_output": "63\n\n", "anno_code": ["\nN = int(input()) # (0): N=2\nT = [] # (1): T=[]\nfor i in range(N): # (2): i=0 (4): i=1 (6): NO CHANGE\n T.append(int(input())) # (3): T=[7] (5): T=[7, 9]\n\ndef gcd(a,b): # (7): gcd=\n mi = min(a,b) # (13): mi=7\n ma = max(a,b) # (14): ma=9\n ans = 1 # (15): ans=1\n \n while True: # (16): NO CHANGE (21): NO CHANGE\n print(ma,mi) # (17): NO CHANGE (22): NO CHANGE\n if (ma % mi) == 0: # (18): NO CHANGE (23): NO CHANGE\n ans = mi # (24): ans=2\n break # (25): g=2\n else:\n mi = ma%mi # (19): mi=2\n ma = mi # (20): ma=2\n \n return ans\n\n\n\ndef lcm(a,b): # (8): lcm=\n \n g = gcd(a,b) # (12): NO CHANGE\n print(g) # (26): N=2, T=[7, 9], i=1, gcd=, lcm=, ans=31\n return int(a*b/g)\nans = T[0] # (9): ans=7\nfor i in range(1,len(T)): # (10): NO CHANGE (27): NO CHANGE\n ans = lcm(ans,T[i]) # (11): a=7, b=9\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n \n-def gcd(a,b):\n- mi = min(a,b)\n- ma = max(a,b)\n- ans = 1\n- \n- while True:\n- print(ma,mi)\n- if (ma % mi) == 0:\n- ans = mi\n- break\n- else:\n- mi = ma%mi\n- ma = mi\n- \n- return ans\n+def gcd(a,b): \n+ if min(a,b) == 0:\n+ return max(a,b)\n+ else:\n+ return gcd(min(a,b),max(a,b)%min(a,b))\n+ \n \n \n \n def lcm(a,b):\n \n g = gcd(a,b)\n- print(g)\n- return int(a*b/g)\n+ \n+ return int(a*b\n ans = T[0]\n for i in range(1,len(T)):\n ans = lcm(ans,T[i])\n print(ans)\n \n", "FL_content": " \n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n \n-def gcd(a,b):\n- mi = min(a,b)\n- ma = max(a,b)\n- ans = 1\n- \n- while True:\n- print(ma,mi)\n- if (ma % mi) == 0:\n- ans = mi\n- break\n- else:\n- mi = ma%mi\n- ma = mi\n- \n- return ans\n \n \n \n def lcm(a,b):\n \n g = gcd(a,b)\n- print(g)\n- return int(a*b/g)\n ans = T[0]\n for i in range(1,len(T)):\n ans = lcm(ans,T[i])\n print(ans)\n \n", "added_lines": 8, "removed_lines": 17, "code1_lines": 34 }, { "user_id": "u557437077", "problem_id": "p03633", "submission1_id": "s896669902", "submission2_id": "s017475858", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a, b):\n while b > 0:\n tmp = a\n a = b\n b = tmp % b\n return a\n\n\ndef lcm(a, b):\n return a*b \n\n\nn = int(input())\nt = [0 for i in range(n)]\nfor i in range(n):\n t[i] = int(input())\nsum = t[0]\nfor i in range(1, n):\n \n sum = lcm(sum, t[i])\n \nprint(sum)\n", "code2": "def gcd(a, b):\n while b > 0:\n tmp = a\n a = b\n b = tmp % b\n return a\n\n\ndef lcm(a, b):\n tmp = gcd(a, b)\n return (a\n\n\nn = int(input())\nt = [0 for i in range(n)]\nfor i in range(n):\n t[i] = int(input())\nt = sorted(t)\n_sum = t[0]\nfor i in range(1, n):\n \n _sum = lcm(_sum, t[i])\n \nprint(_sum)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542871940", "date2": "1545082513", "bleu_score": "0.8600323192045245", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 3, "total_score": 86, "input": "5\n1\n29\n2\n1011000001000101000\n1100000000011011000\n", "actual_output": "64501800064452106818638702502438000000\n", "expected_output": "10750300010742017803106450417073000\n\n", "anno_code": ["def gcd(a, b): # (0): gcd=\n while b > 0:\n tmp = a\n a = b\n b = tmp % b\n return a\n\n\ndef lcm(a, b): # (1): lcm=\n return a*b \n\n\nn = int(input()) # (2): n=5\nt = [0 for i in range(n)] # (3): t=[0, 0, 0, 0, 0]\nfor i in range(n): # (4): i=0 (6): i=1 ... (14): NO CHANGE\n t[i] = int(input()) # (5): t=[1, 0, 0, 0, 0] (7): t=[1, 29, 0, 0, 0] ... (13): t=[1, 29, 2, 1011000001000101000, 1100000000011011000]\nsum = t[0] # (15): sum=1\nfor i in range(1, n): # (16): i=1 (18): i=2 ... (24): NO CHANGE\n \n sum = lcm(sum, t[i]) # (17): sum=29 (19): sum=58 ... (23): sum=64501800064452106818638702502438000000\n \nprint(sum)\n"], "anno_status": [true], "diff_content": " def gcd(a, b):\n while b > 0:\n tmp = a\n a = b\n b = tmp % b\n return a\n \n \n def lcm(a, b):\n- return a*b \n+ tmp = gcd(a, b)\n+ return (a\n \n \n n = int(input())\n t = [0 for i in range(n)]\n for i in range(n):\n t[i] = int(input())\n-sum = t[0]\n+t = sorted(t)\n+_sum = t[0]\n for i in range(1, n):\n \n- sum = lcm(sum, t[i])\n+ _sum = lcm(_sum, t[i])\n \n-print(sum)\n+print(_sum)\n \n", "FL_content": " def gcd(a, b):\n while b > 0:\n tmp = a\n a = b\n b = tmp % b\n return a\n \n \n def lcm(a, b):\n- return a*b \n \n \n n = int(input())\n t = [0 for i in range(n)]\n for i in range(n):\n t[i] = int(input())\n-sum = t[0]\n for i in range(1, n):\n \n- sum = lcm(sum, t[i])\n \n-print(sum)\n \n", "added_lines": 6, "removed_lines": 4, "code1_lines": 23 }, { "user_id": "u905715926", "problem_id": "p03633", "submission1_id": "s876093087", "submission2_id": "s142589189", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a,b):\n r = a%b\n while(r!=0):\n a=b\n b=r\n r=a%b\n return b\ndef lcm(a,b):\n return (a*b)/gcd(a,b)\nn = int(input())\nans = int(input())\nfor i in range(n-1):\n num = int(input())\n ans = lcm(max(ans,num),min(ans,num))\nprint(int(ans))\n", "code2": "def gcd(a,b):\n a = int(a)\n b = int(b)\n r = (int)(a%b)\n while(r!=0):\n a=(int)(b)\n b=(int)(r)\n r=(int)(a%b)\n return b\ndef lcm(a,b):\n return int((a*b)\nn = int(input())\nans = int(input())\nfor i in range(n-1):\n num = int(input())\n ans = lcm(max(ans,num),min(ans,num))\nprint(int(ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552526372", "date2": "1552527258", "bleu_score": "0.7687992576403209", "code1_test_status": [0, 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, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 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, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 12, "total_score": 86, "input": "5\n1\n26\n3\n1011000001000101100\n1100000000011011000\n", "actual_output": "112947656362860663984245420161236992\n", "expected_output": "144573000144461633031431574717573000\n\n", "anno_code": ["def gcd(a,b): # (0): gcd=\n r = a%b # (7): r=0 (12): r=2.0 ... (42): r=1043000012880195968\n while(r!=0): # (8): gcd=, lcm=, n=5, ans=26.0, i=0, num=26 (13): NO CHANGE ... (191): gcd=, lcm=, n=5, ans=112947656362860663984245420161236992, i=3, num=1100000000011011000\n a=b # (14): a=3 (18): a=2.0 ... (188): a=256.0\n b=r # (15): b=2.0 (19): b=1.0 ... (189): b=128.0\n r=a%b # (16): r=1.0 (20): r=0.0 ... (190): r=0.0\n return b\ndef lcm(a,b): # (1): lcm=\n return (a*b)/gcd(a,b)\nn = int(input()) # (2): n=5\nans = int(input()) # (3): ans=1\nfor i in range(n-1): # (4): i=0 (9): i=1 ... (192): NO CHANGE\n num = int(input()) # (5): num=26 (10): num=3 ... (40): num=1100000000011011000\n ans = lcm(max(ans,num),min(ans,num)) # (6): a=26, b=1 (11): a=26.0, b=3 ... (41): a=13143000013001316352, b=1100000000011011000\nprint(int(ans))\n"], "anno_status": [true], "diff_content": " def gcd(a,b):\n- r = a%b\n+ a = int(a)\n+ b = int(b)\n+ r = (int)(a%b)\n while(r!=0):\n- a=b\n- b=r\n- r=a%b\n+ a=(int)(b)\n+ b=(int)(r)\n+ r=(int)(a%b)\n return b\n def lcm(a,b):\n- return (a*b)/gcd(a,b)\n+ return int((a*b)\n n = int(input())\n ans = int(input())\n for i in range(n-1):\n num = int(input())\n ans = lcm(max(ans,num),min(ans,num))\n print(int(ans))\n \n", "FL_content": " def gcd(a,b):\n- r = a%b\n while(r!=0):\n- a=b\n- b=r\n- r=a%b\n return b\n def lcm(a,b):\n- return (a*b)/gcd(a,b)\n n = int(input())\n ans = int(input())\n for i in range(n-1):\n num = int(input())\n ans = lcm(max(ans,num),min(ans,num))\n print(int(ans))\n \n", "added_lines": 7, "removed_lines": 5, "code1_lines": 16 }, { "user_id": "u462329577", "problem_id": "p03633", "submission1_id": "s799705392", "submission2_id": "s154730078", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a,b):\n mi = min(a,b)\n ma = max(a,b)\n ans = 1\n \n while True:\n \n if (ma % mi) == 0:\n ans = mi\n break\n else:\n mi = ma%mi\n ma = mi\n \n return ans\n\n\n\ndef lcm(a,b):\n \n g = gcd(a,b)\n \n return int(a*b/g)\nans = T[0]\nfor i in range(1,len(T)):\n ans = lcm(ans,T[i])\nprint(ans)\n", "code2": "\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a,b): \n if min(a,b) == 0:\n return max(a,b)\n else:\n return gcd(min(a,b),max(a,b)%min(a,b))\n \n\n\n\ndef lcm(a,b):\n \n g = gcd(a,b)\n \n return int(a*b\nans = T[0]\nfor i in range(1,len(T)):\n ans = lcm(ans,T[i])\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1561430316", "date2": "1561430776", "bleu_score": "0.6703623268034676", "code1_test_status": [0, 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, 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, 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, 0, 0, 0, 0, 1], "code1_test_score": 10, "total_score": 86, "input": "5\n2\n58\n2\n1011000001000101100\n1100100000011011000\n", "actual_output": "11058709324013029376\n", "expected_output": "322538319322289568925093512831509000\n\n", "anno_code": ["\nN = int(input()) # (0): N=5\nT = [] # (1): T=[]\nfor i in range(N): # (2): i=0 (4): i=1 ... (12): NO CHANGE\n T.append(int(input())) # (3): T=[2] (5): T=[2, 58] ... (11): T=[2, 58, 2, 1011000001000101100, 1100100000011011000]\n\ndef gcd(a,b): # (13): gcd=\n mi = min(a,b) # (19): mi=2 (29): mi=2 ... (53): mi=1100100000011011000\n ma = max(a,b) # (20): ma=58 (30): ma=58 ... (54): ma=9773000009667643392\n ans = 1 # (21): ans=1 (31): ans=1 ... (55): ans=1\n \n while True: # (22): NO CHANGE (32): NO CHANGE ... (60): NO CHANGE\n \n if (ma % mi) == 0: # (23): NO CHANGE (33): NO CHANGE ... (61): NO CHANGE\n ans = mi # (24): ans=2 (34): ans=2 ... (62): ans=972200009579555392\n break # (25): N=5, T=[2, 58, 2, 1011000001000101100, 1100100000011011000], i=1, gcd=, lcm=, ans=58 (35): N=5, T=[2, 58, 2, 1011000001000101100, 1100100000011011000], i=2, gcd=, lcm=, ans=58 ... (63): N=5, T=[2, 58, 2, 1011000001000101100, 1100100000011011000], i=4, gcd=, lcm=, ans=11058709324013029376\n else:\n mi = ma%mi # (44): mi=6 (58): mi=972200009579555392\n ma = mi # (45): ma=6 (59): ma=972200009579555392\n \n return ans\n\n\n\ndef lcm(a,b): # (14): lcm=\n \n g = gcd(a,b) # (18): NO CHANGE (28): NO CHANGE ... (52): NO CHANGE\n \n return int(a*b/g)\nans = T[0] # (15): ans=2\nfor i in range(1,len(T)): # (16): i=1 (26): i=2 ... (64): NO CHANGE\n ans = lcm(ans,T[i]) # (17): a=2, b=58 (27): a=58, b=2 ... (51): a=9773000009667643392, b=1100100000011011000\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n \n-def gcd(a,b):\n- mi = min(a,b)\n- ma = max(a,b)\n- ans = 1\n- \n- while True:\n+def gcd(a,b): \n+ if min(a,b) == 0:\n+ return max(a,b)\n+ else:\n+ return gcd(min(a,b),max(a,b)%min(a,b))\n \n- if (ma % mi) == 0:\n- ans = mi\n- break\n- else:\n- mi = ma%mi\n- ma = mi\n- \n- return ans\n \n \n \n def lcm(a,b):\n \n g = gcd(a,b)\n \n- return int(a*b/g)\n+ return int(a*b\n ans = T[0]\n for i in range(1,len(T)):\n ans = lcm(ans,T[i])\n print(ans)\n \n", "FL_content": " \n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n \n-def gcd(a,b):\n- mi = min(a,b)\n- ma = max(a,b)\n- ans = 1\n- \n- while True:\n \n- if (ma % mi) == 0:\n- ans = mi\n- break\n- else:\n- mi = ma%mi\n- ma = mi\n- \n- return ans\n \n \n \n def lcm(a,b):\n \n g = gcd(a,b)\n \n- return int(a*b/g)\n ans = T[0]\n for i in range(1,len(T)):\n ans = lcm(ans,T[i])\n print(ans)\n \n", "added_lines": 6, "removed_lines": 15, "code1_lines": 34 }, { "user_id": "u557437077", "problem_id": "p03633", "submission1_id": "s719207795", "submission2_id": "s017475858", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(a, b):\n return a*b \n\n\nn = int(input())\nt = [0 for i in range(n)]\nfor i in range(n):\n t[i] = int(input())\nsum = t[0]\nfor i in range(1, n):\n \n sum = lcm(sum, t[i])\n \nprint(sum)\n", "code2": "def gcd(a, b):\n while b > 0:\n tmp = a\n a = b\n b = tmp % b\n return a\n\n\ndef lcm(a, b):\n tmp = gcd(a, b)\n return (a\n\n\nn = int(input())\nt = [0 for i in range(n)]\nfor i in range(n):\n t[i] = int(input())\nt = sorted(t)\n_sum = t[0]\nfor i in range(1, n):\n \n _sum = lcm(_sum, t[i])\n \nprint(_sum)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542871557", "date2": "1545082513", "bleu_score": "0.7502418458648429", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 3, "total_score": 86, "input": "5\n2\n4\n10\n0001000001000000000\n1000000000000100001\n", "actual_output": "80000080000008000088000080000000000\n", "expected_output": "1000001000000100001100001000000000\n\n", "anno_code": ["def gcd(a, b): # (0): gcd=\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(a, b): # (1): lcm=\n return a*b \n\n\nn = int(input()) # (2): n=5\nt = [0 for i in range(n)] # (3): t=[0, 0, 0, 0, 0]\nfor i in range(n): # (4): i=0 (6): i=1 ... (14): NO CHANGE\n t[i] = int(input()) # (5): t=[2, 0, 0, 0, 0] (7): t=[2, 4, 0, 0, 0] ... (13): t=[2, 4, 10, 1000001000000000, 1000000000000100001]\nsum = t[0] # (15): sum=2\nfor i in range(1, n): # (16): i=1 (18): i=2 ... (24): NO CHANGE\n \n sum = lcm(sum, t[i]) # (17): sum=8 (19): sum=80 ... (23): sum=80000080000008000088000080000000000\n \nprint(sum)\n"], "anno_status": [true], "diff_content": " def gcd(a, b):\n- while b:\n- a, b = b, a % b\n+ while b > 0:\n+ tmp = a\n+ a = b\n+ b = tmp % b\n return a\n \n \n def lcm(a, b):\n- return a*b \n+ tmp = gcd(a, b)\n+ return (a\n \n \n n = int(input())\n t = [0 for i in range(n)]\n for i in range(n):\n t[i] = int(input())\n-sum = t[0]\n+t = sorted(t)\n+_sum = t[0]\n for i in range(1, n):\n \n- sum = lcm(sum, t[i])\n+ _sum = lcm(_sum, t[i])\n \n-print(sum)\n+print(_sum)\n \n", "FL_content": " def gcd(a, b):\n- while b:\n- a, b = b, a % b\n return a\n \n \n def lcm(a, b):\n- return a*b \n \n \n n = int(input())\n t = [0 for i in range(n)]\n for i in range(n):\n t[i] = int(input())\n-sum = t[0]\n for i in range(1, n):\n \n- sum = lcm(sum, t[i])\n \n-print(sum)\n \n", "added_lines": 10, "removed_lines": 6, "code1_lines": 21 }, { "user_id": "u069868485", "problem_id": "p03633", "submission1_id": "s631496608", "submission2_id": "s472823512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def uq(a,c):\n while(a%c!=0):\n newa=c\n c=a%c\n a=newa\n return c\n \n\nn=(int)(input())\n\nresult = 1\n\nfor j in range(0,n):\n f=(int)(input())\n result=((result/uq(result,f)))*f\n \nprint((int)(result))", "code2": "def uq(a,c):\n return c if a%c==0 else uq(c,a%c)\n\nn=(int)(input())\n\nresult = 1\n\nfor j in range(0,n):\n f=(int)(input())\n result=((result\n \nprint((int)(result))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1502604108", "date2": "1502604530", "bleu_score": "0.6059140533246857", "code1_test_status": [0, 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, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 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, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 12, "total_score": 86, "input": "5\n2\n5\n10\n1000000001000000000\n1000000000000000000\n", "actual_output": "1000000001000000066313781248\n", "expected_output": "1000000001000000000000000000\n\n", "anno_code": ["def uq(a,c): # (0): uq=\n while(a%c!=0): # (6): NO CHANGE (10): uq=, n=5, result=2.0, j=0, f=2 ... (42): uq=, n=5, result=1000000001000000066313781248, j=4, f=1000000000000000000\n newa=c # (7): newa=2 (15): newa=5 ... (39): newa=1000000000000000000\n c=a%c # (8): c=1 (16): c=2.0 ... (40): c=1000000000.0\n a=newa # (9): a=2 (17): a=5 ... (41): a=1000000000000000000\n return c\n \n\nn=(int)(input()) # (1): n=5\n\nresult = 1 # (2): result=1\n\nfor j in range(0,n): # (3): j=0 (11): j=1 ... (43): NO CHANGE\n f=(int)(input()) # (4): f=2 (12): f=5 ... (36): f=1000000000000000000\n result=((result/uq(result,f)))*f # (5): a=1, c=2 (13): a=2.0, c=5 ... (37): a=1000000001000000000, c=1000000000000000000\n \nprint((int)(result))"], "anno_status": [true], "diff_content": " def uq(a,c):\n- while(a%c!=0):\n- newa=c\n- c=a%c\n- a=newa\n- return c\n- \n+ return c if a%c==0 else uq(c,a%c)\n \n n=(int)(input())\n \n result = 1\n \n for j in range(0,n):\n f=(int)(input())\n- result=((result/uq(result,f)))*f\n+ result=((result\n \n print((int)(result))\n", "FL_content": " def uq(a,c):\n- while(a%c!=0):\n- newa=c\n- c=a%c\n- a=newa\n- return c\n- \n \n n=(int)(input())\n \n result = 1\n \n for j in range(0,n):\n f=(int)(input())\n- result=((result/uq(result,f)))*f\n \n print((int)(result))\n", "added_lines": 2, "removed_lines": 7, "code1_lines": 17 }, { "user_id": "u415905784", "problem_id": "p03633", "submission1_id": "s252908653", "submission2_id": "s130550244", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nimport functools\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\n\ndef gcd(a, b):\n if a < b:\n a, b = b, a\n if b == 0:\n return a\n return gcd(b, b % a)\n \ndef lcm(A, B):\n return A * B \n \nprint(functools.reduce(lcm, sorted(T, reverse=True)))", "code2": "import functools\nN = int(input())\nT = []\nfor i in range(N):\n T.append(int(input()))\ndef gcd(A, B):\n while(True):\n if A and B:\n if A > B:\n A = A % B\n else:\n B = B % A\n else:\n return max(A, B)\n \ndef lcm(A, B):\n return (A \n \nprint(functools.reduce(lcm, sorted(T, reverse=True)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1530416674", "date2": "1530417489", "bleu_score": "0.6852418760125296", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 3, "total_score": 86, "input": "5\n1\n6\n9\n1001000001000000000\n1100000000000000000\n", "actual_output": "59459400059400000000000000000000000000\n", "expected_output": "3303300003300000000000000000\n\n", "anno_code": ["import math\nimport functools\nN = int(input()) # (0): N=5\nT = [] # (1): T=[]\nfor i in range(N): # (2): i=0 (4): i=1 ... (12): NO CHANGE\n T.append(int(input())) # (3): T=[1] (5): T=[1, 6] ... (11): T=[1, 6, 9, 1001000001000000000, 1100000000000000000]\n\ndef gcd(a, b): # (13): gcd=\n if a < b:\n a, b = b, a\n if b == 0:\n return a\n return gcd(b, b % a)\n \ndef lcm(A, B): # (14): lcm=\n return A * B \n \nprint(functools.reduce(lcm, sorted(T, reverse=True)))"], "anno_status": [true], "diff_content": "-import math\n import functools\n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n-\n-def gcd(a, b):\n- if a < b:\n- a, b = b, a\n- if b == 0:\n- return a\n- return gcd(b, b % a)\n+def gcd(A, B):\n+ while(True):\n+ if A and B:\n+ if A > B:\n+ A = A % B\n+ else:\n+ B = B % A\n+ else:\n+ return max(A, B)\n \n def lcm(A, B):\n- return A * B \n+ return (A \n \n print(functools.reduce(lcm, sorted(T, reverse=True)))\n", "FL_content": "-import math\n import functools\n N = int(input())\n T = []\n for i in range(N):\n T.append(int(input()))\n-\n-def gcd(a, b):\n- if a < b:\n- a, b = b, a\n- if b == 0:\n- return a\n- return gcd(b, b % a)\n \n def lcm(A, B):\n- return A * B \n \n print(functools.reduce(lcm, sorted(T, reverse=True)))\n", "added_lines": 10, "removed_lines": 9, "code1_lines": 18 }, { "user_id": "u644907318", "problem_id": "p03633", "submission1_id": "s220987769", "submission2_id": "s553723283", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(x,y):\n if x0:\n x,y = y,x%y\n return x\nN = int(input())\nT = list(set([int(input()) for _ in range(N)]))\na = T[0]\nfor i in range(1,len(T)):\n a = gcd(T[i],a)\nt = a\nfor i in range(len(T)):\n t *= T[i]\nprint(t)", "code2": "def gcd(x,y):\n if x0:\n x,y = y,x%y\n return x\nN = int(input())\nT = list(set([int(input()) for _ in range(N)]))\nt = 1\nb = T[0]\nfor i in range(1,len(T)):\n a = gcd(T[i],b)\n b = a*(T[i]\nprint(b)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571269228", "date2": "1571269712", "bleu_score": "0.855639056428197", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 3, "total_score": 86, "input": "5\n2\n57\n2\n1011000001000101100\n1100000000011011000\n", "actual_output": "126779400126681739735255380906179400000\n", "expected_output": "211299000211136232892092301510299000\n\n", "anno_code": ["def gcd(x,y): # (0): gcd=\n if x0: # (8): NO CHANGE (10): NO CHANGE ... (29): gcd=, N=5, T=[1100000000011011000, 57, 2, 1011000001000101100], a=1, i=3\n x,y = y,x%y # (9): x=57, y=9 (11): x=9, y=3 ... (28): x=1, y=0\n return x\nN = int(input()) # (1): N=5\nT = list(set([int(input()) for _ in range(N)])) # (2): T=[1100000000011011000, 57, 2, 1011000001000101100]\na = T[0] # (3): a=1100000000011011000\nfor i in range(1,len(T)): # (4): i=1 (15): i=2 ... (30): NO CHANGE\n a = gcd(T[i],a) # (5): x=57, y=1100000000011011000 (16): x=2, y=3 (25): x=1011000001000101100, y=1\nt = a # (31): t=1\nfor i in range(len(T)): # (32): i=0 (34): i=1 ... (40): NO CHANGE\n t *= T[i] # (33): t=1100000000011011000 (35): t=62700000000627627000 ... (39): t=126779400126681739735255380906179400000\nprint(t)"], "anno_status": [true], "diff_content": " def gcd(x,y):\n if x0:\n x,y = y,x%y\n return x\n N = int(input())\n T = list(set([int(input()) for _ in range(N)]))\n-a = T[0]\n+t = 1\n+b = T[0]\n for i in range(1,len(T)):\n- a = gcd(T[i],a)\n-t = a\n-for i in range(len(T)):\n- t *= T[i]\n-print(t)\n+ a = gcd(T[i],b)\n+ b = a*(T[i]\n+print(b)\n", "FL_content": " def gcd(x,y):\n if x0:\n x,y = y,x%y\n return x\n N = int(input())\n T = list(set([int(input()) for _ in range(N)]))\n-a = T[0]\n for i in range(1,len(T)):\n- a = gcd(T[i],a)\n-t = a\n-for i in range(len(T)):\n- t *= T[i]\n-print(t)\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 15 }, { "user_id": "u284854859", "problem_id": "p03274", "submission1_id": "s160200140", "submission2_id": "s117837515", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport bisect \nn,k = map(int,input().split())\nx = list(map(int,input().split()))\n\nw = x.count(0)\nfor i in range(w):\n x.remove(0)\n\nif k <= w:\n print(0)\nelse:\n k = k -w\n \n\n r = bisect.bisect_left(x,0)\n \n if x[-1]<0:\n print(x[len(x)-k])\n else:\n ass = 10 ** 10\n for i in range(r,min(len(x),r + k )):\n if i-r+1 >= k:\n ans = abs(x[i])\n elif i == r and r-k >= 0:\n ans = abs(x[r-k])\n else:\n ans = x[i] + abs(x[i-k+1]) + min(x[i],abs(x[i-k+1]))\n ass = min(ass,ans)\n print(ass)", "code2": "\nimport bisect \nn,k = map(int,input().split())\nx = list(map(int,input().split()))\n\nw = x.count(0)\nfor i in range(w):\n x.remove(0)\n\nif k <= w:\n print(0)\nelse:\n k = k -w\n \n\n r = bisect.bisect_left(x,0)\n \n if x[-1]<0:\n print(abs(x[len(x)-k]))\n elif x[0] > 0:\n print(x[k-1]) \n else:\n ass = 10 ** 10\n ans = 10**10\n for i in range(r,min(len(x),r + k )):\n if i-r+1 >= k:\n ans = abs(x[i])\n \n else:\n if i - k + 1 >= 0:\n ans = x[i] + abs(x[i-k+1]) + min(x[i],abs(x[i-k+1]))\n ass = min(ass,ans)\n if r-k >= 0:\n ans = abs(x[r-k])\n ass = min(ass,ans)\n print(ass)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535249136", "date2": "1535250186", "bleu_score": "0.8152183362523182", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 42, "total_score": 103, "input": "5 5\n-50 -10 10 20 50\n", "actual_output": "40\n", "expected_output": "150\n\n", "anno_code": ["\nimport bisect \nn,k = map(int,input().split()) # (0): n=5, k=5\nx = list(map(int,input().split())) # (1): x=[-50, -10, 10, 20, 50]\n\nw = x.count(0) # (2): w=0\nfor i in range(w): # (3): NO CHANGE\n x.remove(0)\n\nif k <= w: # (4): NO CHANGE\n print(0)\nelse:\n k = k -w # (5): NO CHANGE\n \n\n r = bisect.bisect_left(x,0) # (6): r=2\n \n if x[-1]<0: # (7): NO CHANGE\n print(x[len(x)-k])\n else:\n ass = 10 ** 10 # (8): ass=10000000000\n for i in range(r,min(len(x),r + k )): # (9): i=2 (14): i=3 ... (24): NO CHANGE\n if i-r+1 >= k: # (10): NO CHANGE (15): NO CHANGE (20): NO CHANGE\n ans = abs(x[i])\n elif i == r and r-k >= 0: # (11): NO CHANGE (16): NO CHANGE (21): NO CHANGE\n ans = abs(x[r-k])\n else:\n ans = x[i] + abs(x[i-k+1]) + min(x[i],abs(x[i-k+1])) # (12): ans=40 (17): ans=90 (22): ans=150\n ass = min(ass,ans) # (13): ass=40 (18): NO CHANGE (23): NO CHANGE\n print(ass)"], "anno_status": [true], "diff_content": " \n import bisect \n n,k = map(int,input().split())\n x = list(map(int,input().split()))\n \n w = x.count(0)\n for i in range(w):\n x.remove(0)\n \n if k <= w:\n print(0)\n else:\n k = k -w\n \n \n r = bisect.bisect_left(x,0)\n \n if x[-1]<0:\n- print(x[len(x)-k])\n+ print(abs(x[len(x)-k]))\n+ elif x[0] > 0:\n+ print(x[k-1]) \n else:\n ass = 10 ** 10\n+ ans = 10**10\n for i in range(r,min(len(x),r + k )):\n if i-r+1 >= k:\n ans = abs(x[i])\n- elif i == r and r-k >= 0:\n- ans = abs(x[r-k])\n+ \n else:\n- ans = x[i] + abs(x[i-k+1]) + min(x[i],abs(x[i-k+1]))\n+ if i - k + 1 >= 0:\n+ ans = x[i] + abs(x[i-k+1]) + min(x[i],abs(x[i-k+1]))\n ass = min(ass,ans)\n+ if r-k >= 0:\n+ ans = abs(x[r-k])\n+ ass = min(ass,ans)\n print(ass)\n", "FL_content": " \n import bisect \n n,k = map(int,input().split())\n x = list(map(int,input().split()))\n \n w = x.count(0)\n for i in range(w):\n x.remove(0)\n \n if k <= w:\n print(0)\n else:\n k = k -w\n \n \n r = bisect.bisect_left(x,0)\n \n if x[-1]<0:\n- print(x[len(x)-k])\n else:\n ass = 10 ** 10\n for i in range(r,min(len(x),r + k )):\n if i-r+1 >= k:\n ans = abs(x[i])\n- elif i == r and r-k >= 0:\n- ans = abs(x[r-k])\n else:\n- ans = x[i] + abs(x[i-k+1]) + min(x[i],abs(x[i-k+1]))\n ass = min(ass,ans)\n print(ass)\n", "added_lines": 10, "removed_lines": 4, "code1_lines": 30 }, { "user_id": "u560867850", "problem_id": "p03274", "submission1_id": "s489411593", "submission2_id": "s435294051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\n\ndef main():\n N, K = map(int, input().split())\n X = [int(c) for c in input().split()]\n\n def fullsearch():\n for i in range(N-K):\n l = X[i]\n r = X[i+K-1]\n distance = abs(r - l)\n if abs(l) > abs(r):\n distance += abs(r)\n else:\n distance += abs(l)\n yield distance\n\n if N == K:\n print(0)\n else:\n print(min(fullsearch()))\n\nmain()", "code2": "import sys\ninput = sys.stdin.readline\n\n\ndef main():\n N, K = map(int, input().split())\n X = [int(c) for c in input().split()]\n\n def fullsearch():\n for i in range(N-K+1):\n l = X[i]\n r = X[i+K-1]\n distance = abs(r - l)\n yield distance + abs(r)\n yield distance + abs(l)\n\n print(min(fullsearch()))\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580424165", "date2": "1580424572", "bleu_score": "0.7028954232120583", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 38, "total_score": 103, "input": "5 5\n-38 -1 11 12 94\n", "actual_output": "0\n", "expected_output": "170\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\n\ndef main(): # (1): main=\n N, K = map(int, input().split()) # (3): K=5, N=5\n X = [int(c) for c in input().split()] # (4): X=[-38, -1, 11, 12, 94]\n\n def fullsearch(): # (5): fullsearch=.fullsearch at 0x0000015C3E199B40>\n for i in range(N-K):\n l = X[i]\n r = X[i+K-1]\n distance = abs(r - l)\n if abs(l) > abs(r):\n distance += abs(r)\n else:\n distance += abs(l)\n yield distance\n\n if N == K: # (6): NO CHANGE\n print(0)\n else:\n print(min(fullsearch()))\n\nmain() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n \n def main():\n N, K = map(int, input().split())\n X = [int(c) for c in input().split()]\n \n def fullsearch():\n- for i in range(N-K):\n+ for i in range(N-K+1):\n l = X[i]\n r = X[i+K-1]\n distance = abs(r - l)\n- if abs(l) > abs(r):\n- distance += abs(r)\n- else:\n- distance += abs(l)\n- yield distance\n+ yield distance + abs(r)\n+ yield distance + abs(l)\n \n- if N == K:\n- print(0)\n- else:\n- print(min(fullsearch()))\n+ print(min(fullsearch()))\n \n main()\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n \n def main():\n N, K = map(int, input().split())\n X = [int(c) for c in input().split()]\n \n def fullsearch():\n- for i in range(N-K):\n l = X[i]\n r = X[i+K-1]\n distance = abs(r - l)\n- if abs(l) > abs(r):\n- distance += abs(r)\n- else:\n- distance += abs(l)\n- yield distance\n \n- if N == K:\n- print(0)\n- else:\n- print(min(fullsearch()))\n \n main()\n", "added_lines": 4, "removed_lines": 10, "code1_lines": 25 }, { "user_id": "u703528810", "problem_id": "p03274", "submission1_id": "s669279195", "submission2_id": "s913296495", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nx=list(map(int,input().split()))\n\nans=max(x)-min(x)\n\nfor i in range(N-K+1):\n ans=min(ans,x[i+K-1]-x[i]+min(abs(x[i]),abs(x[i+K-1])))\n\nif N==1:\n ans=x[0]\nprint(ans)", "code2": "N,K=map(int,input().split())\nx=list(map(int,input().split()))\n\nans=max(x)-min(x)+max(max(x),abs(min(x)))\n\nfor i in range(N-K+1):\n ans=min(ans,x[i+K-1]-x[i]+min(abs(x[i]),abs(x[i+K-1])))\n\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589695101", "date2": "1589696124", "bleu_score": "0.8743696350613661", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1], "code1_test_score": 46, "total_score": 103, "input": "5 5\n-30 -10 8 20 76\n", "actual_output": "106\n", "expected_output": "136\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=5, K=5\nx=list(map(int,input().split())) # (1): x=[-30, -10, 8, 20, 76]\n\nans=max(x)-min(x) # (2): ans=106\n\nfor i in range(N-K+1): # (3): i=0 (5): NO CHANGE\n ans=min(ans,x[i+K-1]-x[i]+min(abs(x[i]),abs(x[i+K-1]))) # (4): NO CHANGE\n\nif N==1: # (6): NO CHANGE\n ans=x[0]\nprint(ans)"], "anno_status": [true], "diff_content": " N,K=map(int,input().split())\n x=list(map(int,input().split()))\n \n-ans=max(x)-min(x)\n+ans=max(x)-min(x)+max(max(x),abs(min(x)))\n \n for i in range(N-K+1):\n ans=min(ans,x[i+K-1]-x[i]+min(abs(x[i]),abs(x[i+K-1])))\n \n-if N==1:\n- ans=x[0]\n+\n print(ans)\n", "FL_content": " N,K=map(int,input().split())\n x=list(map(int,input().split()))\n \n-ans=max(x)-min(x)\n \n for i in range(N-K+1):\n ans=min(ans,x[i+K-1]-x[i]+min(abs(x[i]),abs(x[i+K-1])))\n \n-if N==1:\n- ans=x[0]\n print(ans)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u584083761", "problem_id": "p03274", "submission1_id": "s002933317", "submission2_id": "s847330021", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = list(map(int, input().split()))\nn = list(map(int, input().split()))\n\nans = []\nfor i, name in enumerate(n):\n if b+i >a:\n break\n ans.append(min( (abs(n[i]) + abs(n[i +b-1] - n[i]), (n[i+b-1]) + abs(n[i +b-1] - n[i]) )) )\n\nprint(min(ans))", "code2": "a,b = list(map(int, input().split()))\nn = list(map(int, input().split()))\n\nans = []\nfor i, name in enumerate(n):\n if b+i >a:\n break\n ans.append(min( (abs(n[i]) + abs(n[i +b-1] - n[i]), abs(n[i+b-1]) + abs(n[i +b-1] - n[i]) )) )\n\nprint(min(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568507086", "date2": "1568507284", "bleu_score": "0.982426794437465", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 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, 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": 94, "total_score": 103, "input": "8 4\n-14 -7 -1 -11 1 1 3 8\n", "actual_output": "-8\n", "expected_output": "3\n\n", "anno_code": ["a,b = list(map(int, input().split())) # (0): a=8, b=4\nn = list(map(int, input().split())) # (1): n=[-14, -7, -1, -11, 1, 1, 3, 8]\n\nans = [] # (2): ans=[]\nfor i, name in enumerate(n): # (3): i=0, name=-14 (6): i=1, name=-7 ... (18): i=5\n if b+i >a: # (4): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n break # (20): NO CHANGE\n ans.append(min( (abs(n[i]) + abs(n[i +b-1] - n[i]), (n[i+b-1]) + abs(n[i +b-1] - n[i]) )) ) # (5): ans=[-8] (8): ans=[-8, 9] ... (17): ans=[-8, 9, 3, 17, 8]\n\nprint(min(ans))"], "anno_status": [true], "diff_content": " a,b = list(map(int, input().split()))\n n = list(map(int, input().split()))\n \n ans = []\n for i, name in enumerate(n):\n if b+i >a:\n break\n- ans.append(min( (abs(n[i]) + abs(n[i +b-1] - n[i]), (n[i+b-1]) + abs(n[i +b-1] - n[i]) )) )\n+ ans.append(min( (abs(n[i]) + abs(n[i +b-1] - n[i]), abs(n[i+b-1]) + abs(n[i +b-1] - n[i]) )) )\n \n print(min(ans))\n", "FL_content": " a,b = list(map(int, input().split()))\n n = list(map(int, input().split()))\n \n ans = []\n for i, name in enumerate(n):\n if b+i >a:\n break\n- ans.append(min( (abs(n[i]) + abs(n[i +b-1] - n[i]), (n[i+b-1]) + abs(n[i +b-1] - n[i]) )) )\n \n print(min(ans))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u813450984", "problem_id": "p03274", "submission1_id": "s405404508", "submission2_id": "s525054226", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\nc = list(map(int, input().split()))\nans = float('Inf')\nfor i in range(n-k+1):\n l, r = abs(c[i]), abs(c[i+k-1])\n \n if c[i] < 0 and r > 0:\n ans = min(ans, min(l, r) * 2 + max(l, r))\n else:\n ans = min(ans, max(l, r))\nprint(ans)", "code2": "n, k = map(int, input().split())\nc = list(map(int, input().split()))\nans = float('Inf')\nfor i in range(n-k+1):\n l, r = c[i], c[i+k-1]\n ans = min(abs(l) + abs(r-l), abs(r) + abs(r-l), ans)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537350895", "date2": "1537359571", "bleu_score": "0.610393435875159", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "5 1\n-19 -7 11 38 106\n", "actual_output": "11\n", "expected_output": "7\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=5, k=1\nc = list(map(int, input().split())) # (1): c=[-19, -7, 11, 38, 106]\nans = float('Inf') # (2): ans=inf\nfor i in range(n-k+1): # (3): i=0 (7): i=1 ... (23): NO CHANGE\n l, r = abs(c[i]), abs(c[i+k-1]) # (4): l=19, r=19 (8): l=7, r=7 ... (20): l=106, r=106\n \n if c[i] < 0 and r > 0: # (5): NO CHANGE (9): NO CHANGE ... (21): NO CHANGE\n ans = min(ans, min(l, r) * 2 + max(l, r)) # (6): ans=57 (10): ans=21\n else:\n ans = min(ans, max(l, r)) # (14): ans=11 (18): NO CHANGE (22): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n c = list(map(int, input().split()))\n ans = float('Inf')\n for i in range(n-k+1):\n- l, r = abs(c[i]), abs(c[i+k-1])\n- \n- if c[i] < 0 and r > 0:\n- ans = min(ans, min(l, r) * 2 + max(l, r))\n- else:\n- ans = min(ans, max(l, r))\n+ l, r = c[i], c[i+k-1]\n+ ans = min(abs(l) + abs(r-l), abs(r) + abs(r-l), ans)\n+\n print(ans)\n", "FL_content": " n, k = map(int, input().split())\n c = list(map(int, input().split()))\n ans = float('Inf')\n for i in range(n-k+1):\n- l, r = abs(c[i]), abs(c[i+k-1])\n- \n- if c[i] < 0 and r > 0:\n- ans = min(ans, min(l, r) * 2 + max(l, r))\n- else:\n- ans = min(ans, max(l, r))\n print(ans)\n", "added_lines": 3, "removed_lines": 6, "code1_lines": 11 }, { "user_id": "u515052479", "problem_id": "p03274", "submission1_id": "s616470250", "submission2_id": "s482035449", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k = map(int,input().split())\nx = list(map(int,input().split()))\nans = 10**9\n \nfor i in range(n-k+1):\n if x[k-1+i]*x[i] < 0:\n if x[k-1+i] <= abs(x[i]) :\n temp = 2*x[k-1+i] - x[i]\n elif abs(x[i]) < x[k-1+i]:\n temp = x[k-1+i] - 2*x[i]\n \n elif (0 <= x[i]):\n temp = x[k+i-1]\n\n elif (x[k+i-1] <= 0):\n temp = -x[0]\n \n if temp < ans:\n ans = temp\n \nprint(ans)", "code2": "n,k = map(int,input().split())\nx = list(map(int,input().split()))\nans = 10**9\n \nfor i in range(n-k+1):\n if x[k-1+i]*x[i] < 0:\n if x[k-1+i] <= abs(x[i]) :\n temp = 2*x[k-1+i] - x[i]\n elif abs(x[i]) < x[k-1+i]:\n temp = x[k-1+i] - 2*x[i]\n \n elif (0 <= x[i]):\n temp = x[k+i-1]\n\n elif (x[k+i-1] <= 0):\n temp = -x[i]\n \n if temp < ans:\n ans = temp\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586641396", "date2": "1586641455", "bleu_score": "0.993601939619673", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 1\n-19 -7 11 38 106\n", "actual_output": "11\n", "expected_output": "7\n\n", "anno_code": ["n,k = map(int,input().split()) # (0): n=5, k=1\nx = list(map(int,input().split())) # (1): x=[-19, -7, 11, 38, 106]\nans = 10**9 # (2): ans=1000000000\n \nfor i in range(n-k+1): # (3): i=0 (10): i=1 ... (32): NO CHANGE\n if x[k-1+i]*x[i] < 0: # (4): NO CHANGE (11): NO CHANGE ... (28): NO CHANGE\n if x[k-1+i] <= abs(x[i]) :\n temp = 2*x[k-1+i] - x[i]\n elif abs(x[i]) < x[k-1+i]:\n temp = x[k-1+i] - 2*x[i]\n \n elif (0 <= x[i]): # (5): NO CHANGE (12): NO CHANGE ... (29): NO CHANGE\n temp = x[k+i-1] # (19): temp=11 (25): temp=38 (30): temp=106\n\n elif (x[k+i-1] <= 0): # (6): NO CHANGE (13): NO CHANGE\n temp = -x[0] # (7): temp=19 (14): NO CHANGE\n \n if temp < ans: # (8): NO CHANGE (15): NO CHANGE ... (31): NO CHANGE\n ans = temp # (9): ans=19 (21): ans=11\n \nprint(ans)"], "anno_status": [true], "diff_content": " n,k = map(int,input().split())\n x = list(map(int,input().split()))\n ans = 10**9\n \n for i in range(n-k+1):\n if x[k-1+i]*x[i] < 0:\n if x[k-1+i] <= abs(x[i]) :\n temp = 2*x[k-1+i] - x[i]\n elif abs(x[i]) < x[k-1+i]:\n temp = x[k-1+i] - 2*x[i]\n \n elif (0 <= x[i]):\n temp = x[k+i-1]\n \n elif (x[k+i-1] <= 0):\n- temp = -x[0]\n+ temp = -x[i]\n \n if temp < ans:\n ans = temp\n \n print(ans)\n", "FL_content": " n,k = map(int,input().split())\n x = list(map(int,input().split()))\n ans = 10**9\n \n for i in range(n-k+1):\n if x[k-1+i]*x[i] < 0:\n if x[k-1+i] <= abs(x[i]) :\n temp = 2*x[k-1+i] - x[i]\n elif abs(x[i]) < x[k-1+i]:\n temp = x[k-1+i] - 2*x[i]\n \n elif (0 <= x[i]):\n temp = x[k+i-1]\n \n elif (x[k+i-1] <= 0):\n- temp = -x[0]\n \n if temp < ans:\n ans = temp\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u460245024", "problem_id": "p03274", "submission1_id": "s457874313", "submission2_id": "s552422520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nX = list(map(int, input().split()))\nINF = 1000000000\ndistances = [INF]*(2*(N-K+1))\nfor l in range(N-K+1):\n distances[l]=abs(X[l]) + abs(X[l] - X[l+K-1])\n distances[l+1]=abs(X[l+K-1]) + abs(X[l] - X[l+K-1])\n\nprint(min(distances))\n", "code2": "N, K = map(int, input().split())\nX = list(map(int, input().split()))\nINF = 1000000000\ndistances = [INF]*(2*(N-K+1))\nfor l in range(N-K+1):\n distances[l] = abs(X[l]) + abs(X[l] - X[l+K-1])\n distances[l+N-K+1] = abs(X[l+K-1]) + abs(X[l] - X[l+K-1])\n\nprint(min(distances))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558162178", "date2": "1558162261", "bleu_score": "0.9515768661246772", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "5 4\n-31 -5 16 20 67\n", "actual_output": "77\n", "expected_output": "71\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=5, K=4\nX = list(map(int, input().split())) # (1): X=[-31, -5, 16, 20, 67]\nINF = 1000000000 # (2): INF=1000000000\ndistances = [INF]*(2*(N-K+1)) # (3): distances=[1000000000, 1000000000, 1000000000, 1000000000]\nfor l in range(N-K+1): # (4): l=0 (7): l=1 (10): NO CHANGE\n distances[l]=abs(X[l]) + abs(X[l] - X[l+K-1]) # (5): distances=[82, 1000000000, 1000000000, 1000000000] (8): distances=[82, 77, 1000000000, 1000000000]\n distances[l+1]=abs(X[l+K-1]) + abs(X[l] - X[l+K-1]) # (6): distances=[82, 71, 1000000000, 1000000000] (9): distances=[82, 77, 139, 1000000000]\n\nprint(min(distances))\n"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n X = list(map(int, input().split()))\n INF = 1000000000\n distances = [INF]*(2*(N-K+1))\n for l in range(N-K+1):\n- distances[l]=abs(X[l]) + abs(X[l] - X[l+K-1])\n- distances[l+1]=abs(X[l+K-1]) + abs(X[l] - X[l+K-1])\n+ distances[l] = abs(X[l]) + abs(X[l] - X[l+K-1])\n+ distances[l+N-K+1] = abs(X[l+K-1]) + abs(X[l] - X[l+K-1])\n \n print(min(distances))\n \n", "FL_content": " N, K = map(int, input().split())\n X = list(map(int, input().split()))\n INF = 1000000000\n distances = [INF]*(2*(N-K+1))\n for l in range(N-K+1):\n- distances[l]=abs(X[l]) + abs(X[l] - X[l+K-1])\n- distances[l+1]=abs(X[l+K-1]) + abs(X[l] - X[l+K-1])\n \n print(min(distances))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u244416763", "problem_id": "p03274", "submission1_id": "s851210085", "submission2_id": "s320191078", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k = map(int, input().split())\nx = list(map(int, input().split()))\nminus = [0]\nplus = [0]\nfor i in x:\n if x:\n plus.append(x)\n else:\n minus.append(-x)\nk -= 1\nans = x[-1] - x[0]\nfor i in range(n-k):\n if x[i+k] < 0:\n ans = min(ans, -x[i])\n elif 0 < x[i+k] and x[i] < 0:\n if -x[i] < x[i+k]:\n ans = min(ans, abs(2*(x[i])) + x[i+k])\n else:\n ans = min(ans, 2*x[i+k] + abs(x[i]))\n else:\n ans = min(ans, x[i+k])\n \nprint(ans)", "code2": "n,k = map(int, input().split())\nx = list(map(int, input().split()))\nminus = [0]\nplus = [0]\nfor i in x:\n if x:\n plus.append(x)\n else:\n minus.append(-x)\nk -= 1\nans = 1000000000000000\nfor i in range(n-k):\n if x[i+k] < 0:\n ans = min(ans, -x[i])\n elif 0 < x[i+k] and x[i] < 0:\n if -x[i] < x[i+k]:\n ans = min(ans, abs(2*(x[i])) + x[i+k])\n else:\n ans = min(ans, 2*x[i+k] + abs(x[i]))\n else:\n ans = min(ans, x[i+k])\n \nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596746669", "date2": "1596746753", "bleu_score": "0.9660183287319738", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 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, 1, 1, 1], "code1_test_score": 42, "total_score": 103, "input": "5 5\n-17 -10 10 20 58\n", "actual_output": "75\n", "expected_output": "92\n\n", "anno_code": ["n,k = map(int, input().split()) # (0): n=5, k=5\nx = list(map(int, input().split())) # (1): x=[-17, -10, 10, 20, 58]\nminus = [0] # (2): minus=[0]\nplus = [0] # (3): plus=[0]\nfor i in x: # (4): i=-17 (7): plus=[0, [-17, -10, 10, 20, 58]], i=-10 ... (19): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n if x: # (5): NO CHANGE (8): plus=[0, [-17, -10, 10, 20, 58]] ... (17): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n plus.append(x) # (6): plus=[0, [-17, -10, 10, 20, 58]] (9): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]] ... (18): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n else:\n minus.append(-x)\nk -= 1 # (20): k=4, plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\nans = x[-1] - x[0] # (21): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]], ans=75\nfor i in range(n-k): # (22): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]], i=0 (27): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n if x[i+k] < 0: # (23): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n ans = min(ans, -x[i])\n elif 0 < x[i+k] and x[i] < 0: # (24): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n if -x[i] < x[i+k]: # (25): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n ans = min(ans, abs(2*(x[i])) + x[i+k]) # (26): plus=[0, [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58], [-17, -10, 10, 20, 58]]\n else:\n ans = min(ans, 2*x[i+k] + abs(x[i]))\n else:\n ans = min(ans, x[i+k])\n \nprint(ans)"], "anno_status": [false], "diff_content": " n,k = map(int, input().split())\n x = list(map(int, input().split()))\n minus = [0]\n plus = [0]\n for i in x:\n if x:\n plus.append(x)\n else:\n minus.append(-x)\n k -= 1\n-ans = x[-1] - x[0]\n+ans = 1000000000000000\n for i in range(n-k):\n if x[i+k] < 0:\n ans = min(ans, -x[i])\n elif 0 < x[i+k] and x[i] < 0:\n if -x[i] < x[i+k]:\n ans = min(ans, abs(2*(x[i])) + x[i+k])\n else:\n ans = min(ans, 2*x[i+k] + abs(x[i]))\n else:\n ans = min(ans, x[i+k])\n \n print(ans)\n", "FL_content": " n,k = map(int, input().split())\n x = list(map(int, input().split()))\n minus = [0]\n plus = [0]\n for i in x:\n if x:\n plus.append(x)\n else:\n minus.append(-x)\n k -= 1\n-ans = x[-1] - x[0]\n for i in range(n-k):\n if x[i+k] < 0:\n ans = min(ans, -x[i])\n elif 0 < x[i+k] and x[i] < 0:\n if -x[i] < x[i+k]:\n ans = min(ans, abs(2*(x[i])) + x[i+k])\n else:\n ans = min(ans, 2*x[i+k] + abs(x[i]))\n else:\n ans = min(ans, x[i+k])\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u905582793", "problem_id": "p03274", "submission1_id": "s344045049", "submission2_id": "s610646059", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split(' '))\na= list(map(int, input().split(' ')))\n\nINF = float('inf')\nans = INF\n\nfor i in range(N-K):\n ans = min(ans, abs(a[i+K-1]-a[i])+min(abs(a[i+K-1]), abs(a[i])))\n\nprint(ans)", "code2": "N, K = map(int, input().split(' '))\na= list(map(int, input().split(' ')))\n\nINF = float('inf')\nans = INF\n\nif N == K:\n ans = abs(a[N-1]-a[0])+min(abs(a[0]), abs(a[N-1]))\nelse:\n for i in range(N-K+1):\n ans = min(ans, abs(a[i+K-1]-a[i])+min(abs(a[i+K-1]), abs(a[i])))\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574828380", "date2": "1574829924", "bleu_score": "0.703223783782614", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 38, "total_score": 103, "input": "5 5\n-51 -10 10 20 58\n", "actual_output": "inf\n", "expected_output": "160\n\n", "anno_code": ["N, K = map(int, input().split(' ')) # (0): N=5, K=5\na= list(map(int, input().split(' '))) # (1): a=[-51, -10, 10, 20, 58]\n\nINF = float('inf') # (2): INF=inf\nans = INF # (3): ans=inf\n\nfor i in range(N-K): # (4): NO CHANGE\n ans = min(ans, abs(a[i+K-1]-a[i])+min(abs(a[i+K-1]), abs(a[i])))\n\nprint(ans)"], "anno_status": [true], "diff_content": " N, K = map(int, input().split(' '))\n a= list(map(int, input().split(' ')))\n \n INF = float('inf')\n ans = INF\n \n-for i in range(N-K):\n- ans = min(ans, abs(a[i+K-1]-a[i])+min(abs(a[i+K-1]), abs(a[i])))\n+if N == K:\n+ ans = abs(a[N-1]-a[0])+min(abs(a[0]), abs(a[N-1]))\n+else:\n+ for i in range(N-K+1):\n+ ans = min(ans, abs(a[i+K-1]-a[i])+min(abs(a[i+K-1]), abs(a[i])))\n \n print(ans)\n", "FL_content": " N, K = map(int, input().split(' '))\n a= list(map(int, input().split(' ')))\n \n INF = float('inf')\n ans = INF\n \n-for i in range(N-K):\n- ans = min(ans, abs(a[i+K-1]-a[i])+min(abs(a[i+K-1]), abs(a[i])))\n \n print(ans)\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u904943473", "problem_id": "p03274", "submission1_id": "s298505015", "submission2_id": "s421195839", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nlst = list(map(int, input().split()))\nans = 2 * 10 ** 5\nfor i in range(N-K+1):\n\tk_lst = lst[i:i+K]\n\tleft = min(k_lst)\n\tright = max(k_lst)\n\tif (left > right):\n\t\tdis = abs(left - right) + abs(right)\n\telse:\n\t\tdis = abs(left - right) + abs(left)\n\tif (dis < ans):\n\t\tans = dis \nprint(ans)\n", "code2": "N, K = map(int, input().split())\nlst = list(map(int, input().split()))\nans = 10 ** 10\nfor i in range(N-K+1):\n\tleft = lst[i]\n\tright = lst[i+K-1]\n\tif (abs(left) > abs(right)):\n\t\tdis = abs(left - right) + abs(right)\n\telse:\n\t\tdis = abs(left - right) + abs(left)\n\tif (dis < ans):\n\t\tans = dis \nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565165970", "date2": "1565167541", "bleu_score": "0.8599994802078818", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 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, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 103, "input": "5 5\n-19 -7 5 14 14\n", "actual_output": "52\n", "expected_output": "47\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=5, K=5\nlst = list(map(int, input().split())) # (1): lst=[-19, -7, 5, 14, 14]\nans = 2 * 10 ** 5 # (2): ans=200000\nfor i in range(N-K+1): # (3): i=0 (11): NO CHANGE\n\tk_lst = lst[i:i+K] # (4): k_lst=[-19, -7, 5, 14, 14]\n\tleft = min(k_lst) # (5): left=-19\n\tright = max(k_lst) # (6): right=14\n\tif (left > right): # (7): NO CHANGE\n\t\tdis = abs(left - right) + abs(right)\n\telse:\n\t\tdis = abs(left - right) + abs(left) # (8): dis=52\n\tif (dis < ans): # (9): NO CHANGE\n\t\tans = dis # (10): ans=52\nprint(ans)\n"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n lst = list(map(int, input().split()))\n-ans = 2 * 10 ** 5\n+ans = 10 ** 10\n for i in range(N-K+1):\n-\tk_lst = lst[i:i+K]\n-\tleft = min(k_lst)\n-\tright = max(k_lst)\n-\tif (left > right):\n+\tleft = lst[i]\n+\tright = lst[i+K-1]\n+\tif (abs(left) > abs(right)):\n \t\tdis = abs(left - right) + abs(right)\n \telse:\n \t\tdis = abs(left - right) + abs(left)\n \tif (dis < ans):\n \t\tans = dis \n print(ans)\n \n", "FL_content": " N, K = map(int, input().split())\n lst = list(map(int, input().split()))\n-ans = 2 * 10 ** 5\n for i in range(N-K+1):\n-\tk_lst = lst[i:i+K]\n-\tleft = min(k_lst)\n-\tright = max(k_lst)\n-\tif (left > right):\n \t\tdis = abs(left - right) + abs(right)\n \telse:\n \t\tdis = abs(left - right) + abs(left)\n \tif (dis < ans):\n \t\tans = dis \n print(ans)\n \n", "added_lines": 4, "removed_lines": 5, "code1_lines": 15 }, { "user_id": "u600402037", "problem_id": "p03274", "submission1_id": "s997281529", "submission2_id": "s918209721", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nX = list(map(int, input().split()))\n\nanswer = 10 ** 9\nfor i in range(N-K+1):\n b, c = X[i], X[i+K-1]\n if b * c >= 0:\n answer = min(answer, max(abs(b), abs(c)))\n else:\n answer = min(answer, abs(b)*2+abs(c))\nprint(answer)", "code2": "N, K = map(int, input().split())\nX = list(map(int, input().split()))\n\nanswer = 10 ** 9\nfor i in range(N-K+1):\n b, c = X[i], X[i+K-1]\n if b * c >= 0:\n answer = min(answer, max(abs(b), abs(c)))\n else:\n d, e = min(abs(b), abs(c)), max(abs(b), abs(c))\n answer = min(answer, d*2+e)\nprint(answer)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569854600", "date2": "1569855910", "bleu_score": "0.8418493785004463", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 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, 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, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 103, "input": "5 4\n-31 -5 16 20 67\n", "actual_output": "77\n", "expected_output": "71\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=5, K=4\nX = list(map(int, input().split())) # (1): X=[-31, -5, 16, 20, 67]\n\nanswer = 10 ** 9 # (2): answer=1000000000\nfor i in range(N-K+1): # (3): i=0 (7): i=1 (11): NO CHANGE\n b, c = X[i], X[i+K-1] # (4): b=-31, c=20 (8): b=-5, c=67\n if b * c >= 0: # (5): NO CHANGE (9): NO CHANGE\n answer = min(answer, max(abs(b), abs(c)))\n else:\n answer = min(answer, abs(b)*2+abs(c)) # (6): answer=82 (10): answer=77\nprint(answer)"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n X = list(map(int, input().split()))\n \n answer = 10 ** 9\n for i in range(N-K+1):\n b, c = X[i], X[i+K-1]\n if b * c >= 0:\n answer = min(answer, max(abs(b), abs(c)))\n else:\n- answer = min(answer, abs(b)*2+abs(c))\n+ d, e = min(abs(b), abs(c)), max(abs(b), abs(c))\n+ answer = min(answer, d*2+e)\n print(answer)\n+\n", "FL_content": " N, K = map(int, input().split())\n X = list(map(int, input().split()))\n \n answer = 10 ** 9\n for i in range(N-K+1):\n b, c = X[i], X[i+K-1]\n if b * c >= 0:\n answer = min(answer, max(abs(b), abs(c)))\n else:\n- answer = min(answer, abs(b)*2+abs(c))\n print(answer)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u172035535", "problem_id": "p03274", "submission1_id": "s320337327", "submission2_id": "s663729436", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = map(int,input().split())\nX = list(map(int,input().split()))\nans = 10**9\nfor i in range(N-K+1):\n ans = min(ans,abs(X[i])+abs(X[i+K-1])+min(abs(X[i]),abs(X[i+K-1])))\nprint(ans)", "code2": "N,K = map(int,input().split())\nX = list(map(int,input().split()))\n\nans = 10**9\nfor i in range(N-K+1):\n ans = min(ans,X[i+K-1]-X[i]+min(abs(X[i]),abs(X[i+K-1])))\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557066195", "date2": "1557067743", "bleu_score": "0.9092370414063423", "code1_test_status": [1, 1, 0, 1, 0, 0, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "8 4\n-14 -7 -4 -11 1 2 3 4\n", "actual_output": "6\n", "expected_output": "4\n\n", "anno_code": ["N,K = map(int,input().split()) # (0): N=8, K=4\nX = list(map(int,input().split())) # (1): X=[-14, -7, -4, -11, 1, 2, 3, 4]\nans = 10**9 # (2): ans=1000000000\nfor i in range(N-K+1): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n ans = min(ans,abs(X[i])+abs(X[i+K-1])+min(abs(X[i]),abs(X[i+K-1]))) # (4): ans=36 (6): ans=9 ... (12): ans=6\nprint(ans)"], "anno_status": [true], "diff_content": " N,K = map(int,input().split())\n X = list(map(int,input().split()))\n+\n ans = 10**9\n for i in range(N-K+1):\n- ans = min(ans,abs(X[i])+abs(X[i+K-1])+min(abs(X[i]),abs(X[i+K-1])))\n+ ans = min(ans,X[i+K-1]-X[i]+min(abs(X[i]),abs(X[i+K-1])))\n print(ans)\n", "FL_content": " N,K = map(int,input().split())\n X = list(map(int,input().split()))\n ans = 10**9\n for i in range(N-K+1):\n- ans = min(ans,abs(X[i])+abs(X[i+K-1])+min(abs(X[i]),abs(X[i+K-1])))\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u919025034", "problem_id": "p03274", "submission1_id": "s834465510", "submission2_id": "s766030659", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nX=list(map(int,input().split()))\nif N==1:\n print(0);exit()\n\nans=float(\"Inf\")\nfor i in range(N-K):\n ans=min(ans, X[i+K-1]-X[i]+ min(abs(X[i+K-1]),abs(X[i])) )\n\nprint(ans)\n ", "code2": "N,K=map(int,input().split())\nX=list(map(int,input().split()))\nif N==1:\n print(0);exit()\n\nans=float(\"Inf\")\nfor i in range(N-K+1):\n ans=min(ans, X[i+K-1]-X[i]+ min(abs(X[i+K-1]),abs(X[i])) )\n\nprint(ans)\n ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576480070", "date2": "1576480194", "bleu_score": "0.9828389493850328", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 38, "total_score": 103, "input": "5 5\n-72 -7 8 20 106\n", "actual_output": "inf\n", "expected_output": "250\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=5, K=5\nX=list(map(int,input().split())) # (1): X=[-72, -7, 8, 20, 106]\nif N==1: # (2): NO CHANGE\n print(0);exit()\n\nans=float(\"Inf\") # (3): ans=inf\nfor i in range(N-K): # (4): NO CHANGE\n ans=min(ans, X[i+K-1]-X[i]+ min(abs(X[i+K-1]),abs(X[i])) )\n\nprint(ans)\n "], "anno_status": [true], "diff_content": " N,K=map(int,input().split())\n X=list(map(int,input().split()))\n if N==1:\n print(0);exit()\n \n ans=float(\"Inf\")\n-for i in range(N-K):\n+for i in range(N-K+1):\n ans=min(ans, X[i+K-1]-X[i]+ min(abs(X[i+K-1]),abs(X[i])) )\n \n print(ans)\n \n", "FL_content": " N,K=map(int,input().split())\n X=list(map(int,input().split()))\n if N==1:\n print(0);exit()\n \n ans=float(\"Inf\")\n-for i in range(N-K):\n ans=min(ans, X[i+K-1]-X[i]+ min(abs(X[i+K-1]),abs(X[i])) )\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u759651152", "problem_id": "p03274", "submission1_id": "s955852285", "submission2_id": "s786370320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef main():\n n, k = map(int, input().split())\n x_list = list(map(int, input().split()))\n\n ans = float('inf')\n\n for i in range(n - k + 1):\n if x_list[i] >= 0 and x_list[i+k-1] >= 0:\n ans = min(ans, x_list[i+k-1])\n elif x_list[i] < 0 and x_list[i+k-1] < 0:\n ans = min(ans, -x_list[i])\n else:\n ans = min(ans, -x_list[i] * 2 + x_list[i+k-1])\n print(ans)\n\nif __name__ == '__main__':\n main()", "code2": "\n\ndef main():\n n, k = map(int, input().split())\n x_list = list(map(int, input().split()))\n ans = float('inf')\n\n for i in range(n - k + 1):\n if x_list[i] >= 0 and x_list[i+k-1] >= 0:\n ans = min(ans, x_list[i+k-1])\n elif x_list[i] <= 0 and x_list[i+k-1] <= 0:\n ans = min(ans, -x_list[i])\n else:\n ans = min(ans, min(-x_list[i] * 2 + x_list[i+k-1] , -x_list[i] + x_list[i+k-1] * 2))\n print(ans)\n\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535249522", "date2": "1535250377", "bleu_score": "0.9082903451456461", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 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, 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, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 103, "input": "5 5\n-19 -7 5 14 14\n", "actual_output": "52\n", "expected_output": "47\n\n", "anno_code": ["\n\ndef main(): # (0): main=\n n, k = map(int, input().split())\n x_list = list(map(int, input().split()))\n\n ans = float('inf')\n\n for i in range(n - k + 1):\n if x_list[i] >= 0 and x_list[i+k-1] >= 0:\n ans = min(ans, x_list[i+k-1])\n elif x_list[i] < 0 and x_list[i+k-1] < 0:\n ans = min(ans, -x_list[i])\n else:\n ans = min(ans, -x_list[i] * 2 + x_list[i+k-1])\n print(ans)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n def main():\n n, k = map(int, input().split())\n x_list = list(map(int, input().split()))\n-\n ans = float('inf')\n \n for i in range(n - k + 1):\n if x_list[i] >= 0 and x_list[i+k-1] >= 0:\n ans = min(ans, x_list[i+k-1])\n- elif x_list[i] < 0 and x_list[i+k-1] < 0:\n+ elif x_list[i] <= 0 and x_list[i+k-1] <= 0:\n ans = min(ans, -x_list[i])\n else:\n- ans = min(ans, -x_list[i] * 2 + x_list[i+k-1])\n+ ans = min(ans, min(-x_list[i] * 2 + x_list[i+k-1] , -x_list[i] + x_list[i+k-1] * 2))\n print(ans)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " \n \n def main():\n n, k = map(int, input().split())\n x_list = list(map(int, input().split()))\n-\n ans = float('inf')\n \n for i in range(n - k + 1):\n if x_list[i] >= 0 and x_list[i+k-1] >= 0:\n ans = min(ans, x_list[i+k-1])\n- elif x_list[i] < 0 and x_list[i+k-1] < 0:\n ans = min(ans, -x_list[i])\n else:\n- ans = min(ans, -x_list[i] * 2 + x_list[i+k-1])\n print(ans)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u597455618", "problem_id": "p03274", "submission1_id": "s890270825", "submission2_id": "s270480149", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 10**10\nfor i in range(n-k+1):\n tmp = a[k+i-1] - a[i] + abs(a[i])\n if ans > tmp:\n ans = tmp\nprint(ans)", "code2": "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 10**10\nfor i in range(n-k+1):\n tmp = min(abs(a[k+i-1] - a[i]) + abs(a[i]), abs(a[k+i-1] - a[i]) + abs(a[k+i-1]))\n if ans > tmp:\n ans = tmp\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597456727", "date2": "1597457168", "bleu_score": "0.7832252304941749", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 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, 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, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 89, "total_score": 103, "input": "5 5\n-58 -11 7 20 50\n", "actual_output": "166\n", "expected_output": "158\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=5, k=5\na = list(map(int, input().split())) # (1): a=[-58, -11, 7, 20, 50]\nans = 10**10 # (2): ans=10000000000\nfor i in range(n-k+1): # (3): i=0 (7): NO CHANGE\n tmp = a[k+i-1] - a[i] + abs(a[i]) # (4): tmp=166\n if ans > tmp: # (5): NO CHANGE\n ans = tmp # (6): ans=166\nprint(ans)"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n a = list(map(int, input().split()))\n ans = 10**10\n for i in range(n-k+1):\n- tmp = a[k+i-1] - a[i] + abs(a[i])\n+ tmp = min(abs(a[k+i-1] - a[i]) + abs(a[i]), abs(a[k+i-1] - a[i]) + abs(a[k+i-1]))\n if ans > tmp:\n ans = tmp\n print(ans)\n", "FL_content": " n, k = map(int, input().split())\n a = list(map(int, input().split()))\n ans = 10**10\n for i in range(n-k+1):\n- tmp = a[k+i-1] - a[i] + abs(a[i])\n if ans > tmp:\n ans = tmp\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u472534477", "problem_id": "p03274", "submission1_id": "s729839721", "submission2_id": "s184936428", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = map(int,input().split())\nx = list(map(int,input().split()))\nans=float(\"inf\")\n\nfor i in range(K):\n if i + K >= N+1:\n break\n else:\n a = min(abs(x[K+i-1]),abs(x[i])) \n ans = min(ans,x[K+i-1]-x[i]+a)\nprint(ans)\n", "code2": "N,K = map(int,input().split())\nx = list(map(int,input().split()))\nans=float(\"inf\")\n\nfor i in range(N-K+1):\n if i + K == N+1:\n break\n else:\n a = min(abs(x[K+i-1]),abs(x[i])) \n ans = min(ans,x[K+i-1]-x[i]+a)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591535440", "date2": "1591536087", "bleu_score": "0.9636568866346182", "code1_test_status": [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "5 1\n-19 -7 11 38 106\n", "actual_output": "19\n", "expected_output": "7\n\n", "anno_code": ["N,K = map(int,input().split()) # (0): N=5, K=1\nx = list(map(int,input().split())) # (1): x=[-19, -7, 11, 38, 106]\nans=float(\"inf\") # (2): ans=inf\n\nfor i in range(K): # (3): i=0 (7): NO CHANGE\n if i + K >= N+1: # (4): NO CHANGE\n break\n else:\n a = min(abs(x[K+i-1]),abs(x[i])) # (5): a=19\n ans = min(ans,x[K+i-1]-x[i]+a) # (6): ans=19\nprint(ans)\n"], "anno_status": [true], "diff_content": " N,K = map(int,input().split())\n x = list(map(int,input().split()))\n ans=float(\"inf\")\n \n-for i in range(K):\n- if i + K >= N+1:\n+for i in range(N-K+1):\n+ if i + K == N+1:\n break\n else:\n a = min(abs(x[K+i-1]),abs(x[i])) \n ans = min(ans,x[K+i-1]-x[i]+a)\n print(ans)\n-\n", "FL_content": " N,K = map(int,input().split())\n x = list(map(int,input().split()))\n ans=float(\"inf\")\n \n-for i in range(K):\n- if i + K >= N+1:\n break\n else:\n a = min(abs(x[K+i-1]),abs(x[i])) \n ans = min(ans,x[K+i-1]-x[i]+a)\n print(ans)\n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u595952233", "problem_id": "p03274", "submission1_id": "s072936455", "submission2_id": "s116622280", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nn, k = map(int, input().split())\nX = list(map(int, input().split()))\n\nans = float('inf')\nif n == 1:\n ans = abs(X[0])\nfor i in range(n):\n temp = 0\n \n if X[i] <= 0:\n if not 0 <= i+k-1 < n-1: continue\n temp+= -X[i]*2\n if X[i+k-1] >= 0:\n temp += X[i+k-1]\n ans = min(ans, temp)\n \n elif X[i] > 0:\n if not 0 <= i-k+1 < n-1: continue\n temp+=X[i]*2\n if X[i-k+1] <= 0:\n temp -= X[i-k+1]\n ans = min(ans, temp)\n\nst = bisect.bisect_left(X, 0)\nif st+k-1 < n-1: ans = min(ans, X[st+k-1])\n\n\nst = bisect.bisect_left(X, 0)-1\nif 0 <= st-k+1 < n-1: ans = min(ans, X[st-k+1])\n\nprint(ans)", "code2": "import bisect\nn, k = map(int, input().split())\nX = list(map(int, input().split()))\n\nans = float('inf')\n\nfor i in range(n):\n \n if X[i] <= 0:\n if 0 <= i+k-1 < n:\n temp = 0\n temp+= -X[i]*2\n if X[i+k-1] >= 0:\n temp += X[i+k-1]\n ans = min(ans, temp)\n if 0 <= i-k+1 < n:\n ans = min(ans, -X[i-k+1])\n\n \n else:\n if 0 <= i-k+1 < n:\n temp = 0\n temp+=X[i]*2\n if X[i-k+1] <= 0:\n temp -= X[i-k+1]\n ans = min(ans, temp)\n if 0 <= i+k-1 < n:\n ans = min(ans, X[i+k-1])\n\nif n == 1:\n ans = abs(X[0])\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591239485", "date2": "1591319202", "bleu_score": "0.7992849574965106", "code1_test_status": [0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 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, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1], "code1_test_score": 37, "total_score": 103, "input": "5 5\n-21 -7 15 29 141\n", "actual_output": "303\n", "expected_output": "183\n\n", "anno_code": ["import bisect\nn, k = map(int, input().split()) # (0): n=5, k=5\nX = list(map(int, input().split())) # (1): X=[-21, -7, 15, 29, 141]\n\nans = float('inf') # (2): ans=inf\nif n == 1: # (3): NO CHANGE\n ans = abs(X[0])\nfor i in range(n): # (4): i=0 (8): i=1 ... (31): NO CHANGE\n temp = 0 # (5): temp=0 (9): NO CHANGE ... (23): NO CHANGE\n \n if X[i] <= 0: # (6): NO CHANGE (10): NO CHANGE ... (24): NO CHANGE\n if not 0 <= i+k-1 < n-1: continue # (7): NO CHANGE (11): NO CHANGE\n temp+= -X[i]*2\n if X[i+k-1] >= 0:\n temp += X[i+k-1]\n ans = min(ans, temp)\n \n elif X[i] > 0: # (15): NO CHANGE (20): NO CHANGE (25): NO CHANGE\n if not 0 <= i-k+1 < n-1: continue # (16): NO CHANGE (21): NO CHANGE (26): NO CHANGE\n temp+=X[i]*2 # (27): temp=282\n if X[i-k+1] <= 0: # (28): NO CHANGE\n temp -= X[i-k+1] # (29): temp=303\n ans = min(ans, temp) # (30): ans=303\n\nst = bisect.bisect_left(X, 0) # (32): st=2\nif st+k-1 < n-1: ans = min(ans, X[st+k-1]) # (33): NO CHANGE\n\n\nst = bisect.bisect_left(X, 0)-1 # (34): st=1\nif 0 <= st-k+1 < n-1: ans = min(ans, X[st-k+1]) # (35): NO CHANGE\n\nprint(ans)"], "anno_status": [true], "diff_content": " import bisect\n n, k = map(int, input().split())\n X = list(map(int, input().split()))\n \n ans = float('inf')\n-if n == 1:\n- ans = abs(X[0])\n+\n for i in range(n):\n- temp = 0\n \n if X[i] <= 0:\n- if not 0 <= i+k-1 < n-1: continue\n- temp+= -X[i]*2\n- if X[i+k-1] >= 0:\n- temp += X[i+k-1]\n- ans = min(ans, temp)\n- \n- elif X[i] > 0:\n- if not 0 <= i-k+1 < n-1: continue\n- temp+=X[i]*2\n- if X[i-k+1] <= 0:\n- temp -= X[i-k+1]\n- ans = min(ans, temp)\n-\n-st = bisect.bisect_left(X, 0)\n-if st+k-1 < n-1: ans = min(ans, X[st+k-1])\n+ if 0 <= i+k-1 < n:\n+ temp = 0\n+ temp+= -X[i]*2\n+ if X[i+k-1] >= 0:\n+ temp += X[i+k-1]\n+ ans = min(ans, temp)\n+ if 0 <= i-k+1 < n:\n+ ans = min(ans, -X[i-k+1])\n \n+ \n+ else:\n+ if 0 <= i-k+1 < n:\n+ temp = 0\n+ temp+=X[i]*2\n+ if X[i-k+1] <= 0:\n+ temp -= X[i-k+1]\n+ ans = min(ans, temp)\n+ if 0 <= i+k-1 < n:\n+ ans = min(ans, X[i+k-1])\n \n-st = bisect.bisect_left(X, 0)-1\n-if 0 <= st-k+1 < n-1: ans = min(ans, X[st-k+1])\n+if n == 1:\n+ ans = abs(X[0])\n \n print(ans)\n", "FL_content": " import bisect\n n, k = map(int, input().split())\n X = list(map(int, input().split()))\n \n ans = float('inf')\n-if n == 1:\n- ans = abs(X[0])\n for i in range(n):\n- temp = 0\n \n if X[i] <= 0:\n- if not 0 <= i+k-1 < n-1: continue\n- temp+= -X[i]*2\n- if X[i+k-1] >= 0:\n- temp += X[i+k-1]\n- ans = min(ans, temp)\n- \n- elif X[i] > 0:\n- if not 0 <= i-k+1 < n-1: continue\n- temp+=X[i]*2\n- if X[i-k+1] <= 0:\n- temp -= X[i-k+1]\n- ans = min(ans, temp)\n-\n-st = bisect.bisect_left(X, 0)\n-if st+k-1 < n-1: ans = min(ans, X[st+k-1])\n \n \n-st = bisect.bisect_left(X, 0)-1\n-if 0 <= st-k+1 < n-1: ans = min(ans, X[st-k+1])\n \n print(ans)\n", "added_lines": 21, "removed_lines": 20, "code1_lines": 32 }, { "user_id": "u175426149", "problem_id": "p03274", "submission1_id": "s162465095", "submission2_id": "s893054892", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\n\nX = list(map(int, input().split()))\n\n\ndef calc_time(X):\n x_max = X[-1]\n x_min = X[0]\n\n if x_max * x_min >= 0:\n if abs(x_max) > abs(x_min):\n return x_max\n else:\n return abs(x_min)\n else:\n return x_max - x_min + min(abs(x_max), abs(x_min))\n\ndef calc_start_and_goal_position(index):\n if index - K >= 0:\n start_index = index - K\n else:\n start_index = 0\n \n if N > index + K:\n goal_index = index\n else:\n goal_index = N - K + 1\n \n return start_index, goal_index\n\nif __name__ == \"__main__\":\n index = -1\n for i, x in enumerate(X):\n if x >= 0:\n index = i \n if index == -1:\n index = i\n \n start_index, goal_index = calc_start_and_goal_position(index)\n\n time_min = float('inf')\n for i in range(start_index, goal_index):\n time = calc_time(X[i:i+K])\n if time < time_min:\n time_min = time\n\n print(time_min)", "code2": "N, K = map(int, input().split())\n\nX = list(map(int, input().split()))\n\ndef calc_time(x_max, x_min):\n if x_max * x_min >= 0:\n if abs(x_max) > abs(x_min):\n return x_max\n else:\n return abs(x_min)\n else:\n return x_max - x_min + min(abs(x_max), abs(x_min))\n\ndef calc_start_and_goal_position(index):\n if index - K >= 0:\n start_index = index - K\n else:\n start_index = 0\n \n if N > index + K + 1:\n goal_index = index + 1\n else:\n goal_index = N - K + 1\n \n return start_index, goal_index\n\nif __name__ == \"__main__\":\n index = -1\n for i, x in enumerate(X):\n if x >= 0:\n index = i \n break\n if index == -1:\n index = i\n start_index, goal_index = calc_start_and_goal_position(index)\n\n time_min = float('inf')\n for i in range(start_index, goal_index):\n time = calc_time(X[i+K-1], X[i])\n if time < time_min:\n time_min = time\n print(time_min)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566677463", "date2": "1566680126", "bleu_score": "0.9666275422747509", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 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, 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, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "8 2\n-9 -7 -4 -4 1 2 4 4\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=8, K=2\n\nX = list(map(int, input().split())) # (1): X=[-9, -7, -4, -4, 1, 2, 4, 4]\n\n\ndef calc_time(X): # (2): calc_time=\n x_max = X[-1]\n x_min = X[0]\n\n if x_max * x_min >= 0:\n if abs(x_max) > abs(x_min):\n return x_max\n else:\n return abs(x_min)\n else:\n return x_max - x_min + min(abs(x_max), abs(x_min))\n\ndef calc_start_and_goal_position(index): # (3): calc_start_and_goal_position=\n if index - K >= 0:\n start_index = index - K\n else:\n start_index = 0\n \n if N > index + K:\n goal_index = index\n else:\n goal_index = N - K + 1\n \n return start_index, goal_index\n\nif __name__ == \"__main__\":\n index = -1\n for i, x in enumerate(X):\n if x >= 0:\n index = i \n if index == -1:\n index = i\n \n start_index, goal_index = calc_start_and_goal_position(index)\n\n time_min = float('inf')\n for i in range(start_index, goal_index):\n time = calc_time(X[i:i+K])\n if time < time_min:\n time_min = time\n\n print(time_min)"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n \n X = list(map(int, input().split()))\n \n-\n-def calc_time(X):\n- x_max = X[-1]\n- x_min = X[0]\n-\n+def calc_time(x_max, x_min):\n if x_max * x_min >= 0:\n if abs(x_max) > abs(x_min):\n return x_max\n else:\n return abs(x_min)\n else:\n return x_max - x_min + min(abs(x_max), abs(x_min))\n \n def calc_start_and_goal_position(index):\n if index - K >= 0:\n start_index = index - K\n else:\n start_index = 0\n \n- if N > index + K:\n- goal_index = index\n+ if N > index + K + 1:\n+ goal_index = index + 1\n else:\n goal_index = N - K + 1\n \n return start_index, goal_index\n \n if __name__ == \"__main__\":\n index = -1\n for i, x in enumerate(X):\n if x >= 0:\n index = i \n+ break\n if index == -1:\n index = i\n- \n start_index, goal_index = calc_start_and_goal_position(index)\n \n time_min = float('inf')\n for i in range(start_index, goal_index):\n- time = calc_time(X[i:i+K])\n+ time = calc_time(X[i+K-1], X[i])\n if time < time_min:\n time_min = time\n-\n print(time_min)\n", "FL_content": " N, K = map(int, input().split())\n \n X = list(map(int, input().split()))\n \n-\n-def calc_time(X):\n- x_max = X[-1]\n- x_min = X[0]\n-\n if x_max * x_min >= 0:\n if abs(x_max) > abs(x_min):\n return x_max\n else:\n return abs(x_min)\n else:\n return x_max - x_min + min(abs(x_max), abs(x_min))\n \n def calc_start_and_goal_position(index):\n if index - K >= 0:\n start_index = index - K\n else:\n start_index = 0\n \n- if N > index + K:\n- goal_index = index\n else:\n goal_index = N - K + 1\n \n return start_index, goal_index\n \n if __name__ == \"__main__\":\n index = -1\n for i, x in enumerate(X):\n if x >= 0:\n index = i \n if index == -1:\n index = i\n- \n start_index, goal_index = calc_start_and_goal_position(index)\n \n time_min = float('inf')\n for i in range(start_index, goal_index):\n- time = calc_time(X[i:i+K])\n if time < time_min:\n time_min = time\n-\n print(time_min)\n", "added_lines": 5, "removed_lines": 10, "code1_lines": 47 }, { "user_id": "u955125992", "problem_id": "p03274", "submission1_id": "s587531628", "submission2_id": "s154584407", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 10 ** 9\n\nif n == 1:\n for i in range(n):\n ans = min(ans, abs(x[i]))\nelif n == k:\n ans = min(abs(x[0]-x[n-1]) + abs(x[n-1]), abs(x[0]) + abs(x[0] - x[n-1]))\nelse:\n for i in range(n-k):\n ans = min(ans, abs(x[i]-x[i+k-1]) + abs(x[i+k-1]), abs(x[i]) + abs(x[i] - x[i+k-1]))\n\nprint(ans)", "code2": "n, k = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 10 ** 9\n\nif k == 1:\n for i in range(n):\n ans = min(ans, abs(x[i]))\nelif n == k:\n ans = min(abs(x[0]-x[n-1]) + abs(x[n-1]), abs(x[0]) + abs(x[0] - x[n-1]))\nelse:\n for i in range(n-k+1):\n ans = min(ans, abs(x[i]-x[i+k-1]) + abs(x[i+k-1]), abs(x[i]) + abs(x[i] - x[i+k-1]))\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589552500", "date2": "1589552790", "bleu_score": "0.984154307990017", "code1_test_status": [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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "5 4\n-30 -5 16 29 67\n", "actual_output": "88\n", "expected_output": "77\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=5, k=4\nx = list(map(int, input().split())) # (1): x=[-30, -5, 16, 29, 67]\n\nans = 10 ** 9 # (2): ans=1000000000\n\nif n == 1: # (3): NO CHANGE\n for i in range(n):\n ans = min(ans, abs(x[i]))\nelif n == k: # (4): NO CHANGE\n ans = min(abs(x[0]-x[n-1]) + abs(x[n-1]), abs(x[0]) + abs(x[0] - x[n-1]))\nelse:\n for i in range(n-k): # (5): i=0 (7): NO CHANGE\n ans = min(ans, abs(x[i]-x[i+k-1]) + abs(x[i+k-1]), abs(x[i]) + abs(x[i] - x[i+k-1])) # (6): ans=88\n\nprint(ans)"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n x = list(map(int, input().split()))\n \n ans = 10 ** 9\n \n-if n == 1:\n+if k == 1:\n for i in range(n):\n ans = min(ans, abs(x[i]))\n elif n == k:\n ans = min(abs(x[0]-x[n-1]) + abs(x[n-1]), abs(x[0]) + abs(x[0] - x[n-1]))\n else:\n- for i in range(n-k):\n+ for i in range(n-k+1):\n ans = min(ans, abs(x[i]-x[i+k-1]) + abs(x[i+k-1]), abs(x[i]) + abs(x[i] - x[i+k-1]))\n \n print(ans)\n", "FL_content": " n, k = map(int, input().split())\n x = list(map(int, input().split()))\n \n ans = 10 ** 9\n \n-if n == 1:\n for i in range(n):\n ans = min(ans, abs(x[i]))\n elif n == k:\n ans = min(abs(x[0]-x[n-1]) + abs(x[n-1]), abs(x[0]) + abs(x[0] - x[n-1]))\n else:\n- for i in range(n-k):\n ans = min(ans, abs(x[i]-x[i+k-1]) + abs(x[i+k-1]), abs(x[i]) + abs(x[i] - x[i+k-1]))\n \n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u553348533", "problem_id": "p03274", "submission1_id": "s386734816", "submission2_id": "s435060345", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int,input().split())\nlistMap = [int(i) for i in input().split()]\nminMin = float(\"inf\")\n\nfor j in range(N - K):\n L = j\n R = j + K - 1\n sumL = abs(listMap[L]) + abs(listMap[L] - listMap[R])\n sumR = abs(listMap[R]) + abs(listMap[R] - listMap[L])\n sum = min(sumL, sumR)\n if sum < minMin:\n minMin = sum\n\nif minMin == float(\"inf\"):\n minMin = listMap[0]\n\nprint(minMin)", "code2": "N, K = map(int,input().split())\nlistMap = [int(i) for i in input().split()]\nminMin = float(\"inf\")\n\nif N == 1:\n minMin = listMap[0]\n\nfor j in range(N - (K - 1)):\n L = j\n R = j + (K - 1)\n sumL = abs(listMap[L]) + abs(listMap[L] - listMap[R])\n sumR = abs(listMap[R]) + abs(listMap[R] - listMap[L])\n sum = min(sumL, sumR)\n if sum < minMin:\n minMin = sum\n\nprint(minMin)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535252567", "date2": "1535255038", "bleu_score": "0.9331262973302716", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 38, "total_score": 103, "input": "4 3\n-30 -2 4 13 50\n", "actual_output": "38\n", "expected_output": "17\n\n", "anno_code": ["N, K = map(int,input().split()) # (0): N=4, K=3\nlistMap = [int(i) for i in input().split()] # (1): listMap=[-30, -2, 4, 13, 50]\nminMin = float(\"inf\") # (2): minMin=inf\n\nfor j in range(N - K): # (3): j=0 (11): NO CHANGE\n L = j # (4): L=0\n R = j + K - 1 # (5): R=2\n sumL = abs(listMap[L]) + abs(listMap[L] - listMap[R]) # (6): sumL=64\n sumR = abs(listMap[R]) + abs(listMap[R] - listMap[L]) # (7): sumR=38\n sum = min(sumL, sumR) # (8): sum=38\n if sum < minMin: # (9): NO CHANGE\n minMin = sum # (10): minMin=38\n\nif minMin == float(\"inf\"): # (12): NO CHANGE\n minMin = listMap[0]\n\nprint(minMin)"], "anno_status": [true], "diff_content": " N, K = map(int,input().split())\n listMap = [int(i) for i in input().split()]\n minMin = float(\"inf\")\n \n-for j in range(N - K):\n+if N == 1:\n+ minMin = listMap[0]\n+\n+for j in range(N - (K - 1)):\n L = j\n- R = j + K - 1\n+ R = j + (K - 1)\n sumL = abs(listMap[L]) + abs(listMap[L] - listMap[R])\n sumR = abs(listMap[R]) + abs(listMap[R] - listMap[L])\n sum = min(sumL, sumR)\n if sum < minMin:\n minMin = sum\n \n-if minMin == float(\"inf\"):\n- minMin = listMap[0]\n-\n print(minMin)\n", "FL_content": " N, K = map(int,input().split())\n listMap = [int(i) for i in input().split()]\n minMin = float(\"inf\")\n \n-for j in range(N - K):\n L = j\n- R = j + K - 1\n sumL = abs(listMap[L]) + abs(listMap[L] - listMap[R])\n sumR = abs(listMap[R]) + abs(listMap[R] - listMap[L])\n sum = min(sumL, sumR)\n if sum < minMin:\n minMin = sum\n \n-if minMin == float(\"inf\"):\n- minMin = listMap[0]\n-\n print(minMin)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 17 }, { "user_id": "u284563808", "problem_id": "p03992", "submission1_id": "s164395746", "submission2_id": "s743541937", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nprint(s[:4]+'_'+s[4:])", "code2": "s=input()\nprint(s[:4]+' '+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1475176632", "date2": "1475176720", "bleu_score": "0.9157103753711766", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ALBHEDBFFJHJ\n", "actual_output": "ALBH_EDBFFJHJ\n", "expected_output": "ALBH EDBFFJHJ\n\n", "anno_code": ["s=input() # (0): s=ALBHEDBFFJHJ\nprint(s[:4]+'_'+s[4:])"], "anno_status": [true], "diff_content": " s=input()\n-print(s[:4]+'_'+s[4:])\n+print(s[:4]+' '+s[4:])\n", "FL_content": " s=input()\n-print(s[:4]+'_'+s[4:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u541475502", "problem_id": "p03992", "submission1_id": "s163797489", "submission2_id": "s321600239", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nprint(s)\nprint(s[:4],s[4:])", "code2": "s = input()\nprint(s[:4],s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563833229", "date2": "1563833290", "bleu_score": "0.740818220681718", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ETAUDARGTSOP\n", "actual_output": "ETAUDARGTSOP\nETAU DARGTSOP\n", "expected_output": "ETAU DARGTSOP\n\n", "anno_code": ["s = input() # (0): s=ETAUDARGTSOP\nprint(s) # (1): NO CHANGE\nprint(s[:4],s[4:])"], "anno_status": [true], "diff_content": " s = input()\n-print(s)\n print(s[:4],s[4:])\n", "FL_content": " s = input()\n-print(s)\n print(s[:4],s[4:])\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u396495667", "problem_id": "p03992", "submission1_id": "s475637638", "submission2_id": "s960214504", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nf= ''.join(s[:4])\nb=''.join(s[4:])\nprint(f,'',b)", "code2": "s = list(input())\nf= ''.join(s[:4])\nb=''.join(s[4:])\nprint(f,b,sep=' ')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569334214", "date2": "1569334274", "bleu_score": "0.8767178439499965", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "QESTGOBUFBTQ\n", "actual_output": "QEST GOBUFBTQ\n", "expected_output": "QEST GOBUFBTQ\n\n", "anno_code": ["s = list(input()) # (0): s=['Q', 'E', 'S', 'T', 'G', 'O', 'B', 'U', 'F', 'B', 'T', 'Q']\nf= ''.join(s[:4]) # (1): f=QEST\nb=''.join(s[4:]) # (2): b=GOBUFBTQ\nprint(f,'',b)"], "anno_status": [true], "diff_content": " s = list(input())\n f= ''.join(s[:4])\n b=''.join(s[4:])\n-print(f,'',b)\n+print(f,b,sep=' ')\n", "FL_content": " s = list(input())\n f= ''.join(s[:4])\n b=''.join(s[4:])\n-print(f,'',b)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u859897687", "problem_id": "p03992", "submission1_id": "s214357355", "submission2_id": "s439040838", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nprint(s[:4]+' '+s[5:])", "code2": "s=input()\nprint(s[:4]+' '+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553862896", "date2": "1553862952", "bleu_score": "0.9157103753711766", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "JHJFFBDEIBKA\n", "actual_output": "JHJF BDEIBKA\n", "expected_output": "JHJF FBDEIBKA\n\n", "anno_code": ["s=input() # (0): s=JHJFFBDEIBKA\nprint(s[:4]+' '+s[5:])"], "anno_status": [true], "diff_content": " s=input()\n-print(s[:4]+' '+s[5:])\n+print(s[:4]+' '+s[4:])\n", "FL_content": " s=input()\n-print(s[:4]+' '+s[5:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u995062424", "problem_id": "p03992", "submission1_id": "s840033928", "submission2_id": "s903542101", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nprint(s[:4]+' '+s[5:])", "code2": "s=input()\nprint(s[:4]+' '+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578890498", "date2": "1578890563", "bleu_score": "0.9157103753711766", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "QRSTGOBUEBTF\n", "actual_output": "QRST OBUEBTF\n", "expected_output": "QRST GOBUEBTF\n\n", "anno_code": ["s=input() # (0): s=QRSTGOBUEBTF\nprint(s[:4]+' '+s[5:])"], "anno_status": [true], "diff_content": " s=input()\n-print(s[:4]+' '+s[5:])\n+print(s[:4]+' '+s[4:])\n", "FL_content": " s=input()\n-print(s[:4]+' '+s[5:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u290187182", "problem_id": "p03992", "submission1_id": "s588862308", "submission2_id": "s275917706", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\ndef lcm(x, y):\n return (x * y) \n\nif __name__ == '__main__':\n a = [str(i) for i in input().split()]\n print(a[0][:4]+\" \"+a[0][5:])\n", "code2": "import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\ndef lcm(x, y):\n return (x * y) \n\nif __name__ == '__main__':\n a = [str(i) for i in input().split()]\n print(a[0][:4]+\" \"+a[0][4:])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585597958", "date2": "1585597991", "bleu_score": "0.991631557876558", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ALBIEDBFFJHJ\n", "actual_output": "ALBI DBFFJHJ\n", "expected_output": "ALBI EDBFFJHJ\n\n", "anno_code": ["import sys\nimport copy\nimport math\nimport bisect\nimport pprint\nimport bisect\nfrom functools import reduce\nfrom copy import deepcopy\nfrom collections import deque\n\ndef lcm(x, y): # (0): lcm=\n return (x * y) \n\nif __name__ == '__main__':\n a = [str(i) for i in input().split()]\n print(a[0][:4]+\" \"+a[0][5:])\n"], "anno_status": [true], "diff_content": " import sys\n import copy\n import math\n import bisect\n import pprint\n import bisect\n from functools import reduce\n from copy import deepcopy\n from collections import deque\n \n def lcm(x, y):\n return (x * y) \n \n if __name__ == '__main__':\n a = [str(i) for i in input().split()]\n- print(a[0][:4]+\" \"+a[0][5:])\n+ print(a[0][:4]+\" \"+a[0][4:])\n \n", "FL_content": " import sys\n import copy\n import math\n import bisect\n import pprint\n import bisect\n from functools import reduce\n from copy import deepcopy\n from collections import deque\n \n def lcm(x, y):\n return (x * y) \n \n if __name__ == '__main__':\n a = [str(i) for i in input().split()]\n- print(a[0][:4]+\" \"+a[0][5:])\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u331464808", "problem_id": "p03992", "submission1_id": "s441017628", "submission2_id": "s614170133", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nprint(s[:3]+' '+s[3:])", "code2": "s = input()\nprint(s[:4]+' '+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555691647", "date2": "1555691759", "bleu_score": "0.8403034716144353", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "DOBEEFSUJV@L\n", "actual_output": "DOB EEFSUJV@L\n", "expected_output": "DOBE EFSUJV@L\n\n", "anno_code": ["s = input() # (0): s=DOBEEFSUJV@L\nprint(s[:3]+' '+s[3:])"], "anno_status": [true], "diff_content": " s = input()\n-print(s[:3]+' '+s[3:])\n+print(s[:4]+' '+s[4:])\n", "FL_content": " s = input()\n-print(s[:3]+' '+s[3:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u328755070", "problem_id": "p03992", "submission1_id": "s580081854", "submission2_id": "s296330512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nans = s[:5] + ' ' + s[5:]\n\nprint(ans)", "code2": "s = input()\n\nans = s[:4] + ' ' + s[4:]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544985654", "date2": "1544985708", "bleu_score": "0.8944696664691558", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "FOBFDERUJV@L\n", "actual_output": "FOBFD ERUJV@L\n", "expected_output": "FOBF DERUJV@L\n\n", "anno_code": ["s = input() # (0): s=FOBFDERUJV@L\n\nans = s[:5] + ' ' + s[5:] # (1): ans=FOBFD ERUJV@L\n\nprint(ans)"], "anno_status": [true], "diff_content": " s = input()\n \n-ans = s[:5] + ' ' + s[5:]\n+ans = s[:4] + ' ' + s[4:]\n \n print(ans)\n", "FL_content": " s = input()\n \n-ans = s[:5] + ' ' + s[5:]\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u532966492", "problem_id": "p03992", "submission1_id": "s791130027", "submission2_id": "s697458295", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nprint(s[:4]+\" \"+s[5:])", "code2": "s=input()\nprint(s[:4]+\" \"+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557321155", "date2": "1557321184", "bleu_score": "0.9157103753711766", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "JHJFGBDFIBKA\n", "actual_output": "JHJF BDFIBKA\n", "expected_output": "JHJF GBDFIBKA\n\n", "anno_code": ["s=input() # (0): s=JHJFGBDFIBKA\nprint(s[:4]+\" \"+s[5:])"], "anno_status": [true], "diff_content": " s=input()\n-print(s[:4]+\" \"+s[5:])\n+print(s[:4]+\" \"+s[4:])\n", "FL_content": " s=input()\n-print(s[:4]+\" \"+s[5:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u740284863", "problem_id": "p03992", "submission1_id": "s014052935", "submission2_id": "s041802795", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=str(input())\nprint(s[0:3]+\" \"+s[4:])", "code2": "s= str(input())\nprint(s[0:4]+\" \"+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550277014", "date2": "1550277461", "bleu_score": "0.87000545581096", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "EOCUJLSFDVAE\n", "actual_output": "EOC JLSFDVAE\n", "expected_output": "EOCU JLSFDVAE\n\n", "anno_code": ["s=str(input()) # (0): s=EOCUJLSFDVAE\nprint(s[0:3]+\" \"+s[4:])"], "anno_status": [true], "diff_content": "-s=str(input())\n-print(s[0:3]+\" \"+s[4:])\n+s= str(input())\n+print(s[0:4]+\" \"+s[4:])\n", "FL_content": "-s=str(input())\n-print(s[0:3]+\" \"+s[4:])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u836737505", "problem_id": "p03992", "submission1_id": "s661590698", "submission2_id": "s845049579", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nprint(s[:4]+\" \"+s[5:])", "code2": "s = input()\nprint(s[:4]+\" \"+s[4:])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583873384", "date2": "1583873505", "bleu_score": "0.9210500207490827", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "L@VITSEFECOC\n", "actual_output": "L@VI SEFECOC\n", "expected_output": "L@VI TSEFECOC\n\n", "anno_code": ["s = input() # (0): s=L@VITSEFECOC\nprint(s[:4]+\" \"+s[5:])"], "anno_status": [true], "diff_content": " s = input()\n-print(s[:4]+\" \"+s[5:])\n+print(s[:4]+\" \"+s[4:])\n", "FL_content": " s = input()\n-print(s[:4]+\" \"+s[5:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u331464808", "problem_id": "p03992", "submission1_id": "s157893759", "submission2_id": "s614170133", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nprint(s[:3]+' '+s[4:])", "code2": "s = input()\nprint(s[:4]+' '+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555691631", "date2": "1555691759", "bleu_score": "0.9210500207490827", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "QGSTGOBUFBUQ\n", "actual_output": "QGS GOBUFBUQ\n", "expected_output": "QGST GOBUFBUQ\n\n", "anno_code": ["s = input() # (0): s=QGSTGOBUFBUQ\nprint(s[:3]+' '+s[4:])"], "anno_status": [true], "diff_content": " s = input()\n-print(s[:3]+' '+s[4:])\n+print(s[:4]+' '+s[4:])\n", "FL_content": " s = input()\n-print(s[:3]+' '+s[4:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u836737505", "problem_id": "p03992", "submission1_id": "s107960937", "submission2_id": "s845049579", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nprint(s[:4]+\"\"+s[5:])", "code2": "s = input()\nprint(s[:4]+\" \"+s[4:])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583873334", "date2": "1583873505", "bleu_score": "0.8403034716144353", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "JOCUEESFDVAL\n", "actual_output": "JOCUESFDVAL\n", "expected_output": "JOCU EESFDVAL\n\n", "anno_code": ["s = input() # (0): s=JOCUEESFDVAL\nprint(s[:4]+\"\"+s[5:])"], "anno_status": [true], "diff_content": " s = input()\n-print(s[:4]+\"\"+s[5:])\n+print(s[:4]+\" \"+s[4:])\n", "FL_content": " s = input()\n-print(s[:4]+\"\"+s[5:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u258009780", "problem_id": "p03992", "submission1_id": "s302469794", "submission2_id": "s870504419", "status1": "Wrong Answer", "status2": "Accepted", "code1": "d = input()\nprint(d[0:3] + \" \" + d[4:])", "code2": "d = input()\nprint(d[:4] + \" \" + d[4:])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527564711", "date2": "1527564779", "bleu_score": "0.8844022960737005", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "KBFBGBDJIHKF\n", "actual_output": "KBF GBDJIHKF\n", "expected_output": "KBFB GBDJIHKF\n\n", "anno_code": ["d = input() # (0): d=KBFBGBDJIHKF\nprint(d[0:3] + \" \" + d[4:])"], "anno_status": [true], "diff_content": " d = input()\n-print(d[0:3] + \" \" + d[4:])\n+print(d[:4] + \" \" + d[4:])\n+\n", "FL_content": " d = input()\n-print(d[0:3] + \" \" + d[4:])\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u766407523", "problem_id": "p03992", "submission1_id": "s213940868", "submission2_id": "s937356107", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nprint(S[:5] + ' ' + S[5:])", "code2": "S = input()\nprint(S[:4] + ' ' + S[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525402338", "date2": "1525402372", "bleu_score": "0.8584922885264843", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "JHJFFBDEIBKA\n", "actual_output": "JHJFF BDEIBKA\n", "expected_output": "JHJF FBDEIBKA\n\n", "anno_code": ["S = input() # (0): S=JHJFFBDEIBKA\nprint(S[:5] + ' ' + S[5:])"], "anno_status": [true], "diff_content": " S = input()\n-print(S[:5] + ' ' + S[5:])\n+print(S[:4] + ' ' + S[4:])\n", "FL_content": " S = input()\n-print(S[:5] + ' ' + S[5:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u414458988", "problem_id": "p03992", "submission1_id": "s806562459", "submission2_id": "s981522988", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nprint(s[:4],'',s[4:])", "code2": "s=input()\nprint(s[:4],s[4:])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585703966", "date2": "1585704034", "bleu_score": "0.8712786465100599", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "L@VITRECFCOF\n", "actual_output": "L@VI TRECFCOF\n", "expected_output": "L@VI TRECFCOF\n\n", "anno_code": ["s=input() # (0): s=L@VITRECFCOF\nprint(s[:4],'',s[4:])"], "anno_status": [true], "diff_content": " s=input()\n-print(s[:4],'',s[4:])\n+print(s[:4],s[4:])\n", "FL_content": " s=input()\n-print(s[:4],'',s[4:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u667024514", "problem_id": "p03992", "submission1_id": "s621357722", "submission2_id": "s314708391", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = str(input())\nprint(s[0:3] + \" \" + s[4:])", "code2": "s = str(input())\nprint(s[0:4] + \" \" + s[4:])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521463504", "date2": "1521463712", "bleu_score": "0.9184043388013005", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "QTBFUBOGTSFQ\n", "actual_output": "QTB UBOGTSFQ\n", "expected_output": "QTBF UBOGTSFQ\n\n", "anno_code": ["s = str(input()) # (0): s=QTBFUBOGTSFQ\nprint(s[0:3] + \" \" + s[4:])"], "anno_status": [true], "diff_content": " s = str(input())\n-print(s[0:3] + \" \" + s[4:])\n+print(s[0:4] + \" \" + s[4:])\n+\n", "FL_content": " s = str(input())\n-print(s[0:3] + \" \" + s[4:])\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u094191970", "problem_id": "p03992", "submission1_id": "s730619305", "submission2_id": "s794395917", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nprint(s[:4]+''+s[4:])", "code2": "s=input()\nprint(s[:4]+' '+s[4:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574145645", "date2": "1574145683", "bleu_score": "0.9157103753711766", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "QTCFUBOHSSGQ\n", "actual_output": "QTCFUBOHSSGQ\n", "expected_output": "QTCF UBOHSSGQ\n\n", "anno_code": ["s=input() # (0): s=QTCFUBOHSSGQ\nprint(s[:4]+''+s[4:])"], "anno_status": [true], "diff_content": " s=input()\n-print(s[:4]+''+s[4:])\n+print(s[:4]+' '+s[4:])\n", "FL_content": " s=input()\n-print(s[:4]+''+s[4:])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u422104747", "problem_id": "p03992", "submission1_id": "s916667161", "submission2_id": "s145791660", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nss=s[0:3]+\" \"+s[4:]\nprint(ss)", "code2": "s=input()\nss=s[0:4]+\" \"+s[4:]\nprint(ss)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1474765305", "date2": "1474765815", "bleu_score": "0.931838481115484", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "KOCUEFSFDVAJ\n", "actual_output": "KOC EFSFDVAJ\n", "expected_output": "KOCU EFSFDVAJ\n\n", "anno_code": ["s=input() # (0): s=KOCUEFSFDVAJ\nss=s[0:3]+\" \"+s[4:] # (1): ss=KOC EFSFDVAJ\nprint(ss)"], "anno_status": [true], "diff_content": " s=input()\n-ss=s[0:3]+\" \"+s[4:]\n+ss=s[0:4]+\" \"+s[4:]\n print(ss)\n", "FL_content": " s=input()\n-ss=s[0:3]+\" \"+s[4:]\n print(ss)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u685244071", "problem_id": "p03992", "submission1_id": "s334820153", "submission2_id": "s568837627", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\na = s[0:4]\nb = s[4:-1]\n\nprint('{} {}'.format(a, b))\n", "code2": "s = input()\n\na = s[:4]\nb = s[-8:]\n\nprint('{} {}'.format(a, b))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591636404", "date2": "1591636514", "bleu_score": "0.8639636851493379", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "KBFBGBDJIHKF\n", "actual_output": "KBFB GBDJIHK\n", "expected_output": "KBFB GBDJIHKF\n\n", "anno_code": ["s = input() # (0): s=KBFBGBDJIHKF\n\na = s[0:4] # (1): a=KBFB\nb = s[4:-1] # (2): b=GBDJIHK\n\nprint('{} {}'.format(a, b))\n"], "anno_status": [true], "diff_content": " s = input()\n \n-a = s[0:4]\n-b = s[4:-1]\n+a = s[:4]\n+b = s[-8:]\n \n print('{} {}'.format(a, b))\n-\n", "FL_content": " s = input()\n \n-a = s[0:4]\n-b = s[4:-1]\n \n print('{} {}'.format(a, b))\n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u540799318", "problem_id": "p02959", "submission1_id": "s627653052", "submission2_id": "s084328309", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = 0\n\ndef cal(ans, n):\n ans += min(a[n], b[n])\n ans += b[n] - min(a[n], b[n])\n a[n+1] -= min(a[n], b[n])\n \nfor i in range(n):\n cal(ans,i)\n\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = 0\n\ndef f(n):\n nn = min(a[n], b[n])\n nnn = min(a[n+1], b[n] - nn)\n a[n+1] -= nnn\n return nn + nnn\n\nfor i in range(n):\n ans += f(i)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564283887", "date2": "1564286368", "bleu_score": "0.7969690913173144", "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, 0, 0, 0, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 103, "input": "3\n0 0 0 21\n2 100 8\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(map(int, input().split())) # (1): a=[0, 0, 0, 21]\nb = list(map(int, input().split())) # (2): b=[2, 100, 8]\nans = 0 # (3): ans=0\n\ndef cal(ans, n): # (4): cal=\n ans += min(a[n], b[n]) # (7): NO CHANGE (12): NO CHANGE (17): NO CHANGE\n ans += b[n] - min(a[n], b[n]) # (8): ans=2 (13): ans=100 (18): ans=8\n a[n+1] -= min(a[n], b[n]) # (9): n=3, a=[0, 0, 0, 21], b=[2, 100, 8], ans=0, cal=, i=0 (14): n=3, a=[0, 0, 0, 21], b=[2, 100, 8], ans=0, cal=, i=1 (19): n=3, a=[0, 0, 0, 21], b=[2, 100, 8], ans=0, cal=, i=2\n \nfor i in range(n): # (5): i=0 (10): i=1 ... (20): NO CHANGE\n cal(ans,i) # (6): n=0 (11): n=1 (16): n=2\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 ans = 0\n \n-def cal(ans, n):\n- ans += min(a[n], b[n])\n- ans += b[n] - min(a[n], b[n])\n- a[n+1] -= min(a[n], b[n])\n- \n+def f(n):\n+ nn = min(a[n], b[n])\n+ nnn = min(a[n+1], b[n] - nn)\n+ a[n+1] -= nnn\n+ return nn + nnn\n+\n for i in range(n):\n- cal(ans,i)\n+ ans += f(i)\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 ans = 0\n \n-def cal(ans, n):\n- ans += min(a[n], b[n])\n- ans += b[n] - min(a[n], b[n])\n- a[n+1] -= min(a[n], b[n])\n- \n for i in range(n):\n- cal(ans,i)\n \n print(ans)\n-\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 15 }, { "user_id": "u277353449", "problem_id": "p02959", "submission1_id": "s197264580", "submission2_id": "s079474479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\na=input().split()\nb=input().split()\nfor i in range(0,N):\n a[i]=int(a[i])\n b[i]=int(b[i])\na[N]=int(a[N])\nanswer=sum(a)\nfor i in range(0,N):\n c=b[i]-a[i]\n if c<0:\n a[i]=-c\n b[i]=0\n else:\n a[i]=0\n b[i]=c\n d=b[i]-a[i+1]\n if d<0:\n a[i+1]=-c\n b[i]=0\n else:\n a[i+1]=0\n b[i]=c\nprint (answer-sum(a))", "code2": "N=int(input())\na=input().split()\nb=input().split()\nfor i in range(0,N):\n a[i]=int(a[i])\n b[i]=int(b[i])\na[N]=int(a[N])\nanswer=sum(a)\nfor i in range(0,N):\n c=b[i]-a[i]\n if c<0:\n a[i]=-c\n b[i]=0\n else:\n a[i]=0\n b[i]=c\n d=b[i]-a[i+1]\n if d<0:\n a[i+1]=-d\n b[i]=0\n else:\n a[i+1]=0\n b[i]=d\nprint (answer-sum(a))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564279389", "date2": "1564279575", "bleu_score": "0.9867894715201238", "code1_test_status": [1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 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, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 74, "total_score": 103, "input": "3\n0 4 2 13\n3 100 8\n", "actual_output": "27\n", "expected_output": "14\n\n", "anno_code": ["N=int(input()) # (0): N=3\na=input().split() # (1): a=['0', '4', '2', '13']\nb=input().split() # (2): b=['3', '100', '8']\nfor i in range(0,N): # (3): i=0 (6): i=1 ... (12): NO CHANGE\n a[i]=int(a[i]) # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n b[i]=int(b[i]) # (5): NO CHANGE (8): NO CHANGE (11): b=[3, 100, 8]\na[N]=int(a[N]) # (13): a=[0, 4, 2, 13]\nanswer=sum(a) # (14): answer=19\nfor i in range(0,N): # (15): i=0 (24): i=1 ... (42): NO CHANGE\n c=b[i]-a[i] # (16): c=3 (25): c=103 (34): c=8\n if c<0: # (17): NO CHANGE (26): NO CHANGE (35): NO CHANGE\n a[i]=-c\n b[i]=0\n else:\n a[i]=0 # (18): NO CHANGE (27): a=[0, 0, 2, 13] (36): NO CHANGE\n b[i]=c # (19): NO CHANGE (28): b=[0, 103, 8] (37): NO CHANGE\n d=b[i]-a[i+1] # (20): d=-1 (29): d=101 (38): d=-5\n if d<0: # (21): NO CHANGE (30): NO CHANGE (39): NO CHANGE\n a[i+1]=-c # (22): a=[0, -3, 2, 13] (40): a=[0, 0, 0, -8]\n b[i]=0 # (23): b=[0, 100, 8] (41): b=[0, 103, 0]\n else:\n a[i+1]=0 # (31): a=[0, 0, 0, 13]\n b[i]=c # (32): NO CHANGE\nprint (answer-sum(a))"], "anno_status": [true], "diff_content": " N=int(input())\n a=input().split()\n b=input().split()\n for i in range(0,N):\n a[i]=int(a[i])\n b[i]=int(b[i])\n a[N]=int(a[N])\n answer=sum(a)\n for i in range(0,N):\n c=b[i]-a[i]\n if c<0:\n a[i]=-c\n b[i]=0\n else:\n a[i]=0\n b[i]=c\n d=b[i]-a[i+1]\n if d<0:\n- a[i+1]=-c\n+ a[i+1]=-d\n b[i]=0\n else:\n a[i+1]=0\n- b[i]=c\n+ b[i]=d\n print (answer-sum(a))\n", "FL_content": " N=int(input())\n a=input().split()\n b=input().split()\n for i in range(0,N):\n a[i]=int(a[i])\n b[i]=int(b[i])\n a[N]=int(a[N])\n answer=sum(a)\n for i in range(0,N):\n c=b[i]-a[i]\n if c<0:\n a[i]=-c\n b[i]=0\n else:\n a[i]=0\n b[i]=c\n d=b[i]-a[i+1]\n if d<0:\n- a[i+1]=-c\n b[i]=0\n else:\n a[i+1]=0\n- b[i]=c\n print (answer-sum(a))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u237493274", "problem_id": "p02959", "submission1_id": "s235514571", "submission2_id": "s715191594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(n):\n ab = a[i] - b[i]\n if ab < 0:\n ans += a[i]\n b[i] -= a[i]\n ab = a[i+1] - b[i]\n \n if ab <= 0:\n ans += a[i+1]\n a[i+1] = 0\n else:\n ans += b[i]\n \n elif ab == 0:\n ans += b[i]\n \n else:\n ans += b[i]\n \nprint(ans)", "code2": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(n):\n ab = a[i] - b[i]\n \n if ab < 0:\n ans += a[i]\n b[i] -= a[i]\n a[i] = 0\n b[i] = abs(ab)\n ab = a[i+1] - b[i]\n \n if ab <= 0:\n ans += a[i+1]\n a[i+1] = 0\n b[i] = abs(ab)\n else:\n ans += b[i]\n a[i+1] -= b[i]\n b[i] = 0\n \n elif ab == 0:\n ans += b[i]\n a[i] = 0\n b[i] = 0\n \n else:\n ans += b[i]\n b[i] = 0\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564277438", "date2": "1564278866", "bleu_score": "0.7221759987726543", "code1_test_status": [1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 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, 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], "code1_test_score": 93, "total_score": 103, "input": "3\n0 4 0 13\n3 100 8\n", "actual_output": "15\n", "expected_output": "12\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(map(int, input().split())) # (1): a=[0, 4, 0, 13]\nb = list(map(int, input().split())) # (2): b=[3, 100, 8]\n\nans = 0 # (3): ans=0\n\nfor i in range(n): # (4): i=0 (12): i=1 ... (29): NO CHANGE\n ab = a[i] - b[i] # (5): ab=-3 (13): ab=-96 (22): ab=-8\n if ab < 0: # (6): NO CHANGE (14): NO CHANGE (23): NO CHANGE\n ans += a[i] # (7): NO CHANGE (15): ans=7 (24): NO CHANGE\n b[i] -= a[i] # (8): NO CHANGE (16): b=[3, 96, 8] (25): NO CHANGE\n ab = a[i+1] - b[i] # (9): ab=1 (17): NO CHANGE (26): ab=5\n \n if ab <= 0: # (10): NO CHANGE (18): NO CHANGE (27): NO CHANGE\n ans += a[i+1] # (19): NO CHANGE\n a[i+1] = 0 # (20): NO CHANGE\n else:\n ans += b[i] # (11): ans=3 (28): ans=15\n \n elif ab == 0:\n ans += b[i]\n \n else:\n ans += b[i]\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 \n ans = 0\n \n for i in range(n):\n ab = a[i] - b[i]\n+ \n if ab < 0:\n ans += a[i]\n b[i] -= a[i]\n+ a[i] = 0\n+ b[i] = abs(ab)\n ab = a[i+1] - b[i]\n \n if ab <= 0:\n ans += a[i+1]\n a[i+1] = 0\n+ b[i] = abs(ab)\n else:\n ans += b[i]\n+ a[i+1] -= b[i]\n+ b[i] = 0\n \n elif ab == 0:\n ans += b[i]\n+ a[i] = 0\n+ b[i] = 0\n \n else:\n ans += b[i]\n+ b[i] = 0\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 \n ans = 0\n \n for i in range(n):\n ab = a[i] - b[i]\n if ab < 0:\n ans += a[i]\n b[i] -= a[i]\n ab = a[i+1] - b[i]\n \n if ab <= 0:\n ans += a[i+1]\n a[i+1] = 0\n else:\n ans += b[i]\n \n elif ab == 0:\n ans += b[i]\n \n else:\n ans += b[i]\n \n print(ans)\n", "added_lines": 9, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u821712904", "problem_id": "p02959", "submission1_id": "s816929275", "submission2_id": "s383407535", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=[int(i) for i in input().split()]\nb=[int(i) for i in input().split()]\na1=a\nfor i in range(n):\n if b[i]>=a[i]+a[i+1]:\n a[i],a[i+1]=0,0\n elif b[i]>=a[i]:\n a[i+1]=b[i]-a[i]\n a[i]=0\n else:\n a[i]-=b[i]\nprint(sum(a1)-sum(a))\n ", "code2": "n=int(input())\na=[int(i) for i in input().split()]\nb=[int(i) for i in input().split()]\nasum=sum(a)\na1=a\nans=0\nfor i in range(n):\n if b[i]>=a1[i]+a1[i+1]:\n a1[i],a1[i+1]=0,0\n ans+=a1[i]+a1[i+1]\n elif b[i]>=a1[i]:\n a1[i+1]-=b[i]-a1[i]\n a1[i]=0\n ans+=b[i]\n else:\n a1[i]-=b[i]\n ans+=b[i]\nprint(asum-sum(a1))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574730897", "date2": "1574732393", "bleu_score": "0.7116589713719976", "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, 0, 0, 0, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 103, "input": "2\n100 6 -3\n1 110\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["n=int(input()) # (0): n=2\na=[int(i) for i in input().split()] # (1): a=[100, 6, -3]\nb=[int(i) for i in input().split()] # (2): b=[1, 110]\na1=a # (3): a1=[100, 6, -3]\nfor i in range(n): # (4): i=0 (8): i=1 (11): NO CHANGE\n if b[i]>=a[i]+a[i+1]: # (5): NO CHANGE (9): NO CHANGE\n a[i],a[i+1]=0,0 # (10): a=[99, 0, 0], a1=[99, 0, 0]\n elif b[i]>=a[i]: # (6): NO CHANGE\n a[i+1]=b[i]-a[i]\n a[i]=0\n else:\n a[i]-=b[i] # (7): a=[99, 6, -3], a1=[99, 6, -3]\nprint(sum(a1)-sum(a))\n "], "anno_status": [true], "diff_content": " n=int(input())\n a=[int(i) for i in input().split()]\n b=[int(i) for i in input().split()]\n+asum=sum(a)\n a1=a\n+ans=0\n for i in range(n):\n- if b[i]>=a[i]+a[i+1]:\n- a[i],a[i+1]=0,0\n- elif b[i]>=a[i]:\n- a[i+1]=b[i]-a[i]\n- a[i]=0\n+ if b[i]>=a1[i]+a1[i+1]:\n+ a1[i],a1[i+1]=0,0\n+ ans+=a1[i]+a1[i+1]\n+ elif b[i]>=a1[i]:\n+ a1[i+1]-=b[i]-a1[i]\n+ a1[i]=0\n+ ans+=b[i]\n else:\n- a[i]-=b[i]\n-print(sum(a1)-sum(a))\n- \n+ a1[i]-=b[i]\n+ ans+=b[i]\n+print(asum-sum(a1))\n+\n", "FL_content": " n=int(input())\n a=[int(i) for i in input().split()]\n b=[int(i) for i in input().split()]\n a1=a\n for i in range(n):\n- if b[i]>=a[i]+a[i+1]:\n- a[i],a[i+1]=0,0\n- elif b[i]>=a[i]:\n- a[i+1]=b[i]-a[i]\n- a[i]=0\n else:\n- a[i]-=b[i]\n-print(sum(a1)-sum(a))\n- \n", "added_lines": 13, "removed_lines": 8, "code1_lines": 14 }, { "user_id": "u516554284", "problem_id": "p02959", "submission1_id": "s012495194", "submission2_id": "s104569276", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=0\nfor i in range(n):\n if a[i]>b[i]:\n c+=b[i]\n elif a[i]<=b[i]:\n \n if a[i+1]-(b[i]-a[i])>=0:\n c+=b[i]\n a[i+1]==a[i+1]-(b[i]-a[i])\n else:\n c+=a[i+1]\n a[i+1]==0\nprint(c)\n\n", "code2": "n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=0\nfor i in range(n):\n if a[i]>b[i]:\n c+=b[i]\n elif a[i]<=b[i]:\n \n if a[i+1]-(b[i]-a[i])>=0:\n c+=b[i]\n a[i+1]-=(b[i]-a[i])\n else:\n c+=a[i+1]+a[i]\n a[i+1]=0\nprint(c)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565287740", "date2": "1565287983", "bleu_score": "0.9652664897446684", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 31, "total_score": 103, "input": "3\n0 4 1 8\n2 100 8\n", "actual_output": "11\n", "expected_output": "13\n\n", "anno_code": ["n=int(input()) # (0): n=3\na=list(map(int,input().split())) # (1): a=[0, 4, 1, 8]\nb=list(map(int,input().split())) # (2): b=[2, 100, 8]\nc=0 # (3): c=0\nfor i in range(n): # (4): i=0 (10): i=1 ... (22): NO CHANGE\n if a[i]>b[i]: # (5): NO CHANGE (11): NO CHANGE (17): NO CHANGE\n c+=b[i]\n elif a[i]<=b[i]: # (6): NO CHANGE (12): NO CHANGE (18): NO CHANGE\n \n if a[i+1]-(b[i]-a[i])>=0: # (7): NO CHANGE (13): NO CHANGE (19): NO CHANGE\n c+=b[i] # (8): c=2 (20): c=11\n a[i+1]==a[i+1]-(b[i]-a[i]) # (9): NO CHANGE (21): NO CHANGE\n else:\n c+=a[i+1] # (14): c=3\n a[i+1]==0 # (15): NO CHANGE\nprint(c)\n\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=0\n for i in range(n):\n if a[i]>b[i]:\n c+=b[i]\n elif a[i]<=b[i]:\n \n if a[i+1]-(b[i]-a[i])>=0:\n c+=b[i]\n- a[i+1]==a[i+1]-(b[i]-a[i])\n+ a[i+1]-=(b[i]-a[i])\n else:\n- c+=a[i+1]\n- a[i+1]==0\n+ c+=a[i+1]+a[i]\n+ a[i+1]=0\n print(c)\n \n \n", "FL_content": " n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n c=0\n for i in range(n):\n if a[i]>b[i]:\n c+=b[i]\n elif a[i]<=b[i]:\n \n if a[i+1]-(b[i]-a[i])>=0:\n c+=b[i]\n- a[i+1]==a[i+1]-(b[i]-a[i])\n else:\n- c+=a[i+1]\n- a[i+1]==0\n print(c)\n \n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u225845681", "problem_id": "p02959", "submission1_id": "s495875760", "submission2_id": "s980464352", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nteki = input().split()\nyusya = input().split()\ni = 0\ntaoshita = 0\n\nwhile i < N :\n if int(teki[i]) >= int(yusya[i]):\n a = int(yusya[i]) \n b = 0\n else:\n a = int(teki[i])\n yusya[i] = int(yusya[i]) - int(teki[i])\n if int(teki[i+1]) >= yusya[i]:\n b = yusya[i]\n teki[i+1] = int(teki[i+1]) - yusya[i]\n else:\n b = int(teki[i+1])\n taoshita += a + b\n i += 1\n\nprint(taoshita)", "code2": "N = int(input())\nteki = input().split()\nyusya = input().split()\ni = 0\ntaoshita = 0\n\nwhile i < N :\n if int(teki[i]) >= int(yusya[i]):\n a = int(yusya[i]) \n b = 0\n else:\n a = int(teki[i])\n yusya[i] = int(yusya[i]) - int(teki[i])\n if int(teki[i+1]) >= yusya[i]:\n b = yusya[i]\n teki[i+1] = int(teki[i+1]) - yusya[i]\n else:\n b = int(teki[i+1])\n teki[i+1] = 0\n taoshita += a + b\n i += 1\n \nprint(taoshita)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564281166", "date2": "1564281548", "bleu_score": "0.9463975478271127", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 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, 1, 1, 0, 1, 0, 1, 0, 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], "code1_test_score": 84, "total_score": 103, "input": "3\n0 34 -2 -1\n-1 111 14\n", "actual_output": "28\n", "expected_output": "30\n\n", "anno_code": ["N = int(input()) # (0): N=3\nteki = input().split() # (1): teki=['0', '34', '-2', '-1']\nyusya = input().split() # (2): yusya=['-1', '111', '14']\ni = 0 # (3): i=0\ntaoshita = 0 # (4): taoshita=0\n\nwhile i < N : # (5): NO CHANGE (11): NO CHANGE ... (27): NO CHANGE\n if int(teki[i]) >= int(yusya[i]): # (6): NO CHANGE (12): NO CHANGE (20): NO CHANGE\n a = int(yusya[i]) # (7): a=-1\n b = 0 # (8): b=0\n else:\n a = int(teki[i]) # (13): a=34 (21): a=-2\n yusya[i] = int(yusya[i]) - int(teki[i]) # (14): yusya=['-1', 77, '14'] (22): yusya=['-1', 77, 16]\n if int(teki[i+1]) >= yusya[i]: # (15): NO CHANGE (23): NO CHANGE\n b = yusya[i]\n teki[i+1] = int(teki[i+1]) - yusya[i]\n else:\n b = int(teki[i+1]) # (16): b=-2 (24): b=-1\n taoshita += a + b # (9): taoshita=-1 (17): taoshita=31 (25): taoshita=28\n i += 1 # (10): i=1 (18): i=2 (26): i=3\n\nprint(taoshita)"], "anno_status": [true], "diff_content": " N = int(input())\n teki = input().split()\n yusya = input().split()\n i = 0\n taoshita = 0\n \n while i < N :\n if int(teki[i]) >= int(yusya[i]):\n a = int(yusya[i]) \n b = 0\n else:\n a = int(teki[i])\n yusya[i] = int(yusya[i]) - int(teki[i])\n if int(teki[i+1]) >= yusya[i]:\n b = yusya[i]\n teki[i+1] = int(teki[i+1]) - yusya[i]\n else:\n b = int(teki[i+1])\n+ teki[i+1] = 0\n taoshita += a + b\n i += 1\n-\n+ \n print(taoshita)\n", "FL_content": " N = int(input())\n teki = input().split()\n yusya = input().split()\n i = 0\n taoshita = 0\n \n while i < N :\n if int(teki[i]) >= int(yusya[i]):\n a = int(yusya[i]) \n b = 0\n else:\n a = int(teki[i])\n yusya[i] = int(yusya[i]) - int(teki[i])\n if int(teki[i+1]) >= yusya[i]:\n b = yusya[i]\n teki[i+1] = int(teki[i+1]) - yusya[i]\n else:\n b = int(teki[i+1])\n taoshita += a + b\n i += 1\n-\n print(taoshita)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u222859507", "problem_id": "p02959", "submission1_id": "s028812771", "submission2_id": "s226159609", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nb.append(0)\n\nsum = 0\nrest_hero = 0\n\nfor i in range(n+1):\n hero = b[i] + rest_hero\n if a[i] >= hero:\n sum += hero\n rest_hero = 0\n else:\n sum += a[i]\n rest_hero = b[i] - (a[i] - rest_hero)\n\nprint(sum)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nb.append(0)\n\nsum = 0\nrest_hero = 0\n\nfor i in range(n+1):\n hero = b[i] + rest_hero\n if a[i] >= hero:\n sum += hero\n rest_hero = 0\n else: \n sum += a[i]\n if a[i] > rest_hero:\n rest_hero = b[i] - (a[i] - rest_hero)\n else:\n rest_hero = b[i]\n\nprint(sum)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564279081", "date2": "1564279870", "bleu_score": "0.8038493954995339", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 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], "code1_test_score": 93, "total_score": 103, "input": "3\n0 4 0 13\n3 100 8\n", "actual_output": "17\n", "expected_output": "12\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(map(int, input().split())) # (1): a=[0, 4, 0, 13]\nb = list(map(int, input().split())) # (2): b=[3, 100, 8]\nb.append(0) # (3): b=[3, 100, 8, 0]\n\nsum = 0 # (4): sum=0\nrest_hero = 0 # (5): rest_hero=0\n\nfor i in range(n+1): # (6): i=0 (11): i=1 ... (26): NO CHANGE\n hero = b[i] + rest_hero # (7): hero=3 (12): hero=103 ... (22): NO CHANGE\n if a[i] >= hero: # (8): NO CHANGE (13): NO CHANGE ... (23): NO CHANGE\n sum += hero\n rest_hero = 0\n else:\n sum += a[i] # (9): NO CHANGE (14): sum=4 ... (24): sum=17\n rest_hero = b[i] - (a[i] - rest_hero) # (10): rest_hero=3 (15): rest_hero=99 ... (25): rest_hero=94\n\nprint(sum)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n b.append(0)\n \n sum = 0\n rest_hero = 0\n \n for i in range(n+1):\n hero = b[i] + rest_hero\n if a[i] >= hero:\n sum += hero\n rest_hero = 0\n- else:\n+ else: \n sum += a[i]\n- rest_hero = b[i] - (a[i] - rest_hero)\n+ if a[i] > rest_hero:\n+ rest_hero = b[i] - (a[i] - rest_hero)\n+ else:\n+ rest_hero = b[i]\n \n print(sum)\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n b.append(0)\n \n sum = 0\n rest_hero = 0\n \n for i in range(n+1):\n hero = b[i] + rest_hero\n if a[i] >= hero:\n sum += hero\n rest_hero = 0\n- else:\n sum += a[i]\n- rest_hero = b[i] - (a[i] - rest_hero)\n \n print(sum)\n \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u912652535", "problem_id": "p02959", "submission1_id": "s447349072", "submission2_id": "s219973354", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\n\nc = []\ncount = 0\n\nfor i in range(n):\n\n if a[i] - b[i] >= 0:\n count += b[i]\n elif a[i] - b[i] < 0:\n count += a[i]\n if a[i+1] + (a[i] - b[i]) >0:\n a[i+1] = a[i+1] + (a[i] - b[i])\n count += (a[i]-b[i])\n elif a[i+1] + (a[i]-b[i]) <=0:\n count += a[i+1]\n a[i+1] = 0\n \nprint(count)", "code2": "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\n\nc = []\ncount = 0\n\nfor i in range(n):\n\n if a[i] - b[i] >= 0:\n count += b[i]\n elif a[i] - b[i] < 0:\n count += a[i]\n if a[i+1] + (a[i] - b[i]) >0:\n a[i+1] = a[i+1] + (a[i] - b[i])\n count -= (a[i]-b[i])\n elif a[i+1] + (a[i]-b[i]) <=0:\n count += a[i+1]\n a[i+1] = 0\n \nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588906126", "date2": "1588906320", "bleu_score": "0.9944412856914127", "code1_test_status": [1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 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, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 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, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 103, "input": "2\n3 5 2\n4 5\n", "actual_output": "5\n", "expected_output": "9\n", "anno_code": ["n = int(input()) # (0): n=2\na = list(map(int,input().split())) # (1): a=[3, 5, 2]\nb = list(map(int,input().split())) # (2): b=[4, 5]\n\n\nc = [] # (3): c=[]\ncount = 0 # (4): count=0\n\nfor i in range(n): # (5): i=0 (12): i=1 (19): NO CHANGE\n\n if a[i] - b[i] >= 0: # (6): NO CHANGE (13): NO CHANGE\n count += b[i]\n elif a[i] - b[i] < 0: # (7): NO CHANGE (14): NO CHANGE\n count += a[i] # (8): count=3 (15): count=6\n if a[i+1] + (a[i] - b[i]) >0: # (9): NO CHANGE (16): NO CHANGE\n a[i+1] = a[i+1] + (a[i] - b[i]) # (10): a=[3, 4, 2] (17): a=[3, 4, 1]\n count += (a[i]-b[i]) # (11): count=2 (18): count=5\n elif a[i+1] + (a[i]-b[i]) <=0:\n count += a[i+1]\n a[i+1] = 0\n \nprint(count)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n \n \n c = []\n count = 0\n \n for i in range(n):\n \n if a[i] - b[i] >= 0:\n count += b[i]\n elif a[i] - b[i] < 0:\n count += a[i]\n if a[i+1] + (a[i] - b[i]) >0:\n a[i+1] = a[i+1] + (a[i] - b[i])\n- count += (a[i]-b[i])\n+ count -= (a[i]-b[i])\n elif a[i+1] + (a[i]-b[i]) <=0:\n count += a[i+1]\n a[i+1] = 0\n \n print(count)\n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n \n \n c = []\n count = 0\n \n for i in range(n):\n \n if a[i] - b[i] >= 0:\n count += b[i]\n elif a[i] - b[i] < 0:\n count += a[i]\n if a[i+1] + (a[i] - b[i]) >0:\n a[i+1] = a[i+1] + (a[i] - b[i])\n- count += (a[i]-b[i])\n elif a[i+1] + (a[i]-b[i]) <=0:\n count += a[i+1]\n a[i+1] = 0\n \n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u540761833", "problem_id": "p02959", "submission1_id": "s507936785", "submission2_id": "s300989840", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\ndp = [0 for i in range(N+1)]\nif A[0] <= B[0]:\n dp[0] = A[0]\n B[0] -= A[0]\nelse:\n dp[0] = B[0]\n B[0] = 0\n\n\n\nfor i in range(1,N):\n if A[i] - B[i-1] >= B[i]:\n dp[i] = B[i-1] + B[i]\n B[i] = 0\n else:\n dp[i] = A[i]\n B[i] -= A[i] - B[i-1]\nif A[-1] <= B[-1]:\n dp[-1] = A[-1]\n B[-1] -= A[-1]\nelse:\n dp[-1] = B[-1]\n B[-1] = 0\nprint(sum(dp))", "code2": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\ndp = [0 for i in range(N+1)]\nif A[0] <= B[0]:\n dp[0] = A[0]\n B[0] -= A[0]\nelse:\n dp[0] = B[0]\n B[0] = 0\n \nif A[-1] <= B[-1]:\n dp[-1] = A[-1]\n B[-1] -= A[-1]\nelse:\n dp[-1] = B[-1]\n B[-1] = 0\n\nif N != 1:\n for i in range(1,N):\n if A[i] - B[i-1] <= 0:\n dp[i] = A[i]\n elif A[i] - B[i-1] >= B[i]:\n dp[i] = B[i-1] + B[i]\n B[i] = 0\n else:\n dp[i] = A[i]\n B[i] -= A[i] - B[i-1]\nprint(sum(dp))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575644824", "date2": "1575646113", "bleu_score": "0.817749900817012", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 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], "code1_test_score": 93, "total_score": 103, "input": "3\n0 4 2 13\n3 100 8\n", "actual_output": "19\n", "expected_output": "14\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int,input().split())) # (1): A=[0, 4, 2, 13]\nB = list(map(int,input().split())) # (2): B=[3, 100, 8]\ndp = [0 for i in range(N+1)] # (3): dp=[0, 0, 0, 0]\nif A[0] <= B[0]: # (4): NO CHANGE\n dp[0] = A[0] # (5): NO CHANGE\n B[0] -= A[0] # (6): NO CHANGE\nelse:\n dp[0] = B[0]\n B[0] = 0\n\n\n\nfor i in range(1,N): # (7): i=1 (11): i=2 (15): NO CHANGE\n if A[i] - B[i-1] >= B[i]: # (8): NO CHANGE (12): NO CHANGE\n dp[i] = B[i-1] + B[i]\n B[i] = 0\n else:\n dp[i] = A[i] # (9): dp=[0, 4, 0, 0] (13): dp=[0, 4, 2, 0]\n B[i] -= A[i] - B[i-1] # (10): B=[3, 99, 8] (14): B=[3, 99, 105]\nif A[-1] <= B[-1]: # (16): NO CHANGE\n dp[-1] = A[-1] # (17): dp=[0, 4, 2, 13]\n B[-1] -= A[-1] # (18): B=[3, 99, 92]\nelse:\n dp[-1] = B[-1]\n B[-1] = 0\nprint(sum(dp))"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n dp = [0 for i in range(N+1)]\n if A[0] <= B[0]:\n dp[0] = A[0]\n B[0] -= A[0]\n else:\n dp[0] = B[0]\n B[0] = 0\n-\n-\n-\n-for i in range(1,N):\n- if A[i] - B[i-1] >= B[i]:\n- dp[i] = B[i-1] + B[i]\n- B[i] = 0\n- else:\n- dp[i] = A[i]\n- B[i] -= A[i] - B[i-1]\n+ \n if A[-1] <= B[-1]:\n dp[-1] = A[-1]\n B[-1] -= A[-1]\n else:\n dp[-1] = B[-1]\n B[-1] = 0\n+\n+if N != 1:\n+ for i in range(1,N):\n+ if A[i] - B[i-1] <= 0:\n+ dp[i] = A[i]\n+ elif A[i] - B[i-1] >= B[i]:\n+ dp[i] = B[i-1] + B[i]\n+ B[i] = 0\n+ else:\n+ dp[i] = A[i]\n+ B[i] -= A[i] - B[i-1]\n print(sum(dp))\n", "FL_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n dp = [0 for i in range(N+1)]\n if A[0] <= B[0]:\n dp[0] = A[0]\n B[0] -= A[0]\n else:\n dp[0] = B[0]\n B[0] = 0\n-\n-\n-\n-for i in range(1,N):\n- if A[i] - B[i-1] >= B[i]:\n- dp[i] = B[i-1] + B[i]\n- B[i] = 0\n- else:\n- dp[i] = A[i]\n- B[i] -= A[i] - B[i-1]\n if A[-1] <= B[-1]:\n dp[-1] = A[-1]\n B[-1] -= A[-1]\n else:\n dp[-1] = B[-1]\n B[-1] = 0\n print(sum(dp))\n", "added_lines": 12, "removed_lines": 10, "code1_lines": 27 }, { "user_id": "u572193732", "problem_id": "p02959", "submission1_id": "s476499613", "submission2_id": "s713840557", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\ncount = 0\nfor i in range(N):\n if A[i] < B[i]:\n count += A[i]\n B[i] -= A[i]\n else:\n count += B[i]\n B[i] = 0\n if A[i+1] < B[i]:\n count += A[i+1]\n B[i] -= A[i+1]\n A[i+1] = 0\n else:\n count += B[i]\n B[i] = 0\n A[i+1] -= B[i]\n \nprint(count)", "code2": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\ncount = 0\nfor i in range(N):\n if A[i] < B[i]:\n count += A[i]\n B[i] -= A[i]\n else:\n count += B[i]\n B[i] = 0\n if A[i+1] < B[i]:\n count += A[i+1]\n B[i] -= A[i+1]\n A[i+1] = 0\n else:\n count += B[i]\n A[i+1] -= B[i]\n B[i] = 0\n \nprint(count)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595692395", "date2": "1595692460", "bleu_score": "0.9975698483814872", "code1_test_status": [1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 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, 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], "code1_test_score": 93, "total_score": 103, "input": "3\n0 4 3 8\n2 100 8\n", "actual_output": "17\n", "expected_output": "15\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[0, 4, 3, 8]\nB = list(map(int, input().split())) # (2): B=[2, 100, 8]\n\ncount = 0 # (3): count=0\nfor i in range(N): # (4): i=0 (12): i=1 ... (28): NO CHANGE\n if A[i] < B[i]: # (5): NO CHANGE (13): NO CHANGE (21): NO CHANGE\n count += A[i] # (6): NO CHANGE (14): count=6 (22): NO CHANGE\n B[i] -= A[i] # (7): NO CHANGE (15): B=[0, 96, 8] (23): NO CHANGE\n else:\n count += B[i]\n B[i] = 0\n if A[i+1] < B[i]: # (8): NO CHANGE (16): NO CHANGE (24): NO CHANGE\n count += A[i+1] # (17): count=9\n B[i] -= A[i+1] # (18): B=[0, 93, 8]\n A[i+1] = 0 # (19): A=[0, 4, 0, 8]\n else:\n count += B[i] # (9): count=2 (25): count=17\n B[i] = 0 # (10): B=[0, 100, 8] (26): B=[0, 93, 0]\n A[i+1] -= B[i] # (11): NO CHANGE (27): NO CHANGE\n \nprint(count)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n \n count = 0\n for i in range(N):\n if A[i] < B[i]:\n count += A[i]\n B[i] -= A[i]\n else:\n count += B[i]\n B[i] = 0\n if A[i+1] < B[i]:\n count += A[i+1]\n B[i] -= A[i+1]\n A[i+1] = 0\n else:\n count += B[i]\n- B[i] = 0\n A[i+1] -= B[i]\n+ B[i] = 0\n \n print(count)\n+\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n \n count = 0\n for i in range(N):\n if A[i] < B[i]:\n count += A[i]\n B[i] -= A[i]\n else:\n count += B[i]\n B[i] = 0\n if A[i+1] < B[i]:\n count += A[i+1]\n B[i] -= A[i+1]\n A[i+1] = 0\n else:\n count += B[i]\n- B[i] = 0\n A[i+1] -= B[i]\n \n print(count)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u782009499", "problem_id": "p02959", "submission1_id": "s926453128", "submission2_id": "s484894299", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\ncount = 0\nleft = 0\nfor i in range(n-1,-1, -1):\n if b[i] - a[i+1] + left > 0:\n count += a[i+1]\n left = b[i] - a[i+1] + left\n if left > b[i]:\n left = b[i]\n else:\n count += b[i]\n left = 0\n\ncount += min(left, a[0])\nprint(count)", "code2": "n = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\ncount = 0\nleft = 0\nfor i in range(n):\n if b[i] + left - a[i] >= 0:\n count += a[i]\n left = b[i] + left - a[i]\n if left > b[i]:\n left = b[i]\n else:\n count += b[i] + left\n left = 0\n\ncount += min(left, a[n])\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566694194", "date2": "1567298779", "bleu_score": "0.9224809568565924", "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, 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, 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], "code1_test_score": 95, "total_score": 103, "input": "2\n2 9 1\n0 5\n", "actual_output": "1\n", "expected_output": "5\n\n", "anno_code": ["n = int(input()) # (0): n=2\na = [int(i) for i in input().split()] # (1): a=[2, 9, 1]\nb = [int(i) for i in input().split()] # (2): b=[0, 5]\n\ncount = 0 # (3): count=0\nleft = 0 # (4): left=0\nfor i in range(n-1,-1, -1): # (5): i=1 (10): i=0 (14): NO CHANGE\n if b[i] - a[i+1] + left > 0: # (6): NO CHANGE (11): NO CHANGE\n count += a[i+1] # (7): count=1\n left = b[i] - a[i+1] + left # (8): left=4\n if left > b[i]: # (9): NO CHANGE\n left = b[i]\n else:\n count += b[i] # (12): NO CHANGE\n left = 0 # (13): left=0\n\ncount += min(left, a[0]) # (15): NO CHANGE\nprint(count)"], "anno_status": [true], "diff_content": " n = int(input())\n a = [int(i) for i in input().split()]\n b = [int(i) for i in input().split()]\n-\n count = 0\n left = 0\n-for i in range(n-1,-1, -1):\n- if b[i] - a[i+1] + left > 0:\n- count += a[i+1]\n- left = b[i] - a[i+1] + left\n+for i in range(n):\n+ if b[i] + left - a[i] >= 0:\n+ count += a[i]\n+ left = b[i] + left - a[i]\n if left > b[i]:\n left = b[i]\n else:\n- count += b[i]\n+ count += b[i] + left\n left = 0\n \n-count += min(left, a[0])\n+count += min(left, a[n])\n print(count)\n", "FL_content": " n = int(input())\n a = [int(i) for i in input().split()]\n b = [int(i) for i in input().split()]\n-\n count = 0\n left = 0\n-for i in range(n-1,-1, -1):\n- if b[i] - a[i+1] + left > 0:\n- count += a[i+1]\n- left = b[i] - a[i+1] + left\n if left > b[i]:\n left = b[i]\n else:\n- count += b[i]\n left = 0\n \n-count += min(left, a[0])\n print(count)\n", "added_lines": 6, "removed_lines": 7, "code1_lines": 18 }, { "user_id": "u464205401", "problem_id": "p02959", "submission1_id": "s994674789", "submission2_id": "s240186282", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\ncnt=0\nfor i in range(n):\n if a[i]>=b[i]:\n cnt+=b[i]\n else:\n if a[i+1]-(b[i]-a[i])>=0:\n cnt+=b[i]\n a[i+1]=a[i+1]-(b[i]-a[i])\n else:\n cnt+=a[i]+a[i+1]\nprint(cnt)\n ", "code2": "n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\ncnt=0\nfor i in range(n):\n if a[i]>=b[i]:\n cnt+=b[i]\n else:\n if a[i+1]+a[i]>=b[i]:\n cnt+=b[i]\n a[i+1]=a[i+1]+a[i]-b[i]\n else:\n cnt+=a[i]+a[i+1]\n a[i+1]=0\nprint(cnt)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580961378", "date2": "1580962377", "bleu_score": "0.9012839776482487", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 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, 1, 1, 0, 1, 0, 1, 0, 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], "code1_test_score": 84, "total_score": 103, "input": "3\n1 1 0 0\n4 100 8\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n=int(input()) # (0): n=3\na=list(map(int,input().split())) # (1): a=[1, 1, 0, 0]\nb=list(map(int,input().split())) # (2): b=[4, 100, 8]\ncnt=0 # (3): cnt=0\nfor i in range(n): # (4): i=0 (8): i=1 ... (16): NO CHANGE\n if a[i]>=b[i]: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n cnt+=b[i]\n else:\n if a[i+1]-(b[i]-a[i])>=0: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n cnt+=b[i]\n a[i+1]=a[i+1]-(b[i]-a[i])\n else:\n cnt+=a[i]+a[i+1] # (7): cnt=2 (11): cnt=3 (15): NO CHANGE\nprint(cnt)\n "], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n cnt=0\n for i in range(n):\n if a[i]>=b[i]:\n cnt+=b[i]\n else:\n- if a[i+1]-(b[i]-a[i])>=0:\n+ if a[i+1]+a[i]>=b[i]:\n cnt+=b[i]\n- a[i+1]=a[i+1]-(b[i]-a[i])\n+ a[i+1]=a[i+1]+a[i]-b[i]\n else:\n cnt+=a[i]+a[i+1]\n+ a[i+1]=0\n print(cnt)\n \n", "FL_content": " n=int(input())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n cnt=0\n for i in range(n):\n if a[i]>=b[i]:\n cnt+=b[i]\n else:\n- if a[i+1]-(b[i]-a[i])>=0:\n cnt+=b[i]\n- a[i+1]=a[i+1]-(b[i]-a[i])\n else:\n cnt+=a[i]+a[i+1]\n print(cnt)\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u703823201", "problem_id": "p02959", "submission1_id": "s125837125", "submission2_id": "s563008719", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\ncnt = 0\nfor n in range(N):\n if A[n] < B[n]:\n cnt += A[n]\n B[n] -= A[n]\n if A[n+1] < B[n]:\n cnt += A[n+1]\n B[n] -= A[n+1]\n else:\n cnt += B[n]\n A[n+1] -= B[n]\n else:\n cnt += B[n]\n \nprint(cnt)", "code2": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\ncnt = 0\nfor n in range(N):\n if A[n] <= B[n]:\n cnt += A[n]\n B[n] -= A[n]\n if A[n+1] < B[n]:\n cnt += A[n+1]\n A[n+1] = 0\n else:\n cnt += B[n]\n A[n+1] -= B[n]\n else:\n cnt += B[n]\n \nprint(cnt)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598661978", "date2": "1598662608", "bleu_score": "0.9714784629280365", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 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, 1, 1, 0, 1, 0, 1, 0, 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], "code1_test_score": 84, "total_score": 103, "input": "3\n10 12 2 4\n2 100 8\n", "actual_output": "22\n", "expected_output": "20\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[10, 12, 2, 4]\nB = list(map(int, input().split())) # (2): B=[2, 100, 8]\n\ncnt = 0 # (3): cnt=0\nfor n in range(N): # (4): n=0 (7): n=1 ... (21): NO CHANGE\n if A[n] < B[n]: # (5): NO CHANGE (8): NO CHANGE (15): NO CHANGE\n cnt += A[n] # (9): cnt=14 (16): cnt=18\n B[n] -= A[n] # (10): B=[2, 88, 8] (17): B=[2, 86, 6]\n if A[n+1] < B[n]: # (11): NO CHANGE (18): NO CHANGE\n cnt += A[n+1] # (12): cnt=16 (19): cnt=22\n B[n] -= A[n+1] # (13): B=[2, 86, 8] (20): B=[2, 86, 2]\n else:\n cnt += B[n]\n A[n+1] -= B[n]\n else:\n cnt += B[n] # (6): cnt=2\n \nprint(cnt)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n \n cnt = 0\n for n in range(N):\n- if A[n] < B[n]:\n+ if A[n] <= B[n]:\n cnt += A[n]\n B[n] -= A[n]\n if A[n+1] < B[n]:\n cnt += A[n+1]\n- B[n] -= A[n+1]\n+ A[n+1] = 0\n else:\n cnt += B[n]\n A[n+1] -= B[n]\n else:\n cnt += B[n]\n \n print(cnt)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n \n cnt = 0\n for n in range(N):\n- if A[n] < B[n]:\n cnt += A[n]\n B[n] -= A[n]\n if A[n+1] < B[n]:\n cnt += A[n+1]\n- B[n] -= A[n+1]\n else:\n cnt += B[n]\n A[n+1] -= B[n]\n else:\n cnt += B[n]\n \n print(cnt)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u095478438", "problem_id": "p02959", "submission1_id": "s952938654", "submission2_id": "s330593924", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA_list = list(map(int, input().split()))\nB_list = list(map(int, input().split()))\n\nA_0 = A_list.pop(0)\n\n\nA_list[0] = A_list[0] + A_0\n\n\ntaos = 0\nnokori = 0\nkeep = 0\n\nfor i, (a, b) in enumerate(zip(A_list, B_list)):\n if i == 0:\n if a >= b:\n taos += b\n else:\n taos += b-a\n else: \n if (a + nokori) >= (b + keep) :\n taos += (b + keep)\n nokori = (a + nokori) - (b + keep)\n keep = 0\n else:\n taos += (a + nokori)\n nokori = 0\n keep = (b + keep) - (a + nokori)\n \nprint(taos)", "code2": "N = int(input())\nA_list = list(map(int, input().split()))\nB_list = list(map(int, input().split()))\n\ntaos = 0\nkeep = 0\n\nfor i, (a, b) in enumerate(zip(A_list, B_list)):\n if a >= (b + keep) :\n taos += (b + keep)\n keep = 0\n else:\n taos += a\n if keep > a:\n keep = b\n else:\n keep = (b + keep) - a \n \n\nif A_list[-1] >= keep:\n taos += keep\nelse:\n taos += A_list[-1]\nprint(taos)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564279019", "date2": "1564280556", "bleu_score": "0.6430329030853957", "code1_test_status": [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, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 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, 0, 1, 0, 1, 0, 0, 0], "code1_test_score": 18, "total_score": 103, "input": "3\n1 2 0 1\n0 011 27\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA_list = list(map(int, input().split())) # (1): A_list=[1, 2, 0, 1]\nB_list = list(map(int, input().split())) # (2): B_list=[0, 11, 27]\n\nA_0 = A_list.pop(0) # (3): A_list=[2, 0, 1], A_0=1\n\n\nA_list[0] = A_list[0] + A_0 # (4): A_list=[3, 0, 1]\n\n\ntaos = 0 # (5): taos=0\nnokori = 0 # (6): nokori=0\nkeep = 0 # (7): keep=0\n\nfor i, (a, b) in enumerate(zip(A_list, B_list)): # (8): i=0, a=3, b=0 (12): i=1, a=0, b=11 ... (24): NO CHANGE\n if i == 0: # (9): NO CHANGE (13): NO CHANGE (19): NO CHANGE\n if a >= b: # (10): NO CHANGE\n taos += b # (11): NO CHANGE\n else:\n taos += b-a\n else: \n if (a + nokori) >= (b + keep) : # (14): NO CHANGE (20): NO CHANGE\n taos += (b + keep)\n nokori = (a + nokori) - (b + keep)\n keep = 0\n else:\n taos += (a + nokori) # (15): NO CHANGE (21): taos=1\n nokori = 0 # (16): NO CHANGE (22): NO CHANGE\n keep = (b + keep) - (a + nokori) # (17): keep=11 (23): keep=37\n \nprint(taos)"], "anno_status": [true], "diff_content": " N = int(input())\n A_list = list(map(int, input().split()))\n B_list = list(map(int, input().split()))\n \n-A_0 = A_list.pop(0)\n-\n-\n-A_list[0] = A_list[0] + A_0\n-\n-\n taos = 0\n-nokori = 0\n keep = 0\n \n for i, (a, b) in enumerate(zip(A_list, B_list)):\n- if i == 0:\n- if a >= b:\n- taos += b\n- else:\n- taos += b-a\n- else: \n- if (a + nokori) >= (b + keep) :\n- taos += (b + keep)\n- nokori = (a + nokori) - (b + keep)\n- keep = 0\n+ if a >= (b + keep) :\n+ taos += (b + keep)\n+ keep = 0\n+ else:\n+ taos += a\n+ if keep > a:\n+ keep = b\n else:\n- taos += (a + nokori)\n- nokori = 0\n- keep = (b + keep) - (a + nokori)\n- \n+ keep = (b + keep) - a \n+ \n+\n+if A_list[-1] >= keep:\n+ taos += keep\n+else:\n+ taos += A_list[-1]\n print(taos)\n", "FL_content": " N = int(input())\n A_list = list(map(int, input().split()))\n B_list = list(map(int, input().split()))\n \n-A_0 = A_list.pop(0)\n-\n-\n-A_list[0] = A_list[0] + A_0\n-\n-\n taos = 0\n-nokori = 0\n keep = 0\n \n for i, (a, b) in enumerate(zip(A_list, B_list)):\n- if i == 0:\n- if a >= b:\n- taos += b\n- else:\n- taos += b-a\n- else: \n- if (a + nokori) >= (b + keep) :\n- taos += (b + keep)\n- nokori = (a + nokori) - (b + keep)\n- keep = 0\n else:\n- taos += (a + nokori)\n- nokori = 0\n- keep = (b + keep) - (a + nokori)\n- \n print(taos)\n", "added_lines": 14, "removed_lines": 21, "code1_lines": 31 }, { "user_id": "u623659526", "problem_id": "p02959", "submission1_id": "s156497911", "submission2_id": "s484991265", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import logging\n\nlogging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n\n\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n logging.info(A)\n logging.info(B)\n\n counter = 0\n for i in range(N):\n if A[i] < B[i]:\n \n if (A[i] + A[i + 1]) > B[i]:\n counter += B[i]\n A[i + 1] = A[i + 1] - B[i] + A[i]\n B[i] = 0\n else:\n counter += (A[i] + A[i + 1])\n B[i] = B[i] - A[i] - A[i + 1]\n A[i + 1] = 0\n \n else:\n counter += B[i]\n\n if B[N - 1] > A[N]:\n counter += A[N]\n else:\n counter += B[N - 1]\n\n print(counter)\n \n \nif __name__ == \"__main__\":\n main()\n", "code2": "import logging\n\nlogging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n\n\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n logging.info(A)\n logging.info(B)\n\n counter = 0\n for i in range(N):\n if A[i] < B[i]:\n \n if (A[i] + A[i + 1]) > B[i]:\n counter += B[i]\n A[i + 1] = A[i + 1] - B[i] + A[i]\n B[i] = 0\n else:\n counter += (A[i] + A[i + 1])\n B[i] = B[i] - A[i] - A[i + 1]\n A[i + 1] = 0\n \n elif A[i] == B[i]:\n counter += A[i]\n B[i] = 0\n A[i] = 0\n \n else:\n counter += B[i]\n B[i] = 0\n\n if B[N - 1] > A[N]:\n counter += A[N]\n elif B[N - 1] != 0:\n counter += B[N - 1]\n\n print(counter)\n \n \nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564279629", "date2": "1564280315", "bleu_score": "0.833240339093369", "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, 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], "code1_test_score": 99, "total_score": 103, "input": "2\n2 5 1\n0 5\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["import logging\n\nlogging.basicConfig(level=logging.INFO, format=\"%(message)s\") # (0): NO CHANGE\n\n\ndef main(): # (1): main=\n N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n logging.info(A)\n logging.info(B)\n\n counter = 0\n for i in range(N):\n if A[i] < B[i]:\n \n if (A[i] + A[i + 1]) > B[i]:\n counter += B[i]\n A[i + 1] = A[i + 1] - B[i] + A[i]\n B[i] = 0\n else:\n counter += (A[i] + A[i + 1])\n B[i] = B[i] - A[i] - A[i + 1]\n A[i + 1] = 0\n \n else:\n counter += B[i]\n\n if B[N - 1] > A[N]:\n counter += A[N]\n else:\n counter += B[N - 1]\n\n print(counter)\n \n \nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import logging\n \n logging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n \n \n def main():\n N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n logging.info(A)\n logging.info(B)\n \n counter = 0\n for i in range(N):\n if A[i] < B[i]:\n \n if (A[i] + A[i + 1]) > B[i]:\n counter += B[i]\n A[i + 1] = A[i + 1] - B[i] + A[i]\n B[i] = 0\n else:\n counter += (A[i] + A[i + 1])\n B[i] = B[i] - A[i] - A[i + 1]\n A[i + 1] = 0\n- \n+ \n+ elif A[i] == B[i]:\n+ counter += A[i]\n+ B[i] = 0\n+ A[i] = 0\n+ \n else:\n counter += B[i]\n+ B[i] = 0\n \n if B[N - 1] > A[N]:\n counter += A[N]\n- else:\n+ elif B[N - 1] != 0:\n counter += B[N - 1]\n \n print(counter)\n \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 def main():\n N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n logging.info(A)\n logging.info(B)\n \n counter = 0\n for i in range(N):\n if A[i] < B[i]:\n \n if (A[i] + A[i + 1]) > B[i]:\n counter += B[i]\n A[i + 1] = A[i + 1] - B[i] + A[i]\n B[i] = 0\n else:\n counter += (A[i] + A[i + 1])\n B[i] = B[i] - A[i] - A[i + 1]\n A[i + 1] = 0\n- \n else:\n counter += B[i]\n \n if B[N - 1] > A[N]:\n counter += A[N]\n- else:\n counter += B[N - 1]\n \n print(counter)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 8, "removed_lines": 2, "code1_lines": 39 }, { "user_id": "u197078193", "problem_id": "p02959", "submission1_id": "s517429160", "submission2_id": "s558600968", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nans = 0\nfor i in range(N):\n print(i)\n if A[i] > B[i]:\n ans += B[i]\n A[i] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i]\n B[i] -= A[i]\n A[i] -= A[i]\n if A[i+1] > B[i]:\n ans += B[i]\n A[i+1] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i+1]\n B[i] -= A[i+1]\n A[i+1] -= A[i+1]\nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nans = 0\nfor i in range(N):\n if A[i] > B[i]:\n ans += B[i]\n A[i] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i]\n B[i] -= A[i]\n A[i] -= A[i]\n if A[i+1] > B[i]:\n ans += B[i]\n A[i+1] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i+1]\n B[i] -= A[i+1]\n A[i+1] -= A[i+1]\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564278048", "date2": "1564278185", "bleu_score": "0.9712091055582323", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n100 -1 -2\n0 110\n", "actual_output": "0\n1\n-3\n", "expected_output": "-3\n\n", "anno_code": ["N = int(input()) # (0): N=2\nA = list(map(int,input().split())) # (1): A=[100, -1, -2]\nB = list(map(int,input().split())) # (2): B=[0, 110]\nans = 0 # (3): ans=0\nfor i in range(N): # (4): i=0 (14): i=1 (24): NO CHANGE\n print(i) # (5): NO CHANGE (15): NO CHANGE\n if A[i] > B[i]: # (6): NO CHANGE (16): NO CHANGE\n ans += B[i] # (7): NO CHANGE\n A[i] -= B[i] # (8): NO CHANGE\n B[i] -= B[i] # (9): NO CHANGE\n else:\n ans += A[i] # (17): NO CHANGE\n B[i] -= A[i] # (18): NO CHANGE\n A[i] -= A[i] # (19): NO CHANGE\n if A[i+1] > B[i]: # (10): NO CHANGE (20): NO CHANGE\n ans += B[i]\n A[i+1] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i+1] # (11): ans=-1 (21): ans=-3\n B[i] -= A[i+1] # (12): B=[1, 110] (22): B=[1, 112]\n A[i+1] -= A[i+1] # (13): A=[100, 0, -2] (23): A=[100, 0, 0]\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 ans = 0\n for i in range(N):\n- print(i)\n if A[i] > B[i]:\n ans += B[i]\n A[i] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i]\n B[i] -= A[i]\n A[i] -= A[i]\n if A[i+1] > B[i]:\n ans += B[i]\n A[i+1] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i+1]\n B[i] -= A[i+1]\n A[i+1] -= 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 ans = 0\n for i in range(N):\n- print(i)\n if A[i] > B[i]:\n ans += B[i]\n A[i] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i]\n B[i] -= A[i]\n A[i] -= A[i]\n if A[i+1] > B[i]:\n ans += B[i]\n A[i+1] -= B[i]\n B[i] -= B[i]\n else:\n ans += A[i+1]\n B[i] -= A[i+1]\n A[i+1] -= A[i+1]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u190167135", "problem_id": "p02959", "submission1_id": "s960127924", "submission2_id": "s016894606", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\nans=min(A[0],B[0])\nB[0]-=ans\nfor i in range(N-1):\n score=min(A[i+1],B[i]+B[i+1])\n ans+=score\n B[i+1]-=min(0,score-B[i])\nprint(ans+min(B[N-1],A[N]))", "code2": "N=int(input())\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\nans=min(A[0],B[0])\nB[0]-=ans\nfor i in range(N-1):\n score=min(A[i+1],B[i]+B[i+1])\n ans+=score\n B[i+1]-=max(0,score-B[i])\nprint(ans+min(B[N-1],A[N]))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601085311", "date2": "1601085456", "bleu_score": "0.9851033460469043", "code1_test_status": [1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 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, 0, 1], "code1_test_score": 86, "total_score": 103, "input": "3\n0 0 0 13\n3 100 8\n", "actual_output": "13\n", "expected_output": "8\n\n", "anno_code": ["N=int(input()) # (0): N=3\nA=list(map(int,input().split())) # (1): A=[0, 0, 0, 13]\nB=list(map(int,input().split())) # (2): B=[3, 100, 8]\nans=min(A[0],B[0]) # (3): ans=0\nB[0]-=ans # (4): NO CHANGE\nfor i in range(N-1): # (5): i=0 (9): i=1 (13): NO CHANGE\n score=min(A[i+1],B[i]+B[i+1]) # (6): score=0 (10): NO CHANGE\n ans+=score # (7): NO CHANGE (11): NO CHANGE\n B[i+1]-=min(0,score-B[i]) # (8): B=[3, 103, 8] (12): B=[3, 103, 111]\nprint(ans+min(B[N-1],A[N]))"], "anno_status": [true], "diff_content": " N=int(input())\n A=list(map(int,input().split()))\n B=list(map(int,input().split()))\n ans=min(A[0],B[0])\n B[0]-=ans\n for i in range(N-1):\n score=min(A[i+1],B[i]+B[i+1])\n ans+=score\n- B[i+1]-=min(0,score-B[i])\n+ B[i+1]-=max(0,score-B[i])\n print(ans+min(B[N-1],A[N]))\n", "FL_content": " N=int(input())\n A=list(map(int,input().split()))\n B=list(map(int,input().split()))\n ans=min(A[0],B[0])\n B[0]-=ans\n for i in range(N-1):\n score=min(A[i+1],B[i]+B[i+1])\n ans+=score\n- B[i+1]-=min(0,score-B[i])\n print(ans+min(B[N-1],A[N]))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u105210954", "problem_id": "p02959", "submission1_id": "s274657067", "submission2_id": "s228265987", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\nans = 0\n\nfor i in range(n):\n sa = a[i] - b[i]\n \n if sa < 0:\n b[i] -= a[i]\n ans += a[i]\n sa2 = a[i+1] - b[i]\n \n if sa2 < 0:\n ans += a[i+1]\n a[i+1] = 0\n else:\n a[i+1] -= sa2\n ans += b[i]\n b[i] -= sa2\n \n else:\n ans += b[i]\n \nprint(ans)\n ", "code2": "def resolve():\n n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n\n ans = 0\n\n for i in range(n):\n beat_now = min(a[i], b[i])\n ans += beat_now\n beat_next = min(a[i + 1], b[i] - min(a[i], b[i]))\n ans += beat_next\n a[i + 1] -= beat_next\n\n print(ans)\n\n\nresolve()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564285905", "date2": "1564444156", "bleu_score": "0.6012675007510242", "code1_test_status": [1, 1, 0, 0, 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, 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, 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": 96, "total_score": 103, "input": "3\n0 4 0 13\n3 100 8\n", "actual_output": "14\n", "expected_output": "12\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(map(int,input().split())) # (1): a=[0, 4, 0, 13]\nb = list(map(int,input().split())) # (2): b=[3, 100, 8]\n\nans = 0 # (3): ans=0\n\nfor i in range(n): # (4): i=0 (14): i=1 ... (33): NO CHANGE\n sa = a[i] - b[i] # (5): sa=-3 (15): sa=-97 (24): sa=-8\n \n if sa < 0: # (6): NO CHANGE (16): NO CHANGE (25): NO CHANGE\n b[i] -= a[i] # (7): NO CHANGE (17): b=[2, 97, 8] (26): NO CHANGE\n ans += a[i] # (8): NO CHANGE (18): ans=6 (27): NO CHANGE\n sa2 = a[i+1] - b[i] # (9): sa2=1 (19): sa2=-97 (28): sa2=5\n \n if sa2 < 0: # (10): NO CHANGE (20): NO CHANGE (29): NO CHANGE\n ans += a[i+1] # (21): NO CHANGE\n a[i+1] = 0 # (22): NO CHANGE\n else:\n a[i+1] -= sa2 # (11): a=[0, 3, 0, 13] (30): a=[0, 3, 0, 8]\n ans += b[i] # (12): ans=3 (31): ans=14\n b[i] -= sa2 # (13): b=[2, 100, 8] (32): b=[2, 97, 3]\n \n else:\n ans += b[i]\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+def resolve():\n+ n = int(input())\n+ a = list(map(int, input().split()))\n+ b = list(map(int, input().split()))\n \n-ans = 0\n+ ans = 0\n \n-for i in range(n):\n- sa = a[i] - b[i]\n- \n- if sa < 0:\n- b[i] -= a[i]\n- ans += a[i]\n- sa2 = a[i+1] - b[i]\n- \n- if sa2 < 0:\n- ans += a[i+1]\n- a[i+1] = 0\n- else:\n- a[i+1] -= sa2\n- ans += b[i]\n- b[i] -= sa2\n- \n- else:\n- ans += b[i]\n- \n-print(ans)\n- \n+ for i in range(n):\n+ beat_now = min(a[i], b[i])\n+ ans += beat_now\n+ beat_next = min(a[i + 1], b[i] - min(a[i], b[i]))\n+ ans += beat_next\n+ a[i + 1] -= beat_next\n+\n+ print(ans)\n+\n+\n+resolve()\n", "FL_content": "-n = int(input())\n-a = list(map(int,input().split()))\n-b = list(map(int,input().split()))\n \n-ans = 0\n \n-for i in range(n):\n- sa = a[i] - b[i]\n- \n- if sa < 0:\n- b[i] -= a[i]\n- ans += a[i]\n- sa2 = a[i+1] - b[i]\n- \n- if sa2 < 0:\n- ans += a[i+1]\n- a[i+1] = 0\n- else:\n- a[i+1] -= sa2\n- ans += b[i]\n- b[i] -= sa2\n- \n- else:\n- ans += b[i]\n- \n-print(ans)\n- \n", "added_lines": 16, "removed_lines": 25, "code1_lines": 27 }, { "user_id": "u692453235", "problem_id": "p02959", "submission1_id": "s470649740", "submission2_id": "s889095379", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\ncount = 0\nad = 0\n\nfor i in range(N):\n if A[i] <= B[i] + ad:\n count += A[i]\n ad = max(0, B[i] + ad - A[i])\n \n else:\n count += B[i] + ad\n ad = 0\n \n\ncount += min(A[N], ad) \n\nprint(count)", "code2": "\nN = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\ncount = 0\nad = 0\n\nfor i in range(N):\n if A[i] <= B[i] + ad:\n count += A[i]\n ad = max(0, B[i] - max(A[i] - ad, 0))\n \n else:\n count += B[i] + ad\n ad = 0\n \n\ncount += min(A[N], ad) \n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587001834", "date2": "1587002204", "bleu_score": "0.947109030845346", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 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], "code1_test_score": 93, "total_score": 103, "input": "3\n0 1 0 21\n2 100 8\n", "actual_output": "22\n", "expected_output": "9\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[0, 1, 0, 21]\nB = list(map(int, input().split())) # (2): B=[2, 100, 8]\ncount = 0 # (3): count=0\nad = 0 # (4): ad=0\n\nfor i in range(N): # (5): i=0 (9): i=1 ... (17): NO CHANGE\n if A[i] <= B[i] + ad: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n count += A[i] # (7): NO CHANGE (11): count=1 (15): NO CHANGE\n ad = max(0, B[i] + ad - A[i]) # (8): ad=2 (12): ad=101 (16): ad=109\n \n else:\n count += B[i] + ad\n ad = 0\n \n\ncount += min(A[N], ad) # (18): count=22\n\nprint(count)"], "anno_status": [true], "diff_content": "+\n N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n count = 0\n ad = 0\n \n for i in range(N):\n if A[i] <= B[i] + ad:\n count += A[i]\n- ad = max(0, B[i] + ad - A[i])\n+ ad = max(0, B[i] - max(A[i] - ad, 0))\n \n else:\n count += B[i] + ad\n ad = 0\n \n \n count += min(A[N], ad) \n \n print(count)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n count = 0\n ad = 0\n \n for i in range(N):\n if A[i] <= B[i] + ad:\n count += A[i]\n- ad = max(0, B[i] + ad - A[i])\n \n else:\n count += B[i] + ad\n ad = 0\n \n \n count += min(A[N], ad) \n \n print(count)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u200527996", "problem_id": "p02959", "submission1_id": "s802662914", "submission2_id": "s667686074", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nans = 0\nfor i in range(N):\n if A[i] >= B[i]:\n ans += B[i]\n if A[i] < B[i]:\n ans += A[i]\n if A[i+1] >= (B[i] - A[i]):\n A[i+1] -= B[i] - A[i]\n ans += B[i] - A[i]\n else:\n A[i+1] = 0\n ans += A[i+1]\nprint(ans)", "code2": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nans = 0\nfor i in range(N):\n if A[i] >= B[i]:\n ans += B[i]\n if A[i] < B[i]:\n ans += A[i]\n if A[i+1] >= (B[i] - A[i]):\n A[i+1] -= B[i] - A[i]\n ans += B[i] - A[i]\n else:\n ans += A[i+1]\n A[i+1] = 0\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569897480", "date2": "1569898002", "bleu_score": "0.9932293293236664", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 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, 1, 0, 1, 0], "code1_test_score": 19, "total_score": 103, "input": "2\n100 0 1\n1 100\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=2\nA = list(map(int, input().split())) # (1): A=[100, 0, 1]\nB = list(map(int, input().split())) # (2): B=[1, 100]\nans = 0 # (3): ans=0\nfor i in range(N): # (4): i=0 (8): i=1 (15): NO CHANGE\n if A[i] >= B[i]: # (5): NO CHANGE (9): NO CHANGE\n ans += B[i] # (6): ans=1\n if A[i] < B[i]: # (7): NO CHANGE (10): NO CHANGE\n ans += A[i] # (11): NO CHANGE\n if A[i+1] >= (B[i] - A[i]): # (12): NO CHANGE\n A[i+1] -= B[i] - A[i]\n ans += B[i] - A[i]\n else:\n A[i+1] = 0 # (13): A=[100, 0, 0]\n ans += A[i+1] # (14): NO CHANGE\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 ans = 0\n for i in range(N):\n if A[i] >= B[i]:\n ans += B[i]\n if A[i] < B[i]:\n ans += A[i]\n if A[i+1] >= (B[i] - A[i]):\n A[i+1] -= B[i] - A[i]\n ans += B[i] - A[i]\n else:\n- A[i+1] = 0\n ans += A[i+1]\n+ A[i+1] = 0\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 ans = 0\n for i in range(N):\n if A[i] >= B[i]:\n ans += B[i]\n if A[i] < B[i]:\n ans += A[i]\n if A[i+1] >= (B[i] - A[i]):\n A[i+1] -= B[i] - A[i]\n ans += B[i] - A[i]\n else:\n- A[i+1] = 0\n ans += A[i+1]\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u564105430", "problem_id": "p02274", "submission1_id": "s685915082", "submission2_id": "s048441610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nglobal cnt\ncnt=0\n\ndef merge(A,left,mid,right):\n L=A[left:mid]\n R=A[mid:right]\n L.append(float(\"inf\"))\n R.append(float(\"inf\"))\n \n i=0\n j=0\n for k in range(left,right):\n global cnt\n if L[i]<=R[j]:\n A[k]=L[i]\n i=i+1\n else:\n A[k]=R[j]\n j=j+1\n cnt+=mid-left-i\n\ndef mergeSort(A,left,right):\n if left+1\n L=A[left:mid] # (18): L=[0] (35): L=[-5]\n R=A[mid:right] # (19): R=[-3] (36): R=[-3, 0]\n L.append(float(\"inf\")) # (20): L=[0, inf] (37): L=[-5, inf]\n R.append(float(\"inf\")) # (21): R=[-3, inf] (38): R=[-3, 0, inf]\n \n i=0 # (22): i=0 (39): i=0\n j=0 # (23): j=0 (40): j=0\n for k in range(left,right): # (24): k=1 (29): k=2 ... (55): cnt=1, merge=, mergeSort=, n=3, S=[-5, -3, 0]\n global cnt\n if L[i]<=R[j]: # (25): NO CHANGE (30): NO CHANGE ... (51): NO CHANGE\n A[k]=L[i] # (31): A=[-5, -3, 0] (43): NO CHANGE\n i=i+1 # (32): i=1 (44): i=1\n else:\n A[k]=R[j] # (26): A=[-5, -3, -3] (47): NO CHANGE (52): NO CHANGE\n j=j+1 # (27): j=1 (48): j=1 (53): j=2\n cnt+=mid-left-i # (28): NO CHANGE (49): NO CHANGE (54): NO CHANGE\n\ndef mergeSort(A,left,right): # (2): mergeSort=\n if left+1\n s_i = input()\n n_i = int(input())\n ans = \"\"\n while True:\n if len(s_i) < n_i:\n if n_i == 1:\n break\n else:\n if s_i == \"\":\n break\n else:\n ans += s_i[0]\n break\n else:\n ans += s_i[:n_i][0]\n s_i = s_i[n_i:]\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " def main():\n s_i = input()\n n_i = int(input())\n ans = \"\"\n while True:\n if len(s_i) < n_i:\n- if n_i == 1:\n- break\n+ if s_i != \"\":\n+ ans += s_i[0]\n+ break\n else:\n- if s_i == \"\":\n- break\n- else:\n- ans += s_i[0]\n- break\n+ break\n else:\n ans += s_i[:n_i][0]\n s_i = s_i[n_i:]\n- print(ans)\n+ print(ans)\n \n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " def main():\n s_i = input()\n n_i = int(input())\n ans = \"\"\n while True:\n if len(s_i) < n_i:\n- if n_i == 1:\n- break\n else:\n- if s_i == \"\":\n- break\n- else:\n- ans += s_i[0]\n- break\n else:\n ans += s_i[:n_i][0]\n s_i = s_i[n_i:]\n- print(ans)\n \n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 5, "removed_lines": 8, "code1_lines": 22 }, { "user_id": "u333945892", "problem_id": "p03303", "submission1_id": "s893265962", "submission2_id": "s048220778", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = list(input())\nw = int(input())\n\nL = len(S)\n\nans = []\n\nfor i in range(0,L,w):\n\tif i < L-1:\n\t\tans.append(S[i])\n\n\nprint (''.join(ans))", "code2": "S = list(input())\nw = int(input())\n\nL = len(S)\n\nans = []\n\nfor i in range(0,L,w):\n\tif i <= L-1:\n\t\tans.append(S[i])\n\n\nprint (''.join(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531014581", "date2": "1531015032", "bleu_score": "0.9813057074915894", "code1_test_status": [0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 47, "total_score": 103, "input": "mklll\n1\n", "actual_output": "mkll\n", "expected_output": "mklll\n\n", "anno_code": ["S = list(input()) # (0): S=['m', 'k', 'l', 'l', 'l']\nw = int(input()) # (1): w=1\n\nL = len(S) # (2): L=5\n\nans = [] # (3): ans=[]\n\nfor i in range(0,L,w): # (4): i=0 (7): i=1 ... (18): NO CHANGE\n\tif i < L-1: # (5): NO CHANGE (8): NO CHANGE ... (17): NO CHANGE\n\t\tans.append(S[i]) # (6): ans=['m'] (9): ans=['m', 'k'] ... (15): ans=['m', 'k', 'l', 'l']\n\n\nprint (''.join(ans))"], "anno_status": [true], "diff_content": " S = list(input())\n w = int(input())\n \n L = len(S)\n \n ans = []\n \n for i in range(0,L,w):\n-\tif i < L-1:\n+\tif i <= L-1:\n \t\tans.append(S[i])\n \n \n print (''.join(ans))\n", "FL_content": " S = list(input())\n w = int(input())\n \n L = len(S)\n \n ans = []\n \n for i in range(0,L,w):\n-\tif i < L-1:\n \t\tans.append(S[i])\n \n \n print (''.join(ans))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u023231878", "problem_id": "p03303", "submission1_id": "s534868957", "submission2_id": "s987348111", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nx=''\nfor i in range(len(s)):\n if i%3==0:\n x+=s[i]\nprint(x)", "code2": "s=input()\nl=int(input())\nx=''\nfor i in range(len(s)):\n if i%l==0:\n x+=s[i]\nprint(x)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531403903", "date2": "1531404022", "bleu_score": "0.8202459170239301", "code1_test_status": [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, 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, 1, 0, 1, 1, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 14, "total_score": 103, "input": "dnvondouuuhs\n1\n", "actual_output": "doou\n", "expected_output": "dnvondouuuhs\n\n", "anno_code": ["s=input() # (0): s=dnvondouuuhs\nx='' # (1): x=\nfor i in range(len(s)): # (2): i=0 (5): i=1 ... (30): NO CHANGE\n if i%3==0: # (3): NO CHANGE (6): NO CHANGE ... (29): NO CHANGE\n x+=s[i] # (4): x=d (11): x=do ... (25): x=doou\nprint(x)"], "anno_status": [true], "diff_content": " s=input()\n+l=int(input())\n x=''\n for i in range(len(s)):\n- if i%3==0:\n+ if i%l==0:\n x+=s[i]\n print(x)\n+\n", "FL_content": " s=input()\n x=''\n for i in range(len(s)):\n- if i%3==0:\n x+=s[i]\n print(x)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u296518383", "problem_id": "p03303", "submission1_id": "s362582410", "submission2_id": "s880106839", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S,w=input(),int(input())\nprint(S[0::3])", "code2": "S,w=input(),int(input())\nprint(S[0::w])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569048086", "date2": "1569048137", "bleu_score": "0.9390346794137809", "code1_test_status": [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, 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, 1, 0, 1, 1, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 14, "total_score": 103, "input": "siuuuodnound\n1\n", "actual_output": "sudu\n", "expected_output": "siuuuodnound\n\n", "anno_code": ["S,w=input(),int(input()) # (0): S=siuuuodnound, w=1\nprint(S[0::3])"], "anno_status": [true], "diff_content": " S,w=input(),int(input())\n-print(S[0::3])\n+print(S[0::w])\n", "FL_content": " S,w=input(),int(input())\n-print(S[0::3])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u482157295", "problem_id": "p03303", "submission1_id": "s573039788", "submission2_id": "s209604777", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = int(input())\nprint(s[0::3])", "code2": "s = input()\nn = int(input())\nprint(s[0::n])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590471926", "date2": "1590520237", "bleu_score": "0.9227521819502709", "code1_test_status": [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, 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, 1, 0, 1, 1, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 14, "total_score": 103, "input": "llmln\n4\n", "actual_output": "ll\n", "expected_output": "ln\n\n", "anno_code": ["s = input() # (0): s=llmln\nn = int(input()) # (1): n=4\nprint(s[0::3])"], "anno_status": [true], "diff_content": " s = input()\n n = int(input())\n-print(s[0::3])\n+print(s[0::n])\n+\n", "FL_content": " s = input()\n n = int(input())\n-print(s[0::3])\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u150641538", "problem_id": "p03303", "submission1_id": "s937616305", "submission2_id": "s832769588", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nw = int(input())\n\nlength = len(s)\n\noutput = s[0]\ni = w\n\nwhile(i len(S_list) or x + w > len(S_list):\n break\n", "code2": "\nimport sys\nS = input()\nw = int(input())\nx = 0\n\nS_list = list(S)\n\nsys.stdout.write(S_list[0])\nwhile True:\n x = x + w\n if x >= len(S_list):\n break\n sys.stdout.write(S_list[x])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531014090", "date2": "1531015811", "bleu_score": "0.8692606342406708", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 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, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 71, "total_score": 103, "input": "dnuoodnuuuhs\n7\n", "actual_output": "d", "expected_output": "du\n\n", "anno_code": ["\nimport sys\nS = input() # (0): S=dnuoodnuuuhs\nw = int(input()) # (1): w=7\nx = 0 # (2): x=0\n\nS_list = list(S) # (3): S_list=['d', 'n', 'u', 'o', 'o', 'd', 'n', 'u', 'u', 'u', 'h', 's']\n\nwhile True: # (4): NO CHANGE\n sys.stdout.write(S_list[x]) # (5): NO CHANGE\n x = x + w # (6): x=7\n if x > len(S_list) or x + w > len(S_list): # (7): NO CHANGE\n break\n"], "anno_status": [true], "diff_content": " \n import sys\n S = input()\n w = int(input())\n x = 0\n \n S_list = list(S)\n \n+sys.stdout.write(S_list[0])\n while True:\n- sys.stdout.write(S_list[x])\n x = x + w\n- if x > len(S_list) or x + w > len(S_list):\n+ if x >= len(S_list):\n break\n-\n+ sys.stdout.write(S_list[x])\n", "FL_content": " \n import sys\n S = input()\n w = int(input())\n x = 0\n \n S_list = list(S)\n \n while True:\n- sys.stdout.write(S_list[x])\n x = x + w\n- if x > len(S_list) or x + w > len(S_list):\n break\n-\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u085186789", "problem_id": "p03303", "submission1_id": "s180917234", "submission2_id": "s004688572", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nw = int(input())\nfor i in range(len(S)):\n if w != 1 and (i + 1) % w == 1 :\n print(S[i], end = \"\")\n elif w == 1:\n print(S[i])\n", "code2": "S = input()\nw = int(input())\nfor i in range(len(S)):\n if w != 1 and (i + 1) % w == 1 :\n print(S[i], end = \"\")\n elif w == 1:\n print(S[i], end = \"\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601090826", "date2": "1601090887", "bleu_score": "0.9294827291163132", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 62, "total_score": 103, "input": "shuuuodonvnd\n1\n", "actual_output": "s\nh\nu\nu\nu\no\nd\no\nn\nv\nn\nd\n", "expected_output": "shuuuodonvnd\n\n", "anno_code": ["S = input() # (0): S=shuuuodonvnd\nw = int(input()) # (1): w=1\nfor i in range(len(S)): # (2): i=0 (6): i=1 ... (46): i=11\n if w != 1 and (i + 1) % w == 1 : # (3): NO CHANGE (7): NO CHANGE ... (47): NO CHANGE\n print(S[i], end = \"\")\n elif w == 1: # (4): NO CHANGE (8): NO CHANGE ... (48): NO CHANGE\n print(S[i]) # (5): NO CHANGE (9): NO CHANGE ... (49): NO CHANGE\n"], "anno_status": [true], "diff_content": " S = input()\n w = int(input())\n for i in range(len(S)):\n if w != 1 and (i + 1) % w == 1 :\n print(S[i], end = \"\")\n elif w == 1:\n- print(S[i])\n-\n+ print(S[i], end = \"\")\n", "FL_content": " S = input()\n w = int(input())\n for i in range(len(S)):\n if w != 1 and (i + 1) % w == 1 :\n print(S[i], end = \"\")\n elif w == 1:\n- print(S[i])\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u252805217", "problem_id": "p02917", "submission1_id": "s930200691", "submission2_id": "s842473982", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nbs = list(map(int, input().split()))\n\nres = bs[0]\nfor i in range(n - 2):\n\tres += min(bs[i], bs[i + 1])\n\nif n == 2:\n\tres += bs[-1]\nelse:\n\tres += max(bs[-1], bs[-2])\n\nprint(res)", "code2": "n = int(input())\nbs = list(map(int, input().split()))\n\nres = bs[0]\nfor i in range(n - 2):\n\tres += min(bs[i], bs[i + 1])\nres += bs[-1]\n\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573111359", "date2": "1573111539", "bleu_score": "0.7116691281608746", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 100, "total_score": 103, "input": "3\n-1 -2\n", "actual_output": "-4\n", "expected_output": "-5\n\n", "anno_code": ["n = int(input()) # (0): n=3\nbs = list(map(int, input().split())) # (1): bs=[-1, -2]\n\nres = bs[0] # (2): res=-1\nfor i in range(n - 2): # (3): i=0 (5): NO CHANGE\n\tres += min(bs[i], bs[i + 1]) # (4): res=-3\n\nif n == 2: # (6): NO CHANGE\n\tres += bs[-1]\nelse:\n\tres += max(bs[-1], bs[-2]) # (7): res=-4\n\nprint(res)"], "anno_status": [true], "diff_content": " n = int(input())\n bs = list(map(int, input().split()))\n \n res = bs[0]\n for i in range(n - 2):\n \tres += min(bs[i], bs[i + 1])\n-\n-if n == 2:\n-\tres += bs[-1]\n-else:\n-\tres += max(bs[-1], bs[-2])\n+res += bs[-1]\n \n print(res)\n", "FL_content": " n = int(input())\n bs = list(map(int, input().split()))\n \n res = bs[0]\n for i in range(n - 2):\n \tres += min(bs[i], bs[i + 1])\n-\n-if n == 2:\n-\tres += bs[-1]\n-else:\n-\tres += max(bs[-1], bs[-2])\n \n print(res)\n", "added_lines": 1, "removed_lines": 5, "code1_lines": 13 }, { "user_id": "u663958857", "problem_id": "p02917", "submission1_id": "s459864427", "submission2_id": "s961730045", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n = int(input())\n array = list(map(int, input().split()))\n sum_value = array[-1]\n for i in reversed(range(n-1)):\n if array[i - 1] <= array[i]:\n sum_value += array[i - 1]\n else:\n array[i - 1] = array[i]\n sum_value += array[i - 1]\n print(sum_value)\n\nif __name__ == \"__main__\":\n main()\n", "code2": "def main():\n n = int(input())\n array = list(map(int, input().split()))\n sum_value = array[-1] + array[0]\n for i in range(n-2):\n sum_value += min(array[i], array[i+1])\n \n print(sum_value)\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568675634", "date2": "1568676504", "bleu_score": "0.6036825762949036", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 0, 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, 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], "code1_test_score": 93, "total_score": 103, "input": "6\n1 155 10 0 3\n", "actual_output": "3\n", "expected_output": "15\n\n", "anno_code": ["def main(): # (0): main=\n n = int(input())\n array = list(map(int, input().split()))\n sum_value = array[-1]\n for i in reversed(range(n-1)):\n if array[i - 1] <= array[i]:\n sum_value += array[i - 1]\n else:\n array[i - 1] = array[i]\n sum_value += array[i - 1]\n print(sum_value)\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " def main():\n n = int(input())\n array = list(map(int, input().split()))\n- sum_value = array[-1]\n- for i in reversed(range(n-1)):\n- if array[i - 1] <= array[i]:\n- sum_value += array[i - 1]\n- else:\n- array[i - 1] = array[i]\n- sum_value += array[i - 1]\n+ sum_value = array[-1] + array[0]\n+ for i in range(n-2):\n+ sum_value += min(array[i], array[i+1])\n+ \n print(sum_value)\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " def main():\n n = int(input())\n array = list(map(int, input().split()))\n- sum_value = array[-1]\n- for i in reversed(range(n-1)):\n- if array[i - 1] <= array[i]:\n- sum_value += array[i - 1]\n- else:\n- array[i - 1] = array[i]\n- sum_value += array[i - 1]\n print(sum_value)\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 4, "removed_lines": 7, "code1_lines": 15 }, { "user_id": "u172569352", "problem_id": "p02917", "submission1_id": "s248785872", "submission2_id": "s346028750", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nB = [int(i) for i in input().split()]\n\n \nA = [0] * N\nfor i in range(1, N - 1):\n A[i] = min(B[i - 1], B[i])\n\nA[N - 1] = B[N - 2]\nprint(sum(A))", "code2": "N = int(input())\nB = [int(i) for i in input().split()]\n\n \nA = [0] * N\nA[0] = B[0]\nfor i in range(1, N - 1):\n A[i] = min(B[i - 1], B[i])\n\nA[N - 1] = B[N-2]\n\nprint(sum(A))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573741787", "date2": "1573742252", "bleu_score": "0.9059348000371277", "code1_test_status": [0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 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, 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, 1], "code1_test_score": 13, "total_score": 103, "input": "2\n-31\n", "actual_output": "-31\n", "expected_output": "-62\n\n", "anno_code": ["N = int(input()) # (0): N=2\nB = [int(i) for i in input().split()] # (1): B=[-31]\n\n \nA = [0] * N # (2): A=[0, 0]\nfor i in range(1, N - 1): # (3): NO CHANGE\n A[i] = min(B[i - 1], B[i])\n\nA[N - 1] = B[N - 2] # (4): A=[0, -31]\nprint(sum(A))"], "anno_status": [true], "diff_content": " N = int(input())\n B = [int(i) for i in input().split()]\n \n \n A = [0] * N\n+A[0] = B[0]\n for i in range(1, N - 1):\n A[i] = min(B[i - 1], B[i])\n \n-A[N - 1] = B[N - 2]\n+A[N - 1] = B[N-2]\n+\n print(sum(A))\n", "FL_content": " N = int(input())\n B = [int(i) for i in input().split()]\n \n \n A = [0] * N\n for i in range(1, N - 1):\n A[i] = min(B[i - 1], B[i])\n \n-A[N - 1] = B[N - 2]\n print(sum(A))\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u773711732", "problem_id": "p02917", "submission1_id": "s469695259", "submission2_id": "s534633706", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nBi = list(map(int, input().split()))\nlistA = [0 for i in range(N)]\nlistA[N-1] = Bi[N-2]\ngokei = 0\nfor j in reversed(range(N-1)):\n listA[j] = min(Bi[j], Bi[j-1])\n\nfor k in listA:\n gokei += k\nprint(gokei)", "code2": "N = int(input())\nBi = list(map(int, input().split()))\nlistA = [0 for i in range(N)]\nlistA[N-1] = Bi[N-2]\ngokei = 0\nlistA[0] = Bi[0]\nfor j in range(N-2, 0, -1):\n listA[j] = min(Bi[j], Bi[j-1])\n\nfor k in listA:\n gokei += k\nprint(gokei)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585792519", "date2": "1585793918", "bleu_score": "0.8871604913208393", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "3\n-1 -2\n", "actual_output": "-6\n", "expected_output": "-5\n\n", "anno_code": ["N = int(input()) # (0): N=3\nBi = list(map(int, input().split())) # (1): Bi=[-1, -2]\nlistA = [0 for i in range(N)] # (2): listA=[0, 0, 0]\nlistA[N-1] = Bi[N-2] # (3): listA=[0, 0, -2]\ngokei = 0 # (4): gokei=0\nfor j in reversed(range(N-1)): # (5): j=1 (7): j=0 (9): NO CHANGE\n listA[j] = min(Bi[j], Bi[j-1]) # (6): listA=[0, -2, -2] (8): listA=[-2, -2, -2]\n\nfor k in listA: # (10): k=-2 (12): NO CHANGE ... (16): NO CHANGE\n gokei += k # (11): gokei=-2 (13): gokei=-4 (15): gokei=-6\nprint(gokei)"], "anno_status": [true], "diff_content": " N = int(input())\n Bi = list(map(int, input().split()))\n listA = [0 for i in range(N)]\n listA[N-1] = Bi[N-2]\n gokei = 0\n-for j in reversed(range(N-1)):\n+listA[0] = Bi[0]\n+for j in range(N-2, 0, -1):\n listA[j] = min(Bi[j], Bi[j-1])\n \n for k in listA:\n gokei += k\n print(gokei)\n", "FL_content": " N = int(input())\n Bi = list(map(int, input().split()))\n listA = [0 for i in range(N)]\n listA[N-1] = Bi[N-2]\n gokei = 0\n-for j in reversed(range(N-1)):\n listA[j] = min(Bi[j], Bi[j-1])\n \n for k in listA:\n gokei += k\n print(gokei)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u042716570", "problem_id": "p02917", "submission1_id": "s591803582", "submission2_id": "s049915678", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nB = list(map(int,input().split()))\nA = [0]*N\nA[N-1] = B[N-1-1]\nfor i in range(1,N):\n A[N-1-i] = min(B[N-1-i],B[N-1-i-1])\nprint(sum(A))", "code2": "N = int(input())\nB = list(map(int,input().split()))\n\nA = [0]*N\nA[0] = B[0]\nA[N-1] = B[N-1-1]\nfor i in range(1,N-1):\n A[N-1-i] = min(B[N-1-i],B[N-1-i-1])\nprint(sum(A))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567906539", "date2": "1567907100", "bleu_score": "0.8968518779526216", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "6\n0 -2 -1 -1 -1\n", "actual_output": "-8\n", "expected_output": "-7\n\n", "anno_code": ["N = int(input()) # (0): N=6\nB = list(map(int,input().split())) # (1): B=[0, -2, -1, -1, -1]\nA = [0]*N # (2): A=[0, 0, 0, 0, 0, 0]\nA[N-1] = B[N-1-1] # (3): A=[0, 0, 0, 0, 0, -1]\nfor i in range(1,N): # (4): i=1 (6): i=2 ... (14): NO CHANGE\n A[N-1-i] = min(B[N-1-i],B[N-1-i-1]) # (5): A=[0, 0, 0, 0, -1, -1] (7): A=[0, 0, 0, -1, -1, -1] ... (13): A=[-1, -2, -2, -1, -1, -1]\nprint(sum(A))"], "anno_status": [true], "diff_content": " N = int(input())\n B = list(map(int,input().split()))\n+\n A = [0]*N\n+A[0] = B[0]\n A[N-1] = B[N-1-1]\n-for i in range(1,N):\n+for i in range(1,N-1):\n A[N-1-i] = min(B[N-1-i],B[N-1-i-1])\n print(sum(A))\n", "FL_content": " N = int(input())\n B = list(map(int,input().split()))\n A = [0]*N\n A[N-1] = B[N-1-1]\n-for i in range(1,N):\n A[N-1-i] = min(B[N-1-i],B[N-1-i-1])\n print(sum(A))\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u069129582", "problem_id": "p02917", "submission1_id": "s970568955", "submission2_id": "s549555029", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nb=list(map(int,input().split()))\nfor j in range(n-2):\n if b[j]>min(b[j:]):\n b[j]=min(b[j:])\n\nprint(sum(b)+b[0])", "code2": "n=int(input())\nb=list(map(int,input().split()))\nans=[]\nfor j in range(n-2):\n ans.append(min(b[j],b[j+1]))\n\nprint(sum(ans)+b[0]+b[-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567910009", "date2": "1567912577", "bleu_score": "0.7279794068641795", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 0, 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, 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], "code1_test_score": 93, "total_score": 103, "input": "6\n0 -2 -1 -1 -1\n", "actual_output": "-9\n", "expected_output": "-7\n\n", "anno_code": ["n=int(input()) # (0): n=6\nb=list(map(int,input().split())) # (1): b=[0, -2, -1, -1, -1]\nfor j in range(n-2): # (2): j=0 (5): j=1 ... (11): NO CHANGE\n if b[j]>min(b[j:]): # (3): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\n b[j]=min(b[j:]) # (4): b=[-2, -2, -1, -1, -1]\n\nprint(sum(b)+b[0])"], "anno_status": [true], "diff_content": " n=int(input())\n b=list(map(int,input().split()))\n+ans=[]\n for j in range(n-2):\n- if b[j]>min(b[j:]):\n- b[j]=min(b[j:])\n+ ans.append(min(b[j],b[j+1]))\n \n-print(sum(b)+b[0])\n+print(sum(ans)+b[0]+b[-1])\n", "FL_content": " n=int(input())\n b=list(map(int,input().split()))\n for j in range(n-2):\n- if b[j]>min(b[j:]):\n- b[j]=min(b[j:])\n \n-print(sum(b)+b[0])\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u529518602", "problem_id": "p02917", "submission1_id": "s199773165", "submission2_id": "s544211896", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nB = list(map(int, input().split()))\nA = []\n\nA.append(B[0])\n\nfor i in range(N-2):\n A.append(min(B[i], B[i+1]))\n\nA.append(max(B[N-3], B[N-2]))\n\nprint(sum(A))\n", "code2": "N = int(input())\nB = list(map(int, input().split()))\nA = []\n\nA.append(B[0])\n\nfor i in range(N-2):\n A.append(min(B[i], B[i+1]))\n\nA.append(B[N-2])\n\nprint(sum(A))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573499466", "date2": "1573500035", "bleu_score": "0.9146543049299057", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 100, "total_score": 103, "input": "6\n0 164 10 7 6\n", "actual_output": "30\n", "expected_output": "29\n\n", "anno_code": ["N = int(input()) # (0): N=6\nB = list(map(int, input().split())) # (1): B=[0, 164, 10, 7, 6]\nA = [] # (2): A=[]\n\nA.append(B[0]) # (3): A=[0]\n\nfor i in range(N-2): # (4): i=0 (6): i=1 ... (12): NO CHANGE\n A.append(min(B[i], B[i+1])) # (5): A=[0, 0] (7): A=[0, 0, 10] ... (11): A=[0, 0, 10, 7, 6]\n\nA.append(max(B[N-3], B[N-2])) # (13): A=[0, 0, 10, 7, 6, 7]\n\nprint(sum(A))\n"], "anno_status": [true], "diff_content": " N = int(input())\n B = list(map(int, input().split()))\n A = []\n \n A.append(B[0])\n \n for i in range(N-2):\n A.append(min(B[i], B[i+1]))\n \n-A.append(max(B[N-3], B[N-2]))\n+A.append(B[N-2])\n \n print(sum(A))\n \n", "FL_content": " N = int(input())\n B = list(map(int, input().split()))\n A = []\n \n A.append(B[0])\n \n for i in range(N-2):\n A.append(min(B[i], B[i+1]))\n \n-A.append(max(B[N-3], B[N-2]))\n \n print(sum(A))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u798768533", "problem_id": "p02917", "submission1_id": "s492346875", "submission2_id": "s932749071", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nB=[10**6]\nB.extend([int(b) for b in input().split()])\nB.append(10**6)\nprint(N, B)\n\nA=[None]*N\nfor i in range(N):\n A[i] = min(B[i], B[i+1])\n \nprint(sum(A))", "code2": "N=int(input())\nB=[10**6]\nB.extend([int(b) for b in input().split()])\nB.append(10**6)\n\n\nA=[None]*N\nfor i in range(N):\n A[i] = min(B[i], B[i+1])\n \nprint(sum(A))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572008660", "date2": "1572008717", "bleu_score": "0.9279178732134229", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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-31\n", "actual_output": "2 [1000000, -31, 1000000]\n-62\n", "expected_output": "-62\n\n", "anno_code": ["N=int(input()) # (0): N=2\nB=[10**6] # (1): B=[1000000]\nB.extend([int(b) for b in input().split()]) # (2): B=[1000000, -31]\nB.append(10**6) # (3): B=[1000000, -31, 1000000]\nprint(N, B) # (4): NO CHANGE\n\nA=[None]*N # (5): A=[None, None]\nfor i in range(N): # (6): i=0 (8): i=1 (10): NO CHANGE\n A[i] = min(B[i], B[i+1]) # (7): A=[-31, None] (9): A=[-31, -31]\n \nprint(sum(A))"], "anno_status": [true], "diff_content": " N=int(input())\n B=[10**6]\n B.extend([int(b) for b in input().split()])\n B.append(10**6)\n-print(N, B)\n+\n \n A=[None]*N\n for i in range(N):\n A[i] = min(B[i], B[i+1])\n \n print(sum(A))\n+\n", "FL_content": " N=int(input())\n B=[10**6]\n B.extend([int(b) for b in input().split()])\n B.append(10**6)\n-print(N, B)\n \n A=[None]*N\n for i in range(N):\n A[i] = min(B[i], B[i+1])\n \n print(sum(A))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u544034775", "problem_id": "p02917", "submission1_id": "s674018087", "submission2_id": "s235989192", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nb = [int(i) for i in input().split()] \n\nl = [b[0], b[0]]\nif n>=3:\n for i in range(1, len(b)-1):\n test = b[i+1] - b[i]\n if test>=0:\n l.append(b[i])\n else:\n l.append(b[i+1])\n l.append(b[-1])\n print(sum(l))\nelse:\n print(b[0]*2)", "code2": "n = int(input())\nb = [int(i) for i in input().split()] \n\nl = [b[0]]\nif n>=3:\n for i in range(0, len(b)-1):\n test = b[i+1] - b[i]\n if test>=0:\n l.append(b[i])\n else:\n l.append(b[i+1])\n l.append(b[-1])\n print(sum(l))\nelse:\n print(b[0]*2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567906336", "date2": "1567906530", "bleu_score": "0.9701181396485578", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "3\n-1 -2\n", "actual_output": "-4\n", "expected_output": "-5\n\n", "anno_code": ["n = int(input()) # (0): n=3\nb = [int(i) for i in input().split()] # (1): b=[-1, -2]\n\nl = [b[0], b[0]] # (2): l=[-1, -1]\nif n>=3: # (3): NO CHANGE\n for i in range(1, len(b)-1): # (4): NO CHANGE\n test = b[i+1] - b[i]\n if test>=0:\n l.append(b[i])\n else:\n l.append(b[i+1])\n l.append(b[-1]) # (5): l=[-1, -1, -2]\n print(sum(l))\nelse:\n print(b[0]*2)"], "anno_status": [true], "diff_content": " n = int(input())\n b = [int(i) for i in input().split()] \n \n-l = [b[0], b[0]]\n+l = [b[0]]\n if n>=3:\n- for i in range(1, len(b)-1):\n+ for i in range(0, len(b)-1):\n test = b[i+1] - b[i]\n if test>=0:\n l.append(b[i])\n else:\n l.append(b[i+1])\n l.append(b[-1])\n print(sum(l))\n else:\n print(b[0]*2)\n", "FL_content": " n = int(input())\n b = [int(i) for i in input().split()] \n \n-l = [b[0], b[0]]\n if n>=3:\n- for i in range(1, len(b)-1):\n test = b[i+1] - b[i]\n if test>=0:\n l.append(b[i])\n else:\n l.append(b[i+1])\n l.append(b[-1])\n print(sum(l))\n else:\n print(b[0]*2)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u050708958", "problem_id": "p02917", "submission1_id": "s729619343", "submission2_id": "s856164078", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = [0] * n\nb = [int(i) for i in input().split()]\nans = 0\na[0] = b[0]\na[1] = b[0]\n\nfor i in range(2, n-1):\n a[i] = min(b[i], b[i-1])\na += [b[-1]]\nprint(sum(a))\n\n", "code2": "n = int(input())\na = [0] * n\nb = [int(i) for i in input().split()]\na[0] = b[0]\nfor i in range(1, n-1):\n a[i] = min(b[i], b[i-1])\na[-1] = b[-1]\nprint(sum(a))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568001378", "date2": "1568002077", "bleu_score": "0.8376920774399831", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 34, "total_score": 103, "input": "2\n-394\n", "actual_output": "-1182\n", "expected_output": "-788\n\n", "anno_code": ["n = int(input()) # (0): n=2\na = [0] * n # (1): a=[0, 0]\nb = [int(i) for i in input().split()] # (2): b=[-394]\nans = 0 # (3): ans=0\na[0] = b[0] # (4): a=[-394, 0]\na[1] = b[0] # (5): a=[-394, -394]\n\nfor i in range(2, n-1): # (6): NO CHANGE\n a[i] = min(b[i], b[i-1])\na += [b[-1]] # (7): a=[-394, -394, -394]\nprint(sum(a))\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = [0] * n\n b = [int(i) for i in input().split()]\n-ans = 0\n a[0] = b[0]\n-a[1] = b[0]\n-\n-for i in range(2, n-1):\n+for i in range(1, n-1):\n a[i] = min(b[i], b[i-1])\n-a += [b[-1]]\n+a[-1] = b[-1]\n print(sum(a))\n \n-\n", "FL_content": " n = int(input())\n a = [0] * n\n b = [int(i) for i in input().split()]\n-ans = 0\n a[0] = b[0]\n-a[1] = b[0]\n-\n-for i in range(2, n-1):\n a[i] = min(b[i], b[i-1])\n-a += [b[-1]]\n print(sum(a))\n \n-\n", "added_lines": 2, "removed_lines": 6, "code1_lines": 13 }, { "user_id": "u418527037", "problem_id": "p02917", "submission1_id": "s118689854", "submission2_id": "s246886430", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nB = list(map(int, input().split()))\n\nans = B[-1]\n\nfor i in range(N-2):\n ans += min(B[i],B[i+1])\n\nif N == 2:\n ans += B[0]\n\n\nprint(ans)", "code2": "N = int(input())\nB = list(map(int, input().split()))\n\nans = sum(B)*2\n\nfor i in range(N-2):\n ans -= max(B[i],B[i+1])\n\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567905950", "date2": "1567906166", "bleu_score": "0.7325853716169755", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 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, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 79, "total_score": 103, "input": "3\n-1 54\n", "actual_output": "53\n", "expected_output": "52\n\n", "anno_code": ["N = int(input()) # (0): N=3\nB = list(map(int, input().split())) # (1): B=[-1, 54]\n\nans = B[-1] # (2): ans=54\n\nfor i in range(N-2): # (3): i=0 (5): NO CHANGE\n ans += min(B[i],B[i+1]) # (4): ans=53\n\nif N == 2: # (6): NO CHANGE\n ans += B[0]\n\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n B = list(map(int, input().split()))\n \n-ans = B[-1]\n+ans = sum(B)*2\n \n for i in range(N-2):\n- ans += min(B[i],B[i+1])\n-\n-if N == 2:\n- ans += B[0]\n+ ans -= max(B[i],B[i+1])\n \n \n print(ans)\n", "FL_content": " N = int(input())\n B = list(map(int, input().split()))\n \n-ans = B[-1]\n \n for i in range(N-2):\n- ans += min(B[i],B[i+1])\n-\n-if N == 2:\n- ans += B[0]\n \n \n print(ans)\n", "added_lines": 2, "removed_lines": 5, "code1_lines": 13 }, { "user_id": "u785213188", "problem_id": "p02917", "submission1_id": "s373310397", "submission2_id": "s461442866", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nB = list(map(int, input().split()))\n\nsum = 0\nif N==2:\n sum += B[0]*2\nelse:\n sum += min([B[0], B[1]])\n for i in range(N-2):\n sum += min([B[i], B[i+1]])\n sum += B[N-2]\n\nprint(sum)", "code2": "N = int(input())\nB = list(map(int, input().split()))\n\nsum = 0\nif N==2:\n sum += B[0]+B[0]\nelse:\n sum += B[0]\n for i in range(N-2):\n sum += min([B[i], B[i+1]])\n sum += B[N-2]\nprint(sum)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567907087", "date2": "1567908296", "bleu_score": "0.9051843797756529", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "3\n-1 -2\n", "actual_output": "-6\n", "expected_output": "-5\n\n", "anno_code": ["N = int(input()) # (0): N=3\nB = list(map(int, input().split())) # (1): B=[-1, -2]\n\nsum = 0 # (2): sum=0\nif N==2: # (3): NO CHANGE\n sum += B[0]*2\nelse:\n sum += min([B[0], B[1]]) # (4): sum=-2\n for i in range(N-2): # (5): i=0 (7): NO CHANGE\n sum += min([B[i], B[i+1]]) # (6): sum=-4\n sum += B[N-2] # (8): sum=-6\n\nprint(sum)"], "anno_status": [true], "diff_content": " N = int(input())\n B = list(map(int, input().split()))\n \n sum = 0\n if N==2:\n- sum += B[0]*2\n+ sum += B[0]+B[0]\n else:\n- sum += min([B[0], B[1]])\n+ sum += B[0]\n for i in range(N-2):\n sum += min([B[i], B[i+1]])\n sum += B[N-2]\n-\n print(sum)\n", "FL_content": " N = int(input())\n B = list(map(int, input().split()))\n \n sum = 0\n if N==2:\n- sum += B[0]*2\n else:\n- sum += min([B[0], B[1]])\n for i in range(N-2):\n sum += min([B[i], B[i+1]])\n sum += B[N-2]\n-\n print(sum)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u121192152", "problem_id": "p02917", "submission1_id": "s546110108", "submission2_id": "s747569035", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nB = list(map(int, input().split()))\n\nA = [max(B)] * N\n\nfor n in range(N, 0, -1):\n if A[n-1] > B[n-2]:\n A[n-1] = B[n-2]\n if A[n-2] > B[n-2]:\n A[n-2] = B[n-2]\nprint(sum(A))", "code2": "N = int(input())\nB = list(map(int, input().split()))\n\nA = [max(B)] * N\n\nfor n in range(N-1):\n if B[n] < A[n]:\n A[n] = B[n]\n if B[n] < A[n+1]:\n A[n+1] = B[n]\nprint(sum(A))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567905173", "date2": "1567905853", "bleu_score": "0.8045119888245001", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "3\n-1 -2\n", "actual_output": "-6\n", "expected_output": "-5\n\n", "anno_code": ["N = int(input()) # (0): N=3\nB = list(map(int, input().split())) # (1): B=[-1, -2]\n\nA = [max(B)] * N # (2): A=[-1, -1, -1]\n\nfor n in range(N, 0, -1): # (3): n=3 (8): n=2 ... (15): NO CHANGE\n if A[n-1] > B[n-2]: # (4): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n A[n-1] = B[n-2] # (5): A=[-1, -1, -2] (13): A=[-2, -2, -2]\n if A[n-2] > B[n-2]: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n A[n-2] = B[n-2] # (7): A=[-1, -2, -2]\nprint(sum(A))"], "anno_status": [true], "diff_content": " N = int(input())\n B = list(map(int, input().split()))\n \n A = [max(B)] * N\n \n-for n in range(N, 0, -1):\n- if A[n-1] > B[n-2]:\n- A[n-1] = B[n-2]\n- if A[n-2] > B[n-2]:\n- A[n-2] = B[n-2]\n+for n in range(N-1):\n+ if B[n] < A[n]:\n+ A[n] = B[n]\n+ if B[n] < A[n+1]:\n+ A[n+1] = B[n]\n print(sum(A))\n", "FL_content": " N = int(input())\n B = list(map(int, input().split()))\n \n A = [max(B)] * N\n \n-for n in range(N, 0, -1):\n- if A[n-1] > B[n-2]:\n- A[n-1] = B[n-2]\n- if A[n-2] > B[n-2]:\n- A[n-2] = B[n-2]\n print(sum(A))\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u721425712", "problem_id": "p02917", "submission1_id": "s626029519", "submission2_id": "s448619787", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nb = list(map(int, input().split()))\n\na = [0]*n\nfor i in range(n-1):\n if n == 0:\n a[0] = b[0]\n a[1] = b[0]\n elif b[i] >= b[i-1]:\n a[i+1] = b[i]\n elif b[i] < b[i-1]:\n a[i+1] = b[i]\n a[i] = b[i]\nprint(sum(a))", "code2": "n = int(input())\nb = list(map(int, input().split()))\n\na = [0]*n\nfor i in range(n-1):\n if i == 0:\n a[0] = b[0]\n a[1] = b[0]\n elif b[i] >= b[i-1]:\n a[i+1] = b[i]\n elif b[i] < b[i-1]:\n a[i+1] = b[i]\n a[i] = b[i]\nprint(sum(a))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577932051", "date2": "1577932438", "bleu_score": "0.9905209761565795", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 35, "total_score": 103, "input": "2\n24\n", "actual_output": "24\n", "expected_output": "48\n\n", "anno_code": ["n = int(input()) # (0): n=2\nb = list(map(int, input().split())) # (1): b=[24]\n\na = [0]*n # (2): a=[0, 0]\nfor i in range(n-1): # (3): i=0 (7): NO CHANGE\n if n == 0: # (4): NO CHANGE\n a[0] = b[0]\n a[1] = b[0]\n elif b[i] >= b[i-1]: # (5): NO CHANGE\n a[i+1] = b[i] # (6): a=[0, 24]\n elif b[i] < b[i-1]:\n a[i+1] = b[i]\n a[i] = b[i]\nprint(sum(a))"], "anno_status": [true], "diff_content": " n = int(input())\n b = list(map(int, input().split()))\n \n a = [0]*n\n for i in range(n-1):\n- if n == 0:\n+ if i == 0:\n a[0] = b[0]\n a[1] = b[0]\n elif b[i] >= b[i-1]:\n a[i+1] = b[i]\n elif b[i] < b[i-1]:\n a[i+1] = b[i]\n a[i] = b[i]\n print(sum(a))\n", "FL_content": " n = int(input())\n b = list(map(int, input().split()))\n \n a = [0]*n\n for i in range(n-1):\n- if n == 0:\n a[0] = b[0]\n a[1] = b[0]\n elif b[i] >= b[i-1]:\n a[i+1] = b[i]\n elif b[i] < b[i-1]:\n a[i+1] = b[i]\n a[i] = b[i]\n print(sum(a))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u231189826", "problem_id": "p02917", "submission1_id": "s928113223", "submission2_id": "s448558488", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nB = list(map(int,(input().split())))\n\nlist_A = [0]*n\n\nlist_A[0] = B[0]\nlist_A[n-1] = B[n-2]\nfor i in range(1,n-2):\n list_A[i] = min(B[i],B[i+1])\n\nprint(list_A)\nprint(sum(list_A))\n\n\n", "code2": "n = int(input())\nB = list(map(int,(input().split())))\n\nlist_A = [0]*n\n\nlist_A[0] = B[0]\nlist_A[n-1] = B[n-2]\nfor i in range(1,n-1):\n list_A[i] = min(B[i-1],B[i])\n\nprint(sum(list_A))\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568155701", "date2": "1568155983", "bleu_score": "0.896325125390106", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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-15\n", "actual_output": "[-15, -15]\n-30\n", "expected_output": "-30\n\n", "anno_code": ["n = int(input()) # (0): n=2\nB = list(map(int,(input().split()))) # (1): B=[-15]\n\nlist_A = [0]*n # (2): list_A=[0, 0]\n\nlist_A[0] = B[0] # (3): list_A=[-15, 0]\nlist_A[n-1] = B[n-2] # (4): list_A=[-15, -15]\nfor i in range(1,n-2): # (5): NO CHANGE\n list_A[i] = min(B[i],B[i+1])\n\nprint(list_A) # (6): NO CHANGE\nprint(sum(list_A))\n\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n B = list(map(int,(input().split())))\n \n list_A = [0]*n\n \n list_A[0] = B[0]\n list_A[n-1] = B[n-2]\n-for i in range(1,n-2):\n- list_A[i] = min(B[i],B[i+1])\n+for i in range(1,n-1):\n+ list_A[i] = min(B[i-1],B[i])\n \n-print(list_A)\n print(sum(list_A))\n \n \n \n", "FL_content": " n = int(input())\n B = list(map(int,(input().split())))\n \n list_A = [0]*n\n \n list_A[0] = B[0]\n list_A[n-1] = B[n-2]\n-for i in range(1,n-2):\n- list_A[i] = min(B[i],B[i+1])\n \n-print(list_A)\n print(sum(list_A))\n \n \n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 15 }, { "user_id": "u597456301", "problem_id": "p02917", "submission1_id": "s216038409", "submission2_id": "s066977405", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn=int(input())\nb=input()\n\nb=b.split()\n\nb=list(map(int,b))\na=list()\na.append(b[0])\na.append(b[0])\nfor i in range(1,len(b)-1):\n \n \n a.append(min(b[i],b[i+1]))\nif(n>2):\n a.append(max(b[len(b)-1],a[len(a)-1]))\nsum=0 \nfor i in range(len(a)):\n sum+=a[i]\nprint(sum)\n", "code2": "\nn=int(input())\nb=input()\n\nb=b.split()\n\nb=list(map(int,b))\na=list()\na.append(b[0])\n\nfor i in range(1,len(b)):\n \n \n a.append(min(b[i],b[i-1]))\nif(n>2):\n a.append(b[len(b)-1])\nif(n==2):\n a.append(b[0])\nsum=0 \nfor i in range(len(a)):\n sum+=a[i]\nprint(sum)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567907466", "date2": "1567907954", "bleu_score": "0.9080680510739852", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "6\n0 -2 -1 -1 -1\n", "actual_output": "-5\n", "expected_output": "-7\n\n", "anno_code": ["\nn=int(input()) # (0): n=6\nb=input() # (1): b=0 -2 -1 -1 -1\n\nb=b.split() # (2): b=['0', '-2', '-1', '-1', '-1']\n\nb=list(map(int,b)) # (3): b=[0, -2, -1, -1, -1]\na=list() # (4): a=[]\na.append(b[0]) # (5): a=[0]\na.append(b[0]) # (6): a=[0, 0]\nfor i in range(1,len(b)-1): # (7): i=1 (9): i=2 ... (13): NO CHANGE\n \n \n a.append(min(b[i],b[i+1])) # (8): a=[0, 0, -2] (10): a=[0, 0, -2, -1] (12): a=[0, 0, -2, -1, -1]\nif(n>2): # (14): NO CHANGE\n a.append(max(b[len(b)-1],a[len(a)-1])) # (15): a=[0, 0, -2, -1, -1, -1]\nsum=0 # (16): sum=0\nfor i in range(len(a)): # (17): i=0 (19): i=1 ... (29): NO CHANGE\n sum+=a[i] # (18): NO CHANGE (20): NO CHANGE ... (28): sum=-5\nprint(sum)\n"], "anno_status": [true], "diff_content": " \n n=int(input())\n b=input()\n \n b=b.split()\n \n b=list(map(int,b))\n a=list()\n a.append(b[0])\n-a.append(b[0])\n-for i in range(1,len(b)-1):\n+\n+for i in range(1,len(b)):\n \n \n- a.append(min(b[i],b[i+1]))\n+ a.append(min(b[i],b[i-1]))\n if(n>2):\n- a.append(max(b[len(b)-1],a[len(a)-1]))\n+ a.append(b[len(b)-1])\n+if(n==2):\n+ a.append(b[0])\n sum=0 \n for i in range(len(a)):\n sum+=a[i]\n print(sum)\n \n", "FL_content": " \n n=int(input())\n b=input()\n \n b=b.split()\n \n b=list(map(int,b))\n a=list()\n a.append(b[0])\n-a.append(b[0])\n-for i in range(1,len(b)-1):\n \n \n- a.append(min(b[i],b[i+1]))\n if(n>2):\n- a.append(max(b[len(b)-1],a[len(a)-1]))\n sum=0 \n for i in range(len(a)):\n sum+=a[i]\n print(sum)\n \n", "added_lines": 6, "removed_lines": 4, "code1_lines": 21 }, { "user_id": "u188916636", "problem_id": "p02917", "submission1_id": "s405952669", "submission2_id": "s754146741", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nB = list(map(int, input().split()))\n\nA=[0 for i in range(N)] \nA[0]=B[0]\nA[N-2]=min(B[N-2],B[N-3])\nA[N-1]=B[N-2]\n\nfor i in range(1,N-2):\n A[i] = min(B[i-1],B[i],B[i+1])\n \nprint(sum(A))", "code2": "N = int(input())\nB = list(map(int, input().split()))\n\nA=[0 for i in range(N)] \nA[0]=B[0]\nA[N-1]=B[N-2]\nif N > 2:\n for i in range(1,N-1):\n A[i] = min(B[i-1],B[i])\n \nprint(sum(A))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567907229", "date2": "1567908610", "bleu_score": "0.8100957592615168", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "6\n0 164 10 7 26\n", "actual_output": "47\n", "expected_output": "50\n\n", "anno_code": ["N = int(input()) # (0): N=6\nB = list(map(int, input().split())) # (1): B=[0, 164, 10, 7, 26]\n\nA=[0 for i in range(N)] # (2): A=[0, 0, 0, 0, 0, 0]\nA[0]=B[0] # (3): NO CHANGE\nA[N-2]=min(B[N-2],B[N-3]) # (4): A=[0, 0, 0, 0, 7, 0]\nA[N-1]=B[N-2] # (5): A=[0, 0, 0, 0, 7, 26]\n\nfor i in range(1,N-2): # (6): i=1 (8): i=2 ... (12): NO CHANGE\n A[i] = min(B[i-1],B[i],B[i+1]) # (7): NO CHANGE (9): A=[0, 0, 7, 0, 7, 26] (11): A=[0, 0, 7, 7, 7, 26]\n \nprint(sum(A))"], "anno_status": [true], "diff_content": " N = int(input())\n B = list(map(int, input().split()))\n \n A=[0 for i in range(N)] \n A[0]=B[0]\n-A[N-2]=min(B[N-2],B[N-3])\n A[N-1]=B[N-2]\n-\n-for i in range(1,N-2):\n- A[i] = min(B[i-1],B[i],B[i+1])\n+if N > 2:\n+ for i in range(1,N-1):\n+ A[i] = min(B[i-1],B[i])\n \n print(sum(A))\n+\n", "FL_content": " N = int(input())\n B = list(map(int, input().split()))\n \n A=[0 for i in range(N)] \n A[0]=B[0]\n-A[N-2]=min(B[N-2],B[N-3])\n A[N-1]=B[N-2]\n-\n-for i in range(1,N-2):\n- A[i] = min(B[i-1],B[i],B[i+1])\n \n print(sum(A))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u667189155", "problem_id": "p02917", "submission1_id": "s883337779", "submission2_id": "s518042773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nb = list(map(int, input().split()))\n\nsum = b[0]*2\nif n >= 4:\n for i in range(n-2):\n if b[i] > b[i+1]:\n b[i] = b[i+1]\n sum += b[i]\n\nsum += b[-1]\nprint(sum)\n", "code2": "n = int(input())\nb = list(map(int, input().split()))\n\na = [0]*n\na[0] = b[0]\na[-1] = b[-1]\nfor i in range(n-2):\n if b[i] > b[i+1]:\n b[i] = b[i+1]\n a[i+1] = b[i]\n\nprint(sum(a))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567907916", "date2": "1567908926", "bleu_score": "0.7563243709745902", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 31, "total_score": 103, "input": "2\n-427\n", "actual_output": "-1281\n", "expected_output": "-854\n\n", "anno_code": ["n = int(input()) # (0): n=2\nb = list(map(int, input().split())) # (1): b=[-427]\n\nsum = b[0]*2 # (2): sum=-854\nif n >= 4: # (3): NO CHANGE\n for i in range(n-2):\n if b[i] > b[i+1]:\n b[i] = b[i+1]\n sum += b[i]\n\nsum += b[-1] # (4): sum=-1281\nprint(sum)\n"], "anno_status": [true], "diff_content": " n = int(input())\n b = list(map(int, input().split()))\n \n-sum = b[0]*2\n-if n >= 4:\n- for i in range(n-2):\n- if b[i] > b[i+1]:\n- b[i] = b[i+1]\n- sum += b[i]\n-\n-sum += b[-1]\n-print(sum)\n+a = [0]*n\n+a[0] = b[0]\n+a[-1] = b[-1]\n+for i in range(n-2):\n+ if b[i] > b[i+1]:\n+ b[i] = b[i+1]\n+ a[i+1] = b[i]\n \n+print(sum(a))\n", "FL_content": " n = int(input())\n b = list(map(int, input().split()))\n \n-sum = b[0]*2\n-if n >= 4:\n- for i in range(n-2):\n- if b[i] > b[i+1]:\n- b[i] = b[i+1]\n- sum += b[i]\n-\n-sum += b[-1]\n-print(sum)\n \n", "added_lines": 9, "removed_lines": 10, "code1_lines": 13 }, { "user_id": "u834168862", "problem_id": "p02917", "submission1_id": "s373054515", "submission2_id": "s563623026", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nb_list = [int(i) for i in input().split()]\na_list = [0] * n\nbefore_val = 0\nfor i in range(n-1):\n target = b_list[i]\n if a_list[i] == before_val:\n a_list[i], a_list[i+1] = b_list[i], b_list[i]\n else:\n a_list[i+1] = b_list[i]\nprint(sum(a_list))", "code2": "n = int(input())\nb_list = [int(i) for i in input().split()]\na_list = [0] * n\nbefore_val = 0\nfor i in range(n-1):\n target = b_list[i]\n if i == 0:\n a_list[i], a_list[i+1] = target, target\n elif before_val >= target:\n a_list[i], a_list[i+1] = target, target\n else:\n a_list[i], a_list[i+1] = before_val, target\n before_val = target\nprint(sum(a_list))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567909575", "date2": "1567911641", "bleu_score": "0.6878923150757204", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 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, 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, 0], "code1_test_score": 86, "total_score": 103, "input": "3\n0 88\n", "actual_output": "176\n", "expected_output": "88\n\n", "anno_code": ["n = int(input()) # (0): n=3\nb_list = [int(i) for i in input().split()] # (1): b_list=[0, 88]\na_list = [0] * n # (2): a_list=[0, 0, 0]\nbefore_val = 0 # (3): before_val=0\nfor i in range(n-1): # (4): i=0 (8): i=1 (12): NO CHANGE\n target = b_list[i] # (5): target=0 (9): target=88\n if a_list[i] == before_val: # (6): NO CHANGE (10): NO CHANGE\n a_list[i], a_list[i+1] = b_list[i], b_list[i] # (7): NO CHANGE (11): a_list=[0, 88, 88]\n else:\n a_list[i+1] = b_list[i]\nprint(sum(a_list))"], "anno_status": [true], "diff_content": " n = int(input())\n b_list = [int(i) for i in input().split()]\n a_list = [0] * n\n before_val = 0\n for i in range(n-1):\n target = b_list[i]\n- if a_list[i] == before_val:\n- a_list[i], a_list[i+1] = b_list[i], b_list[i]\n+ if i == 0:\n+ a_list[i], a_list[i+1] = target, target\n+ elif before_val >= target:\n+ a_list[i], a_list[i+1] = target, target\n else:\n- a_list[i+1] = b_list[i]\n+ a_list[i], a_list[i+1] = before_val, target\n+ before_val = target\n print(sum(a_list))\n", "FL_content": " n = int(input())\n b_list = [int(i) for i in input().split()]\n a_list = [0] * n\n before_val = 0\n for i in range(n-1):\n target = b_list[i]\n- if a_list[i] == before_val:\n- a_list[i], a_list[i+1] = b_list[i], b_list[i]\n else:\n- a_list[i+1] = b_list[i]\n print(sum(a_list))\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u965581346", "problem_id": "p02917", "submission1_id": "s341719029", "submission2_id": "s398067649", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n \nN = int(input())\n\nB = [int(e) for e in input().split()]\n\nA = [0] * N\nA[N - 1] = B[N - 2]\nA[N - 2] = B[N -2]\n\n\nfor i in reversed(range(0, N - 1)):\n\tA[i] = min(A[i], B[i - 1])\n\tA[i - 1] = B[i - 1]\n\n\nprint(sum(A))\n", "code2": "\n \nN = int(input())\n\nB = [int(e) for e in input().split()]\n\nA = [0] * N\n\nA[0] = B[0]\nA[1] = B[0]\n\nfor i in range(1, N - 1):\n\tA[i] = min(B[i], A[i])\n\tA[i + 1] = B[i]\n\nprint(sum(A))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567906997", "date2": "1567908263", "bleu_score": "0.7182913766839792", "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, 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], "code1_test_score": 100, "total_score": 103, "input": "6\n0 -2 -1 -1 -1\n", "actual_output": "-8\n", "expected_output": "-7\n\n", "anno_code": ["\n \nN = int(input()) # (0): N=6\n\nB = [int(e) for e in input().split()] # (1): B=[0, -2, -1, -1, -1]\n\nA = [0] * N # (2): A=[0, 0, 0, 0, 0, 0]\nA[N - 1] = B[N - 2] # (3): A=[0, 0, 0, 0, 0, -1]\nA[N - 2] = B[N -2] # (4): A=[0, 0, 0, 0, -1, -1]\n\n\nfor i in reversed(range(0, N - 1)): # (5): i=4 (8): i=3 ... (20): NO CHANGE\n\tA[i] = min(A[i], B[i - 1]) # (6): NO CHANGE (9): NO CHANGE ... (18): A=[-1, -2, -2, -1, -1, -1]\n\tA[i - 1] = B[i - 1] # (7): A=[0, 0, 0, -1, -1, -1] (10): A=[0, 0, -1, -1, -1, -1] ... (19): NO CHANGE\n\n\nprint(sum(A))\n"], "anno_status": [true], "diff_content": " \n \n N = int(input())\n \n B = [int(e) for e in input().split()]\n \n A = [0] * N\n-A[N - 1] = B[N - 2]\n-A[N - 2] = B[N -2]\n \n+A[0] = B[0]\n+A[1] = B[0]\n \n-for i in reversed(range(0, N - 1)):\n-\tA[i] = min(A[i], B[i - 1])\n-\tA[i - 1] = B[i - 1]\n-\n+for i in range(1, N - 1):\n+\tA[i] = min(B[i], A[i])\n+\tA[i + 1] = B[i]\n \n print(sum(A))\n \n", "FL_content": " \n \n N = int(input())\n \n B = [int(e) for e in input().split()]\n \n A = [0] * N\n-A[N - 1] = B[N - 2]\n-A[N - 2] = B[N -2]\n \n \n-for i in reversed(range(0, N - 1)):\n-\tA[i] = min(A[i], B[i - 1])\n-\tA[i - 1] = B[i - 1]\n-\n \n print(sum(A))\n \n", "added_lines": 5, "removed_lines": 6, "code1_lines": 18 }, { "user_id": "u882209234", "problem_id": "p03078", "submission1_id": "s572868270", "submission2_id": "s462291769", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y,Z,K = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n\nAB = []\nfor a in A:\n for b in B:\n AB.append(a+b)\nAB.sort(reverse=True)\n\nAB = AB[:K]\nC.sort(reverse=True)\nABC = []\ni = 0\nfor ab in AB:\n if i >= K: break\n for c in C:\n ABC.append(ab+c)\n i += 1\n\nABC.sort(reverse=True)\n\nfor i in range(K): print(ABC[i])", "code2": "X,Y,Z,K = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\n\nans = []\nfor i in range(X):\n for j in range(Y):\n for k in range(Z):\n if (i+1)*(j+1)*(k+1) <= K: ans.append(A[i]+B[j]+C[k])\n else: break\nans.sort(reverse=True)\nfor i in range(K): print(ans[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566023474", "date2": "1566026396", "bleu_score": "0.734292824846938", "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, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 2, "total_score": 103, "input": "10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 14107954240 249131806 11770255275 2323224880 6082257488\n1873977926 2576529623 1479553652 1379118507 6003234687 4925540914 3902539811 3326692703 233755778 2877436338\n4975681328 8700180183 2882263257 4734915691 514305523 6679823484 3306606453 585966808 3752282379 620585736\n", "actual_output": "28811369110\n27733675337\n26791012411\n25713318638\n25086870255\n24846104618\n24009176482\n23863471306\n23768410845\n23417795380\n22993452184\n22785777533\n22340101607\n21915758411\n20731774663\n20697155735\n20625494450\n19654080890\n19619461962\n19547800677\n", "expected_output": "28811369110\n27733675337\n26791012411\n26710674234\n26473670145\n26134827126\n25713318638\n25685570761\n25395976372\n25384664046\n25086870255\n24846104618\n24690317535\n24682112349\n24453313446\n24372975269\n24287688075\n24187252930\n24114470427\n24009176482\n\n", "anno_code": ["X,Y,Z,K = map(int,input().split()) # (0): X=10, Y=10, Z=10, K=20\nA = list(map(int,input().split())) # (1): A=[7467038376, 5724769290, 292794712, 2843504496, 3381970101, 14107954240, 249131806, 11770255275, 2323224880, 6082257488]\nB = list(map(int,input().split())) # (2): B=[1873977926, 2576529623, 1479553652, 1379118507, 6003234687, 4925540914, 3902539811, 3326692703, 233755778, 2877436338]\nC = list(map(int,input().split())) # (3): C=[4975681328, 8700180183, 2882263257, 4734915691, 514305523, 6679823484, 3306606453, 585966808, 3752282379, 620585736]\n\nAB = [] # (4): AB=[]\nfor a in A: # (5): a=7467038376 (27): a=5724769290 ... (225): NO CHANGE\n for b in B: # (6): b=1873977926 (8): b=2576529623 ... (224): NO CHANGE\n AB.append(a+b) # (7): AB=[9341016302] (9): AB=[9341016302, 10043567999] ... (223): AB=[9341016302, 10043567999, ..., 6316013266, 8959693826]\nAB.sort(reverse=True) # (226): AB=[20111188927, 19033495154, ..., 526550490, 482887584]\n\nAB = AB[:K] # (227): AB=[20111188927, 19033495154, 18010494051, 17773489962, 17434646943, 16985390578, 16695796189, 16684483863, 15981932166, 15672795086, 15587507892, 15487072747, 15096947978, 14647691613, 14346784898, 14341710018, 13644233201, 13470273063, 13249808927, 13149373782]\nC.sort(reverse=True) # (228): C=[8700180183, 6679823484, 4975681328, 4734915691, 3752282379, 3306606453, 2882263257, 620585736, 585966808, 514305523]\nABC = [] # (229): ABC=[]\ni = 0 # (230): i=0\nfor ab in AB: # (231): ab=20111188927 (264): ab=19033495154 (297): ab=18010494051\n if i >= K: break # (232): NO CHANGE (265): NO CHANGE (298): NO CHANGE\n for c in C: # (233): c=8700180183 (236): c=6679823484 ... (296): NO CHANGE\n ABC.append(ab+c) # (234): ABC=[28811369110] (237): ABC=[28811369110, 26791012411] ... (294): ABC=[28811369110, 26791012411, 25086870255, 24846104618, 23863471306, 23417795380, 22993452184, 20731774663, 20697155735, 20625494450, 27733675337, 25713318638, 24009176482, 23768410845, 22785777533, 22340101607, 21915758411, 19654080890, 19619461962, 19547800677]\n i += 1 # (235): i=1 (238): i=2 ... (295): i=20\n\nABC.sort(reverse=True) # (299): ABC=[28811369110, 27733675337, 26791012411, 25713318638, 25086870255, 24846104618, 24009176482, 23863471306, 23768410845, 23417795380, 22993452184, 22785777533, 22340101607, 21915758411, 20731774663, 20697155735, 20625494450, 19654080890, 19619461962, 19547800677]\n\nfor i in range(K): print(ABC[i]) # (300): i=0 (301): i=1 ... (319): i=19\n"], "anno_status": [false], "diff_content": " X,Y,Z,K = map(int,input().split())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n-AB = []\n-for a in A:\n- for b in B:\n- AB.append(a+b)\n-AB.sort(reverse=True)\n-\n-AB = AB[:K]\n+A.sort(reverse=True)\n+B.sort(reverse=True)\n C.sort(reverse=True)\n-ABC = []\n-i = 0\n-for ab in AB:\n- if i >= K: break\n- for c in C:\n- ABC.append(ab+c)\n- i += 1\n-\n-ABC.sort(reverse=True)\n \n-for i in range(K): print(ABC[i])\n+ans = []\n+for i in range(X):\n+ for j in range(Y):\n+ for k in range(Z):\n+ if (i+1)*(j+1)*(k+1) <= K: ans.append(A[i]+B[j]+C[k])\n+ else: break\n+ans.sort(reverse=True)\n+for i in range(K): print(ans[i])\n", "FL_content": " X,Y,Z,K = map(int,input().split())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n-AB = []\n-for a in A:\n- for b in B:\n- AB.append(a+b)\n-AB.sort(reverse=True)\n-\n-AB = AB[:K]\n C.sort(reverse=True)\n-ABC = []\n-i = 0\n-for ab in AB:\n- if i >= K: break\n- for c in C:\n- ABC.append(ab+c)\n- i += 1\n-\n-ABC.sort(reverse=True)\n \n-for i in range(K): print(ABC[i])\n", "added_lines": 10, "removed_lines": 17, "code1_lines": 24 }, { "user_id": "u424241608", "problem_id": "p03106", "submission1_id": "s313588120", "submission2_id": "s466843799", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\na,b,k = map(int,input().split())\n\ncnt = 0\nfor i in range(1,min(a,b)+1):\n if a%i == 0 and b%i == 0:\n cnt+=1\n if cnt == k:\n print(k)\n break\n", "code2": "\ndef gcd(a,b):\n if b == 0:return a\n return gcd(b,a%b)\n\na,b,k = map(int,input().split())\n\ng = gcd(a,b)\n\ncnt = 0\nfor i in range(g,0,-1):\n if a%i == 0 and b%i == 0:\n \n cnt+=1\n if cnt == k:\n print(i)\n break\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587846938", "date2": "1587847630", "bleu_score": "0.6314102984774532", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 36, "total_score": 97, "input": "33 11 1\n", "actual_output": "1\n", "expected_output": "11\n\n", "anno_code": ["\na,b,k = map(int,input().split()) # (0): a=33, b=11, k=1\n\ncnt = 0 # (1): cnt=0\nfor i in range(1,min(a,b)+1): # (2): i=1\n if a%i == 0 and b%i == 0: # (3): NO CHANGE\n cnt+=1 # (4): cnt=1\n if cnt == k: # (5): NO CHANGE\n print(k) # (6): NO CHANGE\n break\n"], "anno_status": [true], "diff_content": " \n+def gcd(a,b):\n+ if b == 0:return a\n+ return gcd(b,a%b)\n+\n a,b,k = map(int,input().split())\n \n+g = gcd(a,b)\n+\n cnt = 0\n-for i in range(1,min(a,b)+1):\n+for i in range(g,0,-1):\n if a%i == 0 and b%i == 0:\n+ \n cnt+=1\n if cnt == k:\n- print(k)\n+ print(i)\n break\n \n", "FL_content": " \n a,b,k = map(int,input().split())\n \n cnt = 0\n-for i in range(1,min(a,b)+1):\n if a%i == 0 and b%i == 0:\n cnt+=1\n if cnt == k:\n- print(k)\n break\n \n", "added_lines": 9, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u144980750", "problem_id": "p03106", "submission1_id": "s489117375", "submission2_id": "s232886043", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=[0,0]\ns=[]\na[0],a[1],k=map(int,input().split())\nfor i in range(1,max(a)+1):\n if a[0]%i==0 and a[1]%i==0:\n s.append(i)\nprint(s[k-1])", "code2": "a=[0,0]\ns=[]\na[0],a[1],k=map(int,input().split())\nfor i in range(1,min(a)+1):\n if a[0]%i==0 and a[1]%i==0:\n s.append(i)\nprint(s[len(s)-k])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556407049", "date2": "1556407346", "bleu_score": "0.9124500755825538", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "51 18 1\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["a=[0,0] # (0): a=[0, 0]\ns=[] # (1): s=[]\na[0],a[1],k=map(int,input().split()) # (2): a=[51, 18], k=1\nfor i in range(1,max(a)+1): # (3): i=1 (6): i=2 ... (107): NO CHANGE\n if a[0]%i==0 and a[1]%i==0: # (4): NO CHANGE (7): NO CHANGE ... (106): NO CHANGE\n s.append(i) # (5): s=[1] (10): s=[1, 3]\nprint(s[k-1])"], "anno_status": [true], "diff_content": " a=[0,0]\n s=[]\n a[0],a[1],k=map(int,input().split())\n-for i in range(1,max(a)+1):\n+for i in range(1,min(a)+1):\n if a[0]%i==0 and a[1]%i==0:\n s.append(i)\n-print(s[k-1])\n+print(s[len(s)-k])\n", "FL_content": " a=[0,0]\n s=[]\n a[0],a[1],k=map(int,input().split())\n-for i in range(1,max(a)+1):\n if a[0]%i==0 and a[1]%i==0:\n s.append(i)\n-print(s[k-1])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u629350026", "problem_id": "p03106", "submission1_id": "s038185946", "submission2_id": "s701695382", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,k=map(int,input().split())\ntemp=[]\nfor i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n temp.append(i)\nprint(temp[k-1])\n ", "code2": "a,b,k=map(int,input().split())\ntemp=[]\nfor i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n temp.append(i)\nprint(temp[len(temp)-k])\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590696857", "date2": "1590697064", "bleu_score": "0.9125055461907695", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "110 50 2\n", "actual_output": "2\n", "expected_output": "5\n\n", "anno_code": ["a,b,k=map(int,input().split()) # (0): a=110, b=50, k=2\ntemp=[] # (1): temp=[]\nfor i in range(1,min(a,b)+1): # (2): i=1 (5): i=2 ... (106): NO CHANGE\n if a%i==0 and b%i==0: # (3): NO CHANGE (6): NO CHANGE ... (105): NO CHANGE\n temp.append(i) # (4): temp=[1] (7): temp=[1, 2] ... (25): temp=[1, 2, 5, 10]\nprint(temp[k-1])\n "], "anno_status": [true], "diff_content": " a,b,k=map(int,input().split())\n temp=[]\n for i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n temp.append(i)\n-print(temp[k-1])\n+print(temp[len(temp)-k])\n \n", "FL_content": " a,b,k=map(int,input().split())\n temp=[]\n for i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n temp.append(i)\n-print(temp[k-1])\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u124873669", "problem_id": "p03106", "submission1_id": "s787524090", "submission2_id": "s117896261", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,K=(int(x) for x in input().split())\n\nval = 1\nlcnt = 0\nwhile True:\n if A % val == 0 and B % val == 0:\n lcnt += 1\n if lcnt == K:\n break\n val += 1\nprint(val)", "code2": "A,B,K=(int(x) for x in input().split())\n\nval = 1\nvalSet = []\nwhile True:\n if A % val == 0 and B % val == 0:\n valSet.append(val)\n val += 1\n if val > min(A, B):\n break\nprint(valSet[-1*K])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551823788", "date2": "1551824165", "bleu_score": "0.7201316426412839", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "51 12 2\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["A,B,K=(int(x) for x in input().split()) # (0): A=51, B=12, K=2\n\nval = 1 # (1): val=1\nlcnt = 0 # (2): lcnt=0\nwhile True: # (3): NO CHANGE (8): NO CHANGE (12): NO CHANGE\n if A % val == 0 and B % val == 0: # (4): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n lcnt += 1 # (5): lcnt=1 (14): lcnt=2\n if lcnt == K: # (6): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n break # (16): NO CHANGE\n val += 1 # (7): val=2 (11): val=3\nprint(val)"], "anno_status": [true], "diff_content": " A,B,K=(int(x) for x in input().split())\n \n val = 1\n-lcnt = 0\n+valSet = []\n while True:\n if A % val == 0 and B % val == 0:\n- lcnt += 1\n- if lcnt == K:\n- break\n+ valSet.append(val)\n val += 1\n-print(val)\n+ if val > min(A, B):\n+ break\n+print(valSet[-1*K])\n+\n", "FL_content": " A,B,K=(int(x) for x in input().split())\n \n val = 1\n-lcnt = 0\n while True:\n if A % val == 0 and B % val == 0:\n- lcnt += 1\n- if lcnt == K:\n- break\n val += 1\n-print(val)\n", "added_lines": 6, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u952708174", "problem_id": "p03106", "submission1_id": "s642281618", "submission2_id": "s092990673", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, K = [int(i) for i in input().split()]\ntmp = []\nfor j in range(1, 101):\n if A % j == 0 and B % j == 0:\n tmp.append(j)\nprint(tmp[K - 1])", "code2": "A, B, K = [int(i) for i in input().split()]\ntmp = []\nfor j in range(1, 101):\n if A % j == 0 and B % j == 0:\n tmp.append(j)\ntmp = tmp[::-1]\nprint(tmp[K - 1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551643595", "date2": "1551643865", "bleu_score": "0.8981209869503333", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "28 22 2\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["A, B, K = [int(i) for i in input().split()] # (0): A=28, B=22, K=2\ntmp = [] # (1): tmp=[]\nfor j in range(1, 101): # (2): j=1 (5): j=2 ... (204): NO CHANGE\n if A % j == 0 and B % j == 0: # (3): NO CHANGE (6): NO CHANGE ... (203): NO CHANGE\n tmp.append(j) # (4): tmp=[1] (7): tmp=[1, 2]\nprint(tmp[K - 1])"], "anno_status": [true], "diff_content": " A, B, K = [int(i) for i in input().split()]\n tmp = []\n for j in range(1, 101):\n if A % j == 0 and B % j == 0:\n tmp.append(j)\n+tmp = tmp[::-1]\n print(tmp[K - 1])\n", "FL_content": " A, B, K = [int(i) for i in input().split()]\n tmp = []\n for j in range(1, 101):\n if A % j == 0 and B % j == 0:\n tmp.append(j)\n print(tmp[K - 1])\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u224554402", "problem_id": "p03106", "submission1_id": "s909109023", "submission2_id": "s618350959", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c= input().split()\nx,y,z=(int(a),int(b),int(c))\nans_list =[]\nfor i in range(min(x,y)):\n \n if x % (i+1) == 0 and y % (i+1) == 0:\n ans_list.append(i+1)\n print(ans_list)\nprint(ans_list[len(ans_list)-z])", "code2": "a,b,c= input().split()\nx,y,z=(int(a),int(b),int(c))\nans_list =[]\nfor i in range(min(x,y)):\n \n if x % (i+1) == 0 and y % (i+1) == 0:\n ans_list.append(i+1)\nprint(ans_list[len(ans_list)-z])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586330986", "date2": "1586331025", "bleu_score": "0.885253007861575", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "189 63 1\n", "actual_output": "[1]\n[1, 3]\n[1, 3, 7]\n[1, 3, 7, 9]\n[1, 3, 7, 9, 21]\n[1, 3, 7, 9, 21, 63]\n63\n", "expected_output": "63\n\n", "anno_code": ["a,b,c= input().split() # (0): a=189, b=63, c=1\nx,y,z=(int(a),int(b),int(c)) # (1): x=189, y=63, z=1\nans_list =[] # (2): ans_list=[]\nfor i in range(min(x,y)): # (3): i=0 (7): i=1 ... (141): NO CHANGE\n \n if x % (i+1) == 0 and y % (i+1) == 0: # (4): NO CHANGE (8): NO CHANGE ... (138): NO CHANGE\n ans_list.append(i+1) # (5): ans_list=[1] (11): ans_list=[1, 3] ... (139): ans_list=[1, 3, 7, 9, 21, 63]\n print(ans_list) # (6): NO CHANGE (12): NO CHANGE ... (140): NO CHANGE\nprint(ans_list[len(ans_list)-z])"], "anno_status": [true], "diff_content": " a,b,c= input().split()\n x,y,z=(int(a),int(b),int(c))\n ans_list =[]\n for i in range(min(x,y)):\n \n if x % (i+1) == 0 and y % (i+1) == 0:\n ans_list.append(i+1)\n- print(ans_list)\n print(ans_list[len(ans_list)-z])\n", "FL_content": " a,b,c= input().split()\n x,y,z=(int(a),int(b),int(c))\n ans_list =[]\n for i in range(min(x,y)):\n \n if x % (i+1) == 0 and y % (i+1) == 0:\n ans_list.append(i+1)\n- print(ans_list)\n print(ans_list[len(ans_list)-z])\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u901122076", "problem_id": "p03106", "submission1_id": "s525617759", "submission2_id": "s768657770", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, K = map(int, input().split())\n\nmax_num = max(A, B)\ncount = 0\n\nfor i in range(max_num, 0, -1):\n if A % i == 0 and B % i == 0:\n count += 1\n if count == K:\n break\n", "code2": "A, B, K = map(int, input().split())\n\nmax_num = max(A, B)\ncount = 0\n\nfor i in range(max_num, 0, -1):\n if A % i == 0 and B % i == 0:\n count += 1\n if count == K:\n print(i)\n break\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551644546", "date2": "1551644595", "bleu_score": "0.9016364996566467", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "27 25 1\n", "actual_output": "", "expected_output": "1\n\n", "anno_code": ["A, B, K = map(int, input().split()) # (0): A=27, B=25, K=1\n\nmax_num = max(A, B) # (1): max_num=27\ncount = 0 # (2): count=0\n\nfor i in range(max_num, 0, -1): # (3): i=27 (5): i=26 ... (55): i=1\n if A % i == 0 and B % i == 0: # (4): NO CHANGE (6): NO CHANGE ... (56): NO CHANGE\n count += 1 # (57): count=1\n if count == K: # (58): NO CHANGE\n break\n"], "anno_status": [true], "diff_content": " A, B, K = map(int, input().split())\n \n max_num = max(A, B)\n count = 0\n \n for i in range(max_num, 0, -1):\n if A % i == 0 and B % i == 0:\n count += 1\n if count == K:\n+ print(i)\n break\n \n", "FL_content": " A, B, K = map(int, input().split())\n \n max_num = max(A, B)\n count = 0\n \n for i in range(max_num, 0, -1):\n if A % i == 0 and B % i == 0:\n count += 1\n if count == K:\n break\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u014268998", "problem_id": "p03106", "submission1_id": "s802381741", "submission2_id": "s899460856", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,k = map(int,input().split())\n\n\n\nc = 0\nans = 0\nfor i in range(min(a,b),1,-1):\n if(a%i == 0 and b%i == 0):\n c += 1\n print(i)\n if(c == k):\n ans = i\n break\n\nprint(ans)", "code2": "a,b,k = map(int,input().split())\n\n\n\nc = 0\nans = 0\nfor i in range(min(a,b),0,-1):\n if(a%i == 0 and b%i == 0):\n c += 1\n if(c == k):\n ans = i\n break\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588858438", "date2": "1588858504", "bleu_score": "0.9145007821731149", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "27 25 1\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["a,b,k = map(int,input().split()) # (0): a=27, b=25, k=1\n\n\n\nc = 0 # (1): c=0\nans = 0 # (2): ans=0\nfor i in range(min(a,b),1,-1): # (3): i=25 (5): i=24 ... (51): NO CHANGE\n if(a%i == 0 and b%i == 0): # (4): NO CHANGE (6): NO CHANGE ... (50): NO CHANGE\n c += 1\n print(i)\n if(c == k):\n ans = i\n break\n\nprint(ans)"], "anno_status": [true], "diff_content": " a,b,k = map(int,input().split())\n \n \n \n c = 0\n ans = 0\n-for i in range(min(a,b),1,-1):\n+for i in range(min(a,b),0,-1):\n if(a%i == 0 and b%i == 0):\n c += 1\n- print(i)\n if(c == k):\n ans = i\n break\n \n print(ans)\n", "FL_content": " a,b,k = map(int,input().split())\n \n \n \n c = 0\n ans = 0\n-for i in range(min(a,b),1,-1):\n if(a%i == 0 and b%i == 0):\n c += 1\n- print(i)\n if(c == k):\n ans = i\n break\n \n print(ans)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u657221245", "problem_id": "p03106", "submission1_id": "s774215225", "submission2_id": "s047670945", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(map(int, input().split()))\nnum1 = a[0]\nnum2 = a[1]\nlist1 = []\nlist2 = []\nmax = a[2]\nfor i in range(1, num1 + 1):\n if num1 % i == 0:\n list1.append(i)\n \nfor i in range(1, num2 + 1):\n if num2 % i == 0:\n list2.append(i)\n\nlist3 = list(set(list1) & set(list2))\nlist3.sort()\n\nprint(list3[max -1])", "code2": "a = list(map(int, input().split()))\nnum1 = a[0]\nnum2 = a[1]\nlist1 = []\nlist2 = []\nmax = a[2]\nfor i in range(1, num1 + 1):\n if num1 % i == 0:\n list1.append(i)\n \nfor i in range(1, num2 + 1):\n if num2 % i == 0:\n list2.append(i)\n\nlist3 = list(set(list1) & set(list2))\nlist3.sort()\nlist3.reverse()\n\nprint(list3[max -1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551645949", "date2": "1551646875", "bleu_score": "0.9505403521327541", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "27 18 1\n", "actual_output": "1\n", "expected_output": "9\n\n", "anno_code": ["a = list(map(int, input().split())) # (0): a=[27, 18, 1]\nnum1 = a[0] # (1): num1=27\nnum2 = a[1] # (2): num2=18\nlist1 = [] # (3): list1=[]\nlist2 = [] # (4): list2=[]\nmax = a[2] # (5): max=1\nfor i in range(1, num1 + 1): # (6): i=1 (9): i=2 ... (64): NO CHANGE\n if num1 % i == 0: # (7): NO CHANGE (10): NO CHANGE ... (62): NO CHANGE\n list1.append(i) # (8): list1=[1] (13): list1=[1, 3] ... (63): list1=[1, 3, 9, 27]\n \nfor i in range(1, num2 + 1): # (65): i=1 (68): i=2 ... (107): NO CHANGE\n if num2 % i == 0: # (66): NO CHANGE (69): NO CHANGE ... (105): NO CHANGE\n list2.append(i) # (67): list2=[1] (70): list2=[1, 2] ... (106): list2=[1, 2, 3, 6, 9, 18]\n\nlist3 = list(set(list1) & set(list2)) # (108): list3=[1, 3, 9]\nlist3.sort() # (109): NO CHANGE\n\nprint(list3[max -1])"], "anno_status": [true], "diff_content": " a = list(map(int, input().split()))\n num1 = a[0]\n num2 = a[1]\n list1 = []\n list2 = []\n max = a[2]\n for i in range(1, num1 + 1):\n if num1 % i == 0:\n list1.append(i)\n \n for i in range(1, num2 + 1):\n if num2 % i == 0:\n list2.append(i)\n \n list3 = list(set(list1) & set(list2))\n list3.sort()\n+list3.reverse()\n \n print(list3[max -1])\n", "FL_content": " a = list(map(int, input().split()))\n num1 = a[0]\n num2 = a[1]\n list1 = []\n list2 = []\n max = a[2]\n for i in range(1, num1 + 1):\n if num1 % i == 0:\n list1.append(i)\n \n for i in range(1, num2 + 1):\n if num2 % i == 0:\n list2.append(i)\n \n list3 = list(set(list1) & set(list2))\n list3.sort()\n \n print(list3[max -1])\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u874333466", "problem_id": "p03106", "submission1_id": "s151490277", "submission2_id": "s460790491", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, K = map(int,input().split())\n\ncount = 0\n\nfor i in range(1, min(A, B) + 1, 1):\n if A % i and B % i:\n count += 1\n \n if count == K:\n print(i)", "code2": "A, B, K = map(int,input().split())\n\ncount = []\n\nfor i in range(1, min(A, B) + 1, 1):\n if (A % i == 0) and (B % i == 0):\n count.append(i)\n\ncount.sort(reverse = True)\nprint(count[K - 1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590913645", "date2": "1590913853", "bleu_score": "0.6478101468389234", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "100 70 3\n", "actual_output": "8\n", "expected_output": "2\n\n", "anno_code": ["A, B, K = map(int,input().split()) # (0): A=100, B=70, K=3\n\ncount = 0 # (1): count=0\n\nfor i in range(1, min(A, B) + 1, 1): # (2): i=1 (5): i=2 ... (268): i=70\n if A % i and B % i: # (3): NO CHANGE (6): NO CHANGE ... (269): NO CHANGE\n count += 1 # (10): count=1 (20): count=2 ... (266): count=58\n \n if count == K: # (4): NO CHANGE (7): NO CHANGE ... (270): NO CHANGE\n print(i) # (29): NO CHANGE\n"], "anno_status": [true], "diff_content": " A, B, K = map(int,input().split())\n \n-count = 0\n+count = []\n \n for i in range(1, min(A, B) + 1, 1):\n- if A % i and B % i:\n- count += 1\n- \n- if count == K:\n- print(i)\n+ if (A % i == 0) and (B % i == 0):\n+ count.append(i)\n+\n+count.sort(reverse = True)\n+print(count[K - 1])\n", "FL_content": " A, B, K = map(int,input().split())\n \n-count = 0\n \n for i in range(1, min(A, B) + 1, 1):\n- if A % i and B % i:\n- count += 1\n- \n- if count == K:\n- print(i)\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 10 }, { "user_id": "u464205401", "problem_id": "p03106", "submission1_id": "s325177849", "submission2_id": "s773396526", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,k=list(map(int,input().split()))\ncnt=1\nfor i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n if cnt==k:\n print(i)\n break\n cnt+=1", "code2": "a,b,k=list(map(int,input().split()))\nans=[]\nfor i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n ans.append(i)\nprint(ans[-k])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586601739", "date2": "1586602030", "bleu_score": "0.6810555458236673", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "27 12 2\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["a,b,k=list(map(int,input().split())) # (0): a=27, b=12, k=2\ncnt=1 # (1): cnt=1\nfor i in range(1,min(a,b)+1): # (2): i=1 (6): i=2 (8): i=3\n if a%i==0 and b%i==0: # (3): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n if cnt==k: # (4): NO CHANGE (10): NO CHANGE\n print(i) # (11): NO CHANGE\n break\n cnt+=1 # (5): cnt=2\n"], "anno_status": [true], "diff_content": " a,b,k=list(map(int,input().split()))\n-cnt=1\n+ans=[]\n for i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n- if cnt==k:\n- print(i)\n- break\n- cnt+=1\n+ ans.append(i)\n+print(ans[-k])\n", "FL_content": " a,b,k=list(map(int,input().split()))\n-cnt=1\n for i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n- if cnt==k:\n- print(i)\n- break\n- cnt+=1\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 8 }, { "user_id": "u687766076", "problem_id": "p03106", "submission1_id": "s312222115", "submission2_id": "s795559849", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\na, b, k = map(int, sys.stdin.readline().split())\nm = min(a, b)+1\ncnt = 0\nfor i in range(1, m):\n if a % i == 0 and b % i == 0:\n cnt += 1\n if cnt == k:\n print(i)\n break\n", "code2": "import sys\n\na, b, k = map(int, sys.stdin.readline().split())\nm = min(a, b) + 1\nanslist = []\ncnt = 0\nfor i in range(1, m):\n if a % i == 0 and b % i == 0:\n anslist.append(i)\nanslist.reverse()\nprint(anslist[k-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551683936", "date2": "1551684273", "bleu_score": "0.7211882531217275", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "27 21 1\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["import sys\n\na, b, k = map(int, sys.stdin.readline().split()) # (0): a=27, b=21, k=1\nm = min(a, b)+1 # (1): m=22\ncnt = 0 # (2): cnt=0\nfor i in range(1, m): # (3): i=1\n if a % i == 0 and b % i == 0: # (4): NO CHANGE\n cnt += 1 # (5): cnt=1\n if cnt == k: # (6): NO CHANGE\n print(i) # (7): NO CHANGE\n break\n"], "anno_status": [true], "diff_content": " import sys\n \n a, b, k = map(int, sys.stdin.readline().split())\n-m = min(a, b)+1\n+m = min(a, b) + 1\n+anslist = []\n cnt = 0\n for i in range(1, m):\n if a % i == 0 and b % i == 0:\n- cnt += 1\n- if cnt == k:\n- print(i)\n- break\n+ anslist.append(i)\n+anslist.reverse()\n+print(anslist[k-1])\n \n", "FL_content": " import sys\n \n a, b, k = map(int, sys.stdin.readline().split())\n-m = min(a, b)+1\n cnt = 0\n for i in range(1, m):\n if a % i == 0 and b % i == 0:\n- cnt += 1\n- if cnt == k:\n- print(i)\n- break\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u979362546", "problem_id": "p03106", "submission1_id": "s745267567", "submission2_id": "s626893927", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, k = map(int, input().split())\nda = []\ndb = []\ndc = []\nfor i in range(1,a+1):\n if a%i == 0:\n \tda.append(i)\n\nfor j in range(1, b+1):\n if b%j == 0:\n \tdb.append(j)", "code2": "a, b, k = map(int, input().split())\nda = []\ndb = []\ndc = []\nfor i in range(1,a+1):\n if a%i == 0:\n \tda.append(i)\n\nfor j in range(1, b+1):\n if b%j == 0:\n \tdb.append(j)\n\nfor l in da:\n if l in db:\n \tdc.append(l)\n\ndc.sort(reverse = True)\nprint(dc[k-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556208863", "date2": "1556209543", "bleu_score": "0.6635085312544982", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "72 63 2\n", "actual_output": "", "expected_output": "3\n\n", "anno_code": ["a, b, k = map(int, input().split()) # (0): a=72, b=63, k=2\nda = [] # (1): da=[]\ndb = [] # (2): db=[]\ndc = [] # (3): dc=[]\nfor i in range(1,a+1): # (4): i=1 (7): i=2 ... (160): NO CHANGE\n if a%i == 0: # (5): NO CHANGE (8): NO CHANGE ... (158): NO CHANGE\n \tda.append(i) # (6): da=[1] (9): da=[1, 2] ... (159): da=[1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72]\n\nfor j in range(1, b+1): # (161): j=1 (164): j=2 ... (290): j=63\n if b%j == 0: # (162): NO CHANGE (165): NO CHANGE ... (291): NO CHANGE\n \tdb.append(j) # (163): db=[1] (168): db=[1, 3] ... (292): db=[1, 3, 7, 9, 21, 63]\n"], "anno_status": [true], "diff_content": " a, b, k = map(int, input().split())\n da = []\n db = []\n dc = []\n for i in range(1,a+1):\n if a%i == 0:\n \tda.append(i)\n \n for j in range(1, b+1):\n if b%j == 0:\n \tdb.append(j)\n+\n+for l in da:\n+ if l in db:\n+ \tdc.append(l)\n+\n+dc.sort(reverse = True)\n+print(dc[k-1])\n+\n", "FL_content": " a, b, k = map(int, input().split())\n da = []\n db = []\n dc = []\n for i in range(1,a+1):\n if a%i == 0:\n \tda.append(i)\n \n for j in range(1, b+1):\n if b%j == 0:\n \tdb.append(j)\n", "added_lines": 8, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u533232830", "problem_id": "p03106", "submission1_id": "s986368588", "submission2_id": "s300766503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, k = map(int, input().split())\nl = []\n\nfor i in range((min(a,b))):\n if a%(i+1)==0 and b%(i+1)==0:\n l.append(i+1)\n\nprint(l[k-1])", "code2": "a, b, k = map(int, input().split())\nl = []\n\nfor i in range((min(a,b))):\n if a%(i+1)==0 and b%(i+1)==0:\n l.append(i+1)\nl.sort(reverse=True)\nprint(l[k-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562691894", "date2": "1562692009", "bleu_score": "0.8659525477718015", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "100 50 5\n", "actual_output": "25\n", "expected_output": "2\n\n", "anno_code": ["a, b, k = map(int, input().split()) # (0): a=100, b=50, k=5\nl = [] # (1): l=[]\n\nfor i in range((min(a,b))): # (2): i=0 (5): i=1 ... (108): NO CHANGE\n if a%(i+1)==0 and b%(i+1)==0: # (3): NO CHANGE (6): NO CHANGE ... (106): NO CHANGE\n l.append(i+1) # (4): l=[1] (7): l=[1, 2] ... (107): l=[1, 2, 5, 10, 25, 50]\n\nprint(l[k-1])"], "anno_status": [true], "diff_content": " a, b, k = map(int, input().split())\n l = []\n \n for i in range((min(a,b))):\n if a%(i+1)==0 and b%(i+1)==0:\n l.append(i+1)\n-\n+l.sort(reverse=True)\n print(l[k-1])\n", "FL_content": " a, b, k = map(int, input().split())\n l = []\n \n for i in range((min(a,b))):\n if a%(i+1)==0 and b%(i+1)==0:\n l.append(i+1)\n-\n print(l[k-1])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u405660020", "problem_id": "p03106", "submission1_id": "s145938385", "submission2_id": "s452156481", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,k=map(int,input().split())\nnumlst=[]\nfor i in range(max(a,b)):\n if a%(i+1)==0 and b%(i+1)==0:\n numlst.append(i+1)\nprint(numlst)\nprint(numlst[len(numlst)-k])", "code2": "a,b,k=map(int,input().split())\nnumlst=[]\nfor i in range(max(a,b)):\n if a%(i+1)==0 and b%(i+1)==0:\n numlst.append(i+1)\n\nprint(numlst[len(numlst)-k])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555942910", "date2": "1555942929", "bleu_score": "0.9115806022480645", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "33 26 1\n", "actual_output": "[1]\n1\n", "expected_output": "1\n\n", "anno_code": ["a,b,k=map(int,input().split()) # (0): a=33, b=26, k=1\nnumlst=[] # (1): numlst=[]\nfor i in range(max(a,b)): # (2): i=0 (5): i=1 ... (69): NO CHANGE\n if a%(i+1)==0 and b%(i+1)==0: # (3): NO CHANGE (6): NO CHANGE ... (68): NO CHANGE\n numlst.append(i+1) # (4): numlst=[1]\nprint(numlst) # (70): NO CHANGE\nprint(numlst[len(numlst)-k])"], "anno_status": [true], "diff_content": " a,b,k=map(int,input().split())\n numlst=[]\n for i in range(max(a,b)):\n if a%(i+1)==0 and b%(i+1)==0:\n numlst.append(i+1)\n-print(numlst)\n+\n print(numlst[len(numlst)-k])\n", "FL_content": " a,b,k=map(int,input().split())\n numlst=[]\n for i in range(max(a,b)):\n if a%(i+1)==0 and b%(i+1)==0:\n numlst.append(i+1)\n-print(numlst)\n print(numlst[len(numlst)-k])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u094565093", "problem_id": "p03106", "submission1_id": "s473237710", "submission2_id": "s244438548", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, K=map(int, input().split())\nif A>B:\n tmp=A\n A=B\n B=tmp\ncount=0\nfor i in range(1,A+1):\n if A%i ==0 & B%i==0:\n count+=1\n if count ==K:\n break\nprint(i)", "code2": "A, B, K=map(int, input().split())\nif A>B:\n tmp=A\n A=B\n B=tmp\ncount=0\nfor i in range(A, 0, -1):\n if A%i ==0 and B%i==0:\n count+=1\n if count ==K:\n break\nprint(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566020349", "date2": "1566021708", "bleu_score": "0.9327395545637935", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "27 72 1\n", "actual_output": "1\n", "expected_output": "9\n\n", "anno_code": ["A, B, K=map(int, input().split()) # (0): A=27, B=72, K=1\nif A>B: # (1): NO CHANGE\n tmp=A\n A=B\n B=tmp\ncount=0 # (2): count=0\nfor i in range(1,A+1): # (3): i=1\n if A%i ==0 & B%i==0: # (4): NO CHANGE\n count+=1 # (5): count=1\n if count ==K: # (6): NO CHANGE\n break # (7): NO CHANGE\nprint(i)"], "anno_status": [true], "diff_content": " A, B, K=map(int, input().split())\n if A>B:\n tmp=A\n A=B\n B=tmp\n count=0\n-for i in range(1,A+1):\n- if A%i ==0 & B%i==0:\n+for i in range(A, 0, -1):\n+ if A%i ==0 and B%i==0:\n count+=1\n if count ==K:\n break\n print(i)\n", "FL_content": " A, B, K=map(int, input().split())\n if A>B:\n tmp=A\n A=B\n B=tmp\n count=0\n-for i in range(1,A+1):\n- if A%i ==0 & B%i==0:\n count+=1\n if count ==K:\n break\n print(i)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u765590009", "problem_id": "p03106", "submission1_id": "s816907901", "submission2_id": "s030494864", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, n = map(int, input().split())\n \nnum = min(a, b)\nanswer = []\nfor i in range(1, num+1):\n if (a % i == 0 and b % i == 0):\n answer.append(i)\n \nprint(answer[n-1])", "code2": "a, b, k = map(int, input().split())\n \nnum = min(a, b)\nanswer = []\nfor i in range(1, num+1):\n if (a % i == 0 and b % i == 0):\n answer.append(i)\n \nprint(answer[-k])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560870322", "date2": "1560870414", "bleu_score": "0.9634483229977792", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "19 114 1\n", "actual_output": "1\n", "expected_output": "19\n\n", "anno_code": ["a, b, n = map(int, input().split()) # (0): a=19, b=114, n=1\n \nnum = min(a, b) # (1): num=19\nanswer = [] # (2): answer=[]\nfor i in range(1, num+1): # (3): i=1 (6): i=2 ... (43): NO CHANGE\n if (a % i == 0 and b % i == 0): # (4): NO CHANGE (7): NO CHANGE ... (41): NO CHANGE\n answer.append(i) # (5): answer=[1] (42): answer=[1, 19]\n \nprint(answer[n-1])"], "anno_status": [true], "diff_content": "-a, b, n = map(int, input().split())\n+a, b, k = map(int, input().split())\n \n num = min(a, b)\n answer = []\n for i in range(1, num+1):\n if (a % i == 0 and b % i == 0):\n answer.append(i)\n \n-print(answer[n-1])\n+print(answer[-k])\n", "FL_content": "-a, b, n = map(int, input().split())\n \n num = min(a, b)\n answer = []\n for i in range(1, num+1):\n if (a % i == 0 and b % i == 0):\n answer.append(i)\n \n-print(answer[n-1])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u310678820", "problem_id": "p03106", "submission1_id": "s071497750", "submission2_id": "s004294569", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,k=map(int, input().split())\ncnt=1\nfor i in range(1,max(a,b)+1):\n if a%i==0 and b%i==0:\n cnt+=1\n if cnt==k:\n print(i)", "code2": "a,b,k=map(int, input().split())\ncnt=0\nfor i in range(min(a,b)+1,0,-1):\n if a%i==0 and b%i==0:\n cnt+=1\n if cnt==k:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551646626", "date2": "1551647388", "bleu_score": "0.920759541477047", "code1_test_status": [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, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 15, "total_score": 97, "input": "16 12 2\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["a,b,k=map(int, input().split()) # (0): a=16, b=12, k=2\ncnt=1 # (1): cnt=1\nfor i in range(1,max(a,b)+1): # (2): i=1 (7): i=2 ... (39): i=16\n if a%i==0 and b%i==0: # (3): NO CHANGE (8): NO CHANGE ... (40): NO CHANGE\n cnt+=1 # (4): cnt=2 (9): cnt=3 (15): cnt=4\n if cnt==k: # (5): NO CHANGE (10): NO CHANGE (16): NO CHANGE\n print(i) # (6): NO CHANGE\n"], "anno_status": [true], "diff_content": " a,b,k=map(int, input().split())\n-cnt=1\n-for i in range(1,max(a,b)+1):\n+cnt=0\n+for i in range(min(a,b)+1,0,-1):\n if a%i==0 and b%i==0:\n cnt+=1\n if cnt==k:\n print(i)\n", "FL_content": " a,b,k=map(int, input().split())\n-cnt=1\n-for i in range(1,max(a,b)+1):\n if a%i==0 and b%i==0:\n cnt+=1\n if cnt==k:\n print(i)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u382176416", "problem_id": "p03106", "submission1_id": "s130636296", "submission2_id": "s147122612", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, k = map(int, input().split())\n\nn = 0\ncd_list = []\n\nif a < b:\n n = a\nelse:\n n = b\n\ni = 1\n\nwhile i <= n:\n if a % i == 0 and b % i == 0:\n cd_list.append(i)\n i += 1\n\nprint(cd_list[k-1])\n ", "code2": "a, b, k = map(int, input().split())\n\nn = 0\nif a < b:\n n = a\nelse:\n n = b\n\ncd_list = []\ni = 1\nwhile i <= n:\n if a % i == 0 and b % i == 0:\n cd_list.append(i)\n i += 1\n\ncd_list.reverse()\nprint(cd_list[k-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557221782", "date2": "1557222111", "bleu_score": "0.8970037511560469", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "100 44 3\n", "actual_output": "4\n", "expected_output": "1\n\n", "anno_code": ["a, b, k = map(int, input().split()) # (0): a=100, b=44, k=3\n\nn = 0 # (1): n=0\ncd_list = [] # (2): cd_list=[]\n\nif a < b: # (3): NO CHANGE\n n = a\nelse:\n n = b # (4): n=44\n\ni = 1 # (5): i=1\n\nwhile i <= n: # (6): NO CHANGE (10): NO CHANGE ... (141): NO CHANGE\n if a % i == 0 and b % i == 0: # (7): NO CHANGE (11): NO CHANGE ... (139): NO CHANGE\n cd_list.append(i) # (8): cd_list=[1] (12): cd_list=[1, 2] (19): cd_list=[1, 2, 4]\n i += 1 # (9): i=2 (13): i=3 ... (140): i=45\n\nprint(cd_list[k-1])\n "], "anno_status": [true], "diff_content": " a, b, k = map(int, input().split())\n \n n = 0\n-cd_list = []\n-\n if a < b:\n n = a\n else:\n n = b\n \n+cd_list = []\n i = 1\n-\n while i <= n:\n if a % i == 0 and b % i == 0:\n cd_list.append(i)\n i += 1\n \n+cd_list.reverse()\n print(cd_list[k-1])\n- \n+\n", "FL_content": " a, b, k = map(int, input().split())\n \n n = 0\n-cd_list = []\n-\n if a < b:\n n = a\n else:\n n = b\n \n i = 1\n-\n while i <= n:\n if a % i == 0 and b % i == 0:\n cd_list.append(i)\n i += 1\n \n print(cd_list[k-1])\n- \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 19 }, { "user_id": "u944209426", "problem_id": "p03106", "submission1_id": "s335297490", "submission2_id": "s336716038", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,k=map(int,input().split())\nres=[]\nfor i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n res.append(i)\nprint(res[k-1])", "code2": "a,b,k=map(int,input().split())\nres=[]\nfor i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n res.append(i)\nprint(res[-k])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1551644956", "date2": "1551645042", "bleu_score": "0.9709184601020456", "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, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 37, "total_score": 97, "input": "4 8 1\n", "actual_output": "1\n", "expected_output": "4\n\n", "anno_code": ["a,b,k=map(int,input().split()) # (0): a=4, b=8, k=1\nres=[] # (1): res=[]\nfor i in range(1,min(a,b)+1): # (2): i=1 (5): i=2 ... (13): NO CHANGE\n if a%i==0 and b%i==0: # (3): NO CHANGE (6): NO CHANGE ... (11): NO CHANGE\n res.append(i) # (4): res=[1] (7): res=[1, 2] (12): res=[1, 2, 4]\nprint(res[k-1])"], "anno_status": [true], "diff_content": " a,b,k=map(int,input().split())\n res=[]\n for i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n res.append(i)\n-print(res[k-1])\n+print(res[-k])\n", "FL_content": " a,b,k=map(int,input().split())\n res=[]\n for i in range(1,min(a,b)+1):\n if a%i==0 and b%i==0:\n res.append(i)\n-print(res[k-1])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u163320134", "problem_id": "p03546", "submission1_id": "s945543506", "submission2_id": "s702809948", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\nd=[list(map(int,input().split())) for _ in range(10)]\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n d[i][j]=min(d[i][j],d[i][k]+d[k][j])\nans=0\nfor _ in range(h):\n arr=list(map(int,input().split()))\n for i in range(w):\n if arr[i]==-1:\n continue\n elif arr[i]==1:\n continue\n else:\n ans+=d[arr[i]][1]\nprint(ans)", "code2": "h,w=map(int,input().split())\nd=[list(map(int,input().split())) for _ in range(10)]\nfor k in range(10):\n for i in range(10):\n for j in range(10):\n d[i][j]=min(d[i][j],d[i][k]+d[k][j])\nans=0\nfor _ in range(h):\n arr=list(map(int,input().split()))\n for i in arr:\n if abs(i)!=1:\n ans+=d[i][1]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560716327", "date2": "1560716917", "bleu_score": "0.7731652752590337", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 1 7 6 7\n9 8 5 2 2 0 2 7 6 10\n5 4 6 3 2 3 0 5 1 0\n3 6 0 0 4 2 4 0 11 9\n4 6 5 5 3 5 3 2 0 8\n3 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 4 2 1\n8 9 2 6 6\n", "actual_output": "14\n", "expected_output": "10\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=3, w=5\nd=[list(map(int,input().split())) for _ in range(10)] # (1): d\nfor i in range(10): # (2): i=0 (224): i=1 ... (2222): NO CHANGE\n for j in range(10): # (3): j=0 (25): j=1 ... (2221): NO CHANGE\n for k in range(10): # (4): k=0 (6): k=1 ... (2220): NO CHANGE\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]) # (5): NO CHANGE (7): NO CHANGE ... (2219): NO CHANGE\nans=0 # (2223): ans=0\nfor _ in range(h): # (2224): _=0 (2246): _=1 ... (2292): NO CHANGE\n arr=list(map(int,input().split())) # (2225): arr=[-1, 5, 2, 6, 1] (2247): arr=[2, 5, 4, 2, 1] (2270): arr=[8, 9, 2, 6, 6]\n for i in range(w): # (2226): i=0 (2229): i=1 ... (2291): NO CHANGE\n if arr[i]==-1: # (2227): NO CHANGE (2230): NO CHANGE ... (2288): NO CHANGE\n continue # (2228): NO CHANGE\n elif arr[i]==1: # (2231): NO CHANGE (2235): NO CHANGE ... (2289): NO CHANGE\n continue # (2244): NO CHANGE (2267): NO CHANGE\n else:\n ans+=d[arr[i]][1] # (2232): ans=2 (2236): ans=3 ... (2290): ans=14\nprint(ans)"], "anno_status": [false], "diff_content": " h,w=map(int,input().split())\n d=[list(map(int,input().split())) for _ in range(10)]\n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n+for k in range(10):\n+ for i in range(10):\n+ for j in range(10):\n d[i][j]=min(d[i][j],d[i][k]+d[k][j])\n ans=0\n for _ in range(h):\n arr=list(map(int,input().split()))\n- for i in range(w):\n- if arr[i]==-1:\n- continue\n- elif arr[i]==1:\n- continue\n- else:\n- ans+=d[arr[i]][1]\n+ for i in arr:\n+ if abs(i)!=1:\n+ ans+=d[i][1]\n print(ans)\n", "FL_content": " h,w=map(int,input().split())\n d=[list(map(int,input().split())) for _ in range(10)]\n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n d[i][j]=min(d[i][j],d[i][k]+d[k][j])\n ans=0\n for _ in range(h):\n arr=list(map(int,input().split()))\n- for i in range(w):\n- if arr[i]==-1:\n- continue\n- elif arr[i]==1:\n- continue\n- else:\n- ans+=d[arr[i]][1]\n print(ans)\n", "added_lines": 6, "removed_lines": 10, "code1_lines": 17 }, { "user_id": "u727787724", "problem_id": "p03546", "submission1_id": "s515761398", "submission2_id": "s837623957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\nc=[]\nfor i in range(10):\n\tc.append(list(map(int,input().split())))\na=[]\nans=0\nfor i in range(h):\n\ta.append(list(map(int,input().split())))\nfor i in range(10):\n\tfor j in range(10):\n\t\tfor k in range(10):\n\t\t\tc[i][j]=min(c[i][j],c[i][k]+c[k][j])\nfor j in range(h):\n\tfor k in range(w):\n\t\tif a[j][k]==-1 or a[j][k]==1:\n\t\t\tcontinue\n\t\telse:\n\t\t\tans+=c[a[j][k]][1]\nprint(ans)\n\t\t\t\t\t", "code2": "h,w=map(int,input().split())\nc=[]\nfor i in range(10):\n\tc.append(list(map(int,input().split())))\na=[]\nans=0\nfor i in range(h):\n\ta.append(list(map(int,input().split())))\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n c[j][k]=min(c[j][k],c[j][i]+c[i][k])\nfor j in range(h):\n\tfor k in range(w):\n\t\tif a[j][k]==-1:\n\t\t\tcontinue\n\t\telse:\n\t\t\tans+=c[a[j][k]][1]\nprint(ans)\n\t\t\t\t\t\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577114858", "date2": "1577115798", "bleu_score": "0.9076744260128565", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 1 7 6 7\n9 8 5 2 2 0 2 7 6 10\n5 4 6 3 2 3 0 5 1 3\n3 6 2 0 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n3 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 4 2 1\n8 9 2 6 6\n", "actual_output": "17\n", "expected_output": "13\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=3, w=5\nc=[] # (1): c=[]\nfor i in range(10): # (2): i=0 (4): i=1 ... (22): NO CHANGE\n\tc.append(list(map(int,input().split()))) # (3): c (5): c ... (21): c\na=[] # (23): a=[]\nans=0 # (24): ans=0\nfor i in range(h): # (25): i=0 (27): i=1 ... (31): NO CHANGE\n\ta.append(list(map(int,input().split()))) # (26): a=[[-1, 5, 2, 6, 1]] (28): a (30): a\nfor i in range(10): # (32): i=0 (254): i=1 ... (2252): NO CHANGE\n\tfor j in range(10): # (33): j=0 (55): j=1 ... (2251): NO CHANGE\n\t\tfor k in range(10): # (34): k=0 (36): k=1 ... (2250): NO CHANGE\n\t\t\tc[i][j]=min(c[i][j],c[i][k]+c[k][j]) # (35): NO CHANGE (37): NO CHANGE ... (2249): NO CHANGE\nfor j in range(h): # (2253): j=0 (2270): j=1 ... (2304): NO CHANGE\n\tfor k in range(w): # (2254): k=0 (2257): k=1 ... (2303): NO CHANGE\n\t\tif a[j][k]==-1 or a[j][k]==1: # (2255): NO CHANGE (2258): NO CHANGE ... (2301): NO CHANGE\n\t\t\tcontinue # (2256): NO CHANGE (2268): NO CHANGE (2285): NO CHANGE\n\t\telse:\n\t\t\tans+=c[a[j][k]][1] # (2259): ans=2 (2262): ans=3 ... (2302): ans=17\nprint(ans)\n\t\t\t\t\t"], "anno_status": [false], "diff_content": " h,w=map(int,input().split())\n c=[]\n for i in range(10):\n \tc.append(list(map(int,input().split())))\n a=[]\n ans=0\n for i in range(h):\n \ta.append(list(map(int,input().split())))\n for i in range(10):\n-\tfor j in range(10):\n-\t\tfor k in range(10):\n-\t\t\tc[i][j]=min(c[i][j],c[i][k]+c[k][j])\n+ for j in range(10):\n+ for k in range(10):\n+ c[j][k]=min(c[j][k],c[j][i]+c[i][k])\n for j in range(h):\n \tfor k in range(w):\n-\t\tif a[j][k]==-1 or a[j][k]==1:\n+\t\tif a[j][k]==-1:\n \t\t\tcontinue\n \t\telse:\n \t\t\tans+=c[a[j][k]][1]\n print(ans)\n \t\t\t\t\t\n+\n", "FL_content": " h,w=map(int,input().split())\n c=[]\n for i in range(10):\n \tc.append(list(map(int,input().split())))\n a=[]\n ans=0\n for i in range(h):\n \ta.append(list(map(int,input().split())))\n for i in range(10):\n-\tfor j in range(10):\n-\t\tfor k in range(10):\n-\t\t\tc[i][j]=min(c[i][j],c[i][k]+c[k][j])\n for j in range(h):\n \tfor k in range(w):\n-\t\tif a[j][k]==-1 or a[j][k]==1:\n \t\t\tcontinue\n \t\telse:\n \t\t\tans+=c[a[j][k]][1]\n print(ans)\n \t\t\t\t\t\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 20 }, { "user_id": "u620480037", "problem_id": "p03546", "submission1_id": "s744104540", "submission2_id": "s901397602", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W=map(int,input().split())\n\nA=[]\nfor i in range(10):\n B=list(map(int,input().split()))\n A.append(B)\n\n\nfor a in range(10):\n for b in range(10):\n for c in range(10):\n A[a][b]=min(A[a][b],A[a][c]+A[c][b])\n\nans=0\nD=[]\nfor j in range(H):\n C=list(map(int,input().split()))\n D.append(C)\n \nfor k in range(H):\n for l in range(W):\n if D[k][l]!=(-1):\n ans+=A[D[k][l]][1]\nprint(ans)", "code2": "H,W=map(int,input().split())\n\nA = [list(map(int, input().split())) for _ in range(10)]\n\nfor a in range(10):\n for b in range(10):\n for c in range(10):\n A[b][c]=min(A[b][c],A[b][a]+A[a][c])\n\nans=0\nD=[]\nfor j in range(H):\n C=list(map(int,input().split()))\n D.append(C)\n \nfor k in range(H):\n for l in range(W):\n if D[k][l]!=(-1) and D[k][l]!=(1):\n ans+=A[D[k][l]][1]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535601923", "date2": "1535602750", "bleu_score": "0.8977898011737805", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n0 4 6 3 2 3 0 5 2 3\n3 6 2 0 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n3 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 3 2 1\n6 9 2 6 6\n", "actual_output": "13\n", "expected_output": "9\n\n", "anno_code": ["H,W=map(int,input().split()) # (0): H=3, W=5\n\nA=[] # (1): A=[]\nfor i in range(10): # (2): i=0 (5): i=1 ... (32): NO CHANGE\n B=list(map(int,input().split())) # (3): B=[0, 4, 3, 6, 2, 7, 2, 5, 3, 0] (6): B=[4, 0, 5, 3, 12, 5, 3, 7, 2, 11] ... (30): B=[3, 1, 3, 4, 5, 7, 8, 6, 4, 0]\n A.append(B) # (4): A (7): A ... (31): A\n\n\nfor a in range(10): # (33): a=0 (255): a=1 ... (2253): NO CHANGE\n for b in range(10): # (34): b=0 (56): b=1 ... (2252): NO CHANGE\n for c in range(10): # (35): c=0 (37): c=1 ... (2251): NO CHANGE\n A[a][b]=min(A[a][b],A[a][c]+A[c][b]) # (36): NO CHANGE (38): NO CHANGE ... (2250): NO CHANGE\n\nans=0 # (2254): ans=0\nD=[] # (2255): D=[]\nfor j in range(H): # (2256): j=0 (2259): j=1 ... (2265): NO CHANGE\n C=list(map(int,input().split())) # (2257): C=[-1, 5, 2, 6, 1] (2260): C=[2, 5, 3, 2, 1] (2263): C=[6, 9, 2, 6, 6]\n D.append(C) # (2258): D=[[-1, 5, 2, 6, 1]] (2261): D (2264): D\n \nfor k in range(H): # (2266): k=0 (2282): k=1 ... (2316): NO CHANGE\n for l in range(W): # (2267): l=0 (2269): l=1 ... (2315): NO CHANGE\n if D[k][l]!=(-1): # (2268): NO CHANGE (2270): NO CHANGE ... (2313): NO CHANGE\n ans+=A[D[k][l]][1] # (2271): ans=2 (2274): ans=3 ... (2314): ans=13\nprint(ans)"], "anno_status": [false], "diff_content": " H,W=map(int,input().split())\n \n-A=[]\n-for i in range(10):\n- B=list(map(int,input().split()))\n- A.append(B)\n-\n+A = [list(map(int, input().split())) for _ in range(10)]\n \n for a in range(10):\n for b in range(10):\n for c in range(10):\n- A[a][b]=min(A[a][b],A[a][c]+A[c][b])\n+ A[b][c]=min(A[b][c],A[b][a]+A[a][c])\n \n ans=0\n D=[]\n for j in range(H):\n C=list(map(int,input().split()))\n D.append(C)\n \n for k in range(H):\n for l in range(W):\n- if D[k][l]!=(-1):\n+ if D[k][l]!=(-1) and D[k][l]!=(1):\n ans+=A[D[k][l]][1]\n print(ans)\n", "FL_content": " H,W=map(int,input().split())\n \n-A=[]\n-for i in range(10):\n- B=list(map(int,input().split()))\n- A.append(B)\n-\n \n for a in range(10):\n for b in range(10):\n for c in range(10):\n- A[a][b]=min(A[a][b],A[a][c]+A[c][b])\n \n ans=0\n D=[]\n for j in range(H):\n C=list(map(int,input().split()))\n D.append(C)\n \n for k in range(H):\n for l in range(W):\n- if D[k][l]!=(-1):\n ans+=A[D[k][l]][1]\n print(ans)\n", "added_lines": 3, "removed_lines": 7, "code1_lines": 24 }, { "user_id": "u789417951", "problem_id": "p03546", "submission1_id": "s279573062", "submission2_id": "s030215671", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W=map(int,input().split())\nc=[list(map(int,input().split())) for _ in range(10)]\na=[list(map(int,input().split())) for _ in range(H)]\nans=0\n\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n c[i][j]=min(c[i][j],c[i][k]+c[k][j])\n\nfor i in range(H):\n for j in range(W):\n if a[i][j]>=0:\n ans += c[a[i][j]][1]\n\nprint(ans)", "code2": "H, W=map(int,input().split())\nc=[list(map(int,input().split())) for _ in range(10)]\na=[list(map(int,input().split())) for _ in range(H)]\nans=0\n\nfor k in range(10):\n for i in range(10):\n for j in range(10):\n c[i][j]=min(c[i][j],c[i][k]+c[k][j])\n\nfor i in range(H):\n for j in range(W):\n if a[i][j]>=0:\n ans += c[a[i][j]][1]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514519748", "date2": "1514519843", "bleu_score": "1.0", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 0 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 3 2 1\n6 9 2 6 6\n", "actual_output": "17\n", "expected_output": "13\n\n", "anno_code": ["H, W=map(int,input().split()) # (0): H=3, W=5\nc=[list(map(int,input().split())) for _ in range(10)] # (1): c\na=[list(map(int,input().split())) for _ in range(H)] # (2): a\nans=0 # (3): ans=0\n\nfor i in range(10): # (4): i=0 (226): i=1 ... (2224): NO CHANGE\n for j in range(10): # (5): j=0 (27): j=1 ... (2223): NO CHANGE\n for k in range(10): # (6): k=0 (8): k=1 ... (2222): NO CHANGE\n c[i][j]=min(c[i][j],c[i][k]+c[k][j]) # (7): NO CHANGE (9): NO CHANGE ... (2221): NO CHANGE\n\nfor i in range(H): # (2225): i=0 (2241): i=1 ... (2275): NO CHANGE\n for j in range(W): # (2226): j=0 (2228): j=1 ... (2274): NO CHANGE\n if a[i][j]>=0: # (2227): NO CHANGE (2229): NO CHANGE ... (2272): NO CHANGE\n ans += c[a[i][j]][1] # (2230): ans=2 (2233): ans=3 ... (2273): ans=17\n\nprint(ans)"], "anno_status": [false], "diff_content": " H, W=map(int,input().split())\n c=[list(map(int,input().split())) for _ in range(10)]\n a=[list(map(int,input().split())) for _ in range(H)]\n ans=0\n \n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n+for k in range(10):\n+ for i in range(10):\n+ for j in range(10):\n c[i][j]=min(c[i][j],c[i][k]+c[k][j])\n \n for i in range(H):\n for j in range(W):\n if a[i][j]>=0:\n ans += c[a[i][j]][1]\n \n print(ans)\n", "FL_content": " H, W=map(int,input().split())\n c=[list(map(int,input().split())) for _ in range(10)]\n a=[list(map(int,input().split())) for _ in range(H)]\n ans=0\n \n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n c[i][j]=min(c[i][j],c[i][k]+c[k][j])\n \n for i in range(H):\n for j in range(W):\n if a[i][j]>=0:\n ans += c[a[i][j]][1]\n \n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 16 }, { "user_id": "u427344224", "problem_id": "p03546", "submission1_id": "s160448245", "submission2_id": "s306179946", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def warshall_floyd(graph):\n num_v = len(graph)\n for i in range(num_v):\n for j in range(num_v):\n for k in range(num_v):\n graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])\n return graph\n\n\nh, w = map(int, input().split())\nroute = [[float(\"inf\") for _ in range(10)] for _ in range(10)]\n\nfor i in range(10):\n S = list(map(int, input().split()))\n for j in range(10):\n route[i][j] = S[j]\ngraph = warshall_floyd(route)\nresult = 0\nfor i in range(h):\n A = list(map(int, input().split()))\n for a in A:\n if a == -1:\n continue\n else:\n result += graph[a][1]\nprint(result)\n\n", "code2": "def warshall_floyd(graph):\n num_v = len(graph)\n for k in range(num_v):\n for i in range(num_v):\n for j in range(num_v):\n graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])\n return graph\n\n\nh, w = map(int, input().split())\nroute = []\n\nfor i in range(10):\n S = list(map(int, input().split()))\n route.append(S)\ngraph = warshall_floyd(route)\nresult = 0\nfor i in range(h):\n A = list(map(int, input().split()))\n for a in A:\n if a != -1:\n result += graph[a][1]\nprint(result)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546390775", "date2": "1546391151", "bleu_score": "0.784866042511983", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "2 5\n0 4 -1 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 10\n5 7 1 7 -1 18 1 2 9 1\n4 0 2 0 0 7 7 4 2 3\n3 5 7 0 0 6 12 7 6 7\n1 8 5 1 2 0 4 7 6 5\n5 4 23 4 2 3 0 5 2 4\n3 5 2 0 4 2 4 0 1 9\n4 6 5 4 3 2 2 0 0 8\n3 1 0 6 5 7 2 6 4 0\n-1 1 2 4 1\n2 5 3 2 1\n8 9 2 6 6\n", "actual_output": "7\n", "expected_output": "-4\n\n", "anno_code": ["def warshall_floyd(graph): # (0): warshall_floyd=\n num_v = len(graph) # (235): num_v=10\n for i in range(num_v): # (236): i=0 (458): i=1 ... (2456): warshall_floyd=, h=2, w=5, route, S=[3, 1, 0, 6, 5, 7, 2, 6, 4, 0]\n for j in range(num_v): # (237): j=0 (259): j=1 ... (2455): NO CHANGE\n for k in range(num_v): # (238): k=0 (240): k=1 ... (2454): NO CHANGE\n graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j]) # (239): NO CHANGE (241): NO CHANGE ... (2453): NO CHANGE\n return graph\n\n\nh, w = map(int, input().split()) # (1): h=2, w=5\nroute = [[float(\"inf\") for _ in range(10)] for _ in range(10)] # (2): route\n\nfor i in range(10): # (3): i=0 (26): i=1 ... (233): NO CHANGE\n S = list(map(int, input().split())) # (4): S=[0, 4, -1, 6, 2, 7, 2, 5, 3, 0] (27): S=[4, 0, 5, 3, 12, 5, 3, 7, 2, 10] ... (211): S=[3, 1, 0, 6, 5, 7, 2, 6, 4, 0]\n for j in range(10): # (5): j=0 (7): j=1 ... (232): NO CHANGE\n route[i][j] = S[j] # (6): route (8): route ... (231): route\ngraph = warshall_floyd(route) # (234): graph\nresult = 0 # (2457): result=0\nfor i in range(h): # (2458): i=0 (2476): i=1 (2494): NO CHANGE\n A = list(map(int, input().split())) # (2459): A=[-1, 1, 2, 4, 1] (2477): A=[2, 5, 3, 2, 1]\n for a in A: # (2460): a=-1 (2463): a=1 ... (2493): NO CHANGE\n if a == -1: # (2461): NO CHANGE (2464): NO CHANGE ... (2491): NO CHANGE\n continue # (2462): NO CHANGE\n else:\n result += graph[a][1] # (2465): NO CHANGE (2468): result=2 ... (2492): NO CHANGE\nprint(result)\n\n"], "anno_status": [false], "diff_content": " def warshall_floyd(graph):\n num_v = len(graph)\n- for i in range(num_v):\n- for j in range(num_v):\n- for k in range(num_v):\n+ for k in range(num_v):\n+ for i in range(num_v):\n+ for j in range(num_v):\n graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])\n return graph\n \n \n h, w = map(int, input().split())\n-route = [[float(\"inf\") for _ in range(10)] for _ in range(10)]\n+route = []\n \n for i in range(10):\n S = list(map(int, input().split()))\n- for j in range(10):\n- route[i][j] = S[j]\n+ route.append(S)\n graph = warshall_floyd(route)\n result = 0\n for i in range(h):\n A = list(map(int, input().split()))\n for a in A:\n- if a == -1:\n- continue\n- else:\n+ if a != -1:\n result += graph[a][1]\n print(result)\n \n \n", "FL_content": " def warshall_floyd(graph):\n num_v = len(graph)\n- for i in range(num_v):\n- for j in range(num_v):\n- for k in range(num_v):\n graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])\n return graph\n \n \n h, w = map(int, input().split())\n-route = [[float(\"inf\") for _ in range(10)] for _ in range(10)]\n \n for i in range(10):\n S = list(map(int, input().split()))\n- for j in range(10):\n- route[i][j] = S[j]\n graph = warshall_floyd(route)\n result = 0\n for i in range(h):\n A = list(map(int, input().split()))\n for a in A:\n- if a == -1:\n- continue\n- else:\n result += graph[a][1]\n print(result)\n \n \n", "added_lines": 6, "removed_lines": 9, "code1_lines": 28 }, { "user_id": "u623687794", "problem_id": "p03546", "submission1_id": "s020138649", "submission2_id": "s608489964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\ncost=[list(map(int,input().split())) for i in range(10)]\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j])\nwall=[list(map(int,input().split())) for i in range(h)]\nans=0\nfor i in range(h):\n for j in wall[i]:\n if j==-1:continue\n ans+=cost[j][1]\nprint(ans)", "code2": "h,w=map(int,input().split())\ncost=[list(map(int,input().split())) for i in range(10)]\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n cost[j][k]=min(cost[j][k],cost[j][i]+cost[i][k])\nans=0\nfor i in range(h):\n a=map(int,input().split())\n for j in a:\n if j==-1:continue\n ans+=cost[j][1]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571854157", "date2": "1587699448", "bleu_score": "0.8552389297469267", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 1 7 6 7\n9 8 5 2 2 0 2 7 6 10\n5 4 6 3 2 3 0 5 1 0\n3 6 0 0 4 2 4 0 11 9\n4 6 5 5 3 5 3 2 0 8\n3 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 4 2 1\n8 9 2 6 6\n", "actual_output": "14\n", "expected_output": "10\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=3, w=5\ncost=[list(map(int,input().split())) for i in range(10)] # (1): cost\nfor i in range(10): # (2): i=0 (224): i=1 ... (2222): NO CHANGE\n for j in range(10): # (3): j=0 (25): j=1 ... (2221): NO CHANGE\n for k in range(10): # (4): k=0 (6): k=1 ... (2220): NO CHANGE\n cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]) # (5): NO CHANGE (7): NO CHANGE ... (2219): NO CHANGE\nwall=[list(map(int,input().split())) for i in range(h)] # (2223): wall\nans=0 # (2224): ans=0\nfor i in range(h): # (2225): i=0 (2241): i=1 ... (2275): NO CHANGE\n for j in wall[i]: # (2226): j=-1 (2228): j=5 ... (2274): NO CHANGE\n if j==-1:continue # (2227): NO CHANGE (2229): NO CHANGE ... (2272): NO CHANGE\n ans+=cost[j][1] # (2230): ans=2 (2233): ans=3 ... (2273): ans=14\nprint(ans)"], "anno_status": [false], "diff_content": " h,w=map(int,input().split())\n cost=[list(map(int,input().split())) for i in range(10)]\n for i in range(10):\n for j in range(10):\n for k in range(10):\n- cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j])\n-wall=[list(map(int,input().split())) for i in range(h)]\n+ cost[j][k]=min(cost[j][k],cost[j][i]+cost[i][k])\n ans=0\n for i in range(h):\n- for j in wall[i]:\n- if j==-1:continue\n- ans+=cost[j][1]\n+ a=map(int,input().split())\n+ for j in a:\n+ if j==-1:continue\n+ ans+=cost[j][1]\n print(ans)\n", "FL_content": " h,w=map(int,input().split())\n cost=[list(map(int,input().split())) for i in range(10)]\n for i in range(10):\n for j in range(10):\n for k in range(10):\n- cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j])\n-wall=[list(map(int,input().split())) for i in range(h)]\n ans=0\n for i in range(h):\n- for j in wall[i]:\n- if j==-1:continue\n- ans+=cost[j][1]\n print(ans)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 13 }, { "user_id": "u214617707", "problem_id": "p03546", "submission1_id": "s346148977", "submission2_id": "s649277548", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = map(int, input().split())\nc = [[0]*10 for i in range(10)]\nfor i in range(10):\n a = list(map(int, input().split()))\n for j in range(10):\n c[i][j] = a[j]\n\nA = [[0]*W for i in range(H)]\nfor i in range(H):\n a = list(map(int, input().split()))\n for j in range(W):\n A[i][j] = a[j]\n\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n if i != j:\n c[i][j] = min(c[i][j], c[i][k]+c[k][j])\n\nans = 0\nfor i in range(H):\n for j in range(W):\n if A[i][j] != -1 and A[i][j] != 1:\n ans += c[A[i][j]][1]\nprint(ans)", "code2": "H, W = map(int, input().split())\nc = [[0]*10 for i in range(10)]\nfor i in range(10):\n a = list(map(int, input().split()))\n for j in range(10):\n c[i][j] = a[j]\n\nA = [[0]*W for i in range(H)]\n\nfor i in range(H):\n a = list(map(int, input().split()))\n for j in range(W):\n A[i][j] = a[j]\n\nfor k in range(10):\n for i in range(10):\n for j in range(10):\n for k in range(10):\n if i != j:\n c[i][j] = min(c[i][j], c[i][k]+c[k][j])\n\nans = 0\nfor i in range(H):\n for j in range(W):\n if A[i][j] != -1 and A[i][j] != 1:\n ans += c[A[i][j]][1]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1511059865", "date2": "1511060194", "bleu_score": "0.9344034809238915", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 7\n5 7 0 7 0 9 1 3 9 1\n3 6 2 0 2 7 6 4 2 3\n3 5 6 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 0 4 3\n0 6 3 0 4 2 4 0 8 9\n4 6 5 8 3 5 3 2 0 8\n2 1 3 4 5 7 15 6 4 0\n0 5 3 6 1\n1 5 3 3 1\n6 9 2 5 6\n", "actual_output": "37\n", "expected_output": "34\n\n", "anno_code": ["H, W = map(int, input().split()) # (0): H=3, W=5\nc = [[0]*10 for i in range(10)] # (1): c\nfor i in range(10): # (2): i=0 (25): i=1 ... (232): NO CHANGE\n a = list(map(int, input().split())) # (3): a=[0, 4, 3, 6, 2, 7, 2, 5, 3, 0] (26): a=[4, 0, 5, 3, 12, 5, 3, 7, 2, 7] ... (210): a=[2, 1, 3, 4, 5, 7, 15, 6, 4, 0]\n for j in range(10): # (4): j=0 (6): j=1 ... (231): NO CHANGE\n c[i][j] = a[j] # (5): NO CHANGE (7): c ... (230): NO CHANGE\n\nA = [[0]*W for i in range(H)] # (233): A\nfor i in range(H): # (234): i=0 (247): i=1 ... (273): NO CHANGE\n a = list(map(int, input().split())) # (235): a=[0, 5, 3, 6, 1] (248): a=[1, 5, 3, 3, 1] (261): a=[6, 9, 2, 5, 6]\n for j in range(W): # (236): j=0 (238): j=1 ... (272): NO CHANGE\n A[i][j] = a[j] # (237): NO CHANGE (239): A ... (271): A\n\nfor i in range(10): # (274): i=0 (586): i=1 ... (3394): NO CHANGE\n for j in range(10): # (275): j=0 (297): j=1 ... (3393): NO CHANGE\n for k in range(10): # (276): k=0 (278): k=1 ... (3392): NO CHANGE\n if i != j: # (277): NO CHANGE (279): NO CHANGE ... (3391): NO CHANGE\n c[i][j] = min(c[i][j], c[i][k]+c[k][j]) # (300): NO CHANGE (303): NO CHANGE ... (3369): NO CHANGE\n\nans = 0 # (3395): ans=0\nfor i in range(H): # (3396): i=0 (3412): i=1 ... (3444): NO CHANGE\n for j in range(W): # (3397): j=0 (3400): j=1 ... (3443): NO CHANGE\n if A[i][j] != -1 and A[i][j] != 1: # (3398): NO CHANGE (3401): NO CHANGE ... (3441): NO CHANGE\n ans += c[A[i][j]][1] # (3399): ans=1 (3402): ans=7 ... (3442): ans=37\nprint(ans)"], "anno_status": [false], "diff_content": " H, W = map(int, input().split())\n c = [[0]*10 for i in range(10)]\n for i in range(10):\n a = list(map(int, input().split()))\n for j in range(10):\n c[i][j] = a[j]\n \n A = [[0]*W for i in range(H)]\n+\n for i in range(H):\n a = list(map(int, input().split()))\n for j in range(W):\n A[i][j] = a[j]\n \n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n- if i != j:\n- c[i][j] = min(c[i][j], c[i][k]+c[k][j])\n+for k in range(10):\n+ for i in range(10):\n+ for j in range(10):\n+ for k in range(10):\n+ if i != j:\n+ c[i][j] = min(c[i][j], c[i][k]+c[k][j])\n \n ans = 0\n for i in range(H):\n for j in range(W):\n if A[i][j] != -1 and A[i][j] != 1:\n ans += c[A[i][j]][1]\n print(ans)\n", "FL_content": " H, W = map(int, input().split())\n c = [[0]*10 for i in range(10)]\n for i in range(10):\n a = list(map(int, input().split()))\n for j in range(10):\n c[i][j] = a[j]\n \n A = [[0]*W for i in range(H)]\n for i in range(H):\n a = list(map(int, input().split()))\n for j in range(W):\n A[i][j] = a[j]\n \n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n- if i != j:\n- c[i][j] = min(c[i][j], c[i][k]+c[k][j])\n \n ans = 0\n for i in range(H):\n for j in range(W):\n if A[i][j] != -1 and A[i][j] != 1:\n ans += c[A[i][j]][1]\n print(ans)\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 25 }, { "user_id": "u924406834", "problem_id": "p03546", "submission1_id": "s494954565", "submission2_id": "s994903353", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w = map(int,input().split())\nij = [list(map(int,input().split())) for x in range(10)]\ndp = [[100 for i in range(10)] for i in range(10)]\nfor i in range(10):\n dp[i][0] = ij[i][1]\nfor i in range(1,10):\n for j in range(10):\n num = dp[j][i-1]\n for k in range(10):\n num = min(num,ij[j][k] + dp[k][j-1])\n dp[j][i] = num\nans = 0\nfor i in range(h):\n for j in list(map(int,input().split())):\n if j == -1:break\n ans += dp[j][-1]\nprint(ans)", "code2": "h,w = map(int,input().split())\nij = [list(map(int,input().split())) for x in range(10)]\nfor k in range(10):\n for i in range(10):\n for j in range(10):\n ij[i][j] = min(ij[i][j],ij[i][k]+ij[k][j])\nans = 0\nfor i in range(h):\n for j in list(map(int,input().split())):\n if j == -1:continue\n ans += ij[j][1]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551123612", "date2": "1551126030", "bleu_score": "0.6273938316843349", "code1_test_status": [1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 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, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 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], "code1_test_score": 45, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 3 5 3 0\n4 0 5 3 12 5 3 10 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 1 7 6 7\n9 8 5 2 2 0 2 7 6 10\n5 4 6 0 2 3 0 5 0 3\n3 6 0 0 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n3 1 3 4 5 7 8 12 4 0\n-1 5 2 6 1\n2 5 4 2 1\n8 9 2 6 6\n", "actual_output": "8\n", "expected_output": "7\n\n", "anno_code": ["h,w = map(int,input().split()) # (0): h=3, w=5\nij = [list(map(int,input().split())) for x in range(10)] # (1): ij\ndp = [[100 for i in range(10)] for i in range(10)] # (2): dp\nfor i in range(10): # (3): i=0 (5): i=1 ... (23): NO CHANGE\n dp[i][0] = ij[i][1] # (4): dp (6): dp ... (22): dp\nfor i in range(1,10): # (24): i=1 (266): i=2 ... (2202): NO CHANGE\n for j in range(10): # (25): j=0 (49): j=1 ... (2201): NO CHANGE\n num = dp[j][i-1] # (26): num=4 (50): num=0 ... (2178): num=1\n for k in range(10): # (27): k=0 (29): k=1 ... (2199): NO CHANGE\n num = min(num,ij[j][k] + dp[k][j-1]) # (28): NO CHANGE (30): NO CHANGE ... (2198): NO CHANGE\n dp[j][i] = num # (48): dp (72): dp ... (2200): dp\nans = 0 # (2203): ans=0\nfor i in range(h): # (2204): i=0 (2207): i=1 ... (2241): NO CHANGE\n for j in list(map(int,input().split())): # (2205): j=-1 (2208): j=2 ... (2240): NO CHANGE\n if j == -1:break # (2206): NO CHANGE (2209): NO CHANGE ... (2238): NO CHANGE\n ans += dp[j][-1] # (2210): ans=1 (2213): ans=3 ... (2239): NO CHANGE\nprint(ans)"], "anno_status": [false], "diff_content": " h,w = map(int,input().split())\n ij = [list(map(int,input().split())) for x in range(10)]\n-dp = [[100 for i in range(10)] for i in range(10)]\n-for i in range(10):\n- dp[i][0] = ij[i][1]\n-for i in range(1,10):\n- for j in range(10):\n- num = dp[j][i-1]\n- for k in range(10):\n- num = min(num,ij[j][k] + dp[k][j-1])\n- dp[j][i] = num\n+for k in range(10):\n+ for i in range(10):\n+ for j in range(10):\n+ ij[i][j] = min(ij[i][j],ij[i][k]+ij[k][j])\n ans = 0\n for i in range(h):\n for j in list(map(int,input().split())):\n- if j == -1:break\n- ans += dp[j][-1]\n+ if j == -1:continue\n+ ans += ij[j][1]\n print(ans)\n", "FL_content": " h,w = map(int,input().split())\n ij = [list(map(int,input().split())) for x in range(10)]\n-dp = [[100 for i in range(10)] for i in range(10)]\n-for i in range(10):\n- dp[i][0] = ij[i][1]\n-for i in range(1,10):\n- for j in range(10):\n- num = dp[j][i-1]\n- for k in range(10):\n- num = min(num,ij[j][k] + dp[k][j-1])\n- dp[j][i] = num\n ans = 0\n for i in range(h):\n for j in list(map(int,input().split())):\n- if j == -1:break\n- ans += dp[j][-1]\n print(ans)\n", "added_lines": 6, "removed_lines": 11, "code1_lines": 17 }, { "user_id": "u568576853", "problem_id": "p03546", "submission1_id": "s611541731", "submission2_id": "s068585384", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\nwlist=[[0]*10 for _ in range(10)]\nfor i in range(10):\n b=list(map(int,input().split()))\n for j in range(10):\n wlist[i][j]=b[j]\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n wlist[i][j]=min(wlist[i][j],wlist[i][k]+wlist[k][j])\nans=0\nfor _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\nprint(ans)", "code2": "h,w=map(int,input().split())\nwlist=[list(map(int,input().split()))for _ in range(10)]\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n wlist[j][k]=min(wlist[j][k],wlist[j][i]+wlist[i][k])\nans=0\nfor _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588209625", "date2": "1588209997", "bleu_score": "0.7826394249501367", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 1 3\n3 6 2 0 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n3 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 4 2 1\n6 9 2 6 6\n", "actual_output": "17\n", "expected_output": "13\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=3, w=5\nwlist=[[0]*10 for _ in range(10)] # (1): wlist\nfor i in range(10): # (2): i=0 (25): i=1 ... (232): NO CHANGE\n b=list(map(int,input().split())) # (3): b=[0, 4, 3, 6, 2, 7, 2, 5, 3, 0] (26): b=[4, 0, 5, 3, 12, 5, 3, 7, 2, 11] ... (210): b=[3, 1, 3, 4, 5, 7, 8, 6, 4, 0]\n for j in range(10): # (4): j=0 (6): j=1 ... (231): NO CHANGE\n wlist[i][j]=b[j] # (5): NO CHANGE (7): wlist ... (230): NO CHANGE\nfor i in range(10): # (233): i=0 (455): i=1 ... (2453): NO CHANGE\n for j in range(10): # (234): j=0 (256): j=1 ... (2452): NO CHANGE\n for k in range(10): # (235): k=0 (237): k=1 ... (2451): NO CHANGE\n wlist[i][j]=min(wlist[i][j],wlist[i][k]+wlist[k][j]) # (236): NO CHANGE (238): NO CHANGE ... (2450): NO CHANGE\nans=0 # (2454): ans=0\nfor _ in range(h): # (2455): _=0 (2473): _=1 ... (2509): NO CHANGE\n t=list(map(int,input().split())) # (2456): t=[-1, 5, 2, 6, 1] (2474): t=[2, 5, 4, 2, 1] (2492): t=[6, 9, 2, 6, 6]\n for i in t: # (2457): i=-1 (2460): i=5 ... (2508): NO CHANGE\n if i==-1 or i==1: # (2458): NO CHANGE (2461): NO CHANGE ... (2506): NO CHANGE\n continue # (2459): NO CHANGE (2471): NO CHANGE (2489): NO CHANGE\n else:\n ans+=wlist[i][1] # (2462): ans=2 (2465): ans=3 ... (2507): ans=17\nprint(ans)"], "anno_status": [false], "diff_content": " h,w=map(int,input().split())\n-wlist=[[0]*10 for _ in range(10)]\n-for i in range(10):\n- b=list(map(int,input().split()))\n- for j in range(10):\n- wlist[i][j]=b[j]\n+wlist=[list(map(int,input().split()))for _ in range(10)]\n for i in range(10):\n for j in range(10):\n for k in range(10):\n- wlist[i][j]=min(wlist[i][j],wlist[i][k]+wlist[k][j])\n+ wlist[j][k]=min(wlist[j][k],wlist[j][i]+wlist[i][k])\n ans=0\n for _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\n print(ans)\n", "FL_content": " h,w=map(int,input().split())\n-wlist=[[0]*10 for _ in range(10)]\n-for i in range(10):\n- b=list(map(int,input().split()))\n- for j in range(10):\n- wlist[i][j]=b[j]\n for i in range(10):\n for j in range(10):\n for k in range(10):\n- wlist[i][j]=min(wlist[i][j],wlist[i][k]+wlist[k][j])\n ans=0\n for _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\n print(ans)\n", "added_lines": 2, "removed_lines": 6, "code1_lines": 19 }, { "user_id": "u981931040", "problem_id": "p03546", "submission1_id": "s654163359", "submission2_id": "s690022053", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def warshall_floyd():\n for middle in range(10):\n for start in range(10):\n for end in range(10):\n costs[start][end] = min(costs[start][end], costs[start][middle] + costs[middle][end])\n\n\nH, W = map(int, input().split())\ncosts = []\n\nfor i in range(10):\n costs.append(list(map(int, input().split())))\n\nwarshall_floyd()\n\nprint(*costs, sep='\\n')\nans = 0\nfor i in range(H):\n wall = list(map(int, input().split()))\n for num in wall:\n if num != -1:\n ans += costs[num][1]\nprint(ans)", "code2": "def warshall_floyd():\n for middle in range(10):\n for start in range(10):\n for end in range(10):\n costs[start][end] = min(costs[start][end], costs[start][middle] + costs[middle][end])\n\n\nH, W = map(int, input().split())\ncosts = []\n\nfor i in range(10):\n costs.append(list(map(int, input().split())))\n\nwarshall_floyd()\n\n\nans = 0\nfor i in range(H):\n wall = list(map(int, input().split()))\n for num in wall:\n if num != -1:\n ans += costs[num][1]\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597859564", "date2": "1597859587", "bleu_score": "0.9532560367343992", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 4\n0 9 9 9 9 9 9 9 13 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 2 9 9 9 9 9\n6 9 9 9 0 9 9 9 9 1\n9 9 9 15 15 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 2 9 0 9 9\n9 9 9 5 3 9 9 9 0 9\n9 2 9 9 9 9 2 9 9 0\n-1 -1 -1 -1\n0 1 1 8\n", "actual_output": "[0, 9, 9, 9, 9, 9, 9, 9, 13, 9]\n[9, 0, 9, 9, 9, 9, 9, 9, 9, 9]\n[9, 9, 0, 9, 9, 9, 9, 9, 9, 9]\n[8, 5, 9, 0, 2, 9, 5, 9, 9, 3]\n[6, 3, 9, 9, 0, 9, 3, 9, 9, 1]\n[9, 9, 9, 14, 12, 0, 9, 9, 9, 9]\n[9, 9, 9, 9, 9, 9, 0, 9, 9, 9]\n[9, 9, 9, 9, 9, 2, 9, 0, 9, 9]\n[9, 6, 9, 5, 3, 9, 6, 9, 0, 4]\n[9, 2, 9, 9, 9, 9, 2, 9, 9, 0]\n15\n", "expected_output": "15\n\n", "anno_code": ["def warshall_floyd(): # (0): warshall_floyd=\n for middle in range(10): # (25): middle=0 (247): middle=1 ... (2245): warshall_floyd=, H=2, W=4, costs, i=9\n for start in range(10): # (26): start=0 (48): start=1 ... (2244): NO CHANGE\n for end in range(10): # (27): end=0 (29): end=1 ... (2243): NO CHANGE\n costs[start][end] = min(costs[start][end], costs[start][middle] + costs[middle][end]) # (28): NO CHANGE (30): NO CHANGE ... (2242): NO CHANGE\n\n\nH, W = map(int, input().split()) # (1): H=2, W=4\ncosts = [] # (2): costs=[]\n\nfor i in range(10): # (3): i=0 (5): i=1 ... (23): NO CHANGE\n costs.append(list(map(int, input().split()))) # (4): costs (6): costs ... (22): costs\n\nwarshall_floyd() # (24): NO CHANGE\n\nprint(*costs, sep='\\n') # (2246): NO CHANGE\nans = 0 # (2247): ans=0\nfor i in range(H): # (2248): i=0 (2259): i=1 (2274): NO CHANGE\n wall = list(map(int, input().split())) # (2249): wall=[-1, -1, -1, -1] (2260): wall=[0, 1, 1, 8]\n for num in wall: # (2250): num=-1 (2252): NO CHANGE ... (2273): NO CHANGE\n if num != -1: # (2251): NO CHANGE (2253): NO CHANGE ... (2271): NO CHANGE\n ans += costs[num][1] # (2263): ans=9 (2266): NO CHANGE ... (2272): ans=15\nprint(ans)"], "anno_status": [false], "diff_content": " def warshall_floyd():\n for middle in range(10):\n for start in range(10):\n for end in range(10):\n costs[start][end] = min(costs[start][end], costs[start][middle] + costs[middle][end])\n \n \n H, W = map(int, input().split())\n costs = []\n \n for i in range(10):\n costs.append(list(map(int, input().split())))\n \n warshall_floyd()\n \n-print(*costs, sep='\\n')\n+\n ans = 0\n for i in range(H):\n wall = list(map(int, input().split()))\n for num in wall:\n if num != -1:\n ans += costs[num][1]\n print(ans)\n", "FL_content": " def warshall_floyd():\n for middle in range(10):\n for start in range(10):\n for end in range(10):\n costs[start][end] = min(costs[start][end], costs[start][middle] + costs[middle][end])\n \n \n H, W = map(int, input().split())\n costs = []\n \n for i in range(10):\n costs.append(list(map(int, input().split())))\n \n warshall_floyd()\n \n-print(*costs, sep='\\n')\n ans = 0\n for i in range(H):\n wall = list(map(int, input().split()))\n for num in wall:\n if num != -1:\n ans += costs[num][1]\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u167681750", "problem_id": "p03546", "submission1_id": "s359552769", "submission2_id": "s561232222", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, w = map(int, input().split())\n\ntable = [list(map(int, input().split())) for _ in range(10)]\n\ndef wf(table):\n from itertools import product\n for i, j, k in product(range(len(table)), repeat=3):\n table[i][j] = min(table[i][j], table[i][k] + table[k][j])\n\n return table\n\ntable = wf(table)\n\nans = 0\nfor _ in range(h):\n for i in map(int, input().split()):\n if i != -1:\n ans += table[i][1]\n\nprint(ans)", "code2": "h, w = map(int, input().split())\n\ntable = [list(map(int, input().split())) for _ in range(10)]\n\ndef wf(table):\n from itertools import product\n for k, i, j in product(range(len(table)), repeat=3):\n table[i][j] = min(table[i][j], table[i][k] + table[k][j])\n\n return table\n\ntable = wf(table)\n\nans = 0\nfor _ in range(h):\n for i in map(int, input().split()):\n if i != -1:\n ans += table[i][1]\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584998804", "date2": "1584998919", "bleu_score": "0.9884468934581417", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 1 7 6 7\n9 8 5 2 2 0 2 7 6 10\n5 4 6 3 2 3 0 5 1 3\n3 6 0 0 4 2 4 0 11 9\n4 6 5 5 3 5 3 2 0 8\n3 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 4 2 1\n8 9 2 6 6\n", "actual_output": "17\n", "expected_output": "13\n\n", "anno_code": ["h, w = map(int, input().split()) # (0): h=3, w=5\n\ntable = [list(map(int, input().split())) for _ in range(10)] # (1): table\n\ndef wf(table): # (2): wf=\n from itertools import product\n for i, j, k in product(range(len(table)), repeat=3): # (4): i=0, j=0, k=0 (6): k=1 ... (2004): h=3, w=5, wf=\n table[i][j] = min(table[i][j], table[i][k] + table[k][j]) # (5): NO CHANGE (7): NO CHANGE ... (2003): NO CHANGE\n\n return table\n\ntable = wf(table) # (3): product=\n\nans = 0 # (2005): ans=0\nfor _ in range(h): # (2006): _=0 (2022): _=1 ... (2056): NO CHANGE\n for i in map(int, input().split()): # (2007): i=-1 (2009): i=5 ... (2055): NO CHANGE\n if i != -1: # (2008): NO CHANGE (2010): NO CHANGE ... (2053): NO CHANGE\n ans += table[i][1] # (2011): ans=2 (2014): ans=3 ... (2054): ans=17\n\nprint(ans)"], "anno_status": [false], "diff_content": " h, w = map(int, input().split())\n \n table = [list(map(int, input().split())) for _ in range(10)]\n \n def wf(table):\n from itertools import product\n- for i, j, k in product(range(len(table)), repeat=3):\n+ for k, i, j in product(range(len(table)), repeat=3):\n table[i][j] = min(table[i][j], table[i][k] + table[k][j])\n \n return table\n \n table = wf(table)\n \n ans = 0\n for _ in range(h):\n for i in map(int, input().split()):\n if i != -1:\n ans += table[i][1]\n \n print(ans)\n+\n", "FL_content": " h, w = map(int, input().split())\n \n table = [list(map(int, input().split())) for _ in range(10)]\n \n def wf(table):\n from itertools import product\n- for i, j, k in product(range(len(table)), repeat=3):\n table[i][j] = min(table[i][j], table[i][k] + table[k][j])\n \n return table\n \n table = wf(table)\n \n ans = 0\n for _ in range(h):\n for i in map(int, input().split()):\n if i != -1:\n ans += table[i][1]\n \n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u131881594", "problem_id": "p03546", "submission1_id": "s373132073", "submission2_id": "s469769097", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nh,w=map(int,input().split())\nc=[]\ndic=defaultdict(int)\nfor _ in range(10): c.append(list(map(int,input().split())))\nfor _ in range(h):\n temp=list(map(int,input().split()))\n for i in temp: dic[i]+=1\nfor k in range(10):\n for i in range(10):\n for j in range(10): c[i][j]=min(c[i][j],c[i][k]+c[k][j])\nans=0\nfor item in dic.items():\n if item[0]: ans+=item[1]*c[item[0]][1]\nprint(ans)", "code2": "from collections import defaultdict\n\nh,w=map(int,input().split())\nc=[]\ndic=defaultdict(int)\nfor _ in range(10): c.append(list(map(int,input().split())))\nfor _ in range(h):\n temp=list(map(int,input().split()))\n for i in temp: dic[i]+=1\nfor k in range(10):\n for i in range(10):\n for j in range(10): c[i][j]=min(c[i][j],c[i][k]+c[k][j])\nans=0\nfor item in dic.items():\n if item[0]>=0: ans+=item[1]*c[item[0]][1]\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596678926", "date2": "1596679393", "bleu_score": "0.9896569913679741", "code1_test_status": [0, 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, 1, 0, 0, 1, 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, 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, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 19, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 2 9 1 2 9 0\n3 6 2 0 2 7 6 4 2 3\n3 5 7 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 0 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n0 5 2 6 1\n2 5 3 2 1\n6 9 2 6 6\n", "actual_output": "34\n", "expected_output": "35\n\n", "anno_code": ["from collections import defaultdict\n\nh,w=map(int,input().split()) # (0): h=3, w=5\nc=[] # (1): c=[]\ndic=defaultdict(int) # (2): dic=defaultdict(, {})\nfor _ in range(10): c.append(list(map(int,input().split()))) # (3): c=[[0, 4, 3, 6, 2, 7, 2, 5, 3, 0]], _=0 (4): c, _=1 ... (13): NO CHANGE\nfor _ in range(h): # (14): _=0 (22): _=1 ... (38): NO CHANGE\n temp=list(map(int,input().split())) # (15): temp=[0, 5, 2, 6, 1] (23): temp=[2, 5, 3, 2, 1] (31): temp=[6, 9, 2, 6, 6]\n for i in temp: dic[i]+=1 # (16): dic=defaultdict(, {0: 1}), i=0 (17): dic=defaultdict(, {0: 1, 5: 1}), i=5 ... (37): NO CHANGE\nfor k in range(10): # (39): k=0 (161): k=1 ... (1259): NO CHANGE\n for i in range(10): # (40): i=0 (52): i=1 ... (1258): NO CHANGE\n for j in range(10): c[i][j]=min(c[i][j],c[i][k]+c[k][j]) # (41): j=0 (42): j=1 ... (1257): NO CHANGE\nans=0 # (1260): ans=0\nfor item in dic.items(): # (1261): item=(0, 1) (1263): item=(5, 2) ... (1275): NO CHANGE\n if item[0]: ans+=item[1]*c[item[0]][1] # (1262): NO CHANGE (1264): ans=10 ... (1274): ans=34\nprint(ans)"], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n h,w=map(int,input().split())\n c=[]\n dic=defaultdict(int)\n for _ in range(10): c.append(list(map(int,input().split())))\n for _ in range(h):\n temp=list(map(int,input().split()))\n for i in temp: dic[i]+=1\n for k in range(10):\n for i in range(10):\n for j in range(10): c[i][j]=min(c[i][j],c[i][k]+c[k][j])\n ans=0\n for item in dic.items():\n- if item[0]: ans+=item[1]*c[item[0]][1]\n+ if item[0]>=0: ans+=item[1]*c[item[0]][1]\n print(ans)\n", "FL_content": " from collections import defaultdict\n \n h,w=map(int,input().split())\n c=[]\n dic=defaultdict(int)\n for _ in range(10): c.append(list(map(int,input().split())))\n for _ in range(h):\n temp=list(map(int,input().split()))\n for i in temp: dic[i]+=1\n for k in range(10):\n for i in range(10):\n for j in range(10): c[i][j]=min(c[i][j],c[i][k]+c[k][j])\n ans=0\n for item in dic.items():\n- if item[0]: ans+=item[1]*c[item[0]][1]\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u794250528", "problem_id": "p03546", "submission1_id": "s417407745", "submission2_id": "s594691043", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, w = map(int, input().split())\nc = [list(map(int, input().split())) for _ in range(10)]\na = [list(map(int, input().split())) for _ in range(h)]\n\nfor x in range(10):\n for y in range(10):\n for z in range(10):\n c[y][z] = min(c[y][z], c[y][x] + c[x][z])\n\nans = 0\nfor x in range(h):\n for y in range(w):\n if a[x][y] > 1:\n ans += c[a[x][y]][1]\n\nprint(ans)\n", "code2": "h, w = map(int, input().split())\nc = [list(map(int, input().split())) for _ in range(10)]\na = [list(map(int, input().split())) for _ in range(h)]\n\nfor x in range(10):\n for y in range(10):\n for z in range(10):\n c[y][z] = min(c[y][z], c[y][x] + c[x][z])\n\nans = 0\nfor x in range(h):\n for y in range(w):\n if a[x][y] >= 0:\n ans += c[a[x][y]][1]\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1547911447", "date2": "1547911524", "bleu_score": "0.9891540683367155", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 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], "code1_test_score": 54, "total_score": 103, "input": "2 4\n0 9 9 9 9 9 9 9 13 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 2 9 9 9 9 9\n6 9 9 9 0 9 9 9 9 1\n9 9 9 15 15 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 2 9 0 9 9\n9 9 9 5 2 9 9 9 0 9\n9 2 9 9 9 9 2 9 9 0\n-1 -1 -1 -1\n0 1 1 8\n", "actual_output": "5\n", "expected_output": "14\n\n", "anno_code": ["h, w = map(int, input().split()) # (0): h=2, w=4\nc = [list(map(int, input().split())) for _ in range(10)] # (1): c\na = [list(map(int, input().split())) for _ in range(h)] # (2): a\n\nfor x in range(10): # (3): x=0 (225): x=1 ... (2223): NO CHANGE\n for y in range(10): # (4): y=0 (26): y=1 ... (2222): NO CHANGE\n for z in range(10): # (5): z=0 (7): z=1 ... (2221): NO CHANGE\n c[y][z] = min(c[y][z], c[y][x] + c[x][z]) # (6): NO CHANGE (8): NO CHANGE ... (2220): NO CHANGE\n\nans = 0 # (2224): ans=0\nfor x in range(h): # (2225): x=0 (2235): x=1 (2246): NO CHANGE\n for y in range(w): # (2226): y=0 (2228): y=1 ... (2245): NO CHANGE\n if a[x][y] > 1: # (2227): NO CHANGE (2229): NO CHANGE ... (2243): NO CHANGE\n ans += c[a[x][y]][1] # (2244): ans=5\n\nprint(ans)\n"], "anno_status": [false], "diff_content": " h, w = map(int, input().split())\n c = [list(map(int, input().split())) for _ in range(10)]\n a = [list(map(int, input().split())) for _ in range(h)]\n \n for x in range(10):\n for y in range(10):\n for z in range(10):\n c[y][z] = min(c[y][z], c[y][x] + c[x][z])\n \n ans = 0\n for x in range(h):\n for y in range(w):\n- if a[x][y] > 1:\n+ if a[x][y] >= 0:\n ans += c[a[x][y]][1]\n \n print(ans)\n \n", "FL_content": " h, w = map(int, input().split())\n c = [list(map(int, input().split())) for _ in range(10)]\n a = [list(map(int, input().split())) for _ in range(h)]\n \n for x in range(10):\n for y in range(10):\n for z in range(10):\n c[y][z] = min(c[y][z], c[y][x] + c[x][z])\n \n ans = 0\n for x in range(h):\n for y in range(w):\n- if a[x][y] > 1:\n ans += c[a[x][y]][1]\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u124498235", "problem_id": "p03546", "submission1_id": "s847534940", "submission2_id": "s387044365", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\nfrom collections import deque\nh, w = map(int, input().split())\nc = []\nfor i in range(10):\n s = list(map(int, input().split()))\n c.append(s)\n\na = []\nfor i in range(h):\n b = list(map(int, input().split()))\n a.append(b)\n\n\nd = c\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n d[i][j] = min(d[i][k]+d[k][j], d[i][j])\n\nans = 0\n\nfor i in range(h):\n for j in range(w):\n if a[i][j] == -1:\n continue\n x = a[i][j]\n ans += d[x][1]\nprint (ans)", "code2": "from collections import defaultdict\nh, w = map(int, input().split())\nc = []\nfor i in range(10):\n s = list(map(int, input().split()))\n c.append(s)\n\na = []\nfor i in range(h):\n b = list(map(int, input().split()))\n a.append(b)\n\n\nd = c\nfor k in range(10):\n for i in range(10):\n for j in range(10):\n d[i][j] = min(d[i][k]+d[k][j], d[i][j])\n\nans = 0\n\nfor i in range(h):\n for j in range(w):\n if a[i][j] == -1:\n continue\n x = a[i][j]\n ans += d[x][1]\nprint (ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591741007", "date2": "1591741305", "bleu_score": "0.9379356065046835", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 73, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 7\n5 7 0 7 0 9 1 3 9 1\n3 6 2 0 2 7 6 4 2 3\n3 5 6 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 0 4 3\n0 6 3 0 4 2 4 0 8 9\n4 6 5 8 3 5 3 2 0 8\n2 1 3 4 5 7 15 6 4 0\n0 5 3 6 1\n1 5 3 3 1\n6 9 2 5 6\n", "actual_output": "37\n", "expected_output": "34\n\n", "anno_code": ["from collections import defaultdict\nfrom collections import deque\nh, w = map(int, input().split()) # (0): h=3, w=5\nc = [] # (1): c=[]\nfor i in range(10): # (2): i=0 (5): i=1 ... (32): NO CHANGE\n s = list(map(int, input().split())) # (3): s=[0, 4, 3, 6, 2, 7, 2, 5, 3, 0] (6): s=[4, 0, 5, 3, 12, 5, 3, 7, 2, 7] ... (30): s=[2, 1, 3, 4, 5, 7, 15, 6, 4, 0]\n c.append(s) # (4): c (7): c ... (31): c\n\na = [] # (33): a=[]\nfor i in range(h): # (34): i=0 (37): i=1 ... (43): NO CHANGE\n b = list(map(int, input().split())) # (35): b=[0, 5, 3, 6, 1] (38): b=[1, 5, 3, 3, 1] (41): b=[6, 9, 2, 5, 6]\n a.append(b) # (36): a=[[0, 5, 3, 6, 1]] (39): a (42): a\n\n\nd = c # (44): d\nfor i in range(10): # (45): i=0 (267): i=1 ... (2265): NO CHANGE\n for j in range(10): # (46): j=0 (68): j=1 ... (2264): NO CHANGE\n for k in range(10): # (47): k=0 (49): k=1 ... (2263): NO CHANGE\n d[i][j] = min(d[i][k]+d[k][j], d[i][j]) # (48): NO CHANGE (50): NO CHANGE ... (2262): NO CHANGE\n\nans = 0 # (2266): ans=0\n\nfor i in range(h): # (2267): i=0 (2289): i=1 ... (2333): NO CHANGE\n for j in range(w): # (2268): j=0 (2272): j=1 ... (2332): NO CHANGE\n if a[i][j] == -1: # (2269): NO CHANGE (2273): NO CHANGE ... (2329): NO CHANGE\n continue\n x = a[i][j] # (2270): x=0 (2274): x=5 ... (2330): x=6\n ans += d[x][1] # (2271): ans=1 (2275): ans=7 ... (2331): ans=37\nprint (ans)"], "anno_status": [false], "diff_content": " from collections import defaultdict\n-from collections import deque\n h, w = map(int, input().split())\n c = []\n for i in range(10):\n s = list(map(int, input().split()))\n c.append(s)\n \n a = []\n for i in range(h):\n b = list(map(int, input().split()))\n a.append(b)\n \n \n d = c\n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n+for k in range(10):\n+ for i in range(10):\n+ for j in range(10):\n d[i][j] = min(d[i][k]+d[k][j], d[i][j])\n \n ans = 0\n \n for i in range(h):\n for j in range(w):\n if a[i][j] == -1:\n continue\n x = a[i][j]\n ans += d[x][1]\n print (ans)\n", "FL_content": " from collections import defaultdict\n-from collections import deque\n h, w = map(int, input().split())\n c = []\n for i in range(10):\n s = list(map(int, input().split()))\n c.append(s)\n \n a = []\n for i in range(h):\n b = list(map(int, input().split()))\n a.append(b)\n \n \n d = c\n-for i in range(10):\n- for j in range(10):\n- for k in range(10):\n d[i][j] = min(d[i][k]+d[k][j], d[i][j])\n \n ans = 0\n \n for i in range(h):\n for j in range(w):\n if a[i][j] == -1:\n continue\n x = a[i][j]\n ans += d[x][1]\n print (ans)\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 29 }, { "user_id": "u280984565", "problem_id": "p03546", "submission1_id": "s417185309", "submission2_id": "s138075109", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]\n\nw, h = read_line(int, int)\n\nc = []\nfor _ in range(10):\n c.append(read_line(int, int, int, int, int, int, int, int, int, int))\n\nfor k in range(10):\n for i in range(10):\n for j in range(10):\n if i != j:\n c[i][j] = min(c[i][j], c[i][k] + c[k][j])\n\ncost = 0\nfor _ in range(w):\n for a in read_line(*([int] * h)):\n if a > 0:\n cost += c[a][1]\n\nprint(cost)\n", "code2": "def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]\n\nw, h = read_line(int, int)\n\nc = []\nfor _ in range(10):\n c.append(read_line(int, int, int, int, int, int, int, int, int, int))\n\nfor k in range(10):\n for i in range(10):\n for j in range(10):\n if i != j:\n c[i][j] = min(c[i][j], c[i][k] + c[k][j])\n\ncost = 0\nfor _ in range(w):\n for a in read_line(*([int] * h)):\n if a >= 0:\n cost += c[a][1]\n\nprint(cost)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1511062316", "date2": "1511062518", "bleu_score": "0.9948532635690474", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 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], "code1_test_score": 54, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 3\n4 0 5 3 12 5 3 7 2 7\n5 7 0 7 2 9 1 2 9 1\n3 6 2 0 2 7 6 4 2 3\n3 5 7 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 0 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n0 5 2 6 1\n2 5 3 2 1\n6 9 2 5 6\n", "actual_output": "43\n", "expected_output": "47\n\n", "anno_code": ["def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]\n\nw, h = read_line(int, int) # (0): w=3, h=5\n\nc = [] # (1): c=[]\nfor _ in range(10): # (2): _=0 (4): _=1 ... (22): NO CHANGE\n c.append(read_line(int, int, int, int, int, int, int, int, int, int)) # (3): c (5): c ... (21): c\n\nfor k in range(10): # (23): k=0 (335): k=1 ... (3143): NO CHANGE\n for i in range(10): # (24): i=0 (55): i=1 ... (3142): NO CHANGE\n for j in range(10): # (25): j=0 (27): j=1 ... (3141): NO CHANGE\n if i != j: # (26): NO CHANGE (28): NO CHANGE ... (3140): NO CHANGE\n c[i][j] = min(c[i][j], c[i][k] + c[k][j]) # (29): NO CHANGE (32): NO CHANGE ... (3138): NO CHANGE\n\ncost = 0 # (3144): cost=0\nfor _ in range(w): # (3145): _=0 (3161): _=1 ... (3195): NO CHANGE\n for a in read_line(*([int] * h)): # (3146): a=0 (3148): a=5 ... (3194): NO CHANGE\n if a > 0: # (3147): NO CHANGE (3149): NO CHANGE ... (3192): NO CHANGE\n cost += c[a][1] # (3150): cost=6 (3153): cost=8 ... (3193): cost=43\n\nprint(cost)\n"], "anno_status": [false], "diff_content": " def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]\n \n w, h = read_line(int, int)\n \n c = []\n for _ in range(10):\n c.append(read_line(int, int, int, int, int, int, int, int, int, int))\n \n for k in range(10):\n for i in range(10):\n for j in range(10):\n if i != j:\n c[i][j] = min(c[i][j], c[i][k] + c[k][j])\n \n cost = 0\n for _ in range(w):\n for a in read_line(*([int] * h)):\n- if a > 0:\n+ if a >= 0:\n cost += c[a][1]\n \n print(cost)\n \n", "FL_content": " def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]\n \n w, h = read_line(int, int)\n \n c = []\n for _ in range(10):\n c.append(read_line(int, int, int, int, int, int, int, int, int, int))\n \n for k in range(10):\n for i in range(10):\n for j in range(10):\n if i != j:\n c[i][j] = min(c[i][j], c[i][k] + c[k][j])\n \n cost = 0\n for _ in range(w):\n for a in read_line(*([int] * h)):\n- if a > 0:\n cost += c[a][1]\n \n print(cost)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u568576853", "problem_id": "p03546", "submission1_id": "s732554837", "submission2_id": "s068585384", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\nwlist=[[0]*10 for _ in range(10)]\nfor i in range(10):\n b=list(map(int,input().split()))\n for j in range(10):\n wlist[i][j]=b[j]\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n wlist[i][k]=min(wlist[i][k],wlist[i][j]+wlist[j][k])\nans=0\nfor _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\nprint(ans)", "code2": "h,w=map(int,input().split())\nwlist=[list(map(int,input().split()))for _ in range(10)]\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n wlist[j][k]=min(wlist[j][k],wlist[j][i]+wlist[i][k])\nans=0\nfor _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588208892", "date2": "1588209997", "bleu_score": "0.794575384906227", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 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, 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], "code1_test_score": 74, "total_score": 103, "input": "3 5\n0 4 3 6 2 7 2 5 3 0\n4 0 5 3 12 5 3 7 2 11\n5 7 0 7 0 18 1 2 9 0\n3 0 2 0 2 7 6 4 2 3\n3 5 7 0 0 6 1 7 6 7\n9 8 5 2 2 0 2 7 6 10\n5 4 6 3 2 3 0 5 1 0\n3 6 0 0 4 2 4 0 11 9\n4 6 5 5 3 5 3 2 0 8\n3 1 3 4 5 7 8 6 4 0\n-1 5 2 6 1\n2 5 4 2 1\n8 9 2 6 6\n", "actual_output": "14\n", "expected_output": "10\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=3, w=5\nwlist=[[0]*10 for _ in range(10)] # (1): wlist\nfor i in range(10): # (2): i=0 (25): i=1 ... (232): NO CHANGE\n b=list(map(int,input().split())) # (3): b=[0, 4, 3, 6, 2, 7, 2, 5, 3, 0] (26): b=[4, 0, 5, 3, 12, 5, 3, 7, 2, 11] ... (210): b=[3, 1, 3, 4, 5, 7, 8, 6, 4, 0]\n for j in range(10): # (4): j=0 (6): j=1 ... (231): NO CHANGE\n wlist[i][j]=b[j] # (5): NO CHANGE (7): wlist ... (230): NO CHANGE\nfor i in range(10): # (233): i=0 (455): i=1 ... (2453): NO CHANGE\n for j in range(10): # (234): j=0 (256): j=1 ... (2452): NO CHANGE\n for k in range(10): # (235): k=0 (237): k=1 ... (2451): NO CHANGE\n wlist[i][k]=min(wlist[i][k],wlist[i][j]+wlist[j][k]) # (236): NO CHANGE (238): NO CHANGE ... (2450): NO CHANGE\nans=0 # (2454): ans=0\nfor _ in range(h): # (2455): _=0 (2473): _=1 ... (2509): NO CHANGE\n t=list(map(int,input().split())) # (2456): t=[-1, 5, 2, 6, 1] (2474): t=[2, 5, 4, 2, 1] (2492): t=[8, 9, 2, 6, 6]\n for i in t: # (2457): i=-1 (2460): i=5 ... (2508): NO CHANGE\n if i==-1 or i==1: # (2458): NO CHANGE (2461): NO CHANGE ... (2506): NO CHANGE\n continue # (2459): NO CHANGE (2471): NO CHANGE (2489): NO CHANGE\n else:\n ans+=wlist[i][1] # (2462): ans=2 (2465): ans=3 ... (2507): ans=14\nprint(ans)"], "anno_status": [false], "diff_content": " h,w=map(int,input().split())\n-wlist=[[0]*10 for _ in range(10)]\n-for i in range(10):\n- b=list(map(int,input().split()))\n- for j in range(10):\n- wlist[i][j]=b[j]\n+wlist=[list(map(int,input().split()))for _ in range(10)]\n for i in range(10):\n for j in range(10):\n for k in range(10):\n- wlist[i][k]=min(wlist[i][k],wlist[i][j]+wlist[j][k])\n+ wlist[j][k]=min(wlist[j][k],wlist[j][i]+wlist[i][k])\n ans=0\n for _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\n print(ans)\n", "FL_content": " h,w=map(int,input().split())\n-wlist=[[0]*10 for _ in range(10)]\n-for i in range(10):\n- b=list(map(int,input().split()))\n- for j in range(10):\n- wlist[i][j]=b[j]\n for i in range(10):\n for j in range(10):\n for k in range(10):\n- wlist[i][k]=min(wlist[i][k],wlist[i][j]+wlist[j][k])\n ans=0\n for _ in range(h):\n t=list(map(int,input().split()))\n for i in t:\n if i==-1 or i==1:\n continue\n else:\n ans+=wlist[i][1]\n print(ans)\n", "added_lines": 2, "removed_lines": 6, "code1_lines": 19 }, { "user_id": "u396391104", "problem_id": "p03970", "submission1_id": "s771540514", "submission2_id": "s798073754", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nT = \"CODEFESTIVAL2016\"\nans = 0\n\nfor i in range(len(S)):\n if S[i] == T[i]:\n ans += 1\n\nprint(ans)", "code2": "S = input()\nT = \"CODEFESTIVAL2016\"\nans = 0\n\nfor i in range(len(S)):\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": "1567788411", "date2": "1567788456", "bleu_score": "0.9770064524882032", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "DDOD6101L?VJTSEF\n", "actual_output": "0\n", "expected_output": "16\n\n", "anno_code": ["S = input() # (0): S=DDOD6101L?VJTSEF\nT = \"CODEFESTIVAL2016\" # (1): T=CODEFESTIVAL2016\nans = 0 # (2): ans=0\n\nfor i in range(len(S)): # (3): i=0 (5): i=1 ... (35): NO CHANGE\n if S[i] == T[i]: # (4): NO CHANGE (6): NO CHANGE ... (34): NO CHANGE\n ans += 1\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n T = \"CODEFESTIVAL2016\"\n ans = 0\n \n for i in range(len(S)):\n- if S[i] == T[i]:\n+ if S[i] != T[i]:\n ans += 1\n \n print(ans)\n", "FL_content": " S = input()\n T = \"CODEFESTIVAL2016\"\n ans = 0\n \n for i in range(len(S)):\n- if S[i] == T[i]:\n ans += 1\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u703890795", "problem_id": "p03970", "submission1_id": "s531556877", "submission2_id": "s774184842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nT = \"CODEFESTIVAL2016\"\nc = 0\nfor i in range(16):\n if S[i]==T[i]:\n c += 1\nprint(c)", "code2": "S = input()\nT = \"CODEFESTIVAL2016\"\nc = 0\nfor i in range(16):\n if S[i]!=T[i]:\n c += 1\nprint(c)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566969089", "date2": "1566969378", "bleu_score": "0.9736071380988617", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "DDOD6101LAVJTSEF\n", "actual_output": "0\n", "expected_output": "16\n\n", "anno_code": ["S = input() # (0): S=DDOD6101LAVJTSEF\nT = \"CODEFESTIVAL2016\" # (1): T=CODEFESTIVAL2016\nc = 0 # (2): c=0\nfor i in range(16): # (3): i=0 (5): i=1 ... (35): NO CHANGE\n if S[i]==T[i]: # (4): NO CHANGE (6): NO CHANGE ... (34): NO CHANGE\n c += 1\nprint(c)"], "anno_status": [true], "diff_content": " S = input()\n T = \"CODEFESTIVAL2016\"\n c = 0\n for i in range(16):\n- if S[i]==T[i]:\n+ if S[i]!=T[i]:\n c += 1\n print(c)\n", "FL_content": " S = input()\n T = \"CODEFESTIVAL2016\"\n c = 0\n for i in range(16):\n- if S[i]==T[i]:\n c += 1\n print(c)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u591779169", "problem_id": "p03970", "submission1_id": "s810367927", "submission2_id": "s613183690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nS = \"CODEFESTIVAL2016\"\ncount = 0\nfor i in range(15):\n if s[i] != S[i]:\n count+=1\nprint(count)", "code2": "s = input()\nS = \"CODEFESTIVAL2016\"\ncount = 0\nfor i in range(16):\n if s[i] != S[i]:\n count+=1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554061394", "date2": "1554061462", "bleu_score": "0.977822529062778", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "0DO2KACI6REFE1TV\n", "actual_output": "15\n", "expected_output": "16\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " s = input()\n S = \"CODEFESTIVAL2016\"\n count = 0\n-for i in range(15):\n+for i in range(16):\n if s[i] != S[i]:\n count+=1\n print(count)\n", "FL_content": " s = input()\n S = \"CODEFESTIVAL2016\"\n count = 0\n-for i in range(15):\n if s[i] != S[i]:\n count+=1\n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u936985471", "problem_id": "p03970", "submission1_id": "s479565829", "submission2_id": "s461405984", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=\"C0DEFESTIVAL2O16\"\ns=input()\nans=0\nfor i in range(len(a)):\n if a[i]!=s[i]:\n ans+=1\nprint(ans)", "code2": "a=\"CODEFESTIVAL2016\"\ns=input()\nans=0\nfor i in range(len(a)):\n if a[i]!=s[i]:\n ans+=1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573480899", "date2": "1573480965", "bleu_score": "0.9433297411633624", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 52, "total_score": 102, "input": "CT0EGER6IVAL2OD0\n", "actual_output": "7\n", "expected_output": "8\n\n", "anno_code": ["a=\"C0DEFESTIVAL2O16\" # (0): a=C0DEFESTIVAL2O16\ns=input() # (1): s=CT0EGER6IVAL2OD0\nans=0 # (2): ans=0\nfor i in range(len(a)): # (3): i=0 (5): i=1 ... (42): NO CHANGE\n if a[i]!=s[i]: # (4): NO CHANGE (6): NO CHANGE ... (40): NO CHANGE\n ans+=1 # (7): ans=1 (10): ans=2 ... (41): ans=7\nprint(ans)"], "anno_status": [true], "diff_content": "-a=\"C0DEFESTIVAL2O16\"\n+a=\"CODEFESTIVAL2016\"\n s=input()\n ans=0\n for i in range(len(a)):\n if a[i]!=s[i]:\n ans+=1\n print(ans)\n+\n", "FL_content": "-a=\"C0DEFESTIVAL2O16\"\n s=input()\n ans=0\n for i in range(len(a)):\n if a[i]!=s[i]:\n ans+=1\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u960080897", "problem_id": "p03970", "submission1_id": "s893784344", "submission2_id": "s357186244", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nt = \"CODEFESTIVAL2016\"\ncnt = 0\nfor i, z in zip(s, t):\n if s != z:\n cnt += 1\n \nprint(cnt)", "code2": "s = input()\nt = \"CODEFESTIVAL2016\"\ncnt = 0\nfor i, z in zip(s, t):\n if i != z:\n cnt += 1\n \nprint(cnt)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593391324", "date2": "1593391446", "bleu_score": "0.9782092189509323", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 52, "total_score": 102, "input": "QD02CEJE1TJ>VO6D\n", "actual_output": "16\n", "expected_output": "15\n\n", "anno_code": ["s = input() # (0): s=QD02CEJE1TJ>VO6D\nt = \"CODEFESTIVAL2016\" # (1): t=CODEFESTIVAL2016\ncnt = 0 # (2): cnt=0\nfor i, z in zip(s, t): # (3): i=Q, z=C (6): i=D, z=O ... (51): NO CHANGE\n if s != z: # (4): NO CHANGE (7): NO CHANGE ... (49): NO CHANGE\n cnt += 1 # (5): cnt=1 (8): cnt=2 ... (50): cnt=16\n \nprint(cnt)"], "anno_status": [true], "diff_content": " s = input()\n t = \"CODEFESTIVAL2016\"\n cnt = 0\n for i, z in zip(s, t):\n- if s != z:\n+ if i != z:\n cnt += 1\n \n print(cnt)\n", "FL_content": " s = input()\n t = \"CODEFESTIVAL2016\"\n cnt = 0\n for i, z in zip(s, t):\n- if s != z:\n cnt += 1\n \n print(cnt)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u333945892", "problem_id": "p03970", "submission1_id": "s656053524", "submission2_id": "s697407903", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S1 = input()\nS2 = \"CODEFESTIVAL2016\"\nans = 0\nfor i in range(16):\n if S1[i] == S2[i]:\n ans+=1\nprint(ans)\n ", "code2": "S1 = input()\nS2 = \"CODEFESTIVAL2016\"\nans = 0\nfor i in range(16):\n if S1[i] != S2[i]:\n ans+=1\nprint(ans)\n \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536110415", "date2": "1536110452", "bleu_score": "0.9678715417213165", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "3DO0JACI1RFFE7WV\n", "actual_output": "0\n", "expected_output": "16\n\n", "anno_code": ["S1 = input() # (0): S1=3DO0JACI1RFFE7WV\nS2 = \"CODEFESTIVAL2016\" # (1): S2=CODEFESTIVAL2016\nans = 0 # (2): ans=0\nfor i in range(16): # (3): i=0 (5): i=1 ... (35): NO CHANGE\n if S1[i] == S2[i]: # (4): NO CHANGE (6): NO CHANGE ... (34): NO CHANGE\n ans+=1\nprint(ans)\n "], "anno_status": [true], "diff_content": " S1 = input()\n S2 = \"CODEFESTIVAL2016\"\n ans = 0\n for i in range(16):\n- if S1[i] == S2[i]:\n+ if S1[i] != S2[i]:\n ans+=1\n print(ans)\n \n+\n", "FL_content": " S1 = input()\n S2 = \"CODEFESTIVAL2016\"\n ans = 0\n for i in range(16):\n- if S1[i] == S2[i]:\n ans+=1\n print(ans)\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u300637346", "problem_id": "p03970", "submission1_id": "s007636163", "submission2_id": "s358911312", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=list(input())\nt=list('CODEFESTIVAL2016')\ncount=0\nfor k in range(16):\n if s[k] == t[k]:\n count += 1\nprint(count)\n\n", "code2": "s=input()\nt='CODEFESTIVAL2016'\n\ncount=0\nfor num in range(len(s)):\n if s[num] != t[num]:\n count += 1\n\nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557547449", "date2": "1558889828", "bleu_score": "0.7479394888290664", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "VT0EGER6ICAL2OD0\n", "actual_output": "6\n", "expected_output": "10\n\n", "anno_code": ["s=list(input()) # (0): s=['V', 'T', '0', 'E', 'G', 'E', 'R', '6', 'I', 'C', 'A', 'L', '2', 'O', 'D', '0']\nt=list('CODEFESTIVAL2016') # (1): t=['C', 'O', 'D', 'E', 'F', 'E', 'S', 'T', 'I', 'V', 'A', 'L', '2', '0', '1', '6']\ncount=0 # (2): count=0\nfor k in range(16): # (3): k=0 (5): k=1 ... (41): NO CHANGE\n if s[k] == t[k]: # (4): NO CHANGE (6): NO CHANGE ... (40): NO CHANGE\n count += 1 # (11): count=1 (16): count=2 ... (34): count=6\nprint(count)\n\n"], "anno_status": [true], "diff_content": "-s=list(input())\n-t=list('CODEFESTIVAL2016')\n+s=input()\n+t='CODEFESTIVAL2016'\n+\n count=0\n-for k in range(16):\n- if s[k] == t[k]:\n+for num in range(len(s)):\n+ if s[num] != t[num]:\n count += 1\n-print(count)\n \n+print(count)\n \n", "FL_content": "-s=list(input())\n-t=list('CODEFESTIVAL2016')\n count=0\n-for k in range(16):\n- if s[k] == t[k]:\n count += 1\n-print(count)\n \n \n", "added_lines": 6, "removed_lines": 5, "code1_lines": 9 }, { "user_id": "u701318346", "problem_id": "p03970", "submission1_id": "s169677894", "submission2_id": "s766274247", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nA = 'CODEFESTIVAL2016'\nans = 0\nfor i in range(len(S)):\n if S[i] == A[i]:\n ans += 1\n\nprint(ans)\n", "code2": "S = input()\nA = 'CODEFESTIVAL2016'\nans = 0\nfor i in range(len(S)):\n if S[i] != A[i]:\n ans += 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561003977", "date2": "1561004026", "bleu_score": "0.9770064524882032", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "D62VTJ>ODJEC10DS\n", "actual_output": "1\n", "expected_output": "15\n\n", "anno_code": ["S = input() # (0): S=D62VTJ>ODJEC10DS\nA = 'CODEFESTIVAL2016' # (1): A=CODEFESTIVAL2016\nans = 0 # (2): ans=0\nfor i in range(len(S)): # (3): i=0 (5): i=1 ... (36): NO CHANGE\n if S[i] == A[i]: # (4): NO CHANGE (6): NO CHANGE ... (35): NO CHANGE\n ans += 1 # (31): ans=1\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " S = input()\n A = 'CODEFESTIVAL2016'\n ans = 0\n for i in range(len(S)):\n- if S[i] == A[i]:\n+ if S[i] != A[i]:\n ans += 1\n \n print(ans)\n \n", "FL_content": " S = input()\n A = 'CODEFESTIVAL2016'\n ans = 0\n for i in range(len(S)):\n- if S[i] == A[i]:\n ans += 1\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u859897687", "problem_id": "p03970", "submission1_id": "s488628806", "submission2_id": "s697620052", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=input()\nb='CODEFESTIVAL2016'\nans=0\nfor i in range(16):\n ans+=(a[i]==b[i])\nprint(ans)", "code2": "a=input()\nb='CODEFESTIVAL2016'\nans=0\nfor i in range(16):\n ans+=(a[i]!=b[i])\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553863150", "date2": "1553863173", "bleu_score": "0.9704907832745403", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "DD016SOEL>VTK2DF\n", "actual_output": "0\n", "expected_output": "16\n\n", "anno_code": ["a=input() # (0): a=DD016SOEL>VTK2DF\nb='CODEFESTIVAL2016' # (1): b=CODEFESTIVAL2016\nans=0 # (2): ans=0\nfor i in range(16): # (3): i=0 (5): i=1 ... (35): NO CHANGE\n ans+=(a[i]==b[i]) # (4): NO CHANGE (6): NO CHANGE ... (34): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " a=input()\n b='CODEFESTIVAL2016'\n ans=0\n for i in range(16):\n- ans+=(a[i]==b[i])\n+ ans+=(a[i]!=b[i])\n print(ans)\n", "FL_content": " a=input()\n b='CODEFESTIVAL2016'\n ans=0\n for i in range(16):\n- ans+=(a[i]==b[i])\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u363836311", "problem_id": "p03970", "submission1_id": "s185874266", "submission2_id": "s234616880", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=list(str(input().split()))\nG='CODEFESTIVAL2016'\nt=0\nfor i in range(16):\n if S[i]!=G[i]:\n t+=1\nprint(t)", "code2": "S=list(str(input()))\nG='CODEFESTIVAL2016'\nt=0\nfor i in range(16):\n if S[i]!=G[i]:\n t+=1\nprint(t)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586213793", "date2": "1586213912", "bleu_score": "0.9236617781827567", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 40, "total_score": 102, "input": "107DFERV3CALWODI\n", "actual_output": "15\n", "expected_output": "12\n\n", "anno_code": ["S=list(str(input().split())) # (0): S=['[', \"'\", '1', '0', '7', 'D', 'F', 'E', 'R', 'V', '3', 'C', 'A', 'L', 'W', 'O', 'D', 'I', \"'\", ']']\nG='CODEFESTIVAL2016' # (1): G=CODEFESTIVAL2016\nt=0 # (2): t=0\nfor i in range(16): # (3): i=0 (6): i=1 ... (50): NO CHANGE\n if S[i]!=G[i]: # (4): NO CHANGE (7): NO CHANGE ... (48): NO CHANGE\n t+=1 # (5): t=1 (8): t=2 ... (49): t=15\nprint(t)"], "anno_status": [true], "diff_content": "-S=list(str(input().split()))\n+S=list(str(input()))\n G='CODEFESTIVAL2016'\n t=0\n for i in range(16):\n if S[i]!=G[i]:\n t+=1\n print(t)\n+\n", "FL_content": "-S=list(str(input().split()))\n G='CODEFESTIVAL2016'\n t=0\n for i in range(16):\n if S[i]!=G[i]:\n t+=1\n print(t)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u941438707", "problem_id": "p03970", "submission1_id": "s271987540", "submission2_id": "s074934404", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input();print(sum(\"CODEFESTIVAL2016\"[i]==s[i] for i in range(16)))", "code2": "s=input();print(sum(\"CODEFESTIVAL2016\"[i]!=s[i] for i in range(16)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559594653", "date2": "1559594690", "bleu_score": "0.9619541754104973", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "FD2KTV>KDOS601DE\n", "actual_output": "0\n", "expected_output": "16\n\n", "anno_code": ["s=input();print(sum(\"CODEFESTIVAL2016\"[i]==s[i] for i in range(16)))"], "anno_status": [true], "diff_content": "-s=input();print(sum(\"CODEFESTIVAL2016\"[i]==s[i] for i in range(16)))\n+s=input();print(sum(\"CODEFESTIVAL2016\"[i]!=s[i] for i in range(16)))\n", "FL_content": "-s=input();print(sum(\"CODEFESTIVAL2016\"[i]==s[i] for i in range(16)))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u657512990", "problem_id": "p03970", "submission1_id": "s101133418", "submission2_id": "s159362998", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ns=input()\nt='CODEFESTIVAL2016'\nans=0\nfor i in range(16):\n if t[i]==s[i]:ans+=1\nprint(ans)", "code2": "\ns=input()\nt='CODEFESTIVAL2016'\nans=0\nfor i in range(16):\n if t[i]!=s[i]:ans+=1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570258083", "date2": "1570258124", "bleu_score": "0.9724430921855302", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "VT0EGER6ICAL2OD0\n", "actual_output": "6\n", "expected_output": "10\n\n", "anno_code": ["\ns=input() # (0): s=VT0EGER6ICAL2OD0\nt='CODEFESTIVAL2016' # (1): t=CODEFESTIVAL2016\nans=0 # (2): ans=0\nfor i in range(16): # (3): i=0 (5): i=1 ... (35): NO CHANGE\n if t[i]==s[i]:ans+=1 # (4): NO CHANGE (6): NO CHANGE ... (34): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " \n s=input()\n t='CODEFESTIVAL2016'\n ans=0\n for i in range(16):\n- if t[i]==s[i]:ans+=1\n+ if t[i]!=s[i]:ans+=1\n print(ans)\n", "FL_content": " \n s=input()\n t='CODEFESTIVAL2016'\n ans=0\n for i in range(16):\n- if t[i]==s[i]:ans+=1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u092278825", "problem_id": "p03970", "submission1_id": "s495087607", "submission2_id": "s844079632", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\ns = \"CODEFESTIVAL2016\"\nc = 0\nfor i in range (15):\n if S[i]!= s[i]:\n c += 1\n \nprint(c)", "code2": "S = input()\ns = \"CODEFESTIVAL2016\"\nc = 0\nfor i in range (16):\n if S[i]!= s[i]:\n c += 1\n \nprint(c)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565627766", "date2": "1565627942", "bleu_score": "0.9754238144469", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "107DFDRV3C@LWOEI\n", "actual_output": "13\n", "expected_output": "14\n\n", "anno_code": ["S = input() # (0): S=107DFDRV3C@LWOEI\ns = \"CODEFESTIVAL2016\" # (1): s=CODEFESTIVAL2016\nc = 0 # (2): c=0\nfor i in range (15): # (3): i=0 (6): i=1 ... (46): NO CHANGE\n if S[i]!= s[i]: # (4): NO CHANGE (7): NO CHANGE ... (44): NO CHANGE\n c += 1 # (5): c=1 (8): c=2 ... (45): c=13\n \nprint(c)"], "anno_status": [true], "diff_content": " S = input()\n s = \"CODEFESTIVAL2016\"\n c = 0\n-for i in range (15):\n+for i in range (16):\n if S[i]!= s[i]:\n c += 1\n \n print(c)\n", "FL_content": " S = input()\n s = \"CODEFESTIVAL2016\"\n c = 0\n-for i in range (15):\n if S[i]!= s[i]:\n c += 1\n \n print(c)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u652656291", "problem_id": "p03970", "submission1_id": "s484607389", "submission2_id": "s084659757", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nT = 'CODEFESTIVAL2016'\nans = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n ans += 1\nprint(ans)", "code2": "S = input()\nT = 'CODEFESTIVAL2016'\nans = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n ans += 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588531452", "date2": "1588531524", "bleu_score": "0.9675738086414928", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "VW1EFFR7ICAJ0OD3\n", "actual_output": "4\n", "expected_output": "12\n\n", "anno_code": ["S = input() # (0): S=VW1EFFR7ICAJ0OD3\nT = 'CODEFESTIVAL2016' # (1): T=CODEFESTIVAL2016\nans = 0 # (2): ans=0\nfor i in range(len(S)): # (3): i=0 (5): i=1 ... (39): NO CHANGE\n if S[i] == T[i]: # (4): NO CHANGE (6): NO CHANGE ... (38): NO CHANGE\n ans += 1 # (11): ans=1 (14): ans=2 ... (28): ans=4\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n T = 'CODEFESTIVAL2016'\n ans = 0\n for i in range(len(S)):\n- if S[i] == T[i]:\n+ if S[i] != T[i]:\n ans += 1\n print(ans)\n+\n", "FL_content": " S = input()\n T = 'CODEFESTIVAL2016'\n ans = 0\n for i in range(len(S)):\n- if S[i] == T[i]:\n ans += 1\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u965259973", "problem_id": "p03970", "submission1_id": "s754060723", "submission2_id": "s387866167", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def string_trnase(s):\n answer = 'CODEFESTIVAL2016'\n iters = 0\n s = list(s)\n for i in range(0, 16):\n if s[i] != answer[i]:\n iters += 1\n print(iters)\n\n\nprint('Enter a string: ')\nstring_trnase(input())", "code2": "def string_trnase(s):\n answer = 'CODEFESTIVAL2016'\n iters = 0\n s = list(s)\n for i in range(0, 16):\n if s[i] != answer[i]:\n iters += 1\n print(iters)\n\n\n\nstring_trnase(input())\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1476121218", "date2": "1476122516", "bleu_score": "0.880728864002074", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "DD006SOEL>VTK2DF\n", "actual_output": "Enter a string: \n16\n", "expected_output": "16\n\n", "anno_code": ["def string_trnase(s): # (0): string_trnase=\n answer = 'CODEFESTIVAL2016' # (3): answer=CODEFESTIVAL2016\n iters = 0 # (4): iters=0\n s = list(s) # (5): s=['D', 'D', '0', '0', '6', 'S', 'O', 'E', 'L', '>', 'V', 'T', 'K', '2', 'D', 'F']\n for i in range(0, 16): # (6): i=0 (9): i=1 ... (54): NO CHANGE\n if s[i] != answer[i]: # (7): NO CHANGE (10): NO CHANGE ... (52): NO CHANGE\n iters += 1 # (8): iters=1 (11): iters=2 ... (53): iters=16\n print(iters)\n\n\nprint('Enter a string: ') # (1): NO CHANGE\nstring_trnase(input()) # (2): s=DD006SOEL>VTK2DF\n"], "anno_status": [true], "diff_content": " def string_trnase(s):\n answer = 'CODEFESTIVAL2016'\n iters = 0\n s = list(s)\n for i in range(0, 16):\n if s[i] != answer[i]:\n iters += 1\n print(iters)\n \n \n-print('Enter a string: ')\n+\n string_trnase(input())\n+\n", "FL_content": " def string_trnase(s):\n answer = 'CODEFESTIVAL2016'\n iters = 0\n s = list(s)\n for i in range(0, 16):\n if s[i] != answer[i]:\n iters += 1\n print(iters)\n \n \n-print('Enter a string: ')\n string_trnase(input())\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u701318346", "problem_id": "p03970", "submission1_id": "s248377239", "submission2_id": "s766274247", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nA = 'C0DEFESTIVAL2O16'\nans = 0\nfor i in range(len(S)):\n if S[i] == A[i]:\n ans += 1\n\nprint(ans)", "code2": "S = input()\nA = 'CODEFESTIVAL2016'\nans = 0\nfor i in range(len(S)):\n if S[i] != A[i]:\n ans += 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561003879", "date2": "1561004026", "bleu_score": "0.9257935511949126", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ED01CEODJ>KTV26S\n", "actual_output": "1\n", "expected_output": "15\n\n", "anno_code": ["S = input() # (0): S=ED01CEODJ>KTV26S\nA = 'C0DEFESTIVAL2O16' # (1): A=C0DEFESTIVAL2O16\nans = 0 # (2): ans=0\nfor i in range(len(S)): # (3): i=0 (5): i=1 ... (36): NO CHANGE\n if S[i] == A[i]: # (4): NO CHANGE (6): NO CHANGE ... (35): NO CHANGE\n ans += 1 # (15): ans=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n-A = 'C0DEFESTIVAL2O16'\n+A = 'CODEFESTIVAL2016'\n ans = 0\n for i in range(len(S)):\n- if S[i] == A[i]:\n+ if S[i] != A[i]:\n ans += 1\n \n print(ans)\n+\n", "FL_content": " S = input()\n-A = 'C0DEFESTIVAL2O16'\n ans = 0\n for i in range(len(S)):\n- if S[i] == A[i]:\n ans += 1\n \n print(ans)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u108617242", "problem_id": "p03970", "submission1_id": "s789574930", "submission2_id": "s378807187", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\ncount = 0;\nanser = \"CODEFESTIVAL2016\"\nfor i in range(0,15):\n\tif not s[i] == anser[i]:\n\t\tcount+=1\nprint(count)\n", "code2": "s = input()\ncount = 0;\nanser = \"CODEFESTIVAL2016\"\nfor i in range(0,16):\n\tif not s[i] == anser[i]:\n\t\tcount+=1\nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1476193950", "date2": "1476194048", "bleu_score": "0.9791194015811121", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "FC2KTV>KDOS610DE\n", "actual_output": "14\n", "expected_output": "15\n\n", "anno_code": ["s = input() # (0): s=FC2KTV>KDOS610DE\ncount = 0; # (1): count=0\nanser = \"CODEFESTIVAL2016\" # (2): anser=CODEFESTIVAL2016\nfor i in range(0,15): # (3): i=0 (6): i=1 ... (47): NO CHANGE\n\tif not s[i] == anser[i]: # (4): NO CHANGE (7): NO CHANGE ... (45): NO CHANGE\n\t\tcount+=1 # (5): count=1 (8): count=2 ... (46): count=14\nprint(count)\n"], "anno_status": [true], "diff_content": " s = input()\n count = 0;\n anser = \"CODEFESTIVAL2016\"\n-for i in range(0,15):\n+for i in range(0,16):\n \tif not s[i] == anser[i]:\n \t\tcount+=1\n print(count)\n \n", "FL_content": " s = input()\n count = 0;\n anser = \"CODEFESTIVAL2016\"\n-for i in range(0,15):\n \tif not s[i] == anser[i]:\n \t\tcount+=1\n print(count)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u391731808", "problem_id": "p03970", "submission1_id": "s020690795", "submission2_id": "s827368464", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\nprint(sum(s==\"CODEFESTIVAL2016\"[i] for i,s in enumerate(S)))", "code2": "S=input()\nprint(sum(s!=\"CODEFESTIVAL2016\"[i] for i,s in enumerate(S)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567126141", "date2": "1567126183", "bleu_score": "0.9630786123683069", "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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 102, "input": "DDOC6101LAVITSEF\n", "actual_output": "0\n", "expected_output": "16\n\n", "anno_code": ["S=input() # (0): S=DDOC6101LAVITSEF\nprint(sum(s==\"CODEFESTIVAL2016\"[i] for i,s in enumerate(S)))"], "anno_status": [true], "diff_content": " S=input()\n-print(sum(s==\"CODEFESTIVAL2016\"[i] for i,s in enumerate(S)))\n+print(sum(s!=\"CODEFESTIVAL2016\"[i] for i,s in enumerate(S)))\n", "FL_content": " S=input()\n-print(sum(s==\"CODEFESTIVAL2016\"[i] for i,s in enumerate(S)))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u062691227", "problem_id": "p03970", "submission1_id": "s648631440", "submission2_id": "s704950614", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nsum(a!=b for a, b in zip(s, 'CODEFESTIVAL2016'))", "code2": "s = input()\nprint(sum(a!=b for a, b in zip(s, 'CODEFESTIVAL2016')))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592898620", "date2": "1592898660", "bleu_score": "0.8696855224291807", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "DD016SOEK>VTK2DF\n", "actual_output": "", "expected_output": "16\n\n", "anno_code": ["s = input() # (0): s=DD016SOEK>VTK2DF\nsum(a!=b for a, b in zip(s, 'CODEFESTIVAL2016'))"], "anno_status": [true], "diff_content": " s = input()\n-sum(a!=b for a, b in zip(s, 'CODEFESTIVAL2016'))\n+print(sum(a!=b for a, b in zip(s, 'CODEFESTIVAL2016')))\n", "FL_content": " s = input()\n-sum(a!=b for a, b in zip(s, 'CODEFESTIVAL2016'))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u244416620", "problem_id": "p02730", "submission1_id": "s203749346", "submission2_id": "s188210191", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nS = input()\n\ndef is_kaibun(s):\n l = len(s)\n print('former', s[:int(l/2)])\n print('latter', s[:-(int(l/2))-1:-1])\n if s[:int(l/2)] == s[:-(int(l/2))-1:-1]:\n return True\n else:\n return False\n\nif is_kaibun(S):\n if is_kaibun(S[:int((len(S)-1)/2)]):\n if is_kaibun(S[int((len(S)+3)/2)-1:]):\n print('Yes')\n exit()\nprint('No')", "code2": "\nS = input()\n\ndef is_kaibun(s):\n l = len(s)\n \n \n if s[:int(l/2)] == s[:-(int(l/2))-1:-1]:\n return True\n else:\n return False\n\nif is_kaibun(S):\n if is_kaibun(S[:int((len(S)-1)/2)]):\n if is_kaibun(S[int((len(S)+3)/2)-1:]):\n print('Yes')\n exit()\nprint('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596395804", "date2": "1596395866", "bleu_score": "0.8000552422621922", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ikbs`a_\n", "actual_output": "former ikb\nlatter _a`\nNo\n", "expected_output": "No\n\n", "anno_code": ["\n\nS = input() # (0): S=ikbs`a_\n\ndef is_kaibun(s): # (1): is_kaibun=\n l = len(s) # (3): l=7\n print('former', s[:int(l/2)]) # (4): NO CHANGE\n print('latter', s[:-(int(l/2))-1:-1]) # (5): NO CHANGE\n if s[:int(l/2)] == s[:-(int(l/2))-1:-1]: # (6): S=ikbs`a_, is_kaibun=\n return True\n else:\n return False\n\nif is_kaibun(S): # (2): s=ikbs`a_\n if is_kaibun(S[:int((len(S)-1)/2)]):\n if is_kaibun(S[int((len(S)+3)/2)-1:]):\n print('Yes')\n exit()\nprint('No')"], "anno_status": [true], "diff_content": " \n-\n S = input()\n \n def is_kaibun(s):\n l = len(s)\n- print('former', s[:int(l/2)])\n- print('latter', s[:-(int(l/2))-1:-1])\n+ \n+ \n if s[:int(l/2)] == s[:-(int(l/2))-1:-1]:\n return True\n else:\n return False\n \n if is_kaibun(S):\n if is_kaibun(S[:int((len(S)-1)/2)]):\n if is_kaibun(S[int((len(S)+3)/2)-1:]):\n print('Yes')\n exit()\n print('No')\n", "FL_content": " \n-\n S = input()\n \n def is_kaibun(s):\n l = len(s)\n- print('former', s[:int(l/2)])\n- print('latter', s[:-(int(l/2))-1:-1])\n if s[:int(l/2)] == s[:-(int(l/2))-1:-1]:\n return True\n else:\n return False\n \n if is_kaibun(S):\n if is_kaibun(S[:int((len(S)-1)/2)]):\n if is_kaibun(S[int((len(S)+3)/2)-1:]):\n print('Yes')\n exit()\n print('No')\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u868701750", "problem_id": "p02730", "submission1_id": "s808646625", "submission2_id": "s074718388", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\n\ncond_1 = S[:int((N-1)/2)]\ncond_1_r = cond_1[::-1]\n\nif cond_1 != cond_1_r:\n print('No')\n exit(0)\n\ncond_2 = S[int((N+3)/2-1):]\ncond_2_r = cond_2[::-1]\n\nif cond_2 != cond_2_r:\n print('No')\n exit(0)\n\nprint('Yes')", "code2": "S = input()\nN = len(S)\n\nif S != S[::-1]:\n print('No')\n exit(0)\n\n\ncond_1 = S[:int((N-1)/2)]\ncond_1_r = cond_1[::-1]\n\nif cond_1 != cond_1_r:\n print('No')\n exit(0)\n\ncond_2 = S[int((N+3)/2-1):]\ncond_2_r = cond_2[::-1]\n\nif cond_2 != cond_2_r:\n print('No')\n exit(0)\n\nprint('Yes')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585010061", "date2": "1585010609", "bleu_score": "0.8338976628226747", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "llvee\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["S = input() # (0): S=llvee\nN = len(S) # (1): N=5\n\ncond_1 = S[:int((N-1)/2)] # (2): cond_1=ll\ncond_1_r = cond_1[::-1] # (3): cond_1_r=ll\n\nif cond_1 != cond_1_r: # (4): NO CHANGE\n print('No')\n exit(0)\n\ncond_2 = S[int((N+3)/2-1):] # (5): cond_2=ee\ncond_2_r = cond_2[::-1] # (6): cond_2_r=ee\n\nif cond_2 != cond_2_r: # (7): NO CHANGE\n print('No')\n exit(0)\n\nprint('Yes')"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n \n+if S != S[::-1]:\n+ print('No')\n+ exit(0)\n+\n+\n cond_1 = S[:int((N-1)/2)]\n cond_1_r = cond_1[::-1]\n \n if cond_1 != cond_1_r:\n print('No')\n exit(0)\n \n cond_2 = S[int((N+3)/2-1):]\n cond_2_r = cond_2[::-1]\n \n if cond_2 != cond_2_r:\n print('No')\n exit(0)\n \n print('Yes')\n+\n", "FL_content": " S = input()\n N = len(S)\n \n cond_1 = S[:int((N-1)/2)]\n cond_1_r = cond_1[::-1]\n \n if cond_1 != cond_1_r:\n print('No')\n exit(0)\n \n cond_2 = S[int((N+3)/2-1):]\n cond_2_r = cond_2[::-1]\n \n if cond_2 != cond_2_r:\n print('No')\n exit(0)\n \n print('Yes')\n", "added_lines": 6, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u343977188", "problem_id": "p02730", "submission1_id": "s169990183", "submission2_id": "s414958619", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=str(input())\nN=len(S)\n\nS1 = S[0:int((N-1)/2)]\nS2 = S[int((N+3)/2)-1:N]\n\nif S1==S1[::-1] and S2==S2[::-1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "S=str(input())\nN=len(S)\n\nS1 = S[0:int((N-1)/2)]\nS2 = S[int((N+3)/2)-1:N]\n\nif S==S[::-1] and S1==S1[::-1] and S2==S2[::-1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586398953", "date2": "1586399159", "bleu_score": "0.9019022644611459", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "ajas`k`\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["S=str(input()) # (0): S=ajas`k`\nN=len(S) # (1): N=7\n\nS1 = S[0:int((N-1)/2)] # (2): S1=aja\nS2 = S[int((N+3)/2)-1:N] # (3): S2=`k`\n\nif S1==S1[::-1] and S2==S2[::-1]: # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " S=str(input())\n N=len(S)\n \n S1 = S[0:int((N-1)/2)]\n S2 = S[int((N+3)/2)-1:N]\n \n-if S1==S1[::-1] and S2==S2[::-1]:\n+if S==S[::-1] and S1==S1[::-1] and S2==S2[::-1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " S=str(input())\n N=len(S)\n \n S1 = S[0:int((N-1)/2)]\n S2 = S[int((N+3)/2)-1:N]\n \n-if S1==S1[::-1] and S2==S2[::-1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u607074939", "problem_id": "p02730", "submission1_id": "s823065914", "submission2_id": "s817854342", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(str(input()))\nn = len(s)\nN = int((n-1)/2)\nM = int((n+3)/2)\nl = []\nm = []\nfor i in range(N):\n l.append(s[i])\nfor i in range (M-1,N):\n m.append(s[i])\na = ''.join(l)\nb = ''.join(m)\nl.reverse()\nm.reverse()\nA = ''.join(l)\nB = ''.join(m)\nif (a==A and b==B):\n print('Yes')\nelse:\n print('No')", "code2": "s = list(str(input()))\n\nn = len(s)\nN = int((n-1)/2)\nM = int((n+3)/2)\n\nl = []\nm = []\n\nfor i in range(N):\n l.append(s[i])\n \nfor i in range (M-1,n):\n m.append(s[i])\n \na = ''.join(l)\nl.reverse()\nA = ''.join(l)\n\nb = ''.join(m)\nm.reverse()\nB = ''.join(m)\n\nt = s\nt.reverse()\nx = ''.join(s)\ny = ''.join(t)\n\nif (a==A and b==B and a == b):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584926739", "date2": "1584930658", "bleu_score": "0.7749621237038367", "code1_test_status": [0, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 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, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "fpfr`ep\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["s = list(str(input())) # (0): s=['f', 'p', 'f', 'r', '`', 'e', 'p']\nn = len(s) # (1): n=7\nN = int((n-1)/2) # (2): N=3\nM = int((n+3)/2) # (3): M=5\nl = [] # (4): l=[]\nm = [] # (5): m=[]\nfor i in range(N): # (6): i=0 (8): i=1 ... (12): NO CHANGE\n l.append(s[i]) # (7): l=['f'] (9): l=['f', 'p'] (11): l=['f', 'p', 'f']\nfor i in range (M-1,N): # (13): NO CHANGE\n m.append(s[i])\na = ''.join(l) # (14): a=fpf\nb = ''.join(m) # (15): b=\nl.reverse() # (16): NO CHANGE\nm.reverse() # (17): NO CHANGE\nA = ''.join(l) # (18): A=fpf\nB = ''.join(m) # (19): B=\nif (a==A and b==B): # (20): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " s = list(str(input()))\n+\n n = len(s)\n N = int((n-1)/2)\n M = int((n+3)/2)\n+\n l = []\n m = []\n+\n for i in range(N):\n l.append(s[i])\n-for i in range (M-1,N):\n+ \n+for i in range (M-1,n):\n m.append(s[i])\n+ \n a = ''.join(l)\n-b = ''.join(m)\n l.reverse()\n-m.reverse()\n A = ''.join(l)\n+\n+b = ''.join(m)\n+m.reverse()\n B = ''.join(m)\n-if (a==A and b==B):\n+\n+t = s\n+t.reverse()\n+x = ''.join(s)\n+y = ''.join(t)\n+\n+if (a==A and b==B and a == b):\n print('Yes')\n else:\n print('No')\n", "FL_content": " s = list(str(input()))\n n = len(s)\n N = int((n-1)/2)\n M = int((n+3)/2)\n l = []\n m = []\n for i in range(N):\n l.append(s[i])\n-for i in range (M-1,N):\n m.append(s[i])\n a = ''.join(l)\n-b = ''.join(m)\n l.reverse()\n-m.reverse()\n A = ''.join(l)\n B = ''.join(m)\n-if (a==A and b==B):\n print('Yes')\n else:\n print('No')\n", "added_lines": 16, "removed_lines": 4, "code1_lines": 20 }, { "user_id": "u337751290", "problem_id": "p02730", "submission1_id": "s282366198", "submission2_id": "s556521345", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef main():\n s = input()\n if len(s) % 2 == 0:\n print(\"No\")\n return\n N = int(len(s))\n \n s1 = s[0:int((N-1)/2)]\n s2 = s[int((N+1)/2):N]\n\n \n \n\n i = 0\n j = int((N - 1) / 2) - 1\n \n while True:\n if i > j:\n break\n if s1[i] != s1[j]:\n print(\"No\")\n return\n i += 1\n j -= 1\n\n i = 0\n j = int((N - 1) / 2) - 1\n while True:\n if i > j:\n break\n if s2[i] != s2[j]:\n \n return\n i += 1\n j -= 1\n\n\n print(\"Yes\")\n return\n\n\nif __name__ == '__main__':\n main()", "code2": "\ndef main():\n s = input()\n sr = s[::-1]\n\n N = int(len(s))\n s1 = s[:int((N-1)/2)]\n s1r = s1[::-1]\n s2 = s[int((N+1)/2):]\n s2r = s2[::-1]\n\n \n \n \n \n \n\n for i in range(len(s)-1):\n if s[i] != sr[i]:\n print(\"No\")\n return\n\n for i in range(len(s1)-1):\n if s1[i] != s1r[i]:\n print(\"No\")\n return\n\n for i in range(len(s2)-1):\n if s2[i] != s2[i]:\n print(\"No\")\n return\n\n print(\"Yes\")\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584927292", "date2": "1584930611", "bleu_score": "0.6542737089426455", "code1_test_status": [0, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 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, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "llvee\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["\ndef main(): # (0): main=\n s = input()\n if len(s) % 2 == 0:\n print(\"No\")\n return\n N = int(len(s))\n \n s1 = s[0:int((N-1)/2)]\n s2 = s[int((N+1)/2):N]\n\n \n \n\n i = 0\n j = int((N - 1) / 2) - 1\n \n while True:\n if i > j:\n break\n if s1[i] != s1[j]:\n print(\"No\")\n return\n i += 1\n j -= 1\n\n i = 0\n j = int((N - 1) / 2) - 1\n while True:\n if i > j:\n break\n if s2[i] != s2[j]:\n \n return\n i += 1\n j -= 1\n\n\n print(\"Yes\")\n return\n\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n def main():\n s = input()\n- if len(s) % 2 == 0:\n- print(\"No\")\n- return\n+ sr = s[::-1]\n+\n N = int(len(s))\n- \n- s1 = s[0:int((N-1)/2)]\n- s2 = s[int((N+1)/2):N]\n+ s1 = s[:int((N-1)/2)]\n+ s1r = s1[::-1]\n+ s2 = s[int((N+1)/2):]\n+ s2r = s2[::-1]\n \n \n \n-\n- i = 0\n- j = int((N - 1) / 2) - 1\n \n- while True:\n- if i > j:\n- break\n- if s1[i] != s1[j]:\n+ \n+ \n+\n+ for i in range(len(s)-1):\n+ if s[i] != sr[i]:\n print(\"No\")\n return\n- i += 1\n- j -= 1\n-\n- i = 0\n- j = int((N - 1) / 2) - 1\n- while True:\n- if i > j:\n- break\n- if s2[i] != s2[j]:\n- \n+\n+ for i in range(len(s1)-1):\n+ if s1[i] != s1r[i]:\n+ print(\"No\")\n return\n- i += 1\n- j -= 1\n \n+ for i in range(len(s2)-1):\n+ if s2[i] != s2[i]:\n+ print(\"No\")\n+ return\n \n print(\"Yes\")\n- return\n \n \n if __name__ == '__main__':\n main()\n", "FL_content": " \n def main():\n s = input()\n- if len(s) % 2 == 0:\n- print(\"No\")\n- return\n N = int(len(s))\n- \n- s1 = s[0:int((N-1)/2)]\n- s2 = s[int((N+1)/2):N]\n \n \n \n-\n- i = 0\n- j = int((N - 1) / 2) - 1\n \n- while True:\n- if i > j:\n- break\n- if s1[i] != s1[j]:\n print(\"No\")\n return\n- i += 1\n- j -= 1\n-\n- i = 0\n- j = int((N - 1) / 2) - 1\n- while True:\n- if i > j:\n- break\n- if s2[i] != s2[j]:\n- \n return\n- i += 1\n- j -= 1\n \n \n print(\"Yes\")\n- return\n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 19, "removed_lines": 26, "code1_lines": 44 }, { "user_id": "u285497176", "problem_id": "p02730", "submission1_id": "s256705340", "submission2_id": "s101929859", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s = input()\n s1 = s[:int((len(s)-1)/2)]\n s2 = s[int((len(s)+3)/2-1):]\n rs1 = s1[::-1]\n rs2 = s2[::-1]\n\n if s1 == rs1 and s2 == rs2:\n print(\"Yes\")\n else:\n print(\"No\")\n \n return\n \nmain()\n", "code2": "def main():\n s = input()\n s1 = s[:int((len(s)-1)/2)]\n s2 = s[int((len(s)+3)/2-1):]\n rs = s[::-1]\n rs1 = s1[::-1]\n rs2 = s2[::-1]\n\n\n if s1 == rs1 and s2 == rs2 and s == rs:\n print(\"Yes\")\n else:\n print(\"No\")\n \n return\n \nmain()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597432609", "date2": "1597432845", "bleu_score": "0.8825804374154195", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "`k`saja\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["def main(): # (0): main=\n s = input() # (2): s=`k`saja\n s1 = s[:int((len(s)-1)/2)] # (3): s1=`k`\n s2 = s[int((len(s)+3)/2-1):] # (4): s2=aja\n rs1 = s1[::-1] # (5): rs1=`k`\n rs2 = s2[::-1] # (6): rs2=aja\n\n if s1 == rs1 and s2 == rs2: # (7): NO CHANGE\n print(\"Yes\") # (8): NO CHANGE\n else:\n print(\"No\")\n \n return\n \nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n s = input()\n s1 = s[:int((len(s)-1)/2)]\n s2 = s[int((len(s)+3)/2-1):]\n+ rs = s[::-1]\n rs1 = s1[::-1]\n rs2 = s2[::-1]\n \n- if s1 == rs1 and s2 == rs2:\n+\n+ if s1 == rs1 and s2 == rs2 and s == rs:\n print(\"Yes\")\n else:\n print(\"No\")\n \n return\n \n main()\n \n", "FL_content": " def main():\n s = input()\n s1 = s[:int((len(s)-1)/2)]\n s2 = s[int((len(s)+3)/2-1):]\n rs1 = s1[::-1]\n rs2 = s2[::-1]\n \n- if s1 == rs1 and s2 == rs2:\n print(\"Yes\")\n else:\n print(\"No\")\n \n return\n \n main()\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u054514819", "problem_id": "p02730", "submission1_id": "s707271416", "submission2_id": "s520111838", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\ndef check(s):\n return s[:int((len(s)-1)/2+1)]==s[int((len(s)-1)/2):][::-1]\nif check(S) and check(S[:int((len(S)-1)/2+1)]) and check(S[int((len(S)+3)/2):]):\n print('Yes')\nelse:\n print('No')", "code2": "S = input()\n\ndef check(s):\n return s==s[::-1]\n\nif check(S) and check(S[:int((len(S)-1)/2)]) and check(S[int((len(S)+3)/2-1):]):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584925997", "date2": "1584926534", "bleu_score": "0.7403713613778232", "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, 0, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "akasaka\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["S = input() # (0): S=akasaka\ndef check(s): # (1): check=\n return s[:int((len(s)-1)/2+1)]==s[int((len(s)-1)/2):][::-1]\nif check(S) and check(S[:int((len(S)-1)/2+1)]) and check(S[int((len(S)+3)/2):]): # (2): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " S = input()\n+\n def check(s):\n- return s[:int((len(s)-1)/2+1)]==s[int((len(s)-1)/2):][::-1]\n-if check(S) and check(S[:int((len(S)-1)/2+1)]) and check(S[int((len(S)+3)/2):]):\n+ return s==s[::-1]\n+\n+if check(S) and check(S[:int((len(S)-1)/2)]) and check(S[int((len(S)+3)/2-1):]):\n print('Yes')\n else:\n print('No')\n", "FL_content": " S = input()\n def check(s):\n- return s[:int((len(s)-1)/2+1)]==s[int((len(s)-1)/2):][::-1]\n-if check(S) and check(S[:int((len(S)-1)/2+1)]) and check(S[int((len(S)+3)/2):]):\n print('Yes')\n else:\n print('No')\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u240249402", "problem_id": "p02730", "submission1_id": "s449534327", "submission2_id": "s737196327", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=list(input())\nn=len(s)\nzenhan=s[0:int((n-1)/2)]\nkouhan=s[int((n+3)/2-1):n]\nprint(zenhan)\nprint(kouhan)\nprint(zenhan[::-1])\nprint(kouhan[::-1])\nif s==s[::-1] and zenhan==zenhan[::-1] and kouhan==kouhan[::-1]:\n print('Yes')\nelse:\n print('No')\n", "code2": "s=list(input())\nn=len(s)\nzenhan=s[0:int((n-1)/2)]\nkouhan=s[int((n+3)/2-1):n]\nif s==s[::-1] and zenhan==zenhan[::-1] and kouhan==kouhan[::-1]:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589657636", "date2": "1589657686", "bleu_score": "0.6780707365847203", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "epfs`ep\n", "actual_output": "['e', 'p', 'f']\n['`', 'e', 'p']\n['f', 'p', 'e']\n['p', 'e', '`']\nNo\n", "expected_output": "No\n\n", "anno_code": ["s=list(input()) # (0): s=['e', 'p', 'f', 's', '`', 'e', 'p']\nn=len(s) # (1): n=7\nzenhan=s[0:int((n-1)/2)] # (2): zenhan=['e', 'p', 'f']\nkouhan=s[int((n+3)/2-1):n] # (3): kouhan=['`', 'e', 'p']\nprint(zenhan) # (4): NO CHANGE\nprint(kouhan) # (5): NO CHANGE\nprint(zenhan[::-1]) # (6): NO CHANGE\nprint(kouhan[::-1]) # (7): NO CHANGE\nif s==s[::-1] and zenhan==zenhan[::-1] and kouhan==kouhan[::-1]: # (8): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " s=list(input())\n n=len(s)\n zenhan=s[0:int((n-1)/2)]\n kouhan=s[int((n+3)/2-1):n]\n-print(zenhan)\n-print(kouhan)\n-print(zenhan[::-1])\n-print(kouhan[::-1])\n if s==s[::-1] and zenhan==zenhan[::-1] and kouhan==kouhan[::-1]:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " s=list(input())\n n=len(s)\n zenhan=s[0:int((n-1)/2)]\n kouhan=s[int((n+3)/2-1):n]\n-print(zenhan)\n-print(kouhan)\n-print(zenhan[::-1])\n-print(kouhan[::-1])\n if s==s[::-1] and zenhan==zenhan[::-1] and kouhan==kouhan[::-1]:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 0, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u607074939", "problem_id": "p02730", "submission1_id": "s896817388", "submission2_id": "s817854342", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(str(input()))\nn = len(s)\nN = int((n-1)/2)\nM = int((n+3)/2)\nl = []\nm = []\nfor i in range(N):\n l.append(s[i])\nfor i in range (M-2,N-1):\n m.append(s[i])\na = ''.join(l)\nb = ''.join(m)\nl.reverse()\nm.reverse()\nA = ''.join(l)\nB = ''.join(m)\nif (a==A and b==B):\n print('Yes')\nelse:\n print('No')", "code2": "s = list(str(input()))\n\nn = len(s)\nN = int((n-1)/2)\nM = int((n+3)/2)\n\nl = []\nm = []\n\nfor i in range(N):\n l.append(s[i])\n \nfor i in range (M-1,n):\n m.append(s[i])\n \na = ''.join(l)\nl.reverse()\nA = ''.join(l)\n\nb = ''.join(m)\nm.reverse()\nB = ''.join(m)\n\nt = s\nt.reverse()\nx = ''.join(s)\ny = ''.join(t)\n\nif (a==A and b==B and a == b):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584927175", "date2": "1584930658", "bleu_score": "0.7715897533789479", "code1_test_status": [0, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 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, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "fpfr_dp\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["s = list(str(input())) # (0): s=['f', 'p', 'f', 'r', '_', 'd', 'p']\nn = len(s) # (1): n=7\nN = int((n-1)/2) # (2): N=3\nM = int((n+3)/2) # (3): M=5\nl = [] # (4): l=[]\nm = [] # (5): m=[]\nfor i in range(N): # (6): i=0 (8): i=1 ... (12): NO CHANGE\n l.append(s[i]) # (7): l=['f'] (9): l=['f', 'p'] (11): l=['f', 'p', 'f']\nfor i in range (M-2,N-1): # (13): NO CHANGE\n m.append(s[i])\na = ''.join(l) # (14): a=fpf\nb = ''.join(m) # (15): b=\nl.reverse() # (16): NO CHANGE\nm.reverse() # (17): NO CHANGE\nA = ''.join(l) # (18): A=fpf\nB = ''.join(m) # (19): B=\nif (a==A and b==B): # (20): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " s = list(str(input()))\n+\n n = len(s)\n N = int((n-1)/2)\n M = int((n+3)/2)\n+\n l = []\n m = []\n+\n for i in range(N):\n l.append(s[i])\n-for i in range (M-2,N-1):\n+ \n+for i in range (M-1,n):\n m.append(s[i])\n+ \n a = ''.join(l)\n-b = ''.join(m)\n l.reverse()\n-m.reverse()\n A = ''.join(l)\n+\n+b = ''.join(m)\n+m.reverse()\n B = ''.join(m)\n-if (a==A and b==B):\n+\n+t = s\n+t.reverse()\n+x = ''.join(s)\n+y = ''.join(t)\n+\n+if (a==A and b==B and a == b):\n print('Yes')\n else:\n print('No')\n", "FL_content": " s = list(str(input()))\n n = len(s)\n N = int((n-1)/2)\n M = int((n+3)/2)\n l = []\n m = []\n for i in range(N):\n l.append(s[i])\n-for i in range (M-2,N-1):\n m.append(s[i])\n a = ''.join(l)\n-b = ''.join(m)\n l.reverse()\n-m.reverse()\n A = ''.join(l)\n B = ''.join(m)\n-if (a==A and b==B):\n print('Yes')\n else:\n print('No')\n", "added_lines": 16, "removed_lines": 4, "code1_lines": 20 }, { "user_id": "u548492494", "problem_id": "p02730", "submission1_id": "s287489311", "submission2_id": "s017521910", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\na = int((n-1)/2)\nb = int((n+3)/2)\nf=0\nx=s[:a]\ny = s[b-1:]\nif x==x[::-1] and y==y[::-1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "s = input()\nn = len(s)\na = int((n-1)/2)\nb = int((n+3)/2)\nx=s[:a]\ny = s[b-1:]\nif x==x[::-1] and y==y[::-1] and s==s[::-1]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584927477", "date2": "1584928563", "bleu_score": "0.8953675478297748", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "llvee\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["s = input() # (0): s=llvee\nn = len(s) # (1): n=5\na = int((n-1)/2) # (2): a=2\nb = int((n+3)/2) # (3): b=4\nf=0 # (4): f=0\nx=s[:a] # (5): x=ll\ny = s[b-1:] # (6): y=ee\nif x==x[::-1] and y==y[::-1]: # (7): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n a = int((n-1)/2)\n b = int((n+3)/2)\n-f=0\n x=s[:a]\n y = s[b-1:]\n-if x==x[::-1] and y==y[::-1]:\n+if x==x[::-1] and y==y[::-1] and s==s[::-1]:\n print(\"Yes\")\n else:\n print(\"No\")\n+\n", "FL_content": " s = input()\n n = len(s)\n a = int((n-1)/2)\n b = int((n+3)/2)\n-f=0\n x=s[:a]\n y = s[b-1:]\n-if x==x[::-1] and y==y[::-1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u453623947", "problem_id": "p02730", "submission1_id": "s240659326", "submission2_id": "s852456670", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = list(input())\nN = len(S)\ns1 = S[:int((N-1)/2):]\ns2 = S[int(((N+3)/2)-1):int(N):]\nif S == S[::-1] :\n if s1 == s1[::-1] and s2 == s2[::-1] :\n print(\"Yes\")\n else :\n print(\"No\")\n", "code2": "S = list(input())\nN = len(S)\ns1 = S[:int((N-1)/2):]\ns2 = S[int(((N+3)/2)-1):int(N):]\nif S == S[::-1] :\n if s1 == s1[::-1] and s2 == s2[::-1] :\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585982553", "date2": "1585983398", "bleu_score": "0.9010616209435414", "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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 3, "total_score": 103, "input": "kulec\n", "actual_output": "", "expected_output": "No\n\n", "anno_code": ["S = list(input()) # (0): S=['k', 'u', 'l', 'e', 'c']\nN = len(S) # (1): N=5\ns1 = S[:int((N-1)/2):] # (2): s1=['k', 'u']\ns2 = S[int(((N+3)/2)-1):int(N):] # (3): s2=['e', 'c']\nif S == S[::-1] :\n if s1 == s1[::-1] and s2 == s2[::-1] :\n print(\"Yes\")\n else :\n print(\"No\")\n"], "anno_status": [true], "diff_content": " S = list(input())\n N = len(S)\n s1 = S[:int((N-1)/2):]\n s2 = S[int(((N+3)/2)-1):int(N):]\n if S == S[::-1] :\n if s1 == s1[::-1] and s2 == s2[::-1] :\n print(\"Yes\")\n- else :\n- print(\"No\")\n+ else:\n+ print(\"No\")\n+else:\n+ print(\"No\")\n \n", "FL_content": " S = list(input())\n N = len(S)\n s1 = S[:int((N-1)/2):]\n s2 = S[int(((N+3)/2)-1):int(N):]\n if S == S[::-1] :\n if s1 == s1[::-1] and s2 == s2[::-1] :\n print(\"Yes\")\n- else :\n- print(\"No\")\n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u504256702", "problem_id": "p02730", "submission1_id": "s123530775", "submission2_id": "s934584547", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nn = len(S)\n\n\nif S[:int((n-1)/2)] == S[:int((n-1)/2)][::-1] and S[int((n+1)/2):]== S[int((n+1)/2):][::-1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "S = input()\nn = len(S)\n\n\n\n\nif S[:int((n-1)/2)] == S[:int((n-1)/2)][::-1] and S[int((n+1)/2):]== S[int((n+1)/2):][::-1] and S[:int((n-1)/2)] == S[int((n+1)/2):][::-1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584925932", "date2": "1584926294", "bleu_score": "0.7543769946075048", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "`k`saja\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["S = input() # (0): S=`k`saja\nn = len(S) # (1): n=7\n\n\nif S[:int((n-1)/2)] == S[:int((n-1)/2)][::-1] and S[int((n+1)/2):]== S[int((n+1)/2):][::-1]: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " S = input()\n n = len(S)\n \n \n-if S[:int((n-1)/2)] == S[:int((n-1)/2)][::-1] and S[int((n+1)/2):]== S[int((n+1)/2):][::-1]:\n+\n+\n+if S[:int((n-1)/2)] == S[:int((n-1)/2)][::-1] and S[int((n+1)/2):]== S[int((n+1)/2):][::-1] and S[:int((n-1)/2)] == S[int((n+1)/2):][::-1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " S = input()\n n = len(S)\n \n \n-if S[:int((n-1)/2)] == S[:int((n-1)/2)][::-1] and S[int((n+1)/2):]== S[int((n+1)/2):][::-1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u019075898", "problem_id": "p02730", "submission1_id": "s834372890", "submission2_id": "s411743188", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef isReverse(s):\n p1 = 0\n p2 = len(s) - 1\n flag = True\n while p1 <= p2:\n if s[p1] != s[p2]:\n flag = False\n p1 += 1\n p2 += -1\n return flag\nif __name__ == \"__main__\":\n s = input()\n s1 = s[:int((len(s) - 1) / 2)]\n s2 = s[int((len(s) + 1) / 2):]\n print(s, s1, s2)\n print(isReverse(s), isReverse(s1), isReverse(s2))\n if isReverse(s) and isReverse(s1) and isReverse(s2):\n print(\"Yes\")\n else:\n print(\"No\")", "code2": "def isReverse(s):\n p1 = 0\n p2 = len(s) - 1\n flag = True\n while p1 <= p2:\n if s[p1] != s[p2]:\n flag = False\n p1 += 1\n p2 += -1\n return flag\nif __name__ == \"__main__\":\n s = input()\n s1 = s[:int((len(s) - 1) / 2)]\n s2 = s[int((len(s) + 1) / 2):]\n \n \n if isReverse(s) and isReverse(s1) and isReverse(s2):\n print(\"Yes\")\n else:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589732786", "date2": "1589732827", "bleu_score": "0.8470908040695617", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "s__`cki\n", "actual_output": "s__`cki s__ cki\nFalse False False\nNo\n", "expected_output": "No\n\n", "anno_code": ["\ndef isReverse(s): # (0): isReverse=\n p1 = 0\n p2 = len(s) - 1\n flag = True\n while p1 <= p2:\n if s[p1] != s[p2]:\n flag = False\n p1 += 1\n p2 += -1\n return flag\nif __name__ == \"__main__\":\n s = input()\n s1 = s[:int((len(s) - 1) / 2)]\n s2 = s[int((len(s) + 1) / 2):]\n print(s, s1, s2)\n print(isReverse(s), isReverse(s1), isReverse(s2))\n if isReverse(s) and isReverse(s1) and isReverse(s2):\n print(\"Yes\")\n else:\n print(\"No\")"], "anno_status": [true], "diff_content": "-\n def isReverse(s):\n p1 = 0\n p2 = len(s) - 1\n flag = True\n while p1 <= p2:\n if s[p1] != s[p2]:\n flag = False\n p1 += 1\n p2 += -1\n return flag\n if __name__ == \"__main__\":\n s = input()\n s1 = s[:int((len(s) - 1) / 2)]\n s2 = s[int((len(s) + 1) / 2):]\n- print(s, s1, s2)\n- print(isReverse(s), isReverse(s1), isReverse(s2))\n+ \n+ \n if isReverse(s) and isReverse(s1) and isReverse(s2):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "-\n def isReverse(s):\n p1 = 0\n p2 = len(s) - 1\n flag = True\n while p1 <= p2:\n if s[p1] != s[p2]:\n flag = False\n p1 += 1\n p2 += -1\n return flag\n if __name__ == \"__main__\":\n s = input()\n s1 = s[:int((len(s) - 1) / 2)]\n s2 = s[int((len(s) + 1) / 2):]\n- print(s, s1, s2)\n- print(isReverse(s), isReverse(s1), isReverse(s2))\n if isReverse(s) and isReverse(s1) and isReverse(s2):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 21 }, { "user_id": "u442855260", "problem_id": "p02730", "submission1_id": "s027941396", "submission2_id": "s021519320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\nN=len(S)\ni=0\n\nif((N-1)/2%2==1):\n while (i<((N-1)/2-1)/2):\n print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)])\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==S[int(N-1-i)]) ):\n i+=1\n else:\n break;\n if(i==int((N-1)/2-1)/2):\n print('Yes')\n else:\n print('No')\n \nelse:\n while (i<=(N-1)/4):\n print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)])\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==[int(N-1-i)]) ):\n i+=1\n else:\n break;\n if(i==(N-1)/4):\n print('Yes')\n else:\n print('No')", "code2": "S=input()\nN=len(S)\ni=0\nif((N-1)/2%2==1):\n while (i<=((N-1)/2-1)/2):\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==S[int(N-1-i)]) ):\n i+=1\n else:\n break;\n if(i==int(((N-1)/2-1)/2+1)):\n print('Yes')\n else:\n print('No')\n \nelse:\n while (i<=(N-1)/4):\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==S[int(N-1-i)]) ):\n i+=1\n else:\n break;\n if(i==int((N-1)/4+1)):\n print('Yes')\n else:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584927338", "date2": "1584931187", "bleu_score": "0.7677624175038659", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "derodta\n", "actual_output": "d r d a\nNo\n", "expected_output": "No\n\n", "anno_code": ["S=input() # (0): S=derodta\nN=len(S) # (1): N=7\ni=0 # (2): i=0\n\nif((N-1)/2%2==1): # (3): NO CHANGE\n while (i<((N-1)/2-1)/2): # (4): NO CHANGE\n print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)]) # (5): NO CHANGE\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==S[int(N-1-i)]) ): # (6): NO CHANGE\n i+=1\n else:\n break; # (7): NO CHANGE\n if(i==int((N-1)/2-1)/2): # (8): NO CHANGE\n print('Yes')\n else:\n print('No')\n \nelse:\n while (i<=(N-1)/4):\n print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)])\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==[int(N-1-i)]) ):\n i+=1\n else:\n break;\n if(i==(N-1)/4):\n print('Yes')\n else:\n print('No')"], "anno_status": [true], "diff_content": " S=input()\n N=len(S)\n i=0\n-\n if((N-1)/2%2==1):\n- while (i<((N-1)/2-1)/2):\n- print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)])\n+ while (i<=((N-1)/2-1)/2):\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==S[int(N-1-i)]) ):\n i+=1\n else:\n break;\n- if(i==int((N-1)/2-1)/2):\n+ if(i==int(((N-1)/2-1)/2+1)):\n print('Yes')\n else:\n print('No')\n \n else:\n while (i<=(N-1)/4):\n- print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)])\n- if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==[int(N-1-i)]) ):\n+ if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==S[int(N-1-i)]) ):\n i+=1\n else:\n break;\n- if(i==(N-1)/4):\n+ if(i==int((N-1)/4+1)):\n print('Yes')\n else:\n print('No')\n", "FL_content": " S=input()\n N=len(S)\n i=0\n-\n if((N-1)/2%2==1):\n- while (i<((N-1)/2-1)/2):\n- print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)])\n if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==S[int(N-1-i)]) ):\n i+=1\n else:\n break;\n- if(i==int((N-1)/2-1)/2):\n print('Yes')\n else:\n print('No')\n \n else:\n while (i<=(N-1)/4):\n- print(S[i],S[int((N-1)/2-i-1)],S[int((N-1)/2+1+i)],S[int(N-1-i)])\n- if( (S[i]==S[int((N-1)/2-i-1)]) & (S[i]==S[int((N-1)/2+1+i)]) & (S[i]==[int(N-1-i)]) ):\n i+=1\n else:\n break;\n- if(i==(N-1)/4):\n print('Yes')\n else:\n print('No')\n", "added_lines": 4, "removed_lines": 7, "code1_lines": 27 }, { "user_id": "u224554402", "problem_id": "p02730", "submission1_id": "s906415153", "submission2_id": "s860258749", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\na= input()\nlength=math.floor(len(a)/2)\ndef kaibun(p):\n length_p=math.floor(len(p)/2)\n total_p = 0\n for i in range(length_p):\n if p[i] is not p[-1*i -1]:\n return False\n break\n else:\n total_p += 1\n if total_p == length_p:\n return True\nif kaibun(a):\n if kaibun(a[:length+1]):\n print('Yes')\n elif length==1:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')\n\n", "code2": "import math\na= input()\nlength=math.floor(len(a)/2)\ndef kaibun(p):\n length_p=math.floor(len(p)/2)\n total_p = 0\n for i in range(length_p):\n if p[i] is not p[-1*i -1]:\n return False\n break\n else:\n total_p += 1\n if total_p == length_p:\n return True\nif kaibun(a):\n if kaibun(a[:length]):\n print('Yes')\n elif length==1:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')\n\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585950600", "date2": "1585950878", "bleu_score": "0.9926353343368713", "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, 0, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "akasaka\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["import math\na= input() # (0): a=akasaka\nlength=math.floor(len(a)/2) # (1): length=3\ndef kaibun(p): # (2): kaibun=\n length_p=math.floor(len(p)/2) # (4): length_p=3 (19): length_p=2\n total_p = 0 # (5): total_p=0 (20): total_p=0\n for i in range(length_p): # (6): i=0 (10): i=1 ... (21): i=0\n if p[i] is not p[-1*i -1]: # (7): NO CHANGE (11): NO CHANGE ... (22): math=, a=akasaka, length=3, kaibun=\n return False\n break\n else:\n total_p += 1 # (8): total_p=1 (12): total_p=2 (16): total_p=3\n if total_p == length_p: # (9): NO CHANGE (13): NO CHANGE (17): math=, a=akasaka, length=3, kaibun=\n return True\nif kaibun(a): # (3): p=akasaka\n if kaibun(a[:length+1]): # (18): p=akas\n print('Yes')\n elif length==1: # (23): NO CHANGE\n print('Yes')\n else:\n print('No')\nelse:\n print('No')\n\n"], "anno_status": [true], "diff_content": " import math\n a= input()\n length=math.floor(len(a)/2)\n def kaibun(p):\n length_p=math.floor(len(p)/2)\n total_p = 0\n for i in range(length_p):\n if p[i] is not p[-1*i -1]:\n return False\n break\n else:\n total_p += 1\n if total_p == length_p:\n return True\n if kaibun(a):\n- if kaibun(a[:length+1]):\n+ if kaibun(a[:length]):\n print('Yes')\n elif length==1:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\n \n-\n+ \n", "FL_content": " import math\n a= input()\n length=math.floor(len(a)/2)\n def kaibun(p):\n length_p=math.floor(len(p)/2)\n total_p = 0\n for i in range(length_p):\n if p[i] is not p[-1*i -1]:\n return False\n break\n else:\n total_p += 1\n if total_p == length_p:\n return True\n if kaibun(a):\n- if kaibun(a[:length+1]):\n print('Yes')\n elif length==1:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\n \n-\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 25 }, { "user_id": "u622847899", "problem_id": "p02730", "submission1_id": "s699506475", "submission2_id": "s825972099", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\n\ndef judge_palindrome(x):\n\t\n\tflag=True\n\tif len(x)%2==0:\n\t\tflag=False\n\tfor i in range(int((len(x)-1)/2)):\n\t\tif x[i]!=x[len(x)-1-i]:\n\t\t\tflag=False\n\tif flag:\n\t\treturn True\n\telse:\n\t\treturn False\n\nif judge_palindrome(s) and judge_palindrome(s[:int((len(s)-1)/2)]) and judge_palindrome(s[int((len(s)+3)/2):]):\n\tprint('Yes')\nelse:\n\tprint('No')", "code2": "s=input()\n\ndef judge_palindrome(x):\n\tif x==x[::-1]:\n\t\treturn True\n\telse:\n\t\treturn False\n\nif judge_palindrome(s)==True and judge_palindrome(s[:int((len(s)-1)/2)])==True and judge_palindrome(s[int((len(s)+3)/2)-1:])==True:\n\tprint('Yes')\nelse:\n\tprint('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587326477", "date2": "1587327313", "bleu_score": "0.6195659229327981", "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, 0, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "akasaka\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["s=input() # (0): s=akasaka\n\ndef judge_palindrome(x): # (1): judge_palindrome=\n\t\n\tflag=True # (3): flag=True (13): flag=True (19): flag=True\n\tif len(x)%2==0: # (4): NO CHANGE (14): NO CHANGE (20): NO CHANGE\n\t\tflag=False # (21): flag=False\n\tfor i in range(int((len(x)-1)/2)): # (5): i=0 (7): i=1 ... (22): NO CHANGE\n\t\tif x[i]!=x[len(x)-1-i]: # (6): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n\t\t\tflag=False\n\tif flag: # (12): x=aka (18): x=ka (23): s=akasaka, judge_palindrome=\n\t\treturn True\n\telse:\n\t\treturn False\n\nif judge_palindrome(s) and judge_palindrome(s[:int((len(s)-1)/2)]) and judge_palindrome(s[int((len(s)+3)/2):]): # (2): x=akasaka\n\tprint('Yes')\nelse:\n\tprint('No')"], "anno_status": [true], "diff_content": " s=input()\n \n def judge_palindrome(x):\n-\t\n-\tflag=True\n-\tif len(x)%2==0:\n-\t\tflag=False\n-\tfor i in range(int((len(x)-1)/2)):\n-\t\tif x[i]!=x[len(x)-1-i]:\n-\t\t\tflag=False\n-\tif flag:\n+\tif x==x[::-1]:\n \t\treturn True\n \telse:\n \t\treturn False\n \n-if judge_palindrome(s) and judge_palindrome(s[:int((len(s)-1)/2)]) and judge_palindrome(s[int((len(s)+3)/2):]):\n+if judge_palindrome(s)==True and judge_palindrome(s[:int((len(s)-1)/2)])==True and judge_palindrome(s[int((len(s)+3)/2)-1:])==True:\n \tprint('Yes')\n else:\n \tprint('No')\n", "FL_content": " s=input()\n \n def judge_palindrome(x):\n-\t\n-\tflag=True\n-\tif len(x)%2==0:\n-\t\tflag=False\n-\tfor i in range(int((len(x)-1)/2)):\n-\t\tif x[i]!=x[len(x)-1-i]:\n-\t\t\tflag=False\n-\tif flag:\n \t\treturn True\n \telse:\n \t\treturn False\n \n-if judge_palindrome(s) and judge_palindrome(s[:int((len(s)-1)/2)]) and judge_palindrome(s[int((len(s)+3)/2):]):\n \tprint('Yes')\n else:\n \tprint('No')\n", "added_lines": 2, "removed_lines": 9, "code1_lines": 19 }, { "user_id": "u692687119", "problem_id": "p02730", "submission1_id": "s202551598", "submission2_id": "s182074852", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\nkai = []\nkai2 = []\nkai3 = []\nrev = []\nrev2 = []\nrev3 = []\n\nfor i in range(N):\n kai.append(S[i])\n\nfor i in range(0, int((N - 1) / 2)):\n kai2.append(S[i])\n\nfor i in range(int((N + 3) / 2) - 1, N):\n kai3.append(S[i])\n\nkai.reverse\nkai2.reverse\nkai3.reverse\n\nfor i in range(N):\n rev.append(S[i])\n\nfor i in range(0, int((N - 1) / 2)):\n rev2.append(S[i])\n\nfor i in range(int((N + 3) / 2) - 1, N):\n rev3.append(S[i])\n \nif kai == rev:\n if kai2 == rev2:\n if kai3 == rev3:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\nelse:\n print('No')\n", "code2": "S = input()\nN = len(S)\nkai = []\nkai2 = []\nkai3 = []\nrev = []\nrev2 = []\nrev3 = []\n\nfor i in range(N):\n kai.append(S[i])\n\nfor i in range(0, int((N - 1) / 2)):\n kai2.append(S[i])\n\nfor i in range(int((N + 3) / 2) - 1, N):\n kai3.append(S[i])\n\nkai.reverse()\nkai2.reverse()\nkai3.reverse()\n\nfor i in range(N):\n rev.append(S[i])\n\nfor i in range(0, int((N - 1) / 2)):\n rev2.append(S[i])\n\nfor i in range(int((N + 3) / 2) - 1, N):\n rev3.append(S[i])\n\nif kai == rev:\n if kai2 == rev2:\n if kai3 == rev3:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584927208", "date2": "1584927535", "bleu_score": "0.9795996282807333", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "pe`sepd\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["S = input() # (0): S=pe`sepd\nN = len(S) # (1): N=7\nkai = [] # (2): kai=[]\nkai2 = [] # (3): kai2=[]\nkai3 = [] # (4): kai3=[]\nrev = [] # (5): rev=[]\nrev2 = [] # (6): rev2=[]\nrev3 = [] # (7): rev3=[]\n\nfor i in range(N): # (8): i=0 (10): i=1 ... (22): NO CHANGE\n kai.append(S[i]) # (9): kai=['p'] (11): kai=['p', 'e'] ... (21): kai=['p', 'e', '`', 's', 'e', 'p', 'd']\n\nfor i in range(0, int((N - 1) / 2)): # (23): i=0 (25): i=1 ... (29): NO CHANGE\n kai2.append(S[i]) # (24): kai2=['p'] (26): kai2=['p', 'e'] (28): kai2=['p', 'e', '`']\n\nfor i in range(int((N + 3) / 2) - 1, N): # (30): i=4 (32): i=5 ... (36): NO CHANGE\n kai3.append(S[i]) # (31): kai3=['e'] (33): kai3=['e', 'p'] (35): kai3=['e', 'p', 'd']\n\nkai.reverse # (37): NO CHANGE\nkai2.reverse # (38): NO CHANGE\nkai3.reverse # (39): NO CHANGE\n\nfor i in range(N): # (40): i=0 (42): i=1 ... (54): NO CHANGE\n rev.append(S[i]) # (41): rev=['p'] (43): rev=['p', 'e'] ... (53): rev=['p', 'e', '`', 's', 'e', 'p', 'd']\n\nfor i in range(0, int((N - 1) / 2)): # (55): i=0 (57): i=1 ... (61): NO CHANGE\n rev2.append(S[i]) # (56): rev2=['p'] (58): rev2=['p', 'e'] (60): rev2=['p', 'e', '`']\n\nfor i in range(int((N + 3) / 2) - 1, N): # (62): i=4 (64): i=5 ... (68): NO CHANGE\n rev3.append(S[i]) # (63): rev3=['e'] (65): rev3=['e', 'p'] (67): rev3=['e', 'p', 'd']\n \nif kai == rev: # (69): NO CHANGE\n if kai2 == rev2: # (70): NO CHANGE\n if kai3 == rev3: # (71): NO CHANGE\n print('Yes')\n else:\n print('No')\n else:\n print('No')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n kai = []\n kai2 = []\n kai3 = []\n rev = []\n rev2 = []\n rev3 = []\n \n for i in range(N):\n kai.append(S[i])\n \n for i in range(0, int((N - 1) / 2)):\n kai2.append(S[i])\n \n for i in range(int((N + 3) / 2) - 1, N):\n kai3.append(S[i])\n \n-kai.reverse\n-kai2.reverse\n-kai3.reverse\n+kai.reverse()\n+kai2.reverse()\n+kai3.reverse()\n \n for i in range(N):\n rev.append(S[i])\n \n for i in range(0, int((N - 1) / 2)):\n rev2.append(S[i])\n \n for i in range(int((N + 3) / 2) - 1, N):\n rev3.append(S[i])\n- \n+\n if kai == rev:\n if kai2 == rev2:\n if kai3 == rev3:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\n else:\n print('No')\n \n", "FL_content": " S = input()\n N = len(S)\n kai = []\n kai2 = []\n kai3 = []\n rev = []\n rev2 = []\n rev3 = []\n \n for i in range(N):\n kai.append(S[i])\n \n for i in range(0, int((N - 1) / 2)):\n kai2.append(S[i])\n \n for i in range(int((N + 3) / 2) - 1, N):\n kai3.append(S[i])\n \n-kai.reverse\n-kai2.reverse\n-kai3.reverse\n \n for i in range(N):\n rev.append(S[i])\n \n for i in range(0, int((N - 1) / 2)):\n rev2.append(S[i])\n \n for i in range(int((N + 3) / 2) - 1, N):\n rev3.append(S[i])\n- \n if kai == rev:\n if kai2 == rev2:\n if kai3 == rev3:\n print('Yes')\n else:\n print('No')\n else:\n print('No')\n else:\n print('No')\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 42 }, { "user_id": "u465652095", "problem_id": "p02730", "submission1_id": "s982477875", "submission2_id": "s187144856", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\nSF_num = int((N-1)/2)\nSF = S[:SF_num]\nSF_rev = SF[::-1]\nSB = S[-SF_num:]\nSB_rev = SB[::-1]\n\nif SF == SB_rev:\n if SF[:SF_num] == SF_rev[:SF_num]:\n if SB[-SF_num:] == SB_rev[-SF_num:]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "S = input()\nN = len(S)\nSF_num = int((N-1)/2)\nSF = S[:SF_num]\nSF_rev = SF[::-1]\nSB_num = int((N+3)/2)\nSB = S[SB_num-1:]\nSB_rev = SB[::-1]\n\nif SF == SB_rev and SF == SF_rev and SB == SB_rev:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590507263", "date2": "1590509769", "bleu_score": "0.7137616811528052", "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, 0, 1], "code1_test_score": 101, "total_score": 103, "input": "level\n", "actual_output": "", "expected_output": "No\n", "anno_code": ["S = input() # (0): S=level\nN = len(S) # (1): N=5\nSF_num = int((N-1)/2) # (2): SF_num=2\nSF = S[:SF_num] # (3): SF=le\nSF_rev = SF[::-1] # (4): SF_rev=el\nSB = S[-SF_num:] # (5): SB=el\nSB_rev = SB[::-1] # (6): SB_rev=le\n\nif SF == SB_rev: # (7): NO CHANGE\n if SF[:SF_num] == SF_rev[:SF_num]:\n if SB[-SF_num:] == SB_rev[-SF_num:]:\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n SF_num = int((N-1)/2)\n SF = S[:SF_num]\n SF_rev = SF[::-1]\n-SB = S[-SF_num:]\n+SB_num = int((N+3)/2)\n+SB = S[SB_num-1:]\n SB_rev = SB[::-1]\n \n-if SF == SB_rev:\n- if SF[:SF_num] == SF_rev[:SF_num]:\n- if SB[-SF_num:] == SB_rev[-SF_num:]:\n- print(\"Yes\")\n+if SF == SB_rev and SF == SF_rev and SB == SB_rev:\n+ print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " S = input()\n N = len(S)\n SF_num = int((N-1)/2)\n SF = S[:SF_num]\n SF_rev = SF[::-1]\n-SB = S[-SF_num:]\n SB_rev = SB[::-1]\n \n-if SF == SB_rev:\n- if SF[:SF_num] == SF_rev[:SF_num]:\n- if SB[-SF_num:] == SB_rev[-SF_num:]:\n- print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 14 }, { "user_id": "u094103573", "problem_id": "p02730", "submission1_id": "s188723257", "submission2_id": "s353680846", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == '__main__':\n a = input()\n a_len = len(a)\n \n top_s = a[:int((a_len-1)/2)]\n tail_s = a[int((a_len+3)/2)-1:]\n if top_s == ''.join(list(reversed(top_s))) and tail_s == ''.join(list(reversed(tail_s))):\n print('Yes')\n else:\n print('No')", "code2": "if __name__ == '__main__':\n a = input()\n a_len = len(a)\n \n top_s = a[:int((a_len-1)/2)]\n tail_s = a[int((a_len+3)/2)-1:]\n if a == ''.join(list(reversed(a))) and top_s == ''.join(list(reversed(top_s))) and tail_s == ''.join(list(reversed(tail_s))):\n print('Yes')\n else:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585174424", "date2": "1585174678", "bleu_score": "0.8803331128228248", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "llvee\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["if __name__ == '__main__':\n a = input()\n a_len = len(a)\n \n top_s = a[:int((a_len-1)/2)]\n tail_s = a[int((a_len+3)/2)-1:]\n if top_s == ''.join(list(reversed(top_s))) and tail_s == ''.join(list(reversed(tail_s))):\n print('Yes')\n else:\n print('No')"], "anno_status": [true], "diff_content": " if __name__ == '__main__':\n a = input()\n a_len = len(a)\n \n top_s = a[:int((a_len-1)/2)]\n tail_s = a[int((a_len+3)/2)-1:]\n- if top_s == ''.join(list(reversed(top_s))) and tail_s == ''.join(list(reversed(tail_s))):\n+ if a == ''.join(list(reversed(a))) and top_s == ''.join(list(reversed(top_s))) and tail_s == ''.join(list(reversed(tail_s))):\n print('Yes')\n else:\n print('No')\n", "FL_content": " if __name__ == '__main__':\n a = input()\n a_len = len(a)\n \n top_s = a[:int((a_len-1)/2)]\n tail_s = a[int((a_len+3)/2)-1:]\n- if top_s == ''.join(list(reversed(top_s))) and tail_s == ''.join(list(reversed(tail_s))):\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u763210820", "problem_id": "p02730", "submission1_id": "s539272819", "submission2_id": "s535686080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = list(input())\nnr = list(reversed(n))\nmae = []\nusiro = []\nfor i in range(int((len(n)-1)/2)):\n mae.append(n[i])\n usiro.append(nr[i])\n\nif mae == usiro:\n print('Yes')\nelse:\n print('No')\n", "code2": "n = list(input())\n\nmae = []\nusiro = []\nfor i in range(int((len(n)-1)/2)):\n mae.append(n[i])\nfor i in range(int((len(n)+3)/2)-1,len(n)):\n usiro.append(n[i])\n\nif mae == usiro:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587351657", "date2": "1587352352", "bleu_score": "0.8068287244771019", "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, 0, 1], "code1_test_score": 101, "total_score": 103, "input": "elvle\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["n = list(input()) # (0): n=['e', 'l', 'v', 'l', 'e']\nnr = list(reversed(n)) # (1): nr=['e', 'l', 'v', 'l', 'e']\nmae = [] # (2): mae=[]\nusiro = [] # (3): usiro=[]\nfor i in range(int((len(n)-1)/2)): # (4): i=0 (7): i=1 (10): NO CHANGE\n mae.append(n[i]) # (5): mae=['e'] (8): mae=['e', 'l']\n usiro.append(nr[i]) # (6): usiro=['e'] (9): usiro=['e', 'l']\n\nif mae == usiro: # (11): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " n = list(input())\n-nr = list(reversed(n))\n+\n mae = []\n usiro = []\n for i in range(int((len(n)-1)/2)):\n mae.append(n[i])\n- usiro.append(nr[i])\n+for i in range(int((len(n)+3)/2)-1,len(n)):\n+ usiro.append(n[i])\n \n if mae == usiro:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " n = list(input())\n-nr = list(reversed(n))\n mae = []\n usiro = []\n for i in range(int((len(n)-1)/2)):\n mae.append(n[i])\n- usiro.append(nr[i])\n \n if mae == usiro:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u261103969", "problem_id": "p03952", "submission1_id": "s069861249", "submission2_id": "s828979163", "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\ndef main():\n n, x = map(int, readline().split())\n ans = [0] * (2 * n - 1)\n\n if x == 1 or x == (2 * n - 1):\n print(-1)\n return\n\n for i in range(1, n + 1):\n if i % 2 == 1:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n ans[n] = x\n\n for i in range(n + 1, 2 * n):\n if i % 2 == 0:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n\n print(*ans, sep=\"\\n\")\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\ndef main():\n n, x = map(int, readline().split())\n ans = [0] * (2 * n - 1)\n\n if x == 1 or x == (2 * n - 1):\n print(\"No\")\n return\n\n for i in range(1, n + 1):\n if i % 2 == 1:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n ans[n] = x\n\n for i in range(n + 1, 2 * n):\n if i % 2 == 0:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n \n print(\"Yes\")\n print(*ans, sep=\"\\n\")\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1594261893", "date2": "1594261926", "bleu_score": "0.9631730602112482", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 8, "input": "173 1\n", "actual_output": "-1\n", "expected_output": "No\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\ndef main(): # (4): main=\n n, x = map(int, readline().split())\n ans = [0] * (2 * n - 1)\n\n if x == 1 or x == (2 * n - 1):\n print(-1)\n return\n\n for i in range(1, n + 1):\n if i % 2 == 1:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n ans[n] = x\n\n for i in range(n + 1, 2 * n):\n if i % 2 == 0:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n\n print(*ans, sep=\"\\n\")\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "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 def main():\n n, x = map(int, readline().split())\n ans = [0] * (2 * n - 1)\n \n if x == 1 or x == (2 * n - 1):\n- print(-1)\n+ print(\"No\")\n return\n \n for i in range(1, n + 1):\n if i % 2 == 1:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n ans[n] = x\n \n for i in range(n + 1, 2 * n):\n if i % 2 == 0:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n-\n+ \n+ print(\"Yes\")\n print(*ans, sep=\"\\n\")\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 def main():\n n, x = map(int, readline().split())\n ans = [0] * (2 * n - 1)\n \n if x == 1 or x == (2 * n - 1):\n- print(-1)\n return\n \n for i in range(1, n + 1):\n if i % 2 == 1:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n ans[n] = x\n \n for i in range(n + 1, 2 * n):\n if i % 2 == 0:\n ans[i - 1] = (x - 1 + abs(n - i)) % (2 * n - 1) + 1\n else:\n ans[i - 1] = (x - 1 - abs(n - i)) % (2 * n - 1) + 1\n-\n print(*ans, sep=\"\\n\")\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 35 }, { "user_id": "u391731808", "problem_id": "p03952", "submission1_id": "s794959673", "submission2_id": "s938233521", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x = map(int,input().split())\nif N in {1,2*N-1}:print(\"No\")\nelse:\n print(\"Yes\")\n if x>=N:\n ans = list(range(N,x))+list(range(x+1,2*N)) + [x] + list(range(1,N))\n else:\n ans = list(range(N+1,2*N)) + [x] + list(range(1,x)) + list(range(x+1,N+1))\n print(\"\\n\".join(map(str,ans)))", "code2": "N,x = map(int,input().split())\nif x in {1,2*N-1}:print(\"No\")\nelse:\n print(\"Yes\")\n if x>=N:\n ans = list(range(N,x))+list(range(x+1,2*N)) + [x] + list(range(1,N))\n else:\n ans = list(range(N+1,2*N)) + [x] + list(range(1,x)) + list(range(x+1,N+1))\n print(\"\\n\".join(map(str,ans)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562469415", "date2": "1562469531", "bleu_score": "0.991631557876558", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 8, "input": "173 1\n", "actual_output": "Yes\n174\n175\n176\n177\n178\n179\n180\n181\n182\n183\n184\n185\n186\n187\n188\n189\n190\n191\n192\n193\n194\n195\n196\n197\n198\n199\n200\n201\n202\n203\n204\n205\n206\n207\n208\n209\n210\n211\n212\n213\n214\n215\n216\n217\n218\n219\n220\n221\n222\n223\n224\n225\n226\n227\n228\n229\n230\n231\n232\n233\n234\n235\n236\n237\n238\n239\n240\n241\n242\n243\n244\n245\n246\n247\n248\n249\n250\n251\n252\n253\n254\n255\n256\n257\n258\n259\n260\n261\n262\n263\n264\n265\n266\n267\n268\n269\n270\n271\n272\n273\n274\n275\n276\n277\n278\n279\n280\n281\n282\n283\n284\n285\n286\n287\n288\n289\n290\n291\n292\n293\n294\n295\n296\n297\n298\n299\n300\n301\n302\n303\n304\n305\n306\n307\n308\n309\n310\n311\n312\n313\n314\n315\n316\n317\n318\n319\n320\n321\n322\n323\n324\n325\n326\n327\n328\n329\n330\n331\n332\n333\n334\n335\n336\n337\n338\n339\n340\n341\n342\n343\n344\n345\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n36\n37\n38\n39\n40\n41\n42\n43\n44\n45\n46\n47\n48\n49\n50\n51\n52\n53\n54\n55\n56\n57\n58\n59\n60\n61\n62\n63\n64\n65\n66\n67\n68\n69\n70\n71\n72\n73\n74\n75\n76\n77\n78\n79\n80\n81\n82\n83\n84\n85\n86\n87\n88\n89\n90\n91\n92\n93\n94\n95\n96\n97\n98\n99\n100\n101\n102\n103\n104\n105\n106\n107\n108\n109\n110\n111\n112\n113\n114\n115\n116\n117\n118\n119\n120\n121\n122\n123\n124\n125\n126\n127\n128\n129\n130\n131\n132\n133\n134\n135\n136\n137\n138\n139\n140\n141\n142\n143\n144\n145\n146\n147\n148\n149\n150\n151\n152\n153\n154\n155\n156\n157\n158\n159\n160\n161\n162\n163\n164\n165\n166\n167\n168\n169\n170\n171\n172\n173\n", "expected_output": "No\n\n", "anno_code": ["N,x = map(int,input().split()) # (0): N=173, x=1\nif N in {1,2*N-1}:print(\"No\") # (1): NO CHANGE\nelse:\n print(\"Yes\") # (2): NO CHANGE\n if x>=N: # (3): NO CHANGE\n ans = list(range(N,x))+list(range(x+1,2*N)) + [x] + list(range(1,N))\n else:\n ans = list(range(N+1,2*N)) + [x] + list(range(1,x)) + list(range(x+1,N+1)) # (4): ans=[174, 175, ..., 172, 173]\n print(\"\\n\".join(map(str,ans)))"], "anno_status": [false], "diff_content": " N,x = map(int,input().split())\n-if N in {1,2*N-1}:print(\"No\")\n+if x in {1,2*N-1}:print(\"No\")\n else:\n print(\"Yes\")\n if x>=N:\n ans = list(range(N,x))+list(range(x+1,2*N)) + [x] + list(range(1,N))\n else:\n ans = list(range(N+1,2*N)) + [x] + list(range(1,x)) + list(range(x+1,N+1))\n print(\"\\n\".join(map(str,ans)))\n", "FL_content": " N,x = map(int,input().split())\n-if N in {1,2*N-1}:print(\"No\")\n else:\n print(\"Yes\")\n if x>=N:\n ans = list(range(N,x))+list(range(x+1,2*N)) + [x] + list(range(1,N))\n else:\n ans = list(range(N+1,2*N)) + [x] + list(range(1,x)) + list(range(x+1,N+1))\n print(\"\\n\".join(map(str,ans)))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u930705402", "problem_id": "p03952", "submission1_id": "s003476739", "submission2_id": "s664657767", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x=map(int,input().split())\nif x==1 or x==2*N-1:\n print(-1)\n exit()\nif N==2:\n print('Yes')\n print(*[1,2,3],sep='\\n')\n exit()\ns=set(range(1,2*N))\ns.remove(x)\nans=[0]*(2*N-1)\nans[N-1]=x\nmin1=min(s)\nmax1=max(s)\ns.remove(min1);s.remove(max1)\nif x==2*N-2:\n min2=min(s)\n s.remove(min2)\n ans[N-2]=min1;ans[N]=max1;ans[N+1]=min2\nelse:\n max2=max(s)\n s.remove(max2)\n ans[N-2]=max1;ans[N]=min1;ans[N+1]=max2\nli=list(s)\nfor i in range(2*N-1):\n if ans[i]==0:\n ans[i]=li.pop()\nprint(\"Yes\")\nprint(*ans,sep='\\n')", "code2": "N,x=map(int,input().split())\nif x==1 or x==2*N-1:\n print(\"No\")\n exit()\nif N==2:\n print('Yes')\n print(*[1,2,3],sep='\\n')\n exit()\ns=set(range(1,2*N))\ns.remove(x)\nans=[0]*(2*N-1)\nans[N-1]=x\nmin1=min(s)\nmax1=max(s)\ns.remove(min1);s.remove(max1)\nif x==2*N-2:\n min2=min(s)\n s.remove(min2)\n ans[N-2]=min1;ans[N]=max1;ans[N+1]=min2\nelse:\n max2=max(s)\n s.remove(max2)\n ans[N-2]=max1;ans[N]=min1;ans[N+1]=max2\nli=list(s)\nfor i in range(2*N-1):\n if ans[i]==0:\n ans[i]=li.pop()\nprint(\"Yes\")\nprint(*ans,sep='\\n')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598389951", "date2": "1598389980", "bleu_score": "0.9898177088281839", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 8, "input": "173 1\n", "actual_output": "-1\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " N,x=map(int,input().split())\n if x==1 or x==2*N-1:\n- print(-1)\n+ print(\"No\")\n exit()\n if N==2:\n print('Yes')\n print(*[1,2,3],sep='\\n')\n exit()\n s=set(range(1,2*N))\n s.remove(x)\n ans=[0]*(2*N-1)\n ans[N-1]=x\n min1=min(s)\n max1=max(s)\n s.remove(min1);s.remove(max1)\n if x==2*N-2:\n min2=min(s)\n s.remove(min2)\n ans[N-2]=min1;ans[N]=max1;ans[N+1]=min2\n else:\n max2=max(s)\n s.remove(max2)\n ans[N-2]=max1;ans[N]=min1;ans[N+1]=max2\n li=list(s)\n for i in range(2*N-1):\n if ans[i]==0:\n ans[i]=li.pop()\n print(\"Yes\")\n print(*ans,sep='\\n')\n", "FL_content": " N,x=map(int,input().split())\n if x==1 or x==2*N-1:\n- print(-1)\n exit()\n if N==2:\n print('Yes')\n print(*[1,2,3],sep='\\n')\n exit()\n s=set(range(1,2*N))\n s.remove(x)\n ans=[0]*(2*N-1)\n ans[N-1]=x\n min1=min(s)\n max1=max(s)\n s.remove(min1);s.remove(max1)\n if x==2*N-2:\n min2=min(s)\n s.remove(min2)\n ans[N-2]=min1;ans[N]=max1;ans[N+1]=min2\n else:\n max2=max(s)\n s.remove(max2)\n ans[N-2]=max1;ans[N]=min1;ans[N+1]=max2\n li=list(s)\n for i in range(2*N-1):\n if ans[i]==0:\n ans[i]=li.pop()\n print(\"Yes\")\n print(*ans,sep='\\n')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 29 }, { "user_id": "u368780724", "problem_id": "p03952", "submission1_id": "s779071513", "submission2_id": "s280378079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, x = [int(i) for i in input().split()]\nimport sys\n\nif x == 1 or x == 2*N-1:\n if N != 1:\n print(-1)\n sys.exit()\n else:\n print(1)\n sys.exit()\n\nsmaller = True\nif x > N:\n smaller = False\n x = 2*N-x\n\nans = list(range(2*N-1,N+x-1,-1))+list(range(1,N+x))\nif not smaller:\n ans =[2*N - ans[i] for i in range(2*N-1)]\n\nprint(*ans)", "code2": "N, x = [int(i) for i in input().split()]\nimport sys\n\nif x == 1 or x == 2*N-1:\n if N != 1:\n print('No')\n sys.exit()\n else:\n print('Yes')\n print(1)\n sys.exit()\n\nsmaller = True\nif x > N:\n smaller = False\n x = 2*N-x\n\nans = list(range(2*N-1,N+x-1,-1))+list(range(1,N+x))\nif not smaller:\n ans =[2*N - ans[i] for i in range(2*N-1)]\n\nprint('Yes')\nfor i in range(2*N-1):\n print(ans[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542103848", "date2": "1542103960", "bleu_score": "0.8355995388026977", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 8, "input": "157 1\n", "actual_output": "-1\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " N, x = [int(i) for i in input().split()]\n import sys\n \n if x == 1 or x == 2*N-1:\n if N != 1:\n- print(-1)\n+ print('No')\n sys.exit()\n else:\n+ print('Yes')\n print(1)\n sys.exit()\n \n smaller = True\n if x > N:\n smaller = False\n x = 2*N-x\n \n ans = list(range(2*N-1,N+x-1,-1))+list(range(1,N+x))\n if not smaller:\n ans =[2*N - ans[i] for i in range(2*N-1)]\n \n-print(*ans)\n+print('Yes')\n+for i in range(2*N-1):\n+ print(ans[i])\n", "FL_content": " N, x = [int(i) for i in input().split()]\n import sys\n \n if x == 1 or x == 2*N-1:\n if N != 1:\n- print(-1)\n sys.exit()\n else:\n print(1)\n sys.exit()\n \n smaller = True\n if x > N:\n smaller = False\n x = 2*N-x\n \n ans = list(range(2*N-1,N+x-1,-1))+list(range(1,N+x))\n if not smaller:\n ans =[2*N - ans[i] for i in range(2*N-1)]\n \n-print(*ans)\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 21 }, { "user_id": "u888092736", "problem_id": "p02854", "submission1_id": "s500089526", "submission2_id": "s768714128", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\n\nN = int(input())\nA = [0] + list(accumulate(map(int, input().split())))\nprint(A)\nmin_diff = float(\"inf\")\nfor i in range(N - 1):\n if abs(A[N] - 2 * A[i + 1]) < min_diff:\n min_diff = abs(A[N] - 2 * A[i + 1])\nprint(abs(min_diff))\n", "code2": "from itertools import accumulate\n\n\nN = int(input())\nA = [0] + list(accumulate(map(int, input().split())))\nmin_diff = float(\"inf\")\nfor i in range(N - 1):\n if abs(A[N] - 2 * A[i + 1]) < min_diff:\n min_diff = abs(A[N] - 2 * A[i + 1])\nprint(min_diff)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590802483", "date2": "1590802526", "bleu_score": "0.9413770211273436", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n010 18 33 5 1 477 011 0 179 100 -1 001\n", "actual_output": "[0, 10, 28, 61, 66, 67, 544, 555, 555, 734, 834, 833, 834]\n254\n", "expected_output": "254\n\n", "anno_code": ["from itertools import accumulate\n\n\nN = int(input()) # (0): N=12\nA = [0] + list(accumulate(map(int, input().split()))) # (1): A=[0, 10, 28, 61, 66, 67, 544, 555, 555, 734, 834, 833, 834]\nprint(A) # (2): NO CHANGE\nmin_diff = float(\"inf\") # (3): min_diff=inf\nfor i in range(N - 1): # (4): i=0 (7): i=1 ... (32): NO CHANGE\n if abs(A[N] - 2 * A[i + 1]) < min_diff: # (5): NO CHANGE (8): NO CHANGE ... (31): NO CHANGE\n min_diff = abs(A[N] - 2 * A[i + 1]) # (6): min_diff=814 (9): min_diff=778 ... (21): min_diff=254\nprint(abs(min_diff))\n"], "anno_status": [true], "diff_content": " from itertools import accumulate\n \n \n N = int(input())\n A = [0] + list(accumulate(map(int, input().split())))\n-print(A)\n min_diff = float(\"inf\")\n for i in range(N - 1):\n if abs(A[N] - 2 * A[i + 1]) < min_diff:\n min_diff = abs(A[N] - 2 * A[i + 1])\n-print(abs(min_diff))\n+print(min_diff)\n \n", "FL_content": " from itertools import accumulate\n \n \n N = int(input())\n A = [0] + list(accumulate(map(int, input().split())))\n-print(A)\n min_diff = float(\"inf\")\n for i in range(N - 1):\n if abs(A[N] - 2 * A[i + 1]) < min_diff:\n min_diff = abs(A[N] - 2 * A[i + 1])\n-print(abs(min_diff))\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u111392182", "problem_id": "p02854", "submission1_id": "s209502166", "submission2_id": "s724360670", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\nb = sum(a)\nl = 0\nr = 0\nx = 0\nans = 0\nfor i in a:\n l += i\n r = b - l\n if l==r:\n break;\n elif l>r:\n ans = min(l-r,y-x)\n print(l-r,y-x)\n break;\n x = l\n y = r\nprint(ans)", "code2": "n = int(input())\na = list(map(int,input().split()))\nb = sum(a)\nl = 0\nr = 0\nx = 0\nans = 0\nfor i in a:\n l += i\n r = b - l\n if l==r:\n break;\n elif l>r:\n ans = min(l-r,y-x)\n break;\n x = l\n y = r\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574562619", "date2": "1574562945", "bleu_score": "0.9157947944209355", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 101, "input": "12\n011 10 33 24 79 344 111 2 139 000 1 011\n", "actual_output": "237 451\n237\n", "expected_output": "237\n\n", "anno_code": ["n = int(input()) # (0): n=12\na = list(map(int,input().split())) # (1): a=[11, 10, 33, 24, 79, 344, 111, 2, 139, 0, 1, 11]\nb = sum(a) # (2): b=765\nl = 0 # (3): l=0\nr = 0 # (4): r=0\nx = 0 # (5): x=0\nans = 0 # (6): ans=0\nfor i in a: # (7): i=11 (14): i=10 ... (42): i=344\n l += i # (8): l=11 (15): l=21 ... (43): l=501\n r = b - l # (9): r=754 (16): r=744 ... (44): r=264\n if l==r: # (10): NO CHANGE (17): NO CHANGE ... (45): NO CHANGE\n break;\n elif l>r: # (11): NO CHANGE (18): NO CHANGE ... (46): NO CHANGE\n ans = min(l-r,y-x) # (47): ans=237\n print(l-r,y-x) # (48): NO CHANGE\n break; # (49): NO CHANGE\n x = l # (12): x=11 (19): x=21 ... (40): x=157\n y = r # (13): y=754 (20): y=744 ... (41): y=608\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n b = sum(a)\n l = 0\n r = 0\n x = 0\n ans = 0\n for i in a:\n l += i\n r = b - l\n if l==r:\n break;\n elif l>r:\n ans = min(l-r,y-x)\n- print(l-r,y-x)\n break;\n x = l\n y = r\n print(ans)\n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n b = sum(a)\n l = 0\n r = 0\n x = 0\n ans = 0\n for i in a:\n l += i\n r = b - l\n if l==r:\n break;\n elif l>r:\n ans = min(l-r,y-x)\n- print(l-r,y-x)\n break;\n x = l\n y = r\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u602252807", "problem_id": "p02854", "submission1_id": "s952566595", "submission2_id": "s770878968", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\n\ns = sum(a)\n\nleft = 0\nright = 0\nfor i in range(n):\n left += a[i]\n if left >= s/2:\n right = s - left\n break\n \nif left == s/2:\n print(0)\nelse:\n print(abs(left-right))", "code2": "n = int(input())\na = list(map(int,input().split()))\n \ns = sum(a)\n \nleft = 0\nright = s\nres = s\nfor i in range(n-1):\n left += a[i]\n right -= a[i]\n res = min(res,abs(left-right))\n if res == 0:\n break\n \nprint(res)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574561417", "date2": "1574562963", "bleu_score": "0.7494580526430973", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 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, 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], "code1_test_score": 68, "total_score": 101, "input": "12\n101 104 102 105 103 103 100 117 104 102 104 111\n", "actual_output": "180\n", "expected_output": "20\n\n", "anno_code": ["n = int(input()) # (0): n=12\na = list(map(int,input().split())) # (1): a=[101, 104, 102, 105, 103, 103, 100, 117, 104, 102, 104, 111]\n\ns = sum(a) # (2): s=1256\n\nleft = 0 # (3): left=0\nright = 0 # (4): right=0\nfor i in range(n): # (5): i=0 (8): i=1 ... (23): i=6\n left += a[i] # (6): left=101 (9): left=205 ... (24): left=718\n if left >= s/2: # (7): NO CHANGE (10): NO CHANGE ... (25): NO CHANGE\n right = s - left # (26): right=538\n break # (27): NO CHANGE\n \nif left == s/2: # (28): NO CHANGE\n print(0)\nelse:\n print(abs(left-right))"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n-\n+ \n s = sum(a)\n-\n+ \n left = 0\n-right = 0\n-for i in range(n):\n+right = s\n+res = s\n+for i in range(n-1):\n left += a[i]\n- if left >= s/2:\n- right = s - left\n+ right -= a[i]\n+ res = min(res,abs(left-right))\n+ if res == 0:\n break\n \n-if left == s/2:\n- print(0)\n-else:\n- print(abs(left-right))\n+print(res)\n+\n+\n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n-\n s = sum(a)\n-\n left = 0\n-right = 0\n-for i in range(n):\n left += a[i]\n- if left >= s/2:\n- right = s - left\n break\n \n-if left == s/2:\n- print(0)\n-else:\n- print(abs(left-right))\n", "added_lines": 11, "removed_lines": 10, "code1_lines": 17 }, { "user_id": "u368249389", "problem_id": "p02854", "submission1_id": "s265682501", "submission2_id": "s979808941", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nN = int(input())\na_list = list(map(int, input().split()))\n\n\nmin_cost = 10*18\nleft_sum = 0\nright_sum = sum(a_list)\n\n\nfor i in range(N-1):\n left_sum += a_list[i]\n right_sum -= a_list[i]\n distance = abs(left_sum - right_sum)\n min_cost = min(min_cost, distance)\n\n\nprint(min_cost)\n", "code2": "\n\n\nN = int(input())\na_list = list(map(int, input().split()))\n\n\nmin_cost = 10**18\nleft_sum = 0\nright_sum = sum(a_list)\n\n\nfor i in range(N-1):\n left_sum += a_list[i]\n right_sum -= a_list[i]\n distance = abs(left_sum - right_sum)\n min_cost = min(min_cost, distance)\n\n\nprint(min_cost)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584042980", "date2": "1584043241", "bleu_score": "0.9939612570895745", "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, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 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, 0, 0, 1, 1], "code1_test_score": 78, "total_score": 101, "input": "12\n010 5 66 4 1 477 001 1 179 100 -1 000\n", "actual_output": "180\n", "expected_output": "283\n\n", "anno_code": ["\n\n\nN = int(input()) # (0): N=12\na_list = list(map(int, input().split())) # (1): a_list=[10, 5, 66, 4, 1, 477, 1, 1, 179, 100, -1, 0]\n\n\nmin_cost = 10*18 # (2): min_cost=180\nleft_sum = 0 # (3): left_sum=0\nright_sum = sum(a_list) # (4): right_sum=843\n\n\nfor i in range(N-1): # (5): i=0 (10): i=1 ... (60): NO CHANGE\n left_sum += a_list[i] # (6): left_sum=10 (11): left_sum=15 ... (56): left_sum=843\n right_sum -= a_list[i] # (7): right_sum=833 (12): right_sum=828 ... (57): right_sum=0\n distance = abs(left_sum - right_sum) # (8): distance=823 (13): distance=813 ... (58): distance=843\n min_cost = min(min_cost, distance) # (9): NO CHANGE (14): NO CHANGE ... (59): NO CHANGE\n\n\nprint(min_cost)\n"], "anno_status": [true], "diff_content": " \n \n \n N = int(input())\n a_list = list(map(int, input().split()))\n \n \n-min_cost = 10*18\n+min_cost = 10**18\n left_sum = 0\n right_sum = sum(a_list)\n \n \n for i in range(N-1):\n left_sum += a_list[i]\n right_sum -= a_list[i]\n distance = abs(left_sum - right_sum)\n min_cost = min(min_cost, distance)\n \n \n print(min_cost)\n \n", "FL_content": " \n \n \n N = int(input())\n a_list = list(map(int, input().split()))\n \n \n-min_cost = 10*18\n left_sum = 0\n right_sum = sum(a_list)\n \n \n for i in range(N-1):\n left_sum += a_list[i]\n right_sum -= a_list[i]\n distance = abs(left_sum - right_sum)\n min_cost = min(min_cost, distance)\n \n \n print(min_cost)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u744920373", "problem_id": "p02854", "submission1_id": "s849842146", "submission2_id": "s387089104", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**8)\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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]\ndef dp2(ini, i, j): return [[ini]*i for i2 in range(j)]\ndef dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]\n\n\n\nfrom itertools import accumulate \n\nN = ii()\nA = li()\n\nacc = list(accumulate(A))\nsa = acc[-1] -acc[0]\n\nfor i in range(N):\n if acc[i] - (acc[-1] - acc[i]) >= 0:\n break\n\nif i == N-1:\n print(abs(A[i] - acc[i-1]))\nelse:\n print(abs(acc[i] - (acc[-1] - acc[i])))", "code2": "import sys\nsys.setrecursionlimit(10**8)\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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]\ndef dp2(ini, i, j): return [[ini]*i for i2 in range(j)]\ndef dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]\n\n\n\nfrom itertools import accumulate \n\nN = ii()\nA = li()\n\nacc = list(accumulate(A))\n\n\nfor i in range(N):\n if acc[i] - (acc[-1] - acc[i]) >= 0:\n break\n\nif i == N-1:\n print(abs(A[i] - acc[i-1]))\nelif i == 0:\n print(abs(acc[i] - (acc[-1] - acc[i])))\nelse:\n ans = min(abs(acc[i] - (acc[-1] - acc[i])), abs(acc[i-1] - (acc[-1] - acc[i-1])))\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590728543", "date2": "1590728787", "bleu_score": "0.8701187383780467", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 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, 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], "code1_test_score": 69, "total_score": 101, "input": "12\n011 5 33 24 167 344 010 349 91 195 4 111\n", "actual_output": "542\n", "expected_output": "156\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**8) # (0): ii=, mi=, li=, li2=, dp2=, dp3=, accumulate=\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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]\ndef dp2(ini, i, j): return [[ini]*i for i2 in range(j)]\ndef dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]\n\n\n\nfrom itertools import accumulate \n\nN = ii() # (1): N=12\nA = li() # (2): A=[11, 5, 33, 24, 167, 344, 10, 349, 91, 195, 4, 111]\n\nacc = list(accumulate(A)) # (3): acc=[11, 16, 49, 73, 240, 584, 594, 943, 1034, 1229, 1233, 1344]\nsa = acc[-1] -acc[0] # (4): sa=1333\n\nfor i in range(N): # (5): i=0 (7): i=1 ... (19): i=7\n if acc[i] - (acc[-1] - acc[i]) >= 0: # (6): NO CHANGE (8): NO CHANGE ... (20): NO CHANGE\n break # (21): NO CHANGE\n\nif i == N-1: # (22): NO CHANGE\n print(abs(A[i] - acc[i-1]))\nelse:\n print(abs(acc[i] - (acc[-1] - acc[i])))"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10**8)\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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]\n def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]\n def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]\n \n \n \n from itertools import accumulate \n \n N = ii()\n A = li()\n \n acc = list(accumulate(A))\n-sa = acc[-1] -acc[0]\n+\n \n for i in range(N):\n if acc[i] - (acc[-1] - acc[i]) >= 0:\n break\n \n if i == N-1:\n print(abs(A[i] - acc[i-1]))\n-else:\n+elif i == 0:\n print(abs(acc[i] - (acc[-1] - acc[i])))\n+else:\n+ ans = min(abs(acc[i] - (acc[-1] - acc[i])), abs(acc[i-1] - (acc[-1] - acc[i-1])))\n+ print(ans)\n", "FL_content": " import sys\n sys.setrecursionlimit(10**8)\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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]\n def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]\n def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]\n \n \n \n from itertools import accumulate \n \n N = ii()\n A = li()\n \n acc = list(accumulate(A))\n-sa = acc[-1] -acc[0]\n \n for i in range(N):\n if acc[i] - (acc[-1] - acc[i]) >= 0:\n break\n \n if i == N-1:\n print(abs(A[i] - acc[i-1]))\n-else:\n print(abs(acc[i] - (acc[-1] - acc[i])))\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 27 }, { "user_id": "u941438707", "problem_id": "p02854", "submission1_id": "s459380367", "submission2_id": "s058483397", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,*a=map(int,open(0).read().split())\nb=sum(a)\nc=b\nd=200000\nfor i in a:\n c-=i\n if c<0:\n break\n d=min(d,c)\nprint(d)", "code2": "n,*a=map(int,open(0).read().split())\nb=sum(a)\nc=0\nd=2020202020\nfor i in a:\n c+=i\n d=min(d,abs(c-b/2))\nprint(int(d*2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574561598", "date2": "1574562939", "bleu_score": "0.7133386942800178", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 101, "input": "12\n010 3 66 4 1 477 001 1 179 100 -1 100\n", "actual_output": "0\n", "expected_output": "181\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n,*a=map(int,open(0).read().split())\n b=sum(a)\n-c=b\n-d=200000\n+c=0\n+d=2020202020\n for i in a:\n- c-=i\n- if c<0:\n- break\n- d=min(d,c)\n-print(d)\n+ c+=i\n+ d=min(d,abs(c-b/2))\n+print(int(d*2))\n", "FL_content": " n,*a=map(int,open(0).read().split())\n b=sum(a)\n-c=b\n-d=200000\n for i in a:\n- c-=i\n- if c<0:\n- break\n- d=min(d,c)\n-print(d)\n", "added_lines": 5, "removed_lines": 7, "code1_lines": 10 }, { "user_id": "u958693198", "problem_id": "p02854", "submission1_id": "s501688497", "submission2_id": "s299864365", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\n\nsum = 0\nfor i in range(n):\n sum += a[i]\n\nsum2 = 0\nfor i in range(n):\n sum2 += a[i]\n x = sum2*2 - sum\n if x >= 0:\n y = sum - sum2*2 - a[i]\n if x >= y:\n print(x)\n break\n else:\n print(y)\n break\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n\n\nsum = 0\nfor i in range(n):\n sum += a[i]\n\nsum2 = 0\nfor i in range(n):\n sum2 += a[i]\n x = sum2*2 - sum\n if x >= 0:\n y = sum - (sum2-a[i])*2\n if x <= y:\n print(x)\n break\n else:\n print(y)\n break\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574563005", "date2": "1574563330", "bleu_score": "0.9655650942875795", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 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, 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], "code1_test_score": 68, "total_score": 101, "input": "12\n011 11 54 192 125 344 010 349 196 161 48 111\n", "actual_output": "580\n", "expected_output": "118\n\n", "anno_code": ["n = int(input()) # (0): n=12\na = list(map(int, input().split())) # (1): a=[11, 11, 54, 192, 125, 344, 10, 349, 196, 161, 48, 111]\n\n\nsum = 0 # (2): sum=0\nfor i in range(n): # (3): i=0 (5): i=1 ... (27): NO CHANGE\n sum += a[i] # (4): sum=11 (6): sum=22 ... (26): sum=1612\n\nsum2 = 0 # (28): sum2=0\nfor i in range(n): # (29): i=0 (33): i=1 ... (57): i=7\n sum2 += a[i] # (30): sum2=11 (34): sum2=22 ... (58): sum2=1096\n x = sum2*2 - sum # (31): x=-1590 (35): x=-1568 ... (59): x=580\n if x >= 0: # (32): NO CHANGE (36): NO CHANGE ... (60): NO CHANGE\n y = sum - sum2*2 - a[i] # (61): y=-929\n if x >= y: # (62): NO CHANGE\n print(x) # (63): NO CHANGE\n break\n else:\n print(y)\n break\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n \n sum = 0\n for i in range(n):\n sum += a[i]\n \n sum2 = 0\n for i in range(n):\n sum2 += a[i]\n x = sum2*2 - sum\n if x >= 0:\n- y = sum - sum2*2 - a[i]\n- if x >= y:\n+ y = sum - (sum2-a[i])*2\n+ if x <= y:\n print(x)\n break\n else:\n print(y)\n break\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n \n \n sum = 0\n for i in range(n):\n sum += a[i]\n \n sum2 = 0\n for i in range(n):\n sum2 += a[i]\n x = sum2*2 - sum\n if x >= 0:\n- y = sum - sum2*2 - a[i]\n- if x >= y:\n print(x)\n break\n else:\n print(y)\n break\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 21 }, { "user_id": "u445983356", "problem_id": "p02854", "submission1_id": "s371315429", "submission2_id": "s675734824", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\n\nnow_length = sum(A)\nhalf = now_length / 2\nlow_price = now_length - sum(A[:int(N/2)])\n\nif half > low_price :\n for i in range(int(N/2),0,-1) :\n var = now_length - sum(A[:i])\n if half == low_price :\n break\n elif low_price > var :\n low_price = var\n else :\n break\nelse :\n for i in range(int(N/2)+1,N) :\n var = now_length - sum(A[:i])\n if half == low_price :\n break\n elif low_price > var :\n low_price = var\n else :\n break\n\nif low_price == half :\n print(0)\nelse :\n print(low_price)\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\n\nleft_length = sum(A[:int(N/2)])\nright_length = sum(A[int(N/2):])\nif left_length > right_length :\n price = left_length - right_length\n for i in range(int(N/2)-1,0,-1) :\n var = abs(sum(A[:i]) - sum(A[i:]))\n if price > var :\n price = var\n else :\n break\nelse :\n price = right_length - left_length\n for i in range(int(N/2)+1,N) :\n var = abs(sum(A[i:]) - sum(A[:i]))\n if price > var :\n price = var\n else :\n break\n\nprint(price)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574562802", "date2": "1574564838", "bleu_score": "0.6729719532926075", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 101, "input": "12\n011 5 54 192 167 344 010 349 91 195 3 111\n", "actual_output": "759\n", "expected_output": "14\n\n", "anno_code": ["N = int(input()) # (0): N=12\nA = list(map(int, input().split())) # (1): A=[11, 5, 54, 192, 167, 344, 10, 349, 91, 195, 3, 111]\n\nnow_length = sum(A) # (2): now_length=1532\nhalf = now_length / 2 # (3): half=766.0\nlow_price = now_length - sum(A[:int(N/2)]) # (4): low_price=759\n\nif half > low_price : # (5): NO CHANGE\n for i in range(int(N/2),0,-1) : # (6): i=6\n var = now_length - sum(A[:i]) # (7): var=759\n if half == low_price : # (8): NO CHANGE\n break\n elif low_price > var : # (9): NO CHANGE\n low_price = var\n else :\n break # (10): NO CHANGE\nelse :\n for i in range(int(N/2)+1,N) :\n var = now_length - sum(A[:i])\n if half == low_price :\n break\n elif low_price > var :\n low_price = var\n else :\n break\n\nif low_price == half : # (11): NO CHANGE\n print(0)\nelse :\n print(low_price)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n \n-now_length = sum(A)\n-half = now_length / 2\n-low_price = now_length - sum(A[:int(N/2)])\n-\n-if half > low_price :\n- for i in range(int(N/2),0,-1) :\n- var = now_length - sum(A[:i])\n- if half == low_price :\n- break\n- elif low_price > var :\n- low_price = var\n+left_length = sum(A[:int(N/2)])\n+right_length = sum(A[int(N/2):])\n+if left_length > right_length :\n+ price = left_length - right_length\n+ for i in range(int(N/2)-1,0,-1) :\n+ var = abs(sum(A[:i]) - sum(A[i:]))\n+ if price > var :\n+ price = var\n else :\n break\n else :\n+ price = right_length - left_length\n for i in range(int(N/2)+1,N) :\n- var = now_length - sum(A[:i])\n- if half == low_price :\n- break\n- elif low_price > var :\n- low_price = var\n+ var = abs(sum(A[i:]) - sum(A[:i]))\n+ if price > var :\n+ price = var\n else :\n break\n \n-if low_price == half :\n- print(0)\n-else :\n- print(low_price)\n-\n+print(price)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n \n-now_length = sum(A)\n-half = now_length / 2\n-low_price = now_length - sum(A[:int(N/2)])\n-\n-if half > low_price :\n- for i in range(int(N/2),0,-1) :\n- var = now_length - sum(A[:i])\n- if half == low_price :\n- break\n- elif low_price > var :\n- low_price = var\n else :\n break\n else :\n for i in range(int(N/2)+1,N) :\n- var = now_length - sum(A[:i])\n- if half == low_price :\n- break\n- elif low_price > var :\n- low_price = var\n else :\n break\n \n-if low_price == half :\n- print(0)\n-else :\n- print(low_price)\n-\n", "added_lines": 13, "removed_lines": 21, "code1_lines": 31 }, { "user_id": "u287500079", "problem_id": "p02854", "submission1_id": "s273156127", "submission2_id": "s716271041", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = [int(i) for i in input().split()]\nl = sum(a)\nl2 = l / 2\ntmp = 0\nerr = [l,l]\nerrindex = [0,0]\nfor i in range(n):\n tmp += a[i]\n if err[0] > l2 - tmp and l2 - tmp >= 0:\n err[0] = l2 - tmp\n if err[1] < tmp - l2 and l2 - tmp <= 0:\n err[1] = tmp - l2\nans = min(err)\nif ans != int(ans):\n ans += 1\nprint(int(ans))\n", "code2": "n = int(input())\na = [int(i) for i in input().split()]\nl = sum(a)\nl2 = l / 2\ntmp = 0\nerr = [l,l]\nerrindex = [0,0]\nans = 0\nfor i in range(n):\n tmp += a[i]\n if err[0] > l2 - tmp and l2 - tmp >= 0:\n err[0] = l2 - tmp\n if err[1] > tmp - l2 and l2 - tmp <= 0:\n err[1] = tmp - l2\n\ntmp2 = min(err)\ntmp3 = int(tmp2)\nans = tmp3 * 2 \nif tmp2 - tmp3 > 0:\n ans += 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574567783", "date2": "1574568731", "bleu_score": "0.8527021706549472", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 101, "input": "12\n011 19 54 192 125 344 010 349 196 104 48 111\n", "actual_output": "27\n", "expected_output": "53\n\n", "anno_code": ["n = int(input()) # (0): n=12\na = [int(i) for i in input().split()] # (1): a=[11, 19, 54, 192, 125, 344, 10, 349, 196, 104, 48, 111]\nl = sum(a) # (2): l=1563\nl2 = l / 2 # (3): l2=781.5\ntmp = 0 # (4): tmp=0\nerr = [l,l] # (5): err=[1563, 1563]\nerrindex = [0,0] # (6): errindex=[0, 0]\nfor i in range(n): # (7): i=0 (12): i=1 ... (62): NO CHANGE\n tmp += a[i] # (8): tmp=11 (13): tmp=30 ... (59): tmp=1563\n if err[0] > l2 - tmp and l2 - tmp >= 0: # (9): NO CHANGE (14): NO CHANGE ... (60): NO CHANGE\n err[0] = l2 - tmp # (10): err=[770.5, 1563] (15): err=[751.5, 1563] ... (40): err=[26.5, 1563]\n if err[1] < tmp - l2 and l2 - tmp <= 0: # (11): NO CHANGE (16): NO CHANGE ... (61): NO CHANGE\n err[1] = tmp - l2\nans = min(err) # (63): ans=26.5\nif ans != int(ans): # (64): NO CHANGE\n ans += 1 # (65): ans=27.5\nprint(int(ans))\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = [int(i) for i in input().split()]\n l = sum(a)\n l2 = l / 2\n tmp = 0\n err = [l,l]\n errindex = [0,0]\n+ans = 0\n for i in range(n):\n tmp += a[i]\n if err[0] > l2 - tmp and l2 - tmp >= 0:\n err[0] = l2 - tmp\n- if err[1] < tmp - l2 and l2 - tmp <= 0:\n+ if err[1] > tmp - l2 and l2 - tmp <= 0:\n err[1] = tmp - l2\n-ans = min(err)\n-if ans != int(ans):\n+\n+tmp2 = min(err)\n+tmp3 = int(tmp2)\n+ans = tmp3 * 2 \n+if tmp2 - tmp3 > 0:\n ans += 1\n-print(int(ans))\n+print(ans)\n \n", "FL_content": " n = int(input())\n a = [int(i) for i in input().split()]\n l = sum(a)\n l2 = l / 2\n tmp = 0\n err = [l,l]\n errindex = [0,0]\n for i in range(n):\n tmp += a[i]\n if err[0] > l2 - tmp and l2 - tmp >= 0:\n err[0] = l2 - tmp\n- if err[1] < tmp - l2 and l2 - tmp <= 0:\n err[1] = tmp - l2\n-ans = min(err)\n-if ans != int(ans):\n ans += 1\n-print(int(ans))\n \n", "added_lines": 8, "removed_lines": 4, "code1_lines": 18 }, { "user_id": "u647999897", "problem_id": "p02854", "submission1_id": "s009497090", "submission2_id": "s045464344", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve():\n N = int(input())\n A = list(map(int,input().split()))\n\n sm = sum(A)\n agg = 0\n idx = 0\n mid = sm / 2\n shrink_cnt = 0\n while agg < mid and idx < N-1:\n shrink_cnt += A[idx] - 1\n \n agg += A[idx]\n idx += 1\n \n shrink = (agg-mid) / 0.5\n expand = (mid - (agg-A[idx]))/0.5\n\n if shrink <= shrink_cnt:\n ans = min(shrink, expand)\n else:\n ans = expand\n \n print(int(ans))\n\nif __name__ == '__main__':\n solve()", "code2": "def solve():\n N = int(input())\n A = list(map(int,input().split()))\n\n sm = sum(A)\n agg = 0\n idx = 0\n mid = sm / 2\n shrink_cnt = sm - N\n while agg < mid and idx < N-1:\n \n agg += A[idx]\n idx += 1\n \n oneleft = agg\n oneright = sm - oneleft \n twoleft = agg-A[idx-1]\n tworight = sm - twoleft\n ans = min(abs(oneleft-oneright), abs(twoleft-tworight))\n\n print(int(ans))\n\nif __name__ == '__main__':\n solve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574564443", "date2": "1574565088", "bleu_score": "0.7126153876670813", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 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, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 22, "total_score": 101, "input": "12\n010 0 107 5 0 127 101 1 179 110 0 100\n", "actual_output": "-100\n", "expected_output": "38\n\n", "anno_code": ["def solve(): # (0): solve=\n N = int(input())\n A = list(map(int,input().split()))\n\n sm = sum(A)\n agg = 0\n idx = 0\n mid = sm / 2\n shrink_cnt = 0\n while agg < mid and idx < N-1:\n shrink_cnt += A[idx] - 1\n \n agg += A[idx]\n idx += 1\n \n shrink = (agg-mid) / 0.5\n expand = (mid - (agg-A[idx]))/0.5\n\n if shrink <= shrink_cnt:\n ans = min(shrink, expand)\n else:\n ans = expand\n \n print(int(ans))\n\nif __name__ == '__main__':\n solve()"], "anno_status": [true], "diff_content": " def solve():\n N = int(input())\n A = list(map(int,input().split()))\n \n sm = sum(A)\n agg = 0\n idx = 0\n mid = sm / 2\n- shrink_cnt = 0\n+ shrink_cnt = sm - N\n while agg < mid and idx < N-1:\n- shrink_cnt += A[idx] - 1\n \n agg += A[idx]\n idx += 1\n \n- shrink = (agg-mid) / 0.5\n- expand = (mid - (agg-A[idx]))/0.5\n+ oneleft = agg\n+ oneright = sm - oneleft \n+ twoleft = agg-A[idx-1]\n+ tworight = sm - twoleft\n+ ans = min(abs(oneleft-oneright), abs(twoleft-tworight))\n \n- if shrink <= shrink_cnt:\n- ans = min(shrink, expand)\n- else:\n- ans = expand\n- \n print(int(ans))\n \n if __name__ == '__main__':\n solve()\n", "FL_content": " def solve():\n N = int(input())\n A = list(map(int,input().split()))\n \n sm = sum(A)\n agg = 0\n idx = 0\n mid = sm / 2\n- shrink_cnt = 0\n while agg < mid and idx < N-1:\n- shrink_cnt += A[idx] - 1\n \n agg += A[idx]\n idx += 1\n \n- shrink = (agg-mid) / 0.5\n- expand = (mid - (agg-A[idx]))/0.5\n \n- if shrink <= shrink_cnt:\n- ans = min(shrink, expand)\n- else:\n- ans = expand\n- \n print(int(ans))\n \n if __name__ == '__main__':\n solve()\n", "added_lines": 6, "removed_lines": 9, "code1_lines": 27 }, { "user_id": "u602252807", "problem_id": "p02854", "submission1_id": "s947374469", "submission2_id": "s770878968", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\n \ns = sum(a)\n \nleft = 0\nright = s\nfor i in range(n-1):\n left += a[i]\n right -= a[i]\n if left >= s/2:\n right = s - left\n break\n\nif left == s/2:\n print(0)\nelse:\n print(abs(left-right))", "code2": "n = int(input())\na = list(map(int,input().split()))\n \ns = sum(a)\n \nleft = 0\nright = s\nres = s\nfor i in range(n-1):\n left += a[i]\n right -= a[i]\n res = min(res,abs(left-right))\n if res == 0:\n break\n \nprint(res)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574562661", "date2": "1574562963", "bleu_score": "0.757955470135666", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 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, 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], "code1_test_score": 69, "total_score": 101, "input": "12\n011 11 43 187 125 344 010 349 104 191 48 111\n", "actual_output": "626\n", "expected_output": "72\n\n", "anno_code": ["n = int(input()) # (0): n=12\na = list(map(int,input().split())) # (1): a=[11, 11, 43, 187, 125, 344, 10, 349, 104, 191, 48, 111]\n \ns = sum(a) # (2): s=1534\n \nleft = 0 # (3): left=0\nright = s # (4): right=1534\nfor i in range(n-1): # (5): i=0 (9): i=1 ... (33): i=7\n left += a[i] # (6): left=11 (10): left=22 ... (34): left=1080\n right -= a[i] # (7): right=1523 (11): right=1512 ... (35): right=454\n if left >= s/2: # (8): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n right = s - left # (37): NO CHANGE\n break # (38): NO CHANGE\n\nif left == s/2: # (39): NO CHANGE\n print(0)\nelse:\n print(abs(left-right))"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n \n s = sum(a)\n \n left = 0\n right = s\n+res = s\n for i in range(n-1):\n left += a[i]\n right -= a[i]\n- if left >= s/2:\n- right = s - left\n+ res = min(res,abs(left-right))\n+ if res == 0:\n break\n+ \n+print(res)\n+\n \n-if left == s/2:\n- print(0)\n-else:\n- print(abs(left-right))\n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n \n s = sum(a)\n \n left = 0\n right = s\n for i in range(n-1):\n left += a[i]\n right -= a[i]\n- if left >= s/2:\n- right = s - left\n break\n \n-if left == s/2:\n- print(0)\n-else:\n- print(abs(left-right))\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 18 }, { "user_id": "u395202850", "problem_id": "p02854", "submission1_id": "s333024052", "submission2_id": "s289176373", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport collections\nimport bisect\n\n\ndef main():\n n = int(input())\n AList = list(map(int, input().split()))\n sumAList = AList\n sumA = sum(AList)\n for i in range(n):\n if i != 0:\n AList[i] = AList[i] + AList[i - 1]\n if sumA - AList[i] <= AList[i]:\n print(abs(sumA - 2 * AList[i]))\n return\n\n print(sumAList)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\nimport collections\nimport bisect\n\n\ndef main():\n n = int(input())\n AList = list(map(int, input().split()))\n ASum = sum(AList)\n c = 0\n for i in range(n):\n c += AList[i]\n if c >= ASum / 2:\n k = i\n break\n ans = min(2 * c - ASum, ASum - 2 * c + 2 * AList[k])\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596406230", "date2": "1596406560", "bleu_score": "0.7195268880417287", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 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, 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], "code1_test_score": 68, "total_score": 101, "input": "12\n010 0 107 5 1 182 101 1 27 111 0 110\n", "actual_output": "157\n", "expected_output": "45\n\n", "anno_code": ["import sys\nimport collections\nimport bisect\n\n\ndef main(): # (0): main=\n n = int(input())\n AList = list(map(int, input().split()))\n sumAList = AList\n sumA = sum(AList)\n for i in range(n):\n if i != 0:\n AList[i] = AList[i] + AList[i - 1]\n if sumA - AList[i] <= AList[i]:\n print(abs(sumA - 2 * AList[i]))\n return\n\n print(sumAList)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n import collections\n import bisect\n \n \n def main():\n n = int(input())\n AList = list(map(int, input().split()))\n- sumAList = AList\n- sumA = sum(AList)\n+ ASum = sum(AList)\n+ c = 0\n for i in range(n):\n- if i != 0:\n- AList[i] = AList[i] + AList[i - 1]\n- if sumA - AList[i] <= AList[i]:\n- print(abs(sumA - 2 * AList[i]))\n- return\n-\n- print(sumAList)\n+ c += AList[i]\n+ if c >= ASum / 2:\n+ k = i\n+ break\n+ ans = min(2 * c - ASum, ASum - 2 * c + 2 * AList[k])\n+ print(ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import sys\n import collections\n import bisect\n \n \n def main():\n n = int(input())\n AList = list(map(int, input().split()))\n- sumAList = AList\n- sumA = sum(AList)\n for i in range(n):\n- if i != 0:\n- AList[i] = AList[i] + AList[i - 1]\n- if sumA - AList[i] <= AList[i]:\n- print(abs(sumA - 2 * AList[i]))\n- return\n-\n- print(sumAList)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 8, "removed_lines": 9, "code1_lines": 23 }, { "user_id": "u121161758", "problem_id": "p02854", "submission1_id": "s643644097", "submission2_id": "s854087911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\nN = int(input())\nA = list(map(int, input().split()))\n\nsum = 0\nfor i in range(len(A)):\n sum += A[i]\n\ncheck_sum = 0\nfor i in range(len(A)):\n check_sum += A[i]\n if check_sum == sum/2:\n print(0)\n exit()\n if check_sum > sum / 2:\n if i+ 1 == len(A):\n print(A[i] - (check_sum - A[i]))\n exit()\n else:\n print(abs(2* check_sum - sum))\n exit()\n", "code2": "\nimport math\nN = int(input())\nA = list(map(int, input().split()))\n\nsum = 0\nfor i in range(len(A)):\n sum += A[i]\n\ncheck_sum = 0\nfor i in range(len(A)):\n check_sum += A[i]\n if check_sum == sum/2:\n print(0)\n exit()\n if check_sum > sum / 2:\n if i+ 1 == len(A):\n print(A[i] - (check_sum - A[i]))\n exit()\n else:\n if (abs(2 * (check_sum - A[i]) - sum) < abs(2 * check_sum - sum)):\n print(abs(2 * (check_sum - A[i]) - sum))\n exit()\n \n else:\n print(abs(2 * check_sum - sum))\n exit()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574563119", "date2": "1574564097", "bleu_score": "0.6804698372391588", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 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, 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], "code1_test_score": 69, "total_score": 101, "input": "12\n011 10 33 24 167 344 110 310 91 110 4 011\n", "actual_output": "173\n", "expected_output": "47\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " \n import math\n N = int(input())\n A = list(map(int, input().split()))\n \n sum = 0\n for i in range(len(A)):\n sum += A[i]\n \n check_sum = 0\n for i in range(len(A)):\n check_sum += A[i]\n if check_sum == sum/2:\n print(0)\n exit()\n if check_sum > sum / 2:\n if i+ 1 == len(A):\n print(A[i] - (check_sum - A[i]))\n exit()\n else:\n- print(abs(2* check_sum - sum))\n- exit()\n+ if (abs(2 * (check_sum - A[i]) - sum) < abs(2 * check_sum - sum)):\n+ print(abs(2 * (check_sum - A[i]) - sum))\n+ exit()\n+ \n+ else:\n+ print(abs(2 * check_sum - sum))\n+ exit()\n \n", "FL_content": " \n import math\n N = int(input())\n A = list(map(int, input().split()))\n \n sum = 0\n for i in range(len(A)):\n sum += A[i]\n \n check_sum = 0\n for i in range(len(A)):\n check_sum += A[i]\n if check_sum == sum/2:\n print(0)\n exit()\n if check_sum > sum / 2:\n if i+ 1 == len(A):\n print(A[i] - (check_sum - A[i]))\n exit()\n else:\n- print(abs(2* check_sum - sum))\n- exit()\n \n", "added_lines": 7, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u134019875", "problem_id": "p02854", "submission1_id": "s383072838", "submission2_id": "s480714194", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nL = sum(a)\nl = 0\ni = 0\nwhile l < L / 2:\n l += a[i]\n i += 1\nif i + 1 <= len(a):\n ans = min(abs(sum(a[:i]) - sum(a[i:])), abs(sum(a[:i + 1]) - sum(a[i + 1:])))\nelse:\n ans = abs(sum(a[:i]) - sum(a[i:]))\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\nL = sum(a)\nl = 0\ni = 0\nwhile l < L / 2:\n l += a[i]\n i += 1\nprint(min(abs(sum(a[:i - 1]) - sum(a[i - 1:])), abs(sum(a[:i]) - sum(a[i:]))))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589502590", "date2": "1589502804", "bleu_score": "0.6461767785424803", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 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, 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], "code1_test_score": 68, "total_score": 101, "input": "12\n001 104 102 187 191 176 110 117 104 102 104 011\n", "actual_output": "213\n", "expected_output": "139\n\n", "anno_code": ["n = int(input()) # (0): n=12\na = list(map(int, input().split())) # (1): a=[1, 104, 102, 187, 191, 176, 110, 117, 104, 102, 104, 11]\nL = sum(a) # (2): L=1309\nl = 0 # (3): l=0\ni = 0 # (4): i=0\nwhile l < L / 2: # (5): NO CHANGE (8): NO CHANGE ... (23): NO CHANGE\n l += a[i] # (6): l=1 (9): l=105 ... (21): l=761\n i += 1 # (7): i=1 (10): i=2 ... (22): i=6\nif i + 1 <= len(a): # (24): NO CHANGE\n ans = min(abs(sum(a[:i]) - sum(a[i:])), abs(sum(a[:i + 1]) - sum(a[i + 1:]))) # (25): ans=213\nelse:\n ans = abs(sum(a[:i]) - sum(a[i:]))\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n L = sum(a)\n l = 0\n i = 0\n while l < L / 2:\n l += a[i]\n i += 1\n-if i + 1 <= len(a):\n- ans = min(abs(sum(a[:i]) - sum(a[i:])), abs(sum(a[:i + 1]) - sum(a[i + 1:])))\n-else:\n- ans = abs(sum(a[:i]) - sum(a[i:]))\n-print(ans)\n+print(min(abs(sum(a[:i - 1]) - sum(a[i - 1:])), abs(sum(a[:i]) - sum(a[i:]))))\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n L = sum(a)\n l = 0\n i = 0\n while l < L / 2:\n l += a[i]\n i += 1\n-if i + 1 <= len(a):\n- ans = min(abs(sum(a[:i]) - sum(a[i:])), abs(sum(a[:i + 1]) - sum(a[i + 1:])))\n-else:\n- ans = abs(sum(a[:i]) - sum(a[i:]))\n-print(ans)\n \n", "added_lines": 1, "removed_lines": 5, "code1_lines": 14 }, { "user_id": "u202406075", "problem_id": "p02854", "submission1_id": "s762017756", "submission2_id": "s323375737", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nn = int(input())\n\na = list(map(int, input().split()))\n\ncnt = 0\nsum_ = sum(a)/2\n\nfor i in range(n):\n cnt += a[i]\n if cnt == sum_:\n print(0)\n sys.exit()\n elif cnt > sum_:\n x1 = sum_ -cnt +a[i-1]\n if x1 <= cnt -sum_:\n x1 = cnt -sum_\n break\n\nprint(int(x1*2))", "code2": "import sys\n\nn = int(input())\n\na = list(map(int, input().split()))\n\ncnt = 0\nave = sum(a)/2\n\nfor i in range(n):\n cnt += a[i]\n if cnt == ave:\n print(0)\n sys.exit()\n \n elif cnt > ave:\n x = ave -cnt +a[i]\n if x >= cnt -ave:\n x = cnt -ave\n break\n\nprint(int(x*2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590372297", "date2": "1590373613", "bleu_score": "0.8477778670236881", "code1_test_status": [1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 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, 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, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 53, "total_score": 101, "input": "12\n100 104 102 105 103 103 100 105 104 102 104 101\n", "actual_output": "205\n", "expected_output": "1\n\n", "anno_code": ["import sys\n\nn = int(input()) # (0): n=12\n\na = list(map(int, input().split())) # (1): a=[100, 104, 102, 105, 103, 103, 100, 105, 104, 102, 104, 101]\n\ncnt = 0 # (2): cnt=0\nsum_ = sum(a)/2 # (3): sum_=616.5\n\nfor i in range(n): # (4): i=0 (8): i=1 ... (24): i=5\n cnt += a[i] # (5): cnt=100 (9): cnt=204 ... (25): cnt=617\n if cnt == sum_: # (6): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n print(0)\n sys.exit()\n elif cnt > sum_: # (7): NO CHANGE (11): NO CHANGE ... (27): NO CHANGE\n x1 = sum_ -cnt +a[i-1] # (28): x1=102.5\n if x1 <= cnt -sum_: # (29): NO CHANGE\n x1 = cnt -sum_\n break # (30): NO CHANGE\n\nprint(int(x1*2))"], "anno_status": [true], "diff_content": " import sys\n \n n = int(input())\n \n a = list(map(int, input().split()))\n \n cnt = 0\n-sum_ = sum(a)/2\n+ave = sum(a)/2\n \n for i in range(n):\n cnt += a[i]\n- if cnt == sum_:\n+ if cnt == ave:\n print(0)\n sys.exit()\n- elif cnt > sum_:\n- x1 = sum_ -cnt +a[i-1]\n- if x1 <= cnt -sum_:\n- x1 = cnt -sum_\n+ \n+ elif cnt > ave:\n+ x = ave -cnt +a[i]\n+ if x >= cnt -ave:\n+ x = cnt -ave\n break\n \n-print(int(x1*2))\n+print(int(x*2))\n", "FL_content": " import sys\n \n n = int(input())\n \n a = list(map(int, input().split()))\n \n cnt = 0\n-sum_ = sum(a)/2\n \n for i in range(n):\n cnt += a[i]\n- if cnt == sum_:\n print(0)\n sys.exit()\n- elif cnt > sum_:\n- x1 = sum_ -cnt +a[i-1]\n- if x1 <= cnt -sum_:\n- x1 = cnt -sum_\n break\n \n-print(int(x1*2))\n", "added_lines": 8, "removed_lines": 7, "code1_lines": 21 }, { "user_id": "u445983356", "problem_id": "p02854", "submission1_id": "s631988534", "submission2_id": "s675734824", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\n\nprint(int(N/2))\n\nleft_length = sum(A[:int(N/2)])\nright_length = sum(A[int(N/2):])\nif left_length > right_length :\n price = left_length - right_length\n for i in range(int(N/2)-1,0,-1) :\n var = sum(A[i:]) - sum(A[:i])\n if price > var :\n price = var\n else :\n break\nelse :\n price = right_length - left_length\n for i in range(int(N/2)+1,N) :\n var = sum(A[:i]) - sum(A[i:])\n if price > var :\n price = var\n else :\n break\n\nprint(price)", "code2": "N = int(input())\nA = list(map(int, input().split()))\n\nleft_length = sum(A[:int(N/2)])\nright_length = sum(A[int(N/2):])\nif left_length > right_length :\n price = left_length - right_length\n for i in range(int(N/2)-1,0,-1) :\n var = abs(sum(A[:i]) - sum(A[i:]))\n if price > var :\n price = var\n else :\n break\nelse :\n price = right_length - left_length\n for i in range(int(N/2)+1,N) :\n var = abs(sum(A[i:]) - sum(A[:i]))\n if price > var :\n price = var\n else :\n break\n\nprint(price)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574564539", "date2": "1574564838", "bleu_score": "0.9615261475630733", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n010 18 33 5 1 477 011 1 179 100 -1 001\n", "actual_output": "6\n253\n", "expected_output": "253\n\n", "anno_code": ["N = int(input()) # (0): N=12\nA = list(map(int, input().split())) # (1): A=[10, 18, 33, 5, 1, 477, 11, 1, 179, 100, -1, 1]\n\nprint(int(N/2)) # (2): NO CHANGE\n\nleft_length = sum(A[:int(N/2)]) # (3): left_length=544\nright_length = sum(A[int(N/2):]) # (4): right_length=291\nif left_length > right_length : # (5): NO CHANGE\n price = left_length - right_length # (6): price=253\n for i in range(int(N/2)-1,0,-1) : # (7): i=5\n var = sum(A[i:]) - sum(A[:i]) # (8): var=701\n if price > var : # (9): NO CHANGE\n price = var\n else :\n break # (10): NO CHANGE\nelse :\n price = right_length - left_length\n for i in range(int(N/2)+1,N) :\n var = sum(A[:i]) - sum(A[i:])\n if price > var :\n price = var\n else :\n break\n\nprint(price)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n \n-print(int(N/2))\n-\n left_length = sum(A[:int(N/2)])\n right_length = sum(A[int(N/2):])\n if left_length > right_length :\n price = left_length - right_length\n for i in range(int(N/2)-1,0,-1) :\n- var = sum(A[i:]) - sum(A[:i])\n+ var = abs(sum(A[:i]) - sum(A[i:]))\n if price > var :\n price = var\n else :\n break\n else :\n price = right_length - left_length\n for i in range(int(N/2)+1,N) :\n- var = sum(A[:i]) - sum(A[i:])\n+ var = abs(sum(A[i:]) - sum(A[:i]))\n if price > var :\n price = var\n else :\n break\n \n print(price)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n \n-print(int(N/2))\n-\n left_length = sum(A[:int(N/2)])\n right_length = sum(A[int(N/2):])\n if left_length > right_length :\n price = left_length - right_length\n for i in range(int(N/2)-1,0,-1) :\n- var = sum(A[i:]) - sum(A[:i])\n if price > var :\n price = var\n else :\n break\n else :\n price = right_length - left_length\n for i in range(int(N/2)+1,N) :\n- var = sum(A[:i]) - sum(A[i:])\n if price > var :\n price = var\n else :\n break\n \n print(price)\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 25 }, { "user_id": "u105124953", "problem_id": "p02854", "submission1_id": "s184619545", "submission2_id": "s748267282", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nli = list(map(int,input().split()))\ns = sum(li)\nsum_li = []\nfor i,l in enumerate(li):\n if i == 0:\n sum_li.append(l)\n continue\n sum_li.append(sum_li[-1]+l)\nall_li = []\nfor ss in sum_li:\n \n all_li.append(abs(s-ss))\nprint(min(all_li))\n", "code2": "n = int(input())\nli = list(map(int,input().split()))\ns = sum(li)\nsum_li = []\nfor i,l in enumerate(li):\n if i == 0:\n sum_li.append(l)\n continue\n sum_li.append(sum_li[-1]+l)\nall_li = []\nfor ii,ss in enumerate(sum_li):\n if ii == len(sum_li)-1:\n break\n all_li.append(abs(s-2*ss))\n\nprint(min(all_li))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587173696", "date2": "1587174087", "bleu_score": "0.8097571447115719", "code1_test_status": [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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 101, "input": "12\n011 11 54 192 125 344 010 349 104 161 48 111\n", "actual_output": "0\n", "expected_output": "26\n\n", "anno_code": ["n = int(input()) # (0): n=12\nli = list(map(int,input().split())) # (1): li=[11, 11, 54, 192, 125, 344, 10, 349, 104, 161, 48, 111]\ns = sum(li) # (2): s=1520\nsum_li = [] # (3): sum_li=[]\nfor i,l in enumerate(li): # (4): i=0, l=11 (8): i=1 ... (41): NO CHANGE\n if i == 0: # (5): NO CHANGE (9): NO CHANGE ... (39): NO CHANGE\n sum_li.append(l) # (6): sum_li=[11]\n continue # (7): NO CHANGE\n sum_li.append(sum_li[-1]+l) # (10): sum_li=[11, 22] (13): sum_li=[11, 22, 76] ... (40): sum_li=[11, 22, 76, 268, 393, 737, 747, 1096, 1200, 1361, 1409, 1520]\nall_li = [] # (42): all_li=[]\nfor ss in sum_li: # (43): ss=11 (45): ss=22 ... (67): NO CHANGE\n \n all_li.append(abs(s-ss)) # (44): all_li=[1509] (46): all_li=[1509, 1498] ... (66): all_li=[1509, 1498, 1444, 1252, 1127, 783, 773, 424, 320, 159, 111, 0]\nprint(min(all_li))\n"], "anno_status": [true], "diff_content": " n = int(input())\n li = list(map(int,input().split()))\n s = sum(li)\n sum_li = []\n for i,l in enumerate(li):\n if i == 0:\n sum_li.append(l)\n continue\n sum_li.append(sum_li[-1]+l)\n all_li = []\n-for ss in sum_li:\n- \n- all_li.append(abs(s-ss))\n-print(min(all_li))\n+for ii,ss in enumerate(sum_li):\n+ if ii == len(sum_li)-1:\n+ break\n+ all_li.append(abs(s-2*ss))\n \n+print(min(all_li))\n", "FL_content": " n = int(input())\n li = list(map(int,input().split()))\n s = sum(li)\n sum_li = []\n for i,l in enumerate(li):\n if i == 0:\n sum_li.append(l)\n continue\n sum_li.append(sum_li[-1]+l)\n all_li = []\n-for ss in sum_li:\n- \n- all_li.append(abs(s-ss))\n-print(min(all_li))\n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 15 }, { "user_id": "u692053345", "problem_id": "p02854", "submission1_id": "s866799807", "submission2_id": "s823523356", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nS=list(map(int, input().split()))\nSum=sum(S)\n\nwa=0\ncount=0\nfor i in range(n):\n if wa\n r = [0] * (N+1)\n rr = [0] * (N+1)\n\n for i in range(1,N+1):\n r[i] = r[i-1] + A[i-1]\n rr[i] = rr[i-1] + A[i-1]-1\n\n from bisect import bisect_left\n c = sum(A)/2\n p = bisect_left(r, c)\n t = (r[p] - c)/0.5\n print(int(t))\n\n return\n\n\n\ndef main(): # (3): 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 A = [int(next(tokens)) for _ in range(N)] \n solve(N, A)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n sys.setrecursionlimit(10000000)\n INF = 1<<32\n \n \n def solve(N: int, A: \"List[int]\"):\n r = [0] * (N+1)\n rr = [0] * (N+1)\n \n for i in range(1,N+1):\n r[i] = r[i-1] + A[i-1]\n- rr[i] = rr[i-1] + A[i-1]-1\n+ \n+ for i in range(N-1, -1, -1):\n+ rr[i] = rr[i+1] + A[i]\n \n- from bisect import bisect_left\n- c = sum(A)/2\n- p = bisect_left(r, c)\n- t = (r[p] - c)/0.5\n- print(int(t))\n+ ans = INF\n+ for i in range(1,N):\n+ ans = min(ans, abs(r[i]-rr[i]))\n \n+ print(ans)\n+\n+ \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 A = [int(next(tokens)) for _ in range(N)] \n solve(N, A)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n sys.setrecursionlimit(10000000)\n INF = 1<<32\n \n \n def solve(N: int, A: \"List[int]\"):\n r = [0] * (N+1)\n rr = [0] * (N+1)\n \n for i in range(1,N+1):\n r[i] = r[i-1] + A[i-1]\n- rr[i] = rr[i-1] + A[i-1]-1\n \n- from bisect import bisect_left\n- c = sum(A)/2\n- p = bisect_left(r, c)\n- t = (r[p] - c)/0.5\n- print(int(t))\n \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 A = [int(next(tokens)) for _ in range(N)] \n solve(N, A)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 9, "removed_lines": 6, "code1_lines": 37 }, { "user_id": "u251075661", "problem_id": "p02854", "submission1_id": "s482839205", "submission2_id": "s913993769", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\naaa = map(int, input().split())\n\nlength = 0\nlengths = []\nfor a in aaa:\n length += a\n lengths.append(length)\n \ndiff = 999999\nfor l in lengths:\n if abs(l - (length - l)) < diff:\n diff = abs(l - (length - l))\n else:\n break\n \nprint(diff)", "code2": "n = int(input())\naaa = map(int, input().split())\n\nlength = 0\nlengths = []\nfor a in aaa:\n length += a\n lengths.append(length)\n \ndiffs = []\nfor l in lengths:\n diff = abs(l - (length - l))\n diffs.append(diff)\n \nprint(min(diffs))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574562110", "date2": "1574563122", "bleu_score": "0.7770587701347292", "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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 88, "total_score": 101, "input": "12\n001 0 107 5 0 196 001 1 2 101 0 110\n", "actual_output": "522\n", "expected_output": "94\n\n", "anno_code": ["n = int(input()) # (0): n=12\naaa = map(int, input().split()) # (1): aaa=\n\nlength = 0 # (2): length=0\nlengths = [] # (3): lengths=[]\nfor a in aaa: # (4): a=1 (7): a=0 ... (40): NO CHANGE\n length += a # (5): length=1 (8): NO CHANGE ... (38): length=524\n lengths.append(length) # (6): lengths=[1] (9): lengths=[1, 1] ... (39): lengths=[1, 1, 108, 113, 113, 309, 310, 311, 313, 414, 414, 524]\n \ndiff = 999999 # (41): diff=999999\nfor l in lengths: # (42): l=1 (45): NO CHANGE\n if abs(l - (length - l)) < diff: # (43): NO CHANGE (46): NO CHANGE\n diff = abs(l - (length - l)) # (44): diff=522\n else:\n break # (47): NO CHANGE\n \nprint(diff)"], "anno_status": [true], "diff_content": " n = int(input())\n aaa = map(int, input().split())\n \n length = 0\n lengths = []\n for a in aaa:\n length += a\n lengths.append(length)\n \n-diff = 999999\n+diffs = []\n for l in lengths:\n- if abs(l - (length - l)) < diff:\n- diff = abs(l - (length - l))\n- else:\n- break\n+ diff = abs(l - (length - l))\n+ diffs.append(diff)\n \n-print(diff)\n+print(min(diffs))\n", "FL_content": " n = int(input())\n aaa = map(int, input().split())\n \n length = 0\n lengths = []\n for a in aaa:\n length += a\n lengths.append(length)\n \n-diff = 999999\n for l in lengths:\n- if abs(l - (length - l)) < diff:\n- diff = abs(l - (length - l))\n- else:\n- break\n \n-print(diff)\n", "added_lines": 4, "removed_lines": 6, "code1_lines": 17 }, { "user_id": "u088552457", "problem_id": "p02767", "submission1_id": "s524814910", "submission2_id": "s745079116", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = list(map(int, input().split()))\n\nmax_x = max(x)\nmin_x = min(x)\n\nans = []\nfor i in range(1, 101):\n a = 0\n for xi in x:\n a += (xi - (i+1))*(xi - (i+1))\n ans.append(a)\n \nprint(min(ans))", "code2": "n = int(input())\nx = list(map(int, input().split()))\n\nmax_x = max(x)\nmin_x = min(x)\n\nans = []\nfor i in range(1, 101):\n a = 0\n for xi in x:\n a += (xi - i)*(xi - i)\n ans.append(a)\n \nprint(min(ans))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582425427", "date2": "1582425507", "bleu_score": "0.9394112720431046", "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, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 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], "code1_test_score": 83, "total_score": 97, "input": "7\n1 2 2 2 9 -3 -4\n", "actual_output": "111\n", "expected_output": "108\n\n", "anno_code": ["n = int(input()) # (0): n=7\nx = list(map(int, input().split())) # (1): x=[1, 2, 2, 2, 9, -3, -4]\n\nmax_x = max(x) # (2): max_x=9\nmin_x = min(x) # (3): min_x=-4\n\nans = [] # (4): ans=[]\nfor i in range(1, 101): # (5): i=1 (23): i=2 ... (1805): NO CHANGE\n a = 0 # (6): a=0 (24): a=0 ... (1788): a=0\n for xi in x: # (7): xi=1 (9): xi=2 ... (1803): NO CHANGE\n a += (xi - (i+1))*(xi - (i+1)) # (8): a=1 (10): NO CHANGE ... (1802): a=69708\n ans.append(a) # (22): ans=[111] (40): ans=[111, 128] ... (1804): ans=[111, 128, ..., 68319, 69708]\n \nprint(min(ans))"], "anno_status": [true], "diff_content": " n = int(input())\n x = list(map(int, input().split()))\n \n max_x = max(x)\n min_x = min(x)\n \n ans = []\n for i in range(1, 101):\n a = 0\n for xi in x:\n- a += (xi - (i+1))*(xi - (i+1))\n+ a += (xi - i)*(xi - i)\n ans.append(a)\n \n print(min(ans))\n", "FL_content": " n = int(input())\n x = list(map(int, input().split()))\n \n max_x = max(x)\n min_x = min(x)\n \n ans = []\n for i in range(1, 101):\n a = 0\n for xi in x:\n- a += (xi - (i+1))*(xi - (i+1))\n ans.append(a)\n \n print(min(ans))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u411302151", "problem_id": "p02767", "submission1_id": "s437066355", "submission2_id": "s627952946", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nl = map(int, input().split())\n\nmean = int(sum(l)/N)\n\nstamina = 0\n\nfor p in l:\n\tstamina += (p - mean)**2\n \nprint(stamina)", "code2": "N = int(input())\nl = list(map(int, input().split()))\n\nmean = round(sum(l)/N)\nstamina = 0\n\nfor p in l:\n stamina += (p - mean)**2\n\nprint(stamina)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588751404", "date2": "1588751804", "bleu_score": "0.8768173714801014", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "7\n11 14 3 33 56 1 0\n", "actual_output": "0\n", "expected_output": "2563\n\n", "anno_code": ["N = int(input()) # (0): N=7\nl = map(int, input().split()) # (1): l=\n\nmean = int(sum(l)/N) # (2): mean=16\n\nstamina = 0 # (3): stamina=0\n\nfor p in l: # (4): NO CHANGE\n\tstamina += (p - mean)**2\n \nprint(stamina)"], "anno_status": [true], "diff_content": " N = int(input())\n-l = map(int, input().split())\n-\n-mean = int(sum(l)/N)\n+l = list(map(int, input().split()))\n \n+mean = round(sum(l)/N)\n stamina = 0\n \n for p in l:\n-\tstamina += (p - mean)**2\n- \n+ stamina += (p - mean)**2\n+\n print(stamina)\n", "FL_content": " N = int(input())\n-l = map(int, input().split())\n-\n-mean = int(sum(l)/N)\n \n stamina = 0\n \n for p in l:\n-\tstamina += (p - mean)**2\n- \n print(stamina)\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u777394984", "problem_id": "p02767", "submission1_id": "s520747654", "submission2_id": "s062389045", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n import math\n n = int(input())\n x = list(map(int,input().split()))\n b = math.ceil(sum(x)/n)\n m = 0\n for i in x:\n m += (i-b) * (i-b)\n print(m)\nresolve()", "code2": "def resolve():\n n = int(input())\n x = list(map(int,input().split()))\n b = round(sum(x)/n)\n m = 0\n for i in x:\n m += (i-b) * (i-b)\n print(m)\nresolve()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582424439", "date2": "1582425021", "bleu_score": "0.8610399446587435", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 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, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1], "code1_test_score": 48, "total_score": 97, "input": "7\n0 1 0 0 198 2 -2\n", "actual_output": "33558\n", "expected_output": "33557\n\n", "anno_code": ["def resolve(): # (0): resolve=\n import math\n n = int(input()) # (2): n=7\n x = list(map(int,input().split())) # (3): x=[0, 1, 0, 0, 198, 2, -2]\n b = math.ceil(sum(x)/n) # (4): b=29\n m = 0 # (5): m=0\n for i in x: # (6): i=0 (8): i=1 ... (20): NO CHANGE\n m += (i-b) * (i-b) # (7): m=841 (9): m=1625 ... (19): m=33558\n print(m)\nresolve() # (1): math=\n"], "anno_status": [true], "diff_content": " def resolve():\n- import math\n n = int(input())\n x = list(map(int,input().split()))\n- b = math.ceil(sum(x)/n)\n+ b = round(sum(x)/n)\n m = 0\n for i in x:\n m += (i-b) * (i-b)\n print(m)\n resolve()\n", "FL_content": " def resolve():\n- import math\n n = int(input())\n x = list(map(int,input().split()))\n- b = math.ceil(sum(x)/n)\n m = 0\n for i in x:\n m += (i-b) * (i-b)\n print(m)\n resolve()\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u336564899", "problem_id": "p02767", "submission1_id": "s493557554", "submission2_id": "s396229815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = list(map(int, input().split()))\n\np0 = sum(x)\n\ncost = 10**9\nfor i in range(1,101):\n now = 0\n for j in x:\n now += abs(i-j)**2\n if cost > now:\n cost = now\n\nprint(now)\n", "code2": "\nn = int(input())\nx = list(map(int, input().split()))\ncost = 10**9\nfor i in range(1,100):\n now = 0\n for j in x:\n now += (i-j)**2\n if cost > now:\n cost = now\nprint(cost)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582429760", "date2": "1582429911", "bleu_score": "0.867470539938842", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "7\n4 14 0 12 21 0 0\n", "actual_output": "60597\n", "expected_output": "426\n\n", "anno_code": ["n = int(input()) # (0): n=7\nx = list(map(int, input().split())) # (1): x=[4, 14, 0, 12, 21, 0, 0]\n\np0 = sum(x) # (2): p0=51\n\ncost = 10**9 # (3): cost=1000000000\nfor i in range(1,101): # (4): i=1 (23): i=2 ... (1811): NO CHANGE\n now = 0 # (5): now=0 (24): now=0 ... (1794): now=0\n for j in x: # (6): j=4 (8): j=14 ... (1809): NO CHANGE\n now += abs(i-j)**2 # (7): now=9 (9): now=178 ... (1808): now=60597\n if cost > now: # (21): NO CHANGE (40): NO CHANGE ... (1810): NO CHANGE\n cost = now # (22): cost=702 (41): cost=621 ... (136): cost=426\n\nprint(now)\n"], "anno_status": [true], "diff_content": "+\n n = int(input())\n x = list(map(int, input().split()))\n-\n-p0 = sum(x)\n-\n cost = 10**9\n-for i in range(1,101):\n+for i in range(1,100):\n now = 0\n for j in x:\n- now += abs(i-j)**2\n+ now += (i-j)**2\n if cost > now:\n cost = now\n-\n-print(now)\n+print(cost)\n \n", "FL_content": " n = int(input())\n x = list(map(int, input().split()))\n-\n-p0 = sum(x)\n-\n cost = 10**9\n-for i in range(1,101):\n now = 0\n for j in x:\n- now += abs(i-j)**2\n if cost > now:\n cost = now\n-\n-print(now)\n \n", "added_lines": 4, "removed_lines": 7, "code1_lines": 15 }, { "user_id": "u357751375", "problem_id": "p02767", "submission1_id": "s505105361", "submission2_id": "s705211657", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = list(map(int,input().split()))\nm = 0\nj = max(x)\n\nfor p in range(j):\n c = 0\n for i in range(n):\n p = (i+1) * (i+1) - n\n c = c + (p * p)\n \n if m == 0:\n m = c\n else:\n if m > c:\n m = c\n\nprint(c)", "code2": "n = int(input())\nx = list(map(int,input().split()))\nj = max(x)\nm = 0\ny = True\n\nfor i in range(n):\n if x[0] != x[i]:\n y = False\n\nif y:\n print(0)\n exit(0)\n\nfor p in range(j):\n c = 0\n z = 0\n for i in range(n):\n z = x[i] - p\n c = c + (z * z)\n \n if m == 0:\n m = c\n else:\n if m > c:\n m = c\n\nprint(m)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591984316", "date2": "1591985231", "bleu_score": "0.6569205869264354", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "7\n-2 2 4 6 -1 -1 -3\n", "actual_output": "3059\n", "expected_output": "68\n\n", "anno_code": ["n = int(input()) # (0): n=7\nx = list(map(int,input().split())) # (1): x=[-2, 2, 4, 6, -1, -1, -3]\nm = 0 # (2): m=0\nj = max(x) # (3): j=6\n\nfor p in range(j): # (4): p=0 (30): p=1 ... (160): NO CHANGE\n c = 0 # (5): c=0 (31): c=0 ... (135): c=0\n for i in range(n): # (6): i=0 (9): i=1 ... (157): NO CHANGE\n p = (i+1) * (i+1) - n # (7): p=-6 (10): p=-3 ... (155): p=42\n c = c + (p * p) # (8): c=36 (11): c=45 ... (156): c=3059\n \n if m == 0: # (28): NO CHANGE (54): NO CHANGE ... (158): NO CHANGE\n m = c # (29): m=3059\n else:\n if m > c: # (55): NO CHANGE (81): NO CHANGE ... (159): NO CHANGE\n m = c\n\nprint(c)"], "anno_status": [true], "diff_content": " n = int(input())\n x = list(map(int,input().split()))\n-m = 0\n j = max(x)\n+m = 0\n+y = True\n+\n+for i in range(n):\n+ if x[0] != x[i]:\n+ y = False\n+\n+if y:\n+ print(0)\n+ exit(0)\n \n for p in range(j):\n c = 0\n+ z = 0\n for i in range(n):\n- p = (i+1) * (i+1) - n\n- c = c + (p * p)\n+ z = x[i] - p\n+ c = c + (z * z)\n \n if m == 0:\n m = c\n else:\n if m > c:\n m = c\n \n-print(c)\n+print(m)\n", "FL_content": " n = int(input())\n x = list(map(int,input().split()))\n-m = 0\n j = max(x)\n \n for p in range(j):\n c = 0\n for i in range(n):\n- p = (i+1) * (i+1) - n\n- c = c + (p * p)\n \n if m == 0:\n m = c\n else:\n if m > c:\n m = c\n \n-print(c)\n", "added_lines": 14, "removed_lines": 4, "code1_lines": 18 }, { "user_id": "u057415180", "problem_id": "p02767", "submission1_id": "s106727943", "submission2_id": "s375562456", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = list(map(int, input().split()))\nans = 10 ** 9\nfor p in range(0, n+1):\n cnt = 0\n for i in x:\n cnt += (i-p)**2\n ans = min(ans, cnt)\nprint(ans)", "code2": "n = int(input())\nx = list(map(int, input().split()))\nans = 10 ** 9\nfor p in range(0, 101):\n cnt = 0\n for i in x:\n cnt += (i-p)**2\n ans = min(ans, cnt)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582472066", "date2": "1582472096", "bleu_score": "0.9799940387680655", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 49, "total_score": 97, "input": "7\n0 1 0 0 198 2 -2\n", "actual_output": "36770\n", "expected_output": "33557\n\n", "anno_code": ["n = int(input()) # (0): n=7\nx = list(map(int, input().split())) # (1): x=[0, 1, 0, 0, 198, 2, -2]\nans = 10 ** 9 # (2): ans=1000000000\nfor p in range(0, n+1): # (3): p=0 (21): p=1 ... (147): NO CHANGE\n cnt = 0 # (4): cnt=0 (22): cnt=0 ... (130): cnt=0\n for i in x: # (5): i=0 (7): i=1 ... (145): NO CHANGE\n cnt += (i-p)**2 # (6): NO CHANGE (8): cnt=1 ... (144): cnt=36770\n ans = min(ans, cnt) # (20): ans=39213 (38): ans=38822 ... (146): ans=36770\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n x = list(map(int, input().split()))\n ans = 10 ** 9\n-for p in range(0, n+1):\n+for p in range(0, 101):\n cnt = 0\n for i in x:\n cnt += (i-p)**2\n ans = min(ans, cnt)\n print(ans)\n", "FL_content": " n = int(input())\n x = list(map(int, input().split()))\n ans = 10 ** 9\n-for p in range(0, n+1):\n cnt = 0\n for i in x:\n cnt += (i-p)**2\n ans = min(ans, cnt)\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u096294926", "problem_id": "p02767", "submission1_id": "s356318047", "submission2_id": "s669248289", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nN = int(input())\nX = list(map(int,input().split()))\na = sum(X)\nmean = a/N\nb = 0\nfor i in range(N):\n b +=(X[i]-mean)**2\nprint(math.ceil(b))", "code2": "import math\nfrom statistics import mean, median,variance,stdev\nN = int(input())\nX = list(map(int,input().split()))\na = sum(X)\nave = round(a/N)\nb = 0\nfor i in range(N):\n b +=(X[i]-ave)**2\nprint(b)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582426934", "date2": "1582429404", "bleu_score": "0.6660731629668106", "code1_test_status": [1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 64, "total_score": 97, "input": "7\n4 14 0 12 21 2 0\n", "actual_output": "400\n", "expected_output": "401\n\n", "anno_code": ["import math\nN = int(input()) # (0): N=7\nX = list(map(int,input().split())) # (1): X=[4, 14, 0, 12, 21, 2, 0]\na = sum(X) # (2): a=53\nmean = a/N # (3): mean=7.571429\nb = 0 # (4): b=0\nfor i in range(N): # (5): i=0 (7): i=1 ... (19): NO CHANGE\n b +=(X[i]-mean)**2 # (6): b=12.755102 (8): b=54.081633 ... (18): b=399.714286\nprint(math.ceil(b))"], "anno_status": [true], "diff_content": " import math\n+from statistics import mean, median,variance,stdev\n N = int(input())\n X = list(map(int,input().split()))\n a = sum(X)\n-mean = a/N\n+ave = round(a/N)\n b = 0\n for i in range(N):\n- b +=(X[i]-mean)**2\n-print(math.ceil(b))\n+ b +=(X[i]-ave)**2\n+print(b)\n", "FL_content": " import math\n N = int(input())\n X = list(map(int,input().split()))\n a = sum(X)\n-mean = a/N\n b = 0\n for i in range(N):\n- b +=(X[i]-mean)**2\n-print(math.ceil(b))\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u868577139", "problem_id": "p02767", "submission1_id": "s908496794", "submission2_id": "s048763211", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nX=list(map(int,input().split()))\np=sum(X)\nans=0\nfor i in range(len(X)):\n ans+=(X[i]-p)**2\nprint(ans)\n", "code2": "N=int(input())\nX=list(map(int,input().split()))\np=round(sum(X)/len(X))\nans=0\nfor i in range(len(X)):\n ans+=(X[i]-p)**2\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586576707", "date2": "1586576779", "bleu_score": "0.8761533145829353", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "7\n0 1 0 19 82 0 -1\n", "actual_output": "58092\n", "expected_output": "5631\n\n", "anno_code": ["N=int(input()) # (0): N=7\nX=list(map(int,input().split())) # (1): X=[0, 1, 0, 19, 82, 0, -1]\np=sum(X) # (2): p=101\nans=0 # (3): ans=0\nfor i in range(len(X)): # (4): i=0 (6): i=1 ... (18): NO CHANGE\n ans+=(X[i]-p)**2 # (5): ans=10201 (7): ans=20201 ... (17): ans=58092\nprint(ans)\n"], "anno_status": [true], "diff_content": " N=int(input())\n X=list(map(int,input().split()))\n-p=sum(X)\n+p=round(sum(X)/len(X))\n ans=0\n for i in range(len(X)):\n ans+=(X[i]-p)**2\n print(ans)\n \n", "FL_content": " N=int(input())\n X=list(map(int,input().split()))\n-p=sum(X)\n ans=0\n for i in range(len(X)):\n ans+=(X[i]-p)**2\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u255673886", "problem_id": "p02767", "submission1_id": "s574132154", "submission2_id": "s314698363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = list(map(int,input().split()))\nm = 10**10\nfor p in range(x[0],x[n-1]+1):\n power = 0\n for i in range(n):\n power += (x[i]-p)**2\n m = min(m,power)\nprint(m)", "code2": "n = int(input())\nx = list(map(int,input().split()))\nx = sorted(x)\nm = 10**20\nfor p in range(x[0],x[n-1]+1):\n power = 0\n for i in range(n):\n power += (x[i]-p)**2\n m = min(m,power)\nprint(m)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583733698", "date2": "1583733824", "bleu_score": "0.9167975261227104", "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, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 4, "total_score": 97, "input": "7\n0 2 2 2 9 -2 -4\n", "actual_output": "10000000000\n", "expected_output": "102\n\n", "anno_code": ["n = int(input()) # (0): n=7\nx = list(map(int,input().split())) # (1): x=[0, 2, 2, 2, 9, -2, -4]\nm = 10**10 # (2): m=10000000000\nfor p in range(x[0],x[n-1]+1): # (3): NO CHANGE\n power = 0\n for i in range(n):\n power += (x[i]-p)**2\n m = min(m,power)\nprint(m)"], "anno_status": [true], "diff_content": " n = int(input())\n x = list(map(int,input().split()))\n-m = 10**10\n+x = sorted(x)\n+m = 10**20\n for p in range(x[0],x[n-1]+1):\n power = 0\n for i in range(n):\n power += (x[i]-p)**2\n m = min(m,power)\n print(m)\n", "FL_content": " n = int(input())\n x = list(map(int,input().split()))\n-m = 10**10\n for p in range(x[0],x[n-1]+1):\n power = 0\n for i in range(n):\n power += (x[i]-p)**2\n m = min(m,power)\n print(m)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u201928947", "problem_id": "p02767", "submission1_id": "s702495630", "submission2_id": "s407925636", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nx = list(map(int,input().split()))\nm_energy = 250000\nfor i in range(1,101):\n energy = 0\n for k in range(n):\n m_energy += (x[k]-1)**2\n if energy < m_energy:\n m_energy = energy\nprint(m_energy)", "code2": "n = int(input())\nx = list(map(int,input().split()))\nm_energy = 250000\nfor i in range(1,101):\n energy = 0\n for k in range(n):\n energy += (x[k]-i)**2\n if energy < m_energy:\n m_energy = energy\nprint(m_energy)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582903747", "date2": "1582903854", "bleu_score": "0.9719369715308394", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "7\n1 2 3 2 9 -3 -4\n", "actual_output": "0\n", "expected_output": "111\n\n", "anno_code": ["n = int(input()) # (0): n=7\nx = list(map(int,input().split())) # (1): x=[1, 2, 3, 2, 9, -3, -4]\nm_energy = 250000 # (2): m_energy=250000\nfor i in range(1,101): # (3): i=1 (22): i=2 ... (1903): NO CHANGE\n energy = 0 # (4): energy=0 (23): NO CHANGE ... (1885): NO CHANGE\n for k in range(n): # (5): k=0 (7): k=1 ... (1900): NO CHANGE\n m_energy += (x[k]-1)**2 # (6): NO CHANGE (8): m_energy=250001 ... (1899): m_energy=111\n if energy < m_energy: # (20): NO CHANGE (39): NO CHANGE ... (1901): NO CHANGE\n m_energy = energy # (21): m_energy=0 (40): m_energy=0 ... (1902): m_energy=0\nprint(m_energy)"], "anno_status": [true], "diff_content": " n = int(input())\n x = list(map(int,input().split()))\n m_energy = 250000\n for i in range(1,101):\n energy = 0\n for k in range(n):\n- m_energy += (x[k]-1)**2\n+ energy += (x[k]-i)**2\n if energy < m_energy:\n m_energy = energy\n print(m_energy)\n", "FL_content": " n = int(input())\n x = list(map(int,input().split()))\n m_energy = 250000\n for i in range(1,101):\n energy = 0\n for k in range(n):\n- m_energy += (x[k]-1)**2\n if energy < m_energy:\n m_energy = energy\n print(m_energy)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u382431597", "problem_id": "p02767", "submission1_id": "s064700252", "submission2_id": "s168714988", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nn = int(input())\nx = list(map(int, input().split()))\n\nx.sort()\nave = sum(x) / len(x)\nsquared = sum([i*i for i in x])\n\nprint(Decimal(str(squared - n*(ave)*ave)).quantize(Decimal('0'), rounding=ROUND_HALF_UP))\n\n", "code2": "from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nn = int(input())\nx = list(map(int, input().split()))\n\nave = sum(x) / len(x)\np = Decimal(str(ave)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)\nsquared = sum([i*i for i in x])\n\nprint(n*p*p - 2*p*sum(x) + squared)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582425243", "date2": "1582425883", "bleu_score": "0.8983939129687162", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 35, "total_score": 97, "input": "7\n1 1 0 1 141 1 -1\n", "actual_output": "16924\n", "expected_output": "16925\n\n", "anno_code": ["from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nn = int(input()) # (0): n=7\nx = list(map(int, input().split())) # (1): x=[1, 1, 0, 1, 141, 1, -1]\n\nx.sort() # (2): x=[-1, 0, 1, 1, 1, 1, 141]\nave = sum(x) / len(x) # (3): ave=20.571429\nsquared = sum([i*i for i in x]) # (4): squared=19886\n\nprint(Decimal(str(squared - n*(ave)*ave)).quantize(Decimal('0'), rounding=ROUND_HALF_UP))\n\n"], "anno_status": [true], "diff_content": " from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n \n n = int(input())\n x = list(map(int, input().split()))\n \n-x.sort()\n ave = sum(x) / len(x)\n+p = Decimal(str(ave)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)\n squared = sum([i*i for i in x])\n \n-print(Decimal(str(squared - n*(ave)*ave)).quantize(Decimal('0'), rounding=ROUND_HALF_UP))\n-\n-\n+print(n*p*p - 2*p*sum(x) + squared)\n", "FL_content": " from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n \n n = int(input())\n x = list(map(int, input().split()))\n \n-x.sort()\n ave = sum(x) / len(x)\n squared = sum([i*i for i in x])\n \n-print(Decimal(str(squared - n*(ave)*ave)).quantize(Decimal('0'), rounding=ROUND_HALF_UP))\n-\n-\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u557642273", "problem_id": "p02767", "submission1_id": "s426054177", "submission2_id": "s870548001", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def physical_strength(x,p):\n return pow((x - p), 2)\n\n\n\nif __name__ == '__main__':\n num_resident = input()\n x_list = [int(a) for a in input().split()]\n min_x = min(x_list)\n max_x = max(x_list)\n \n fin_ps = pow(max_x, 2)\n for i in range(min_x, max_x + 1):\n sum_ps = 0\n for x in x_list:\n sum_ps += physical_strength(x, i)\n if(sum_ps < fin_ps):\n fin_ps = sum_ps\n \n print(fin_ps)\n", "code2": "if __name__ == '__main__':\n num_resident = int(input())\n \n x_list = [int(a) for a in input().split()]\n min_x = min(x_list)\n max_x = max(x_list)\n \n fin_ps = 0\n for i in range(min_x, max_x + 1):\n sum_ps = 0\n for x_i in range(num_resident):\n sum_ps += pow((x_list[x_i] - i), 2)\n \n if(i == min_x):\n fin_ps = sum_ps \n \n if(sum_ps < fin_ps):\n fin_ps = sum_ps\n \n print(fin_ps)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582425312", "date2": "1582426337", "bleu_score": "0.7968647669355168", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1], "code1_test_score": 70, "total_score": 97, "input": "7\n-2 2 4 6 7 -1 -3\n", "actual_output": "49\n", "expected_output": "95\n\n", "anno_code": ["def physical_strength(x,p): # (0): physical_strength=\n return pow((x - p), 2)\n\n\n\nif __name__ == '__main__':\n num_resident = input()\n x_list = [int(a) for a in input().split()]\n min_x = min(x_list)\n max_x = max(x_list)\n \n fin_ps = pow(max_x, 2)\n for i in range(min_x, max_x + 1):\n sum_ps = 0\n for x in x_list:\n sum_ps += physical_strength(x, i)\n if(sum_ps < fin_ps):\n fin_ps = sum_ps\n \n print(fin_ps)\n"], "anno_status": [true], "diff_content": "-def physical_strength(x,p):\n- return pow((x - p), 2)\n-\n-\n-\n if __name__ == '__main__':\n- num_resident = input()\n+ num_resident = int(input())\n+ \n x_list = [int(a) for a in input().split()]\n min_x = min(x_list)\n max_x = max(x_list)\n \n- fin_ps = pow(max_x, 2)\n+ fin_ps = 0\n for i in range(min_x, max_x + 1):\n sum_ps = 0\n- for x in x_list:\n- sum_ps += physical_strength(x, i)\n+ for x_i in range(num_resident):\n+ sum_ps += pow((x_list[x_i] - i), 2)\n+ \n+ if(i == min_x):\n+ fin_ps = sum_ps \n+ \n if(sum_ps < fin_ps):\n fin_ps = sum_ps\n \n print(fin_ps)\n \n", "FL_content": "-def physical_strength(x,p):\n- return pow((x - p), 2)\n-\n-\n-\n if __name__ == '__main__':\n- num_resident = input()\n x_list = [int(a) for a in input().split()]\n min_x = min(x_list)\n max_x = max(x_list)\n \n- fin_ps = pow(max_x, 2)\n for i in range(min_x, max_x + 1):\n sum_ps = 0\n- for x in x_list:\n- sum_ps += physical_strength(x, i)\n if(sum_ps < fin_ps):\n fin_ps = sum_ps\n \n print(fin_ps)\n \n", "added_lines": 9, "removed_lines": 9, "code1_lines": 21 }, { "user_id": "u031115006", "problem_id": "p02767", "submission1_id": "s355963589", "submission2_id": "s076314987", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nlist = list(map(int, input().split()))\n\nl=len(list)\nm=0\ni=0\nj=1\nr=0\n\nwhile(i min2 else min2\n\nfor p in range(mini, maxi):\n suma = 0\n for z in x:\n suma += (z-p)**2\n if ans > suma:\n ans = suma\n \nprint(ans)", "code2": "n = int(input())\nx = list(map(int, input().split()))\n\nmini, maxi = min(x), max(x)\nmin2, max2 = mini**2*n, maxi**2*n\nans = max2 if max2 > min2 else min2\n\nfor p in range(mini, maxi+1):\n suma = 0\n for z in x:\n suma += (z-p)**2\n if ans > suma:\n ans = suma\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582659256", "date2": "1582659605", "bleu_score": "0.961618595675321", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1], "code1_test_score": 70, "total_score": 97, "input": "7\n4 14 0 12 14 0 0\n", "actual_output": "196\n", "expected_output": "276\n\n", "anno_code": ["n = int(input()) # (0): n=7\nx = list(map(int, input().split())) # (1): x=[4, 14, 0, 12, 14, 0, 0]\n\nmini, maxi = min(x), max(x) # (2): mini=0, maxi=14\nmin2, max2 = mini**2, maxi**2 # (3): min2=0, max2=196\nans = max2 if max2 > min2 else min2 # (4): ans=196\n\nfor p in range(mini, maxi): # (5): p=0 (23): p=1 ... (257): NO CHANGE\n suma = 0 # (6): suma=0 (24): suma=0 ... (240): suma=0\n for z in x: # (7): z=4 (9): z=14 ... (255): NO CHANGE\n suma += (z-p)**2 # (8): suma=16 (10): suma=212 ... (254): suma=591\n if ans > suma: # (22): NO CHANGE (40): NO CHANGE ... (256): NO CHANGE\n ans = suma\n \nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n x = list(map(int, input().split()))\n \n mini, maxi = min(x), max(x)\n-min2, max2 = mini**2, maxi**2\n+min2, max2 = mini**2*n, maxi**2*n\n ans = max2 if max2 > min2 else min2\n \n-for p in range(mini, maxi):\n+for p in range(mini, maxi+1):\n suma = 0\n for z in x:\n suma += (z-p)**2\n if ans > suma:\n ans = suma\n \n print(ans)\n", "FL_content": " n = int(input())\n x = list(map(int, input().split()))\n \n mini, maxi = min(x), max(x)\n-min2, max2 = mini**2, maxi**2\n ans = max2 if max2 > min2 else min2\n \n-for p in range(mini, maxi):\n suma = 0\n for z in x:\n suma += (z-p)**2\n if ans > suma:\n ans = suma\n \n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u332253305", "problem_id": "p02767", "submission1_id": "s217093646", "submission2_id": "s343919688", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nx=list(map(int,input().split()))\nans=sum(x)\nprint(ans)\nv=0\nfor i in x:\n v+=(i-ans)**2\nprint(v)\n", "code2": "n=int(input())\nx=list(map(int,input().split()))\nmy_round_int = lambda y: int((y * 2 + 1) \nans=sum(x)/n\nans=my_round_int(ans)\nv=0\nfor i in x:\n v+=(i-ans)**2\nprint(v)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582426375", "date2": "1582426625", "bleu_score": "0.640771763881601", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 97, "input": "7\n0 1 0 19 23 0 -1\n", "actual_output": "42\n9712\n", "expected_output": "640\n\n", "anno_code": ["n=int(input()) # (0): n=7\nx=list(map(int,input().split())) # (1): x=[0, 1, 0, 19, 23, 0, -1]\nans=sum(x) # (2): ans=42\nprint(ans) # (3): NO CHANGE\nv=0 # (4): v=0\nfor i in x: # (5): i=0 (7): i=1 ... (19): NO CHANGE\n v+=(i-ans)**2 # (6): v=1764 (8): v=3445 ... (18): v=9712\nprint(v)\n"], "anno_status": [true], "diff_content": " n=int(input())\n x=list(map(int,input().split()))\n-ans=sum(x)\n-print(ans)\n+my_round_int = lambda y: int((y * 2 + 1) \n+ans=sum(x)/n\n+ans=my_round_int(ans)\n v=0\n for i in x:\n v+=(i-ans)**2\n print(v)\n \n", "FL_content": " n=int(input())\n x=list(map(int,input().split()))\n-ans=sum(x)\n-print(ans)\n v=0\n for i in x:\n v+=(i-ans)**2\n print(v)\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u662418022", "problem_id": "p02327", "submission1_id": "s365957025", "submission2_id": "s107718584", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nfrom itertools import chain\n\nif __name__ == '__main__':\n\n H, W = map(int, input().split())\n C = []\n hist = []\n for i in range(H):\n l = input().split()\n C.append([int(x) for x in l])\n hist.append([(int(x) + 1) % 2 for x in l])\n\n for i in range(1, H):\n for j in range(W):\n if C[i][j] == 0:\n hist[i][j] = hist[i - 1][j] + 1\n \n S = []\n max_area = 0\n for i in range(H):\n for j in range(W):\n rect = [j, hist[i][j]]\n if not S:\n S.append(rect)\n elif S[-1][1] < rect[1]:\n S.append(rect)\n elif S[-1][1] > rect[1]:\n while S and S[-1][1] > rect[1]:\n post_rect = S.pop()\n area = post_rect[1] * (j - post_rect[0])\n max_area = max(max_area, area)\n S.append([post_rect[0], rect[1]])\n\n print(max_area)\n\n\n\n", "code2": "\n\nfrom itertools import chain\n\nif __name__ == '__main__':\n\n H, W = map(int, input().split())\n C = []\n hist = []\n for i in range(H):\n l = input().split()\n C.append([int(x) for x in l])\n hist.append([(int(x) + 1) % 2 for x in l])\n\n for i in range(1, H):\n for j in range(W):\n if C[i][j] == 0:\n hist[i][j] = hist[i - 1][j] + 1\n \n S = []\n max_area = 0\n for i in range(H):\n for j in range(W):\n rect = [j, hist[i][j]]\n if not S:\n S.append(rect)\n elif S[-1][1] < rect[1]:\n S.append(rect)\n elif S[-1][1] > rect[1]:\n while S and S[-1][1] > rect[1]:\n post_rect = S.pop()\n area = post_rect[1] * (j - post_rect[0])\n max_area = max(max_area, area)\n S.append([post_rect[0], rect[1]])\n while S:\n post_rect = S.pop()\n area = post_rect[1] * (W - post_rect[0])\n max_area = max(max_area, area)\n\n print(max_area)\n\n\n\n\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1522759291", "date2": "1522759669", "bleu_score": "0.8756315899978041", "code1_test_status": [0, 1, 1, 1, 1, 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, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 44, "total_score": 99, "input": "1 5\n1 1 1 0 0\n2 0 -1 0 1\n1 -1 0 0 0\n0 0 1 2 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["\n\nfrom itertools import chain\n\nif __name__ == '__main__':\n\n H, W = map(int, input().split())\n C = []\n hist = []\n for i in range(H):\n l = input().split()\n C.append([int(x) for x in l])\n hist.append([(int(x) + 1) % 2 for x in l])\n\n for i in range(1, H):\n for j in range(W):\n if C[i][j] == 0:\n hist[i][j] = hist[i - 1][j] + 1\n \n S = []\n max_area = 0\n for i in range(H):\n for j in range(W):\n rect = [j, hist[i][j]]\n if not S:\n S.append(rect)\n elif S[-1][1] < rect[1]:\n S.append(rect)\n elif S[-1][1] > rect[1]:\n while S and S[-1][1] > rect[1]:\n post_rect = S.pop()\n area = post_rect[1] * (j - post_rect[0])\n max_area = max(max_area, area)\n S.append([post_rect[0], rect[1]])\n\n print(max_area)\n\n\n\n"], "anno_status": [true], "diff_content": " \n \n from itertools import chain\n \n if __name__ == '__main__':\n \n H, W = map(int, input().split())\n C = []\n hist = []\n for i in range(H):\n l = input().split()\n C.append([int(x) for x in l])\n hist.append([(int(x) + 1) % 2 for x in l])\n \n for i in range(1, H):\n for j in range(W):\n if C[i][j] == 0:\n hist[i][j] = hist[i - 1][j] + 1\n- \n+ \n S = []\n max_area = 0\n for i in range(H):\n for j in range(W):\n rect = [j, hist[i][j]]\n if not S:\n S.append(rect)\n elif S[-1][1] < rect[1]:\n S.append(rect)\n elif S[-1][1] > rect[1]:\n while S and S[-1][1] > rect[1]:\n post_rect = S.pop()\n area = post_rect[1] * (j - post_rect[0])\n max_area = max(max_area, area)\n S.append([post_rect[0], rect[1]])\n+ while S:\n+ post_rect = S.pop()\n+ area = post_rect[1] * (W - post_rect[0])\n+ max_area = max(max_area, area)\n \n print(max_area)\n \n \n \n \n+\n+\n", "FL_content": " \n \n from itertools import chain\n \n if __name__ == '__main__':\n \n H, W = map(int, input().split())\n C = []\n hist = []\n for i in range(H):\n l = input().split()\n C.append([int(x) for x in l])\n hist.append([(int(x) + 1) % 2 for x in l])\n \n for i in range(1, H):\n for j in range(W):\n if C[i][j] == 0:\n hist[i][j] = hist[i - 1][j] + 1\n- \n S = []\n max_area = 0\n for i in range(H):\n for j in range(W):\n rect = [j, hist[i][j]]\n if not S:\n S.append(rect)\n elif S[-1][1] < rect[1]:\n S.append(rect)\n elif S[-1][1] > rect[1]:\n while S and S[-1][1] > rect[1]:\n post_rect = S.pop()\n area = post_rect[1] * (j - post_rect[0])\n max_area = max(max_area, area)\n S.append([post_rect[0], rect[1]])\n \n print(max_area)\n \n \n \n \n", "added_lines": 7, "removed_lines": 1, "code1_lines": 40 }, { "user_id": "u022407960", "problem_id": "p02327", "submission1_id": "s680898323", "submission2_id": "s205537273", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\n\n\n\n\n\nclass Rectangle(object):\n __slots__ = ('pos', 'height')\n\n def __init__(self, pos=float('inf'), height=-1):\n \n self.pos = pos\n self.height = height\n\n\ndef gen_rec_info(_carpet_info):\n dp = [[0] * (W + 1) for _ in range(H + 1)]\n\n for i in range(H):\n for j in range(W):\n if not int(_carpet_info[i][j]):\n dp[i + 1][j + 1] = dp[i][j + 1] + 1\n\n return dp\n\n\ndef get_largest_area(_hi_info):\n hi_max_area = 0\n rec_stack = []\n for i, v in enumerate(_hi_info):\n rect = Rectangle(pos=i, height=int(v))\n if not rec_stack:\n rec_stack.append(rect)\n else:\n last_height = rec_stack[-1].height\n if last_height < rect.height:\n rec_stack.append(rect)\n elif last_height > rect.height:\n target = i\n while rec_stack and rec_stack[-1].height >= rect.height:\n pre = rec_stack.pop()\n area = pre.height * (i - pre.pos)\n hi_max_area = max(hi_max_area, area)\n rect.pos = target\n rec_stack.append(rect)\n\n return hi_max_area\n\n\ndef solve(_rec_info):\n overall_max_area = 0\n for hi_info in _rec_info:\n overall_max_area = max(overall_max_area, get_largest_area(hi_info))\n\n return overall_max_area\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n H, W = map(int, _input[0].split())\n carpet_info = list(map(lambda x: x.split(), _input[1:]))\n \n\n rec_info = gen_rec_info(carpet_info)\n ans = solve(rec_info)\n print(ans)", "code2": "\n\n\n\n\nimport sys\n\n\n\n\n\nclass Rectangle(object):\n __slots__ = ('pos', 'height')\n\n def __init__(self, pos=float('inf'), height=-1):\n \n self.pos = pos\n self.height = height\n\n\ndef gen_rec_info(_carpet_info):\n dp = [[float('inf')] * W for _ in range(H)]\n\n for i in range(H):\n for j in range(W):\n if int(_carpet_info[i][j]):\n dp[i][j] = 0\n else:\n dp[i][j] = dp[i - 1][j] + 1 if i > 0 else 1\n\n return dp\n\n\ndef get_largest_area(_hi_info):\n hi_max_area = 0\n rec_stack = []\n _hi_info.append(0)\n\n for i, v in enumerate(_hi_info):\n rect = Rectangle(pos=i, height=int(v))\n if not rec_stack:\n rec_stack.append(rect)\n else:\n last_height = rec_stack[-1].height\n if last_height < rect.height:\n rec_stack.append(rect)\n elif last_height > rect.height:\n target = i\n while rec_stack and rec_stack[-1].height >= rect.height:\n pre = rec_stack.pop()\n area = pre.height * (i - pre.pos)\n hi_max_area = max(hi_max_area, area)\n target = pre.pos\n rect.pos = target\n rec_stack.append(rect)\n\n return hi_max_area\n\n\ndef solve(_rec_info):\n overall_max_area = 0\n for hi_info in _rec_info:\n overall_max_area = max(overall_max_area, get_largest_area(hi_info))\n\n return overall_max_area\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n H, W = map(int, _input[0].split())\n carpet_info = list(map(lambda x: x.split(), _input[1:]))\n \n\n rec_info = gen_rec_info(carpet_info)\n \n ans = solve(rec_info)\n print(ans)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480950817", "date2": "1480952622", "bleu_score": "0.9150714905359523", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 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, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 46, "total_score": 99, "input": "1 5\n1 0 1 0 0\n4 0 -1 0 1\n0 0 0 0 -2\n-1 0 1 1 0\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["\n\n\n\n\nimport sys\n\n\n\n\n\nclass Rectangle(object): # (0): Rectangle=\n __slots__ = ('pos', 'height')\n\n def __init__(self, pos=float('inf'), height=-1):\n \n self.pos = pos\n self.height = height\n\n\ndef gen_rec_info(_carpet_info): # (1): gen_rec_info=\n dp = [[0] * (W + 1) for _ in range(H + 1)]\n\n for i in range(H):\n for j in range(W):\n if not int(_carpet_info[i][j]):\n dp[i + 1][j + 1] = dp[i][j + 1] + 1\n\n return dp\n\n\ndef get_largest_area(_hi_info): # (2): get_largest_area=\n hi_max_area = 0\n rec_stack = []\n for i, v in enumerate(_hi_info):\n rect = Rectangle(pos=i, height=int(v))\n if not rec_stack:\n rec_stack.append(rect)\n else:\n last_height = rec_stack[-1].height\n if last_height < rect.height:\n rec_stack.append(rect)\n elif last_height > rect.height:\n target = i\n while rec_stack and rec_stack[-1].height >= rect.height:\n pre = rec_stack.pop()\n area = pre.height * (i - pre.pos)\n hi_max_area = max(hi_max_area, area)\n rect.pos = target\n rec_stack.append(rect)\n\n return hi_max_area\n\n\ndef solve(_rec_info): # (3): solve=\n overall_max_area = 0\n for hi_info in _rec_info:\n overall_max_area = max(overall_max_area, get_largest_area(hi_info))\n\n return overall_max_area\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n H, W = map(int, _input[0].split())\n carpet_info = list(map(lambda x: x.split(), _input[1:]))\n \n\n rec_info = gen_rec_info(carpet_info)\n ans = solve(rec_info)\n print(ans)"], "anno_status": [true], "diff_content": " \n \n \n \n \n import sys\n \n \n \n \n \n class Rectangle(object):\n __slots__ = ('pos', 'height')\n \n def __init__(self, pos=float('inf'), height=-1):\n \n self.pos = pos\n self.height = height\n \n \n def gen_rec_info(_carpet_info):\n- dp = [[0] * (W + 1) for _ in range(H + 1)]\n+ dp = [[float('inf')] * W for _ in range(H)]\n \n for i in range(H):\n for j in range(W):\n- if not int(_carpet_info[i][j]):\n- dp[i + 1][j + 1] = dp[i][j + 1] + 1\n+ if int(_carpet_info[i][j]):\n+ dp[i][j] = 0\n+ else:\n+ dp[i][j] = dp[i - 1][j] + 1 if i > 0 else 1\n \n return dp\n \n \n def get_largest_area(_hi_info):\n hi_max_area = 0\n rec_stack = []\n+ _hi_info.append(0)\n+\n for i, v in enumerate(_hi_info):\n rect = Rectangle(pos=i, height=int(v))\n if not rec_stack:\n rec_stack.append(rect)\n else:\n last_height = rec_stack[-1].height\n if last_height < rect.height:\n rec_stack.append(rect)\n elif last_height > rect.height:\n target = i\n while rec_stack and rec_stack[-1].height >= rect.height:\n pre = rec_stack.pop()\n area = pre.height * (i - pre.pos)\n hi_max_area = max(hi_max_area, area)\n+ target = pre.pos\n rect.pos = target\n rec_stack.append(rect)\n \n return hi_max_area\n \n \n def solve(_rec_info):\n overall_max_area = 0\n for hi_info in _rec_info:\n overall_max_area = max(overall_max_area, get_largest_area(hi_info))\n \n return overall_max_area\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n H, W = map(int, _input[0].split())\n carpet_info = list(map(lambda x: x.split(), _input[1:]))\n \n \n rec_info = gen_rec_info(carpet_info)\n+ \n ans = solve(rec_info)\n print(ans)\n", "FL_content": " \n \n \n \n \n import sys\n \n \n \n \n \n class Rectangle(object):\n __slots__ = ('pos', 'height')\n \n def __init__(self, pos=float('inf'), height=-1):\n \n self.pos = pos\n self.height = height\n \n \n def gen_rec_info(_carpet_info):\n- dp = [[0] * (W + 1) for _ in range(H + 1)]\n \n for i in range(H):\n for j in range(W):\n- if not int(_carpet_info[i][j]):\n- dp[i + 1][j + 1] = dp[i][j + 1] + 1\n \n return dp\n \n \n def get_largest_area(_hi_info):\n hi_max_area = 0\n rec_stack = []\n for i, v in enumerate(_hi_info):\n rect = Rectangle(pos=i, height=int(v))\n if not rec_stack:\n rec_stack.append(rect)\n else:\n last_height = rec_stack[-1].height\n if last_height < rect.height:\n rec_stack.append(rect)\n elif last_height > rect.height:\n target = i\n while rec_stack and rec_stack[-1].height >= rect.height:\n pre = rec_stack.pop()\n area = pre.height * (i - pre.pos)\n hi_max_area = max(hi_max_area, area)\n rect.pos = target\n rec_stack.append(rect)\n \n return hi_max_area\n \n \n def solve(_rec_info):\n overall_max_area = 0\n for hi_info in _rec_info:\n overall_max_area = max(overall_max_area, get_largest_area(hi_info))\n \n return overall_max_area\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n H, W = map(int, _input[0].split())\n carpet_info = list(map(lambda x: x.split(), _input[1:]))\n \n \n rec_info = gen_rec_info(carpet_info)\n ans = solve(rec_info)\n print(ans)\n", "added_lines": 9, "removed_lines": 3, "code1_lines": 71 }, { "user_id": "u352394527", "problem_id": "p02327", "submission1_id": "s686242624", "submission2_id": "s271421029", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, w = map(int, input().split())\n\nmp = []\nfor _ in range(h):\n lst = list(map(int, input().split()))\n cum = []\n acc = 0\n for i in lst:\n if not i:\n acc += 1\n else:\n acc = 0\n cum.append(acc)\n mp.append(cum)\nmp.append([-1] * w)\nans = 0\n\nfor i in range(w - 1, -1, -1):\n stack = []\n\n for j in range(h + 1):\n\n score = mp[j][i]\n if not stack:\n stack.append((score, j))\n else:\n last_score, last_ind = stack[-1][0], stack[-1][1]\n if score > last_score:\n stack.append((score, j))\n elif score == last_score:\n continue\n else:\n while stack and last_score > score:\n last_score, last_ind = stack.pop()\n ans = max(ans, last_score * (j - last_ind))\n stack.append((score, last_ind))\n\nprint(ans)\n", "code2": "h, w = map(int, input().split())\n\nmp = []\nfor _ in range(h):\n lst = list(map(int, input().split()))\n cum = []\n acc = 0\n for i in lst:\n if not i:\n acc += 1\n else:\n acc = 0\n cum.append(acc)\n mp.append(cum)\nmp.append([-1] * w)\nans = 0\n\n\nfor i in range(w - 1, -1, -1):\n stack = []\n\n for j in range(h + 1):\n\n score = mp[j][i]\n if not stack:\n stack.append((score, j))\n else:\n last_score, last_ind = stack[-1][0], stack[-1][1]\n if score > last_score:\n stack.append((score, j))\n elif score == last_score:\n continue\n else:\n while stack and stack[-1][0] > score:\n last_score, last_ind = stack.pop()\n ans = max(ans, last_score * (j - last_ind))\n if not stack:\n stack.append((score, last_ind))\n elif stack[-1][0] == score:\n pass\n else:\n stack.append((score, last_ind))\n\nprint(ans)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528785530", "date2": "1528787953", "bleu_score": "0.8490842290746449", "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], "code1_test_score": 98, "total_score": 99, "input": "4 5\n1 0 1 1 0\n1 0 0 0 0\n0 0 1 0 0\n0 0 0 1 0\n", "actual_output": "6\n", "expected_output": "4\n\n", "anno_code": ["h, w = map(int, input().split()) # (0): h=4, w=5\n\nmp = [] # (1): mp=[]\nfor _ in range(h): # (2): _=0 (28): _=1 ... (106): NO CHANGE\n lst = list(map(int, input().split())) # (3): lst=[1, 0, 1, 1, 0] (29): lst=[1, 0, 0, 0, 0] ... (81): lst=[0, 0, 0, 1, 0]\n cum = [] # (4): cum=[] (30): cum=[] ... (82): cum=[]\n acc = 0 # (5): acc=0 (31): acc=0 ... (83): acc=0\n for i in lst: # (6): i=1 (10): i=0 ... (104): NO CHANGE\n if not i: # (7): NO CHANGE (11): NO CHANGE ... (101): NO CHANGE\n acc += 1 # (12): acc=1 (24): acc=1 ... (102): acc=1\n else:\n acc = 0 # (8): NO CHANGE (16): acc=0 ... (98): acc=0\n cum.append(acc) # (9): cum=[0] (13): cum=[0, 1] ... (103): cum=[1, 2, 3, 0, 1]\n mp.append(cum) # (27): mp (53): mp ... (105): mp\nmp.append([-1] * w) # (107): mp\nans = 0 # (108): ans=0\n\nfor i in range(w - 1, -1, -1): # (109): i=4 (158): i=3 ... (336): NO CHANGE\n stack = [] # (110): stack=[] (159): stack=[] ... (296): stack=[]\n\n for j in range(h + 1): # (111): j=0 (115): j=1 ... (335): NO CHANGE\n\n score = mp[j][i] # (112): score=1 (116): score=4 ... (322): score=-1\n if not stack: # (113): NO CHANGE (117): NO CHANGE ... (323): NO CHANGE\n stack.append((score, j)) # (114): stack=[(1, 0)] (163): stack=[(0, 0)] ... (300): stack=[(0, 0)]\n else:\n last_score, last_ind = stack[-1][0], stack[-1][1] # (118): last_score=1, last_ind=0 (124): last_score=4, last_ind=1 ... (324): NO CHANGE\n if score > last_score: # (119): NO CHANGE (125): NO CHANGE ... (325): NO CHANGE\n stack.append((score, j)) # (120): stack=[(1, 0), (4, 1)] (169): stack=[(0, 0), (3, 1)] ... (313): stack=[(0, 0), (1, 2)]\n elif score == last_score: # (126): NO CHANGE (140): NO CHANGE ... (326): NO CHANGE\n continue # (266): NO CHANGE (279): NO CHANGE ... (320): NO CHANGE\n else:\n while stack and last_score > score: # (127): NO CHANGE (130): NO CHANGE ... (333): NO CHANGE\n last_score, last_ind = stack.pop() # (128): stack=[(1, 0)] (131): stack=[], last_score=1, last_ind=0 ... (331): stack=[], last_score=0, last_ind=0\n ans = max(ans, last_score * (j - last_ind)) # (129): ans=4 (132): NO CHANGE ... (332): NO CHANGE\n stack.append((score, last_ind)) # (134): stack=[(2, 0)] (145): stack=[(1, 0)] ... (334): stack=[(-1, 0)]\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " h, w = map(int, input().split())\n \n mp = []\n for _ in range(h):\n lst = list(map(int, input().split()))\n cum = []\n acc = 0\n for i in lst:\n if not i:\n acc += 1\n else:\n acc = 0\n cum.append(acc)\n mp.append(cum)\n mp.append([-1] * w)\n ans = 0\n \n+\n for i in range(w - 1, -1, -1):\n stack = []\n \n for j in range(h + 1):\n \n score = mp[j][i]\n if not stack:\n stack.append((score, j))\n else:\n last_score, last_ind = stack[-1][0], stack[-1][1]\n if score > last_score:\n stack.append((score, j))\n elif score == last_score:\n continue\n else:\n- while stack and last_score > score:\n+ while stack and stack[-1][0] > score:\n last_score, last_ind = stack.pop()\n ans = max(ans, last_score * (j - last_ind))\n- stack.append((score, last_ind))\n+ if not stack:\n+ stack.append((score, last_ind))\n+ elif stack[-1][0] == score:\n+ pass\n+ else:\n+ stack.append((score, last_ind))\n \n print(ans)\n \n", "FL_content": " h, w = map(int, input().split())\n \n mp = []\n for _ in range(h):\n lst = list(map(int, input().split()))\n cum = []\n acc = 0\n for i in lst:\n if not i:\n acc += 1\n else:\n acc = 0\n cum.append(acc)\n mp.append(cum)\n mp.append([-1] * w)\n ans = 0\n \n for i in range(w - 1, -1, -1):\n stack = []\n \n for j in range(h + 1):\n \n score = mp[j][i]\n if not stack:\n stack.append((score, j))\n else:\n last_score, last_ind = stack[-1][0], stack[-1][1]\n if score > last_score:\n stack.append((score, j))\n elif score == last_score:\n continue\n else:\n- while stack and last_score > score:\n last_score, last_ind = stack.pop()\n ans = max(ans, last_score * (j - last_ind))\n- stack.append((score, last_ind))\n \n print(ans)\n \n", "added_lines": 8, "removed_lines": 2, "code1_lines": 39 }, { "user_id": "u797673668", "problem_id": "p02327", "submission1_id": "s962062448", "submission2_id": "s740130831", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, w = map(int, input().split())\nmax_rect, prev = 0, [0] * (w + 1)\nfor i in range(h):\n current = [p + 1 if f else 0 for f, p in zip(map(lambda x: int(x) ^ 1, input().split()), prev)] + [0]\n stack = [(0, 0)]\n for j in range(w + 1):\n c_j = current[j]\n if stack[-1][0] < c_j:\n stack.append((c_j, j))\n continue\n if stack[-1][0] > c_j:\n while stack[-1][0] > c_j:\n height, since = stack.pop()\n max_rect = max(max_rect, height * (j - since))\n if c_j:\n stack.append((c_j, j))\n prev = current\n\nprint(max_rect)", "code2": "h, w = map(int, input().split())\nmax_rect, prev = 0, [0] * (w + 1)\nfor i in range(h):\n current = [p + 1 if f else 0 for f, p in zip(map(lambda x: int(x) ^ 1, input().split()), prev)] + [0]\n stack = [(0, 0)]\n for j in range(w + 1):\n c_j = current[j]\n if stack[-1][0] < c_j:\n stack.append((c_j, j))\n continue\n if stack[-1][0] > c_j:\n since = 0\n while stack[-1][0] > c_j:\n height, since = stack.pop()\n max_rect = max(max_rect, height * (j - since))\n if c_j:\n stack.append((c_j, since))\n prev = current\nprint(max_rect)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470208350", "date2": "1470210864", "bleu_score": "0.9550608837951875", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 99, "input": "4 5\n1 0 1 0 0\n1 0 0 0 0\n0 0 0 0 0\n0 0 0 1 0\n", "actual_output": "6\n", "expected_output": "8\n\n", "anno_code": ["h, w = map(int, input().split()) # (0): h=4, w=5\nmax_rect, prev = 0, [0] * (w + 1) # (1): max_rect=0, prev=[0, 0, 0, 0, 0, 0]\nfor i in range(h): # (2): i=0 (43): i=1 ... (188): NO CHANGE\n current = [p + 1 if f else 0 for f, p in zip(map(lambda x: int(x) ^ 1, input().split()), prev)] + [0] # (3): current=[0, 1, 0, 1, 1, 0] (44): current=[0, 2, 1, 2, 2, 0] ... (138): current=[2, 4, 3, 0, 4, 0]\n stack = [(0, 0)] # (4): stack=[(0, 0)] (45): NO CHANGE ... (139): NO CHANGE\n for j in range(w + 1): # (5): j=0 (9): j=1 ... (186): NO CHANGE\n c_j = current[j] # (6): c_j=0 (10): c_j=1 ... (178): c_j=0\n if stack[-1][0] < c_j: # (7): NO CHANGE (11): NO CHANGE ... (179): NO CHANGE\n stack.append((c_j, j)) # (12): stack=[(0, 0), (1, 1)] (26): stack=[(0, 0), (1, 3)] ... (175): stack=[(0, 0), (4, 4)]\n continue # (13): NO CHANGE (27): NO CHANGE ... (176): NO CHANGE\n if stack[-1][0] > c_j: # (8): NO CHANGE (17): NO CHANGE ... (180): NO CHANGE\n while stack[-1][0] > c_j: # (18): NO CHANGE (21): NO CHANGE ... (184): NO CHANGE\n height, since = stack.pop() # (19): stack=[(0, 0)], height=1, since=1 (37): stack=[(0, 0)], since=3 ... (182): stack=[(0, 0)], height=4, since=4\n max_rect = max(max_rect, height * (j - since)) # (20): max_rect=1 (38): max_rect=2 ... (183): NO CHANGE\n if c_j: # (22): NO CHANGE (40): NO CHANGE ... (185): NO CHANGE\n stack.append((c_j, j)) # (64): stack=[(0, 0), (1, 2)] (110): stack=[(0, 0), (1, 0), (2, 2)] (159): stack=[(0, 0), (2, 0), (3, 2)]\n prev = current # (42): prev=[0, 1, 0, 1, 1, 0] (87): prev=[0, 2, 1, 2, 2, 0] ... (187): prev=[2, 4, 3, 0, 4, 0]\n\nprint(max_rect)"], "anno_status": [true], "diff_content": " h, w = map(int, input().split())\n max_rect, prev = 0, [0] * (w + 1)\n for i in range(h):\n current = [p + 1 if f else 0 for f, p in zip(map(lambda x: int(x) ^ 1, input().split()), prev)] + [0]\n stack = [(0, 0)]\n for j in range(w + 1):\n c_j = current[j]\n if stack[-1][0] < c_j:\n stack.append((c_j, j))\n continue\n if stack[-1][0] > c_j:\n+ since = 0\n while stack[-1][0] > c_j:\n height, since = stack.pop()\n max_rect = max(max_rect, height * (j - since))\n if c_j:\n- stack.append((c_j, j))\n+ stack.append((c_j, since))\n prev = current\n-\n print(max_rect)\n", "FL_content": " h, w = map(int, input().split())\n max_rect, prev = 0, [0] * (w + 1)\n for i in range(h):\n current = [p + 1 if f else 0 for f, p in zip(map(lambda x: int(x) ^ 1, input().split()), prev)] + [0]\n stack = [(0, 0)]\n for j in range(w + 1):\n c_j = current[j]\n if stack[-1][0] < c_j:\n stack.append((c_j, j))\n continue\n if stack[-1][0] > c_j:\n while stack[-1][0] > c_j:\n height, since = stack.pop()\n max_rect = max(max_rect, height * (j - since))\n if c_j:\n- stack.append((c_j, j))\n prev = current\n-\n print(max_rect)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u129978636", "problem_id": "p03102", "submission1_id": "s592015934", "submission2_id": "s742545038", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nans=0\nfor i in range(n):\n a=list(map(int,input().split()))\n d=0\n for j in range(m):\n d+=a[j]*b[j]\n d+=c\n if(d<=0):\n continue\n else:\n ans=i\nprint(ans)", "code2": "n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nans=0\nfor i in range(n):\n a=list(map(int,input().split()))\n d=0\n for j in range(m):\n d+=a[j]*b[j]\n d+=c\n if(d<=0):\n continue\n else:\n ans+=1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560858065", "date2": "1560858185", "bleu_score": "0.9827828624688367", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 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, 1], "code1_test_score": 73, "total_score": 103, "input": "4 1 -4\n-2 5\n100 41\n110 40\n-4 -2\n-6 -1\n18 -13\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n,m,c=map(int,input().split()) # (0): n=4, m=1, c=-4\nb=list(map(int,input().split())) # (1): b=[-2, 5]\nans=0 # (2): ans=0\nfor i in range(n): # (3): i=0 (12): i=1 ... (39): NO CHANGE\n a=list(map(int,input().split())) # (4): a=[100, 41] (13): a=[110, 40] ... (31): a=[-6, -1]\n d=0 # (5): d=0 (14): d=0 ... (32): d=0\n for j in range(m): # (6): j=0 (8): NO CHANGE ... (35): NO CHANGE\n d+=a[j]*b[j] # (7): d=-200 (16): d=-220 ... (34): d=12\n d+=c # (9): d=-204 (18): d=-224 ... (36): d=8\n if(d<=0): # (10): NO CHANGE (19): NO CHANGE ... (37): NO CHANGE\n continue # (11): NO CHANGE (20): NO CHANGE\n else:\n ans=i # (29): ans=2 (38): ans=3\nprint(ans)"], "anno_status": [true], "diff_content": " n,m,c=map(int,input().split())\n b=list(map(int,input().split()))\n ans=0\n for i in range(n):\n a=list(map(int,input().split()))\n d=0\n for j in range(m):\n d+=a[j]*b[j]\n d+=c\n if(d<=0):\n continue\n else:\n- ans=i\n+ ans+=1\n print(ans)\n", "FL_content": " n,m,c=map(int,input().split())\n b=list(map(int,input().split()))\n ans=0\n for i in range(n):\n a=list(map(int,input().split()))\n d=0\n for j in range(m):\n d+=a[j]*b[j]\n d+=c\n if(d<=0):\n continue\n else:\n- ans=i\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u467307100", "problem_id": "p03102", "submission1_id": "s319271473", "submission2_id": "s313681957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n ,m, c = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int,input().split())) for i in range(n)] \n \n\ncount = 0\nfor i in A:\n numberSum = c\n for a, b in zip(i, B):\n numberSum += (a * b) \n if numberSum > 0:\n count += 1\nprint(count)\n ", "code2": "n ,m, c = map(int, input().split())\nB = list(map(int, input().split()))\nA = [list(map(int,input().split())) for i in range(n)] \n \n\ncount = 0\nfor i in A:\n numberSum = c\n for a, b in zip(i, B):\n numberSum += (a * b) \n if numberSum > 0:\n count += 1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588713639", "date2": "1588713740", "bleu_score": "0.97243312612714", "code1_test_status": [0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0], "code1_test_score": 51, "total_score": 103, "input": "3 3 0\n101 -100 0\n0 100 111\n100 100 100\n-100 100 101\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["n ,m, c = map(int, input().split()) # (0): n=3, m=3, c=0\nB = list(map(int, input().split())) # (1): B=[101, -100, 0]\nA = [list(map(int,input().split())) for i in range(n)] # (2): A\n \n\ncount = 0 # (3): count=0\nfor i in A: # (4): i=[0, 100, 111] (16): i=[100, 100, 100] ... (43): NO CHANGE\n numberSum = c # (5): numberSum=0 (17): numberSum=0 (32): numberSum=0\n for a, b in zip(i, B): # (6): a=0, b=101 (9): a=100, b=-100 ... (42): NO CHANGE\n numberSum += (a * b) # (7): NO CHANGE (10): numberSum=-10000 ... (40): NO CHANGE\n if numberSum > 0: # (8): NO CHANGE (11): NO CHANGE ... (41): NO CHANGE\n count += 1 # (21): count=1 (25): count=2 (29): count=3\nprint(count)\n "], "anno_status": [true], "diff_content": " n ,m, c = map(int, input().split())\n B = list(map(int, input().split()))\n A = [list(map(int,input().split())) for i in range(n)] \n \n \n count = 0\n for i in A:\n- numberSum = c\n- for a, b in zip(i, B):\n- numberSum += (a * b) \n+ numberSum = c\n+ for a, b in zip(i, B):\n+ numberSum += (a * b) \n if numberSum > 0:\n- count += 1\n+ count += 1\n print(count)\n- \n", "FL_content": " n ,m, c = map(int, input().split())\n B = list(map(int, input().split()))\n A = [list(map(int,input().split())) for i in range(n)] \n \n \n count = 0\n for i in A:\n- numberSum = c\n- for a, b in zip(i, B):\n- numberSum += (a * b) \n if numberSum > 0:\n- count += 1\n print(count)\n- \n", "added_lines": 4, "removed_lines": 5, "code1_lines": 14 }, { "user_id": "u807028974", "problem_id": "p03102", "submission1_id": "s045672234", "submission2_id": "s005763760", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M,C = map(int,input().split())\nB = input().split()\nAnm = []\nfor i in range(N):\n Anm.append(input().split())\ncont = 0\nfor A in Anm:\n c = 0\n for i in range(M):\n c += int(A[i]) * int(B[i])\n if c > 0:\n cont += 1\nprint(cont)", "code2": "N,M,C = map(int,input().split())\nB = input().split()\nAnm = []\nfor i in range(N):\n Anm.append(input().split())\ncont = 0\nfor A in Anm:\n c = C\n for i in range(M):\n c += int(A[i]) * int(B[i])\n if c > 0:\n cont += 1\nprint(cont)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552162597", "date2": "1552162668", "bleu_score": "0.9897850561577881", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0], "code1_test_score": 65, "total_score": 103, "input": "2 3 -10\n1 2 4\n6 2 1\n-1 1 2\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["N,M,C = map(int,input().split()) # (0): N=2, M=3, C=-10\nB = input().split() # (1): B=['1', '2', '4']\nAnm = [] # (2): Anm=[]\nfor i in range(N): # (3): i=0 (5): i=1 (7): NO CHANGE\n Anm.append(input().split()) # (4): Anm (6): Anm\ncont = 0 # (8): cont=0\nfor A in Anm: # (9): A=['6', '2', '1'] (20): A=['-1', '1', '2'] (31): NO CHANGE\n c = 0 # (10): c=0 (21): c=0\n for i in range(M): # (11): i=0 (13): i=1 ... (28): NO CHANGE\n c += int(A[i]) * int(B[i]) # (12): c=6 (14): c=10 ... (27): c=9\n if c > 0: # (18): NO CHANGE (29): NO CHANGE\n cont += 1 # (19): cont=1 (30): cont=2\nprint(cont)"], "anno_status": [true], "diff_content": " N,M,C = map(int,input().split())\n B = input().split()\n Anm = []\n for i in range(N):\n Anm.append(input().split())\n cont = 0\n for A in Anm:\n- c = 0\n+ c = C\n for i in range(M):\n c += int(A[i]) * int(B[i])\n if c > 0:\n cont += 1\n print(cont)\n", "FL_content": " N,M,C = map(int,input().split())\n B = input().split()\n Anm = []\n for i in range(N):\n Anm.append(input().split())\n cont = 0\n for A in Anm:\n- c = 0\n for i in range(M):\n c += int(A[i]) * int(B[i])\n if c > 0:\n cont += 1\n print(cont)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u093129359", "problem_id": "p03102", "submission1_id": "s752612514", "submission2_id": "s332045440", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m,c=map(int,input().split())\nb= [int(x) for x in input().split()]\nans=0\n\nfor i in range(n):\n a=[int(x)*y for x,y in zip(input().split(),b)]\n s=0\n for j in range(m):\n s=sum(a)\n if(s+c>0):\n ans=+1\nprint(ans)", "code2": "n,m,c=map(int,input().split())\nb= [int(x) for x in input().split()]\nans=0\n\nfor i in range(n):\n a=[int(x)*y for x, y in zip(input().split(), b)]\n if(sum(a)+c>0):\n ans+=1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579169616", "date2": "1579170258", "bleu_score": "0.7354430292453435", "code1_test_status": [1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 83, "total_score": 103, "input": "5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13\n", "actual_output": "1\n", "expected_output": "2\n", "anno_code": ["n,m,c=map(int,input().split()) # (0): n=5, m=2, c=-4\nb= [int(x) for x in input().split()] # (1): b=[-2, 5]\nans=0 # (2): ans=0\n\nfor i in range(n): # (3): i=0 (15): i=1 ... (57): NO CHANGE\n a=[int(x)*y for x,y in zip(input().split(),b)] # (4): a=[-200, 205] (16): a=[-200, 200] ... (48): a=[-36, -65]\n s=0 # (5): s=0 (17): s=0 ... (49): s=0\n for j in range(m): # (6): j=0 (10): j=1 ... (56): NO CHANGE\n s=sum(a) # (7): s=5 (11): NO CHANGE ... (54): NO CHANGE\n if(s+c>0): # (8): NO CHANGE (12): NO CHANGE ... (55): NO CHANGE\n ans=+1 # (9): ans=1 (13): NO CHANGE ... (35): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " n,m,c=map(int,input().split())\n b= [int(x) for x in input().split()]\n ans=0\n \n for i in range(n):\n- a=[int(x)*y for x,y in zip(input().split(),b)]\n- s=0\n- for j in range(m):\n- s=sum(a)\n- if(s+c>0):\n- ans=+1\n+ a=[int(x)*y for x, y in zip(input().split(), b)]\n+ if(sum(a)+c>0):\n+ ans+=1\n print(ans)\n", "FL_content": " n,m,c=map(int,input().split())\n b= [int(x) for x in input().split()]\n ans=0\n \n for i in range(n):\n- a=[int(x)*y for x,y in zip(input().split(),b)]\n- s=0\n- for j in range(m):\n- s=sum(a)\n- if(s+c>0):\n- ans=+1\n print(ans)\n", "added_lines": 3, "removed_lines": 6, "code1_lines": 12 }, { "user_id": "u914773681", "problem_id": "p03102", "submission1_id": "s905156945", "submission2_id": "s967392985", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N, M, C = map(int, input().split())\n \n B = list(map(int, input().split())) \n A = [[] for i in range(N)]\n for i in range(N):\n A[i] = list(map(int, input().split()))\n print('B=',B)\n print('A=',A)\n \n num = 0\n for i in range(N):\n sum = 0\n for j in range(M):\n sum = sum + A[i][j]*B[j]\n result = sum + C\n if (result > 0 ):\n num = num + 1\n print(num)\n return num\n\nmain()\n", "code2": "def main():\n N, M, C = map(int, input().split())\n B = list(map(int, input().split())) \n A = [[] for i in range(N)]\n for i in range(N):\n A[i] = list(map(int, input().split()))\n\n num = 0\n for i in range(N):\n sum = 0\n for j in range(M):\n sum = sum + A[i][j]*B[j]\n result = sum + C\n if (result > 0 ):\n num = num + 1\n print(num)\n return num\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552910601", "date2": "1552910918", "bleu_score": "0.8939925981927441", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3 0\n100 -100 0\n-1 100 101\n000 000 100\n-100 100 001\n", "actual_output": "B= [100, -100, 0]\nA= [[-1, 100, 101], [0, 0, 100], [-100, 100, 1]]\n0\n", "expected_output": "0\n\n", "anno_code": ["def main(): # (0): main=\n N, M, C = map(int, input().split()) # (2): N=3, M=3, C=0\n \n B = list(map(int, input().split())) # (3): B=[100, -100, 0]\n A = [[] for i in range(N)] # (4): A\n for i in range(N): # (5): i=0 (7): A, i=1 ... (11): NO CHANGE\n A[i] = list(map(int, input().split())) # (6): A=[[-1, 100, 101], [], []] (8): A (10): A\n print('B=',B) # (12): NO CHANGE\n print('A=',A) # (13): NO CHANGE\n \n num = 0 # (14): num=0\n for i in range(N): # (15): i=0 (26): i=1 ... (48): NO CHANGE\n sum = 0 # (16): sum=0 (27): sum=0 (38): NO CHANGE\n for j in range(M): # (17): j=0 (19): j=1 ... (45): NO CHANGE\n sum = sum + A[i][j]*B[j] # (18): sum=-100 (20): sum=-10100 ... (44): NO CHANGE\n result = sum + C # (24): result=-10100 (35): result=0 (46): result=-20000\n if (result > 0 ): # (25): NO CHANGE (36): NO CHANGE (47): NO CHANGE\n num = num + 1\n print(num)\n return num\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n N, M, C = map(int, input().split())\n- \n B = list(map(int, input().split())) \n A = [[] for i in range(N)]\n for i in range(N):\n A[i] = list(map(int, input().split()))\n- print('B=',B)\n- print('A=',A)\n- \n+\n num = 0\n for i in range(N):\n sum = 0\n for j in range(M):\n sum = sum + A[i][j]*B[j]\n result = sum + C\n if (result > 0 ):\n num = num + 1\n print(num)\n return num\n \n main()\n-\n", "FL_content": " def main():\n N, M, C = map(int, input().split())\n- \n B = list(map(int, input().split())) \n A = [[] for i in range(N)]\n for i in range(N):\n A[i] = list(map(int, input().split()))\n- print('B=',B)\n- print('A=',A)\n- \n num = 0\n for i in range(N):\n sum = 0\n for j in range(M):\n sum = sum + A[i][j]*B[j]\n result = sum + C\n if (result > 0 ):\n num = num + 1\n print(num)\n return num\n \n main()\n-\n", "added_lines": 1, "removed_lines": 5, "code1_lines": 23 }, { "user_id": "u032222383", "problem_id": "p03102", "submission1_id": "s853135950", "submission2_id": "s290953619", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m,c=map(int,input().split())\nb=list(map(int, input().split()))\nu=0\nfor i in range(n):\n inp=list(map(int,input().split()))\n s=0\n for j in range(m):\n s+=inp[j]*(j+1)\n s+=c\n if s>0:\n u+=1\nprint(u)", "code2": "n,m,c=map(int,input().split())\nb=list(map(int, input().split()))\nu=0\nfor i in range(n):\n inp=list(map(int,input().split()))\n s=0\n for j in range(m):\n s+=inp[j]*(b[j])\n s+=c\n if s>0:\n u+=1\nprint(u)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583772546", "date2": "1583772724", "bleu_score": "0.9764538616180072", "code1_test_status": [0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1], "code1_test_score": 45, "total_score": 103, "input": "2 3 -1\n111 -173 0\n-1 000 101\n100 100 100\n-100 100 100\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["n,m,c=map(int,input().split()) # (0): n=2, m=3, c=-1\nb=list(map(int, input().split())) # (1): b=[111, -173, 0]\nu=0 # (2): u=0\nfor i in range(n): # (3): i=0 (16): i=1 (29): NO CHANGE\n inp=list(map(int,input().split())) # (4): inp=[-1, 0, 101] (17): inp=[100, 100, 100]\n s=0 # (5): s=0 (18): s=0\n for j in range(m): # (6): j=0 (8): j=1 ... (25): NO CHANGE\n s+=inp[j]*(j+1) # (7): s=-1 (9): NO CHANGE ... (24): s=600\n s+=c # (13): s=301 (26): s=599\n if s>0: # (14): NO CHANGE (27): NO CHANGE\n u+=1 # (15): u=1 (28): u=2\nprint(u)"], "anno_status": [true], "diff_content": " n,m,c=map(int,input().split())\n b=list(map(int, input().split()))\n u=0\n for i in range(n):\n inp=list(map(int,input().split()))\n s=0\n for j in range(m):\n- s+=inp[j]*(j+1)\n+ s+=inp[j]*(b[j])\n s+=c\n if s>0:\n u+=1\n print(u)\n", "FL_content": " n,m,c=map(int,input().split())\n b=list(map(int, input().split()))\n u=0\n for i in range(n):\n inp=list(map(int,input().split()))\n s=0\n for j in range(m):\n- s+=inp[j]*(j+1)\n s+=c\n if s>0:\n u+=1\n print(u)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u327668449", "problem_id": "p03102", "submission1_id": "s701109246", "submission2_id": "s296652014", "status1": "Wrong Answer", "status2": "Accepted", "code1": "NMC = list(map(lambda x: int(x), input().split()))\nN = NMC[0]\nM = NMC[1]\nC = NMC[2]\n\nB = list(map(lambda x: int(x), input().split()))\nA = [list(map(lambda x: int(x), input().split())) for i in range(N)]\n\nprint(\"B\", B)\nprint(\"A\", A)\nprint(\"N\", N)\nprint(\"M\", M)\nprint(\"C\", C)\n\nanswer = 0\n\nfor i in range(len(A)):\n judge = 0\n for m in range(len(A[i])):\n judge += A[i][m] * B[m]\n\n print(\"judge\", judge)\n if (judge + C > 0):\n answer += 1\n\nprint(answer)", "code2": "NMC = list(map(lambda x: int(x), input().split()))\nN = NMC[0]\nM = NMC[1]\nC = NMC[2]\n\nB = list(map(lambda x: int(x), input().split()))\nA = [list(map(lambda x: int(x), input().split())) for i in range(N)]\n\nanswer = 0\n\nfor i in range(len(A)):\n judge = 0\n for m in range(len(A[i])):\n judge += A[i][m] * B[m]\n if (judge + C > 0):\n answer += 1\n\nprint(answer)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558120601", "date2": "1558120666", "bleu_score": "0.7643502690073299", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 3 0\n100 -100 0\n0 100 101\n000 000 100\n-100 100 101\n", "actual_output": "B [100, -100, 0]\nA [[0, 100, 101], [0, 0, 100], [-100, 100, 101]]\nN 3\nM 3\nC 0\njudge -10000\njudge 0\njudge -20000\n0\n", "expected_output": "0\n\n", "anno_code": ["NMC = list(map(lambda x: int(x), input().split())) # (0): NMC=[3, 3, 0]\nN = NMC[0] # (1): N=3\nM = NMC[1] # (2): M=3\nC = NMC[2] # (3): C=0\n\nB = list(map(lambda x: int(x), input().split())) # (4): B=[100, -100, 0]\nA = [list(map(lambda x: int(x), input().split())) for i in range(N)] # (5): A\n\nprint(\"B\", B) # (6): NO CHANGE\nprint(\"A\", A) # (7): NO CHANGE\nprint(\"N\", N) # (8): NO CHANGE\nprint(\"M\", M) # (9): NO CHANGE\nprint(\"C\", C) # (10): NO CHANGE\n\nanswer = 0 # (11): answer=0\n\nfor i in range(len(A)): # (12): i=0 (23): i=1 ... (45): NO CHANGE\n judge = 0 # (13): judge=0 (24): judge=0 (35): NO CHANGE\n for m in range(len(A[i])): # (14): m=0 (16): m=1 ... (42): NO CHANGE\n judge += A[i][m] * B[m] # (15): NO CHANGE (17): judge=-10000 ... (41): NO CHANGE\n\n print(\"judge\", judge) # (21): NO CHANGE (32): NO CHANGE (43): NO CHANGE\n if (judge + C > 0): # (22): NO CHANGE (33): NO CHANGE (44): NO CHANGE\n answer += 1\n\nprint(answer)"], "anno_status": [true], "diff_content": " NMC = list(map(lambda x: int(x), input().split()))\n N = NMC[0]\n M = NMC[1]\n C = NMC[2]\n \n B = list(map(lambda x: int(x), input().split()))\n A = [list(map(lambda x: int(x), input().split())) for i in range(N)]\n \n-print(\"B\", B)\n-print(\"A\", A)\n-print(\"N\", N)\n-print(\"M\", M)\n-print(\"C\", C)\n-\n answer = 0\n \n for i in range(len(A)):\n judge = 0\n for m in range(len(A[i])):\n judge += A[i][m] * B[m]\n-\n- print(\"judge\", judge)\n if (judge + C > 0):\n answer += 1\n \n print(answer)\n", "FL_content": " NMC = list(map(lambda x: int(x), input().split()))\n N = NMC[0]\n M = NMC[1]\n C = NMC[2]\n \n B = list(map(lambda x: int(x), input().split()))\n A = [list(map(lambda x: int(x), input().split())) for i in range(N)]\n \n-print(\"B\", B)\n-print(\"A\", A)\n-print(\"N\", N)\n-print(\"M\", M)\n-print(\"C\", C)\n-\n answer = 0\n \n for i in range(len(A)):\n judge = 0\n for m in range(len(A[i])):\n judge += A[i][m] * B[m]\n-\n- print(\"judge\", judge)\n if (judge + C > 0):\n answer += 1\n \n print(answer)\n", "added_lines": 0, "removed_lines": 8, "code1_lines": 26 }, { "user_id": "u914330401", "problem_id": "p03102", "submission1_id": "s182412719", "submission2_id": "s871880765", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [[0]*M]*N\nans = 0\nsum = 0\nfor i in range(N):\n A[i] = list(map(int, input().split()))\nfor i in range(N):\n for j in range(M):\n sum += A[i][j] * B[j]\n sum += C\n if sum > 0:\n ans += 1\n \nprint(ans)", "code2": "N, M, C = map(int, input().split())\nB = list(map(int, input().split()))\nA = [[0]*M]*N\nans = 0\nsum = 0\nfor i in range(N):\n A[i] = list(map(int, input().split()))\nfor i in range(N):\n sum = 0\n for j in range(M):\n sum += A[i][j] * B[j]\n sum += C\n if sum > 0:\n ans += 1\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555619227", "date2": "1555619280", "bleu_score": "0.9656941690447245", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 67, "total_score": 103, "input": "3 3 0\n100 -100 1\n0 100 100\n110 100 100\n-100 100 100\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N, M, C = map(int, input().split()) # (0): N=3, M=3, C=0\nB = list(map(int, input().split())) # (1): B=[100, -100, 1]\nA = [[0]*M]*N # (2): A\nans = 0 # (3): ans=0\nsum = 0 # (4): sum=0\nfor i in range(N): # (5): i=0 (7): i=1 ... (11): NO CHANGE\n A[i] = list(map(int, input().split())) # (6): A=[[0, 100, 100], [0, 0, 0], [0, 0, 0]] (8): A (10): A\nfor i in range(N): # (12): i=0 (22): i=1 ... (42): NO CHANGE\n for j in range(M): # (13): j=0 (15): j=1 ... (39): NO CHANGE\n sum += A[i][j] * B[j] # (14): NO CHANGE (16): sum=-10000 ... (38): sum=-28700\n sum += C # (20): NO CHANGE (30): NO CHANGE (40): NO CHANGE\n if sum > 0: # (21): NO CHANGE (31): NO CHANGE (41): NO CHANGE\n ans += 1\n \nprint(ans)"], "anno_status": [true], "diff_content": " N, M, C = map(int, input().split())\n B = list(map(int, input().split()))\n A = [[0]*M]*N\n ans = 0\n sum = 0\n for i in range(N):\n A[i] = list(map(int, input().split()))\n for i in range(N):\n+ sum = 0\n for j in range(M):\n sum += A[i][j] * B[j]\n sum += C\n if sum > 0:\n ans += 1\n \n print(ans)\n", "FL_content": " N, M, C = map(int, input().split())\n B = list(map(int, input().split()))\n A = [[0]*M]*N\n ans = 0\n sum = 0\n for i in range(N):\n A[i] = list(map(int, input().split()))\n for i in range(N):\n for j in range(M):\n sum += A[i][j] * B[j]\n sum += C\n if sum > 0:\n ans += 1\n \n print(ans)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u204616996", "problem_id": "p03102", "submission1_id": "s378850408", "submission2_id": "s909332733", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nans=0\nfor i in range(N):\n A=list(map(int,input().split()))\n if sum([a*b for a in A for b in B])+C>0:\n ans+=1\nprint(ans)", "code2": "N,M,C=map(int,input().split())\nB=list(map(int,input().split()))\nans=0\nfor i in range(N):\n A=list(map(int,input().split()))\n if sum([a*b for a,b in zip(A,B)])+C>0:\n ans+=1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587225309", "date2": "1587225733", "bleu_score": "0.9286959612970862", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0], "code1_test_score": 40, "total_score": 103, "input": "3 3 0\n100 -100 1\n0 100 010\n110 100 100\n-100 100 100\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["N,M,C=map(int,input().split()) # (0): N=3, M=3, C=0\nB=list(map(int,input().split())) # (1): B=[100, -100, 1]\nans=0 # (2): ans=0\nfor i in range(N): # (3): i=0 (7): i=1 ... (15): NO CHANGE\n A=list(map(int,input().split())) # (4): A=[0, 100, 10] (8): A=[110, 100, 100] (12): A=[-100, 100, 100]\n if sum([a*b for a in A for b in B])+C>0: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n ans+=1 # (6): ans=1 (10): ans=2 (14): ans=3\nprint(ans)"], "anno_status": [true], "diff_content": " N,M,C=map(int,input().split())\n B=list(map(int,input().split()))\n ans=0\n for i in range(N):\n A=list(map(int,input().split()))\n- if sum([a*b for a in A for b in B])+C>0:\n+ if sum([a*b for a,b in zip(A,B)])+C>0:\n ans+=1\n print(ans)\n", "FL_content": " N,M,C=map(int,input().split())\n B=list(map(int,input().split()))\n ans=0\n for i in range(N):\n A=list(map(int,input().split()))\n- if sum([a*b for a in A for b in B])+C>0:\n ans+=1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u387080888", "problem_id": "p03102", "submission1_id": "s680264575", "submission2_id": "s764102044", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=tuple(map(int,input().split()))\nb=[]\nfor i in range(a[0]+1):\n b.append(list(map(int,input().split())))\nans=0\ns=0\nfor j in range(a[0]):\n for k in range(a[1]):\n s+=b[j][k]*b[0][k]\n s+=a[2]\n if s>0:\n ans+=1\n s=0\nprint(ans)", "code2": "a=tuple(map(int,input().split()))\nb=[]\nfor i in range(a[0]+1):\n b.append(list(map(int,input().split())))\nans=0\ns=0\nfor j in range(a[0]+1)[1:a[0]+1]:\n for k in range(a[1]):\n s+=b[j][k]*b[0][k]\n s+=a[2]\n if s>0:\n ans+=1\n s=0\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584295641", "date2": "1584298318", "bleu_score": "0.9452541707880069", "code1_test_status": [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, 1, 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, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0], "code1_test_score": 20, "total_score": 103, "input": "3 3 1\n101 -100 -2\n-1 100 101\n100 110 100\n-57 100 100\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["a=tuple(map(int,input().split())) # (0): a=(3, 3, 1)\nb=[] # (1): b=[]\nfor i in range(a[0]+1): # (2): i=0 (4): i=1 ... (10): NO CHANGE\n b.append(list(map(int,input().split()))) # (3): b (5): b ... (9): b\nans=0 # (11): ans=0\ns=0 # (12): s=0\nfor j in range(a[0]): # (13): j=0 (25): j=1 ... (47): NO CHANGE\n for k in range(a[1]): # (14): k=0 (16): k=1 ... (43): NO CHANGE\n s+=b[j][k]*b[0][k] # (15): s=10201 (17): s=20201 ... (42): s=-1100\n s+=a[2] # (21): s=20206 (33): s=-10302 (44): s=-1099\n if s>0: # (22): NO CHANGE (34): NO CHANGE (45): NO CHANGE\n ans+=1 # (23): ans=1\n s=0 # (24): s=0 (35): s=0 (46): s=0\nprint(ans)"], "anno_status": [true], "diff_content": " a=tuple(map(int,input().split()))\n b=[]\n for i in range(a[0]+1):\n b.append(list(map(int,input().split())))\n ans=0\n s=0\n-for j in range(a[0]):\n+for j in range(a[0]+1)[1:a[0]+1]:\n for k in range(a[1]):\n s+=b[j][k]*b[0][k]\n s+=a[2]\n if s>0:\n ans+=1\n s=0\n print(ans)\n", "FL_content": " a=tuple(map(int,input().split()))\n b=[]\n for i in range(a[0]+1):\n b.append(list(map(int,input().split())))\n ans=0\n s=0\n-for j in range(a[0]):\n for k in range(a[1]):\n s+=b[j][k]*b[0][k]\n s+=a[2]\n if s>0:\n ans+=1\n s=0\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u027675217", "problem_id": "p03102", "submission1_id": "s585042379", "submission2_id": "s318550734", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nl=[]\nans=[]\ncnt=0\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\tl.append(a)\nfor i in range(n):\n\tsum=0\n\tfor j in range(m):\n\t\tsum+=b[j]*l[i][j]\n\t\tif j==(m-1):\n\t\t\tsum-=c\n\t\t\tans.append(sum)\nfor i in ans:\n\tif i>0:\n\t\tcnt+=1\nprint(cnt)", "code2": "n,m,c=map(int,input().split())\nb=list(map(int,input().split()))\nl=[]\nans=[]\ncnt=0\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\tl.append(a)\nfor i in range(n):\n\tsum=0\n\tfor j in range(m):\n\t\tsum+=b[j]*l[i][j]\n\t\tif j==(m-1):\n\t\t\tsum+=c\n\t\t\tans.append(sum)\nfor i in ans:\n\tif i>0:\n\t\tcnt+=1\nprint(cnt)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578663625", "date2": "1578677183", "bleu_score": "0.9882925414884207", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0], "code1_test_score": 60, "total_score": 103, "input": "2 3 -11\n1 2 3\n3 2 1\n1 1 1\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["n,m,c=map(int,input().split()) # (0): n=2, m=3, c=-11\nb=list(map(int,input().split())) # (1): b=[1, 2, 3]\nl=[] # (2): l=[]\nans=[] # (3): ans=[]\ncnt=0 # (4): cnt=0\nfor i in range(n): # (5): i=0 (8): i=1 (11): NO CHANGE\n\ta=list(map(int,input().split())) # (6): a=[3, 2, 1] (9): a=[1, 1, 1]\n\tl.append(a) # (7): l (10): l\nfor i in range(n): # (12): i=0 (26): i=1 (40): NO CHANGE\n\tsum=0 # (13): sum=0 (27): sum=0\n\tfor j in range(m): # (14): j=0 (17): j=1 ... (39): NO CHANGE\n\t\tsum+=b[j]*l[i][j] # (15): sum=3 (18): sum=7 ... (35): sum=6\n\t\tif j==(m-1): # (16): NO CHANGE (19): NO CHANGE ... (36): NO CHANGE\n\t\t\tsum-=c # (23): sum=21 (37): sum=17\n\t\t\tans.append(sum) # (24): ans=[21] (38): ans=[21, 17]\nfor i in ans: # (41): i=21 (44): i=17 (47): NO CHANGE\n\tif i>0: # (42): NO CHANGE (45): NO CHANGE\n\t\tcnt+=1 # (43): cnt=1 (46): cnt=2\nprint(cnt)"], "anno_status": [true], "diff_content": " n,m,c=map(int,input().split())\n b=list(map(int,input().split()))\n l=[]\n ans=[]\n cnt=0\n for i in range(n):\n \ta=list(map(int,input().split()))\n \tl.append(a)\n for i in range(n):\n \tsum=0\n \tfor j in range(m):\n \t\tsum+=b[j]*l[i][j]\n \t\tif j==(m-1):\n-\t\t\tsum-=c\n+\t\t\tsum+=c\n \t\t\tans.append(sum)\n for i in ans:\n \tif i>0:\n \t\tcnt+=1\n print(cnt)\n+\n", "FL_content": " n,m,c=map(int,input().split())\n b=list(map(int,input().split()))\n l=[]\n ans=[]\n cnt=0\n for i in range(n):\n \ta=list(map(int,input().split()))\n \tl.append(a)\n for i in range(n):\n \tsum=0\n \tfor j in range(m):\n \t\tsum+=b[j]*l[i][j]\n \t\tif j==(m-1):\n-\t\t\tsum-=c\n \t\t\tans.append(sum)\n for i in ans:\n \tif i>0:\n \t\tcnt+=1\n print(cnt)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u211842487", "problem_id": "p03102", "submission1_id": "s840658249", "submission2_id": "s017954099", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\nA=[]\nfor i in range(N):\n A.append(list(map(int,input().split())))\n\n\ncnt =0\nfor a in A:\n c = 0\n for j in range(len(a)):\n c += a[j]*B[j]\n if c-abs(C) > 0:\n cnt += 1\n\nprint(cnt)", "code2": "N,M,C = map(int,input().split())\nB = list(map(int,input().split()))\nA=[]\nfor i in range(N):\n A.append(list(map(int,input().split())))\n\n\ncnt =0\nfor a in A:\n c = 0\n for j in range(len(a)):\n c += a[j]*B[j]\n if c+C > 0:\n cnt += 1\n\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552164923", "date2": "1552165997", "bleu_score": "0.9689342706536923", "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": "3 3 1\n101 -100 -1\n-1 100 101\n100 100 100\n-100 100 100\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N,M,C = map(int,input().split()) # (0): N=3, M=3, C=1\nB = list(map(int,input().split())) # (1): B=[101, -100, -1]\nA=[] # (2): A=[]\nfor i in range(N): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n A.append(list(map(int,input().split()))) # (4): A=[[-1, 100, 101]] (6): A (8): A\n\n\ncnt =0 # (10): cnt=0\nfor a in A: # (11): a=[-1, 100, 101] (21): a=[100, 100, 100] ... (41): NO CHANGE\n c = 0 # (12): c=0 (22): c=0 (32): NO CHANGE\n for j in range(len(a)): # (13): j=0 (15): j=1 ... (39): NO CHANGE\n c += a[j]*B[j] # (14): c=-101 (16): c=-10101 ... (38): c=-20200\n if c-abs(C) > 0: # (20): NO CHANGE (30): NO CHANGE (40): NO CHANGE\n cnt += 1\n\nprint(cnt)"], "anno_status": [true], "diff_content": " N,M,C = map(int,input().split())\n B = list(map(int,input().split()))\n A=[]\n for i in range(N):\n A.append(list(map(int,input().split())))\n \n \n cnt =0\n for a in A:\n c = 0\n for j in range(len(a)):\n c += a[j]*B[j]\n- if c-abs(C) > 0:\n+ if c+C > 0:\n cnt += 1\n \n print(cnt)\n", "FL_content": " N,M,C = map(int,input().split())\n B = list(map(int,input().split()))\n A=[]\n for i in range(N):\n A.append(list(map(int,input().split())))\n \n \n cnt =0\n for a in A:\n c = 0\n for j in range(len(a)):\n c += a[j]*B[j]\n- if c-abs(C) > 0:\n cnt += 1\n \n print(cnt)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u910295650", "problem_id": "p03102", "submission1_id": "s903620377", "submission2_id": "s228381887", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M,C=map(int, input().split())\nB=list(map(int, input().split()))\nA=[]\nans=0\na=0\nfor i in range(N):\n A.append([int(j) for j in input().split()])\nfor i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n if a+C>0:\n ans+=1\nprint(ans)", "code2": "N,M,C=map(int, input().split())\nB=list(map(int, input().split()))\nA=[]\nans=0\na=0\nfor i in range(N):\n A.append([int(j) for j in input().split()])\nfor i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n if a+C>0:\n ans+=1\n a=0\n else:\n a=0\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558992010", "date2": "1558992217", "bleu_score": "0.8786896424462677", "code1_test_status": [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, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 47, "total_score": 103, "input": "3 3 1\n101 -100 -1\n0 100 101\n110 100 111\n-100 100 100\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N,M,C=map(int, input().split()) # (0): N=3, M=3, C=1\nB=list(map(int, input().split())) # (1): B=[101, -100, -1]\nA=[] # (2): A=[]\nans=0 # (3): ans=0\na=0 # (4): a=0\nfor i in range(N): # (5): i=0 (7): i=1 ... (11): NO CHANGE\n A.append([int(j) for j in input().split()]) # (6): A=[[0, 100, 101]] (8): A (10): A\nfor i in range(N): # (12): i=0 (21): i=1 ... (39): NO CHANGE\n for j in range(M): # (13): j=0 (15): j=1 ... (37): NO CHANGE\n a+=A[i][j]*B[j] # (14): NO CHANGE (16): a=-10000 ... (36): a=-29302\n if a+C>0: # (20): NO CHANGE (29): NO CHANGE (38): NO CHANGE\n ans+=1\nprint(ans)"], "anno_status": [true], "diff_content": " N,M,C=map(int, input().split())\n B=list(map(int, input().split()))\n A=[]\n ans=0\n a=0\n for i in range(N):\n A.append([int(j) for j in input().split()])\n for i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n if a+C>0:\n ans+=1\n+ a=0\n+ else:\n+ a=0\n print(ans)\n", "FL_content": " N,M,C=map(int, input().split())\n B=list(map(int, input().split()))\n A=[]\n ans=0\n a=0\n for i in range(N):\n A.append([int(j) for j in input().split()])\n for i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n if a+C>0:\n ans+=1\n print(ans)\n", "added_lines": 3, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u970899068", "problem_id": "p03102", "submission1_id": "s770219177", "submission2_id": "s825099030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M,C=map(int, input().split())\nB=list(map(int, input().split()))\n\ncount=0\nfor i in range(N):\n A = list(map(int, input().split()))\n sum=0\n for j in range(M):\n sum+=B[j]*A[j]\n if sum+C>0:\n count+=1\n\nprint(count)", "code2": "N,M,C=map(int, input().split())\nB=list(map(int, input().split()))\n\ncount=0\nfor i in range(N):\n A = list(map(int, input().split()))\n sum=0\n for j in range(M):\n sum+=B[j]*A[j]\n if sum+C>0:\n count+=1\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558291884", "date2": "1558292119", "bleu_score": "0.9808491973323736", "code1_test_status": [0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0], "code1_test_score": 61, "total_score": 103, "input": "3 3 0\n100 -100 1\n0 100 100\n110 100 100\n-100 100 100\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["N,M,C=map(int, input().split()) # (0): N=3, M=3, C=0\nB=list(map(int, input().split())) # (1): B=[100, -100, 1]\n\ncount=0 # (2): count=0\nfor i in range(N): # (3): i=0 (16): i=1 ... (45): NO CHANGE\n A = list(map(int, input().split())) # (4): A=[0, 100, 100] (17): A=[110, 100, 100] (33): A=[-100, 100, 100]\n sum=0 # (5): sum=0 (18): sum=0 (34): sum=0\n for j in range(M): # (6): j=0 (9): j=1 ... (44): NO CHANGE\n sum+=B[j]*A[j] # (7): NO CHANGE (10): sum=-10000 ... (42): sum=-19900\n if sum+C>0: # (8): NO CHANGE (11): NO CHANGE ... (43): NO CHANGE\n count+=1 # (22): count=1 (26): count=2 (30): count=3\n\nprint(count)"], "anno_status": [true], "diff_content": " N,M,C=map(int, input().split())\n B=list(map(int, input().split()))\n \n count=0\n for i in range(N):\n A = list(map(int, input().split()))\n sum=0\n for j in range(M):\n sum+=B[j]*A[j]\n- if sum+C>0:\n- count+=1\n+ if sum+C>0:\n+ count+=1\n \n print(count)\n", "FL_content": " N,M,C=map(int, input().split())\n B=list(map(int, input().split()))\n \n count=0\n for i in range(N):\n A = list(map(int, input().split()))\n sum=0\n for j in range(M):\n sum+=B[j]*A[j]\n- if sum+C>0:\n- count+=1\n \n print(count)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u852798899", "problem_id": "p03102", "submission1_id": "s206870174", "submission2_id": "s341125768", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for i in range(n)]\n\nans = 0\nfor i in range(n):\n s = sum([a[i][j]*b[j] for j in range(m)])\n if s+c > 0:\n print(i)\n ans += 1\nprint(ans)", "code2": "n, m, c = map(int, input().split())\nb = list(map(int, input().split()))\na = [list(map(int, input().split())) for i in range(n)]\n\nans = 0\nfor i in range(n):\n s = sum([a[i][j]*b[j] for j in range(m)])\n if s+c > 0:\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584047926", "date2": "1584047957", "bleu_score": "0.9466249345626984", "code1_test_status": [1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0], "code1_test_score": 49, "total_score": 103, "input": "3 3 1\n101 -100 0\n-1 100 111\n100 100 100\n-100 100 100\n", "actual_output": "1\n1\n", "expected_output": "1\n\n", "anno_code": ["n, m, c = map(int, input().split()) # (0): n=3, m=3, c=1\nb = list(map(int, input().split())) # (1): b=[101, -100, 0]\na = [list(map(int, input().split())) for i in range(n)] # (2): a\n\nans = 0 # (3): ans=0\nfor i in range(n): # (4): i=0 (7): i=1 ... (15): NO CHANGE\n s = sum([a[i][j]*b[j] for j in range(m)]) # (5): s=-10101 (8): s=100 (13): s=-20100\n if s+c > 0: # (6): NO CHANGE (9): NO CHANGE (14): NO CHANGE\n print(i) # (10): NO CHANGE\n ans += 1 # (11): ans=1\nprint(ans)"], "anno_status": [true], "diff_content": " n, m, c = map(int, input().split())\n b = list(map(int, input().split()))\n a = [list(map(int, input().split())) for i in range(n)]\n \n ans = 0\n for i in range(n):\n s = sum([a[i][j]*b[j] for j in range(m)])\n if s+c > 0:\n- print(i)\n ans += 1\n print(ans)\n", "FL_content": " n, m, c = map(int, input().split())\n b = list(map(int, input().split()))\n a = [list(map(int, input().split())) for i in range(n)]\n \n ans = 0\n for i in range(n):\n s = sum([a[i][j]*b[j] for j in range(m)])\n if s+c > 0:\n- print(i)\n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u125269142", "problem_id": "p03102", "submission1_id": "s744002162", "submission2_id": "s861769204", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m, c = map(int, input().split())\nb_lists = list(map(int, input().split()))\na_lists = []\nfor _ in range(n):\n tmp = list(map(int, input().split()))\n a_lists.append(tmp)\n\ncond = c\nans = 0\nfor i in a_lists:\n for j in range(m):\n cond = c\n cond += i[j]*b_lists[j]\n if cond > 0:\n ans += 1\n\nprint(ans)", "code2": "n, m, c = map(int, input().split())\nb_lists = list(map(int, input().split()))\na_lists = []\nfor _ in range(n):\n tmp = list(map(int, input().split()))\n a_lists.append(tmp)\n\nans = 0\nfor i in a_lists:\n cond = c\n for j in range(m):\n cond += i[j]*b_lists[j]\n if cond > 0:\n ans += 1\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597616022", "date2": "1597616306", "bleu_score": "0.9573949670429462", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 56, "total_score": 103, "input": "3 3 1\n101 -100 0\n-1 100 101\n100 100 100\n-100 100 100\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["n, m, c = map(int, input().split()) # (0): n=3, m=3, c=1\nb_lists = list(map(int, input().split())) # (1): b_lists=[101, -100, 0]\na_lists = [] # (2): a_lists=[]\nfor _ in range(n): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n tmp = list(map(int, input().split())) # (4): tmp=[-1, 100, 101] (7): tmp=[100, 100, 100] (10): tmp=[-100, 100, 100]\n a_lists.append(tmp) # (5): a_lists=[[-1, 100, 101]] (8): a_lists (11): a_lists\n\ncond = c # (13): cond=1\nans = 0 # (14): ans=0\nfor i in a_lists: # (15): i=[-1, 100, 101] (28): i=[100, 100, 100] ... (54): NO CHANGE\n for j in range(m): # (16): j=0 (19): j=1 ... (51): NO CHANGE\n cond = c # (17): NO CHANGE (20): cond=1 ... (49): cond=1\n cond += i[j]*b_lists[j] # (18): cond=-100 (21): cond=-9999 ... (50): NO CHANGE\n if cond > 0: # (26): NO CHANGE (39): NO CHANGE (52): NO CHANGE\n ans += 1 # (27): ans=1 (40): ans=2 (53): ans=3\n\nprint(ans)"], "anno_status": [true], "diff_content": " n, m, c = map(int, input().split())\n b_lists = list(map(int, input().split()))\n a_lists = []\n for _ in range(n):\n tmp = list(map(int, input().split()))\n a_lists.append(tmp)\n \n-cond = c\n ans = 0\n for i in a_lists:\n+ cond = c\n for j in range(m):\n- cond = c\n cond += i[j]*b_lists[j]\n if cond > 0:\n ans += 1\n \n print(ans)\n", "FL_content": " n, m, c = map(int, input().split())\n b_lists = list(map(int, input().split()))\n a_lists = []\n for _ in range(n):\n tmp = list(map(int, input().split()))\n a_lists.append(tmp)\n \n-cond = c\n ans = 0\n for i in a_lists:\n for j in range(m):\n- cond = c\n cond += i[j]*b_lists[j]\n if cond > 0:\n ans += 1\n \n print(ans)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u917013605", "problem_id": "p03102", "submission1_id": "s225893945", "submission2_id": "s053740459", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m , c = map(int, input().split())\nb_li = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n a_li = list(map(int, input().split()))\n if (0 < a * b + c for a, b in zip(a_li, b_li)):\n ans += 1\nprint(ans)\n", "code2": "n, m , c = map(int, input().split())\nb_li = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n a_li = list(map(int, input().split()))\n if sum(a * b for a, b in zip(a_li, b_li)) + c > 0:\n ans += 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560268516", "date2": "1560268689", "bleu_score": "0.9490614456182853", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 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, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0], "code1_test_score": 8, "total_score": 103, "input": "2 2 -4\n-2 1\n100 41\n100 5\n-6 0\n-6 -2\n18 -13\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["n, m , c = map(int, input().split()) # (0): n=2, m=2, c=-4\nb_li = list(map(int, input().split())) # (1): b_li=[-2, 1]\nans = 0 # (2): ans=0\nfor i in range(n): # (3): i=0 (7): i=1 (11): NO CHANGE\n a_li = list(map(int, input().split())) # (4): a_li=[100, 41] (8): a_li=[100, 5]\n if (0 < a * b + c for a, b in zip(a_li, b_li)): # (5): NO CHANGE (9): NO CHANGE\n ans += 1 # (6): ans=1 (10): ans=2\nprint(ans)\n"], "anno_status": [true], "diff_content": " n, m , c = map(int, input().split())\n b_li = list(map(int, input().split()))\n ans = 0\n for i in range(n):\n a_li = list(map(int, input().split()))\n- if (0 < a * b + c for a, b in zip(a_li, b_li)):\n+ if sum(a * b for a, b in zip(a_li, b_li)) + c > 0:\n ans += 1\n print(ans)\n \n", "FL_content": " n, m , c = map(int, input().split())\n b_li = list(map(int, input().split()))\n ans = 0\n for i in range(n):\n a_li = list(map(int, input().split()))\n- if (0 < a * b + c for a, b in zip(a_li, b_li)):\n ans += 1\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u910295650", "problem_id": "p03102", "submission1_id": "s276721873", "submission2_id": "s228381887", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M,C=map(int, input().split())\nB=list(map(int, input().split()))\nA=[]\nans=0\na=0\nfor i in range(N):\n A.append([int(j) for j in input().split()])\nfor i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n if a+C==0:\n ans+=1\nprint(ans)", "code2": "N,M,C=map(int, input().split())\nB=list(map(int, input().split()))\nA=[]\nans=0\na=0\nfor i in range(N):\n A.append([int(j) for j in input().split()])\nfor i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n if a+C>0:\n ans+=1\n a=0\n else:\n a=0\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558991940", "date2": "1558992217", "bleu_score": "0.8725057589591185", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 47, "total_score": 103, "input": "2 3 -10\n1 2 4\n6 2 1\n0 1 2\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N,M,C=map(int, input().split()) # (0): N=2, M=3, C=-10\nB=list(map(int, input().split())) # (1): B=[1, 2, 4]\nA=[] # (2): A=[]\nans=0 # (3): ans=0\na=0 # (4): a=0\nfor i in range(N): # (5): i=0 (7): i=1 (9): NO CHANGE\n A.append([int(j) for j in input().split()]) # (6): A (8): A\nfor i in range(N): # (10): i=0 (19): i=1 (28): NO CHANGE\n for j in range(M): # (11): j=0 (13): j=1 ... (26): NO CHANGE\n a+=A[i][j]*B[j] # (12): a=6 (14): a=10 ... (25): a=24\n if a+C==0: # (18): NO CHANGE (27): NO CHANGE\n ans+=1\nprint(ans)"], "anno_status": [true], "diff_content": " N,M,C=map(int, input().split())\n B=list(map(int, input().split()))\n A=[]\n ans=0\n a=0\n for i in range(N):\n A.append([int(j) for j in input().split()])\n for i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n- if a+C==0:\n+ if a+C>0:\n ans+=1\n+ a=0\n+ else:\n+ a=0\n print(ans)\n", "FL_content": " N,M,C=map(int, input().split())\n B=list(map(int, input().split()))\n A=[]\n ans=0\n a=0\n for i in range(N):\n A.append([int(j) for j in input().split()])\n for i in range(N):\n for j in range(M):\n a+=A[i][j]*B[j]\n- if a+C==0:\n ans+=1\n print(ans)\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u996564551", "problem_id": "p03102", "submission1_id": "s410531548", "submission2_id": "s578547776", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M, C = input().split(' ')\nN = int(N)\nM = int(M)\nC = int(C)\nB = []\nB = input().split(' ')\nB = [int(i) for i in B]\nA = []\nR = 0\nfor i in range(N):\n A = input().split(' ')\n A = [int(i) for i in A]\n combine = [x * y for (x, y) in zip(A, B)]\n print(sum(combine) + C)\n if sum(combine) + C > 0:\n R += 1\nprint(R)", "code2": "N, M, C = input().split(' ')\nN = int(N)\nM = int(M)\nC = int(C)\nB = []\nB = input().split(' ')\nB = [int(i) for i in B]\nA = []\nR = 0\nfor i in range(N):\n A = input().split(' ')\n A = [int(i) for i in A]\n combine = [x * y for (x, y) in zip(A, B)]\n if sum(combine) + C > 0:\n R += 1\nprint(R)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593075727", "date2": "1593075785", "bleu_score": "0.9139628097348064", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0], "code1_test_score": 7, "total_score": 103, "input": "2 3 -1\n111 -173 0\n-1 000 101\n100 100 100\n-100 100 100\n", "actual_output": "-112\n-6201\n0\n", "expected_output": "0\n\n", "anno_code": ["N, M, C = input().split(' ') # (0): N=2, M=3, C=-1\nN = int(N) # (1): N=2\nM = int(M) # (2): M=3\nC = int(C) # (3): C=-1\nB = [] # (4): B=[]\nB = input().split(' ') # (5): B=['111', '-173', '0']\nB = [int(i) for i in B] # (6): B=[111, -173, 0]\nA = [] # (7): A=[]\nR = 0 # (8): R=0\nfor i in range(N): # (9): i=0 (15): i=1 (21): NO CHANGE\n A = input().split(' ') # (10): A=['-1', '000', '101'] (16): A=['100', '100', '100']\n A = [int(i) for i in A] # (11): A=[-1, 0, 101] (17): A=[100, 100, 100]\n combine = [x * y for (x, y) in zip(A, B)] # (12): combine=[-111, 0, 0] (18): combine=[11100, -17300, 0]\n print(sum(combine) + C) # (13): NO CHANGE (19): NO CHANGE\n if sum(combine) + C > 0: # (14): NO CHANGE (20): NO CHANGE\n R += 1\nprint(R)"], "anno_status": [true], "diff_content": " N, M, C = input().split(' ')\n N = int(N)\n M = int(M)\n C = int(C)\n B = []\n B = input().split(' ')\n B = [int(i) for i in B]\n A = []\n R = 0\n for i in range(N):\n A = input().split(' ')\n A = [int(i) for i in A]\n combine = [x * y for (x, y) in zip(A, B)]\n- print(sum(combine) + C)\n if sum(combine) + C > 0:\n R += 1\n print(R)\n", "FL_content": " N, M, C = input().split(' ')\n N = int(N)\n M = int(M)\n C = int(C)\n B = []\n B = input().split(' ')\n B = [int(i) for i in B]\n A = []\n R = 0\n for i in range(N):\n A = input().split(' ')\n A = [int(i) for i in A]\n combine = [x * y for (x, y) in zip(A, B)]\n- print(sum(combine) + C)\n if sum(combine) + C > 0:\n R += 1\n print(R)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u793174294", "problem_id": "p03102", "submission1_id": "s721923233", "submission2_id": "s470818330", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN,M,C=map(int, input().split())\n\nB=list(map(int, input().split()))\ncount=total=0\n\nfor j in range(N):\n A=list(map(int, input().split()))\n for k in range(M):\n total=total+(A[k]*B[k])\n else:\n if total+C>0:\n count+=1\n total=0\n\nprint(count)", "code2": "\n\nN, M, C= map(int, input().split())\nB=list(map(int, input().split()))\ncount=0\nfor i in range(N):\n A=[]\n total=0\n A=list(map(int, input().split()))\n for j in range(M):\n total=total+(A[j]*B[j])\n else:\n if total+C>0:\n count+=1\n\nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558615725", "date2": "1558779226", "bleu_score": "0.8319930673983241", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 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, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 65, "total_score": 103, "input": "3 3 0\n100 -100 0\n0 100 101\n100 000 100\n-100 100 100\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["\n\nN,M,C=map(int, input().split()) # (0): N=3, M=3, C=0\n\nB=list(map(int, input().split())) # (1): B=[100, -100, 0]\ncount=total=0 # (2): count=0, total=0\n\nfor j in range(N): # (3): j=0 (13): j=1 ... (33): NO CHANGE\n A=list(map(int, input().split())) # (4): A=[0, 100, 101] (14): A=[100, 0, 100] (24): A=[-100, 100, 100]\n for k in range(M): # (5): k=0 (7): k=1 ... (31): NO CHANGE\n total=total+(A[k]*B[k]) # (6): NO CHANGE (8): total=-10000 ... (30): NO CHANGE\n else:\n if total+C>0: # (12): NO CHANGE (22): NO CHANGE (32): NO CHANGE\n count+=1\n total=0\n\nprint(count)"], "anno_status": [true], "diff_content": " \n \n-N,M,C=map(int, input().split())\n-\n+N, M, C= map(int, input().split())\n B=list(map(int, input().split()))\n-count=total=0\n-\n-for j in range(N):\n- A=list(map(int, input().split()))\n- for k in range(M):\n- total=total+(A[k]*B[k])\n- else:\n- if total+C>0:\n- count+=1\n- total=0\n+count=0\n+for i in range(N):\n+ A=[]\n+ total=0\n+ A=list(map(int, input().split()))\n+ for j in range(M):\n+ total=total+(A[j]*B[j])\n+ else:\n+ if total+C>0:\n+ count+=1\n \n print(count)\n+\n", "FL_content": " \n \n-N,M,C=map(int, input().split())\n-\n B=list(map(int, input().split()))\n-count=total=0\n-\n-for j in range(N):\n- A=list(map(int, input().split()))\n- for k in range(M):\n- total=total+(A[k]*B[k])\n- else:\n- if total+C>0:\n- count+=1\n- total=0\n \n print(count)\n", "added_lines": 12, "removed_lines": 12, "code1_lines": 17 }, { "user_id": "u796842765", "problem_id": "p02880", "submission1_id": "s782257638", "submission2_id": "s603702718", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nkuku = [1, 2, 3, 4, 5, 6, 7, 8, 9]\nkuku1 = [a * b for a in kuku for b in kuku]\nif N in kuku:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N = int(input())\nkuku = [1, 2, 3, 4, 5, 6, 7, 8, 9]\nkuku1 = [a * b for a in kuku for b in kuku]\nif N in kuku1:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584905573", "date2": "1584905734", "bleu_score": "0.968978896094318", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 19, "total_score": 20, "input": "00010\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N = int(input())\n kuku = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n kuku1 = [a * b for a in kuku for b in kuku]\n-if N in kuku:\n+if N in kuku1:\n print(\"Yes\")\n else:\n print(\"No\")\n+\n+\n", "FL_content": " N = int(input())\n kuku = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n kuku1 = [a * b for a in kuku for b in kuku]\n-if N in kuku:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u838869282", "problem_id": "p02880", "submission1_id": "s766715710", "submission2_id": "s112287060", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nfor i in range(1,10):\n if a%i==0:\n print('Yes')\n break\nelse:\n print('No')", "code2": "a=int(input())\nfor i in range(1,10):\n if a%i==0:\n if a\n print('Yes')\n break\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572226153", "date2": "1572226312", "bleu_score": "0.8790557843740925", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 2, "total_score": 20, "input": "1155\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a=int(input()) # (0): a=1155\nfor i in range(1,10): # (1): i=1\n if a%i==0: # (2): NO CHANGE\n print('Yes') # (3): NO CHANGE\n break\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a=int(input())\n for i in range(1,10):\n if a%i==0:\n- print('Yes')\n- break\n+ if a\n+ print('Yes')\n+ break\n else:\n print('No')\n", "FL_content": " a=int(input())\n for i in range(1,10):\n if a%i==0:\n- print('Yes')\n- break\n else:\n print('No')\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u311636831", "problem_id": "p02880", "submission1_id": "s927678605", "submission2_id": "s724942555", "status1": "Wrong Answer", "status2": "Accepted", "code1": "dic={}\n\nfor i in range(9):\n for j in range(9):\n if dic.get(i*j,None)==None:\n dic[i*j]=1\n else:\n dic[i*j]+=1\n\nN = int(input())\n\nif dic.get(N,None)==None:\n print(\"No\")\nelse:\n print(\"Yes\")", "code2": "dic={}\n\nfor i in range(1,10):\n for j in range(1,10):\n if dic.get(i*j,None)==None:\n dic[i*j]=1\n else:\n dic[i*j]+=1\n\nN = int(input())\n\nif dic.get(N,None)==None:\n print(\"No\")\nelse:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572224922", "date2": "1572225698", "bleu_score": "0.9529951768949794", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 19, "total_score": 20, "input": "00000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["dic={} # (0): dic={}\n\nfor i in range(9): # (1): i=0 (30): i=1 ... (262): NO CHANGE\n for j in range(9): # (2): j=0 (5): j=1 ... (261): NO CHANGE\n if dic.get(i*j,None)==None: # (3): NO CHANGE (6): NO CHANGE ... (259): NO CHANGE\n dic[i*j]=1 # (4): dic={0: 1} (36): dic={0: 10, 1: 1} ... (260): dic={0: 17, 1: 1, 2: 2, 3: 2, 4: 3, 5: 2, 6: 4, 7: 2, 8: 4, 10: 2, 12: 4, 14: 2, 16: 3, 9: 1, 15: 2, 18: 2, 21: 2, 24: 4, 20: 2, 28: 2, 32: 2, 25: 1, 30: 2, 35: 2, 40: 2, 36: 1, 42: 2, 48: 2, 49: 1, 56: 2, 64: 1}\n else:\n dic[i*j]+=1 # (7): dic={0: 2} (10): dic={0: 3} ... (257): dic={0: 17, 1: 1, 2: 2, 3: 2, 4: 3, 5: 2, 6: 4, 7: 2, 8: 4, 10: 2, 12: 4, 14: 2, 16: 3, 9: 1, 15: 2, 18: 2, 21: 2, 24: 4, 20: 2, 28: 2, 32: 2, 25: 1, 30: 2, 35: 2, 40: 2, 36: 1, 42: 2, 48: 2, 49: 1, 56: 2}\n\nN = int(input()) # (263): N=0\n\nif dic.get(N,None)==None: # (264): NO CHANGE\n print(\"No\")\nelse:\n print(\"Yes\")"], "anno_status": [true], "diff_content": " dic={}\n \n-for i in range(9):\n- for j in range(9):\n+for i in range(1,10):\n+ for j in range(1,10):\n if dic.get(i*j,None)==None:\n dic[i*j]=1\n else:\n dic[i*j]+=1\n \n N = int(input())\n \n if dic.get(N,None)==None:\n print(\"No\")\n else:\n print(\"Yes\")\n", "FL_content": " dic={}\n \n-for i in range(9):\n- for j in range(9):\n if dic.get(i*j,None)==None:\n dic[i*j]=1\n else:\n dic[i*j]+=1\n \n N = int(input())\n \n if dic.get(N,None)==None:\n print(\"No\")\n else:\n print(\"Yes\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u168333670", "problem_id": "p02880", "submission1_id": "s634521435", "submission2_id": "s532711381", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nable = False\nfor i in range(1, 10):\n for j in range(1, 10):\n if N == i * j:\n able = True\n break\n if able == True:\n break\n\nif able == True:\n print('YES')\nelse:\n print('No')", "code2": "N = int(input())\n\nable = False\nfor i in range(1, 10):\n for j in range(1, 10):\n if N == i * j:\n able = True\n break\n if able == True:\n break\n\nif able == True:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572225605", "date2": "1572225687", "bleu_score": "0.9851033460469043", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 18, "total_score": 20, "input": "00010\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=10\n\nable = False # (1): able=False\nfor i in range(1, 10): # (2): i=1 (23): i=2\n for j in range(1, 10): # (3): j=1 (5): j=2 ... (32): j=5\n if N == i * j: # (4): NO CHANGE (6): NO CHANGE ... (33): NO CHANGE\n able = True # (34): able=True\n break # (35): NO CHANGE\n if able == True: # (22): NO CHANGE (36): NO CHANGE\n break # (37): NO CHANGE\n\nif able == True: # (38): NO CHANGE\n print('YES')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N = int(input())\n \n able = False\n for i in range(1, 10):\n for j in range(1, 10):\n if N == i * j:\n able = True\n break\n if able == True:\n break\n \n if able == True:\n- print('YES')\n+ print('Yes')\n else:\n print('No')\n", "FL_content": " N = int(input())\n \n able = False\n for i in range(1, 10):\n for j in range(1, 10):\n if N == i * j:\n able = True\n break\n if able == True:\n break\n \n if able == True:\n- print('YES')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u090032260", "problem_id": "p02880", "submission1_id": "s103344356", "submission2_id": "s480798242", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nfor a in range(1,10):\n for b in range(1,10):\n if N==a*b:\n print(\"Yes\")\n else:\n print(\"No\")", "code2": "N=int(input())\nfor a in range(1,10):\n for b in range(1,10):\n if a*b==N:\n print(\"Yes\")\n exit()\nprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573012867", "date2": "1573013141", "bleu_score": "0.8633085762250293", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 20, "input": "00000\n", "actual_output": "No\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\n", "expected_output": "No\n\n", "anno_code": ["N=int(input()) # (0): N=0\nfor a in range(1,10): # (1): a=1 (30): a=2 ... (233): a=9\n for b in range(1,10): # (2): b=1 (5): b=2 ... (261): NO CHANGE\n if N==a*b: # (3): NO CHANGE (6): NO CHANGE ... (259): NO CHANGE\n print(\"Yes\")\n else:\n print(\"No\") # (4): NO CHANGE (7): NO CHANGE ... (260): NO CHANGE\n"], "anno_status": [true], "diff_content": " N=int(input())\n for a in range(1,10):\n for b in range(1,10):\n- if N==a*b:\n+ if a*b==N:\n print(\"Yes\")\n- else:\n- print(\"No\")\n+ exit()\n+print(\"No\")\n", "FL_content": " N=int(input())\n for a in range(1,10):\n for b in range(1,10):\n- if N==a*b:\n print(\"Yes\")\n- else:\n- print(\"No\")\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u255595446", "problem_id": "p02880", "submission1_id": "s720811989", "submission2_id": "s955871191", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = int(input())\nFlag = False\nfor x in range(1,10):\n for y in range(x,10):\n print(\"x\"+str(x)+\":y\"+str(y))\n if x * y == num:\n Flag = True\n break\n if Flag == True:\n break\n\nif Flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "num = int(input())\nFlag = False\nfor x in range(1,10):\n for y in range(x,10):\n if x * y == num:\n Flag = True\n break\n if Flag == True:\n break\n\nif Flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572226950", "date2": "1572227052", "bleu_score": "0.7384361205572567", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 20, "input": "1961\n", "actual_output": "x1:y1\nx1:y2\nx1:y3\nx1:y4\nx1:y5\nx1:y6\nx1:y7\nx1:y8\nx1:y9\nx2:y2\nx2:y3\nx2:y4\nx2:y5\nx2:y6\nx2:y7\nx2:y8\nx2:y9\nx3:y3\nx3:y4\nx3:y5\nx3:y6\nx3:y7\nx3:y8\nx3:y9\nx4:y4\nx4:y5\nx4:y6\nx4:y7\nx4:y8\nx4:y9\nx5:y5\nx5:y6\nx5:y7\nx5:y8\nx5:y9\nx6:y6\nx6:y7\nx6:y8\nx6:y9\nx7:y7\nx7:y8\nx7:y9\nx8:y8\nx8:y9\nx9:y9\nNo\n", "expected_output": "No\n\n", "anno_code": ["num = int(input()) # (0): num=1961\nFlag = False # (1): Flag=False\nfor x in range(1,10): # (2): x=1 (32): x=2 ... (164): NO CHANGE\n for y in range(x,10): # (3): y=1 (6): y=2 ... (162): NO CHANGE\n print(\"x\"+str(x)+\":y\"+str(y)) # (4): NO CHANGE (7): NO CHANGE ... (160): NO CHANGE\n if x * y == num: # (5): NO CHANGE (8): NO CHANGE ... (161): NO CHANGE\n Flag = True\n break\n if Flag == True: # (31): NO CHANGE (58): NO CHANGE ... (163): NO CHANGE\n break\n\nif Flag: # (165): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " num = int(input())\n Flag = False\n for x in range(1,10):\n- for y in range(x,10):\n- print(\"x\"+str(x)+\":y\"+str(y))\n- if x * y == num:\n- Flag = True\n- break\n+ for y in range(x,10):\n+ if x * y == num:\n+ Flag = True\n+ break\n if Flag == True:\n- break\n+ break\n \n if Flag:\n- print(\"Yes\")\n+ print(\"Yes\")\n else:\n- print(\"No\")\n+ print(\"No\")\n \n", "FL_content": " num = int(input())\n Flag = False\n for x in range(1,10):\n- for y in range(x,10):\n- print(\"x\"+str(x)+\":y\"+str(y))\n- if x * y == num:\n- Flag = True\n- break\n if Flag == True:\n- break\n \n if Flag:\n- print(\"Yes\")\n else:\n- print(\"No\")\n \n", "added_lines": 7, "removed_lines": 8, "code1_lines": 16 }, { "user_id": "u856152065", "problem_id": "p02880", "submission1_id": "s048613864", "submission2_id": "s496499580", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\n\nran = list(range(1,10))\nproduct = [x*y for x in ran for y in ran]\nprint(\"Yes\") if n in product else print(\"No\")", "code2": "n = int(input())\nif not isinstance(n, int):\n print(\"No\")\nelse:\n ran = list(range(1,10))\n product = [x*y for x in ran for y in ran]\n print(\"Yes\") if n in product else print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572612700", "date2": "1572613622", "bleu_score": "0.6206281182781979", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 18, "total_score": 20, "input": "00010\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n = input() # (0): n=00010\n\nran = list(range(1,10)) # (1): ran=[1, 2, 3, 4, 5, 6, 7, 8, 9]\nproduct = [x*y for x in ran for y in ran] # (2): product=[1, 2, ..., 72, 81]\nprint(\"Yes\") if n in product else print(\"No\")"], "anno_status": [true], "diff_content": "-n = input()\n-\n-ran = list(range(1,10))\n-product = [x*y for x in ran for y in ran]\n-print(\"Yes\") if n in product else print(\"No\")\n+n = int(input())\n+if not isinstance(n, int):\n+ print(\"No\")\n+else:\n+ ran = list(range(1,10))\n+ product = [x*y for x in ran for y in ran]\n+ print(\"Yes\") if n in product else print(\"No\")\n", "FL_content": "-n = input()\n-\n-ran = list(range(1,10))\n-product = [x*y for x in ran for y in ran]\n-print(\"Yes\") if n in product else print(\"No\")\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 5 }, { "user_id": "u395894569", "problem_id": "p02880", "submission1_id": "s030907335", "submission2_id": "s644077377", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nfor i in range(1, 10):\n for j in range(1, 10):\n print(i,j)\n if i * j == n:\n print('Yes')\n exit()\nelse:print('No')", "code2": "n = int(input())\nfor i in range(1, 10):\n for j in range(1, 10):\n if i * j == n:\n print('Yes')\n exit()\nelse:print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586107741", "date2": "1586107782", "bleu_score": "0.8810272994231082", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 20, "input": "00001\n", "actual_output": "1 1\nYes\n", "expected_output": "Yes\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())\n for i in range(1, 10):\n for j in range(1, 10):\n- print(i,j)\n if i * j == n:\n print('Yes')\n exit()\n else:print('No')\n", "FL_content": " n = int(input())\n for i in range(1, 10):\n for j in range(1, 10):\n- print(i,j)\n if i * j == n:\n print('Yes')\n exit()\n else:print('No')\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u347184682", "problem_id": "p02880", "submission1_id": "s414640198", "submission2_id": "s216404618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nn=int(input())\nfor i in range(1,10):\n if n%i==0:\n print(\"Yes\")\n sys.exit()\nprint(\"No\")", "code2": "import sys\nn=int(input())\nfor i in range(1,10):\n if n%i==0 and 1<=n\n print(\"Yes\")\n sys.exit()\nprint(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595879456", "date2": "1595879511", "bleu_score": "0.9127137061939681", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 2, "total_score": 20, "input": "7362\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n n=int(input())\n for i in range(1,10):\n- if n%i==0:\n+ if n%i==0 and 1<=n\n print(\"Yes\")\n sys.exit()\n print(\"No\")\n", "FL_content": " import sys\n n=int(input())\n for i in range(1,10):\n- if n%i==0:\n print(\"Yes\")\n sys.exit()\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u574483499", "problem_id": "p02880", "submission1_id": "s461531385", "submission2_id": "s574518774", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nln = []\n\nfor i in range(9):\n for j in range(9):\n ln.append(i*j)\n \nprint(\"Yes\" if n in ln else \"No\")", "code2": "n = int(input())\n\nln = []\n\nfor i in range(1,10):\n for j in range(1,10):\n ln.append(i*j)\n \nprint(\"Yes\" if n in ln else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572230300", "date2": "1572230387", "bleu_score": "0.9140587658236241", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 19, "total_score": 20, "input": "00000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["n = int(input()) # (0): n=0\n\nln = [] # (1): ln=[]\n\nfor i in range(9): # (2): i=0 (22): i=1 ... (182): NO CHANGE\n for j in range(9): # (3): j=0 (5): j=1 ... (181): NO CHANGE\n ln.append(i*j) # (4): ln=[0] (6): ln=[0, 0] ... (180): ln=[0, 0, ..., 56, 64]\n \nprint(\"Yes\" if n in ln else \"No\")"], "anno_status": [true], "diff_content": " n = int(input())\n \n ln = []\n \n-for i in range(9):\n- for j in range(9):\n+for i in range(1,10):\n+ for j in range(1,10):\n ln.append(i*j)\n \n print(\"Yes\" if n in ln else \"No\")\n", "FL_content": " n = int(input())\n \n ln = []\n \n-for i in range(9):\n- for j in range(9):\n ln.append(i*j)\n \n print(\"Yes\" if n in ln else \"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u813102292", "problem_id": "p02880", "submission1_id": "s670863987", "submission2_id": "s089695384", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = input()\nprinted = False\nfor i in range(1, 10):\n for j in range(1, 10):\n if N == i * j:\n print('Yes')\n printed = True\n break\n\nif not printed:\n print('No')", "code2": "N = int(input())\nprinted = False\ntry:\n for i in range(1, 10):\n for j in range(1, 10):\n if N == i * j:\n print('Yes')\n printed = True\n raise Exception\nexcept Exception:\n pass\n\nif not printed:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572224628", "date2": "1572225148", "bleu_score": "0.7088941523290351", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 18, "total_score": 20, "input": "00001\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = input() # (0): N=00001\nprinted = False # (1): printed=False\nfor i in range(1, 10): # (2): i=1 (22): i=2 ... (182): NO CHANGE\n for j in range(1, 10): # (3): j=1 (5): j=2 ... (181): NO CHANGE\n if N == i * j: # (4): NO CHANGE (6): NO CHANGE ... (180): NO CHANGE\n print('Yes')\n printed = True\n break\n\nif not printed: # (183): NO CHANGE\n print('No')"], "anno_status": [true], "diff_content": "-N = input()\n+N = int(input())\n printed = False\n-for i in range(1, 10):\n- for j in range(1, 10):\n- if N == i * j:\n- print('Yes')\n- printed = True\n- break\n+try:\n+ for i in range(1, 10):\n+ for j in range(1, 10):\n+ if N == i * j:\n+ print('Yes')\n+ printed = True\n+ raise Exception\n+except Exception:\n+ pass\n \n if not printed:\n print('No')\n", "FL_content": "-N = input()\n printed = False\n-for i in range(1, 10):\n- for j in range(1, 10):\n- if N == i * j:\n- print('Yes')\n- printed = True\n- break\n \n if not printed:\n print('No')\n", "added_lines": 10, "removed_lines": 7, "code1_lines": 11 }, { "user_id": "u572002343", "problem_id": "p02880", "submission1_id": "s478144128", "submission2_id": "s825890819", "status1": "Wrong Answer", "status2": "Accepted", "code1": "avail_numbers = [(i + 1) * (j + 1) for i, j in zip(range(9), range(9))]\n\nif int(input()) in avail_numbers:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "code2": "from itertools import product as prod\navail_numbers = [(i + 1) * (j + 1) for i, j in prod(range(9), range(9))]\n\nif int(input()) in avail_numbers:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577857600", "date2": "1577857759", "bleu_score": "0.7602829374568592", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 19, "total_score": 20, "input": "00010\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["avail_numbers = [(i + 1) * (j + 1) for i, j in zip(range(9), range(9))] # (0): avail_numbers=[1, 4, 9, 16, 25, 36, 49, 64, 81]\n\nif int(input()) in avail_numbers: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n"], "anno_status": [true], "diff_content": "-avail_numbers = [(i + 1) * (j + 1) for i, j in zip(range(9), range(9))]\n+from itertools import product as prod\n+avail_numbers = [(i + 1) * (j + 1) for i, j in prod(range(9), range(9))]\n \n if int(input()) in avail_numbers:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "FL_content": "-avail_numbers = [(i + 1) * (j + 1) for i, j in zip(range(9), range(9))]\n \n if int(input()) in avail_numbers:\n print(\"Yes\")\n else:\n print(\"No\")\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u692746605", "problem_id": "p02880", "submission1_id": "s848956615", "submission2_id": "s733849682", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\n\nfor i in range(2,10):\n for j in range(2,10):\n if i*j==n:\n print('Yes')\n exit()\n\nprint('No')\n", "code2": "n=int(input())\n\nfor i in range(1,10):\n for j in range(1,10):\n if i*j==n:\n print('Yes')\n exit()\n\nprint('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572308860", "date2": "1572308949", "bleu_score": "0.958143113161995", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 19, "total_score": 20, "input": "00001\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n=int(input()) # (0): n=1\n\nfor i in range(2,10): # (1): i=2 (19): i=3 ... (145): NO CHANGE\n for j in range(2,10): # (2): j=2 (4): j=3 ... (144): NO CHANGE\n if i*j==n: # (3): NO CHANGE (5): NO CHANGE ... (143): NO CHANGE\n print('Yes')\n exit()\n\nprint('No')\n"], "anno_status": [true], "diff_content": " n=int(input())\n \n-for i in range(2,10):\n- for j in range(2,10):\n+for i in range(1,10):\n+ for j in range(1,10):\n if i*j==n:\n print('Yes')\n exit()\n \n print('No')\n \n", "FL_content": " n=int(input())\n \n-for i in range(2,10):\n- for j in range(2,10):\n if i*j==n:\n print('Yes')\n exit()\n \n print('No')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u826331398", "problem_id": "p02880", "submission1_id": "s001622303", "submission2_id": "s016531959", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\n\n\ndef read():\n N = int(input())\n\n return N,\n\n\ndef solve(N, ):\n for i in range(9):\n a = i + 1\n\n b = N / a\n\n if b in [1,2,3,4,5,6,7,8,9]:\n continue\n if a * b == N:\n return \"Yes\"\n else:\n return \"No\"\n\n\nif __name__ == '__main__':\n input = read()\n print(solve(*input))", "code2": "import itertools\n\n\ndef read():\n N = int(input())\n\n return N,\n\n\ndef solve(N, ):\n for i in range(9):\n a = i + 1\n for j in range(9):\n b = j + 1\n if a*b==N:\n return \"Yes\"\n else:\n continue\n return \"No\"\n\n\n \n \n \n \n \n \n \n \n \n \n \n\n\nif __name__ == '__main__':\n input = read()\n print(solve(*input))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577835700", "date2": "1577835898", "bleu_score": "0.6388334713342205", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 2, "total_score": 20, "input": "554\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["import itertools\n\n\ndef read(): # (0): read=\n N = int(input())\n\n return N,\n\n\ndef solve(N, ): # (1): solve=\n for i in range(9):\n a = i + 1\n\n b = N / a\n\n if b in [1,2,3,4,5,6,7,8,9]:\n continue\n if a * b == N:\n return \"Yes\"\n else:\n return \"No\"\n\n\nif __name__ == '__main__':\n input = read()\n print(solve(*input))"], "anno_status": [true], "diff_content": " import itertools\n \n \n def read():\n N = int(input())\n \n return N,\n \n \n def solve(N, ):\n for i in range(9):\n a = i + 1\n-\n- b = N / a\n-\n- if b in [1,2,3,4,5,6,7,8,9]:\n- continue\n- if a * b == N:\n- return \"Yes\"\n- else:\n- return \"No\"\n+ for j in range(9):\n+ b = j + 1\n+ if a*b==N:\n+ return \"Yes\"\n+ else:\n+ continue\n+ return \"No\"\n+\n+\n+ \n+ \n+ \n+ \n+ \n+ \n+ \n+ \n+ \n+ \n+ \n \n \n if __name__ == '__main__':\n input = read()\n print(solve(*input))\n+\n", "FL_content": " import itertools\n \n \n def read():\n N = int(input())\n \n return N,\n \n \n def solve(N, ):\n for i in range(9):\n a = i + 1\n-\n- b = N / a\n-\n- if b in [1,2,3,4,5,6,7,8,9]:\n- continue\n- if a * b == N:\n- return \"Yes\"\n- else:\n- return \"No\"\n \n \n if __name__ == '__main__':\n input = read()\n print(solve(*input))\n", "added_lines": 21, "removed_lines": 9, "code1_lines": 26 }, { "user_id": "u068142202", "problem_id": "p02880", "submission1_id": "s877429230", "submission2_id": "s385504794", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nans = 0\nfor i in range(2, 10):\n for j in range(2, 10):\n if i * j == n:\n ans += 1\nif ans >= 1:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "n = int(input())\nans = 0\nfor i in range(1, 10):\n for j in range(1, 10):\n if i * j == n:\n ans += 1\nif ans == 0:\n print(\"No\")\nelse:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583521399", "date2": "1583521639", "bleu_score": "0.9352840254421528", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 19, "total_score": 20, "input": "00001\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n = int(input()) # (0): n=1\nans = 0 # (1): ans=0\nfor i in range(2, 10): # (2): i=2 (20): i=3 ... (146): NO CHANGE\n for j in range(2, 10): # (3): j=2 (5): j=3 ... (145): NO CHANGE\n if i * j == n: # (4): NO CHANGE (6): NO CHANGE ... (144): NO CHANGE\n ans += 1\nif ans >= 1: # (147): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " n = int(input())\n ans = 0\n-for i in range(2, 10):\n- for j in range(2, 10):\n+for i in range(1, 10):\n+ for j in range(1, 10):\n if i * j == n:\n ans += 1\n-if ans >= 1:\n- print(\"Yes\")\n-else:\n+if ans == 0:\n print(\"No\")\n+else:\n+ print(\"Yes\")\n", "FL_content": " n = int(input())\n ans = 0\n-for i in range(2, 10):\n- for j in range(2, 10):\n if i * j == n:\n ans += 1\n-if ans >= 1:\n- print(\"Yes\")\n-else:\n print(\"No\")\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 10 }, { "user_id": "u076512055", "problem_id": "p02880", "submission1_id": "s618186216", "submission2_id": "s692154490", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nans = 'No'\nfor i in range(1,10):\n for j in range(i+1,10):\n if N == i * j:\n ans = 'Yes'\n \nprint(ans)", "code2": "N = int(input())\n\nans = 'No'\nfor i in range(1,10):\n for j in range(i,10):\n if N == i * j:\n ans = 'Yes'\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572231494", "date2": "1572231556", "bleu_score": "0.9762278252112679", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 19, "total_score": 20, "input": "00001\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=1\n\nans = 'No' # (1): ans=No\nfor i in range(1,10): # (2): i=1 (20): i=2 ... (92): NO CHANGE\n for j in range(i+1,10): # (3): j=2 (5): j=3 ... (91): NO CHANGE\n if N == i * j: # (4): NO CHANGE (6): NO CHANGE ... (88): NO CHANGE\n ans = 'Yes'\n \nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n \n ans = 'No'\n for i in range(1,10):\n- for j in range(i+1,10):\n+ for j in range(i,10):\n if N == i * j:\n ans = 'Yes'\n \n print(ans)\n", "FL_content": " N = int(input())\n \n ans = 'No'\n for i in range(1,10):\n- for j in range(i+1,10):\n if N == i * j:\n ans = 'Yes'\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u705427370", "problem_id": "p02880", "submission1_id": "s988790729", "submission2_id": "s319005221", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nL = set()\nfor i in range(1,10):\n for j in range(1,10):\n result = i*j\n L.add(result)\nprint(L)\n\nif n in L:\n print(\"Yes\")\nelif n not in L:\n print(\"No\")", "code2": "n = int(input())\n\nL = set()\nfor i in range(1,10):\n for j in range(1,10):\n result = i*j\n L.add(result)\nif n in L:\n print(\"Yes\")\nelif n not in L:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586378389", "date2": "1586378755", "bleu_score": "0.941633138225789", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 20, "input": "7362\n", "actual_output": "{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32, 35, 36, 40, 42, 45, 48, 49, 54, 56, 63, 64, 72, 81}\nNo\n", "expected_output": "No\n\n", "anno_code": ["n = int(input()) # (0): n=7362\n\nL = set() # (1): L=set()\nfor i in range(1,10): # (2): i=1 (31): i=2 ... (263): NO CHANGE\n for j in range(1,10): # (3): j=1 (6): j=2 ... (262): NO CHANGE\n result = i*j # (4): result=1 (7): result=2 ... (260): result=81\n L.add(result) # (5): L={1} (8): L={1, 2} ... (261): L={1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32, 35, 36, 40, 42, 45, 48, 49, 54, 56, 63, 64, 72, 81}\nprint(L) # (264): NO CHANGE\n\nif n in L: # (265): NO CHANGE\n print(\"Yes\")\nelif n not in L: # (266): NO CHANGE\n print(\"No\")"], "anno_status": [true], "diff_content": " n = int(input())\n \n L = set()\n for i in range(1,10):\n for j in range(1,10):\n result = i*j\n L.add(result)\n-print(L)\n-\n if n in L:\n print(\"Yes\")\n elif n not in L:\n print(\"No\")\n", "FL_content": " n = int(input())\n \n L = set()\n for i in range(1,10):\n for j in range(1,10):\n result = i*j\n L.add(result)\n-print(L)\n-\n if n in L:\n print(\"Yes\")\n elif n not in L:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u789132058", "problem_id": "p02880", "submission1_id": "s366902199", "submission2_id": "s232573037", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nn=(int(x) for x in input().split())\nl=[x*y for x in range(1,10) for y in range(1,10)]\nif n not in l:\n print(\"No\")\nelse :\n print(\"Yes\")", "code2": "import sys\ninput = sys.stdin.readline\n\nn=int(input())\nl=[x*y for x in range(1,10) for y in range(1,10)]\nif n in l:\n print(\"Yes\")\nelse :\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572464428", "date2": "1572464634", "bleu_score": "0.8331268497153453", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 18, "total_score": 20, "input": "00010\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nn=(int(x) for x in input().split()) # (1): n= at 0x000002BF1001BD80>\nl=[x*y for x in range(1,10) for y in range(1,10)] # (2): l=[1, 2, ..., 72, 81]\nif n not in l: # (3): NO CHANGE\n print(\"No\")\nelse :\n print(\"Yes\")"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n-n=(int(x) for x in input().split())\n+n=int(input())\n l=[x*y for x in range(1,10) for y in range(1,10)]\n-if n not in l:\n- print(\"No\")\n-else :\n+if n in l:\n print(\"Yes\")\n+else :\n+ print(\"No\")\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n-n=(int(x) for x in input().split())\n l=[x*y for x in range(1,10) for y in range(1,10)]\n-if n not in l:\n- print(\"No\")\n-else :\n print(\"Yes\")\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u339881903", "problem_id": "p02880", "submission1_id": "s000151196", "submission2_id": "s854305078", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = input()\n\nhoge = []\nfor i in range(1, 10):\n for j in range(1, 10):\n hoge.append(i * j)\n\nif N in hoge:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N = int(input())\n\nhoge = []\nfor i in range(1, 10):\n for j in range(1, 10):\n hoge.append(i * j)\n\nif N in hoge:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573604140", "date2": "1573604224", "bleu_score": "0.961573849973983", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 18, "total_score": 20, "input": "00001\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = input() # (0): N=00001\n\nhoge = [] # (1): hoge=[]\nfor i in range(1, 10): # (2): i=1 (22): i=2 ... (182): NO CHANGE\n for j in range(1, 10): # (3): j=1 (5): j=2 ... (181): NO CHANGE\n hoge.append(i * j) # (4): hoge=[1] (6): hoge=[1, 2] ... (180): hoge=[1, 2, ..., 72, 81]\n\nif N in hoge: # (183): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": "-N = input()\n+N = int(input())\n \n hoge = []\n for i in range(1, 10):\n for j in range(1, 10):\n hoge.append(i * j)\n \n if N in hoge:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "-N = input()\n \n hoge = []\n for i in range(1, 10):\n for j in range(1, 10):\n hoge.append(i * j)\n \n if N in hoge:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u163791883", "problem_id": "p02880", "submission1_id": "s025331138", "submission2_id": "s637809083", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nfor i in range(9):\n for j in range(9):\n if i * j == N:\n print('Yes')\n exit()\nprint('No')", "code2": "N = int(input())\nfor i in range(1, 10):\n for j in range(1, 10):\n if i * j == N:\n print('Yes')\n exit()\nprint('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572488653", "date2": "1572488794", "bleu_score": "0.8960512928403214", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 19, "total_score": 20, "input": "00000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " N = int(input())\n-for i in range(9):\n- for j in range(9):\n+for i in range(1, 10):\n+ for j in range(1, 10):\n if i * j == N:\n print('Yes')\n exit()\n print('No')\n", "FL_content": " N = int(input())\n-for i in range(9):\n- for j in range(9):\n if i * j == N:\n print('Yes')\n exit()\n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u442788381", "problem_id": "p03416", "submission1_id": "s981743319", "submission2_id": "s961048195", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\ncount = 0\nfor i in range(A, B):\n i = str(i)\n if i[:2] == i[-2:] :\n count += 1\nprint(count)", "code2": "A, B = map(int, input().split())\ncount = 0\nfor i in range(A, B + 1):\n i = str(i)\n if i[:2] == i[::-1][:2] :\n count += 1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1520818338", "date2": "1520818956", "bleu_score": "0.8942710612415611", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "11516 30706\n", "actual_output": "191\n", "expected_output": "192\n\n", "anno_code": ["A, B = map(int, input().split()) # (0): A=11516, B=30706\ncount = 0 # (1): count=0\nfor i in range(A, B): # (2): i=11516 (5): i=11517 ... (57763): NO CHANGE\n i = str(i) # (3): i=11516 (6): i=11517 ... (57761): i=30705\n if i[:2] == i[-2:] : # (4): NO CHANGE (7): NO CHANGE ... (57762): NO CHANGE\n count += 1 # (290): count=1 (591): count=2 ... (57537): count=191\nprint(count)"], "anno_status": [true], "diff_content": " A, B = map(int, input().split())\n count = 0\n-for i in range(A, B):\n+for i in range(A, B + 1):\n i = str(i)\n- if i[:2] == i[-2:] :\n+ if i[:2] == i[::-1][:2] :\n count += 1\n print(count)\n", "FL_content": " A, B = map(int, input().split())\n count = 0\n-for i in range(A, B):\n i = str(i)\n- if i[:2] == i[-2:] :\n count += 1\n print(count)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u238084414", "problem_id": "p03416", "submission1_id": "s380173622", "submission2_id": "s750536110", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\nans = 0\nfor i in range(A, B + 1):\n n = str(i)\n if n[0] == n[-1] and n[-1] == n[-2]:\n ans += 1\nprint(ans)", "code2": "A, B = map(int, input().split())\nans = 0\nfor i in range(A, B + 1):\n n = str(i)\n if n[0] == n[-1] and n[1] == n[-2]:\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589002986", "date2": "1589003029", "bleu_score": "0.9821587739242794", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 78, "total_score": 102, "input": "15858 19549\n", "actual_output": "37\n", "expected_output": "36\n\n", "anno_code": ["A, B = map(int, input().split()) # (0): A=15858, B=19549\nans = 0 # (1): ans=0\nfor i in range(A, B + 1): # (2): i=15858 (5): i=15859 ... (11115): NO CHANGE\n n = str(i) # (3): n=15858 (6): n=15859 ... (11113): n=19549\n if n[0] == n[-1] and n[-1] == n[-2]: # (4): NO CHANGE (7): NO CHANGE ... (11114): NO CHANGE\n ans += 1 # (164): ans=1 (465): ans=2 ... (11000): ans=37\nprint(ans)"], "anno_status": [true], "diff_content": " A, B = map(int, input().split())\n ans = 0\n for i in range(A, B + 1):\n n = str(i)\n- if n[0] == n[-1] and n[-1] == n[-2]:\n+ if n[0] == n[-1] and n[1] == n[-2]:\n ans += 1\n print(ans)\n", "FL_content": " A, B = map(int, input().split())\n ans = 0\n for i in range(A, B + 1):\n n = str(i)\n- if n[0] == n[-1] and n[-1] == n[-2]:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u423665486", "problem_id": "p03416", "submission1_id": "s163709818", "submission2_id": "s293731251", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n\ta, b = map(int, input().split())\n\tans = 0\n\tfor i in range(a, b):\n\t\tv = str(i)\n\t\td = len(v) \n\t\tif v[:d] == v[d+1:]:\n\t\t\tans += 1\n\tprint(ans)\nresolve()", "code2": "def resolve():\n\ta, b = map(int, input().split())\n\tans = 0\n\tfor i in range(a, b+1):\n\t\tv = str(i)\n\t\tif v == v[::-1]:\n\t\t\tans += 1\n\tprint(ans)\nresolve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589339506", "date2": "1589341868", "bleu_score": "0.8447841502167069", "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, 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, 0], "code1_test_score": 32, "total_score": 102, "input": "19680 73180\n", "actual_output": "0\n", "expected_output": "536\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def resolve():\n \ta, b = map(int, input().split())\n \tans = 0\n-\tfor i in range(a, b):\n+\tfor i in range(a, b+1):\n \t\tv = str(i)\n-\t\td = len(v) \n-\t\tif v[:d] == v[d+1:]:\n+\t\tif v == v[::-1]:\n \t\t\tans += 1\n \tprint(ans)\n resolve()\n", "FL_content": " def resolve():\n \ta, b = map(int, input().split())\n \tans = 0\n-\tfor i in range(a, b):\n \t\tv = str(i)\n-\t\td = len(v) \n-\t\tif v[:d] == v[d+1:]:\n \t\t\tans += 1\n \tprint(ans)\n resolve()\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u763249708", "problem_id": "p03416", "submission1_id": "s018720992", "submission2_id": "s842253814", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\n\nans = 0\nfor i in range(a, b+1):\n s = str(i)\n sl = len(s) \n \n if s[:sl] == s[-sl:]: ans += 1\nprint(ans)", "code2": "a, b = map(int, input().split())\n\nans = 0\nfor i in range(a, b+1):\n s = str(i)\n \n if s == s[::-1]: ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589111688", "date2": "1589111981", "bleu_score": "0.8022587436904439", "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, 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, 0], "code1_test_score": 32, "total_score": 102, "input": "31415 41187\n", "actual_output": "9773\n", "expected_output": "97\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=31415, b=41187\n\nans = 0 # (1): ans=0\nfor i in range(a, b+1): # (2): i=31415 (6): i=31416 ... (39094): NO CHANGE\n s = str(i) # (3): s=31415 (7): s=31416 ... (39091): s=41187\n sl = len(s) # (4): sl=5 (8): NO CHANGE ... (39092): NO CHANGE\n \n if s[:sl] == s[-sl:]: ans += 1 # (5): ans=1 (9): ans=2 ... (39093): ans=9773\nprint(ans)"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n \n ans = 0\n for i in range(a, b+1):\n s = str(i)\n- sl = len(s) \n \n- if s[:sl] == s[-sl:]: ans += 1\n+ if s == s[::-1]: ans += 1\n print(ans)\n", "FL_content": " a, b = map(int, input().split())\n \n ans = 0\n for i in range(a, b+1):\n s = str(i)\n- sl = len(s) \n \n- if s[:sl] == s[-sl:]: ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u124498235", "problem_id": "p03416", "submission1_id": "s188034348", "submission2_id": "s520373528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\ncnt = 0\nfor i in range(a,b+1):\n\ts = str(i)\n\tif s[:2] == s[-2:]:\n\t\tcnt += 1\nprint (cnt)", "code2": "a, b = map(int, input().split())\ncnt = 0\nfor i in range(a,b+1):\n\ts = str(i)\n\td = s[::-1]\n\tif s == d:\n\t\tcnt += 1\nprint (cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575737897", "date2": "1575738240", "bleu_score": "0.885890418892234", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "31415 41187\n", "actual_output": "98\n", "expected_output": "97\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=31415, b=41187\ncnt = 0 # (1): cnt=0\nfor i in range(a,b+1): # (2): i=31415 (5): i=31416 ... (29419): NO CHANGE\n\ts = str(i) # (3): s=31415 (6): s=31416 ... (29417): s=41187\n\tif s[:2] == s[-2:]: # (4): NO CHANGE (7): NO CHANGE ... (29418): NO CHANGE\n\t\tcnt += 1 # (53): cnt=1 (354): cnt=2 ... (29280): cnt=98\nprint (cnt)"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n cnt = 0\n for i in range(a,b+1):\n \ts = str(i)\n-\tif s[:2] == s[-2:]:\n+\td = s[::-1]\n+\tif s == d:\n \t\tcnt += 1\n print (cnt)\n", "FL_content": " a, b = map(int, input().split())\n cnt = 0\n for i in range(a,b+1):\n \ts = str(i)\n-\tif s[:2] == s[-2:]:\n \t\tcnt += 1\n print (cnt)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u627147604", "problem_id": "p03416", "submission1_id": "s229289554", "submission2_id": "s857863525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def is_palindromic(n):\n if str(n) == str(n)[::-1]:\n True\n else:\n False\n\nA,B = map(int, input().split())\nfor i in range(A, B):\n if is_palindromic(i):\n print(i)", "code2": "def is_palindromic(n):\n if str(n) == str(n)[::-1]:\n return True\n else:\n return False\n\nres = 0\nA,B = map(int, input().split())\nfor i in range(A, B+1):\n if is_palindromic(i):\n res += 1 \nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521968940", "date2": "1521979090", "bleu_score": "0.80649271340316", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "36170 27129\n", "actual_output": "", "expected_output": "0\n\n", "anno_code": ["def is_palindromic(n): # (0): is_palindromic=\n if str(n) == str(n)[::-1]:\n True\n else:\n False\n\nA,B = map(int, input().split()) # (1): A=36170, B=27129\nfor i in range(A, B):\n if is_palindromic(i):\n print(i)"], "anno_status": [true], "diff_content": " def is_palindromic(n):\n if str(n) == str(n)[::-1]:\n- True\n+ return True\n else:\n- False\n+ return False\n \n+res = 0\n A,B = map(int, input().split())\n-for i in range(A, B):\n+for i in range(A, B+1):\n if is_palindromic(i):\n- print(i)\n+ res += 1 \n+print(res)\n", "FL_content": " def is_palindromic(n):\n if str(n) == str(n)[::-1]:\n- True\n else:\n- False\n \n A,B = map(int, input().split())\n-for i in range(A, B):\n if is_palindromic(i):\n- print(i)\n", "added_lines": 6, "removed_lines": 4, "code1_lines": 10 }, { "user_id": "u131634965", "problem_id": "p03416", "submission1_id": "s186318127", "submission2_id": "s524339061", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b=map(int,input().split())\ncount=0\nfor i in range(a,b+1):\n i=str(i)\n if i[:2]==i[4:]:\n count+=1\nprint(count)", "code2": "a,b=map(int,input().split())\ncount=0\nfor i in range(a,b+1):\n i=str(i)\n if i[:3]==i[:1:-1]:\n count+=1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566067578", "date2": "1566067759", "bleu_score": "0.929282859810946", "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, 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, 0], "code1_test_score": 32, "total_score": 102, "input": "36382 51391\n", "actual_output": "0\n", "expected_output": "150\n\n", "anno_code": ["a,b=map(int,input().split()) # (0): a=36382, b=51391\ncount=0 # (1): count=0\nfor i in range(a,b+1): # (2): i=36382 (5): i=36383 ... (45032): NO CHANGE\n i=str(i) # (3): i=36382 (6): i=36383 ... (45030): i=51391\n if i[:2]==i[4:]: # (4): NO CHANGE (7): NO CHANGE ... (45031): NO CHANGE\n count+=1\nprint(count)"], "anno_status": [true], "diff_content": " a,b=map(int,input().split())\n count=0\n for i in range(a,b+1):\n i=str(i)\n- if i[:2]==i[4:]:\n+ if i[:3]==i[:1:-1]:\n count+=1\n print(count)\n", "FL_content": " a,b=map(int,input().split())\n count=0\n for i in range(a,b+1):\n i=str(i)\n- if i[:2]==i[4:]:\n count+=1\n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u556589653", "problem_id": "p03416", "submission1_id": "s037518763", "submission2_id": "s253072561", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B = map(int,input().split())\nans = 0\nfor i in range(A,B+1):\n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n ans += 1\n print(i)\n else:\n ans += 0\n else:\n ans += 0\nprint(ans)", "code2": "A,B = map(int,input().split())\nans = 0\nfor i in range(A,B+1):\n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n ans += 1\n else:\n ans += 0\n else:\n ans += 0\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559958990", "date2": "1559959027", "bleu_score": "0.9073543494279289", "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, 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, 0], "code1_test_score": 32, "total_score": 102, "input": "12729 38240\n", "actual_output": "12821\n12921\n13031\n13131\n13231\n13331\n13431\n13531\n13631\n13731\n13831\n13931\n14041\n14141\n14241\n14341\n14441\n14541\n14641\n14741\n14841\n14941\n15051\n15151\n15251\n15351\n15451\n15551\n15651\n15751\n15851\n15951\n16061\n16161\n16261\n16361\n16461\n16561\n16661\n16761\n16861\n16961\n17071\n17171\n17271\n17371\n17471\n17571\n17671\n17771\n17871\n17971\n18081\n18181\n18281\n18381\n18481\n18581\n18681\n18781\n18881\n18981\n19091\n19191\n19291\n19391\n19491\n19591\n19691\n19791\n19891\n19991\n20002\n20102\n20202\n20302\n20402\n20502\n20602\n20702\n20802\n20902\n21012\n21112\n21212\n21312\n21412\n21512\n21612\n21712\n21812\n21912\n22022\n22122\n22222\n22322\n22422\n22522\n22622\n22722\n22822\n22922\n23032\n23132\n23232\n23332\n23432\n23532\n23632\n23732\n23832\n23932\n24042\n24142\n24242\n24342\n24442\n24542\n24642\n24742\n24842\n24942\n25052\n25152\n25252\n25352\n25452\n25552\n25652\n25752\n25852\n25952\n26062\n26162\n26262\n26362\n26462\n26562\n26662\n26762\n26862\n26962\n27072\n27172\n27272\n27372\n27472\n27572\n27672\n27772\n27872\n27972\n28082\n28182\n28282\n28382\n28482\n28582\n28682\n28782\n28882\n28982\n29092\n29192\n29292\n29392\n29492\n29592\n29692\n29792\n29892\n29992\n30003\n30103\n30203\n30303\n30403\n30503\n30603\n30703\n30803\n30903\n31013\n31113\n31213\n31313\n31413\n31513\n31613\n31713\n31813\n31913\n32023\n32123\n32223\n32323\n32423\n32523\n32623\n32723\n32823\n32923\n33033\n33133\n33233\n33333\n33433\n33533\n33633\n33733\n33833\n33933\n34043\n34143\n34243\n34343\n34443\n34543\n34643\n34743\n34843\n34943\n35053\n35153\n35253\n35353\n35453\n35553\n35653\n35753\n35853\n35953\n36063\n36163\n36263\n36363\n36463\n36563\n36663\n36763\n36863\n36963\n37073\n37173\n37273\n37373\n37473\n37573\n37673\n37773\n37873\n37973\n38083\n38183\n254\n", "expected_output": "254\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " A,B = map(int,input().split())\n ans = 0\n for i in range(A,B+1):\n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n ans += 1\n- print(i)\n else:\n ans += 0\n else:\n ans += 0\n print(ans)\n", "FL_content": " A,B = map(int,input().split())\n ans = 0\n for i in range(A,B+1):\n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n ans += 1\n- print(i)\n else:\n ans += 0\n else:\n ans += 0\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u935254309", "problem_id": "p03416", "submission1_id": "s890304064", "submission2_id": "s118847536", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B = map(int,input().split())\n\ncnt = 0\n\nfor i in range(A,B+1):\n \n Str = str(i)\n \n if Str[:2] == Str[3:]:\n cnt += 1\n \nprint(cnt)", "code2": "A,B = map(int,input().split())\n\ncnt = 0\n\nfor i in range(A,B+1):\n \n Str = str(i)\n \n if Str[0] == Str[4] and Str[1]==Str[3]:\n cnt += 1\n \nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590461992", "date2": "1590462416", "bleu_score": "0.864098990572094", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "15714 19549\n", "actual_output": "39\n", "expected_output": "38\n\n", "anno_code": ["A,B = map(int,input().split()) # (0): A=15714, B=19549\n\ncnt = 0 # (1): cnt=0\n\nfor i in range(A,B+1): # (2): i=15714 (5): i=15715 ... (11549): NO CHANGE\n \n Str = str(i) # (3): Str=15714 (6): Str=15715 ... (11547): Str=19549\n \n if Str[:2] == Str[3:]: # (4): NO CHANGE (7): NO CHANGE ... (11548): NO CHANGE\n cnt += 1 # (8): cnt=1 (309): cnt=2 ... (11458): cnt=39\n \nprint(cnt)"], "anno_status": [true], "diff_content": " A,B = map(int,input().split())\n \n cnt = 0\n \n for i in range(A,B+1):\n \n Str = str(i)\n \n- if Str[:2] == Str[3:]:\n+ if Str[0] == Str[4] and Str[1]==Str[3]:\n cnt += 1\n \n print(cnt)\n", "FL_content": " A,B = map(int,input().split())\n \n cnt = 0\n \n for i in range(A,B+1):\n \n Str = str(i)\n \n- if Str[:2] == Str[3:]:\n cnt += 1\n \n print(cnt)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u391675400", "problem_id": "p03416", "submission1_id": "s285899671", "submission2_id": "s350384733", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,(input().split()))\ncount = 0\nfor i in range(a,b+1):\n num_str = str(i)\n if (num_str[0] == num_str[4]) and (num_str[1] == num_str[3]):\n count += 1\nprint(range(a,b))", "code2": "a,b = map(int,(input().split()))\ncount = 0\nfor i in range(a,b+1):\n num_str = str(i)\n\n if (num_str[0] == num_str[4]) and (num_str[1] == num_str[3]):\n count += 1\nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584748435", "date2": "1584748578", "bleu_score": "0.9399166323907319", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "12729 17376\n", "actual_output": "range(12729, 17376)\n", "expected_output": "46\n\n", "anno_code": ["a,b = map(int,(input().split())) # (0): a=12729, b=17376\ncount = 0 # (1): count=0\nfor i in range(a,b+1): # (2): i=12729 (5): i=12730 ... (13992): NO CHANGE\n num_str = str(i) # (3): num_str=12729 (6): num_str=12730 ... (13990): num_str=17376\n if (num_str[0] == num_str[4]) and (num_str[1] == num_str[3]): # (4): NO CHANGE (7): NO CHANGE ... (13991): NO CHANGE\n count += 1 # (281): count=1 (582): count=2 ... (13976): count=46\nprint(range(a,b))"], "anno_status": [true], "diff_content": " a,b = map(int,(input().split()))\n count = 0\n for i in range(a,b+1):\n num_str = str(i)\n+\n if (num_str[0] == num_str[4]) and (num_str[1] == num_str[3]):\n count += 1\n-print(range(a,b))\n+print(count)\n+\n", "FL_content": " a,b = map(int,(input().split()))\n count = 0\n for i in range(a,b+1):\n num_str = str(i)\n if (num_str[0] == num_str[4]) and (num_str[1] == num_str[3]):\n count += 1\n-print(range(a,b))\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u617440820", "problem_id": "p03416", "submission1_id": "s995609846", "submission2_id": "s662920184", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input_one = input().split()\ni = int(input_one[0])\ntwo = input_one[1]\n\n\n\n\nwhile i <= int(two):\n \n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n print(int(i))\n\n i = int(i) + 1", "code2": "input_one = input().split()\ni = int(input_one[0])\ntwo = input_one[1]\ncount = 0\n\n\n\nwhile i <= int(two):\n \n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n count += 1\n\n i = int(i) + 1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571957420", "date2": "1571957560", "bleu_score": "0.8676578696046114", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "44323 83416\n", "actual_output": "44344\n44444\n44544\n44644\n44744\n44844\n44944\n45054\n45154\n45254\n45354\n45454\n45554\n45654\n45754\n45854\n45954\n46064\n46164\n46264\n46364\n46464\n46564\n46664\n46764\n46864\n46964\n47074\n47174\n47274\n47374\n47474\n47574\n47674\n47774\n47874\n47974\n48084\n48184\n48284\n48384\n48484\n48584\n48684\n48784\n48884\n48984\n49094\n49194\n49294\n49394\n49494\n49594\n49694\n49794\n49894\n49994\n50005\n50105\n50205\n50305\n50405\n50505\n50605\n50705\n50805\n50905\n51015\n51115\n51215\n51315\n51415\n51515\n51615\n51715\n51815\n51915\n52025\n52125\n52225\n52325\n52425\n52525\n52625\n52725\n52825\n52925\n53035\n53135\n53235\n53335\n53435\n53535\n53635\n53735\n53835\n53935\n54045\n54145\n54245\n54345\n54445\n54545\n54645\n54745\n54845\n54945\n55055\n55155\n55255\n55355\n55455\n55555\n55655\n55755\n55855\n55955\n56065\n56165\n56265\n56365\n56465\n56565\n56665\n56765\n56865\n56965\n57075\n57175\n57275\n57375\n57475\n57575\n57675\n57775\n57875\n57975\n58085\n58185\n58285\n58385\n58485\n58585\n58685\n58785\n58885\n58985\n59095\n59195\n59295\n59395\n59495\n59595\n59695\n59795\n59895\n59995\n60006\n60106\n60206\n60306\n60406\n60506\n60606\n60706\n60806\n60906\n61016\n61116\n61216\n61316\n61416\n61516\n61616\n61716\n61816\n61916\n62026\n62126\n62226\n62326\n62426\n62526\n62626\n62726\n62826\n62926\n63036\n63136\n63236\n63336\n63436\n63536\n63636\n63736\n63836\n63936\n64046\n64146\n64246\n64346\n64446\n64546\n64646\n64746\n64846\n64946\n65056\n65156\n65256\n65356\n65456\n65556\n65656\n65756\n65856\n65956\n66066\n66166\n66266\n66366\n66466\n66566\n66666\n66766\n66866\n66966\n67076\n67176\n67276\n67376\n67476\n67576\n67676\n67776\n67876\n67976\n68086\n68186\n68286\n68386\n68486\n68586\n68686\n68786\n68886\n68986\n69096\n69196\n69296\n69396\n69496\n69596\n69696\n69796\n69896\n69996\n70007\n70107\n70207\n70307\n70407\n70507\n70607\n70707\n70807\n70907\n71017\n71117\n71217\n71317\n71417\n71517\n71617\n71717\n71817\n71917\n72027\n72127\n72227\n72327\n72427\n72527\n72627\n72727\n72827\n72927\n73037\n73137\n73237\n73337\n73437\n73537\n73637\n73737\n73837\n73937\n74047\n74147\n74247\n74347\n74447\n74547\n74647\n74747\n74847\n74947\n75057\n75157\n75257\n75357\n75457\n75557\n75657\n75757\n75857\n75957\n76067\n76167\n76267\n76367\n76467\n76567\n76667\n76767\n76867\n76967\n77077\n77177\n77277\n77377\n77477\n77577\n77677\n77777\n77877\n77977\n78087\n78187\n78287\n78387\n78487\n78587\n78687\n78787\n78887\n78987\n79097\n79197\n79297\n79397\n79497\n79597\n79697\n79797\n79897\n79997\n80008\n80108\n80208\n80308\n80408\n80508\n80608\n80708\n80808\n80908\n81018\n81118\n81218\n81318\n81418\n81518\n81618\n81718\n81818\n81918\n82028\n82128\n82228\n82328\n82428\n82528\n82628\n82728\n82828\n82928\n83038\n83138\n83238\n83338\n", "expected_output": "391\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " input_one = input().split()\n i = int(input_one[0])\n two = input_one[1]\n-\n+count = 0\n \n \n \n while i <= int(two):\n \n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n- print(int(i))\n+ count += 1\n \n i = int(i) + 1\n+print(count)\n", "FL_content": " input_one = input().split()\n i = int(input_one[0])\n two = input_one[1]\n-\n \n \n \n while i <= int(two):\n \n i = str(i)\n if i[0] == i[4]:\n if i[1] == i[3]:\n- print(int(i))\n \n i = int(i) + 1\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u411858517", "problem_id": "p03416", "submission1_id": "s137413469", "submission2_id": "s503661187", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\ncount = 0\n\nfor i in range(A, B+1):\n i = str(i)\n if i[:2] == i[-2:]:\n count += 1\n \nprint(count)", "code2": "A, B = map(int, input().split())\ncount = 0\n\nfor i in range(A, B+1):\n i = str(i)\n if i[:2] == i[:-3:-1]:\n count += 1\n \nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528658212", "date2": "1528658621", "bleu_score": "0.9513666812273872", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "31415 62064\n", "actual_output": "307\n", "expected_output": "306\n\n", "anno_code": ["A, B = map(int, input().split()) # (0): A=31415, B=62064\ncount = 0 # (1): count=0\n\nfor i in range(A, B+1): # (2): i=31415 (5): i=31416 ... (92259): NO CHANGE\n i = str(i) # (3): i=31415 (6): i=31416 ... (92257): i=62064\n if i[:2] == i[-2:]: # (4): NO CHANGE (7): NO CHANGE ... (92258): NO CHANGE\n count += 1 # (53): count=1 (354): count=2 ... (92252): count=307\n \nprint(count)"], "anno_status": [true], "diff_content": " A, B = map(int, input().split())\n count = 0\n \n for i in range(A, B+1):\n i = str(i)\n- if i[:2] == i[-2:]:\n+ if i[:2] == i[:-3:-1]:\n count += 1\n \n print(count)\n", "FL_content": " A, B = map(int, input().split())\n count = 0\n \n for i in range(A, B+1):\n i = str(i)\n- if i[:2] == i[-2:]:\n count += 1\n \n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u177398299", "problem_id": "p03416", "submission1_id": "s562321401", "submission2_id": "s840162160", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\nans = 0\nfor i in range(A, B + 1):\n i = str(i)\n if i[:2] == i[-2:]:\n ans += 1\nprint(ans)", "code2": "A, B = map(int, input().split())\nans = 0\nfor i in range(A, B + 1):\n i = str(i)\n if i[:2] == i[:2:-1]:\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533154980", "date2": "1533155227", "bleu_score": "0.9585005372222019", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "15858 19549\n", "actual_output": "37\n", "expected_output": "36\n\n", "anno_code": ["A, B = map(int, input().split()) # (0): A=15858, B=19549\nans = 0 # (1): ans=0\nfor i in range(A, B + 1): # (2): i=15858 (5): i=15859 ... (11115): NO CHANGE\n i = str(i) # (3): i=15858 (6): i=15859 ... (11113): i=19549\n if i[:2] == i[-2:]: # (4): NO CHANGE (7): NO CHANGE ... (11114): NO CHANGE\n ans += 1 # (176): ans=1 (480): ans=2 ... (11024): ans=37\nprint(ans)"], "anno_status": [true], "diff_content": " A, B = map(int, input().split())\n ans = 0\n for i in range(A, B + 1):\n i = str(i)\n- if i[:2] == i[-2:]:\n+ if i[:2] == i[:2:-1]:\n ans += 1\n print(ans)\n", "FL_content": " A, B = map(int, input().split())\n ans = 0\n for i in range(A, B + 1):\n i = str(i)\n- if i[:2] == i[-2:]:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u724687935", "problem_id": "p03416", "submission1_id": "s994522382", "submission2_id": "s974486864", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\n\ncnt = 0\nfor n in range(A, B + 1):\n s = str(n)\n if s[:2] == s[3:]:\n cnt += 1\n\nprint(cnt)\n", "code2": "A, B = map(int, input().split())\n\ncnt = 0\nfor n in range(A, B + 1):\n s = str(n)\n if s[:2] == s[4] + s[3]:\n cnt += 1\n\nprint(cnt)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585033866", "date2": "1585033939", "bleu_score": "0.9389614324780431", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "38168 41187\n", "actual_output": "30\n", "expected_output": "31\n\n", "anno_code": ["A, B = map(int, input().split()) # (0): A=38168, B=41187\n\ncnt = 0 # (1): cnt=0\nfor n in range(A, B + 1): # (2): n=38168 (5): n=38169 ... (9092): NO CHANGE\n s = str(n) # (3): s=38168 (6): s=38169 ... (9090): s=41187\n if s[:2] == s[3:]: # (4): NO CHANGE (7): NO CHANGE ... (9091): NO CHANGE\n cnt += 1 # (215): cnt=1 (516): cnt=2 ... (8953): cnt=30\n\nprint(cnt)\n"], "anno_status": [true], "diff_content": " A, B = map(int, input().split())\n \n cnt = 0\n for n in range(A, B + 1):\n s = str(n)\n- if s[:2] == s[3:]:\n+ if s[:2] == s[4] + s[3]:\n cnt += 1\n \n print(cnt)\n \n", "FL_content": " A, B = map(int, input().split())\n \n cnt = 0\n for n in range(A, B + 1):\n s = str(n)\n- if s[:2] == s[3:]:\n cnt += 1\n \n print(cnt)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u940102677", "problem_id": "p03416", "submission1_id": "s245993608", "submission2_id": "s661813857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split()) \nc = 0\nfor i in range(1,10):\n for j in range(0,10):\n for k in range(0,10):\n x = 10001*i+1010*j+100*k\n if x >= a and x <= b:\n c += 1", "code2": "a,b = map(int,input().split()) \nc = 0\nfor i in range(1,10):\n for j in range(0,10):\n for k in range(0,10):\n x = 10001*i+1010*j+100*k\n if x >= a and x <= b:\n c += 1\nprint(c)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1538517123", "date2": "1538517155", "bleu_score": "0.9527542377681539", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "15714 19549\n", "actual_output": "", "expected_output": "38\n\n", "anno_code": ["a,b = map(int,input().split()) # (0): a=15714, b=19549\nc = 0 # (1): c=0\nfor i in range(1,10): # (2): i=1 (362): i=2 ... (2616): i=9\n for j in range(0,10): # (3): j=0 (35): j=1 ... (2937): NO CHANGE\n for k in range(0,10): # (4): k=0 (7): k=1 ... (2936): NO CHANGE\n x = 10001*i+1010*j+100*k # (5): x=10001 (8): x=10101 ... (2934): x=99999\n if x >= a and x <= b: # (6): NO CHANGE (9): NO CHANGE ... (2935): NO CHANGE\n c += 1 # (188): c=1 (192): c=2 ... (344): c=38\n"], "anno_status": [true], "diff_content": " a,b = map(int,input().split()) \n c = 0\n for i in range(1,10):\n for j in range(0,10):\n for k in range(0,10):\n x = 10001*i+1010*j+100*k\n if x >= a and x <= b:\n c += 1\n+print(c)\n", "FL_content": " a,b = map(int,input().split()) \n c = 0\n for i in range(1,10):\n for j in range(0,10):\n for k in range(0,10):\n x = 10001*i+1010*j+100*k\n if x >= a and x <= b:\n c += 1\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u587213169", "problem_id": "p03416", "submission1_id": "s734891014", "submission2_id": "s434924208", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b =map(int, input().split())\ncount=0\nfor i in range(a+1,b+1):\n m = list(str(i))\n if m[0]==m[3]:\n if m[1]==m[2]:\n count+=1\nprint(count)", "code2": "a, b =map(int, input().split())\ncount=0\nfor i in range(a,b+1):\n m = list(str(i))\n if m[0]==m[4]:\n if m[1]==m[3]:\n count+=1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567097145", "date2": "1567097712", "bleu_score": "0.9622152178789292", "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, 1, 1, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 35, "total_score": 102, "input": "25468 42009\n", "actual_output": "170\n", "expected_output": "165\n\n", "anno_code": ["a, b =map(int, input().split()) # (0): a=25468, b=42009\ncount=0 # (1): count=0\nfor i in range(a+1,b+1): # (2): i=25469 (5): i=25470 ... (51445): NO CHANGE\n m = list(str(i)) # (3): m=['2', '5', '4', '6', '9'] (6): m=['2', '5', '4', '7', '0'] ... (51443): m=['4', '2', '0', '0', '9']\n if m[0]==m[3]: # (4): NO CHANGE (7): NO CHANGE ... (51444): NO CHANGE\n if m[1]==m[2]: # (158): NO CHANGE (163): NO CHANGE ... (51264): NO CHANGE\n count+=1 # (159): count=1 (164): count=2 ... (48784): count=170\nprint(count)"], "anno_status": [true], "diff_content": " a, b =map(int, input().split())\n count=0\n-for i in range(a+1,b+1):\n+for i in range(a,b+1):\n m = list(str(i))\n- if m[0]==m[3]:\n- if m[1]==m[2]:\n+ if m[0]==m[4]:\n+ if m[1]==m[3]:\n count+=1\n print(count)\n", "FL_content": " a, b =map(int, input().split())\n count=0\n-for i in range(a+1,b+1):\n m = list(str(i))\n- if m[0]==m[3]:\n- if m[1]==m[2]:\n count+=1\n print(count)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u965436898", "problem_id": "p03416", "submission1_id": "s420953546", "submission2_id": "s863691749", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = map(int,input().split())\nans = 0\nfor i in range(a,b+1):\n s = list(str(i))\n left = s[0:2]\n right = s[3:]\n if left == right:\n ans += 1\nprint(ans)", "code2": "a,b = map(int,input().split())\nans = 0\nfor i in range(a,b+1):\n s = list(str(i))\n left = s[0:2]\n right = s[3:]\n right.reverse()\n if left == right:\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575908848", "date2": "1575908925", "bleu_score": "0.8956475347783865", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "15435 22770\n", "actual_output": "73\n", "expected_output": "74\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " a,b = map(int,input().split())\n ans = 0\n for i in range(a,b+1):\n s = list(str(i))\n left = s[0:2]\n right = s[3:]\n+ right.reverse()\n if left == right:\n ans += 1\n print(ans)\n", "FL_content": " a,b = map(int,input().split())\n ans = 0\n for i in range(a,b+1):\n s = list(str(i))\n left = s[0:2]\n right = s[3:]\n if left == right:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u384793271", "problem_id": "p03416", "submission1_id": "s180994182", "submission2_id": "s260092175", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\n\nans = 0\nfor i in range(a, b+1):\n if str(i)[:2] == str(i)[3:]:\n ans += 1\nprint(ans)", "code2": "a, b = map(int, input().split())\n\nans = 0\nfor i in range(a, b+1):\n if str(i)[:2] == str(i)[-1:-3:-1]:\n ans += 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596237916", "date2": "1596239167", "bleu_score": "0.9326960877896854", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "11516 30706\n", "actual_output": "191\n", "expected_output": "192\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=11516, b=30706\n\nans = 0 # (1): ans=0\nfor i in range(a, b+1): # (2): i=11516 (4): i=11517 ... (38575): NO CHANGE\n if str(i)[:2] == str(i)[3:]: # (3): NO CHANGE (5): NO CHANGE ... (38574): NO CHANGE\n ans += 1 # (194): ans=1 (395): ans=2 ... (38422): ans=191\nprint(ans)"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n \n ans = 0\n for i in range(a, b+1):\n- if str(i)[:2] == str(i)[3:]:\n+ if str(i)[:2] == str(i)[-1:-3:-1]:\n ans += 1\n print(ans)\n", "FL_content": " a, b = map(int, input().split())\n \n ans = 0\n for i in range(a, b+1):\n- if str(i)[:2] == str(i)[3:]:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u126844573", "problem_id": "p03416", "submission1_id": "s171390200", "submission2_id": "s504550017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B = map(int, input().split())\n\ncount = 0\nfor q in range(A, B):\n if str(q)[:2] == str(q)[-2:]:\n count += 1\nprint(count)\n", "code2": "A, B = map(int, input().split())\n\ncount = 0\nfor q in range(A, B + 1):\n w = str(q)\n if w[:2] == (w[-1] + w[-2]):\n count += 1\nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587613836", "date2": "1587614567", "bleu_score": "0.7865125881196511", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "31415 62064\n", "actual_output": "307\n", "expected_output": "306\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " A, B = map(int, input().split())\n \n count = 0\n-for q in range(A, B):\n- if str(q)[:2] == str(q)[-2:]:\n+for q in range(A, B + 1):\n+ w = str(q)\n+ if w[:2] == (w[-1] + w[-2]):\n count += 1\n print(count)\n \n", "FL_content": " A, B = map(int, input().split())\n \n count = 0\n-for q in range(A, B):\n- if str(q)[:2] == str(q)[-2:]:\n count += 1\n print(count)\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u587213169", "problem_id": "p03416", "submission1_id": "s879327354", "submission2_id": "s434924208", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b =map(int, input().split())\ncount=0\nfor i in range(a,b):\n m = list(str(i))\n if m[0]==m[3]:\n if m[1]==m[2]:\n count+=1\nprint(count)", "code2": "a, b =map(int, input().split())\ncount=0\nfor i in range(a,b+1):\n m = list(str(i))\n if m[0]==m[4]:\n if m[1]==m[3]:\n count+=1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567097060", "date2": "1567097712", "bleu_score": "0.9616931889585919", "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, 1, 1, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 35, "total_score": 102, "input": "10845 11333\n", "actual_output": "10\n", "expected_output": "5\n\n", "anno_code": ["a, b =map(int, input().split()) # (0): a=10845, b=11333\ncount=0 # (1): count=0\nfor i in range(a,b): # (2): i=10845 (5): i=10846 ... (1526): NO CHANGE\n m = list(str(i)) # (3): m=['1', '0', '8', '4', '5'] (6): m=['1', '0', '8', '4', '6'] ... (1524): m=['1', '1', '3', '3', '2']\n if m[0]==m[3]: # (4): NO CHANGE (7): NO CHANGE ... (1525): NO CHANGE\n if m[1]==m[2]: # (200): NO CHANGE (204): NO CHANGE ... (1486): NO CHANGE\n count+=1 # (821): count=1 (826): count=2 ... (866): count=10\nprint(count)"], "anno_status": [true], "diff_content": " a, b =map(int, input().split())\n count=0\n-for i in range(a,b):\n+for i in range(a,b+1):\n m = list(str(i))\n- if m[0]==m[3]:\n- if m[1]==m[2]:\n+ if m[0]==m[4]:\n+ if m[1]==m[3]:\n count+=1\n print(count)\n", "FL_content": " a, b =map(int, input().split())\n count=0\n-for i in range(a,b):\n m = list(str(i))\n- if m[0]==m[3]:\n- if m[1]==m[2]:\n count+=1\n print(count)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u272557899", "problem_id": "p03477", "submission1_id": "s347971644", "submission2_id": "s374603020", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = map(int, input().split())\ns = a+b\nt = c+d\n\nif s>t:\n print(\"Left\")\nif st:\n print(\"Left\")\nelif st: # (3): NO CHANGE\n print(\"Left\") # (4): NO CHANGE\nif st:\n print(\"Left\")\n-if st:\n print(\"Left\")\n-if s\n \n a, b, c, d = map(int, input().split())\n if a+b < c+d:\n print(\"Right\")\n if a+b == c+d:\n print(\"Balanced\")\n else:\n print(\"Left\")\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n \n \n def main():\n \n a, b, c, d = map(int, input().split())\n if a+b < c+d:\n print(\"Right\")\n- if a+b == c+d:\n+ elif a+b == c+d:\n print(\"Balanced\")\n else:\n print(\"Left\")\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " \n \n \n def main():\n \n a, b, c, d = map(int, input().split())\n if a+b < c+d:\n print(\"Right\")\n- if a+b == c+d:\n print(\"Balanced\")\n else:\n print(\"Left\")\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u115877451", "problem_id": "p03477", "submission1_id": "s765001388", "submission2_id": "s892135187", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d=map(int,input().split())\nif a+b>c+d:\n print('Right')\nelif (a+b)==(c+d):\n print('Balanced')\nelse:\n print('Left')\n ", "code2": "a,b,c,d=map(int,input().split())\nif a+b>c+d:\n print('Left')\nelif (a+b)==(c+d):\n print('Balanced')\nelse:\n print('Right')\n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1589425630", "date2": "1589425726", "bleu_score": "1.0", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 103, "input": "-6 3 1 1\n", "actual_output": "Left\n", "expected_output": "Right\n\n", "anno_code": ["a,b,c,d=map(int,input().split()) # (0): a=-6, b=3, c=1, d=1\nif a+b>c+d: # (1): NO CHANGE\n print('Right')\nelif (a+b)==(c+d): # (2): NO CHANGE\n print('Balanced')\nelse:\n print('Left')\n "], "anno_status": [true], "diff_content": " a,b,c,d=map(int,input().split())\n if a+b>c+d:\n- print('Right')\n+ print('Left')\n elif (a+b)==(c+d):\n print('Balanced')\n else:\n- print('Left')\n+ print('Right')\n \n", "FL_content": " a,b,c,d=map(int,input().split())\n if a+b>c+d:\n- print('Right')\n elif (a+b)==(c+d):\n print('Balanced')\n else:\n- print('Left')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u536717874", "problem_id": "p03477", "submission1_id": "s626619088", "submission2_id": "s471865720", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\n\ndef main(argv=sys.argv):\n a, b, c, d = map(int, input().split(' '))\n \n if a + b > c + d:\n print('left')\n elif a + b < c + d:\n print('Right')\n else:\n print('Balanced')\n \n \n return 0\n\n\nif __name__ == '__main__':\n sys.exit(main())", "code2": "\nimport sys\n\n\ndef main(argv=sys.argv):\n a, b, c, d = map(int, input().split(' '))\n \n if a + b > c + d:\n print('Left')\n elif a + b < c + d:\n print('Right')\n else:\n print('Balanced')\n \n \n return 0\n\n\nif __name__ == '__main__':\n sys.exit(main())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577514490", "date2": "1577514594", "bleu_score": "0.9904119091631277", "code1_test_status": [1, 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, 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, 1], "code1_test_score": 68, "total_score": 103, "input": "0 18 1 0\n", "actual_output": "left\n", "expected_output": "Left\n\n", "anno_code": ["\nimport sys\n\n\ndef main(argv=sys.argv): # (0): main=\n a, b, c, d = map(int, input().split(' '))\n \n if a + b > c + d:\n print('left')\n elif a + b < c + d:\n print('Right')\n else:\n print('Balanced')\n \n \n return 0\n\n\nif __name__ == '__main__':\n sys.exit(main())"], "anno_status": [true], "diff_content": " \n import sys\n \n \n def main(argv=sys.argv):\n a, b, c, d = map(int, input().split(' '))\n \n if a + b > c + d:\n- print('left')\n+ print('Left')\n elif a + b < c + d:\n print('Right')\n else:\n print('Balanced')\n \n \n return 0\n \n \n if __name__ == '__main__':\n sys.exit(main())\n", "FL_content": " \n import sys\n \n \n def main(argv=sys.argv):\n a, b, c, d = map(int, input().split(' '))\n \n if a + b > c + d:\n- print('left')\n elif a + b < c + d:\n print('Right')\n else:\n print('Balanced')\n \n \n return 0\n \n \n if __name__ == '__main__':\n sys.exit(main())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u462329577", "problem_id": "p03477", "submission1_id": "s131498746", "submission2_id": "s936177151", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = map(str,input().split())\nprint(\"Left\" if a+b > c+d else \"Balanced\" if (a+b) == (c+d) else \"Right\")\n", "code2": "a,b,c,d = map(int,input().split())\nprint(\"Left\" if a+b > c+d else \"Balanced\" if (a+b) == (c+d) else \"Right\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565566470", "date2": "1565566555", "bleu_score": "0.9602169060276313", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 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, 0, 0, 1], "code1_test_score": 67, "total_score": 103, "input": "-1 18 1 0\n", "actual_output": "Right\n", "expected_output": "Left\n\n", "anno_code": ["a,b,c,d = map(str,input().split()) # (0): a=-1, b=18, c=1, d=0\nprint(\"Left\" if a+b > c+d else \"Balanced\" if (a+b) == (c+d) else \"Right\")\n"], "anno_status": [true], "diff_content": "-a,b,c,d = map(str,input().split())\n+a,b,c,d = map(int,input().split())\n print(\"Left\" if a+b > c+d else \"Balanced\" if (a+b) == (c+d) else \"Right\")\n \n", "FL_content": "-a,b,c,d = map(str,input().split())\n print(\"Left\" if a+b > c+d else \"Balanced\" if (a+b) == (c+d) else \"Right\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u523781418", "problem_id": "p03477", "submission1_id": "s484773932", "submission2_id": "s866656251", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d=map(int, input().split())\nif(a+b)>(c+d):\n print(\"Left\")\nif(a+b)==(c+d):\n print(\"Balanced\")\nelse:\n print(\"Right\")", "code2": "a,b,c,d=map(int, input().split())\nif(a+b)>(c+d):\n print(\"Left\")\nif(a+b)==(c+d):\n print(\"Balanced\")\nelif(a+b)<(c+d):\n print(\"Right\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572389080", "date2": "1572389165", "bleu_score": "0.8951904316930472", "code1_test_status": [1, 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, 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, 1], "code1_test_score": 68, "total_score": 103, "input": "2 5 0 1\n", "actual_output": "Left\nRight\n", "expected_output": "Left\n\n", "anno_code": ["a,b,c,d=map(int, input().split()) # (0): a=2, b=5, c=0, d=1\nif(a+b)>(c+d): # (1): NO CHANGE\n print(\"Left\") # (2): NO CHANGE\nif(a+b)==(c+d): # (3): NO CHANGE\n print(\"Balanced\")\nelse:\n print(\"Right\")"], "anno_status": [true], "diff_content": " a,b,c,d=map(int, input().split())\n if(a+b)>(c+d):\n print(\"Left\")\n if(a+b)==(c+d):\n print(\"Balanced\")\n-else:\n+elif(a+b)<(c+d):\n print(\"Right\")\n", "FL_content": " a,b,c,d=map(int, input().split())\n if(a+b)>(c+d):\n print(\"Left\")\n if(a+b)==(c+d):\n print(\"Balanced\")\n-else:\n print(\"Right\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u708255304", "problem_id": "p03477", "submission1_id": "s676517690", "submission2_id": "s673472806", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C, D = map(int, input().split())\nif A+B == C+D:\n print(\"Balanced\")\nif A+B > C+D:\n print(\"Left\")\nif A+B < C+D:\n print(\"Balanced\")\n", "code2": "A, B, C, D = map(int, input().split())\nif A+B == C+D:\n print(\"Balanced\")\nif A+B > C+D:\n print(\"Left\")\nif A+B < C+D:\n print(\"Right\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577808203", "date2": "1577808224", "bleu_score": "0.9302921682270286", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 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, 1, 1, 0], "code1_test_score": 39, "total_score": 103, "input": "-1 2 3 5\n", "actual_output": "Balanced\n", "expected_output": "Right\n\n", "anno_code": ["A, B, C, D = map(int, input().split()) # (0): A=-1, B=2, C=3, D=5\nif A+B == C+D: # (1): NO CHANGE\n print(\"Balanced\")\nif A+B > C+D: # (2): NO CHANGE\n print(\"Left\")\nif A+B < C+D: # (3): NO CHANGE\n print(\"Balanced\")\n"], "anno_status": [true], "diff_content": " A, B, C, D = map(int, input().split())\n if A+B == C+D:\n print(\"Balanced\")\n if A+B > C+D:\n print(\"Left\")\n if A+B < C+D:\n- print(\"Balanced\")\n+ print(\"Right\")\n \n", "FL_content": " A, B, C, D = map(int, input().split())\n if A+B == C+D:\n print(\"Balanced\")\n if A+B > C+D:\n print(\"Left\")\n if A+B < C+D:\n- print(\"Balanced\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u891635666", "problem_id": "p03477", "submission1_id": "s216747980", "submission2_id": "s414145526", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nif a + b > c + d:\n print('Left')\nelif a + b < c + d:\n print(\"Right\")\nelse:\n print(\"Right\")", "code2": "a, b, c, d = map(int, input().split())\nif a + b > c + d:\n print('Left')\nelif a + b < c + d:\n print(\"Right\")\nelse:\n print(\"Balanced\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566744363", "date2": "1566744392", "bleu_score": "0.9336205348670612", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 99, "total_score": 103, "input": "8 3 8 3\n", "actual_output": "Right\n", "expected_output": "Balanced\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=8, b=3, c=8, d=3\nif a + b > c + d: # (1): NO CHANGE\n print('Left')\nelif a + b < c + d: # (2): NO CHANGE\n print(\"Right\")\nelse:\n print(\"Right\")"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n if a + b > c + d:\n print('Left')\n elif a + b < c + d:\n print(\"Right\")\n else:\n- print(\"Right\")\n+ print(\"Balanced\")\n", "FL_content": " a, b, c, d = map(int, input().split())\n if a + b > c + d:\n print('Left')\n elif a + b < c + d:\n print(\"Right\")\n else:\n- print(\"Right\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u377989038", "problem_id": "p03477", "submission1_id": "s453804547", "submission2_id": "s200940628", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nif a + b == c + d:\n print(\"Balance\")\nelif a + b < c + d:\n print(\"Right\")\nelse:\n print(\"Left\")\n", "code2": "a, b, c, d = map(int, input().split())\nif a + b == c + d:\n print(\"Balanced\")\nelif a + b < c + d:\n print(\"Right\")\nelse:\n print(\"Left\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561020305", "date2": "1561020367", "bleu_score": "0.9822356917739209", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 99, "total_score": 103, "input": "0 8 7 1\n", "actual_output": "Balance\n", "expected_output": "Balanced\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=0, b=8, c=7, d=1\nif a + b == c + d: # (1): NO CHANGE\n print(\"Balance\")\nelif a + b < c + d:\n print(\"Right\")\nelse:\n print(\"Left\")\n"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n if a + b == c + d:\n- print(\"Balance\")\n+ print(\"Balanced\")\n elif a + b < c + d:\n print(\"Right\")\n else:\n print(\"Left\")\n \n", "FL_content": " a, b, c, d = map(int, input().split())\n if a + b == c + d:\n- print(\"Balance\")\n elif a + b < c + d:\n print(\"Right\")\n else:\n print(\"Left\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u214434454", "problem_id": "p03477", "submission1_id": "s963705782", "submission2_id": "s300604893", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nif a + b > c + d:\n print(\"left\")\nelif a + b == c + d:\n print(\"Balanced\")\nelse:\n print(\"Right\")", "code2": "a, b, c, d = map(int, input().split())\nif a + b > c + d:\n print(\"Left\")\nelif a + b == c + d:\n print(\"Balanced\")\nelse:\n print(\"Right\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566962112", "date2": "1566962150", "bleu_score": "0.9821085431604635", "code1_test_status": [1, 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, 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, 1], "code1_test_score": 68, "total_score": 103, "input": "2 5 0 1\n", "actual_output": "left\n", "expected_output": "Left\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=2, b=5, c=0, d=1\nif a + b > c + d: # (1): NO CHANGE\n print(\"left\")\nelif a + b == c + d:\n print(\"Balanced\")\nelse:\n print(\"Right\")"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n if a + b > c + d:\n- print(\"left\")\n+ print(\"Left\")\n elif a + b == c + d:\n print(\"Balanced\")\n else:\n print(\"Right\")\n", "FL_content": " a, b, c, d = map(int, input().split())\n if a + b > c + d:\n- print(\"left\")\n elif a + b == c + d:\n print(\"Balanced\")\n else:\n print(\"Right\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u143903328", "problem_id": "p03477", "submission1_id": "s450175746", "submission2_id": "s952627434", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int,input().split())\nif a + b > c + d:\n print('Left')\nelif a + b < c + d:\n print('Balanced')\nelse:\n print('Right')", "code2": "a, b, c, d = map(int,input().split())\nif a + b > c + d:\n print('Left')\nelif a + b < c + d:\n print('Right')\nelse:\n print('Balanced')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566751946", "date2": "1566751984", "bleu_score": "0.9981701661679876", "code1_test_status": [0, 0, 1, 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, 0, 1, 0, 0, 1, 1, 0, 0], "code1_test_score": 35, "total_score": 103, "input": "12 6 33 2\n", "actual_output": "Balanced\n", "expected_output": "Right\n\n", "anno_code": ["a, b, c, d = map(int,input().split()) # (0): a=12, b=6, c=33, d=2\nif a + b > c + d: # (1): NO CHANGE\n print('Left')\nelif a + b < c + d: # (2): NO CHANGE\n print('Balanced')\nelse:\n print('Right')"], "anno_status": [true], "diff_content": " a, b, c, d = map(int,input().split())\n if a + b > c + d:\n print('Left')\n elif a + b < c + d:\n- print('Balanced')\n-else:\n print('Right')\n+else:\n+ print('Balanced')\n", "FL_content": " a, b, c, d = map(int,input().split())\n if a + b > c + d:\n print('Left')\n elif a + b < c + d:\n- print('Balanced')\n-else:\n print('Right')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u278379520", "problem_id": "p03477", "submission1_id": "s334659691", "submission2_id": "s472344162", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d=map(int,input().split())\nif a+bc+d:\n print('Left')\nelse:\n ('Balanced')\n", "code2": "a,b,c,d=map(int,input().split())\nif a+bc+d: # (2): NO CHANGE\n print('Left')\nelse:\n ('Balanced')\n"], "anno_status": [true], "diff_content": " a,b,c,d=map(int,input().split())\n if a+bc+d:\n- print('Left')\n+elif a+b==c+d:\n+ print('Balanced')\n else:\n- ('Balanced')\n+ print('Left')\n \n", "FL_content": " a,b,c,d=map(int,input().split())\n if a+bc+d:\n- print('Left')\n else:\n- ('Balanced')\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u699089116", "problem_id": "p03477", "submission1_id": "s920372011", "submission2_id": "s752027974", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\n\nleft = a + b\nright = c + d\n\nif left == right:\n print(\"Balanced\")\nelif left > right:\n print(\"Left\")\nelse:\n print(\"Rigtht\")", "code2": "a, b, c, d = map(int, input().split())\n \nleft = a + b\nright = c + d\n \nif left == right:\n print(\"Balanced\")\nelif left > right:\n print(\"Left\")\nelse:\n print(\"Right\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591494016", "date2": "1591494076", "bleu_score": "0.9598773431352345", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 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, 1, 1, 0], "code1_test_score": 39, "total_score": 103, "input": "0 1 6 3\n", "actual_output": "Rigtht\n", "expected_output": "Right\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=0, b=1, c=6, d=3\n\nleft = a + b # (1): left=1\nright = c + d # (2): right=9\n\nif left == right: # (3): NO CHANGE\n print(\"Balanced\")\nelif left > right: # (4): NO CHANGE\n print(\"Left\")\nelse:\n print(\"Rigtht\")"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n-\n+ \n left = a + b\n right = c + d\n-\n+ \n if left == right:\n print(\"Balanced\")\n elif left > right:\n print(\"Left\")\n else:\n- print(\"Rigtht\")\n+ print(\"Right\")\n", "FL_content": " a, b, c, d = map(int, input().split())\n-\n left = a + b\n right = c + d\n-\n if left == right:\n print(\"Balanced\")\n elif left > right:\n print(\"Left\")\n else:\n- print(\"Rigtht\")\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u072717685", "problem_id": "p03477", "submission1_id": "s902664120", "submission2_id": "s408657575", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C, D = map(int, input().split())\n \nif A + B == C + D:\n r = 'Balanced'\nif A + B > C + D:\n r = 'Left'\nelse:\n r = 'Right'\nprint(r)", "code2": "A, B, C, D = map(int, input().split())\n \nif (A + B) == (C + D):\n r = 'Balanced'\nelif (A + B) > (C + D):\n r = 'Left'\nelif (A + B) < (C + D):\n r = 'Right'\nprint(r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578860360", "date2": "1578860720", "bleu_score": "0.720446081107064", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 99, "total_score": 103, "input": "3 4 5 2\n", "actual_output": "Right\n", "expected_output": "Balanced\n", "anno_code": ["A, B, C, D = map(int, input().split()) # (0): A=3, B=4, C=5, D=2\n \nif A + B == C + D: # (1): NO CHANGE\n r = 'Balanced' # (2): r=Balanced\nif A + B > C + D: # (3): NO CHANGE\n r = 'Left'\nelse:\n r = 'Right' # (4): r=Right\nprint(r)"], "anno_status": [true], "diff_content": " A, B, C, D = map(int, input().split())\n \n-if A + B == C + D:\n+if (A + B) == (C + D):\n r = 'Balanced'\n-if A + B > C + D:\n+elif (A + B) > (C + D):\n r = 'Left'\n-else:\n+elif (A + B) < (C + D):\n r = 'Right'\n print(r)\n", "FL_content": " A, B, C, D = map(int, input().split())\n \n-if A + B == C + D:\n r = 'Balanced'\n-if A + B > C + D:\n r = 'Left'\n-else:\n r = 'Right'\n print(r)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u004025573", "problem_id": "p03477", "submission1_id": "s386249722", "submission2_id": "s070133734", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C,D = map(int,input().split())\n\nr=A+B\nl=C+D\n\nif r>l:\n print(\"Right\")\nelif l>r:\n print(\"Left\")\nelse:\n print(\"Balanced\")", "code2": "A,B,C,D = map(int,input().split())\n\nl=A+B\nr=C+D\n\nif r>l:\n print(\"Right\")\nelif l>r:\n print(\"Left\")\nelse:\n print(\"Balanced\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529605397", "date2": "1529605438", "bleu_score": "0.9762766332237903", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 103, "input": "2 25 3 1\n", "actual_output": "Right\n", "expected_output": "Left\n\n", "anno_code": ["A,B,C,D = map(int,input().split()) # (0): A=2, B=25, C=3, D=1\n\nr=A+B # (1): r=27\nl=C+D # (2): l=4\n\nif r>l: # (3): NO CHANGE\n print(\"Right\")\nelif l>r:\n print(\"Left\")\nelse:\n print(\"Balanced\")"], "anno_status": [true], "diff_content": " A,B,C,D = map(int,input().split())\n \n-r=A+B\n-l=C+D\n+l=A+B\n+r=C+D\n \n if r>l:\n print(\"Right\")\n elif l>r:\n print(\"Left\")\n else:\n print(\"Balanced\")\n", "FL_content": " A,B,C,D = map(int,input().split())\n \n-r=A+B\n-l=C+D\n \n if r>l:\n print(\"Right\")\n elif l>r:\n print(\"Left\")\n else:\n print(\"Balanced\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u278670845", "problem_id": "p03477", "submission1_id": "s648565644", "submission2_id": "s960266031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = map(int, input().split())\nif a+b < c+d:\n print(\"Left\")\nelif a+b == c+d:\n print(\"Balanced\")\nelse:\n print(\"Right\")", "code2": "a,b,c,d = map(int, input().split())\nif a+b > c+d:\n print(\"Left\")\nelif a+b == c+d:\n print(\"Balanced\")\nelse:\n print(\"Right\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574287632", "date2": "1574287675", "bleu_score": "0.979629900343721", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 103, "input": "2 2 33 1\n", "actual_output": "Left\n", "expected_output": "Right\n\n", "anno_code": ["a,b,c,d = map(int, input().split()) # (0): a=2, b=2, c=33, d=1\nif a+b < c+d: # (1): NO CHANGE\n print(\"Left\")\nelif a+b == c+d:\n print(\"Balanced\")\nelse:\n print(\"Right\")"], "anno_status": [true], "diff_content": " a,b,c,d = map(int, input().split())\n-if a+b < c+d:\n+if a+b > c+d:\n print(\"Left\")\n elif a+b == c+d:\n print(\"Balanced\")\n else:\n print(\"Right\")\n", "FL_content": " a,b,c,d = map(int, input().split())\n-if a+b < c+d:\n print(\"Left\")\n elif a+b == c+d:\n print(\"Balanced\")\n else:\n print(\"Right\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u034855798", "problem_id": "p03477", "submission1_id": "s364785093", "submission2_id": "s111584530", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nA,B,C,D = map(int,input().split())\n\n\n\n\n\nif A+B>=C+D:\n print(\"Left\")\nif A+B==C+D:\n print(\"Balanced\")\nelse:\n print(\"Right\")", "code2": "\n\n\n\n\nA,B,C,D = map(int,input().split())\n\n\n\n\n\nif A+B>C+D:\n print(\"Left\")\nelif A+B==C+D:\n print(\"Balanced\")\nelse:\n print(\"Right\")", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1599689264", "date2": "1599689346", "bleu_score": "0.9625354647617577", "code1_test_status": [0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 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, 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, 0, 1], "code1_test_score": 64, "total_score": 103, "input": "2 3 0 0\n", "actual_output": "Left\nRight\n", "expected_output": "Left\n\n", "anno_code": ["\n\n\n\n\nA,B,C,D = map(int,input().split()) # (0): A=2, B=3, C=0, D=0\n\n\n\n\n\nif A+B>=C+D: # (1): NO CHANGE\n print(\"Left\") # (2): NO CHANGE\nif A+B==C+D: # (3): NO CHANGE\n print(\"Balanced\")\nelse:\n print(\"Right\")"], "anno_status": [true], "diff_content": " \n \n \n \n \n A,B,C,D = map(int,input().split())\n \n \n \n \n \n-if A+B>=C+D:\n+if A+B>C+D:\n print(\"Left\")\n-if A+B==C+D:\n+elif A+B==C+D:\n print(\"Balanced\")\n else:\n print(\"Right\")\n", "FL_content": " \n \n \n \n \n A,B,C,D = map(int,input().split())\n \n \n \n \n \n-if A+B>=C+D:\n print(\"Left\")\n-if A+B==C+D:\n print(\"Balanced\")\n else:\n print(\"Right\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u625963200", "problem_id": "p03477", "submission1_id": "s169321676", "submission2_id": "s263841304", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\na,b,c,d=map(str,input().split())\n\nl=a+b\nr=c+d\nif l==r:\n print('Balanced')\nelif l>r:\n print('Right')\nelse:\n print('Left')", "code2": "import sys\ninput = sys.stdin.readline\na,b,c,d=map(int,input().split())\n\nl=a+b\nr=c+d\nif l==r:\n print('Balanced')\nelif l>r:\n print('Left')\nelse:\n print('Right')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567055989", "date2": "1567056114", "bleu_score": "0.9732434518087933", "code1_test_status": [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, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 34, "total_score": 103, "input": "-6 2 1 1\n", "actual_output": "Left\n", "expected_output": "Right\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\na,b,c,d=map(str,input().split()) # (1): a=-6, b=2, c=1, d=1\n\nl=a+b # (2): l=-62\nr=c+d # (3): r=11\nif l==r: # (4): NO CHANGE\n print('Balanced')\nelif l>r: # (5): NO CHANGE\n print('Right')\nelse:\n print('Left')"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n-a,b,c,d=map(str,input().split())\n+a,b,c,d=map(int,input().split())\n \n l=a+b\n r=c+d\n if l==r:\n print('Balanced')\n elif l>r:\n- print('Right')\n-else:\n print('Left')\n+else:\n+ print('Right')\n", "FL_content": " import sys\n input = sys.stdin.readline\n-a,b,c,d=map(str,input().split())\n \n l=a+b\n r=c+d\n if l==r:\n print('Balanced')\n elif l>r:\n- print('Right')\n-else:\n print('Left')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u705038083", "problem_id": "p03477", "submission1_id": "s644566964", "submission2_id": "s196001315", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nslist = s.split(\" \")\n\nleft = int(slist[0]) + int(slist[1])\n\nright = int(slist[2]) + int(slist[3])\n\nif left > right:\n print(\"left\")\n\t\nelif left == right:\n print(\"Balanced\")\n\t\nelse:\n print(\"right\")\n", "code2": "s = input()\n\nslist = s.split(\" \")\n\nleft = int(slist[0]) + int(slist[1])\n\nright = int(slist[2]) + int(slist[3])\n\nif left > right:\n\tprint(\"Left\")\n\t\nelif left == right:\n\tprint(\"Balanced\")\n\t\nelse:\n\tprint(\"Right\")\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514088975", "date2": "1514089058", "bleu_score": "0.899773121699594", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 4, "total_score": 103, "input": "0 34 1 1\n", "actual_output": "left\n", "expected_output": "Left\n\n", "anno_code": ["s = input() # (0): s=0 34 1 1\n\nslist = s.split(\" \") # (1): slist=['0', '34', '1', '1']\n\nleft = int(slist[0]) + int(slist[1]) # (2): left=34\n\nright = int(slist[2]) + int(slist[3]) # (3): right=2\n\nif left > right: # (4): NO CHANGE\n print(\"left\")\n\t\nelif left == right:\n print(\"Balanced\")\n\t\nelse:\n print(\"right\")\n"], "anno_status": [true], "diff_content": " s = input()\n \n slist = s.split(\" \")\n \n left = int(slist[0]) + int(slist[1])\n \n right = int(slist[2]) + int(slist[3])\n \n if left > right:\n- print(\"left\")\n+\tprint(\"Left\")\n \t\n elif left == right:\n- print(\"Balanced\")\n+\tprint(\"Balanced\")\n \t\n else:\n- print(\"right\")\n+\tprint(\"Right\")\n+\n \n", "FL_content": " s = input()\n \n slist = s.split(\" \")\n \n left = int(slist[0]) + int(slist[1])\n \n right = int(slist[2]) + int(slist[3])\n \n if left > right:\n- print(\"left\")\n \t\n elif left == right:\n- print(\"Balanced\")\n \t\n else:\n- print(\"right\")\n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u391589398", "problem_id": "p03477", "submission1_id": "s117097526", "submission2_id": "s471148974", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c, d = map(int, input().split())\nif a+b > c+d:\n print('Left')\nelif a+b < c+d:\n print('right')\nelse:\n print('Balanced')\n", "code2": "a, b, c, d = map(int, input().split())\nif a+b > c+d:\n print('Left')\nelif a+b < c+d:\n print('Right')\nelse:\n print('Balanced')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591755004", "date2": "1591755030", "bleu_score": "0.9810218387623372", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 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, 1, 1, 0], "code1_test_score": 39, "total_score": 103, "input": "12 6 33 2\n", "actual_output": "right\n", "expected_output": "Right\n\n", "anno_code": ["a, b, c, d = map(int, input().split()) # (0): a=12, b=6, c=33, d=2\nif a+b > c+d: # (1): NO CHANGE\n print('Left')\nelif a+b < c+d: # (2): NO CHANGE\n print('right')\nelse:\n print('Balanced')\n"], "anno_status": [true], "diff_content": " a, b, c, d = map(int, input().split())\n if a+b > c+d:\n print('Left')\n elif a+b < c+d:\n- print('right')\n+ print('Right')\n else:\n print('Balanced')\n \n", "FL_content": " a, b, c, d = map(int, input().split())\n if a+b > c+d:\n print('Left')\n elif a+b < c+d:\n- print('right')\n else:\n print('Balanced')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u940061594", "problem_id": "p02727", "submission1_id": "s269300334", "submission2_id": "s938740821", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nX, Y, A, B, C = map(int,input().split())\np0 = list(map(int,input().split()))\nq0 = list(map(int,input().split()))\nr0 = list(map(int,input().split()))\np = sorted(p0, reverse = True); p.append(0)\nq = sorted(q0, reverse = True); q.append(0)\nr = sorted(r0, reverse = True); r.append(0)\n\nhappy = 0\ni = 0\nj = 0\nk = 0\nred = 0\ngreen = 0\nwhite = 0\n\nfor _ in range(X+Y):\n if r[k] >= p[i] and r[k] >= q[j]:\n happy += r[k]\n white += 1\n k += 1\n elif p[i] > q[j]:\n if red != X:\n happy += p[i]\n red += 1\n i += 1\n elif q[j] >= r[k] and green != Y:\n happy += q[j]\n green += 1\n j += 1\n elif p[i] <= q[j]:\n if green != Y:\n happy += q[j]\n green += 1\n j += 1\n elif p[i] >= r[k] and red != X:\n happy += p[i]\n red += 1\n i += 1\n \nprint(happy)", "code2": "\nX, Y, A, B, C = map(int,input().split())\np0 = list(map(int,input().split()))\nq0 = list(map(int,input().split()))\nr0 = list(map(int,input().split()))\np = sorted(p0, reverse = True); p.append(0)\nq = sorted(q0, reverse = True); q.append(0)\nr = sorted(r0, reverse = True); r.append(0)\n\nhappy = 0\ni = 0\nj = 0\nk = 0\nred = 0\ngreen = 0\nwhite = 0\n\nfor _ in range(X+Y):\n if max(p[i], q[j], r[k]) == r[k]:\n happy += r[k]\n white += 1\n k += 1\n elif max(p[i], q[j], r[k]) == p[i]:\n if red < X:\n happy += p[i]\n red += 1\n i += 1\n elif q[j] >r[k] and green < Y:\n happy += q[j]\n green += 1\n j += 1\n else:\n happy += r[k]\n white += 1\n k += 1\n else:\n if green < Y:\n happy += q[j]\n green += 1\n j += 1\n elif p[i] >r[k] and red < X:\n happy += p[i]\n red += 1\n i += 1\n else:\n happy += r[k]\n white += 1\n k += 1\n \nprint(happy)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585446798", "date2": "1585448113", "bleu_score": "0.807972731137795", "code1_test_status": [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "2 0 -2 0 6\n28 -2\n9 -1\n2 -1\n", "actual_output": "28\n", "expected_output": "30\n\n", "anno_code": ["\nX, Y, A, B, C = map(int,input().split()) # (0): X=2, Y=0, A=-2, B=0, C=6\np0 = list(map(int,input().split())) # (1): p0=[28, -2]\nq0 = list(map(int,input().split())) # (2): q0=[9, -1]\nr0 = list(map(int,input().split())) # (3): r0=[2, -1]\np = sorted(p0, reverse = True); p.append(0) # (4): p=[28, -2, 0]\nq = sorted(q0, reverse = True); q.append(0) # (5): q=[9, -1, 0]\nr = sorted(r0, reverse = True); r.append(0) # (6): r=[2, -1, 0]\n\nhappy = 0 # (7): happy=0\ni = 0 # (8): i=0\nj = 0 # (9): j=0\nk = 0 # (10): k=0\nred = 0 # (11): red=0\ngreen = 0 # (12): green=0\nwhite = 0 # (13): white=0\n\nfor _ in range(X+Y): # (14): _=0 (21): _=1 (27): NO CHANGE\n if r[k] >= p[i] and r[k] >= q[j]: # (15): NO CHANGE (22): NO CHANGE\n happy += r[k]\n white += 1\n k += 1\n elif p[i] > q[j]: # (16): NO CHANGE (23): NO CHANGE\n if red != X: # (17): NO CHANGE\n happy += p[i] # (18): happy=28\n red += 1 # (19): red=1\n i += 1 # (20): i=1\n elif q[j] >= r[k] and green != Y:\n happy += q[j]\n green += 1\n j += 1\n elif p[i] <= q[j]: # (24): NO CHANGE\n if green != Y: # (25): NO CHANGE\n happy += q[j]\n green += 1\n j += 1\n elif p[i] >= r[k] and red != X: # (26): NO CHANGE\n happy += p[i]\n red += 1\n i += 1\n \nprint(happy)"], "anno_status": [true], "diff_content": " \n X, Y, A, B, C = map(int,input().split())\n p0 = list(map(int,input().split()))\n q0 = list(map(int,input().split()))\n r0 = list(map(int,input().split()))\n p = sorted(p0, reverse = True); p.append(0)\n q = sorted(q0, reverse = True); q.append(0)\n r = sorted(r0, reverse = True); r.append(0)\n \n happy = 0\n i = 0\n j = 0\n k = 0\n red = 0\n green = 0\n white = 0\n \n for _ in range(X+Y):\n- if r[k] >= p[i] and r[k] >= q[j]:\n+ if max(p[i], q[j], r[k]) == r[k]:\n happy += r[k]\n white += 1\n k += 1\n- elif p[i] > q[j]:\n- if red != X:\n+ elif max(p[i], q[j], r[k]) == p[i]:\n+ if red < X:\n happy += p[i]\n red += 1\n i += 1\n- elif q[j] >= r[k] and green != Y:\n+ elif q[j] >r[k] and green < Y:\n happy += q[j]\n green += 1\n j += 1\n- elif p[i] <= q[j]:\n- if green != Y:\n+ else:\n+ happy += r[k]\n+ white += 1\n+ k += 1\n+ else:\n+ if green < Y:\n happy += q[j]\n green += 1\n j += 1\n- elif p[i] >= r[k] and red != X:\n+ elif p[i] >r[k] and red < X:\n happy += p[i]\n red += 1\n i += 1\n+ else:\n+ happy += r[k]\n+ white += 1\n+ k += 1\n \n print(happy)\n", "FL_content": " \n X, Y, A, B, C = map(int,input().split())\n p0 = list(map(int,input().split()))\n q0 = list(map(int,input().split()))\n r0 = list(map(int,input().split()))\n p = sorted(p0, reverse = True); p.append(0)\n q = sorted(q0, reverse = True); q.append(0)\n r = sorted(r0, reverse = True); r.append(0)\n \n happy = 0\n i = 0\n j = 0\n k = 0\n red = 0\n green = 0\n white = 0\n \n for _ in range(X+Y):\n- if r[k] >= p[i] and r[k] >= q[j]:\n happy += r[k]\n white += 1\n k += 1\n- elif p[i] > q[j]:\n- if red != X:\n happy += p[i]\n red += 1\n i += 1\n- elif q[j] >= r[k] and green != Y:\n happy += q[j]\n green += 1\n j += 1\n- elif p[i] <= q[j]:\n- if green != Y:\n happy += q[j]\n green += 1\n j += 1\n- elif p[i] >= r[k] and red != X:\n happy += p[i]\n red += 1\n i += 1\n \n print(happy)\n", "added_lines": 15, "removed_lines": 7, "code1_lines": 42 }, { "user_id": "u560867850", "problem_id": "p02727", "submission1_id": "s063436811", "submission2_id": "s383223881", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nfrom itertools import chain\n\ndef readlines(*abc):\n for n in abc:\n yield list(map(int, input().split()))[:n]\n\ndef main():\n x, y, a, b, c = map(int, input().split())\n apples = sorted(chain(*readlines(a,b,c)), reverse=True)\n print(sum(apples[:x+y]))\n\n\nmain()\n\n\n", "code2": "import sys\ninput = sys.stdin.readline\nfrom itertools import chain\n\ndef readlines(*xy):\n for n in xy:\n yield sorted(map(int, input().split()), reverse=True)[:n]\n\ndef main():\n x, y, a, b, c = map(int, input().split())\n apples = sorted(chain(*readlines(x,y,c)), reverse=True)\n print(sum(apples[:x+y]))\n\n\nmain()\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585606725", "date2": "1585607040", "bleu_score": "0.8966401842043775", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 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, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 25, "total_score": 103, "input": "1 0 0 0 3\n8 2\n9 1\n2 1\n", "actual_output": "2\n", "expected_output": "8\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, chain=\nfrom itertools import chain\n\ndef readlines(*abc): # (1): readlines=\n for n in abc: # (6): n=0 (8): NO CHANGE ... (12): x=1, y=0, a=0, b=0, c=3, apples=[2, 1]\n yield list(map(int, input().split()))[:n] # (7): NO CHANGE (9): NO CHANGE (11): NO CHANGE\n\ndef main(): # (2): main=\n x, y, a, b, c = map(int, input().split()) # (4): x=1, y=0, a=0, b=0, c=3\n apples = sorted(chain(*readlines(a,b,c)), reverse=True) # (5): abc=(0, 0, 3)\n print(sum(apples[:x+y]))\n\n\nmain() # (3): NO CHANGE\n\n\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n from itertools import chain\n \n-def readlines(*abc):\n- for n in abc:\n- yield list(map(int, input().split()))[:n]\n+def readlines(*xy):\n+ for n in xy:\n+ yield sorted(map(int, input().split()), reverse=True)[:n]\n \n def main():\n x, y, a, b, c = map(int, input().split())\n- apples = sorted(chain(*readlines(a,b,c)), reverse=True)\n+ apples = sorted(chain(*readlines(x,y,c)), reverse=True)\n print(sum(apples[:x+y]))\n \n \n main()\n \n \n \n", "FL_content": " import sys\n input = sys.stdin.readline\n from itertools import chain\n \n-def readlines(*abc):\n- for n in abc:\n- yield list(map(int, input().split()))[:n]\n \n def main():\n x, y, a, b, c = map(int, input().split())\n- apples = sorted(chain(*readlines(a,b,c)), reverse=True)\n print(sum(apples[:x+y]))\n \n \n main()\n \n \n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 18 }, { "user_id": "u328099989", "problem_id": "p02727", "submission1_id": "s538703262", "submission2_id": "s795048328", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y, A, B, C = map(int, input().split())\nP = list(map(int, input().split()))\nQ = list(map(int, input().split()))\nR = list(map(int, input().split()))\n\nP = sorted(P, reverse=True)[:X]\nQ = sorted(P, reverse=True)[:Y]\nR = sorted(P, reverse=True)[:X+Y]\n\nprint(sum(sorted(P+Q+R, reverse=True)[:X+Y]))\n", "code2": "X, Y, A, B, C = map(int, input().split())\nP = list(map(int, input().split()))\nQ = list(map(int, input().split()))\nR = list(map(int, input().split()))\n\nP = sorted(P, reverse=True)[:X]\nQ = sorted(Q, reverse=True)[:Y]\nR = sorted(R, reverse=True)[:X+Y]\n\nprint(sum(sorted(P+Q+R, reverse=True)[:X+Y]))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586915508", "date2": "1586915574", "bleu_score": "0.9829631733898508", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 14, "total_score": 103, "input": "2 2 1 4 4\n11 12 13 21\n21 20 8 24\n1 2 3 4\n", "actual_output": "76\n", "expected_output": "79\n\n", "anno_code": ["X, Y, A, B, C = map(int, input().split()) # (0): X=2, Y=2, A=1, B=4, C=4\nP = list(map(int, input().split())) # (1): P=[11, 12, 13, 21]\nQ = list(map(int, input().split())) # (2): Q=[21, 20, 8, 24]\nR = list(map(int, input().split())) # (3): R=[1, 2, 3, 4]\n\nP = sorted(P, reverse=True)[:X] # (4): P=[21, 13]\nQ = sorted(P, reverse=True)[:Y] # (5): Q=[21, 13]\nR = sorted(P, reverse=True)[:X+Y] # (6): R=[21, 13]\n\nprint(sum(sorted(P+Q+R, reverse=True)[:X+Y]))\n"], "anno_status": [true], "diff_content": " X, Y, A, B, C = map(int, input().split())\n P = list(map(int, input().split()))\n Q = list(map(int, input().split()))\n R = list(map(int, input().split()))\n \n P = sorted(P, reverse=True)[:X]\n-Q = sorted(P, reverse=True)[:Y]\n-R = sorted(P, reverse=True)[:X+Y]\n+Q = sorted(Q, reverse=True)[:Y]\n+R = sorted(R, reverse=True)[:X+Y]\n \n print(sum(sorted(P+Q+R, reverse=True)[:X+Y]))\n \n", "FL_content": " X, Y, A, B, C = map(int, input().split())\n P = list(map(int, input().split()))\n Q = list(map(int, input().split()))\n R = list(map(int, input().split()))\n \n P = sorted(P, reverse=True)[:X]\n-Q = sorted(P, reverse=True)[:Y]\n-R = sorted(P, reverse=True)[:X+Y]\n \n print(sum(sorted(P+Q+R, reverse=True)[:X+Y]))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u047023156", "problem_id": "p02727", "submission1_id": "s508216069", "submission2_id": "s695468022", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom collections import Counter\ninput = sys.stdin.readline\n\nX, Y, A, B, C = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\np.sort()\nq.sort()\nr.sort()\n\nif A > X:\n p = p[-X:]\nif B > Y:\n q = q[-X:]\n\np.extend(q)\np.extend(r)\n\np.sort()\n\nprint(sum(p[-(X+Y):]))", "code2": "import sys\nfrom collections import Counter\ninput = sys.stdin.readline\n\nX, Y, A, B, C = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\nans = []\n\nans.extend(sorted(p, reverse=True)[:X])\nans.extend(sorted(q, reverse=True)[:Y])\nans.extend(r)\nans.sort(reverse=True)\n\nprint(sum(ans[:X+Y]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585451585", "date2": "1585451995", "bleu_score": "0.7329343324478186", "code1_test_status": [1, 1, 1, 1, 0, 0, 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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 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, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 103, "input": "2 0 4 4 4\n11 15 13 14\n21 22 23 22\n1 4 3 4\n", "actual_output": "45\n", "expected_output": "29\n\n", "anno_code": ["import sys\nfrom collections import Counter\ninput = sys.stdin.readline # (0): input=\n\nX, Y, A, B, C = map(int, input().split()) # (1): X=2, Y=0, A=4, B=4, C=4\np = list(map(int, input().split())) # (2): p=[11, 15, 13, 14]\nq = list(map(int, input().split())) # (3): q=[21, 22, 23, 22]\nr = list(map(int, input().split())) # (4): r=[1, 4, 3, 4]\n\np.sort() # (5): p=[11, 13, 14, 15]\nq.sort() # (6): q=[21, 22, 22, 23]\nr.sort() # (7): r=[1, 3, 4, 4]\n\nif A > X: # (8): NO CHANGE\n p = p[-X:] # (9): p=[14, 15]\nif B > Y: # (10): NO CHANGE\n q = q[-X:] # (11): q=[22, 23]\n\np.extend(q) # (12): p=[14, 15, 22, 23]\np.extend(r) # (13): p=[14, 15, 22, 23, 1, 3, 4, 4]\n\np.sort() # (14): p=[1, 3, 4, 4, 14, 15, 22, 23]\n\nprint(sum(p[-(X+Y):]))"], "anno_status": [true], "diff_content": " import sys\n from collections import Counter\n input = sys.stdin.readline\n \n X, Y, A, B, C = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n-p.sort()\n-q.sort()\n-r.sort()\n+ans = []\n \n-if A > X:\n- p = p[-X:]\n-if B > Y:\n- q = q[-X:]\n+ans.extend(sorted(p, reverse=True)[:X])\n+ans.extend(sorted(q, reverse=True)[:Y])\n+ans.extend(r)\n+ans.sort(reverse=True)\n \n-p.extend(q)\n-p.extend(r)\n-\n-p.sort()\n-\n-print(sum(p[-(X+Y):]))\n+print(sum(ans[:X+Y]))\n", "FL_content": " import sys\n from collections import Counter\n input = sys.stdin.readline\n \n X, Y, A, B, C = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n-p.sort()\n-q.sort()\n-r.sort()\n \n-if A > X:\n- p = p[-X:]\n-if B > Y:\n- q = q[-X:]\n \n-p.extend(q)\n-p.extend(r)\n-\n-p.sort()\n-\n-print(sum(p[-(X+Y):]))\n", "added_lines": 6, "removed_lines": 13, "code1_lines": 24 }, { "user_id": "u727407185", "problem_id": "p02727", "submission1_id": "s934850012", "submission2_id": "s368250263", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nx, y, a, b, c = [int(x) for x in input().split()]\np = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\nr = [int(x) for x in input().split()]\np.sort(key=lambda x: -x)\nq.sort(key=lambda x: -x)\nr.sort(key=lambda x: -x)\nri = max(0, x - a) + max(0, y - b)\npi = min(a, x)\nqi = min(b, y)\nwhile ri < len(r) and (0 < pi or 0 < qi):\n if 0 < pi and p[pi - 1] < r[ri] and (qi <= 0 or p[pi - 1] < q[qi - 1]):\n ri += 1\n pi -= 1\n elif 0 < qi and q[qi - 1] < r[ri] and (pi <= 0 or q[qi - 1] < p[pi - 1]):\n ri += 1\n qi -= 1\n else:\n break\nprint(sum(p[:pi]) + sum(q[:qi]) + sum(r[:ri]))\n", "code2": "import sys\nx, y, a, b, c = [int(x) for x in input().split()]\np = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\nr = [int(x) for x in input().split()]\np.sort(key=lambda x: -x)\nq.sort(key=lambda x: -x)\nr.sort(key=lambda x: -x)\nri = 0\npi = x\nqi = y\nwhile ri < len(r) and (0 < pi or 0 < qi):\n if 0 < pi and p[pi - 1] < r[ri] and (qi <= 0 or p[pi - 1] <= q[qi - 1]):\n ri += 1\n pi -= 1\n elif 0 < qi and q[qi - 1] < r[ri] and (pi <= 0 or q[qi - 1] <= p[pi - 1]):\n ri += 1\n qi -= 1\n else:\n break\nprint(sum(p[:pi]) + sum(q[:qi]) + sum(r[:ri]))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585448739", "date2": "1585449554", "bleu_score": "0.915327128070229", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 32, "total_score": 103, "input": "1 2 -1 2 1\n21 0\n9 0\n2 1\n", "actual_output": "33\n", "expected_output": "32\n\n", "anno_code": ["import sys\nx, y, a, b, c = [int(x) for x in input().split()] # (0): x=1, y=2, a=-1, b=2, c=1\np = [int(x) for x in input().split()] # (1): p=[21, 0]\nq = [int(x) for x in input().split()] # (2): q=[9, 0]\nr = [int(x) for x in input().split()] # (3): r=[2, 1]\np.sort(key=lambda x: -x) # (4): NO CHANGE\nq.sort(key=lambda x: -x) # (5): NO CHANGE\nr.sort(key=lambda x: -x) # (6): NO CHANGE\nri = max(0, x - a) + max(0, y - b) # (7): ri=2\npi = min(a, x) # (8): pi=-1\nqi = min(b, y) # (9): qi=2\nwhile ri < len(r) and (0 < pi or 0 < qi): # (10): NO CHANGE\n if 0 < pi and p[pi - 1] < r[ri] and (qi <= 0 or p[pi - 1] < q[qi - 1]):\n ri += 1\n pi -= 1\n elif 0 < qi and q[qi - 1] < r[ri] and (pi <= 0 or q[qi - 1] < p[pi - 1]):\n ri += 1\n qi -= 1\n else:\n break\nprint(sum(p[:pi]) + sum(q[:qi]) + sum(r[:ri]))\n"], "anno_status": [true], "diff_content": " import sys\n x, y, a, b, c = [int(x) for x in input().split()]\n p = [int(x) for x in input().split()]\n q = [int(x) for x in input().split()]\n r = [int(x) for x in input().split()]\n p.sort(key=lambda x: -x)\n q.sort(key=lambda x: -x)\n r.sort(key=lambda x: -x)\n-ri = max(0, x - a) + max(0, y - b)\n-pi = min(a, x)\n-qi = min(b, y)\n+ri = 0\n+pi = x\n+qi = y\n while ri < len(r) and (0 < pi or 0 < qi):\n- if 0 < pi and p[pi - 1] < r[ri] and (qi <= 0 or p[pi - 1] < q[qi - 1]):\n+ if 0 < pi and p[pi - 1] < r[ri] and (qi <= 0 or p[pi - 1] <= q[qi - 1]):\n ri += 1\n pi -= 1\n- elif 0 < qi and q[qi - 1] < r[ri] and (pi <= 0 or q[qi - 1] < p[pi - 1]):\n+ elif 0 < qi and q[qi - 1] < r[ri] and (pi <= 0 or q[qi - 1] <= p[pi - 1]):\n ri += 1\n qi -= 1\n else:\n break\n print(sum(p[:pi]) + sum(q[:qi]) + sum(r[:ri]))\n \n", "FL_content": " import sys\n x, y, a, b, c = [int(x) for x in input().split()]\n p = [int(x) for x in input().split()]\n q = [int(x) for x in input().split()]\n r = [int(x) for x in input().split()]\n p.sort(key=lambda x: -x)\n q.sort(key=lambda x: -x)\n r.sort(key=lambda x: -x)\n-ri = max(0, x - a) + max(0, y - b)\n-pi = min(a, x)\n-qi = min(b, y)\n while ri < len(r) and (0 < pi or 0 < qi):\n- if 0 < pi and p[pi - 1] < r[ri] and (qi <= 0 or p[pi - 1] < q[qi - 1]):\n ri += 1\n pi -= 1\n- elif 0 < qi and q[qi - 1] < r[ri] and (pi <= 0 or q[qi - 1] < p[pi - 1]):\n ri += 1\n qi -= 1\n else:\n break\n print(sum(p[:pi]) + sum(q[:qi]) + sum(r[:ri]))\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 22 }, { "user_id": "u326775883", "problem_id": "p02727", "submission1_id": "s536073074", "submission2_id": "s035064456", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y, a, b, c = [int(i) for i in input().split()]\npa = [int(i) for i in input().split()]\npb = [int(i) for i in input().split()]\npc = [int(i) for i in input().split()]\n\npa = sorted(pa, reverse=True)\npa = pa[:x]\npb = sorted(pb, reverse=True)\npb = pb[:y]\npc = sorted(pc, reverse=True)\n\nl = pa + pb\nl = sorted(l, reverse=True)\n\nfor i in range(len(pc)):\n for j in range(len(l)):\n if pc[i] > l[j]:\n l[j] = pc[i]\n if j == len(l)-1:\n break\n \nprint(sum(l))\n ", "code2": "x, y, a, b, c = [int(i) for i in input().split()]\npa = [int(i) for i in input().split()]\npb = [int(i) for i in input().split()]\npc = [int(i) for i in input().split()]\n\npa = sorted(pa, reverse=True)\npa = pa[:x]\npb = sorted(pb, reverse=True)\npb = pb[:y]\npc = sorted(pc, reverse=True)\n\nl = pa + pb + pc\nl = sorted(l, reverse=True)\nl = l[:int(x+y)]\nprint(sum(l))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585448163", "date2": "1585584797", "bleu_score": "0.7001321623462401", "code1_test_status": [1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "2 2 2 2 3\n8 1\n9 1\n2 1\n", "actual_output": "21\n", "expected_output": "20\n\n", "anno_code": ["x, y, a, b, c = [int(i) for i in input().split()] # (0): x=2, y=2, a=2, b=2, c=3\npa = [int(i) for i in input().split()] # (1): pa=[8, 1]\npb = [int(i) for i in input().split()] # (2): pb=[9, 1]\npc = [int(i) for i in input().split()] # (3): pc=[2, 1]\n\npa = sorted(pa, reverse=True) # (4): NO CHANGE\npa = pa[:x] # (5): NO CHANGE\npb = sorted(pb, reverse=True) # (6): NO CHANGE\npb = pb[:y] # (7): NO CHANGE\npc = sorted(pc, reverse=True) # (8): NO CHANGE\n\nl = pa + pb # (9): l=[8, 1, 9, 1]\nl = sorted(l, reverse=True) # (10): l=[9, 8, 1, 1]\n\nfor i in range(len(pc)): # (11): i=0\n for j in range(len(l)): # (12): j=0 (14): j=1 ... (22): NO CHANGE\n if pc[i] > l[j]: # (13): NO CHANGE (15): NO CHANGE ... (20): NO CHANGE\n l[j] = pc[i] # (18): l=[9, 8, 2, 1] (21): l=[9, 8, 2, 2]\n if j == len(l)-1: # (23): NO CHANGE\n break # (24): NO CHANGE\n \nprint(sum(l))\n "], "anno_status": [true], "diff_content": " x, y, a, b, c = [int(i) for i in input().split()]\n pa = [int(i) for i in input().split()]\n pb = [int(i) for i in input().split()]\n pc = [int(i) for i in input().split()]\n \n pa = sorted(pa, reverse=True)\n pa = pa[:x]\n pb = sorted(pb, reverse=True)\n pb = pb[:y]\n pc = sorted(pc, reverse=True)\n \n-l = pa + pb\n+l = pa + pb + pc\n l = sorted(l, reverse=True)\n-\n-for i in range(len(pc)):\n- for j in range(len(l)):\n- if pc[i] > l[j]:\n- l[j] = pc[i]\n- if j == len(l)-1:\n- break\n- \n+l = l[:int(x+y)]\n print(sum(l))\n- \n", "FL_content": " x, y, a, b, c = [int(i) for i in input().split()]\n pa = [int(i) for i in input().split()]\n pb = [int(i) for i in input().split()]\n pc = [int(i) for i in input().split()]\n \n pa = sorted(pa, reverse=True)\n pa = pa[:x]\n pb = sorted(pb, reverse=True)\n pb = pb[:y]\n pc = sorted(pc, reverse=True)\n \n-l = pa + pb\n l = sorted(l, reverse=True)\n-\n-for i in range(len(pc)):\n- for j in range(len(l)):\n- if pc[i] > l[j]:\n- l[j] = pc[i]\n- if j == len(l)-1:\n- break\n- \n print(sum(l))\n- \n", "added_lines": 2, "removed_lines": 10, "code1_lines": 23 }, { "user_id": "u105124953", "problem_id": "p02727", "submission1_id": "s276697937", "submission2_id": "s787529209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y,a,b,c = map(int,input().split())\npl = list(map(int,input().split()))\nql = list(map(int,input().split()))\nrl = list(map(int,input().split()))\n\npp = sorted(pl,reverse=True)[:x-1]\nqq = sorted(pl,reverse=True)[:y-1]\nall = pp + qq + rl\nprint(sum(sorted(pl,reverse=True)[:x+y-1]))", "code2": "import heapq\nx,y,a,b,c = map(int,input().split())\npl = list(map(int,input().split()))\nql = list(map(int,input().split()))\nrl = list(map(int,input().split()))\n\npp = sorted(pl,reverse=True)[:x]\nqq = sorted(ql,reverse=True)[:y]\nal = pp + qq + rl\n\nprint(sum(sorted(al,reverse=True)[:x+y]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585449552", "date2": "1585530208", "bleu_score": "0.9130422138461681", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2 4 8 1\n6 3\n1 1\n3\n", "actual_output": "9\n", "expected_output": "13\n\n", "anno_code": ["x,y,a,b,c = map(int,input().split()) # (0): x=2, y=2, a=4, b=8, c=1\npl = list(map(int,input().split())) # (1): pl=[6, 3]\nql = list(map(int,input().split())) # (2): ql=[1, 1]\nrl = list(map(int,input().split())) # (3): rl=[3]\n\npp = sorted(pl,reverse=True)[:x-1] # (4): pp=[6]\nqq = sorted(pl,reverse=True)[:y-1] # (5): qq=[6]\nall = pp + qq + rl # (6): all=[6, 6, 3]\nprint(sum(sorted(pl,reverse=True)[:x+y-1]))"], "anno_status": [true], "diff_content": "+import heapq\n x,y,a,b,c = map(int,input().split())\n pl = list(map(int,input().split()))\n ql = list(map(int,input().split()))\n rl = list(map(int,input().split()))\n \n-pp = sorted(pl,reverse=True)[:x-1]\n-qq = sorted(pl,reverse=True)[:y-1]\n-all = pp + qq + rl\n-print(sum(sorted(pl,reverse=True)[:x+y-1]))\n+pp = sorted(pl,reverse=True)[:x]\n+qq = sorted(ql,reverse=True)[:y]\n+al = pp + qq + rl\n+\n+print(sum(sorted(al,reverse=True)[:x+y]))\n", "FL_content": " x,y,a,b,c = map(int,input().split())\n pl = list(map(int,input().split()))\n ql = list(map(int,input().split()))\n rl = list(map(int,input().split()))\n \n-pp = sorted(pl,reverse=True)[:x-1]\n-qq = sorted(pl,reverse=True)[:y-1]\n-all = pp + qq + rl\n-print(sum(sorted(pl,reverse=True)[:x+y-1]))\n", "added_lines": 6, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u093041722", "problem_id": "p02727", "submission1_id": "s834608265", "submission2_id": "s648615496", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nX,Y,A,B,C = (int(x) for x in input().split())\np = [[int(x), 'r'] for x in input().split()]\nq = [[int(x), 'g'] for x in input().split()]\nr = [[int(x), 'c'] for x in input().split()]\npqr = p + q + r\npqr.sort(reverse=True)\nd = deque(pqr)\nrem = X + Y\npicked = 0\nans = 0\nwhile rem > picked:\n pop = d.popleft()\n if pop[1] == 'r':\n if X > 0:\n X -= 1\n ans += pop[0]\n picked += 1\n elif pop[1] == 'g':\n if Y > 0:\n Y -= 1\n ans += pop[0]\n picked += 1\n else:\n rem -= 1\n ans += pop[0]\n picked += 1\nprint(ans)", "code2": "from collections import deque\nX,Y,A,B,C = (int(x) for x in input().split())\np = [[int(x), 'r'] for x in input().split()]\nq = [[int(x), 'g'] for x in input().split()]\nr = [[int(x), 'c'] for x in input().split()]\npqr = p + q + r\npqr.sort(reverse=True)\nd = deque(pqr)\nrem = X + Y\npickedr = 0\npickedg = 0\npickedc = 0\nans = 0\nif len(d) <= rem:\n print(sum([apple[0] for apple in pqr]))\nelse:\n while pickedr + pickedg + pickedc < rem:\n pop = d.popleft()\n if pop[1] == 'r':\n if pickedr < X:\n ans += pop[0]\n pickedr += 1\n elif pop[1] == 'g':\n if pickedg < Y:\n ans += pop[0]\n pickedg += 1\n else:\n ans += pop[0]\n pickedc += 1\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587235180", "date2": "1587236644", "bleu_score": "0.7737263567494786", "code1_test_status": [1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "1 2 8 4 1\n0 1\n1 1\n3\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["from collections import deque\nX,Y,A,B,C = (int(x) for x in input().split()) # (0): X=1, Y=2, A=8, B=4, C=1\np = [[int(x), 'r'] for x in input().split()] # (1): p\nq = [[int(x), 'g'] for x in input().split()] # (2): q\nr = [[int(x), 'c'] for x in input().split()] # (3): r\npqr = p + q + r # (4): pqr\npqr.sort(reverse=True) # (5): pqr\nd = deque(pqr) # (6): d=deque([[1, 'g'], [1, 'g'], [0, 'r']])\nrem = X + Y # (7): rem=3\npicked = 0 # (8): picked=0\nans = 0 # (9): ans=0\nwhile rem > picked: # (10): NO CHANGE (17): NO CHANGE (24): NO CHANGE\n pop = d.popleft() # (11): pop=[3, 'c'] (18): pop=[1, 'r']\n if pop[1] == 'r': # (12): NO CHANGE (19): NO CHANGE\n if X > 0: # (20): NO CHANGE\n X -= 1 # (21): X=0\n ans += pop[0] # (22): ans=4\n picked += 1 # (23): picked=2\n elif pop[1] == 'g': # (13): NO CHANGE\n if Y > 0:\n Y -= 1\n ans += pop[0]\n picked += 1\n else:\n rem -= 1 # (14): rem=2\n ans += pop[0] # (15): ans=3\n picked += 1 # (16): picked=1\nprint(ans)"], "anno_status": [true], "diff_content": " from collections import deque\n X,Y,A,B,C = (int(x) for x in input().split())\n p = [[int(x), 'r'] for x in input().split()]\n q = [[int(x), 'g'] for x in input().split()]\n r = [[int(x), 'c'] for x in input().split()]\n pqr = p + q + r\n pqr.sort(reverse=True)\n d = deque(pqr)\n rem = X + Y\n-picked = 0\n+pickedr = 0\n+pickedg = 0\n+pickedc = 0\n ans = 0\n-while rem > picked:\n- pop = d.popleft()\n- if pop[1] == 'r':\n- if X > 0:\n- X -= 1\n+if len(d) <= rem:\n+ print(sum([apple[0] for apple in pqr]))\n+else:\n+ while pickedr + pickedg + pickedc < rem:\n+ pop = d.popleft()\n+ if pop[1] == 'r':\n+ if pickedr < X:\n+ ans += pop[0]\n+ pickedr += 1\n+ elif pop[1] == 'g':\n+ if pickedg < Y:\n+ ans += pop[0]\n+ pickedg += 1\n+ else:\n ans += pop[0]\n- picked += 1\n- elif pop[1] == 'g':\n- if Y > 0:\n- Y -= 1\n- ans += pop[0]\n- picked += 1\n- else:\n- rem -= 1\n- ans += pop[0]\n- picked += 1\n-print(ans)\n+ pickedc += 1\n+ print(ans)\n", "FL_content": " from collections import deque\n X,Y,A,B,C = (int(x) for x in input().split())\n p = [[int(x), 'r'] for x in input().split()]\n q = [[int(x), 'g'] for x in input().split()]\n r = [[int(x), 'c'] for x in input().split()]\n pqr = p + q + r\n pqr.sort(reverse=True)\n d = deque(pqr)\n rem = X + Y\n-picked = 0\n ans = 0\n-while rem > picked:\n- pop = d.popleft()\n- if pop[1] == 'r':\n- if X > 0:\n- X -= 1\n ans += pop[0]\n- picked += 1\n- elif pop[1] == 'g':\n- if Y > 0:\n- Y -= 1\n- ans += pop[0]\n- picked += 1\n- else:\n- rem -= 1\n- ans += pop[0]\n- picked += 1\n-print(ans)\n", "added_lines": 19, "removed_lines": 17, "code1_lines": 28 }, { "user_id": "u093041722", "problem_id": "p02727", "submission1_id": "s393716473", "submission2_id": "s648615496", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nX,Y,A,B,C = (int(x) for x in input().split())\np = [[int(x), 'r'] for x in input().split()]\nq = [[int(x), 'g'] for x in input().split()]\nr = [[int(x), 'c'] for x in input().split()]\npqr = p + q + r\npqr.sort(reverse=True)\nd = deque(pqr)\nrem = X + Y\npicked = 0\nans = 0\nif len(d) <= rem:\n print(sum([apple[0] for apple in pqr]))\nelse:\n while rem > picked:\n pop = d.popleft()\n if pop[1] == 'r':\n if X > 0:\n X -= 1\n ans += pop[0]\n picked += 1\n elif pop[1] == 'g':\n if Y > 0:\n Y -= 1\n ans += pop[0]\n picked += 1\n else:\n rem -= 1\n ans += pop[0]\n picked += 1\n print(ans)", "code2": "from collections import deque\nX,Y,A,B,C = (int(x) for x in input().split())\np = [[int(x), 'r'] for x in input().split()]\nq = [[int(x), 'g'] for x in input().split()]\nr = [[int(x), 'c'] for x in input().split()]\npqr = p + q + r\npqr.sort(reverse=True)\nd = deque(pqr)\nrem = X + Y\npickedr = 0\npickedg = 0\npickedc = 0\nans = 0\nif len(d) <= rem:\n print(sum([apple[0] for apple in pqr]))\nelse:\n while pickedr + pickedg + pickedc < rem:\n pop = d.popleft()\n if pop[1] == 'r':\n if pickedr < X:\n ans += pop[0]\n pickedr += 1\n elif pop[1] == 'g':\n if pickedg < Y:\n ans += pop[0]\n pickedg += 1\n else:\n ans += pop[0]\n pickedc += 1\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587235735", "date2": "1587236644", "bleu_score": "0.8900995350805583", "code1_test_status": [1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "1 2 8 4 1\n0 1\n1 1\n3\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["from collections import deque\nX,Y,A,B,C = (int(x) for x in input().split()) # (0): X=1, Y=2, A=8, B=4, C=1\np = [[int(x), 'r'] for x in input().split()] # (1): p\nq = [[int(x), 'g'] for x in input().split()] # (2): q\nr = [[int(x), 'c'] for x in input().split()] # (3): r\npqr = p + q + r # (4): pqr\npqr.sort(reverse=True) # (5): pqr\nd = deque(pqr) # (6): d=deque([[1, 'g'], [1, 'g'], [0, 'r']])\nrem = X + Y # (7): rem=3\npicked = 0 # (8): picked=0\nans = 0 # (9): ans=0\nif len(d) <= rem: # (10): NO CHANGE\n print(sum([apple[0] for apple in pqr]))\nelse:\n while rem > picked: # (11): NO CHANGE (18): NO CHANGE (25): NO CHANGE\n pop = d.popleft() # (12): pop=[3, 'c'] (19): pop=[1, 'r']\n if pop[1] == 'r': # (13): NO CHANGE (20): NO CHANGE\n if X > 0: # (21): NO CHANGE\n X -= 1 # (22): X=0\n ans += pop[0] # (23): ans=4\n picked += 1 # (24): picked=2\n elif pop[1] == 'g': # (14): NO CHANGE\n if Y > 0:\n Y -= 1\n ans += pop[0]\n picked += 1\n else:\n rem -= 1 # (15): rem=2\n ans += pop[0] # (16): ans=3\n picked += 1 # (17): picked=1\n print(ans)"], "anno_status": [true], "diff_content": " from collections import deque\n X,Y,A,B,C = (int(x) for x in input().split())\n p = [[int(x), 'r'] for x in input().split()]\n q = [[int(x), 'g'] for x in input().split()]\n r = [[int(x), 'c'] for x in input().split()]\n pqr = p + q + r\n pqr.sort(reverse=True)\n d = deque(pqr)\n rem = X + Y\n-picked = 0\n+pickedr = 0\n+pickedg = 0\n+pickedc = 0\n ans = 0\n if len(d) <= rem:\n print(sum([apple[0] for apple in pqr]))\n else:\n- while rem > picked:\n+ while pickedr + pickedg + pickedc < rem:\n pop = d.popleft()\n if pop[1] == 'r':\n- if X > 0:\n- X -= 1\n+ if pickedr < X:\n ans += pop[0]\n- picked += 1\n+ pickedr += 1\n elif pop[1] == 'g':\n- if Y > 0:\n- Y -= 1\n+ if pickedg < Y:\n ans += pop[0]\n- picked += 1\n+ pickedg += 1\n else:\n- rem -= 1\n ans += pop[0]\n- picked += 1\n+ pickedc += 1\n print(ans)\n", "FL_content": " from collections import deque\n X,Y,A,B,C = (int(x) for x in input().split())\n p = [[int(x), 'r'] for x in input().split()]\n q = [[int(x), 'g'] for x in input().split()]\n r = [[int(x), 'c'] for x in input().split()]\n pqr = p + q + r\n pqr.sort(reverse=True)\n d = deque(pqr)\n rem = X + Y\n-picked = 0\n ans = 0\n if len(d) <= rem:\n print(sum([apple[0] for apple in pqr]))\n else:\n- while rem > picked:\n pop = d.popleft()\n if pop[1] == 'r':\n- if X > 0:\n- X -= 1\n ans += pop[0]\n- picked += 1\n elif pop[1] == 'g':\n- if Y > 0:\n- Y -= 1\n ans += pop[0]\n- picked += 1\n else:\n- rem -= 1\n ans += pop[0]\n- picked += 1\n print(ans)\n", "added_lines": 9, "removed_lines": 10, "code1_lines": 31 }, { "user_id": "u885634168", "problem_id": "p02727", "submission1_id": "s025358254", "submission2_id": "s385520884", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y, a, b, c = list(map(int,input().split()))\np = list(map(int,input().split()))\nq = list(map(int,input().split()))\nr = list(map(int,input().split()))\ns = sorted(p)[::-1][:X] + sorted(q)[::-1][:X] + r\nans = sum(s[:X + Y])\nprint(ans) ", "code2": "X, Y, a, b, c = list(map(int,input().split()))\np = list(map(int,input().split()))\nq = list(map(int,input().split()))\nr = list(map(int,input().split()))\ns = sorted(p)[::-1][:X] + sorted(q)[::-1][:Y] + r\ns = sorted(s)[::-1]\nans = sum(s[:X + Y])\nprint(ans) ", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597178182", "date2": "1597178316", "bleu_score": "0.9105019791968102", "code1_test_status": [0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1], "code1_test_score": 35, "total_score": 103, "input": "0 2 4 0 8\n5 12 2 1\n4 25 95 44\n2 1 2 1\n", "actual_output": "3\n", "expected_output": "139\n\n", "anno_code": ["X, Y, a, b, c = list(map(int,input().split())) # (0): X=0, Y=2, a=4, b=0, c=8\np = list(map(int,input().split())) # (1): p=[5, 12, 2, 1]\nq = list(map(int,input().split())) # (2): q=[4, 25, 95, 44]\nr = list(map(int,input().split())) # (3): r=[2, 1, 2, 1]\ns = sorted(p)[::-1][:X] + sorted(q)[::-1][:X] + r # (4): s=[2, 1, 2, 1]\nans = sum(s[:X + Y]) # (5): ans=3\nprint(ans) "], "anno_status": [true], "diff_content": " X, Y, a, b, c = list(map(int,input().split()))\n p = list(map(int,input().split()))\n q = list(map(int,input().split()))\n r = list(map(int,input().split()))\n-s = sorted(p)[::-1][:X] + sorted(q)[::-1][:X] + r\n+s = sorted(p)[::-1][:X] + sorted(q)[::-1][:Y] + r\n+s = sorted(s)[::-1]\n ans = sum(s[:X + Y])\n-print(ans) \n+print(ans) \n", "FL_content": " X, Y, a, b, c = list(map(int,input().split()))\n p = list(map(int,input().split()))\n q = list(map(int,input().split()))\n r = list(map(int,input().split()))\n-s = sorted(p)[::-1][:X] + sorted(q)[::-1][:X] + r\n ans = sum(s[:X + Y])\n-print(ans) \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u948779457", "problem_id": "p02727", "submission1_id": "s138611232", "submission2_id": "s740084499", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y,A,B,C = map(int,input().split())\np = list(map(int,input().split()))\nq = list(map(int,input().split()))\nr = list(map(int,input().split()))\np.sort(reverse=True)\nq.sort(reverse=True)\nr.sort(reverse=True)\nZ = X+Y\nP = p[:X]\nQ = q[:Y]\nR = r[:Z]\nans = 0\nif X <= Y:\n S = P + R\n S.sort(reverse=True)\n a = S[:X]\n b = S[X:]\n ans += sum(a)\n T = Q + b\n T.sort(reverse=True)\n c = T[:Y]\n ans += sum(c)\nelse:\n S = Q + R\n S.sort(reverse=True)\n a = S[:Y]\n b = S[Y:]\n ans += sum(a)\n T = P + b\n T.sort(reverse=True)\n c = T[:X]\n ans += sum(c)\nprint(ans)\nprint(a,b)", "code2": "X,Y,A,B,C = map(int,input().split())\np = list(map(int,input().split()))\nq = list(map(int,input().split()))\nr = list(map(int,input().split()))\np.sort(reverse=True)\nq.sort(reverse=True)\nr.sort(reverse=True)\nZ = X+Y\nP = p[:X]\nQ = q[:Y]\nR = r[:Z]\nans = 0\nif X <= Y:\n S = P + R\n S.sort(reverse=True)\n a = S[:X]\n b = S[X:]\n ans += sum(a)\n T = Q + b\n T.sort(reverse=True)\n c = T[:Y]\n ans += sum(c)\nelse:\n S = Q + R\n S.sort(reverse=True)\n a = S[:Y]\n b = S[Y:]\n ans += sum(a)\n T = P + b\n T.sort(reverse=True)\n c = T[:X]\n ans += sum(c)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585448899", "date2": "1585448937", "bleu_score": "0.9803402284618716", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "0 2 5 -2 8\n8 5 2 1\n4 34 100 44\n2 1 4 1\n", "actual_output": "144\n[] [4, 2]\n", "expected_output": "144\n\n", "anno_code": ["X,Y,A,B,C = map(int,input().split()) # (0): X=0, Y=2, A=5, B=-2, C=8\np = list(map(int,input().split())) # (1): p=[8, 5, 2, 1]\nq = list(map(int,input().split())) # (2): q=[4, 34, 100, 44]\nr = list(map(int,input().split())) # (3): r=[2, 1, 4, 1]\np.sort(reverse=True) # (4): NO CHANGE\nq.sort(reverse=True) # (5): q=[100, 44, 34, 4]\nr.sort(reverse=True) # (6): r=[4, 2, 1, 1]\nZ = X+Y # (7): Z=2\nP = p[:X] # (8): P=[]\nQ = q[:Y] # (9): Q=[100, 44]\nR = r[:Z] # (10): R=[4, 2]\nans = 0 # (11): ans=0\nif X <= Y: # (12): NO CHANGE\n S = P + R # (13): S=[4, 2]\n S.sort(reverse=True) # (14): NO CHANGE\n a = S[:X] # (15): a=[]\n b = S[X:] # (16): b=[4, 2]\n ans += sum(a) # (17): NO CHANGE\n T = Q + b # (18): T=[100, 44, 4, 2]\n T.sort(reverse=True) # (19): NO CHANGE\n c = T[:Y] # (20): c=[100, 44]\n ans += sum(c) # (21): ans=144\nelse:\n S = Q + R\n S.sort(reverse=True)\n a = S[:Y]\n b = S[Y:]\n ans += sum(a)\n T = P + b\n T.sort(reverse=True)\n c = T[:X]\n ans += sum(c)\nprint(ans) # (22): NO CHANGE\nprint(a,b)"], "anno_status": [true], "diff_content": " X,Y,A,B,C = map(int,input().split())\n p = list(map(int,input().split()))\n q = list(map(int,input().split()))\n r = list(map(int,input().split()))\n p.sort(reverse=True)\n q.sort(reverse=True)\n r.sort(reverse=True)\n Z = X+Y\n P = p[:X]\n Q = q[:Y]\n R = r[:Z]\n ans = 0\n if X <= Y:\n S = P + R\n S.sort(reverse=True)\n a = S[:X]\n b = S[X:]\n ans += sum(a)\n T = Q + b\n T.sort(reverse=True)\n c = T[:Y]\n ans += sum(c)\n else:\n S = Q + R\n S.sort(reverse=True)\n a = S[:Y]\n b = S[Y:]\n ans += sum(a)\n T = P + b\n T.sort(reverse=True)\n c = T[:X]\n ans += sum(c)\n print(ans)\n-print(a,b)\n", "FL_content": " X,Y,A,B,C = map(int,input().split())\n p = list(map(int,input().split()))\n q = list(map(int,input().split()))\n r = list(map(int,input().split()))\n p.sort(reverse=True)\n q.sort(reverse=True)\n r.sort(reverse=True)\n Z = X+Y\n P = p[:X]\n Q = q[:Y]\n R = r[:Z]\n ans = 0\n if X <= Y:\n S = P + R\n S.sort(reverse=True)\n a = S[:X]\n b = S[X:]\n ans += sum(a)\n T = Q + b\n T.sort(reverse=True)\n c = T[:Y]\n ans += sum(c)\n else:\n S = Q + R\n S.sort(reverse=True)\n a = S[:Y]\n b = S[Y:]\n ans += sum(a)\n T = P + b\n T.sort(reverse=True)\n c = T[:X]\n ans += sum(c)\n print(ans)\n-print(a,b)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 34 }, { "user_id": "u385244248", "problem_id": "p02727", "submission1_id": "s116566468", "submission2_id": "s546448315", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nimport math\nimport string\nimport collections\nimport fractions\nimport random\nfrom operator import itemgetter\nimport itertools\nfrom collections import deque\nimport copy\nimport heapq\nimport bisect\n\nMOD = 10 ** 9 + 7\nINF = 10 ** 18\ninput = lambda: sys.stdin.readline().strip()\n\nsys.setrecursionlimit(10 ** 8)\n\nX, Y, A, B, C = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\np.sort(reverse=True)\nq.sort(reverse=True)\nr.sort()\n\nans = sum(p[0:X]) + sum(q[0:Y])\n\nfor i in range(C):\n if p[-1] <= q[-1] < r[-1] and A > 0:\n ans += r.pop(-1)\n ans -= p.pop(-1)\n A -= 1\n elif q[-1] <= p[-1] < r[-1] and B > 0:\n ans += r.pop(-1)\n ans -= q.pop(-1)\n B -= 1\n elif q[-1] < r[-1] and B > 0:\n ans += r.pop(-1)\n ans -= q.pop(-1)\n B -= 1\n elif p[-1] < r[-1] and A > 0:\n ans += r.pop(-1)\n ans -= p.pop(-1)\n A -= 1\n else:\n break\nprint(ans)", "code2": "\nimport sys\nimport math\nimport string\nimport collections\nimport fractions\nimport random\nfrom operator import itemgetter\nimport itertools\nfrom collections import deque\nimport copy\nimport heapq\nimport bisect\n\nMOD = 10 ** 9 + 7\nINF = 10 ** 18\ninput = lambda: sys.stdin.readline().strip()\n\nsys.setrecursionlimit(10 ** 8)\n\nX, Y, A, B, C = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\np.sort(reverse=True)\nq.sort(reverse=True)\nr.sort()\n\nans = sum(p[0:X]) + sum(q[0:Y])\np = sorted(p[0:X], reverse=True)\nq = sorted(q[0:Y], reverse=True)\n\nfor i in range(C):\n if p and q and r:\n if p[-1] <= q[-1] < r[-1]:\n ans += r.pop(-1)\n ans -= p.pop(-1)\n elif q[-1] <= p[-1] < r[-1]:\n ans += r.pop(-1)\n ans -= q.pop(-1)\n elif q[-1] < r[-1]:\n ans += r.pop(-1)\n ans -= q.pop(-1)\n elif p[-1] < r[-1]:\n ans += r.pop(-1)\n ans -= p.pop(-1)\n else:\n break\n elif p and r:\n if p[-1] < r[-1]:\n ans += r.pop(-1)\n ans -= p.pop(-1)\n else:\n break\n elif q and r:\n if q[-1] < r[-1]:\n ans += r.pop(-1)\n ans -= q.pop(-1)\n else:\n break\n else:\n break\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585447670", "date2": "1585448728", "bleu_score": "0.7135162556705511", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1], "code1_test_score": 53, "total_score": 103, "input": "0 2 8 -2 8\n8 5 3 1\n4 34 000 44\n2 1 4 1\n", "actual_output": "81\n", "expected_output": "78\n\n", "anno_code": [" # (0): sys=, math=, string=, collections=, fractions=, random=, itemgetter=, itertools=, deque=, copy=, heapq=, bisect=\nimport sys\nimport math\nimport string\nimport collections\nimport fractions\nimport random\nfrom operator import itemgetter\nimport itertools\nfrom collections import deque\nimport copy\nimport heapq\nimport bisect\n\nMOD = 10 ** 9 + 7 # (1): MOD=1000000007\nINF = 10 ** 18 # (2): INF=1000000000000000000\ninput = lambda: sys.stdin.readline().strip() # (3): input= at 0x0000027F6F4D9BD0>\n\nsys.setrecursionlimit(10 ** 8) # (4): NO CHANGE\n\nX, Y, A, B, C = map(int, input().split()) # (5): X=0, Y=2, A=8, B=-2, C=8\np = list(map(int, input().split())) # (6): p=[8, 5, 3, 1]\nq = list(map(int, input().split())) # (7): q=[4, 34, 0, 44]\nr = list(map(int, input().split())) # (8): r=[2, 1, 4, 1]\n\np.sort(reverse=True) # (9): NO CHANGE\nq.sort(reverse=True) # (10): q=[44, 34, 4, 0]\nr.sort() # (11): r=[1, 1, 2, 4]\n\nans = sum(p[0:X]) + sum(q[0:Y]) # (12): ans=78\n\nfor i in range(C): # (13): i=0 (21): i=1\n if p[-1] <= q[-1] < r[-1] and A > 0: # (14): NO CHANGE (22): NO CHANGE\n ans += r.pop(-1)\n ans -= p.pop(-1)\n A -= 1\n elif q[-1] <= p[-1] < r[-1] and B > 0: # (15): NO CHANGE (23): NO CHANGE\n ans += r.pop(-1)\n ans -= q.pop(-1)\n B -= 1\n elif q[-1] < r[-1] and B > 0: # (16): NO CHANGE (24): NO CHANGE\n ans += r.pop(-1)\n ans -= q.pop(-1)\n B -= 1\n elif p[-1] < r[-1] and A > 0: # (17): NO CHANGE (25): NO CHANGE\n ans += r.pop(-1) # (18): r=[1, 1, 2], ans=82\n ans -= p.pop(-1) # (19): p=[8, 5, 3], ans=81\n A -= 1 # (20): A=7\n else:\n break # (26): NO CHANGE\nprint(ans)"], "anno_status": [false], "diff_content": " \n import sys\n import math\n import string\n import collections\n import fractions\n import random\n from operator import itemgetter\n import itertools\n from collections import deque\n import copy\n import heapq\n import bisect\n \n MOD = 10 ** 9 + 7\n INF = 10 ** 18\n input = lambda: sys.stdin.readline().strip()\n \n sys.setrecursionlimit(10 ** 8)\n \n X, Y, A, B, C = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n p.sort(reverse=True)\n q.sort(reverse=True)\n r.sort()\n \n ans = sum(p[0:X]) + sum(q[0:Y])\n+p = sorted(p[0:X], reverse=True)\n+q = sorted(q[0:Y], reverse=True)\n \n for i in range(C):\n- if p[-1] <= q[-1] < r[-1] and A > 0:\n- ans += r.pop(-1)\n- ans -= p.pop(-1)\n- A -= 1\n- elif q[-1] <= p[-1] < r[-1] and B > 0:\n- ans += r.pop(-1)\n- ans -= q.pop(-1)\n- B -= 1\n- elif q[-1] < r[-1] and B > 0:\n- ans += r.pop(-1)\n- ans -= q.pop(-1)\n- B -= 1\n- elif p[-1] < r[-1] and A > 0:\n- ans += r.pop(-1)\n- ans -= p.pop(-1)\n- A -= 1\n+ if p and q and r:\n+ if p[-1] <= q[-1] < r[-1]:\n+ ans += r.pop(-1)\n+ ans -= p.pop(-1)\n+ elif q[-1] <= p[-1] < r[-1]:\n+ ans += r.pop(-1)\n+ ans -= q.pop(-1)\n+ elif q[-1] < r[-1]:\n+ ans += r.pop(-1)\n+ ans -= q.pop(-1)\n+ elif p[-1] < r[-1]:\n+ ans += r.pop(-1)\n+ ans -= p.pop(-1)\n+ else:\n+ break\n+ elif p and r:\n+ if p[-1] < r[-1]:\n+ ans += r.pop(-1)\n+ ans -= p.pop(-1)\n+ else:\n+ break\n+ elif q and r:\n+ if q[-1] < r[-1]:\n+ ans += r.pop(-1)\n+ ans -= q.pop(-1)\n+ else:\n+ break\n else:\n break\n+\n print(ans)\n+\n", "FL_content": " \n import sys\n import math\n import string\n import collections\n import fractions\n import random\n from operator import itemgetter\n import itertools\n from collections import deque\n import copy\n import heapq\n import bisect\n \n MOD = 10 ** 9 + 7\n INF = 10 ** 18\n input = lambda: sys.stdin.readline().strip()\n \n sys.setrecursionlimit(10 ** 8)\n \n X, Y, A, B, C = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n p.sort(reverse=True)\n q.sort(reverse=True)\n r.sort()\n \n ans = sum(p[0:X]) + sum(q[0:Y])\n \n for i in range(C):\n- if p[-1] <= q[-1] < r[-1] and A > 0:\n- ans += r.pop(-1)\n- ans -= p.pop(-1)\n- A -= 1\n- elif q[-1] <= p[-1] < r[-1] and B > 0:\n- ans += r.pop(-1)\n- ans -= q.pop(-1)\n- B -= 1\n- elif q[-1] < r[-1] and B > 0:\n- ans += r.pop(-1)\n- ans -= q.pop(-1)\n- B -= 1\n- elif p[-1] < r[-1] and A > 0:\n- ans += r.pop(-1)\n- ans -= p.pop(-1)\n- A -= 1\n else:\n break\n print(ans)\n", "added_lines": 31, "removed_lines": 16, "code1_lines": 51 }, { "user_id": "u617718239", "problem_id": "p02727", "submission1_id": "s649197768", "submission2_id": "s973475806", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y, a, b, c = map(int, input().split())\narrayP = list(input().split())\narrayQ = list(input().split())\narrayR = list(input().split())\narrayP.sort(reverse=True)\narrayQ.sort(reverse=True)\narrayR.sort(reverse=True)\narrayAns = []\nfor i in range(x):\n arrayAns.append(int(arrayP[i]))\nfor i in range(y):\n arrayAns.append(int(arrayQ[i]))\narrayAns.sort()\nfor i in range(len(arrayR)):\n if arrayAns[0] <= int(arrayR[i]):\n arrayAns[0] = int(arrayR[i])\n arrayAns.sort()\nprint(sum(arrayAns))", "code2": "x, y, a, b, c = map(int, input().split())\narrayP = list(map(int, input().split()))\narrayQ = list(map(int, input().split()))\narrayR = list(map(int, input().split()))\narrayP.sort(reverse=True)\narrayQ.sort(reverse=True)\narrayR.sort(reverse=True)\narrayAns = []\nfor i in range(x):\n arrayAns.append(int(arrayP[i]))\nfor i in range(y):\n arrayAns.append(int(arrayQ[i]))\narrayAns.sort()\nfor i in range(min(len(arrayR), len(arrayAns))):\n if arrayAns[i] <= int(arrayR[i]):\n arrayAns[i] = int(arrayR[i])\n else:\n break\nprint(sum(arrayAns))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585447426", "date2": "1585449995", "bleu_score": "0.8729561946659459", "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, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1], "code1_test_score": 77, "total_score": 103, "input": "0 2 4 0 8\n5 12 2 1\n4 21 68 4\n2 2 2 0\n", "actual_output": "72\n", "expected_output": "89\n\n", "anno_code": ["x, y, a, b, c = map(int, input().split()) # (0): x=0, y=2, a=4, b=0, c=8\narrayP = list(input().split()) # (1): arrayP=['5', '12', '2', '1']\narrayQ = list(input().split()) # (2): arrayQ=['4', '21', '68', '4']\narrayR = list(input().split()) # (3): arrayR=['2', '2', '2', '0']\narrayP.sort(reverse=True) # (4): arrayP=['5', '2', '12', '1']\narrayQ.sort(reverse=True) # (5): arrayQ=['68', '4', '4', '21']\narrayR.sort(reverse=True) # (6): NO CHANGE\narrayAns = [] # (7): arrayAns=[]\nfor i in range(x): # (8): NO CHANGE\n arrayAns.append(int(arrayP[i]))\nfor i in range(y): # (9): i=0 (11): i=1 (13): NO CHANGE\n arrayAns.append(int(arrayQ[i])) # (10): arrayAns=[68] (12): arrayAns=[68, 4]\narrayAns.sort() # (14): arrayAns=[4, 68]\nfor i in range(len(arrayR)): # (15): i=0 (17): i=1 ... (23): NO CHANGE\n if arrayAns[0] <= int(arrayR[i]): # (16): NO CHANGE (18): NO CHANGE ... (22): NO CHANGE\n arrayAns[0] = int(arrayR[i])\n arrayAns.sort()\nprint(sum(arrayAns))"], "anno_status": [true], "diff_content": " x, y, a, b, c = map(int, input().split())\n-arrayP = list(input().split())\n-arrayQ = list(input().split())\n-arrayR = list(input().split())\n+arrayP = list(map(int, input().split()))\n+arrayQ = list(map(int, input().split()))\n+arrayR = list(map(int, input().split()))\n arrayP.sort(reverse=True)\n arrayQ.sort(reverse=True)\n arrayR.sort(reverse=True)\n arrayAns = []\n for i in range(x):\n arrayAns.append(int(arrayP[i]))\n for i in range(y):\n arrayAns.append(int(arrayQ[i]))\n arrayAns.sort()\n-for i in range(len(arrayR)):\n- if arrayAns[0] <= int(arrayR[i]):\n- arrayAns[0] = int(arrayR[i])\n- arrayAns.sort()\n+for i in range(min(len(arrayR), len(arrayAns))):\n+ if arrayAns[i] <= int(arrayR[i]):\n+ arrayAns[i] = int(arrayR[i])\n+ else:\n+ break\n print(sum(arrayAns))\n+\n", "FL_content": " x, y, a, b, c = map(int, input().split())\n-arrayP = list(input().split())\n-arrayQ = list(input().split())\n-arrayR = list(input().split())\n arrayP.sort(reverse=True)\n arrayQ.sort(reverse=True)\n arrayR.sort(reverse=True)\n arrayAns = []\n for i in range(x):\n arrayAns.append(int(arrayP[i]))\n for i in range(y):\n arrayAns.append(int(arrayQ[i]))\n arrayAns.sort()\n-for i in range(len(arrayR)):\n- if arrayAns[0] <= int(arrayR[i]):\n- arrayAns[0] = int(arrayR[i])\n- arrayAns.sort()\n print(sum(arrayAns))\n", "added_lines": 9, "removed_lines": 7, "code1_lines": 18 }, { "user_id": "u952669998", "problem_id": "p02727", "submission1_id": "s014410933", "submission2_id": "s193914982", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y,a,b,c= list(map(int,input().split()))\n\np = list(map(int,input().split()))\nq = list(map(int,input().split()))\nr = list(map(int,input().split()))\np.sort()\nq.sort()\nr.sort()\n\nt=p[0:x] + q[0:y] + r\nt.sort()\nprint(sum(t[0:(x+y)]))", "code2": "X,Y,A,B,C = list(map(int,input().split()))\np = sorted(list(map(int,input().split())),reverse=True)\nq = sorted(list(map(int,input().split())),reverse=True)\nr = sorted(list(map(int,input().split())),reverse=True)\n\ntaberu = p[0:X] + q[0:Y] + r\ntaberu.sort(reverse=True)\n\nprint(sum(taberu[0:X+Y]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585495944", "date2": "1585497480", "bleu_score": "0.6027730459660077", "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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 103, "input": "1 2 2 4 1\n3 3\n1 1\n3\n", "actual_output": "5\n", "expected_output": "7\n\n", "anno_code": ["x,y,a,b,c= list(map(int,input().split())) # (0): x=1, y=2, a=2, b=4, c=1\n\np = list(map(int,input().split())) # (1): p=[3, 3]\nq = list(map(int,input().split())) # (2): q=[1, 1]\nr = list(map(int,input().split())) # (3): r=[3]\np.sort() # (4): NO CHANGE\nq.sort() # (5): NO CHANGE\nr.sort() # (6): NO CHANGE\n\nt=p[0:x] + q[0:y] + r # (7): t=[3, 1, 1, 3]\nt.sort() # (8): t=[1, 1, 3, 3]\nprint(sum(t[0:(x+y)]))"], "anno_status": [true], "diff_content": "-x,y,a,b,c= list(map(int,input().split()))\n+X,Y,A,B,C = list(map(int,input().split()))\n+p = sorted(list(map(int,input().split())),reverse=True)\n+q = sorted(list(map(int,input().split())),reverse=True)\n+r = sorted(list(map(int,input().split())),reverse=True)\n \n-p = list(map(int,input().split()))\n-q = list(map(int,input().split()))\n-r = list(map(int,input().split()))\n-p.sort()\n-q.sort()\n-r.sort()\n+taberu = p[0:X] + q[0:Y] + r\n+taberu.sort(reverse=True)\n \n-t=p[0:x] + q[0:y] + r\n-t.sort()\n-print(sum(t[0:(x+y)]))\n+print(sum(taberu[0:X+Y]))\n", "FL_content": "-x,y,a,b,c= list(map(int,input().split()))\n \n-p = list(map(int,input().split()))\n-q = list(map(int,input().split()))\n-r = list(map(int,input().split()))\n-p.sort()\n-q.sort()\n-r.sort()\n \n-t=p[0:x] + q[0:y] + r\n-t.sort()\n-print(sum(t[0:(x+y)]))\n", "added_lines": 7, "removed_lines": 10, "code1_lines": 12 }, { "user_id": "u741612283", "problem_id": "p02727", "submission1_id": "s949782484", "submission2_id": "s409681132", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y,a,b,c = (int(x) for x in input().split())\n\nfrom bisect import insort\n\np_list = []\nq_list = []\nr_list = []\n\nfor value in input().split():\n insort(p_list, int(value))\n\nfor value in input().split():\n insort(q_list, int(value))\n \nfor value in input().split():\n insort(r_list, int(value))\n \nred = 0\ngreen = 0\nwhite = 0\n\nsum_num = 0\n\nprint(sum_num)\nfor i in range(1,x+y+1):\n if red < x:\n \tred_num = p_list[(red*-1)-1]\n else:\n red_num = 0\n if green < y:\n \tgreen_num = q_list[(green*-1)-1]\n else:\n green_num = 0\n if white < c:\n \twhite_num = r_list[(white*-1)-1]\n else:\n white_num = 0\n \n max_p = max([red_num,green_num,white_num])\n sum_num += max_p\n if max_p == white_num:\n white += 1\n elif max_p == red_num:\n red += 1\n elif max_p == green_num:\n green += 1", "code2": "x,y,a,b,c = (int(x) for x in input().split())\n\nfrom bisect import insort\n\np_list = list(map(int,input().split()))\nq_list = list(map(int,input().split()))\nr_list = list(map(int,input().split()))\n\n\np_list.sort()\nq_list.sort()\nr_list.sort()\n\nred = 0\ngreen = 0\nwhite = 0\n\nsum_num = 0\n\nfor i in range(1,x+y+1):\n if red < x:\n \tred_num = p_list[(red*-1)-1]\n else:\n red_num = 0\n if green < y:\n \tgreen_num = q_list[(green*-1)-1]\n else:\n green_num = 0\n if white < c:\n \twhite_num = r_list[(white*-1)-1]\n else:\n white_num = 0\n \n max_p = max([red_num,green_num,white_num])\n sum_num += max_p\n if max_p == white_num:\n white += 1\n elif max_p == red_num:\n red += 1\n elif max_p == green_num:\n green += 1\n\nprint(sum_num)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585448288", "date2": "1585450069", "bleu_score": "0.8465883324324229", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2 1 4 4\n11 12 13 14\n21 22 8 24\n1 2 3 4\n", "actual_output": "0\n", "expected_output": "73\n\n", "anno_code": ["x,y,a,b,c = (int(x) for x in input().split()) # (0): x=2, y=2, a=1, b=4, c=4, insort=\n\nfrom bisect import insort\n\np_list = [] # (1): p_list=[]\nq_list = [] # (2): q_list=[]\nr_list = [] # (3): r_list=[]\n\nfor value in input().split(): # (4): value=11 (6): value=12 ... (12): NO CHANGE\n insort(p_list, int(value)) # (5): p_list=[11] (7): p_list=[11, 12] ... (11): p_list=[11, 12, 13, 14]\n\nfor value in input().split(): # (13): value=21 (15): value=22 ... (21): NO CHANGE\n insort(q_list, int(value)) # (14): q_list=[21] (16): q_list=[21, 22] ... (20): q_list=[8, 21, 22, 24]\n \nfor value in input().split(): # (22): value=1 (24): value=2 ... (30): NO CHANGE\n insort(r_list, int(value)) # (23): r_list=[1] (25): r_list=[1, 2] ... (29): r_list=[1, 2, 3, 4]\n \nred = 0 # (31): red=0\ngreen = 0 # (32): green=0\nwhite = 0 # (33): white=0\n\nsum_num = 0 # (34): sum_num=0\n\nprint(sum_num) # (35): NO CHANGE\nfor i in range(1,x+y+1): # (36): i=1 (49): i=2 ... (74): i=4\n if red < x: # (37): NO CHANGE (50): NO CHANGE ... (75): NO CHANGE\n \tred_num = p_list[(red*-1)-1] # (38): red_num=14 (51): NO CHANGE ... (76): red_num=13\n else:\n red_num = 0\n if green < y: # (39): NO CHANGE (52): NO CHANGE ... (77): NO CHANGE\n \tgreen_num = q_list[(green*-1)-1] # (40): green_num=24 (53): green_num=22\n else:\n green_num = 0 # (66): green_num=0 (78): NO CHANGE\n if white < c: # (41): NO CHANGE (54): NO CHANGE ... (79): NO CHANGE\n \twhite_num = r_list[(white*-1)-1] # (42): white_num=4 (55): NO CHANGE ... (80): NO CHANGE\n else:\n white_num = 0\n \n max_p = max([red_num,green_num,white_num]) # (43): max_p=24 (56): max_p=22 ... (81): max_p=13\n sum_num += max_p # (44): sum_num=24 (57): sum_num=46 ... (82): sum_num=73\n if max_p == white_num: # (45): NO CHANGE (58): NO CHANGE ... (83): NO CHANGE\n white += 1\n elif max_p == red_num: # (46): NO CHANGE (59): NO CHANGE ... (84): NO CHANGE\n red += 1 # (73): red=1 (85): red=2\n elif max_p == green_num: # (47): NO CHANGE (60): NO CHANGE\n green += 1 # (48): green=1 (61): green=2\n"], "anno_status": [false], "diff_content": " x,y,a,b,c = (int(x) for x in input().split())\n \n from bisect import insort\n \n-p_list = []\n-q_list = []\n-r_list = []\n+p_list = list(map(int,input().split()))\n+q_list = list(map(int,input().split()))\n+r_list = list(map(int,input().split()))\n \n-for value in input().split():\n- insort(p_list, int(value))\n \n-for value in input().split():\n- insort(q_list, int(value))\n- \n-for value in input().split():\n- insort(r_list, int(value))\n- \n+p_list.sort()\n+q_list.sort()\n+r_list.sort()\n+\n red = 0\n green = 0\n white = 0\n \n sum_num = 0\n \n-print(sum_num)\n for i in range(1,x+y+1):\n if red < x:\n \tred_num = p_list[(red*-1)-1]\n else:\n red_num = 0\n if green < y:\n \tgreen_num = q_list[(green*-1)-1]\n else:\n green_num = 0\n if white < c:\n \twhite_num = r_list[(white*-1)-1]\n else:\n white_num = 0\n \n max_p = max([red_num,green_num,white_num])\n sum_num += max_p\n if max_p == white_num:\n white += 1\n elif max_p == red_num:\n red += 1\n elif max_p == green_num:\n green += 1\n+\n+print(sum_num)\n", "FL_content": " x,y,a,b,c = (int(x) for x in input().split())\n \n from bisect import insort\n \n-p_list = []\n-q_list = []\n-r_list = []\n \n-for value in input().split():\n- insort(p_list, int(value))\n \n-for value in input().split():\n- insort(q_list, int(value))\n- \n-for value in input().split():\n- insort(r_list, int(value))\n- \n red = 0\n green = 0\n white = 0\n \n sum_num = 0\n \n-print(sum_num)\n for i in range(1,x+y+1):\n if red < x:\n \tred_num = p_list[(red*-1)-1]\n else:\n red_num = 0\n if green < y:\n \tgreen_num = q_list[(green*-1)-1]\n else:\n green_num = 0\n if white < c:\n \twhite_num = r_list[(white*-1)-1]\n else:\n white_num = 0\n \n max_p = max([red_num,green_num,white_num])\n sum_num += max_p\n if max_p == white_num:\n white += 1\n elif max_p == red_num:\n red += 1\n elif max_p == green_num:\n green += 1\n", "added_lines": 9, "removed_lines": 12, "code1_lines": 46 }, { "user_id": "u982896977", "problem_id": "p02727", "submission1_id": "s517039276", "submission2_id": "s276210863", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y,a,b,c = map(int,input().split())\np_ = list(map(int,input().split()))\nq_ = list(map(int,input().split()))\nr_ = list(map(int,input().split()))\np_.sort(reverse=True)\nq_.sort(reverse=True)\nr_.sort(reverse=True)\nred = x-1\ngre = y-1\nmu = 0\nwhile True:\n if red < 0 or gre < 0 or mu == c:\n break\n else:\n badr = p_[red]\n badg = q_[gre]\n badmu = r_[mu]\n if badr <= badg:\n if badr < badmu:\n red = red-1\n mu = mu+1\n else:\n break\n else:\n if badg < badmu:\n gre = gre-1\n mu = mu+1\n else:\n break\nans = 0\nfor i in range(red+1):\n ans += p_[i]\nfor i in range(gre+1):\n ans += q_[i]\nfor i in range(mu):\n ans += r_[i]\nprint(ans)", "code2": "x,y,a,b,c = map(int,input().split())\np_ = list(map(int,input().split()))\nq_ = list(map(int,input().split()))\nr_ = list(map(int,input().split()))\np_.sort(reverse=True)\nq_.sort(reverse=True)\nr_.sort(reverse=True)\nred = x-1\ngre = y-1\nmu = 0\nwhile True:\n if mu == c:\n break\n else:\n if red >= 0:\n badr = p_[red]\n else:\n badr = 1000000000\n if gre >= 0:\n badg = q_[gre]\n else:\n badg = 1000000000\n badmu = r_[mu]\n if badr <= badg:\n if badr < badmu:\n red = red-1\n mu = mu+1\n else:\n break\n else:\n if badg < badmu:\n gre = gre-1\n mu = mu+1\n else:\n break\nans = 0\nfor i in range(red+1):\n ans += p_[i]\nfor i in range(gre+1):\n ans += q_[i]\nfor i in range(mu):\n ans += r_[i]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585448903", "date2": "1585449358", "bleu_score": "0.8596142062021374", "code1_test_status": [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "0 2 2 2 3\n8 1\n9 1\n2 1\n", "actual_output": "10\n", "expected_output": "11\n\n", "anno_code": ["x,y,a,b,c = map(int,input().split()) # (0): x=0, y=2, a=2, b=2, c=3\np_ = list(map(int,input().split())) # (1): p_=[8, 1]\nq_ = list(map(int,input().split())) # (2): q_=[9, 1]\nr_ = list(map(int,input().split())) # (3): r_=[2, 1]\np_.sort(reverse=True) # (4): NO CHANGE\nq_.sort(reverse=True) # (5): NO CHANGE\nr_.sort(reverse=True) # (6): NO CHANGE\nred = x-1 # (7): red=-1\ngre = y-1 # (8): gre=1\nmu = 0 # (9): mu=0\nwhile True: # (10): NO CHANGE\n if red < 0 or gre < 0 or mu == c: # (11): NO CHANGE\n break # (12): NO CHANGE\n else:\n badr = p_[red]\n badg = q_[gre]\n badmu = r_[mu]\n if badr <= badg:\n if badr < badmu:\n red = red-1\n mu = mu+1\n else:\n break\n else:\n if badg < badmu:\n gre = gre-1\n mu = mu+1\n else:\n break\nans = 0 # (13): ans=0\nfor i in range(red+1): # (14): NO CHANGE\n ans += p_[i]\nfor i in range(gre+1): # (15): i=0 (17): i=1 (19): NO CHANGE\n ans += q_[i] # (16): ans=9 (18): ans=10\nfor i in range(mu): # (20): NO CHANGE\n ans += r_[i]\nprint(ans)"], "anno_status": [true], "diff_content": " x,y,a,b,c = map(int,input().split())\n p_ = list(map(int,input().split()))\n q_ = list(map(int,input().split()))\n r_ = list(map(int,input().split()))\n p_.sort(reverse=True)\n q_.sort(reverse=True)\n r_.sort(reverse=True)\n red = x-1\n gre = y-1\n mu = 0\n while True:\n- if red < 0 or gre < 0 or mu == c:\n+ if mu == c:\n break\n else:\n- badr = p_[red]\n- badg = q_[gre]\n+ if red >= 0:\n+ badr = p_[red]\n+ else:\n+ badr = 1000000000\n+ if gre >= 0:\n+ badg = q_[gre]\n+ else:\n+ badg = 1000000000\n badmu = r_[mu]\n if badr <= badg:\n if badr < badmu:\n red = red-1\n mu = mu+1\n else:\n break\n else:\n if badg < badmu:\n gre = gre-1\n mu = mu+1\n else:\n break\n ans = 0\n for i in range(red+1):\n ans += p_[i]\n for i in range(gre+1):\n ans += q_[i]\n for i in range(mu):\n ans += r_[i]\n print(ans)\n", "FL_content": " x,y,a,b,c = map(int,input().split())\n p_ = list(map(int,input().split()))\n q_ = list(map(int,input().split()))\n r_ = list(map(int,input().split()))\n p_.sort(reverse=True)\n q_.sort(reverse=True)\n r_.sort(reverse=True)\n red = x-1\n gre = y-1\n mu = 0\n while True:\n- if red < 0 or gre < 0 or mu == c:\n break\n else:\n- badr = p_[red]\n- badg = q_[gre]\n badmu = r_[mu]\n if badr <= badg:\n if badr < badmu:\n red = red-1\n mu = mu+1\n else:\n break\n else:\n if badg < badmu:\n gre = gre-1\n mu = mu+1\n else:\n break\n ans = 0\n for i in range(red+1):\n ans += p_[i]\n for i in range(gre+1):\n ans += q_[i]\n for i in range(mu):\n ans += r_[i]\n print(ans)\n", "added_lines": 9, "removed_lines": 3, "code1_lines": 37 }, { "user_id": "u307028468", "problem_id": "p02727", "submission1_id": "s520069102", "submission2_id": "s116241915", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y, A, B, C = (int(x) for x in input().split())\nR = [int(i) for i in input().split()]\nG = [int(i) for i in input().split()]\nM = [int(i) for i in input().split()]\n\nprint(R, G, M)\n\nR.sort(reverse=True)\nG.sort(reverse=True)\n\nfor i in range(X):\n M.append(R[i])\n\nfor i in range(Y):\n M.append(G[i])\n\nM.sort(reverse=True)\n\nans = 0\nfor i in range(X + Y):\n ans = M[i] + ans\n\nprint(ans)\n", "code2": "X, Y, A, B, C = (int(x) for x in input().split())\nR = [int(i) for i in input().split()]\nG = [int(i) for i in input().split()]\nM = [int(i) for i in input().split()]\n\nR.sort(reverse=True)\nG.sort(reverse=True)\n\nfor i in range(X):\n M.append(R[i])\n\nfor i in range(Y):\n M.append(G[i])\n\nM.sort(reverse=True)\n\nans = 0\nfor i in range(X + Y):\n ans = M[i] + ans\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585449594", "date2": "1585449636", "bleu_score": "0.9565659888175573", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "0 4 4 -1 4\n15 22 10 1\n18 15 31 33\n1 1 2 1\n", "actual_output": "[15, 22, 10, 1] [18, 15, 31, 33] [1, 1, 2, 1]\n97\n", "expected_output": "97\n\n", "anno_code": ["X, Y, A, B, C = (int(x) for x in input().split()) # (0): X=0, Y=4, A=4, B=-1, C=4\nR = [int(i) for i in input().split()] # (1): R=[15, 22, 10, 1]\nG = [int(i) for i in input().split()] # (2): G=[18, 15, 31, 33]\nM = [int(i) for i in input().split()] # (3): M=[1, 1, 2, 1]\n\nprint(R, G, M) # (4): NO CHANGE\n\nR.sort(reverse=True) # (5): R=[22, 15, 10, 1]\nG.sort(reverse=True) # (6): G=[33, 31, 18, 15]\n\nfor i in range(X): # (7): NO CHANGE\n M.append(R[i])\n\nfor i in range(Y): # (8): i=0 (10): i=1 ... (16): NO CHANGE\n M.append(G[i]) # (9): M=[1, 1, 2, 1, 33] (11): M=[1, 1, 2, 1, 33, 31] ... (15): M=[1, 1, 2, 1, 33, 31, 18, 15]\n\nM.sort(reverse=True) # (17): M=[33, 31, 18, 15, 2, 1, 1, 1]\n\nans = 0 # (18): ans=0\nfor i in range(X + Y): # (19): i=0 (21): i=1 ... (27): NO CHANGE\n ans = M[i] + ans # (20): ans=33 (22): ans=64 ... (26): ans=97\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " X, Y, A, B, C = (int(x) for x in input().split())\n R = [int(i) for i in input().split()]\n G = [int(i) for i in input().split()]\n M = [int(i) for i in input().split()]\n \n-print(R, G, M)\n-\n R.sort(reverse=True)\n G.sort(reverse=True)\n \n for i in range(X):\n M.append(R[i])\n \n for i in range(Y):\n M.append(G[i])\n \n M.sort(reverse=True)\n \n ans = 0\n for i in range(X + Y):\n ans = M[i] + ans\n \n print(ans)\n \n", "FL_content": " X, Y, A, B, C = (int(x) for x in input().split())\n R = [int(i) for i in input().split()]\n G = [int(i) for i in input().split()]\n M = [int(i) for i in input().split()]\n \n-print(R, G, M)\n-\n R.sort(reverse=True)\n G.sort(reverse=True)\n \n for i in range(X):\n M.append(R[i])\n \n for i in range(Y):\n M.append(G[i])\n \n M.sort(reverse=True)\n \n ans = 0\n for i in range(X + Y):\n ans = M[i] + ans\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u627600101", "problem_id": "p02727", "submission1_id": "s432361046", "submission2_id": "s834324284", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y, A, B, C = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\np.sort(reverse=True)\nq.sort(reverse=True)\nr.sort(reverse=True)\n\nsa = sum(p[:X])\nsb = sum(q[:Y])\n\np.append(float('inf'))\nq.append(float('inf'))\n\n\nans = sa + sb\nnr = 0\nnp = X-1\nnq = Y-1\nwhile nr < len(r):\n if r[nr] <= min(p[np], q[nq]):\n break\n elif p[np] > r[nr] > q[nq]:\n ans += r[nr] - q[nq]\n nr += 1\n nq -= 1\n continue\n else:\n ans += r[nr] - p[np]\n nr += 1\n nq -= 1\n continue\n \nprint(ans)", "code2": "X, Y, A, B, C = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\np.sort(reverse=True)\nq.sort(reverse=True)\nr.sort(reverse=True)\n\nsa = sum(p[:X])\nsb = sum(q[:Y])\n\np.append(float('inf'))\nq.append(float('inf'))\n\n\nans = sa + sb\nnr = 0\nnp = X-1\nnq = Y-1\nwhile nr < len(r):\n if r[nr] <= min(p[np], q[nq]):\n break\n elif p[np] > q[nq]:\n ans += r[nr] - q[nq]\n nr += 1\n nq -= 1\n continue\n else:\n ans += r[nr] - p[np]\n nr += 1\n np -= 1\n continue\n\n \nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594687801", "date2": "1594688158", "bleu_score": "0.9802252926756696", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 98, "total_score": 103, "input": "2 0 -2 0 6\n28 -2\n9 -1\n2 -1\n", "actual_output": "31\n", "expected_output": "30\n\n", "anno_code": ["X, Y, A, B, C = map(int, input().split()) # (0): X=2, Y=0, A=-2, B=0, C=6\np = list(map(int, input().split())) # (1): p=[28, -2]\nq = list(map(int, input().split())) # (2): q=[9, -1]\nr = list(map(int, input().split())) # (3): r=[2, -1]\n\np.sort(reverse=True) # (4): NO CHANGE\nq.sort(reverse=True) # (5): NO CHANGE\nr.sort(reverse=True) # (6): NO CHANGE\n\nsa = sum(p[:X]) # (7): sa=26\nsb = sum(q[:Y]) # (8): sb=0\n\np.append(float('inf')) # (9): p=[28, -2, inf]\nq.append(float('inf')) # (10): q=[9, -1, inf]\n\n\nans = sa + sb # (11): ans=26\nnr = 0 # (12): nr=0\nnp = X-1 # (13): np=1\nnq = Y-1 # (14): nq=-1\nwhile nr < len(r): # (15): NO CHANGE (22): NO CHANGE (29): NO CHANGE\n if r[nr] <= min(p[np], q[nq]): # (16): NO CHANGE (23): NO CHANGE\n break\n elif p[np] > r[nr] > q[nq]: # (17): NO CHANGE (24): NO CHANGE\n ans += r[nr] - q[nq]\n nr += 1\n nq -= 1\n continue\n else:\n ans += r[nr] - p[np] # (18): ans=30 (25): ans=31\n nr += 1 # (19): nr=1 (26): nr=2\n nq -= 1 # (20): nq=-2 (27): nq=-3\n continue # (21): NO CHANGE (28): NO CHANGE\n \nprint(ans)"], "anno_status": [true], "diff_content": " X, Y, A, B, C = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n p.sort(reverse=True)\n q.sort(reverse=True)\n r.sort(reverse=True)\n \n sa = sum(p[:X])\n sb = sum(q[:Y])\n \n p.append(float('inf'))\n q.append(float('inf'))\n \n \n ans = sa + sb\n nr = 0\n np = X-1\n nq = Y-1\n while nr < len(r):\n if r[nr] <= min(p[np], q[nq]):\n break\n- elif p[np] > r[nr] > q[nq]:\n+ elif p[np] > q[nq]:\n ans += r[nr] - q[nq]\n nr += 1\n nq -= 1\n continue\n else:\n ans += r[nr] - p[np]\n nr += 1\n- nq -= 1\n+ np -= 1\n continue\n+\n \n print(ans)\n", "FL_content": " X, Y, A, B, C = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n p.sort(reverse=True)\n q.sort(reverse=True)\n r.sort(reverse=True)\n \n sa = sum(p[:X])\n sb = sum(q[:Y])\n \n p.append(float('inf'))\n q.append(float('inf'))\n \n \n ans = sa + sb\n nr = 0\n np = X-1\n nq = Y-1\n while nr < len(r):\n if r[nr] <= min(p[np], q[nq]):\n break\n- elif p[np] > r[nr] > q[nq]:\n ans += r[nr] - q[nq]\n nr += 1\n nq -= 1\n continue\n else:\n ans += r[nr] - p[np]\n nr += 1\n- nq -= 1\n continue\n \n print(ans)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 35 }, { "user_id": "u566159623", "problem_id": "p02727", "submission1_id": "s496517204", "submission2_id": "s771622974", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y, a, b, c = map(int, input().split())\np =list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\np = sorted(p)\np = sorted(p)\n\np = p[(len(p)-x):]\nq = q[(len(q)-y):]\nr=r+p\nr=r+q\nr = sorted(r)\nprint(sum(r[(len(r)-x-y):]))\n", "code2": "x, y, a, b, c = map(int, input().split())\np =list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\np = sorted(p)\nq = sorted(q)\n\np = p[(len(p)-x):]\nq = q[(len(q)-y):]\nr = r + p\nr = r + q\nr = sorted(r)\nprint(sum(r[(len(r)-x-y):]))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590462328", "date2": "1590463137", "bleu_score": "0.9257134726514513", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1], "code1_test_score": 73, "total_score": 103, "input": "0 2 5 0 8\n5 12 2 1\n4 23 95 5\n4 0 4 1\n", "actual_output": "100\n", "expected_output": "118\n\n", "anno_code": ["x, y, a, b, c = map(int, input().split()) # (0): x=0, y=2, a=5, b=0, c=8\np =list(map(int, input().split())) # (1): p=[5, 12, 2, 1]\nq = list(map(int, input().split())) # (2): q=[4, 23, 95, 5]\nr = list(map(int, input().split())) # (3): r=[4, 0, 4, 1]\np = sorted(p) # (4): p=[1, 2, 5, 12]\np = sorted(p) # (5): NO CHANGE\n\np = p[(len(p)-x):] # (6): p=[]\nq = q[(len(q)-y):] # (7): q=[95, 5]\nr=r+p # (8): NO CHANGE\nr=r+q # (9): r=[4, 0, 4, 1, 95, 5]\nr = sorted(r) # (10): r=[0, 1, 4, 4, 5, 95]\nprint(sum(r[(len(r)-x-y):]))\n"], "anno_status": [true], "diff_content": " x, y, a, b, c = map(int, input().split())\n p =list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n p = sorted(p)\n-p = sorted(p)\n+q = sorted(q)\n \n p = p[(len(p)-x):]\n q = q[(len(q)-y):]\n-r=r+p\n-r=r+q\n+r = r + p\n+r = r + q\n r = sorted(r)\n print(sum(r[(len(r)-x-y):]))\n \n", "FL_content": " x, y, a, b, c = map(int, input().split())\n p =list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n p = sorted(p)\n-p = sorted(p)\n \n p = p[(len(p)-x):]\n q = q[(len(q)-y):]\n-r=r+p\n-r=r+q\n r = sorted(r)\n print(sum(r[(len(r)-x-y):]))\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u893063840", "problem_id": "p02727", "submission1_id": "s206965098", "submission2_id": "s197714216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import heappush, heappop\n\nx, y, a, b, c = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\nhp = []\nfor e in p:\n heappush(hp, [-e, 0])\nfor e in q:\n heappush(hp, [-e, 1])\nfor e in r:\n heappush(hp, [-e, 2])\n\nans = 0\ncnt = [0] * 3\nsm = 0\nmx = [c, x, y]\nwhile hp:\n yum, col = heappop(hp)\n yum = -yum\n\n if cnt[col] >= mx[col]:\n continue\n\n ans += yum\n cnt[col] += 1\n sm += 1\n\n if sm == x + y:\n break\n\nprint(ans)\n", "code2": "from heapq import heappush, heappop\n\nx, y, a, b, c = map(int, input().split())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\nr = list(map(int, input().split()))\n\nhp = []\nfor e in p:\n heappush(hp, [-e, 0])\nfor e in q:\n heappush(hp, [-e, 1])\nfor e in r:\n heappush(hp, [-e, 2])\n\nans = 0\ncnt = [0] * 3\nsm = 0\nmx = [x, y, c]\nwhile hp:\n yum, col = heappop(hp)\n yum = -yum\n\n if cnt[col] >= mx[col]:\n continue\n\n ans += yum\n cnt[col] += 1\n sm += 1\n\n if sm == x + y:\n break\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585446868", "date2": "1585447018", "bleu_score": "0.9907849340915237", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 34, "total_score": 103, "input": "0 2 4 0 8\n5 13 2 1\n4 38 55 44\n2 2 2 1\n", "actual_output": "18\n", "expected_output": "99\n\n", "anno_code": ["from heapq import heappush, heappop\n\nx, y, a, b, c = map(int, input().split()) # (0): x=0, y=2, a=4, b=0, c=8\np = list(map(int, input().split())) # (1): p=[5, 13, 2, 1]\nq = list(map(int, input().split())) # (2): q=[4, 38, 55, 44]\nr = list(map(int, input().split())) # (3): r=[2, 2, 2, 1]\n\nhp = [] # (4): hp=[]\nfor e in p: # (5): e=5 (7): e=13 ... (13): NO CHANGE\n heappush(hp, [-e, 0]) # (6): hp (8): hp ... (12): hp\nfor e in q: # (14): e=4 (16): e=38 ... (22): NO CHANGE\n heappush(hp, [-e, 1]) # (15): hp (17): hp ... (21): hp\nfor e in r: # (23): e=2 (25): NO CHANGE ... (31): NO CHANGE\n heappush(hp, [-e, 2]) # (24): hp (26): hp ... (30): hp\n\nans = 0 # (32): ans=0\ncnt = [0] * 3 # (33): cnt=[0, 0, 0]\nsm = 0 # (34): sm=0\nmx = [c, x, y] # (35): mx=[8, 0, 2]\nwhile hp: # (36): NO CHANGE (41): NO CHANGE ... (59): NO CHANGE\n yum, col = heappop(hp) # (37): hp=[[-44, 1], [-5, 0], [-38, 1], [-2, 2], [-4, 1], [-2, 0], [-13, 0], [-1, 0], [-1, 2], [-2, 2], [-2, 2]], yum=-55, col=1 (42): hp=[[-38, 1], [-5, 0], [-13, 0], [-2, 2], [-4, 1], [-2, 0], [-2, 2], [-1, 0], [-1, 2], [-2, 2]], yum=-44 ... (60): hp, yum=-5\n yum = -yum # (38): yum=55 (43): yum=44 ... (61): yum=5\n\n if cnt[col] >= mx[col]: # (39): NO CHANGE (44): NO CHANGE ... (62): NO CHANGE\n continue # (40): NO CHANGE (45): NO CHANGE (50): NO CHANGE\n\n ans += yum # (55): ans=13 (63): ans=18\n cnt[col] += 1 # (56): cnt=[1, 0, 0] (64): cnt=[2, 0, 0]\n sm += 1 # (57): sm=1 (65): sm=2\n\n if sm == x + y: # (58): NO CHANGE (66): NO CHANGE\n break # (67): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " from heapq import heappush, heappop\n \n x, y, a, b, c = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n hp = []\n for e in p:\n heappush(hp, [-e, 0])\n for e in q:\n heappush(hp, [-e, 1])\n for e in r:\n heappush(hp, [-e, 2])\n \n ans = 0\n cnt = [0] * 3\n sm = 0\n-mx = [c, x, y]\n+mx = [x, y, c]\n while hp:\n yum, col = heappop(hp)\n yum = -yum\n \n if cnt[col] >= mx[col]:\n continue\n \n ans += yum\n cnt[col] += 1\n sm += 1\n \n if sm == x + y:\n break\n \n print(ans)\n \n", "FL_content": " from heapq import heappush, heappop\n \n x, y, a, b, c = map(int, input().split())\n p = list(map(int, input().split()))\n q = list(map(int, input().split()))\n r = list(map(int, input().split()))\n \n hp = []\n for e in p:\n heappush(hp, [-e, 0])\n for e in q:\n heappush(hp, [-e, 1])\n for e in r:\n heappush(hp, [-e, 2])\n \n ans = 0\n cnt = [0] * 3\n sm = 0\n-mx = [c, x, y]\n while hp:\n yum, col = heappop(hp)\n yum = -yum\n \n if cnt[col] >= mx[col]:\n continue\n \n ans += yum\n cnt[col] += 1\n sm += 1\n \n if sm == x + y:\n break\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 35 }, { "user_id": "u057109575", "problem_id": "p04017", "submission1_id": "s794469614", "submission2_id": "s398610051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfrom bisect import bisect_left, bisect_right\n\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\nQ = int(input())\nY = [list(map(int, input().split())) for _ in range(Q)]\n\nLOGN = int(math.log(N) / math.log(2)) + 1\nparent = [[-1] * N for _ in range(LOGN + 1)]\n\n\nfor k in range(LOGN + 1):\n for i in range(N):\n if k == 0:\n parent[k][i] = bisect_right(X, X[i] + L) - 1\n else:\n parent[k][i] = parent[k - 1][parent[k - 1][i]]\n\nfor a, b in Y:\n a -= 1\n b -= 1\n if a > b:\n a, b = b, a\n i = bisect_left([parent[j][a] for j in range(LOGN + 1)], b)\n print(2 ** i)\n", "code2": "import math\nfrom bisect import bisect_left, bisect_right\n\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\nQ = int(input())\nY = [list(map(int, input().split())) for _ in range(Q)]\n\nLOGN = int(math.log(N) / math.log(2)) + 1\nparent = [[-1] * N for _ in range(LOGN + 1)]\n\n\nfor k in range(LOGN + 1):\n for i in range(N):\n if k == 0:\n parent[k][i] = bisect_right(X, X[i] + L) - 1\n else:\n parent[k][i] = parent[k - 1][parent[k - 1][i]]\n\ndef find(a, b):\n num = 0\n u = a\n while True:\n k = 0\n for i in range(LOGN + 1):\n if parent[i][u] >= b:\n k = i\n break\n \n if k == 0:\n num += 1\n break\n num += pow(2, k - 1)\n u = parent[k - 1][u]\n \n return num\n\nfor a, b in Y:\n a -= 1\n b -= 1\n if a > b:\n a, b = b, a\n print(find(a, b))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587435143", "date2": "1587436063", "bleu_score": "0.6664473279655755", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 55, "total_score": 101, "input": "9\n1 3 6 13 23 18 19 29 31\n12\n2\n1 8\n2 5\n9 7\n6 7\n", "actual_output": "4\n2\n", "expected_output": "3\n2\n\n", "anno_code": ["import math\nfrom bisect import bisect_left, bisect_right\n\nN = int(input()) # (0): N=9\nX = list(map(int, input().split())) # (1): X=[1, 3, 6, 13, 23, 18, 19, 29, 31]\nL = int(input()) # (2): L=12\nQ = int(input()) # (3): Q=2\nY = [list(map(int, input().split())) for _ in range(Q)] # (4): Y\n\nLOGN = int(math.log(N) / math.log(2)) + 1 # (5): LOGN=4\nparent = [[-1] * N for _ in range(LOGN + 1)] # (6): parent\n\n\nfor k in range(LOGN + 1): # (7): k=0 (36): k=1 ... (152): NO CHANGE\n for i in range(N): # (8): i=0 (11): i=1 ... (151): NO CHANGE\n if k == 0: # (9): NO CHANGE (12): NO CHANGE ... (149): NO CHANGE\n parent[k][i] = bisect_right(X, X[i] + L) - 1 # (10): parent (13): parent ... (34): parent\n else:\n parent[k][i] = parent[k - 1][parent[k - 1][i]] # (39): parent (42): parent ... (150): parent\n\nfor a, b in Y: # (153): a=1, b=8 (159): a=2, b=5\n a -= 1 # (154): a=0 (160): a=1\n b -= 1 # (155): b=7 (161): b=4\n if a > b: # (156): NO CHANGE (162): NO CHANGE\n a, b = b, a\n i = bisect_left([parent[j][a] for j in range(LOGN + 1)], b) # (157): i=2 (163): i=1\n print(2 ** i) # (158): NO CHANGE (164): NO CHANGE\n"], "anno_status": [true], "diff_content": " import math\n from bisect import bisect_left, bisect_right\n \n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n Q = int(input())\n Y = [list(map(int, input().split())) for _ in range(Q)]\n \n LOGN = int(math.log(N) / math.log(2)) + 1\n parent = [[-1] * N for _ in range(LOGN + 1)]\n \n \n for k in range(LOGN + 1):\n for i in range(N):\n if k == 0:\n parent[k][i] = bisect_right(X, X[i] + L) - 1\n else:\n parent[k][i] = parent[k - 1][parent[k - 1][i]]\n \n+def find(a, b):\n+ num = 0\n+ u = a\n+ while True:\n+ k = 0\n+ for i in range(LOGN + 1):\n+ if parent[i][u] >= b:\n+ k = i\n+ break\n+ \n+ if k == 0:\n+ num += 1\n+ break\n+ num += pow(2, k - 1)\n+ u = parent[k - 1][u]\n+ \n+ return num\n+\n for a, b in Y:\n a -= 1\n b -= 1\n if a > b:\n a, b = b, a\n- i = bisect_left([parent[j][a] for j in range(LOGN + 1)], b)\n- print(2 ** i)\n+ print(find(a, b))\n \n", "FL_content": " import math\n from bisect import bisect_left, bisect_right\n \n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n Q = int(input())\n Y = [list(map(int, input().split())) for _ in range(Q)]\n \n LOGN = int(math.log(N) / math.log(2)) + 1\n parent = [[-1] * N for _ in range(LOGN + 1)]\n \n \n for k in range(LOGN + 1):\n for i in range(N):\n if k == 0:\n parent[k][i] = bisect_right(X, X[i] + L) - 1\n else:\n parent[k][i] = parent[k - 1][parent[k - 1][i]]\n \n for a, b in Y:\n a -= 1\n b -= 1\n if a > b:\n a, b = b, a\n- i = bisect_left([parent[j][a] for j in range(LOGN + 1)], b)\n- print(2 ** i)\n \n", "added_lines": 19, "removed_lines": 2, "code1_lines": 28 }, { "user_id": "u905582793", "problem_id": "p04017", "submission1_id": "s448054824", "submission2_id": "s139681535", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nimport sys\ninput = sys.stdin.readline\nn = int(input())\na = list(map(int,input().split()))\nd = int(input())\ngraph = [[0 for i in range(n+1)] for j in range(18)]\nfor i in range(n):\n x = bisect.bisect_right(a,a[i]+d)\n graph[0][i+1] = x\nfor j in range(1,18):\n for i in range(n):\n t = graph[j-1][i+1]\n graph[j][i+1] = graph[j-1][t]\nq = int(input())\nfor _ in range(q):\n x,y = map(int,input().split())\n x,y = min(x,y),max(x,y)\n ans = 0\n for j in range(18)[::-1]:\n if graph[j][x] <= y:\n ans += 2**j\n x = graph[j][x]\n if j == 0 and x < y:\n ans += 1\n print(ans)", "code2": "import bisect\nimport sys\ninput = sys.stdin.readline\nn = int(input())\na = list(map(int,input().split()))\nd = int(input())\ngraph = [[0 for i in range(n+1)] for j in range(18)]\nfor i in range(n):\n x = bisect.bisect_right(a,a[i]+d)\n graph[0][i+1] = x\nfor j in range(1,18):\n for i in range(n):\n t = graph[j-1][i+1]\n graph[j][i+1] = graph[j-1][t]\nq = int(input())\nfor _ in range(q):\n x,y = map(int,input().split())\n x,y = min(x,y),max(x,y)\n ans = 0\n for j in range(18)[::-1]:\n if graph[j][x] < y:\n ans += 2**j\n x = graph[j][x]\n if j == 0 and x < y:\n ans += 1\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586885834", "date2": "1586885968", "bleu_score": "0.9958204057185558", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 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, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 75, "total_score": 101, "input": "9\n1 3 6 13 23 18 19 29 31\n10\n2\n1 9\n7 2\n10 7\n8 10\n", "actual_output": "262143\n2\n", "expected_output": "5\n2\n\n", "anno_code": ["import bisect\nimport sys\ninput = sys.stdin.readline # (0): input=\nn = int(input()) # (1): n=9\na = list(map(int,input().split())) # (2): a=[1, 3, 6, 13, 23, 18, 19, 29, 31]\nd = int(input()) # (3): d=10\ngraph = [[0 for i in range(n+1)] for j in range(18)] # (4): graph\nfor i in range(n): # (5): i=0 (8): i=1 ... (32): NO CHANGE\n x = bisect.bisect_right(a,a[i]+d) # (6): x=3 (9): x=4 ... (30): NO CHANGE\n graph[0][i+1] = x # (7): graph (10): graph ... (31): graph\nfor j in range(1,18): # (33): j=1 (62): j=2 ... (526): NO CHANGE\n for i in range(n): # (34): i=0 (37): i=1 ... (525): NO CHANGE\n t = graph[j-1][i+1] # (35): t=3 (38): t=4 ... (523): NO CHANGE\n graph[j][i+1] = graph[j-1][t] # (36): graph (39): graph ... (524): graph\nq = int(input()) # (527): q=2\nfor _ in range(q): # (528): _=0 (624): _=1\n x,y = map(int,input().split()) # (529): x=1, y=9 (625): x=7, y=2\n x,y = min(x,y),max(x,y) # (530): NO CHANGE (626): x=2, y=7\n ans = 0 # (531): ans=0 (627): ans=0\n for j in range(18)[::-1]: # (532): NO CHANGE (537): j=16 ... (684): NO CHANGE\n if graph[j][x] <= y: # (533): NO CHANGE (538): NO CHANGE ... (682): NO CHANGE\n ans += 2**j # (534): ans=131072 (539): ans=196608 ... (678): ans=2\n x = graph[j][x] # (535): x=9 (540): NO CHANGE ... (679): x=7\n if j == 0 and x < y: # (536): NO CHANGE (541): NO CHANGE ... (683): NO CHANGE\n ans += 1\n print(ans) # (623): NO CHANGE (685): NO CHANGE\n"], "anno_status": [true], "diff_content": " import bisect\n import sys\n input = sys.stdin.readline\n n = int(input())\n a = list(map(int,input().split()))\n d = int(input())\n graph = [[0 for i in range(n+1)] for j in range(18)]\n for i in range(n):\n x = bisect.bisect_right(a,a[i]+d)\n graph[0][i+1] = x\n for j in range(1,18):\n for i in range(n):\n t = graph[j-1][i+1]\n graph[j][i+1] = graph[j-1][t]\n q = int(input())\n for _ in range(q):\n x,y = map(int,input().split())\n x,y = min(x,y),max(x,y)\n ans = 0\n for j in range(18)[::-1]:\n- if graph[j][x] <= y:\n+ if graph[j][x] < y:\n ans += 2**j\n x = graph[j][x]\n if j == 0 and x < y:\n ans += 1\n print(ans)\n", "FL_content": " import bisect\n import sys\n input = sys.stdin.readline\n n = int(input())\n a = list(map(int,input().split()))\n d = int(input())\n graph = [[0 for i in range(n+1)] for j in range(18)]\n for i in range(n):\n x = bisect.bisect_right(a,a[i]+d)\n graph[0][i+1] = x\n for j in range(1,18):\n for i in range(n):\n t = graph[j-1][i+1]\n graph[j][i+1] = graph[j-1][t]\n q = int(input())\n for _ in range(q):\n x,y = map(int,input().split())\n x,y = min(x,y),max(x,y)\n ans = 0\n for j in range(18)[::-1]:\n- if graph[j][x] <= y:\n ans += 2**j\n x = graph[j][x]\n if j == 0 and x < y:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 26 }, { "user_id": "u316386814", "problem_id": "p04017", "submission1_id": "s358030975", "submission2_id": "s033749119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**7)\nINF = 10 ** 18\nMOD = 10 ** 9 + 7\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul)\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n for _ in range(int.bit_length(N - 1) + 1):\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while a < b - 1:\n u = bisect(Unreachs[a], b) - 1\n ans += 2 ** u\n a = Unreachs[a][u]\n ans += 1\n print(ans)\n return 0\n\nmain()", "code2": "import sys\nsys.setrecursionlimit(10**7)\nINF = 10 ** 18\nMOD = 10 ** 9 + 7\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul)\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n updated = True\n while updated:\n updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n k = bisect(Unreachs[a], b) - 1\n if k < 0:\n ans += 1\n break\n ans += 2 ** k\n a = Unreachs[a][k] - 1\n print(ans)\n return 0\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553548698", "date2": "1553632088", "bleu_score": "0.8740640234443797", "code1_test_status": [1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 32, "total_score": 101, "input": "9\n1 3 6 13 23 18 19 29 31\n10\n2\n1 8\n7 3\n9 7\n8 5\n", "actual_output": "3.5\n2.5\n", "expected_output": "4\n2\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\nINF = 10 ** 18 # (1): INF=1000000000000000000\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007, partial=, reduce=, mul=\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul) # (3): prod=functools.partial(, ), LI=, LI_=, LF=, LS=, II=, SI=, bisect=\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main(): # (4): main=\n N = II() # (6): N=9\n X = LI() # (7): X=[1, 3, 6, 13, 23, 18, 19, 29, 31]\n X.append(INF) # (8): X=[1, 3, 6, 13, 23, 18, 19, 29, 31, 1000000000000000000]\n L = II() # (9): L=10\n Q = II() # (10): Q=2\n AB = [] # (11): AB=[]\n for _ in range(Q): # (12): _=0 (14): _=1 (16): NO CHANGE\n AB.append(LI_()) # (13): AB (15): AB\n Unreachs = [[] for _ in range(N)] # (17): Unreachs\n \n for i, x in enumerate(X[:-1]): # (18): i=0, x=1 (21): Unreachs, i=1, x=3 ... (45): NO CHANGE\n u = bisect(X, x + L) # (19): u=3 (22): Unreachs, u=4 ... (43): Unreachs\n Unreachs[i].append(u) # (20): Unreachs (23): Unreachs ... (44): Unreachs\n \n for _ in range(int.bit_length(N - 1) + 1): # (46): _=0 (75): _=1 ... (191): NO CHANGE\n for i in range(N): # (47): i=0 (50): Unreachs, i=1 ... (190): NO CHANGE\n u = Unreachs[Unreachs[i][-1] - 1][-1] # (48): u=4 (51): Unreachs, u=7 ... (188): Unreachs\n Unreachs[i].append(u) # (49): Unreachs (52): Unreachs ... (189): Unreachs\n \n for a, b in AB: # (192): a=0, b=7 (206): a=6, b=2\n if a > b: # (193): NO CHANGE (207): NO CHANGE\n a, b = b, a # (208): a=2, b=6\n ans = 0 # (194): ans=0 (209): ans=0\n while a < b - 1: # (195): NO CHANGE (199): NO CHANGE ... (218): NO CHANGE\n u = bisect(Unreachs[a], b) - 1 # (196): u=1 (200): u=-1 ... (215): u=-1\n ans += 2 ** u # (197): ans=2 (201): ans=2.5 ... (216): ans=1.5\n a = Unreachs[a][u] # (198): a=4 (202): a=9 ... (217): a=9\n ans += 1 # (204): ans=3.5 (219): ans=2.5\n print(ans) # (205): NO CHANGE (220): NO CHANGE\n return 0\n\nmain() # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(10**7)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n from functools import partial, reduce\n from operator import mul\n prod = partial(reduce, mul)\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def II(): return int(sys.stdin.readline())\n def SI(): return input()\n \n from bisect import bisect\n \n def main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n- for _ in range(int.bit_length(N - 1) + 1):\n+ updated = True\n+ while updated:\n+ updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n+ updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n- while a < b - 1:\n- u = bisect(Unreachs[a], b) - 1\n- ans += 2 ** u\n- a = Unreachs[a][u]\n- ans += 1\n+ while True:\n+ k = bisect(Unreachs[a], b) - 1\n+ if k < 0:\n+ ans += 1\n+ break\n+ ans += 2 ** k\n+ a = Unreachs[a][k] - 1\n print(ans)\n return 0\n \n main()\n", "FL_content": " import sys\n sys.setrecursionlimit(10**7)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n from functools import partial, reduce\n from operator import mul\n prod = partial(reduce, mul)\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def II(): return int(sys.stdin.readline())\n def SI(): return input()\n \n from bisect import bisect\n \n def main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n- for _ in range(int.bit_length(N - 1) + 1):\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n- while a < b - 1:\n- u = bisect(Unreachs[a], b) - 1\n- ans += 2 ** u\n- a = Unreachs[a][u]\n- ans += 1\n print(ans)\n return 0\n \n main()\n", "added_lines": 11, "removed_lines": 6, "code1_lines": 49 }, { "user_id": "u803848678", "problem_id": "p04017", "submission1_id": "s120109688", "submission2_id": "s255358959", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nfrom bisect import bisect\n\nn = int(input())\nx = list(map(int, input().split()))\nl = int(input())\n\nm = 20\npar = [[-1]*n for i in range(m)]\n\nfor i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n\nfor i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n\ndef hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1<= y:\n k += 1< b:\n a,b = b,a\n print(hoge(a,b))", "code2": "import sys\ninput = sys.stdin.readline\n\nfrom bisect import bisect\n\nn = int(input())\nx = list(map(int, input().split()))\nl = int(input())\n\nm = 20\npar = [[-1]*n for i in range(m)]\n\nfor i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n\nfor i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n\ndef hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1< b:\n a,b = b,a\n print(hoge(a,b))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570063737", "date2": "1570064033", "bleu_score": "0.9037913901984618", "code1_test_status": [0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 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, 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], "code1_test_score": 15, "total_score": 101, "input": "9\n1 3 6 13 23 19 19 29 31\n10\n4\n1 9\n7 6\n6 7\n8 1\n", "actual_output": "5\n1\n1\n3\n", "expected_output": "5\n1\n1\n4\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, bisect=\n\nfrom bisect import bisect\n\nn = int(input()) # (1): n=9\nx = list(map(int, input().split())) # (2): x=[1, 3, 6, 13, 23, 19, 19, 29, 31]\nl = int(input()) # (3): l=10\n\nm = 20 # (4): m=20\npar = [[-1]*n for i in range(m)] # (5): par\n\nfor i in range(n): # (6): i=0 (9): i=1 ... (33): NO CHANGE\n j = bisect(x, x[i]+l)-1 # (7): j=2 (10): j=3 ... (31): NO CHANGE\n par[0][i] = j # (8): par (11): par ... (32): par\n\nfor i in range(m-1): # (34): i=0 (54): i=1 ... (414): NO CHANGE\n for j in range(n): # (35): j=0 (37): j=1 ... (413): NO CHANGE\n par[i+1][j]=par[i][par[i][j]] # (36): par (38): par ... (412): par\n\ndef hoge(x, y): # (415): hoge=\n k = 0 # (423): k=0 (493): k=0 ... (630): k=0\n for i in range(m)[::-1]: # (424): i=19 (427): i=18 ... (693): sys=, input=, bisect=, n=9, x=[1, 3, 6, 13, 23, 19, 19, 29, 31], l=10, m=20, par=[[2, 3, 3, 6, 8, 7, 7, 8, 8], [3, 6, 6, 7, 8, 8, 8, 8, 8], [7, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8]], i=3, j=8, hoge=, q=4, ans=[], a=0, b=7\n if par[i][x] < y: # (425): NO CHANGE (428): NO CHANGE ... (690): NO CHANGE\n k += 1<= y: # (426): NO CHANGE (429): NO CHANGE ... (684): NO CHANGE\n k += 1< b: # (421): NO CHANGE (490): NO CHANGE ... (627): NO CHANGE\n a,b = b,a # (491): a=5, b=6 (628): a=0, b=7\n print(hoge(a,b)) # (422): x=0, y=8 (492): x=5, y=6 ... (629): x=0, y=7\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n from bisect import bisect\n \n n = int(input())\n x = list(map(int, input().split()))\n l = int(input())\n \n m = 20\n par = [[-1]*n for i in range(m)]\n \n for i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n \n for i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n \n def hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1<= y:\n- k += 1< b:\n a,b = b,a\n print(hoge(a,b))\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n from bisect import bisect\n \n n = int(input())\n x = list(map(int, input().split()))\n l = int(input())\n \n m = 20\n par = [[-1]*n for i in range(m)]\n \n for i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n \n for i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n \n def hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1<= y:\n- k += 1< b:\n a,b = b,a\n print(hoge(a,b))\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 38 }, { "user_id": "u316386814", "problem_id": "p04017", "submission1_id": "s129561496", "submission2_id": "s033749119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**7)\nINF = 10 ** 18\nMOD = 10 ** 9 + 7\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul)\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n for _ in range(int.bit_length(N - 1) + 1):\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n u = bisect(Unreachs[a], b) - 1\n if u == -1:\n break\n ans += 2 ** u\n a = Unreachs[a][u]\n ans += 1\n print(ans)\n return 0\n\nmain()", "code2": "import sys\nsys.setrecursionlimit(10**7)\nINF = 10 ** 18\nMOD = 10 ** 9 + 7\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul)\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n updated = True\n while updated:\n updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n k = bisect(Unreachs[a], b) - 1\n if k < 0:\n ans += 1\n break\n ans += 2 ** k\n a = Unreachs[a][k] - 1\n print(ans)\n return 0\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553548942", "date2": "1553632088", "bleu_score": "0.905255085531067", "code1_test_status": [1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 60, "total_score": 101, "input": "9\n1 7 6 13 23 18 19 29 31\n10\n3\n1 8\n7 3\n6 1\n8 10\n", "actual_output": "3\n2\n3\n", "expected_output": "4\n2\n3\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\nINF = 10 ** 18 # (1): INF=1000000000000000000\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007, partial=, reduce=, mul=\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul) # (3): prod=functools.partial(, ), LI=, LI_=, LF=, LS=, II=, SI=, bisect=\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main(): # (4): main=\n N = II() # (6): N=9\n X = LI() # (7): X=[1, 7, 6, 13, 23, 18, 19, 29, 31]\n X.append(INF) # (8): X=[1, 7, 6, 13, 23, 18, 19, 29, 31, 1000000000000000000]\n L = II() # (9): L=10\n Q = II() # (10): Q=3\n AB = [] # (11): AB=[]\n for _ in range(Q): # (12): _=0 (14): _=1 ... (18): NO CHANGE\n AB.append(LI_()) # (13): AB=[[0, 7]] (15): AB (17): AB\n Unreachs = [[] for _ in range(N)] # (19): Unreachs\n \n for i, x in enumerate(X[:-1]): # (20): i=0, x=1 (23): Unreachs, i=1, x=7 ... (47): NO CHANGE\n u = bisect(X, x + L) # (21): u=3 (24): Unreachs, u=4 ... (45): Unreachs\n Unreachs[i].append(u) # (22): Unreachs (25): Unreachs ... (46): Unreachs\n \n for _ in range(int.bit_length(N - 1) + 1): # (48): _=0 (77): _=1 ... (193): NO CHANGE\n for i in range(N): # (49): i=0 (52): Unreachs, i=1 ... (192): NO CHANGE\n u = Unreachs[Unreachs[i][-1] - 1][-1] # (50): u=4 (53): Unreachs, u=7 ... (190): Unreachs\n Unreachs[i].append(u) # (51): Unreachs (54): Unreachs ... (191): Unreachs\n \n for a, b in AB: # (194): a=0, b=7 (208): a=6, b=2 (223): a=5, b=0\n if a > b: # (195): NO CHANGE (209): NO CHANGE (224): NO CHANGE\n a, b = b, a # (210): a=2, b=6 (225): a=0, b=5\n ans = 0 # (196): ans=0 (211): ans=0 (226): ans=0\n while True: # (197): NO CHANGE (202): NO CHANGE ... (232): NO CHANGE\n u = bisect(Unreachs[a], b) - 1 # (198): u=1 (203): u=-1 ... (233): u=-1\n if u == -1: # (199): NO CHANGE (204): NO CHANGE ... (234): NO CHANGE\n break # (205): NO CHANGE (220): NO CHANGE (235): NO CHANGE\n ans += 2 ** u # (200): ans=2 (215): ans=1 (230): ans=2\n a = Unreachs[a][u] # (201): a=4 (216): a=4 (231): a=4\n ans += 1 # (206): ans=3 (221): ans=2 (236): ans=3\n print(ans) # (207): NO CHANGE (222): NO CHANGE (237): NO CHANGE\n return 0\n\nmain() # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(10**7)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n from functools import partial, reduce\n from operator import mul\n prod = partial(reduce, mul)\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def II(): return int(sys.stdin.readline())\n def SI(): return input()\n \n from bisect import bisect\n \n def main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n- for _ in range(int.bit_length(N - 1) + 1):\n+ updated = True\n+ while updated:\n+ updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n+ updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n- u = bisect(Unreachs[a], b) - 1\n- if u == -1:\n+ k = bisect(Unreachs[a], b) - 1\n+ if k < 0:\n+ ans += 1\n break\n- ans += 2 ** u\n- a = Unreachs[a][u]\n- ans += 1\n+ ans += 2 ** k\n+ a = Unreachs[a][k] - 1\n print(ans)\n return 0\n \n main()\n", "FL_content": " import sys\n sys.setrecursionlimit(10**7)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n from functools import partial, reduce\n from operator import mul\n prod = partial(reduce, mul)\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def II(): return int(sys.stdin.readline())\n def SI(): return input()\n \n from bisect import bisect\n \n def main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n- for _ in range(int.bit_length(N - 1) + 1):\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n- u = bisect(Unreachs[a], b) - 1\n- if u == -1:\n break\n- ans += 2 ** u\n- a = Unreachs[a][u]\n- ans += 1\n print(ans)\n return 0\n \n main()\n", "added_lines": 9, "removed_lines": 6, "code1_lines": 51 }, { "user_id": "u803848678", "problem_id": "p04017", "submission1_id": "s205590050", "submission2_id": "s255358959", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nfrom bisect import bisect\n\nn = int(input())\nx = list(map(int, input().split()))\nl = int(input())\n\nm = 20\npar = [[-1]*n for i in range(m)]\n\nfor i in range(n-1):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n\nfor i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n\ndef hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if 0 <= par[i][x] <= y:\n k += 1< b:\n a,b = b,a\n ans.append(hoge(a, b))\n\nprint(*ans, sep=\"\\n\")", "code2": "import sys\ninput = sys.stdin.readline\n\nfrom bisect import bisect\n\nn = int(input())\nx = list(map(int, input().split()))\nl = int(input())\n\nm = 20\npar = [[-1]*n for i in range(m)]\n\nfor i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n\nfor i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n\ndef hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1< b:\n a,b = b,a\n print(hoge(a,b))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570063231", "date2": "1570064033", "bleu_score": "0.9289262955462285", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 49, "total_score": 101, "input": "9\n1 3 6 13 23 18 19 29 31\n12\n2\n1 8\n1 5\n9 7\n6 7\n", "actual_output": "2\n1\n", "expected_output": "3\n2\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, bisect=\n\nfrom bisect import bisect\n\nn = int(input()) # (1): n=9\nx = list(map(int, input().split())) # (2): x=[1, 3, 6, 13, 23, 18, 19, 29, 31]\nl = int(input()) # (3): l=12\n\nm = 20 # (4): m=20\npar = [[-1]*n for i in range(m)] # (5): par\n\nfor i in range(n-1): # (6): i=0 (9): i=1 ... (30): NO CHANGE\n j = bisect(x, x[i]+l)-1 # (7): j=3 (10): NO CHANGE ... (28): NO CHANGE\n par[0][i] = j # (8): par (11): par ... (29): par\n\nfor i in range(m-1): # (31): i=0 (51): i=1 ... (411): NO CHANGE\n for j in range(n): # (32): j=0 (34): j=1 ... (410): NO CHANGE\n par[i+1][j]=par[i][par[i][j]] # (33): par (35): par ... (409): NO CHANGE\n\ndef hoge(x, y): # (412): hoge=\n k = 0 # (420): k=0 (469): k=0\n for i in range(m)[::-1]: # (421): i=19 (423): i=18 ... (512): sys=, input=, bisect=, n=9, x=[1, 3, 6, 13, 23, 18, 19, 29, 31], l=12, m=20, par=[[3, 3, 3, 6, 8, 7, 8, 8, -1], [6, 6, 6, 8, -1, 8, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1, -1, -1]], i=1, j=8, hoge=, q=2, ans=[2, 1], a=0, b=4\n if 0 <= par[i][x] <= y: # (422): NO CHANGE (424): NO CHANGE ... (509): NO CHANGE\n k += 1< b: # (418): NO CHANGE (467): NO CHANGE\n a,b = b,a\n ans.append(hoge(a, b)) # (419): x=0, y=7 (468): x=0, y=4\n\nprint(*ans, sep=\"\\n\")"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n from bisect import bisect\n \n n = int(input())\n x = list(map(int, input().split()))\n l = int(input())\n \n m = 20\n par = [[-1]*n for i in range(m)]\n \n-for i in range(n-1):\n+for i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n \n for i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n \n def hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n- if 0 <= par[i][x] <= y:\n+ if par[i][x] < y:\n k += 1< b:\n a,b = b,a\n- ans.append(hoge(a, b))\n-\n-print(*ans, sep=\"\\n\")\n+ print(hoge(a,b))\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n from bisect import bisect\n \n n = int(input())\n x = list(map(int, input().split()))\n l = int(input())\n \n m = 20\n par = [[-1]*n for i in range(m)]\n \n-for i in range(n-1):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n \n for i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n \n def hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n- if 0 <= par[i][x] <= y:\n k += 1< b:\n a,b = b,a\n- ans.append(hoge(a, b))\n-\n-print(*ans, sep=\"\\n\")\n", "added_lines": 4, "removed_lines": 6, "code1_lines": 38 }, { "user_id": "u119148115", "problem_id": "p04017", "submission1_id": "s659836906", "submission2_id": "s803956332", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef I(): return int(sys.stdin.readline().rstrip())\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n\n\nN = I()\nx = LI()\nL = I()\n\nfrom bisect import bisect_right\n\narrive = [[0]*N for _ in range(30)] \nfor k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\nprint(arrive)\n\n\ndef query(a,b): \n a -= 1\n b -= 1\n ans = 0\n for k in range(29,-1,-1):\n if arrive[k][a] > b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n\n\nQ = I()\nfor i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n", "code2": "import sys\ndef I(): return int(sys.stdin.readline().rstrip())\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n\n\nN = I()\nx = LI()\nL = I()\n\nfrom bisect import bisect_right\n\narrive = [[0]*N for _ in range(30)] \nfor k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\n\n\ndef query(a,b): \n a -= 1\n b -= 1\n ans = 1\n for k in range(29,-1,-1):\n if arrive[k][a] >= b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n\n\nQ = I()\nfor i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597454249", "date2": "1597457525", "bleu_score": "0.9771517462687256", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9\n1 3 6 13 23 18 19 29 31\n10\n2\n1 8\n7 3\n9 10\n8 7\n", "actual_output": "[[2, 3, 3, 6, 8, 6, 7, 8, 8], [3, 6, 6, 7, 8, 7, 8, 8, 8], [7, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8]]\n4\n2\n", "expected_output": "4\n2\n\n", "anno_code": ["import sys\ndef I(): return int(sys.stdin.readline().rstrip())\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n\n\nN = I() # (0): N=9\nx = LI() # (1): x=[1, 3, 6, 13, 23, 18, 19, 29, 31]\nL = I() # (2): L=10, bisect_right=\n\nfrom bisect import bisect_right\n\narrive = [[0]*N for _ in range(30)] # (3): arrive\nfor k in range(30): # (4): k=0 (25): k=1 ... (634): NO CHANGE\n if k == 0: # (5): NO CHANGE (26): NO CHANGE ... (614): NO CHANGE\n for i in range(N): # (6): i=0 (8): i=1 ... (24): NO CHANGE\n arrive[0][i] = bisect_right(x,x[i]+L)-1 # (7): arrive (9): arrive ... (23): arrive\n else:\n for i in range(N): # (27): i=0 (29): i=1 ... (633): NO CHANGE\n arrive[k][i] = arrive[k-1][arrive[k-1][i]] # (28): arrive (30): arrive ... (632): arrive\nprint(arrive) # (635): NO CHANGE\n\n\ndef query(a,b): # (636): query=\n a -= 1 # (642): a=0 (743): a=2\n b -= 1 # (643): b=7 (744): b=6\n ans = 0 # (644): ans=0 (745): ans=0\n for k in range(29,-1,-1): # (645): k=29 (648): k=28 ... (837): NO CHANGE\n if arrive[k][a] > b: # (646): NO CHANGE (649): NO CHANGE ... (835): NO CHANGE\n continue # (647): NO CHANGE (650): NO CHANGE ... (836): NO CHANGE\n else:\n a = arrive[k][a] # (728): a=7 (832): a=6\n ans += 1 << k # (729): ans=4 (833): ans=2\n print(ans) # (737): sys=, I=, MI=, LI=, N=9, x=[1, 3, 6, 13, 23, 18, 19, 29, 31], L=10, bisect_right=, arrive, k=29, i=0, query=, Q=2, a=1, b=8 (838): sys=, I=, MI=, LI=, N=9, x=[1, 3, 6, 13, 23, 18, 19, 29, 31], L=10, bisect_right=, arrive, k=29, i=1, query=, Q=2, a=3, b=7\n\n\nQ = I() # (637): Q=2\nfor i in range(Q): # (638): i=0 (738): i=1\n a,b = MI() # (639): a=1, b=8 (739): a=7, b=3\n if a > b: # (640): NO CHANGE (740): NO CHANGE\n a,b = b,a # (741): a=3, b=7\n query(a,b) # (641): NO CHANGE (742): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n def I(): return int(sys.stdin.readline().rstrip())\n def MI(): return map(int,sys.stdin.readline().rstrip().split())\n def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n \n \n N = I()\n x = LI()\n L = I()\n \n from bisect import bisect_right\n \n arrive = [[0]*N for _ in range(30)] \n for k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\n-print(arrive)\n \n \n def query(a,b): \n a -= 1\n b -= 1\n- ans = 0\n+ ans = 1\n for k in range(29,-1,-1):\n- if arrive[k][a] > b:\n+ if arrive[k][a] >= b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n \n \n Q = I()\n for i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n \n", "FL_content": " import sys\n def I(): return int(sys.stdin.readline().rstrip())\n def MI(): return map(int,sys.stdin.readline().rstrip().split())\n def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n \n \n N = I()\n x = LI()\n L = I()\n \n from bisect import bisect_right\n \n arrive = [[0]*N for _ in range(30)] \n for k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\n-print(arrive)\n \n \n def query(a,b): \n a -= 1\n b -= 1\n- ans = 0\n for k in range(29,-1,-1):\n- if arrive[k][a] > b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n \n \n Q = I()\n for i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 43 }, { "user_id": "u316386814", "problem_id": "p04017", "submission1_id": "s698544930", "submission2_id": "s033749119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**7)\nINF = 10 ** 18\nMOD = 10 ** 9 + 7\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul)\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n updated = True\n while updated:\n updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n k = bisect(Unreachs[a], b) - 1\n if k < 0:\n ans += 1\n break\n ans += 2 ** k\n a = Unreachs[a][k]\n print(ans)\n return 0\n\nmain()", "code2": "import sys\nsys.setrecursionlimit(10**7)\nINF = 10 ** 18\nMOD = 10 ** 9 + 7\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul)\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n updated = True\n while updated:\n updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n k = bisect(Unreachs[a], b) - 1\n if k < 0:\n ans += 1\n break\n ans += 2 ** k\n a = Unreachs[a][k] - 1\n print(ans)\n return 0\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553631634", "date2": "1553632088", "bleu_score": "0.9958929381186296", "code1_test_status": [1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 60, "total_score": 101, "input": "9\n1 7 6 13 23 18 19 29 31\n10\n3\n1 8\n7 3\n6 1\n8 10\n", "actual_output": "3\n2\n3\n", "expected_output": "4\n2\n3\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\nINF = 10 ** 18 # (1): INF=1000000000000000000\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007, partial=, reduce=, mul=\nfrom functools import partial, reduce\nfrom operator import mul\nprod = partial(reduce, mul) # (3): prod=functools.partial(, ), LI=, LI_=, LF=, LS=, II=, SI=, bisect=\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef II(): return int(sys.stdin.readline())\ndef SI(): return input()\n\nfrom bisect import bisect\n\ndef main(): # (4): main=\n N = II() # (6): N=9\n X = LI() # (7): X=[1, 7, 6, 13, 23, 18, 19, 29, 31]\n X.append(INF) # (8): X=[1, 7, 6, 13, 23, 18, 19, 29, 31, 1000000000000000000]\n L = II() # (9): L=10\n Q = II() # (10): Q=3\n AB = [] # (11): AB=[]\n for _ in range(Q): # (12): _=0 (14): _=1 ... (18): NO CHANGE\n AB.append(LI_()) # (13): AB=[[0, 7]] (15): AB (17): AB\n Unreachs = [[] for _ in range(N)] # (19): Unreachs\n \n for i, x in enumerate(X[:-1]): # (20): i=0, x=1 (23): Unreachs, i=1, x=7 ... (47): NO CHANGE\n u = bisect(X, x + L) # (21): u=3 (24): Unreachs, u=4 ... (45): Unreachs\n Unreachs[i].append(u) # (22): Unreachs (25): Unreachs ... (46): Unreachs\n \n updated = True # (48): updated=True\n while updated: # (49): NO CHANGE (88): NO CHANGE ... (205): NO CHANGE\n updated = False # (50): updated=False (89): updated=False ... (167): updated=False\n for i in range(N): # (51): i=0 (55): Unreachs, i=1 ... (204): NO CHANGE\n u = Unreachs[Unreachs[i][-1] - 1][-1] # (52): u=4 (56): Unreachs, u=7 ... (201): Unreachs\n updated = updated or (u != Unreachs[i][-1]) # (53): updated=True (57): Unreachs ... (202): Unreachs\n Unreachs[i].append(u) # (54): Unreachs (58): Unreachs ... (203): Unreachs\n \n for a, b in AB: # (206): a=0, b=7 (220): a=6, b=2 (235): a=5, b=0\n if a > b: # (207): NO CHANGE (221): NO CHANGE (236): NO CHANGE\n a, b = b, a # (222): a=2, b=6 (237): a=0, b=5\n ans = 0 # (208): ans=0 (223): ans=0 (238): ans=0\n while True: # (209): NO CHANGE (214): NO CHANGE ... (244): NO CHANGE\n k = bisect(Unreachs[a], b) - 1 # (210): k=1 (215): k=-1 ... (245): k=-1\n if k < 0: # (211): NO CHANGE (216): NO CHANGE ... (246): NO CHANGE\n ans += 1 # (217): ans=3 (232): ans=2 (247): ans=3\n break # (218): NO CHANGE (233): NO CHANGE (248): NO CHANGE\n ans += 2 ** k # (212): ans=2 (227): ans=1 (242): ans=2\n a = Unreachs[a][k] # (213): a=4 (228): a=4 (243): a=4\n print(ans) # (219): NO CHANGE (234): NO CHANGE (249): NO CHANGE\n return 0\n\nmain() # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(10**7)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n from functools import partial, reduce\n from operator import mul\n prod = partial(reduce, mul)\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def II(): return int(sys.stdin.readline())\n def SI(): return input()\n \n from bisect import bisect\n \n def main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n updated = True\n while updated:\n updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n k = bisect(Unreachs[a], b) - 1\n if k < 0:\n ans += 1\n break\n ans += 2 ** k\n- a = Unreachs[a][k]\n+ a = Unreachs[a][k] - 1\n print(ans)\n return 0\n \n main()\n", "FL_content": " import sys\n sys.setrecursionlimit(10**7)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n from functools import partial, reduce\n from operator import mul\n prod = partial(reduce, mul)\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def II(): return int(sys.stdin.readline())\n def SI(): return input()\n \n from bisect import bisect\n \n def main():\n N = II()\n X = LI() \n X.append(INF) \n L = II() \n Q = II()\n AB = [] \n for _ in range(Q):\n AB.append(LI_())\n Unreachs = [[] for _ in range(N)]\n \n for i, x in enumerate(X[:-1]):\n u = bisect(X, x + L)\n Unreachs[i].append(u)\n \n updated = True\n while updated:\n updated = False\n for i in range(N):\n u = Unreachs[Unreachs[i][-1] - 1][-1]\n updated = updated or (u != Unreachs[i][-1])\n Unreachs[i].append(u)\n \n for a, b in AB:\n if a > b:\n a, b = b, a\n ans = 0\n while True:\n k = bisect(Unreachs[a], b) - 1\n if k < 0:\n ans += 1\n break\n ans += 2 ** k\n- a = Unreachs[a][k]\n print(ans)\n return 0\n \n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 54 }, { "user_id": "u310678820", "problem_id": "p04017", "submission1_id": "s009716954", "submission2_id": "s469979857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from bisect import bisect_right\nN = int(input())\nx = list(map(int, input().split()))\nL = int(input())\nn = N.bit_length()\nnext_hotel = [[0]*n for _ in range(N)]\nfor i in range(N):\n index = bisect_right(x, x[i]+L)-1\n \n next_hotel[i][0] = index\nfor i in range(1, n):\n for j in range(N):\n next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1]\ndef count(a, b):\n if a>b:\n a, b = b, a\n res = 0\n for i in range(n):\n if a == b:\n return res\n c = bisect_right(next_hotel[a], b)-1\n a = next_hotel[a][c]\n res+=2**c\nQ = int(input())\nfor _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))", "code2": "from bisect import bisect_left, bisect_right\nN = int(input())\nx = list(map(int, input().split()))\nL = int(input())\nn = N.bit_length()+1\nnext_hotel = [[0]*n for _ in range(N)]\nfor i in range(N):\n index = bisect_right(x, x[i]+L)-1\n if index == i:\n next_hotel[i][0] = N\n else:\n next_hotel[i][0] = index\nfor i in range(1, n):\n for j in range(N):\n if next_hotel[j][i-1]b:\n a, b = b, a\n res = 0\n for i in range(n):\n if a >= b:\n return res\n c = max(0, bisect_left(next_hotel[a], b)-1)\n a = next_hotel[a][c]\n res+=2**c\nQ = int(input())\nfor _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570066869", "date2": "1570070340", "bleu_score": "0.6985122938977945", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 36, "total_score": 101, "input": "9\n1 3 10 13 15 18 19 29 40\n10\n3\n2 6\n7 2\n6 3\n8 5\n", "actual_output": "None\n2\nNone\n", "expected_output": "2\n2\n1\n\n", "anno_code": ["from bisect import bisect_right\nN = int(input()) # (0): N=9\nx = list(map(int, input().split())) # (1): x=[1, 3, 10, 13, 15, 18, 19, 29, 40]\nL = int(input()) # (2): L=10\nn = N.bit_length() # (3): n=4\nnext_hotel = [[0]*n for _ in range(N)] # (4): next_hotel\nfor i in range(N): # (5): i=0 (8): i=1 ... (32): NO CHANGE\n index = bisect_right(x, x[i]+L)-1 # (6): index=2 (9): index=3 ... (30): index=8\n \n next_hotel[i][0] = index # (7): next_hotel (10): next_hotel ... (31): next_hotel\nfor i in range(1, n): # (33): i=1 (53): i=2 ... (93): NO CHANGE\n for j in range(N): # (34): j=0 (36): j=1 ... (92): NO CHANGE\n next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1] # (35): next_hotel (37): next_hotel ... (91): next_hotel\ndef count(a, b): # (94): count=\n if a>b: # (99): NO CHANGE (125): NO CHANGE (138): NO CHANGE\n a, b = b, a # (126): a=1, b=6 (139): a=2, b=5\n res = 0 # (100): res=0 (127): res=0 (140): res=0\n for i in range(n): # (101): i=0 (106): i=1 ... (161): bisect_right=, N=9, x=[1, 3, 10, 13, 15, 18, 19, 29, 40], L=10, n=4, next_hotel, index=8, j=8, count=, Q=3, _=2, a=6, b=3\n if a == b: # (102): NO CHANGE (107): NO CHANGE ... (157): NO CHANGE\n return res\n c = bisect_right(next_hotel[a], b)-1 # (103): c=0 (108): c=-1 ... (158): NO CHANGE\n a = next_hotel[a][c] # (104): a=3 (109): a=7 ... (159): NO CHANGE\n res+=2**c # (105): res=1 (110): res=1.5 ... (160): res=2.0\nQ = int(input()) # (95): Q=3\nfor _ in range(Q): # (96): _=0 (122): _=1 (135): _=2\n a, b = map(int, input().split()) # (97): a=2, b=6 (123): a=7, b=2 (136): a=6, b=3\n print(count(a-1, b-1)) # (98): a=1, b=5 (124): a=6, b=1 (137): a=5, b=2\n"], "anno_status": [true], "diff_content": "-from bisect import bisect_right\n+from bisect import bisect_left, bisect_right\n N = int(input())\n x = list(map(int, input().split()))\n L = int(input())\n-n = N.bit_length()\n+n = N.bit_length()+1\n next_hotel = [[0]*n for _ in range(N)]\n for i in range(N):\n index = bisect_right(x, x[i]+L)-1\n- \n- next_hotel[i][0] = index\n+ if index == i:\n+ next_hotel[i][0] = N\n+ else:\n+ next_hotel[i][0] = index\n for i in range(1, n):\n for j in range(N):\n- next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1]\n+ if next_hotel[j][i-1]b:\n a, b = b, a\n res = 0\n for i in range(n):\n- if a == b:\n+ if a >= b:\n return res\n- c = bisect_right(next_hotel[a], b)-1\n+ c = max(0, bisect_left(next_hotel[a], b)-1)\n a = next_hotel[a][c]\n res+=2**c\n Q = int(input())\n for _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))\n", "FL_content": "-from bisect import bisect_right\n N = int(input())\n x = list(map(int, input().split()))\n L = int(input())\n-n = N.bit_length()\n next_hotel = [[0]*n for _ in range(N)]\n for i in range(N):\n index = bisect_right(x, x[i]+L)-1\n- \n- next_hotel[i][0] = index\n for i in range(1, n):\n for j in range(N):\n- next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1]\n def count(a, b):\n if a>b:\n a, b = b, a\n res = 0\n for i in range(n):\n- if a == b:\n return res\n- c = bisect_right(next_hotel[a], b)-1\n a = next_hotel[a][c]\n res+=2**c\n Q = int(input())\n for _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))\n", "added_lines": 16, "removed_lines": 7, "code1_lines": 27 }, { "user_id": "u499381410", "problem_id": "p04017", "submission1_id": "s990284860", "submission2_id": "s558827638", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\nfrom operator import mul\n\n\nsys.setrecursionlimit(2147483647)\nINF = 10 ** 20\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\nmod = 1000000007\n\nn = I()\nX = LI()\nl = I()\nlog_n = (n - 1).bit_length()\ndoubling = [[n] * n for _ in range(log_n)]\nfor i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n\nfor j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\nq = I()\nfor _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n if doubling[m][a] <= b:\n a = doubling[m][a]\n ans += 2 ** m\n print(ans)\n\n\n\n\n\n\n", "code2": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\nfrom operator import mul\n\n\nsys.setrecursionlimit(2147483647)\nINF = 10 ** 20\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\nmod = 1000000007\n\nn = I()\nX = LI()\nl = I()\nlog_n = (n - 1).bit_length()\ndoubling = [[n] * n for _ in range(log_n)]\nfor i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n\nfor j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\nq = I()\nfor _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n if doubling[m][a] < b:\n a = doubling[m][a]\n ans += 2 ** m\n print(ans + 1)\n\n\n\n\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587937945", "date2": "1591127643", "bleu_score": "0.9956757615759013", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 49, "total_score": 101, "input": "9\n1 8 6 13 23 18 19 22 31\n10\n2\n1 8\n7 3\n6 7\n5 10\n", "actual_output": "3\n1\n", "expected_output": "3\n2\n\n", "anno_code": ["from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\nfrom operator import mul\n\n\nsys.setrecursionlimit(2147483647) # (0): NO CHANGE\nINF = 10 ** 20 # (1): INF=100000000000000000000, LI=, I=, LS=, S=, IR=, LIR=, SR=, LSR=, SRL=, MSRL=\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\nmod = 1000000007 # (2): mod=1000000007\n\nn = I() # (3): n=9\nX = LI() # (4): X=[1, 8, 6, 13, 23, 18, 19, 22, 31]\nl = I() # (5): l=10\nlog_n = (n - 1).bit_length() # (6): log_n=4\ndoubling = [[n] * n for _ in range(log_n)] # (7): doubling\nfor i in range(n - 1): # (8): i=0 (10): i=1 ... (24): NO CHANGE\n doubling[0][i] = bisect_right(X, X[i] + l) - 1 # (9): doubling (11): doubling ... (23): doubling\n\nfor j in range(1, log_n): # (25): j=1 (54): j=2 ... (112): NO CHANGE\n for k in range(n): # (26): k=0 (29): k=1 ... (111): NO CHANGE\n if doubling[j - 1][k] == n: # (27): NO CHANGE (30): NO CHANGE ... (109): NO CHANGE\n continue # (52): NO CHANGE (69): NO CHANGE ... (110): NO CHANGE\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]] # (28): doubling (31): doubling ... (86): NO CHANGE\nq = I() # (113): q=2\nfor _ in range(q): # (114): _=0 (134): _=1\n a, b = LI() # (115): a=1, b=8 (135): b=3\n if a > b: # (116): NO CHANGE (136): NO CHANGE\n a, b = b, a # (137): a=3, b=7\n a -= 1 # (117): a=0 (138): a=2\n b -= 1 # (118): b=7 (139): b=6\n ans = 0 # (119): ans=0 (140): ans=0\n for m in range(log_n - 1, -1, -1): # (120): m=3 (122): m=2 ... (151): NO CHANGE\n if doubling[m][a] <= b: # (121): NO CHANGE (123): NO CHANGE ... (148): NO CHANGE\n a = doubling[m][a] # (126): a=3 (130): a=7 (149): a=3\n ans += 2 ** m # (127): ans=2 (131): ans=3 (150): ans=1\n print(ans) # (133): NO CHANGE (152): NO CHANGE\n\n\n\n\n\n\n"], "anno_status": [false], "diff_content": " from collections import defaultdict, deque, Counter\n from heapq import heappush, heappop, heapify\n import math\n import bisect\n import random\n from itertools import permutations, accumulate, combinations, product\n import sys\n import string\n from bisect import bisect_left, bisect_right\n from math import factorial, ceil, floor\n from operator import mul\n from functools import reduce\n from operator import mul\n \n \n sys.setrecursionlimit(2147483647)\n INF = 10 ** 20\n def LI(): return list(map(int, sys.stdin.buffer.readline().split()))\n def I(): return int(sys.stdin.buffer.readline())\n def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\n def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n def IR(n): return [I() for i in range(n)]\n def LIR(n): return [LI() for i in range(n)]\n def SR(n): return [S() for i in range(n)]\n def LSR(n): return [LS() for i in range(n)]\n def SRL(n): return [list(S()) for i in range(n)]\n def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\n mod = 1000000007\n \n n = I()\n X = LI()\n l = I()\n log_n = (n - 1).bit_length()\n doubling = [[n] * n for _ in range(log_n)]\n for i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n \n for j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\n q = I()\n for _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n- if doubling[m][a] <= b:\n+ if doubling[m][a] < b:\n a = doubling[m][a]\n ans += 2 ** m\n- print(ans)\n+ print(ans + 1)\n \n \n \n \n \n \n \n", "FL_content": " from collections import defaultdict, deque, Counter\n from heapq import heappush, heappop, heapify\n import math\n import bisect\n import random\n from itertools import permutations, accumulate, combinations, product\n import sys\n import string\n from bisect import bisect_left, bisect_right\n from math import factorial, ceil, floor\n from operator import mul\n from functools import reduce\n from operator import mul\n \n \n sys.setrecursionlimit(2147483647)\n INF = 10 ** 20\n def LI(): return list(map(int, sys.stdin.buffer.readline().split()))\n def I(): return int(sys.stdin.buffer.readline())\n def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\n def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n def IR(n): return [I() for i in range(n)]\n def LIR(n): return [LI() for i in range(n)]\n def SR(n): return [S() for i in range(n)]\n def LSR(n): return [LS() for i in range(n)]\n def SRL(n): return [list(S()) for i in range(n)]\n def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\n mod = 1000000007\n \n n = I()\n X = LI()\n l = I()\n log_n = (n - 1).bit_length()\n doubling = [[n] * n for _ in range(log_n)]\n for i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n \n for j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\n q = I()\n for _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n- if doubling[m][a] <= b:\n a = doubling[m][a]\n ans += 2 ** m\n- print(ans)\n \n \n \n \n \n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 62 }, { "user_id": "u214617707", "problem_id": "p04017", "submission1_id": "s111677964", "submission2_id": "s884346131", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n Y = X[b]\n num = 0\n for j in range(29, -1, -1):\n if X[P[j][a]] <= Y:\n Y -= X[P[j][a]]\n a = P[j][a]\n num += 2 ** j\n if Y <= 0:\n print(num)\n break\n", "code2": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n if a > b:\n a, b = b, a\n a, b = a - 1, b - 1\n num = 0\n for j in range(29, -1, -1):\n if P[j][a] < b:\n a = P[j][a]\n num += 2 ** j\n print(num + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540517557", "date2": "1540519235", "bleu_score": "0.8431252117627474", "code1_test_status": [1, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 33, "total_score": 101, "input": "9\n1 3 6 13 23 18 19 29 31\n10\n2\n1 9\n7 2\n10 7\n8 10\n", "actual_output": "536870912\n2\n", "expected_output": "5\n2\n\n", "anno_code": ["from bisect import bisect_right\nN = int(input()) # (0): N=9\nX = list(map(int, input().split())) # (1): X=[1, 3, 6, 13, 23, 18, 19, 29, 31]\nL = int(input()) # (2): L=10\n\nP = [[0] * N for i in range(30)] # (3): P\nfor i in range(N): # (4): i=0 (7): i=1 ... (31): NO CHANGE\n q = bisect_right(X, X[i] + L) # (5): q=3 (8): q=4 ... (29): NO CHANGE\n P[0][i] = q - 1 # (6): P (9): P ... (30): P\n\nfor i in range(1, 30): # (32): i=1 (52): i=2 ... (612): NO CHANGE\n for j in range(N): # (33): j=0 (35): j=1 ... (611): NO CHANGE\n P[i][j] = P[i - 1][P[i - 1][j]] # (34): P (36): P ... (610): P\n\nQ = int(input()) # (613): Q=2\nfor i in range(Q): # (614): i=0 (628): i=1\n a, b = map(int, input().split()) # (615): a=1, b=9 (629): a=7, b=2\n a, b = a - 1, b - 1 # (616): a=0, b=8 (630): a=6, b=1\n if a > b: # (617): NO CHANGE (631): NO CHANGE\n a, b = b, a # (632): a=1, b=6\n Y = X[b] # (618): Y=31 (633): Y=19\n num = 0 # (619): num=0 (634): num=0\n for j in range(29, -1, -1): # (620): j=29 (635): NO CHANGE ... (719): j=1\n if X[P[j][a]] <= Y: # (621): NO CHANGE (636): NO CHANGE ... (720): NO CHANGE\n Y -= X[P[j][a]] # (622): Y=0 (721): Y=0\n a = P[j][a] # (623): a=8 (722): a=6\n num += 2 ** j # (624): num=536870912 (723): num=2\n if Y <= 0: # (625): NO CHANGE (637): NO CHANGE ... (724): NO CHANGE\n print(num) # (626): NO CHANGE (725): NO CHANGE\n break # (627): NO CHANGE (726): NO CHANGE\n"], "anno_status": [true], "diff_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n+\n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n+ a, b = a - 1, b - 1\n num = 0\n for j in range(29, -1, -1):\n- if X[P[j][a]] <= Y:\n- Y -= X[P[j][a]]\n+ if P[j][a] < b:\n a = P[j][a]\n num += 2 ** j\n- if Y <= 0:\n- print(num)\n- break\n-\n+ print(num + 1)\n", "FL_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n num = 0\n for j in range(29, -1, -1):\n- if X[P[j][a]] <= Y:\n- Y -= X[P[j][a]]\n a = P[j][a]\n num += 2 ** j\n- if Y <= 0:\n- print(num)\n- break\n-\n", "added_lines": 4, "removed_lines": 8, "code1_lines": 31 }, { "user_id": "u310678820", "problem_id": "p04017", "submission1_id": "s921008784", "submission2_id": "s469979857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from bisect import bisect_right\nN = int(input())\nx = list(map(int, input().split()))\nL = int(input())\nn = N.bit_length()\nnext_hotel = [[0]*n for _ in range(N)]\nfor i in range(N):\n index = bisect_right(x, x[i]+L)-1\n \n next_hotel[i][0] = index\nfor i in range(1, n):\n for j in range(N):\n next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1]\ndef count(a, b):\n if a>b:\n a, b = b, a\n res = 0\n for i in range(n):\n if a >= b:\n return res\n c = max(bisect_right(next_hotel[a], b)-1, 0)\n a = next_hotel[a][c]\n res+=2**c\nQ = int(input())\nfor _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))", "code2": "from bisect import bisect_left, bisect_right\nN = int(input())\nx = list(map(int, input().split()))\nL = int(input())\nn = N.bit_length()+1\nnext_hotel = [[0]*n for _ in range(N)]\nfor i in range(N):\n index = bisect_right(x, x[i]+L)-1\n if index == i:\n next_hotel[i][0] = N\n else:\n next_hotel[i][0] = index\nfor i in range(1, n):\n for j in range(N):\n if next_hotel[j][i-1]b:\n a, b = b, a\n res = 0\n for i in range(n):\n if a >= b:\n return res\n c = max(0, bisect_left(next_hotel[a], b)-1)\n a = next_hotel[a][c]\n res+=2**c\nQ = int(input())\nfor _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570067336", "date2": "1570070340", "bleu_score": "0.7045616589933031", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 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, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 75, "total_score": 101, "input": "9\n1 3 6 13 23 19 19 29 31\n10\n1\n1 9\n7 3\n6 7\n8 5\n", "actual_output": "8\n", "expected_output": "5\n\n", "anno_code": ["from bisect import bisect_right\nN = int(input()) # (0): N=9\nx = list(map(int, input().split())) # (1): x=[1, 3, 6, 13, 23, 19, 19, 29, 31]\nL = int(input()) # (2): L=10\nn = N.bit_length() # (3): n=4\nnext_hotel = [[0]*n for _ in range(N)] # (4): next_hotel\nfor i in range(N): # (5): i=0 (8): i=1 ... (32): NO CHANGE\n index = bisect_right(x, x[i]+L)-1 # (6): index=2 (9): index=3 ... (30): NO CHANGE\n \n next_hotel[i][0] = index # (7): next_hotel (10): next_hotel ... (31): next_hotel\nfor i in range(1, n): # (33): i=1 (53): i=2 ... (93): NO CHANGE\n for j in range(N): # (34): j=0 (36): j=1 ... (92): NO CHANGE\n next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1] # (35): next_hotel (37): next_hotel ... (91): next_hotel\ndef count(a, b): # (94): count=\n if a>b: # (99): NO CHANGE\n a, b = b, a\n res = 0 # (100): res=0\n for i in range(n): # (101): i=0 (106): i=1\n if a >= b: # (102): NO CHANGE (107): bisect_right=, N=9, x=[1, 3, 6, 13, 23, 19, 19, 29, 31], L=10, n=4, next_hotel, i=3, index=8, j=8, count=, Q=1, _=0, a=1, b=9\n return res\n c = max(bisect_right(next_hotel[a], b)-1, 0) # (103): c=3\n a = next_hotel[a][c] # (104): a=8\n res+=2**c # (105): res=8\nQ = int(input()) # (95): Q=1\nfor _ in range(Q): # (96): _=0\n a, b = map(int, input().split()) # (97): a=1, b=9\n print(count(a-1, b-1)) # (98): a=0, b=8\n"], "anno_status": [true], "diff_content": "-from bisect import bisect_right\n+from bisect import bisect_left, bisect_right\n N = int(input())\n x = list(map(int, input().split()))\n L = int(input())\n-n = N.bit_length()\n+n = N.bit_length()+1\n next_hotel = [[0]*n for _ in range(N)]\n for i in range(N):\n index = bisect_right(x, x[i]+L)-1\n- \n- next_hotel[i][0] = index\n+ if index == i:\n+ next_hotel[i][0] = N\n+ else:\n+ next_hotel[i][0] = index\n for i in range(1, n):\n for j in range(N):\n- next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1]\n+ if next_hotel[j][i-1]b:\n a, b = b, a\n res = 0\n for i in range(n):\n if a >= b:\n return res\n- c = max(bisect_right(next_hotel[a], b)-1, 0)\n+ c = max(0, bisect_left(next_hotel[a], b)-1)\n a = next_hotel[a][c]\n res+=2**c\n Q = int(input())\n for _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))\n", "FL_content": "-from bisect import bisect_right\n N = int(input())\n x = list(map(int, input().split()))\n L = int(input())\n-n = N.bit_length()\n next_hotel = [[0]*n for _ in range(N)]\n for i in range(N):\n index = bisect_right(x, x[i]+L)-1\n- \n- next_hotel[i][0] = index\n for i in range(1, n):\n for j in range(N):\n- next_hotel[j][i] = next_hotel[next_hotel[j][i-1]][i-1]\n def count(a, b):\n if a>b:\n a, b = b, a\n res = 0\n for i in range(n):\n if a >= b:\n return res\n- c = max(bisect_right(next_hotel[a], b)-1, 0)\n a = next_hotel[a][c]\n res+=2**c\n Q = int(input())\n for _ in range(Q):\n a, b = map(int, input().split())\n print(count(a-1, b-1))\n", "added_lines": 15, "removed_lines": 6, "code1_lines": 27 }, { "user_id": "u214617707", "problem_id": "p04017", "submission1_id": "s380789604", "submission2_id": "s884346131", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n Y = X[b]\n num = 0\n for j in range(29, -1, -1):\n if X[P[j][a]] <= Y:\n Y -= X[P[j][a]]\n num += 2 ** j\n if Y <= 0:\n print(num)\n break", "code2": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n if a > b:\n a, b = b, a\n a, b = a - 1, b - 1\n num = 0\n for j in range(29, -1, -1):\n if P[j][a] < b:\n a = P[j][a]\n num += 2 ** j\n print(num + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540518215", "date2": "1540519235", "bleu_score": "0.8740834893454136", "code1_test_status": [1, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 33, "total_score": 101, "input": "9\n1 8 6 13 23 18 19 22 31\n10\n2\n1 8\n7 3\n6 7\n5 10\n", "actual_output": "", "expected_output": "3\n2\n\n", "anno_code": ["from bisect import bisect_right\nN = int(input()) # (0): N=9\nX = list(map(int, input().split())) # (1): X=[1, 8, 6, 13, 23, 18, 19, 22, 31]\nL = int(input()) # (2): L=10\n\nP = [[0] * N for i in range(30)] # (3): P\nfor i in range(N): # (4): i=0 (7): i=1 ... (31): NO CHANGE\n q = bisect_right(X, X[i] + L) # (5): q=3 (8): q=4 ... (29): NO CHANGE\n P[0][i] = q - 1 # (6): P (9): P ... (30): P\n\nfor i in range(1, 30): # (32): i=1 (52): i=2 ... (612): NO CHANGE\n for j in range(N): # (33): j=0 (35): j=1 ... (611): NO CHANGE\n P[i][j] = P[i - 1][P[i - 1][j]] # (34): P (36): P ... (610): P\n\n\nQ = int(input()) # (613): Q=2\nfor i in range(Q): # (614): i=0 (715): i=1\n a, b = map(int, input().split()) # (615): a=1, b=8 (716): a=7, b=3\n a, b = a - 1, b - 1 # (616): a=0, b=7 (717): a=6, b=2\n if a > b: # (617): NO CHANGE (718): NO CHANGE\n a, b = b, a # (719): a=2, b=6\n Y = X[b] # (618): Y=22 (720): Y=19\n num = 0 # (619): num=0 (721): num=0\n for j in range(29, -1, -1): # (620): j=29 (623): j=28 ... (814): NO CHANGE\n if X[P[j][a]] <= Y: # (621): NO CHANGE (624): NO CHANGE ... (810): NO CHANGE\n Y -= X[P[j][a]] # (706): Y=9 (711): Y=3 (811): Y=6\n num += 2 ** j # (707): num=2 (712): num=3 (812): num=1\n if Y <= 0: # (622): NO CHANGE (625): NO CHANGE ... (813): NO CHANGE\n print(num)\n break"], "anno_status": [true], "diff_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n \n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n+ a, b = a - 1, b - 1\n num = 0\n for j in range(29, -1, -1):\n- if X[P[j][a]] <= Y:\n- Y -= X[P[j][a]]\n+ if P[j][a] < b:\n+ a = P[j][a]\n num += 2 ** j\n- if Y <= 0:\n- print(num)\n- break\n+ print(num + 1)\n", "FL_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n \n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n num = 0\n for j in range(29, -1, -1):\n- if X[P[j][a]] <= Y:\n- Y -= X[P[j][a]]\n num += 2 ** j\n- if Y <= 0:\n- print(num)\n- break\n", "added_lines": 4, "removed_lines": 7, "code1_lines": 30 }, { "user_id": "u499381410", "problem_id": "p04017", "submission1_id": "s627752703", "submission2_id": "s558827638", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\nfrom operator import mul\n\n\nsys.setrecursionlimit(2147483647)\nINF = 10 ** 20\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\nmod = 1000000007\n\nn = I()\nX = LI()\nl = I()\nlog_n = (n - 1).bit_length()\ndoubling = [[n] * n for _ in range(log_n)]\nfor i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n\nfor j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\nq = I()\nprint(doubling)\nfor _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n if doubling[m][a] <= b:\n a = doubling[m][a]\n ans += 2 ** m\n print(ans)\n\n\n\n\n\n\n", "code2": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\nfrom operator import mul\n\n\nsys.setrecursionlimit(2147483647)\nINF = 10 ** 20\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\nmod = 1000000007\n\nn = I()\nX = LI()\nl = I()\nlog_n = (n - 1).bit_length()\ndoubling = [[n] * n for _ in range(log_n)]\nfor i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n\nfor j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\nq = I()\nfor _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n if doubling[m][a] < b:\n a = doubling[m][a]\n ans += 2 ** m\n print(ans + 1)\n\n\n\n\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587937870", "date2": "1591127643", "bleu_score": "0.9875690339183749", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9\n1 3 6 13 15 15 19 29 31\n10\n2\n1 4\n7 3\n1 2\n5 5\n", "actual_output": "[[2, 3, 5, 6, 6, 6, 7, 8, 9], [5, 6, 6, 7, 7, 7, 8, 9, 9], [7, 8, 8, 9, 9, 9, 9, 9, 9], [9, 9, 9, 9, 9, 9, 9, 9, 9]]\n1\n2\n", "expected_output": "2\n2\n\n", "anno_code": ["from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\nfrom operator import mul\n\n\nsys.setrecursionlimit(2147483647) # (0): NO CHANGE\nINF = 10 ** 20 # (1): INF=100000000000000000000, LI=, I=, LS=, S=, IR=, LIR=, SR=, LSR=, SRL=, MSRL=\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\ndef I(): return int(sys.stdin.buffer.readline())\ndef LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\ndef S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\nmod = 1000000007 # (2): mod=1000000007\n\nn = I() # (3): n=9\nX = LI() # (4): X=[1, 3, 6, 13, 15, 15, 19, 29, 31]\nl = I() # (5): l=10\nlog_n = (n - 1).bit_length() # (6): log_n=4\ndoubling = [[n] * n for _ in range(log_n)] # (7): doubling\nfor i in range(n - 1): # (8): i=0 (10): i=1 ... (24): NO CHANGE\n doubling[0][i] = bisect_right(X, X[i] + l) - 1 # (9): doubling (11): doubling ... (23): doubling\n\nfor j in range(1, log_n): # (25): j=1 (54): j=2 ... (112): NO CHANGE\n for k in range(n): # (26): k=0 (29): k=1 ... (111): NO CHANGE\n if doubling[j - 1][k] == n: # (27): NO CHANGE (30): NO CHANGE ... (109): NO CHANGE\n continue # (52): NO CHANGE (78): NO CHANGE ... (110): NO CHANGE\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]] # (28): doubling (31): doubling ... (92): NO CHANGE\nq = I() # (113): q=2\nprint(doubling) # (114): NO CHANGE\nfor _ in range(q): # (115): _=0 (133): _=1\n a, b = LI() # (116): a=1, b=4 (134): a=7\n if a > b: # (117): NO CHANGE (135): NO CHANGE\n a, b = b, a # (136): a=3, b=7\n a -= 1 # (118): a=0 (137): a=2\n b -= 1 # (119): b=3 (138): b=6\n ans = 0 # (120): ans=0 (139): ans=0\n for m in range(log_n - 1, -1, -1): # (121): m=3 (123): m=2 ... (150): NO CHANGE\n if doubling[m][a] <= b: # (122): NO CHANGE (124): NO CHANGE ... (149): NO CHANGE\n a = doubling[m][a] # (129): a=2 (146): a=6\n ans += 2 ** m # (130): ans=1 (147): ans=2\n print(ans) # (132): NO CHANGE (151): NO CHANGE\n\n\n\n\n\n\n"], "anno_status": [false], "diff_content": " from collections import defaultdict, deque, Counter\n from heapq import heappush, heappop, heapify\n import math\n import bisect\n import random\n from itertools import permutations, accumulate, combinations, product\n import sys\n import string\n from bisect import bisect_left, bisect_right\n from math import factorial, ceil, floor\n from operator import mul\n from functools import reduce\n from operator import mul\n \n \n sys.setrecursionlimit(2147483647)\n INF = 10 ** 20\n def LI(): return list(map(int, sys.stdin.buffer.readline().split()))\n def I(): return int(sys.stdin.buffer.readline())\n def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\n def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n def IR(n): return [I() for i in range(n)]\n def LIR(n): return [LI() for i in range(n)]\n def SR(n): return [S() for i in range(n)]\n def LSR(n): return [LS() for i in range(n)]\n def SRL(n): return [list(S()) for i in range(n)]\n def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\n mod = 1000000007\n \n n = I()\n X = LI()\n l = I()\n log_n = (n - 1).bit_length()\n doubling = [[n] * n for _ in range(log_n)]\n for i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n \n for j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\n q = I()\n-print(doubling)\n for _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n- if doubling[m][a] <= b:\n+ if doubling[m][a] < b:\n a = doubling[m][a]\n ans += 2 ** m\n- print(ans)\n+ print(ans + 1)\n \n \n \n \n \n \n \n", "FL_content": " from collections import defaultdict, deque, Counter\n from heapq import heappush, heappop, heapify\n import math\n import bisect\n import random\n from itertools import permutations, accumulate, combinations, product\n import sys\n import string\n from bisect import bisect_left, bisect_right\n from math import factorial, ceil, floor\n from operator import mul\n from functools import reduce\n from operator import mul\n \n \n sys.setrecursionlimit(2147483647)\n INF = 10 ** 20\n def LI(): return list(map(int, sys.stdin.buffer.readline().split()))\n def I(): return int(sys.stdin.buffer.readline())\n def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()\n def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')\n def IR(n): return [I() for i in range(n)]\n def LIR(n): return [LI() for i in range(n)]\n def SR(n): return [S() for i in range(n)]\n def LSR(n): return [LS() for i in range(n)]\n def SRL(n): return [list(S()) for i in range(n)]\n def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\n mod = 1000000007\n \n n = I()\n X = LI()\n l = I()\n log_n = (n - 1).bit_length()\n doubling = [[n] * n for _ in range(log_n)]\n for i in range(n - 1):\n doubling[0][i] = bisect_right(X, X[i] + l) - 1\n \n for j in range(1, log_n):\n for k in range(n):\n if doubling[j - 1][k] == n:\n continue\n doubling[j][k] = doubling[j - 1][doubling[j - 1][k]]\n q = I()\n-print(doubling)\n for _ in range(q):\n a, b = LI()\n if a > b:\n a, b = b, a\n a -= 1\n b -= 1\n ans = 0\n for m in range(log_n - 1, -1, -1):\n- if doubling[m][a] <= b:\n a = doubling[m][a]\n ans += 2 ** m\n- print(ans)\n \n \n \n \n \n \n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 63 }, { "user_id": "u119148115", "problem_id": "p04017", "submission1_id": "s661453007", "submission2_id": "s803956332", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef I(): return int(sys.stdin.readline().rstrip())\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n\n\nN = I()\nx = LI()\nL = I()\n\nfrom bisect import bisect_right\n\narrive = [[0]*N for _ in range(30)] \nfor k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\n\n\ndef query(a,b): \n a -= 1\n b -= 1\n ans = 0\n for k in range(29,-1,-1):\n if arrive[k][a] > b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n\n\nQ = I()\nfor i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n", "code2": "import sys\ndef I(): return int(sys.stdin.readline().rstrip())\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n\n\nN = I()\nx = LI()\nL = I()\n\nfrom bisect import bisect_right\n\narrive = [[0]*N for _ in range(30)] \nfor k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\n\n\ndef query(a,b): \n a -= 1\n b -= 1\n ans = 1\n for k in range(29,-1,-1):\n if arrive[k][a] >= b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n\n\nQ = I()\nfor i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597454287", "date2": "1597457525", "bleu_score": "0.9938309190116186", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 36, "total_score": 101, "input": "9\n1 6 6 13 23 18 27 29 31\n10\n2\n1 8\n7 3\n6 7\n8 10\n", "actual_output": "4\n3\n", "expected_output": "5\n3\n\n", "anno_code": ["import sys\ndef I(): return int(sys.stdin.readline().rstrip())\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n\n\nN = I() # (0): N=9\nx = LI() # (1): x=[1, 6, 6, 13, 23, 18, 27, 29, 31]\nL = I() # (2): L=10, bisect_right=\n\nfrom bisect import bisect_right\n\narrive = [[0]*N for _ in range(30)] # (3): arrive\nfor k in range(30): # (4): k=0 (25): k=1 ... (634): NO CHANGE\n if k == 0: # (5): NO CHANGE (26): NO CHANGE ... (614): NO CHANGE\n for i in range(N): # (6): i=0 (8): i=1 ... (24): NO CHANGE\n arrive[0][i] = bisect_right(x,x[i]+L)-1 # (7): arrive (9): arrive ... (23): arrive\n else:\n for i in range(N): # (27): i=0 (29): i=1 ... (633): NO CHANGE\n arrive[k][i] = arrive[k-1][arrive[k-1][i]] # (28): arrive (30): arrive ... (632): arrive\n\n\ndef query(a,b): # (635): query=\n a -= 1 # (641): a=0 (742): a=2\n b -= 1 # (642): b=7 (743): b=6\n ans = 0 # (643): ans=0 (744): ans=0\n for k in range(29,-1,-1): # (644): k=29 (647): k=28 ... (837): NO CHANGE\n if arrive[k][a] > b: # (645): NO CHANGE (648): NO CHANGE ... (834): NO CHANGE\n continue # (646): NO CHANGE (649): NO CHANGE ... (828): NO CHANGE\n else:\n a = arrive[k][a] # (727): a=6 (831): a=5 (835): a=6\n ans += 1 << k # (728): ans=4 (832): ans=2 (836): ans=3\n print(ans) # (736): sys=, I=, MI=, LI=, N=9, x=[1, 6, 6, 13, 23, 18, 27, 29, 31], L=10, bisect_right=, arrive, k=29, i=0, query=, Q=2, a=1, b=8 (838): sys=, I=, MI=, LI=, N=9, x=[1, 6, 6, 13, 23, 18, 27, 29, 31], L=10, bisect_right=, arrive, k=29, i=1, query=, Q=2, a=3, b=7\n\n\nQ = I() # (636): Q=2\nfor i in range(Q): # (637): i=0 (737): i=1\n a,b = MI() # (638): a=1, b=8 (738): a=7, b=3\n if a > b: # (639): NO CHANGE (739): NO CHANGE\n a,b = b,a # (740): a=3, b=7\n query(a,b) # (640): NO CHANGE (741): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n def I(): return int(sys.stdin.readline().rstrip())\n def MI(): return map(int,sys.stdin.readline().rstrip().split())\n def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n \n \n N = I()\n x = LI()\n L = I()\n \n from bisect import bisect_right\n \n arrive = [[0]*N for _ in range(30)] \n for k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\n \n \n def query(a,b): \n a -= 1\n b -= 1\n- ans = 0\n+ ans = 1\n for k in range(29,-1,-1):\n- if arrive[k][a] > b:\n+ if arrive[k][a] >= b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n \n \n Q = I()\n for i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n \n", "FL_content": " import sys\n def I(): return int(sys.stdin.readline().rstrip())\n def MI(): return map(int,sys.stdin.readline().rstrip().split())\n def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) \n \n \n N = I()\n x = LI()\n L = I()\n \n from bisect import bisect_right\n \n arrive = [[0]*N for _ in range(30)] \n for k in range(30):\n if k == 0:\n for i in range(N):\n arrive[0][i] = bisect_right(x,x[i]+L)-1\n else:\n for i in range(N):\n arrive[k][i] = arrive[k-1][arrive[k-1][i]]\n \n \n def query(a,b): \n a -= 1\n b -= 1\n- ans = 0\n for k in range(29,-1,-1):\n- if arrive[k][a] > b:\n continue\n else:\n a = arrive[k][a]\n ans += 1 << k\n print(ans)\n \n \n Q = I()\n for i in range(Q):\n a,b = MI()\n if a > b:\n a,b = b,a\n query(a,b)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 42 }, { "user_id": "u803848678", "problem_id": "p04017", "submission1_id": "s923113448", "submission2_id": "s255358959", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nfrom bisect import bisect\n\nn = int(input())\nx = list(map(int, input().split()))\nl = int(input())\n\nm = 20\npar = [[-1]*n for i in range(m)]\n\nfor i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n\nfor i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n\ndef hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1<= y:\n k += 1< b:\n a,b = b,a\n ans.append(hoge(a, b))\n\nprint(*ans, sep=\"\\n\")", "code2": "import sys\ninput = sys.stdin.readline\n\nfrom bisect import bisect\n\nn = int(input())\nx = list(map(int, input().split()))\nl = int(input())\n\nm = 20\npar = [[-1]*n for i in range(m)]\n\nfor i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n\nfor i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n\ndef hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1< b:\n a,b = b,a\n print(hoge(a,b))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570063454", "date2": "1570064033", "bleu_score": "0.8577715932410134", "code1_test_status": [0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 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, 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], "code1_test_score": 15, "total_score": 101, "input": "9\n1 3 6 13 23 18 19 29 31\n12\n2\n1 3\n1 5\n9 7\n8 1\n", "actual_output": "1\n1\n", "expected_output": "1\n2\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, bisect=\n\nfrom bisect import bisect\n\nn = int(input()) # (1): n=9\nx = list(map(int, input().split())) # (2): x=[1, 3, 6, 13, 23, 18, 19, 29, 31]\nl = int(input()) # (3): l=12\n\nm = 20 # (4): m=20\npar = [[-1]*n for i in range(m)] # (5): par\n\nfor i in range(n): # (6): i=0 (9): i=1 ... (33): NO CHANGE\n j = bisect(x, x[i]+l)-1 # (7): j=3 (10): NO CHANGE ... (31): NO CHANGE\n par[0][i] = j # (8): par (11): par ... (32): par\n\nfor i in range(m-1): # (34): i=0 (54): i=1 ... (414): NO CHANGE\n for j in range(n): # (35): j=0 (37): j=1 ... (413): NO CHANGE\n par[i+1][j]=par[i][par[i][j]] # (36): par (38): par ... (412): par\n\ndef hoge(x, y): # (415): hoge=\n k = 0 # (423): k=0 (491): k=0\n for i in range(m)[::-1]: # (424): i=19 (427): i=18 ... (553): sys=, input=, bisect=, n=9, x=[1, 3, 6, 13, 23, 18, 19, 29, 31], l=12, m=20, par=[[3, 3, 3, 6, 8, 7, 8, 8, 8], [6, 6, 6, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8], [8, 8, 8, 8, 8, 8, 8, 8, 8]], i=1, j=8, hoge=, q=2, ans=[1, 1], a=0, b=4\n if par[i][x] < y: # (425): NO CHANGE (428): NO CHANGE ... (550): NO CHANGE\n k += 1<= y: # (426): NO CHANGE (429): NO CHANGE ... (548): NO CHANGE\n k += 1< b: # (421): NO CHANGE (489): NO CHANGE\n a,b = b,a\n ans.append(hoge(a, b)) # (422): x=0, y=2 (490): x=0, y=4\n\nprint(*ans, sep=\"\\n\")"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n from bisect import bisect\n \n n = int(input())\n x = list(map(int, input().split()))\n l = int(input())\n \n m = 20\n par = [[-1]*n for i in range(m)]\n \n for i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n \n for i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n \n def hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1<= y:\n- k += 1< b:\n a,b = b,a\n- ans.append(hoge(a, b))\n-\n-print(*ans, sep=\"\\n\")\n+ print(hoge(a,b))\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n from bisect import bisect\n \n n = int(input())\n x = list(map(int, input().split()))\n l = int(input())\n \n m = 20\n par = [[-1]*n for i in range(m)]\n \n for i in range(n):\n j = bisect(x, x[i]+l)-1\n par[0][i] = j\n \n for i in range(m-1):\n for j in range(n):\n par[i+1][j]=par[i][par[i][j]]\n \n def hoge(x, y):\n k = 0\n for i in range(m)[::-1]:\n if par[i][x] < y:\n k += 1<= y:\n- k += 1< b:\n a,b = b,a\n- ans.append(hoge(a, b))\n-\n-print(*ans, sep=\"\\n\")\n", "added_lines": 2, "removed_lines": 6, "code1_lines": 40 }, { "user_id": "u214617707", "problem_id": "p04017", "submission1_id": "s018403980", "submission2_id": "s884346131", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n Y = X[b]\n num = 0\n for j in range(29, -1, -1):\n if X[P[j][a]] <= Y:\n Y -= X[P[j][a]]\n num += 2 ** j\n if Y <= 0:\n print(num)\n break", "code2": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n if a > b:\n a, b = b, a\n a, b = a - 1, b - 1\n num = 0\n for j in range(29, -1, -1):\n if P[j][a] < b:\n a = P[j][a]\n num += 2 ** j\n print(num + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540517250", "date2": "1540519235", "bleu_score": "0.8740198461198132", "code1_test_status": [1, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 33, "total_score": 101, "input": "9\n1 3 0 13 23 18 19 29 58\n10\n2\n1 2\n7 5\n6 7\n8 5\n", "actual_output": "", "expected_output": "1\n1\n\n", "anno_code": ["from bisect import bisect_right\nN = int(input()) # (0): N=9\nX = list(map(int, input().split())) # (1): X=[1, 3, 0, 13, 23, 18, 19, 29, 58]\nL = int(input()) # (2): L=10\n\nP = [[0] * N for i in range(30)] # (3): P\nfor i in range(N): # (4): i=0 (7): i=1 ... (31): NO CHANGE\n q = bisect_right(X, X[i] + L) # (5): q=3 (8): q=4 ... (29): q=9\n P[0][i] = q - 1 # (6): P (9): P ... (30): P\n\nfor i in range(1, 30): # (32): i=1 (52): i=2 ... (612): NO CHANGE\n for j in range(N): # (33): j=0 (35): j=1 ... (611): NO CHANGE\n P[i][j] = P[i - 1][P[i - 1][j]] # (34): P (36): P ... (610): P\n\nQ = int(input()) # (613): Q=2\nfor i in range(Q): # (614): i=0 (771): i=1\n a, b = map(int, input().split()) # (615): a=1, b=2 (772): a=7, b=5\n a, b = a - 1, b - 1 # (616): a=0, b=1 (773): a=6, b=4\n if a > b: # (617): NO CHANGE (774): NO CHANGE\n a, b = b, a # (775): a=4, b=6\n Y = X[b] # (618): Y=3 (776): Y=19\n num = 0 # (619): num=0 (777): num=0\n for j in range(29, -1, -1): # (620): j=29 (625): j=28 ... (868): NO CHANGE\n if X[P[j][a]] <= Y: # (621): NO CHANGE (626): NO CHANGE ... (866): NO CHANGE\n Y -= X[P[j][a]] # (622): NO CHANGE (627): NO CHANGE ... (767): NO CHANGE\n num += 2 ** j # (623): num=536870912 (628): num=805306368 ... (768): num=1073741823\n if Y <= 0: # (624): NO CHANGE (629): NO CHANGE ... (867): NO CHANGE\n print(num)\n break"], "anno_status": [true], "diff_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n+\n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n+ a, b = a - 1, b - 1\n num = 0\n for j in range(29, -1, -1):\n- if X[P[j][a]] <= Y:\n- Y -= X[P[j][a]]\n+ if P[j][a] < b:\n+ a = P[j][a]\n num += 2 ** j\n- if Y <= 0:\n- print(num)\n- break\n+ print(num + 1)\n", "FL_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n num = 0\n for j in range(29, -1, -1):\n- if X[P[j][a]] <= Y:\n- Y -= X[P[j][a]]\n num += 2 ** j\n- if Y <= 0:\n- print(num)\n- break\n", "added_lines": 5, "removed_lines": 7, "code1_lines": 29 }, { "user_id": "u214617707", "problem_id": "p04017", "submission1_id": "s250757919", "submission2_id": "s884346131", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n Y = X[b]\n num = 0\n for j in range(29, 0, -1):\n if X[P[j][a]] <= Y:\n Y = X[P[j][a]]\n num += 2 ** (j - 1)\n print(num + 1)\n", "code2": "from bisect import bisect_right\nN = int(input())\nX = list(map(int, input().split()))\nL = int(input())\n\nP = [[0] * N for i in range(30)]\nfor i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n\nfor i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n\n\nQ = int(input())\nfor i in range(Q):\n a, b = map(int, input().split())\n if a > b:\n a, b = b, a\n a, b = a - 1, b - 1\n num = 0\n for j in range(29, -1, -1):\n if P[j][a] < b:\n a = P[j][a]\n num += 2 ** j\n print(num + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540518943", "date2": "1540519235", "bleu_score": "0.9294114791138732", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 41, "total_score": 101, "input": "9\n1 3 6 13 23 18 19 29 31\n10\n2\n1 9\n7 2\n10 2\n8 10\n", "actual_output": "536870912\n2\n", "expected_output": "5\n2\n\n", "anno_code": ["from bisect import bisect_right\nN = int(input()) # (0): N=9\nX = list(map(int, input().split())) # (1): X=[1, 3, 6, 13, 23, 18, 19, 29, 31]\nL = int(input()) # (2): L=10\n\nP = [[0] * N for i in range(30)] # (3): P\nfor i in range(N): # (4): i=0 (7): i=1 ... (31): NO CHANGE\n q = bisect_right(X, X[i] + L) # (5): q=3 (8): q=4 ... (29): NO CHANGE\n P[0][i] = q - 1 # (6): P (9): P ... (30): P\n\nfor i in range(1, 30): # (32): i=1 (52): i=2 ... (612): NO CHANGE\n for j in range(N): # (33): j=0 (35): j=1 ... (611): NO CHANGE\n P[i][j] = P[i - 1][P[i - 1][j]] # (34): P (36): P ... (610): P\n\n\nQ = int(input()) # (613): Q=2\nfor i in range(Q): # (614): i=0 (738): i=1\n a, b = map(int, input().split()) # (615): a=1, b=9 (739): a=7, b=2\n a, b = a - 1, b - 1 # (616): a=0, b=8 (740): a=6, b=1\n if a > b: # (617): NO CHANGE (741): NO CHANGE\n a, b = b, a # (742): a=1, b=6\n Y = X[b] # (618): Y=31 (743): Y=19\n num = 0 # (619): num=0 (744): num=0\n for j in range(29, 0, -1): # (620): j=29 (624): j=28 ... (805): NO CHANGE\n if X[P[j][a]] <= Y: # (621): NO CHANGE (625): NO CHANGE ... (802): NO CHANGE\n Y = X[P[j][a]] # (622): NO CHANGE (626): NO CHANGE ... (803): NO CHANGE\n num += 2 ** (j - 1) # (623): num=268435456 (627): num=402653184 ... (804): num=1\n print(num + 1) # (737): NO CHANGE (806): NO CHANGE\n"], "anno_status": [true], "diff_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n \n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n+ a, b = a - 1, b - 1\n num = 0\n- for j in range(29, 0, -1):\n- if X[P[j][a]] <= Y:\n- Y = X[P[j][a]]\n- num += 2 ** (j - 1)\n+ for j in range(29, -1, -1):\n+ if P[j][a] < b:\n+ a = P[j][a]\n+ num += 2 ** j\n print(num + 1)\n-\n", "FL_content": " from bisect import bisect_right\n N = int(input())\n X = list(map(int, input().split()))\n L = int(input())\n \n P = [[0] * N for i in range(30)]\n for i in range(N):\n q = bisect_right(X, X[i] + L)\n P[0][i] = q - 1\n \n for i in range(1, 30):\n for j in range(N):\n P[i][j] = P[i - 1][P[i - 1][j]]\n \n \n Q = int(input())\n for i in range(Q):\n a, b = map(int, input().split())\n- a, b = a - 1, b - 1\n if a > b:\n a, b = b, a\n- Y = X[b]\n num = 0\n- for j in range(29, 0, -1):\n- if X[P[j][a]] <= Y:\n- Y = X[P[j][a]]\n- num += 2 ** (j - 1)\n print(num + 1)\n-\n", "added_lines": 5, "removed_lines": 7, "code1_lines": 29 }, { "user_id": "u819135704", "problem_id": "p03480", "submission1_id": "s756012439", "submission2_id": "s373335452", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\nn = len(S)\na = n\nfor i in range(n-1):\n if S[i] != S[i+1]:\n a = min(a, max(i+1, n-i+1))\n\nprint(a)\n", "code2": "S = input()\n\nn = len(S)\na = n\nfor i in range(n-1):\n if S[i] != S[i+1]:\n a = min(a, max(i+1, n-i-1))\n\nprint(a)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592618689", "date2": "1592619099", "bleu_score": "0.978764609552155", "code1_test_status": [1, 1, 1, 1, 1, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0], "code1_test_score": 14, "total_score": 63, "input": "11010111\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["S = input() # (0): S=11010111\n\nn = len(S) # (1): n=8\na = n # (2): a=8\nfor i in range(n-1): # (3): i=0 (5): i=1 ... (21): NO CHANGE\n if S[i] != S[i+1]: # (4): NO CHANGE (6): NO CHANGE ... (20): NO CHANGE\n a = min(a, max(i+1, n-i+1)) # (7): NO CHANGE (10): a=7 ... (16): a=5\n\nprint(a)\n"], "anno_status": [true], "diff_content": " S = input()\n \n n = len(S)\n a = n\n for i in range(n-1):\n if S[i] != S[i+1]:\n- a = min(a, max(i+1, n-i+1))\n+ a = min(a, max(i+1, n-i-1))\n \n print(a)\n \n", "FL_content": " S = input()\n \n n = len(S)\n a = n\n for i in range(n-1):\n if S[i] != S[i+1]:\n- a = min(a, max(i+1, n-i+1))\n \n print(a)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u504836877", "problem_id": "p03480", "submission1_id": "s025879284", "submission2_id": "s244157569", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\nN = len(S)\nL = []\ntemp = S[0]\nc = 1\nfor i in range(1, N-1):\n if S[i] == temp:\n c += 1\n else:\n L.append(c)\n c = 1\n temp = S[i]\nif S[N-1] == temp:\n c += 1\nelse:\n L.append(c)\n c = 1\nL.append(c)\n\nans = N\nwhile len(L) >= 3:\n if L[0] > L[-1]:\n ans = min(ans, N-L[-1])\n L[1] += L[0]\n L.pop(0)\n else:\n ans = min(ans, N-L[0])\n L[-2] += L[-1]\n L.pop(-1)\n \nif len(L) == 2:\n ans = min(ans, max(L))\n \nprint(ans)", "code2": "S = input()\n\nN = len(S)\nL = []\ntemp = S[0]\nc = 1\nfor i in range(1, N-1):\n if S[i] == temp:\n c += 1\n else:\n L.append(c)\n c = 1\n temp = S[i]\nif S[N-1] == temp:\n c += 1\nelse:\n L.append(c)\n c = 1\nL.append(c)\n\nans = N\nwhile len(L) >= 3:\n if L[0] > L[-1]:\n ans = min(ans, N-L[-1])\n L[-2] += L[-1]\n L.pop(-1)\n else:\n ans = min(ans, N-L[0])\n L[1] += L[0]\n L.pop(0)\n \nif len(L) == 2:\n ans = min(ans, max(L))\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571349953", "date2": "1571350555", "bleu_score": "1.0", "code1_test_status": [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, 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, 1, 1], "code1_test_score": 6, "total_score": 63, "input": "100010011\n", "actual_output": "8\n", "expected_output": "5\n\n", "anno_code": ["S = input() # (0): S=100010011\n\nN = len(S) # (1): N=9\nL = [] # (2): L=[]\ntemp = S[0] # (3): temp=1\nc = 1 # (4): c=1\nfor i in range(1, N-1): # (5): i=1 (10): i=2 ... (34): NO CHANGE\n if S[i] == temp: # (6): NO CHANGE (11): NO CHANGE ... (30): NO CHANGE\n c += 1 # (12): c=2 (15): c=3 (28): c=2\n else:\n L.append(c) # (7): L=[1] (18): L=[1, 3] ... (31): L=[1, 3, 1, 2]\n c = 1 # (8): NO CHANGE (19): c=1 ... (32): c=1\n temp = S[i] # (9): temp=0 (20): temp=1 ... (33): temp=1\nif S[N-1] == temp: # (35): NO CHANGE\n c += 1 # (36): c=2\nelse:\n L.append(c)\n c = 1\nL.append(c) # (37): L=[1, 3, 1, 2, 2]\n\nans = N # (38): ans=9\nwhile len(L) >= 3: # (39): NO CHANGE (44): NO CHANGE ... (54): NO CHANGE\n if L[0] > L[-1]: # (40): NO CHANGE (45): NO CHANGE (50): NO CHANGE\n ans = min(ans, N-L[-1])\n L[1] += L[0]\n L.pop(0)\n else:\n ans = min(ans, N-L[0]) # (41): ans=8 (46): NO CHANGE (51): NO CHANGE\n L[-2] += L[-1] # (42): L=[1, 3, 1, 4, 2] (47): L=[1, 3, 5, 4] (52): L=[1, 8, 5]\n L.pop(-1) # (43): L=[1, 3, 1, 4] (48): L=[1, 3, 5] (53): L=[1, 8]\n \nif len(L) == 2: # (55): NO CHANGE\n ans = min(ans, max(L)) # (56): NO CHANGE\n \nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n \n N = len(S)\n L = []\n temp = S[0]\n c = 1\n for i in range(1, N-1):\n if S[i] == temp:\n c += 1\n else:\n L.append(c)\n c = 1\n temp = S[i]\n if S[N-1] == temp:\n c += 1\n else:\n L.append(c)\n c = 1\n L.append(c)\n \n ans = N\n while len(L) >= 3:\n if L[0] > L[-1]:\n ans = min(ans, N-L[-1])\n- L[1] += L[0]\n- L.pop(0)\n- else:\n- ans = min(ans, N-L[0])\n L[-2] += L[-1]\n L.pop(-1)\n+ else:\n+ ans = min(ans, N-L[0])\n+ L[1] += L[0]\n+ L.pop(0)\n \n if len(L) == 2:\n ans = min(ans, max(L))\n \n print(ans)\n", "FL_content": " S = input()\n \n N = len(S)\n L = []\n temp = S[0]\n c = 1\n for i in range(1, N-1):\n if S[i] == temp:\n c += 1\n else:\n L.append(c)\n c = 1\n temp = S[i]\n if S[N-1] == temp:\n c += 1\n else:\n L.append(c)\n c = 1\n L.append(c)\n \n ans = N\n while len(L) >= 3:\n if L[0] > L[-1]:\n ans = min(ans, N-L[-1])\n- L[1] += L[0]\n- L.pop(0)\n- else:\n- ans = min(ans, N-L[0])\n L[-2] += L[-1]\n L.pop(-1)\n \n if len(L) == 2:\n ans = min(ans, max(L))\n \n print(ans)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 35 }, { "user_id": "u945181840", "problem_id": "p03480", "submission1_id": "s845587226", "submission2_id": "s072047842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import groupby\n\nS = list(input())\nn = len(S)\ns = [len(list(j)) for i, j in groupby(S)]\ns = [max(i, n - i) for i in s]\n\nprint(min(s))\n", "code2": "from itertools import groupby, accumulate\n\nS = list(input())\nn = len(S)\ns = list(accumulate([len(list(j)) for i, j in groupby(S)]))\ns = [max(i, n - i) for i in s]\n\nprint(min(s))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577890314", "date2": "1577890617", "bleu_score": "0.8041494913792693", "code1_test_status": [0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1], "code1_test_score": 29, "total_score": 63, "input": "010000110\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["from itertools import groupby\n\nS = list(input()) # (0): S=['0', '1', '0', '0', '0', '0', '1', '1', '0']\nn = len(S) # (1): n=9\ns = [len(list(j)) for i, j in groupby(S)] # (2): s=[1, 1, 4, 2, 1]\ns = [max(i, n - i) for i in s] # (3): s=[8, 8, 5, 7, 8]\n\nprint(min(s))\n"], "anno_status": [true], "diff_content": "-from itertools import groupby\n+from itertools import groupby, accumulate\n \n S = list(input())\n n = len(S)\n-s = [len(list(j)) for i, j in groupby(S)]\n+s = list(accumulate([len(list(j)) for i, j in groupby(S)]))\n s = [max(i, n - i) for i in s]\n \n print(min(s))\n \n", "FL_content": "-from itertools import groupby\n \n S = list(input())\n n = len(S)\n-s = [len(list(j)) for i, j in groupby(S)]\n s = [max(i, n - i) for i in s]\n \n print(min(s))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u912359563", "problem_id": "p03480", "submission1_id": "s853147878", "submission2_id": "s815753591", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nn = len(S)\nT = 1000000\nfor i in range(1, n) :\n if S[i] != S[i-1] :\n T = min(T, max(i, n-i))\nprint(T if T != 0 else n)\n", "code2": "S = input()\nn = len(S)\nT = n\nfor i in range(1, n) :\n if S[i] != S[i-1] :\n T = min(T, max(i, n-i))\nprint(T)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1519090819", "date2": "1519091009", "bleu_score": "0.7980700701198331", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "000000000\n", "actual_output": "1000000\n", "expected_output": "9\n\n", "anno_code": ["S = input() # (0): S=000000000\nn = len(S) # (1): n=9\nT = 1000000 # (2): T=1000000\nfor i in range(1, n) : # (3): i=1 (5): i=2 ... (19): NO CHANGE\n if S[i] != S[i-1] : # (4): NO CHANGE (6): NO CHANGE ... (18): NO CHANGE\n T = min(T, max(i, n-i))\nprint(T if T != 0 else n)\n"], "anno_status": [true], "diff_content": " S = input()\n n = len(S)\n-T = 1000000\n+T = n\n for i in range(1, n) :\n if S[i] != S[i-1] :\n T = min(T, max(i, n-i))\n-print(T if T != 0 else n)\n+print(T)\n \n", "FL_content": " S = input()\n n = len(S)\n-T = 1000000\n for i in range(1, n) :\n if S[i] != S[i-1] :\n T = min(T, max(i, n-i))\n-print(T if T != 0 else n)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u947883560", "problem_id": "p03480", "submission1_id": "s127055808", "submission2_id": "s994984341", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nINF = float(\"inf\")\n\n\ndef solve(S: str):\n\n if int(S) == 0:\n print(len(S))\n return\n\n N = len(S)\n ts = INF\n for i, c in enumerate(S):\n if i == 0:\n continue\n if S[i-1] != S[i]:\n ts = min(ts, max(i, N-i))\n print(ts)\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 = str(next(tokens)) \n solve(S)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nINF = float(\"inf\")\n\n\ndef solve(S: str):\n\n N = len(S)\n ts = N\n for i in range(1, N):\n if S[i] != S[i-1]:\n ts = min(ts, max(i, N-i))\n print(ts)\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 = str(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": "1559117620", "date2": "1559117917", "bleu_score": "0.7664043934593001", "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], "code1_test_score": 62, "total_score": 63, "input": "11111111\n", "actual_output": "inf\n", "expected_output": "8\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n import sys\n INF = float(\"inf\")\n \n \n def solve(S: str):\n \n- if int(S) == 0:\n- print(len(S))\n- return\n-\n N = len(S)\n- ts = INF\n- for i, c in enumerate(S):\n- if i == 0:\n- continue\n- if S[i-1] != S[i]:\n+ ts = N\n+ for i in range(1, N):\n+ if S[i] != S[i-1]:\n ts = min(ts, max(i, N-i))\n print(ts)\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 = str(next(tokens)) \n solve(S)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n INF = float(\"inf\")\n \n \n def solve(S: str):\n \n- if int(S) == 0:\n- print(len(S))\n- return\n-\n N = len(S)\n- ts = INF\n- for i, c in enumerate(S):\n- if i == 0:\n- continue\n- if S[i-1] != S[i]:\n ts = min(ts, max(i, N-i))\n print(ts)\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 = str(next(tokens)) \n solve(S)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 3, "removed_lines": 9, "code1_lines": 36 }, { "user_id": "u729133443", "problem_id": "p03480", "submission1_id": "s686474925", "submission2_id": "s213787071", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input();n=len(s);print(min([max(i,n-i)for i in range(1,n)if s[i-1]!=s[i]]or[0]))", "code2": "s=input();n=len(s);print(min([max(i,n-i)for i in range(1,n)if s[i-1]!=s[i]]or[n]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554437970", "date2": "1554438279", "bleu_score": "0.9686391926502761", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "000000000\n", "actual_output": "0\n", "expected_output": "9\n\n", "anno_code": ["s=input();n=len(s);print(min([max(i,n-i)for i in range(1,n)if s[i-1]!=s[i]]or[0]))"], "anno_status": [true], "diff_content": "-s=input();n=len(s);print(min([max(i,n-i)for i in range(1,n)if s[i-1]!=s[i]]or[0]))\n+s=input();n=len(s);print(min([max(i,n-i)for i in range(1,n)if s[i-1]!=s[i]]or[n]))\n", "FL_content": "-s=input();n=len(s);print(min([max(i,n-i)for i in range(1,n)if s[i-1]!=s[i]]or[0]))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u225528554", "problem_id": "p03480", "submission1_id": "s612105241", "submission2_id": "s905637672", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__==\"__main__\":\n l = list(input())\n N = len(l)\n results = [1]\n for i in range(0,N-1):\n if not l[i]==l[i+1]:\n results.append(max(i+1,N-i-1))\n print(min(results))", "code2": "if __name__==\"__main__\":\n l = list(input())\n N = len(l)\n results = []\n for i in range(0,N-1):\n if not l[i]==l[i+1]:\n results.append(max(i+1,N-i-1))\n if len(results):\n print(min(results))\n else:\n print(N)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514089404", "date2": "1514089688", "bleu_score": "0.7872339132727747", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 63, "input": "010110010\n", "actual_output": "1\n", "expected_output": "5\n\n", "anno_code": ["if __name__==\"__main__\":\n l = list(input())\n N = len(l)\n results = [1]\n for i in range(0,N-1):\n if not l[i]==l[i+1]:\n results.append(max(i+1,N-i-1))\n print(min(results))"], "anno_status": [true], "diff_content": " if __name__==\"__main__\":\n l = list(input())\n N = len(l)\n- results = [1]\n+ results = []\n for i in range(0,N-1):\n if not l[i]==l[i+1]:\n results.append(max(i+1,N-i-1))\n- print(min(results))\n+ if len(results):\n+ print(min(results))\n+ else:\n+ print(N)\n", "FL_content": " if __name__==\"__main__\":\n l = list(input())\n N = len(l)\n- results = [1]\n for i in range(0,N-1):\n if not l[i]==l[i+1]:\n results.append(max(i+1,N-i-1))\n- print(min(results))\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u476604182", "problem_id": "p03480", "submission1_id": "s747904425", "submission2_id": "s287247915", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nj = 0\nm = S[0]\nls = []\nfor i in range(len(S)):\n if m!=S[i]:\n ls += [i-j]\n j = i\n m = S[i]\nls += [len(S)-j]\nif len(ls)<3:\n print(max(ls))\nelse:\n ans = 0\n for i in range(0,len(ls)-2):\n m = min(ls[i]+ls[i+1],ls[i+1]+ls[i+2])\n ans = max(ans,m)\n print(ans)", "code2": "S = input()\nj = 0\nm = S[0]\nls = []\nfor i in range(len(S)):\n if m!=S[i]:\n ls += [i-j]\n j = i\n m = S[i]\nls += [len(S)-j]\nN = len(ls)\nif N<3:\n print(max(ls))\nelse:\n ans = float('inf')\n sls = [ls[0]]\n for i in range(1,N):\n sls += [sls[-1]+ls[i]]\n for i in range(N-1):\n ans = min(ans,max(sls[i], sls[-1]-sls[i]))\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582347503", "date2": "1582348833", "bleu_score": "0.7174621401685927", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 20, "total_score": 63, "input": "010010100\n", "actual_output": "3\n", "expected_output": "5\n\n", "anno_code": ["S = input() # (0): S=010010100\nj = 0 # (1): j=0\nm = S[0] # (2): m=0\nls = [] # (3): ls=[]\nfor i in range(len(S)): # (4): i=0 (6): i=1 ... (40): NO CHANGE\n if m!=S[i]: # (5): NO CHANGE (7): NO CHANGE ... (39): NO CHANGE\n ls += [i-j] # (8): ls=[1] (13): ls=[1, 1] ... (35): ls=[1, 1, 2, 1, 1, 1]\n j = i # (9): j=1 (14): j=2 ... (36): j=7\n m = S[i] # (10): m=1 (15): m=0 ... (37): m=0\nls += [len(S)-j] # (41): ls=[1, 1, 2, 1, 1, 1, 2]\nif len(ls)<3: # (42): NO CHANGE\n print(max(ls))\nelse:\n ans = 0 # (43): ans=0\n for i in range(0,len(ls)-2): # (44): i=0 (47): i=1 ... (59): NO CHANGE\n m = min(ls[i]+ls[i+1],ls[i+1]+ls[i+2]) # (45): m=2 (48): m=3 ... (57): NO CHANGE\n ans = max(ans,m) # (46): ans=2 (49): ans=3 ... (58): NO CHANGE\n print(ans)"], "anno_status": [true], "diff_content": " S = input()\n j = 0\n m = S[0]\n ls = []\n for i in range(len(S)):\n if m!=S[i]:\n ls += [i-j]\n j = i\n m = S[i]\n ls += [len(S)-j]\n-if len(ls)<3:\n+N = len(ls)\n+if N<3:\n print(max(ls))\n else:\n- ans = 0\n- for i in range(0,len(ls)-2):\n- m = min(ls[i]+ls[i+1],ls[i+1]+ls[i+2])\n- ans = max(ans,m)\n+ ans = float('inf')\n+ sls = [ls[0]]\n+ for i in range(1,N):\n+ sls += [sls[-1]+ls[i]]\n+ for i in range(N-1):\n+ ans = min(ans,max(sls[i], sls[-1]-sls[i]))\n print(ans)\n", "FL_content": " S = input()\n j = 0\n m = S[0]\n ls = []\n for i in range(len(S)):\n if m!=S[i]:\n ls += [i-j]\n j = i\n m = S[i]\n ls += [len(S)-j]\n-if len(ls)<3:\n print(max(ls))\n else:\n- ans = 0\n- for i in range(0,len(ls)-2):\n- m = min(ls[i]+ls[i+1],ls[i+1]+ls[i+2])\n- ans = max(ans,m)\n print(ans)\n", "added_lines": 8, "removed_lines": 5, "code1_lines": 18 }, { "user_id": "u004025573", "problem_id": "p03480", "submission1_id": "s273926453", "submission2_id": "s231645154", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nS = list(map(int, input()))\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nN = len(S)\n\nif sum(S) < 1:\n min_T = 0\nelse:\n min_T = N\n for i in range(1, N):\n if S[i]!=S[i-1]:\n min_T = min(min_T, max(i, N-i))\n\nprint(min_T)\n\n\n\n", "code2": "\n\n\nS = list(map(int, input()))\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nN = len(S)\n\n\nmin_T = N\nfor i in range(1, N):\n if S[i]!=S[i-1]:\n min_T = min(min_T, max(i, N-i))\n\nprint(min_T)\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529614917", "date2": "1529614993", "bleu_score": "0.7337741028874152", "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, 1, 1, 1, 1, 1, 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": 62, "total_score": 63, "input": "000000000\n", "actual_output": "0\n", "expected_output": "9\n\n", "anno_code": ["\n\n\nS = list(map(int, input())) # (0): S=[0, 0, 0, 0, 0, 0, 0, 0, 0]\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nN = len(S) # (1): N=9\n\nif sum(S) < 1: # (2): NO CHANGE\n min_T = 0 # (3): min_T=0\nelse:\n min_T = N\n for i in range(1, N):\n if S[i]!=S[i-1]:\n min_T = min(min_T, max(i, N-i))\n\nprint(min_T)\n\n\n\n"], "anno_status": [true], "diff_content": " \n \n \n S = list(map(int, input()))\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n N = len(S)\n \n-if sum(S) < 1:\n- min_T = 0\n-else:\n- min_T = N\n- for i in range(1, N):\n- if S[i]!=S[i-1]:\n- min_T = min(min_T, max(i, N-i))\n+\n+min_T = N\n+for i in range(1, N):\n+ if S[i]!=S[i-1]:\n+ min_T = min(min_T, max(i, N-i))\n \n print(min_T)\n \n \n \n \n", "FL_content": " \n \n \n S = list(map(int, input()))\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n N = len(S)\n \n-if sum(S) < 1:\n- min_T = 0\n-else:\n- min_T = N\n- for i in range(1, N):\n- if S[i]!=S[i-1]:\n- min_T = min(min_T, max(i, N-i))\n \n print(min_T)\n \n \n \n \n", "added_lines": 5, "removed_lines": 7, "code1_lines": 39 }, { "user_id": "u638795007", "problem_id": "p03480", "submission1_id": "s069522556", "submission2_id": "s395068301", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nimport sys\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\nmod = 10**9 + 7\ninf = float('inf')\n\nS = str(input())\nN = len(S)\nans = int(0)\n\nk = N\n\nfor i in range(N-1):\n if S[i]!=S[i+1]:\n k = max(i+1,N-1-i)\nans = k\nprint(ans)", "code2": "import heapq\nimport sys\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\nmod = 10**9 + 7\ninf = float('inf')\n\nS = str(input())\nN = len(S)\nans = int(0)\n\nk = N\n\nfor i in range(N-1):\n if S[i]!=S[i+1]:\n k = min(max(i+1,N-1-i),k)\nans = k\nprint(ans)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572800549", "date2": "1572800639", "bleu_score": "0.9657072469829815", "code1_test_status": [0, 0, 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, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 22, "total_score": 63, "input": "101011000\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["import heapq\nimport sys\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\nmod = 10**9 + 7 # (0): mod=1000000007\ninf = float('inf') # (1): inf=inf\n\nS = str(input()) # (2): S=101011000\nN = len(S) # (3): N=9\nans = int(0) # (4): ans=0\n\nk = N # (5): k=9\n\nfor i in range(N-1): # (6): i=0 (9): i=1 ... (27): NO CHANGE\n if S[i]!=S[i+1]: # (7): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n k = max(i+1,N-1-i) # (8): k=8 (11): k=7 ... (22): k=6\nans = k # (28): ans=6\nprint(ans)"], "anno_status": [true], "diff_content": " import heapq\n import sys\n def I(): return int(sys.stdin.readline())\n def LI(): return list(map(int,sys.stdin.readline().split()))\n mod = 10**9 + 7\n inf = float('inf')\n \n S = str(input())\n N = len(S)\n ans = int(0)\n \n k = N\n \n for i in range(N-1):\n if S[i]!=S[i+1]:\n- k = max(i+1,N-1-i)\n+ k = min(max(i+1,N-1-i),k)\n ans = k\n print(ans)\n+\n+\n", "FL_content": " import heapq\n import sys\n def I(): return int(sys.stdin.readline())\n def LI(): return list(map(int,sys.stdin.readline().split()))\n mod = 10**9 + 7\n inf = float('inf')\n \n S = str(input())\n N = len(S)\n ans = int(0)\n \n k = N\n \n for i in range(N-1):\n if S[i]!=S[i+1]:\n- k = max(i+1,N-1-i)\n ans = k\n print(ans)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u121921603", "problem_id": "p03480", "submission1_id": "s648139217", "submission2_id": "s200242692", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nS=input().strip()\nt=10**6\nfor i in range(1,len(S)):\n if S[i-1]!=S[i]:\n t=min(t,max(i,len(S)-i))\nif t==0:\n print(len(S))\nelse:\n print(t)\n", "code2": "\nS=input()\nt=10**6\nfor i in range(1,len(S)):\n if S[i-1]!=S[i]:\n t=min(t,max(i,len(S)-i))\n\nif t==10**6:\n print(len(S))\nelse:\n print(t)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578447273", "date2": "1578447809", "bleu_score": "0.7243883147107396", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "11111111\n", "actual_output": "1000000\n", "expected_output": "8\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nS=input().strip() # (1): S=11111111\nt=10**6 # (2): t=1000000\nfor i in range(1,len(S)): # (3): i=1 (5): i=2 ... (17): NO CHANGE\n if S[i-1]!=S[i]: # (4): NO CHANGE (6): NO CHANGE ... (16): NO CHANGE\n t=min(t,max(i,len(S)-i))\nif t==0: # (18): NO CHANGE\n print(len(S))\nelse:\n print(t)\n"], "anno_status": [true], "diff_content": "-import sys\n-input = sys.stdin.readline\n-S=input().strip()\n+\n+S=input()\n t=10**6\n for i in range(1,len(S)):\n if S[i-1]!=S[i]:\n t=min(t,max(i,len(S)-i))\n-if t==0:\n+\n+if t==10**6:\n print(len(S))\n else:\n print(t)\n \n", "FL_content": "-import sys\n-input = sys.stdin.readline\n-S=input().strip()\n t=10**6\n for i in range(1,len(S)):\n if S[i-1]!=S[i]:\n t=min(t,max(i,len(S)-i))\n-if t==0:\n print(len(S))\n else:\n print(t)\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u255001744", "problem_id": "p03480", "submission1_id": "s520570309", "submission2_id": "s915597837", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\ns = S[0]\ntemp_T = 100000\nfor i in range(1, len(S)):\n if(S[i] != s):\n judge = max(i,len(S)-i)\n temp_T = min(judge, temp_T)\n s = S[i]\n\nprint(temp_T)\n", "code2": "S = input()\n\n\ntemp_T = len(S)\nfor i in range(len(S)-1):\n if(S[i] != S[i+1]):\n judge = max(i+1,len(S)-(i+1))\n temp_T = min(judge, temp_T)\n\nprint(temp_T)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1526583961", "date2": "1526585244", "bleu_score": "0.7649416794689896", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "11111111\n", "actual_output": "100000\n", "expected_output": "8\n\n", "anno_code": ["S = input() # (0): S=11111111\n\ns = S[0] # (1): s=1\ntemp_T = 100000 # (2): temp_T=100000\nfor i in range(1, len(S)): # (3): i=1 (5): i=2 ... (17): NO CHANGE\n if(S[i] != s): # (4): NO CHANGE (6): NO CHANGE ... (16): NO CHANGE\n judge = max(i,len(S)-i)\n temp_T = min(judge, temp_T)\n s = S[i]\n\nprint(temp_T)\n"], "anno_status": [true], "diff_content": " S = input()\n \n-s = S[0]\n-temp_T = 100000\n-for i in range(1, len(S)):\n- if(S[i] != s):\n- judge = max(i,len(S)-i)\n+\n+temp_T = len(S)\n+for i in range(len(S)-1):\n+ if(S[i] != S[i+1]):\n+ judge = max(i+1,len(S)-(i+1))\n temp_T = min(judge, temp_T)\n- s = S[i]\n \n print(temp_T)\n \n", "FL_content": " S = input()\n \n-s = S[0]\n-temp_T = 100000\n-for i in range(1, len(S)):\n- if(S[i] != s):\n- judge = max(i,len(S)-i)\n temp_T = min(judge, temp_T)\n- s = S[i]\n \n print(temp_T)\n \n", "added_lines": 5, "removed_lines": 6, "code1_lines": 12 }, { "user_id": "u787456042", "problem_id": "p03480", "submission1_id": "s521166656", "submission2_id": "s748290263", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input();l=[]\nfor i in range(len(s)-1):\n if s[i]!=s[i+1]:l+=[max(i+1,len(s)-i-1)]\nprint(min(l)if l else 1)", "code2": "s=input();l=[];n=len(s)\nfor i in range(n-1):\n if s[i]!=s[i+1]:l+=[max(i+1,n-i-1)]\nprint(min(l)if l else n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567558332", "date2": "1567558481", "bleu_score": "0.8701439003998203", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "11111111\n", "actual_output": "1\n", "expected_output": "8\n\n", "anno_code": ["s=input();l=[] # (0): s=11111111, l=[]\nfor i in range(len(s)-1): # (1): i=0 (3): i=1 ... (15): NO CHANGE\n if s[i]!=s[i+1]:l+=[max(i+1,len(s)-i-1)] # (2): NO CHANGE (4): NO CHANGE ... (14): NO CHANGE\nprint(min(l)if l else 1)"], "anno_status": [true], "diff_content": "-s=input();l=[]\n-for i in range(len(s)-1):\n- if s[i]!=s[i+1]:l+=[max(i+1,len(s)-i-1)]\n-print(min(l)if l else 1)\n+s=input();l=[];n=len(s)\n+for i in range(n-1):\n+ if s[i]!=s[i+1]:l+=[max(i+1,n-i-1)]\n+print(min(l)if l else n)\n", "FL_content": "-s=input();l=[]\n-for i in range(len(s)-1):\n- if s[i]!=s[i+1]:l+=[max(i+1,len(s)-i-1)]\n-print(min(l)if l else 1)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 4 }, { "user_id": "u547167033", "problem_id": "p03480", "submission1_id": "s733491833", "submission2_id": "s738352830", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nn=len(s)\nans=-1\nfor i in range(n-1):\n if s[i+1]!=s[i]: \n ans=max(ans,max(i,n-i-1))\nif ans==-1:\n ans=n\nprint(ans)", "code2": "s=input()\nn=len(s)\nans=n\nfor i in range(n-1):\n if s[i+1]!=s[i]: \n ans=min(ans,max(i+1,n-i-1))\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585961860", "date2": "1585962094", "bleu_score": "0.779959417452936", "code1_test_status": [0, 0, 1, 1, 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, 1, 0, 0, 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, 1], "code1_test_score": 8, "total_score": 63, "input": "100111000\n", "actual_output": "8\n", "expected_output": "6\n\n", "anno_code": ["s=input() # (0): s=100111000\nn=len(s) # (1): n=9\nans=-1 # (2): ans=-1\nfor i in range(n-1): # (3): i=0 (6): i=1 ... (22): NO CHANGE\n if s[i+1]!=s[i]: # (4): NO CHANGE (7): NO CHANGE ... (21): NO CHANGE\n ans=max(ans,max(i,n-i-1)) # (5): ans=8 (10): NO CHANGE (17): NO CHANGE\nif ans==-1: # (23): NO CHANGE\n ans=n\nprint(ans)"], "anno_status": [true], "diff_content": " s=input()\n n=len(s)\n-ans=-1\n+ans=n\n for i in range(n-1):\n if s[i+1]!=s[i]: \n- ans=max(ans,max(i,n-i-1))\n-if ans==-1:\n- ans=n\n+ ans=min(ans,max(i+1,n-i-1))\n print(ans)\n", "FL_content": " s=input()\n n=len(s)\n-ans=-1\n for i in range(n-1):\n if s[i+1]!=s[i]: \n- ans=max(ans,max(i,n-i-1))\n-if ans==-1:\n- ans=n\n print(ans)\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u423585790", "problem_id": "p03480", "submission1_id": "s523183730", "submission2_id": "s859484976", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5)\nstdin = sys.stdin\nbisect_left = bisect.bisect_left\nbisect_right = bisect.bisect_right\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n\n\ndef B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n\n\ndef C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n\n\n\n\n\ndef D():\n s = S()\n ans = inf\n n = len(s)\n for i in range(n - 1):\n if s[i] != s[i + 1]:\n ans = min(ans, max(i + 1, n - i - 1))\n print(ans if ans != inf else 0)\n return\n\n\nif __name__ == '__main__':\n D()\n", "code2": "\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5)\nstdin = sys.stdin\nbisect_left = bisect.bisect_left\nbisect_right = bisect.bisect_right\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n\n\ndef B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n\n\ndef C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n\n\n\n\n\ndef D():\n s = S()\n ans = inf\n n = len(s)\n for i in range(n - 1):\n if s[i] != s[i + 1]:\n ans = min(ans, max(i + 1, n - i - 1))\n print(ans if ans != inf else n )\n return\n\n\nif __name__ == '__main__':\n D()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567192050", "date2": "1567192150", "bleu_score": "0.9979627030672379", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "11111111\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5) # (0): NO CHANGE\nstdin = sys.stdin # (1): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p03480\\\\input_s523183730.txt' mode='r' encoding='utf-8'>\nbisect_left = bisect.bisect_left # (2): bisect_left=\nbisect_right = bisect.bisect_right # (3): bisect_right=, LI=, LF=, LI_=, II=, IF=, LS=, S=, IR=, LIR=, FR=, LFR=, LIR_=, SR=, LSR=\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().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 # (4): mod=1000000007\ninf = float('INF') # (5): inf=inf\n\n\ndef A(): # (6): A=\n a, b, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n\n\ndef B(): # (7): B=\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n\n\ndef C(): # (8): C=\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n\n\n\n\n\ndef D(): # (9): D=\n s = S()\n ans = inf\n n = len(s)\n for i in range(n - 1):\n if s[i] != s[i + 1]:\n ans = min(ans, max(i + 1, n - i - 1))\n print(ans if ans != inf else 0)\n return\n\n\nif __name__ == '__main__':\n D()\n"], "anno_status": [false], "diff_content": " \n from collections import defaultdict\n from collections import deque\n from heapq import heappush, heappop\n import sys\n import math\n import bisect\n import random\n import itertools\n sys.setrecursionlimit(10**5)\n stdin = sys.stdin\n bisect_left = bisect.bisect_left\n bisect_right = bisect.bisect_right\n def LI(): return list(map(int, stdin.readline().split()))\n def LF(): return list(map(float, stdin.readline().split()))\n def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\n def II(): return int(stdin.readline())\n def IF(): return float(stdin.readline())\n def LS(): return list(map(list, stdin.readline().split()))\n def S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n \n \n def B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n \n \n def C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n \n \n \n \n \n def D():\n s = S()\n ans = inf\n n = len(s)\n for i in range(n - 1):\n if s[i] != s[i + 1]:\n ans = min(ans, max(i + 1, n - i - 1))\n- print(ans if ans != inf else 0)\n+ print(ans if ans != inf else n )\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "FL_content": " \n from collections import defaultdict\n from collections import deque\n from heapq import heappush, heappop\n import sys\n import math\n import bisect\n import random\n import itertools\n sys.setrecursionlimit(10**5)\n stdin = sys.stdin\n bisect_left = bisect.bisect_left\n bisect_right = bisect.bisect_right\n def LI(): return list(map(int, stdin.readline().split()))\n def LF(): return list(map(float, stdin.readline().split()))\n def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\n def II(): return int(stdin.readline())\n def IF(): return float(stdin.readline())\n def LS(): return list(map(list, stdin.readline().split()))\n def S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n \n \n def B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n \n \n def C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n \n \n \n \n \n def D():\n s = S()\n ans = inf\n n = len(s)\n for i in range(n - 1):\n if s[i] != s[i + 1]:\n ans = min(ans, max(i + 1, n - i - 1))\n- print(ans if ans != inf else 0)\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 81 }, { "user_id": "u595952233", "problem_id": "p03480", "submission1_id": "s272256159", "submission2_id": "s123987403", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(map(int, list(input())))\nans = 10**9\nfor i in range(len(s)-1):\n if s[i]!=s[i+1]:\n ans = min(ans, max(i+1, len(s)-i-1))\nprint(ans)\n", "code2": "s = list(map(int, list(input())))\nans = len(s)\nfor i in range(len(s)-1):\n if s[i]!=s[i+1]:\n ans = min(ans, max(i+1, len(s)-i-1))\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596888970", "date2": "1596889182", "bleu_score": "0.9494024437157565", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "11111111\n", "actual_output": "1000000000\n", "expected_output": "8\n\n", "anno_code": ["s = list(map(int, list(input()))) # (0): s=[1, 1, 1, 1, 1, 1, 1, 1]\nans = 10**9 # (1): ans=1000000000\nfor i in range(len(s)-1): # (2): i=0 (4): i=1 ... (16): NO CHANGE\n if s[i]!=s[i+1]: # (3): NO CHANGE (5): NO CHANGE ... (15): NO CHANGE\n ans = min(ans, max(i+1, len(s)-i-1))\nprint(ans)\n"], "anno_status": [true], "diff_content": " s = list(map(int, list(input())))\n-ans = 10**9\n+ans = len(s)\n for i in range(len(s)-1):\n if s[i]!=s[i+1]:\n ans = min(ans, max(i+1, len(s)-i-1))\n print(ans)\n \n", "FL_content": " s = list(map(int, list(input())))\n-ans = 10**9\n for i in range(len(s)-1):\n if s[i]!=s[i+1]:\n ans = min(ans, max(i+1, len(s)-i-1))\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u423585790", "problem_id": "p03480", "submission1_id": "s793205258", "submission2_id": "s859484976", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5)\nstdin = sys.stdin\nbisect_left = bisect.bisect_left\nbisect_right = bisect.bisect_right\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n\n\ndef B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n\n\ndef C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n\n\ndef D():\n s = S()\n lis = [0]\n i = 0\n while i < len(s):\n si = s[i]\n b = 0\n for k in range(i, len(s)):\n if si == s[k]:\n b += 1\n continue\n i = k\n lis.append(b)\n break\n else:\n i = k\n lis.append(b)\n if i == len(s) - 1:\n lis.append(0)\n i += 1\n if len(lis) == 4:\n print(max(lis[1:3]))\n else:\n ans = inf\n for i in range(1, len(lis) - 2):\n ans = min(ans, lis[i] + lis[i + 1])\n print(ans)\n return\n\n\nif __name__ == '__main__':\n D()\n", "code2": "\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5)\nstdin = sys.stdin\nbisect_left = bisect.bisect_left\nbisect_right = bisect.bisect_right\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n\n\ndef B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n\n\ndef C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n\n\n\n\n\ndef D():\n s = S()\n ans = inf\n n = len(s)\n for i in range(n - 1):\n if s[i] != s[i + 1]:\n ans = min(ans, max(i + 1, n - i - 1))\n print(ans if ans != inf else n )\n return\n\n\nif __name__ == '__main__':\n D()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567191106", "date2": "1567192150", "bleu_score": "0.7736751287767039", "code1_test_status": [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, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 10, "total_score": 63, "input": "11101001\n", "actual_output": "2\n", "expected_output": "4\n\n", "anno_code": ["\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5) # (0): NO CHANGE\nstdin = sys.stdin # (1): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p03480\\\\input_s793205258.txt' mode='r' encoding='utf-8'>\nbisect_left = bisect.bisect_left # (2): bisect_left=\nbisect_right = bisect.bisect_right # (3): bisect_right=, LI=, LF=, LI_=, II=, IF=, LS=, S=, IR=, LIR=, FR=, LFR=, LIR_=, SR=, LSR=\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().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 # (4): mod=1000000007\ninf = float('INF') # (5): inf=inf\n\n\ndef A(): # (6): A=\n a, b, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n\n\ndef B(): # (7): B=\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n\n\ndef C(): # (8): C=\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n\n\ndef D(): # (9): D=\n s = S()\n lis = [0]\n i = 0\n while i < len(s):\n si = s[i]\n b = 0\n for k in range(i, len(s)):\n if si == s[k]:\n b += 1\n continue\n i = k\n lis.append(b)\n break\n else:\n i = k\n lis.append(b)\n if i == len(s) - 1:\n lis.append(0)\n i += 1\n if len(lis) == 4:\n print(max(lis[1:3]))\n else:\n ans = inf\n for i in range(1, len(lis) - 2):\n ans = min(ans, lis[i] + lis[i + 1])\n print(ans)\n return\n\n\nif __name__ == '__main__':\n D()\n"], "anno_status": [false], "diff_content": " \n from collections import defaultdict\n from collections import deque\n from heapq import heappush, heappop\n import sys\n import math\n import bisect\n import random\n import itertools\n sys.setrecursionlimit(10**5)\n stdin = sys.stdin\n bisect_left = bisect.bisect_left\n bisect_right = bisect.bisect_right\n def LI(): return list(map(int, stdin.readline().split()))\n def LF(): return list(map(float, stdin.readline().split()))\n def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\n def II(): return int(stdin.readline())\n def IF(): return float(stdin.readline())\n def LS(): return list(map(list, stdin.readline().split()))\n def S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n \n \n def B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n \n \n def C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n \n \n+\n+\n+\n def D():\n s = S()\n- lis = [0]\n- i = 0\n- while i < len(s):\n- si = s[i]\n- b = 0\n- for k in range(i, len(s)):\n- if si == s[k]:\n- b += 1\n- continue\n- i = k\n- lis.append(b)\n- break\n- else:\n- i = k\n- lis.append(b)\n- if i == len(s) - 1:\n- lis.append(0)\n- i += 1\n- if len(lis) == 4:\n- print(max(lis[1:3]))\n- else:\n- ans = inf\n- for i in range(1, len(lis) - 2):\n- ans = min(ans, lis[i] + lis[i + 1])\n- print(ans)\n+ ans = inf\n+ n = len(s)\n+ for i in range(n - 1):\n+ if s[i] != s[i + 1]:\n+ ans = min(ans, max(i + 1, n - i - 1))\n+ print(ans if ans != inf else n )\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "FL_content": " \n from collections import defaultdict\n from collections import deque\n from heapq import heappush, heappop\n import sys\n import math\n import bisect\n import random\n import itertools\n sys.setrecursionlimit(10**5)\n stdin = sys.stdin\n bisect_left = bisect.bisect_left\n bisect_right = bisect.bisect_right\n def LI(): return list(map(int, stdin.readline().split()))\n def LF(): return list(map(float, stdin.readline().split()))\n def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\n def II(): return int(stdin.readline())\n def IF(): return float(stdin.readline())\n def LS(): return list(map(list, stdin.readline().split()))\n def S(): return list(stdin.readline().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, c, d = LI()\n a += b\n c += d\n ans = [\"Left\", \"Right\"]\n if a == c:\n print(\"Balanced\")\n return\n print(ans[a < c])\n return\n \n \n def B():\n n, a, b = LI()\n ans = 0\n for i in range(1, n + 1):\n if a <= sum(list(map(int, list(str(i))))) <= b:\n ans += i\n print(ans) \n \n return\n \n \n def C():\n x, y = LI()\n ans = 0\n while x <= y:\n ans += 1\n x *= 2\n print(ans)\n return\n \n \n def D():\n s = S()\n- lis = [0]\n- i = 0\n- while i < len(s):\n- si = s[i]\n- b = 0\n- for k in range(i, len(s)):\n- if si == s[k]:\n- b += 1\n- continue\n- i = k\n- lis.append(b)\n- break\n- else:\n- i = k\n- lis.append(b)\n- if i == len(s) - 1:\n- lis.append(0)\n- i += 1\n- if len(lis) == 4:\n- print(max(lis[1:3]))\n- else:\n- ans = inf\n- for i in range(1, len(lis) - 2):\n- ans = min(ans, lis[i] + lis[i + 1])\n- print(ans)\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "added_lines": 9, "removed_lines": 25, "code1_lines": 97 }, { "user_id": "u057109575", "problem_id": "p03480", "submission1_id": "s279526645", "submission2_id": "s643681911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\nans = 10 ** 6\nfor k in range(N - 1):\n if S[k] != S[k + 1]:\n ans = min(ans, max(k + 1, N - k - 1))\n \nif ans != 0:\n print(ans)\nelse:\n print(N)", "code2": "S = input()\nN = len(S)\nans = 10 ** 6\nfor k in range(N - 1):\n if S[k] != S[k + 1]:\n ans = min(ans, max(k + 1, N - k - 1))\n \nif ans != 10 ** 6:\n print(ans)\nelse:\n print(N)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562526644", "date2": "1562526822", "bleu_score": "0.9566132890145923", "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, 1, 1, 1, 1, 1, 1, 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": 61, "total_score": 63, "input": "11111111\n", "actual_output": "1000000\n", "expected_output": "8\n\n", "anno_code": ["S = input() # (0): S=11111111\nN = len(S) # (1): N=8\nans = 10 ** 6 # (2): ans=1000000\nfor k in range(N - 1): # (3): k=0 (5): k=1 ... (17): NO CHANGE\n if S[k] != S[k + 1]: # (4): NO CHANGE (6): NO CHANGE ... (16): NO CHANGE\n ans = min(ans, max(k + 1, N - k - 1))\n \nif ans != 0: # (18): NO CHANGE\n print(ans)\nelse:\n print(N)"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n ans = 10 ** 6\n for k in range(N - 1):\n if S[k] != S[k + 1]:\n ans = min(ans, max(k + 1, N - k - 1))\n \n-if ans != 0:\n+if ans != 10 ** 6:\n print(ans)\n else:\n print(N)\n", "FL_content": " S = input()\n N = len(S)\n ans = 10 ** 6\n for k in range(N - 1):\n if S[k] != S[k + 1]:\n ans = min(ans, max(k + 1, N - k - 1))\n \n-if ans != 0:\n print(ans)\n else:\n print(N)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u372144784", "problem_id": "p03480", "submission1_id": "s474066148", "submission2_id": "s203003609", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\nk = 10**9\nif not \"1\" in s:\n print(0)\nelif not \"0\" in s:\n print(n)\nelse:\n for i in range(n-1):\n if s[i] != s[i+1]:\n k = min(k,max(i+1,n-(i+1)))\n if k > n:\n print(n)\n else:\n print(k)\n", "code2": "s = input()\nn = len(s)\nk = 10**9\nif not \"1\" in s:\n print(n)\nelif not \"0\" in s:\n print(n)\nelse:\n for i in range(n-1):\n if s[i] != s[i+1]:\n k = min(k,max(i+1,n-(i+1)))\n if k > n:\n print(n)\n else:\n print(k)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579888645", "date2": "1579888785", "bleu_score": "0.989949330384878", "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, 1, 1, 1, 1, 1, 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": 62, "total_score": 63, "input": "000000000\n", "actual_output": "0\n", "expected_output": "9\n\n", "anno_code": ["s = input() # (0): s=000000000\nn = len(s) # (1): n=9\nk = 10**9 # (2): k=1000000000\nif not \"1\" in s: # (3): NO CHANGE\n print(0)\nelif not \"0\" in s:\n print(n)\nelse:\n for i in range(n-1):\n if s[i] != s[i+1]:\n k = min(k,max(i+1,n-(i+1)))\n if k > n:\n print(n)\n else:\n print(k)\n"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n k = 10**9\n if not \"1\" in s:\n- print(0)\n+ print(n)\n elif not \"0\" in s:\n print(n)\n else:\n for i in range(n-1):\n if s[i] != s[i+1]:\n k = min(k,max(i+1,n-(i+1)))\n if k > n:\n print(n)\n else:\n print(k)\n \n", "FL_content": " s = input()\n n = len(s)\n k = 10**9\n if not \"1\" in s:\n- print(0)\n elif not \"0\" in s:\n print(n)\n else:\n for i in range(n-1):\n if s[i] != s[i+1]:\n k = min(k,max(i+1,n-(i+1)))\n if k > n:\n print(n)\n else:\n print(k)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u361243145", "problem_id": "p03480", "submission1_id": "s916975861", "submission2_id": "s112068639", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import decimal\n\nS = input()\n\nans = decimal.Decimal(\"inf\")\nfor i in range(len(S)-1):\n if S[i] != S[i+1]:\n ans = min(ans, max(i, len(S)-i))\n\nprint(ans)\n", "code2": "S = input()\n\nans = len(S)\nfor i in range(1, len(S)):\n if S[i-1] != S[i]:\n ans = min(ans, max(i, len(S)-i))\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556501815", "date2": "1556502918", "bleu_score": "0.6961656365246609", "code1_test_status": [0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0], "code1_test_score": 38, "total_score": 63, "input": "100000111\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["import decimal\n\nS = input() # (0): S=100000111\n\nans = decimal.Decimal(\"inf\") # (1): ans=Infinity\nfor i in range(len(S)-1): # (2): i=0 (5): i=1 ... (20): NO CHANGE\n if S[i] != S[i+1]: # (3): NO CHANGE (6): NO CHANGE ... (19): NO CHANGE\n ans = min(ans, max(i, len(S)-i)) # (4): ans=9 (15): ans=5\n\nprint(ans)\n"], "anno_status": [true], "diff_content": "-import decimal\n-\n S = input()\n \n-ans = decimal.Decimal(\"inf\")\n-for i in range(len(S)-1):\n- if S[i] != S[i+1]:\n+ans = len(S)\n+for i in range(1, len(S)):\n+ if S[i-1] != S[i]:\n ans = min(ans, max(i, len(S)-i))\n \n print(ans)\n \n", "FL_content": "-import decimal\n-\n S = input()\n \n-ans = decimal.Decimal(\"inf\")\n-for i in range(len(S)-1):\n- if S[i] != S[i+1]:\n ans = min(ans, max(i, len(S)-i))\n \n print(ans)\n \n", "added_lines": 3, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u218843509", "problem_id": "p03039", "submission1_id": "s758583015", "submission2_id": "s080248947", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10**9 + 7\nlist_size = 200001\n\nf_list = [1] * list_size\nf_r_list = [1] * list_size\n\nfor i in range(list_size - 1):\n\tf_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)\n\nf_r_list[-1] = pow(f_list[-1], MOD - 2, MOD)\n\nfor i in range(2, list_size + 1):\n\tf_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD)\n\ndef comb(n, r):\n\tif n < r:\n\t\treturn 0\n\telif n == 0 or r == 0 or n == r:\n\t\treturn 1\n\telse:\n\t\treturn (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD \n\nn, m, k = map(int, input().split())\nprint(int((((n+m)*k*(k-1))/6)*comb(n*m, k)%MOD))", "code2": "MOD = 10**9 + 7\nlist_size = 200001\n\nf_list = [1] * list_size\nf_r_list = [1] * list_size\n\nfor i in range(list_size - 1):\n\tf_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)\n\nf_r_list[-1] = pow(f_list[-1], MOD - 2, MOD)\n\nfor i in range(2, list_size + 1):\n\tf_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD)\n\ndef comb(n, r):\n\tif n < r:\n\t\treturn 0\n\telif n == 0 or r == 0 or n == r:\n\t\treturn 1\n\telse:\n\t\treturn (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD \n\nn, m, k = map(int, input().split())\nprint((((n+m)*n*m*(m*n-1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558898630", "date2": "1558900269", "bleu_score": "0.9498070976477058", "code1_test_status": [0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0], "code1_test_score": 56, "total_score": 92, "input": "111 101 2816\n", "actual_output": "524220214\n", "expected_output": "190886879\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " MOD = 10**9 + 7\n list_size = 200001\n \n f_list = [1] * list_size\n f_r_list = [1] * list_size\n \n for i in range(list_size - 1):\n \tf_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)\n \n f_r_list[-1] = pow(f_list[-1], MOD - 2, MOD)\n \n for i in range(2, list_size + 1):\n \tf_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD)\n \n def comb(n, r):\n \tif n < r:\n \t\treturn 0\n \telif n == 0 or r == 0 or n == r:\n \t\treturn 1\n \telse:\n \t\treturn (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD \n \n n, m, k = map(int, input().split())\n-print(int((((n+m)*k*(k-1))/6)*comb(n*m, k)%MOD))\n+print((((n+m)*n*m*(m*n-1))\n", "FL_content": " MOD = 10**9 + 7\n list_size = 200001\n \n f_list = [1] * list_size\n f_r_list = [1] * list_size\n \n for i in range(list_size - 1):\n \tf_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)\n \n f_r_list[-1] = pow(f_list[-1], MOD - 2, MOD)\n \n for i in range(2, list_size + 1):\n \tf_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD)\n \n def comb(n, r):\n \tif n < r:\n \t\treturn 0\n \telif n == 0 or r == 0 or n == r:\n \t\treturn 1\n \telse:\n \t\treturn (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD \n \n n, m, k = map(int, input().split())\n-print(int((((n+m)*k*(k-1))/6)*comb(n*m, k)%MOD))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u316341119", "problem_id": "p03039", "submission1_id": "s343244875", "submission2_id": "s483161957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M, K = map(int, input().split())\n\nMOD = 10**9+7\n\ndef comb(n, r):\n r = n-r if n-r < r else r\n if r == 0:\n return 1\n ndfact = 1\n for i in range(n, n-r, -1):\n ndfact *= i\n ndfact %= MOD\n rfact = 1\n for i in range(r, 1, -1):\n rfact *= i\n rfact %= MOD\n return ndfact \n\np = comb(N*M-2, K-2) % MOD\nans = 0\nfor i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n ans += d * cnt\n ans %= MOD\n\nprint((ans*p)%MOD)\n", "code2": "from math import factorial\nN, M, K = map(int, input().split())\n\nMOD = 10**9+7\n\nfact = [1] * (N*M+1)\nfor i in range(2, N*M+1):\n fact[i] = fact[i-1] * i % MOD\n\ndef comb(n, r):\n r = n-r if n-r < r else r\n return fact[n] * pow(fact[r], MOD-2, MOD) * pow(fact[n-r], MOD-2, MOD) % MOD\n\np = comb(N*M-2, K-2)\nans = 0\nfor i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n ans += d * cnt % MOD\nans = ans * p % MOD\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558845599", "date2": "1558849426", "bleu_score": "0.7254472596372423", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 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, 1, 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], "code1_test_score": 13, "total_score": 92, "input": "101 111 38\n", "actual_output": "161350482\n", "expected_output": "745365380\n\n", "anno_code": ["N, M, K = map(int, input().split()) # (0): N=101, M=111, K=38\n\nMOD = 10**9+7 # (1): MOD=1000000007\n\ndef comb(n, r): # (2): comb=\n r = n-r if n-r < r else r # (4): NO CHANGE\n if r == 0: # (5): NO CHANGE\n return 1\n ndfact = 1 # (6): ndfact=1\n for i in range(n, n-r, -1): # (7): i=11209 (10): i=11208 ... (115): NO CHANGE\n ndfact *= i # (8): ndfact=11209 (11): ndfact=125630472 ... (113): ndfact=2242037254538\n ndfact %= MOD # (9): NO CHANGE (12): NO CHANGE ... (114): ndfact=37238844\n rfact = 1 # (116): rfact=1\n for i in range(r, 1, -1): # (117): i=36 (120): i=35 ... (222): N=101, M=111, K=38, MOD=1000000007, comb=, p=37238844\n rfact *= i # (118): rfact=36 (121): rfact=1260 ... (220): rfact=523095984\n rfact %= MOD # (119): NO CHANGE (122): NO CHANGE ... (221): NO CHANGE\n return ndfact \n\np = comb(N*M-2, K-2) % MOD # (3): n=11209, r=36\nans = 0 # (223): ans=0\nfor i in range(N): # (224): i=0 (999): i=1 ... (89899): NO CHANGE\n for j in range(M): # (225): j=0 (228): j=1 ... (89898): NO CHANGE\n if i == 0 and j == 0: # (226): NO CHANGE (229): NO CHANGE ... (89891): NO CHANGE\n continue # (227): NO CHANGE\n d = i+j # (230): d=1 (237): d=2 ... (89892): d=210\n cnt = (N-i) * (M-j) # (231): cnt=11110 (238): cnt=11009 ... (89893): cnt=1\n if i != 0 and j != 0: # (232): NO CHANGE (239): NO CHANGE ... (89894): NO CHANGE\n cnt *= 2 # (1012): cnt=22000 (1020): cnt=21800 ... (89895): cnt=2\n ans += d * cnt # (233): ans=11110 (240): ans=33128 ... (89896): ans=440527592\n ans %= MOD # (234): NO CHANGE (241): NO CHANGE ... (89897): NO CHANGE\n\nprint((ans*p)%MOD)\n"], "anno_status": [true], "diff_content": "+from math import factorial\n N, M, K = map(int, input().split())\n \n MOD = 10**9+7\n \n+fact = [1] * (N*M+1)\n+for i in range(2, N*M+1):\n+ fact[i] = fact[i-1] * i % MOD\n+\n def comb(n, r):\n r = n-r if n-r < r else r\n- if r == 0:\n- return 1\n- ndfact = 1\n- for i in range(n, n-r, -1):\n- ndfact *= i\n- ndfact %= MOD\n- rfact = 1\n- for i in range(r, 1, -1):\n- rfact *= i\n- rfact %= MOD\n- return ndfact \n+ return fact[n] * pow(fact[r], MOD-2, MOD) * pow(fact[n-r], MOD-2, MOD) % MOD\n \n-p = comb(N*M-2, K-2) % MOD\n+p = comb(N*M-2, K-2)\n ans = 0\n for i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n- ans += d * cnt\n- ans %= MOD\n+ ans += d * cnt % MOD\n+ans = ans * p % MOD\n \n-print((ans*p)%MOD)\n+print(ans)\n \n", "FL_content": " N, M, K = map(int, input().split())\n \n MOD = 10**9+7\n \n def comb(n, r):\n r = n-r if n-r < r else r\n- if r == 0:\n- return 1\n- ndfact = 1\n- for i in range(n, n-r, -1):\n- ndfact *= i\n- ndfact %= MOD\n- rfact = 1\n- for i in range(r, 1, -1):\n- rfact *= i\n- rfact %= MOD\n- return ndfact \n \n-p = comb(N*M-2, K-2) % MOD\n ans = 0\n for i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n- ans += d * cnt\n- ans %= MOD\n \n-print((ans*p)%MOD)\n \n", "added_lines": 10, "removed_lines": 15, "code1_lines": 33 }, { "user_id": "u724687935", "problem_id": "p03039", "submission1_id": "s524515759", "submission2_id": "s331172684", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10 ** 9 + 7\n\n\ndef prepare(n):\n global MOD\n modFacts = [0] * (n + 1)\n modFacts[0] = 1\n for i in range(n):\n modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD\n\n invs = [1] * (n + 1)\n invs[n] = pow(modFacts[n], MOD - 2, MOD)\n for i in range(n, 1, -1):\n invs[i - 1] = (invs[i] * i) % MOD\n\n return modFacts, invs\n\n\ndef modCombi(n, r):\n global MOD\n return (modFacts[n] * invs[n - r] * invs[r]) % MOD\n\n\nN, M, K = map(int, input().split())\nmodFacts, invs = prepare(N * M)\nvar = modCombi(N * M - 2, K - 2)\n\nans = 0\nif N < M:\n N, M = M, N\nL = [0] * (N + 1)\nfor i in range(1, N + 1):\n L[i] = L[i - 1] + i\nfor x in range(1, N + 1):\n Sx = (M * (L[N - x] + L[x - 1])) % MOD\n Sy = (N * (L[M - x] + L[x - 1])) % MOD\n ans += ((Sx + Sy) * M) % MOD\n\nprint((ans * invs[2] * var) % MOD)\n\n", "code2": "MOD = 10 ** 9 + 7\n\n\ndef prepare(n):\n global MOD\n modFacts = [0] * (n + 1)\n modFacts[0] = 1\n for i in range(n):\n modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD\n\n invs = [1] * (n + 1)\n invs[n] = pow(modFacts[n], MOD - 2, MOD)\n for i in range(n, 1, -1):\n invs[i - 1] = (invs[i] * i) % MOD\n\n return modFacts, invs\n\n\ndef modCombi(n, r):\n global MOD\n return (modFacts[n] * invs[n - r] * invs[r]) % MOD\n\n\nN, M, K = map(int, input().split())\nmodFacts, invs = prepare(N * M)\nvar = modCombi(N * M - 2, K - 2)\n\nans = 0\nif N < M:\n N, M = M, N\nL = [0] * (N + 1)\nfor i in range(1, N + 1):\n L[i] = L[i - 1] + i\nfor x in range(1, N + 1):\n for y in range(1, M + 1):\n Sx = (M * (L[N - x] + L[x - 1])) % MOD\n Sy = (N * (L[M - y] + L[y - 1])) % MOD\n ans += (Sx + Sy) % MOD\n\nprint((ans * invs[2] * var) % MOD)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582202483", "date2": "1582274002", "bleu_score": "0.9461222175363854", "code1_test_status": [1, 1, 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, 1, 0, 0, 0, 0, 1, 1, 0, 1, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1], "code1_test_score": 17, "total_score": 92, "input": "100 111 3\n", "actual_output": "343089299\n", "expected_output": "25289126\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " MOD = 10 ** 9 + 7\n \n \n def prepare(n):\n global MOD\n modFacts = [0] * (n + 1)\n modFacts[0] = 1\n for i in range(n):\n modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD\n \n invs = [1] * (n + 1)\n invs[n] = pow(modFacts[n], MOD - 2, MOD)\n for i in range(n, 1, -1):\n invs[i - 1] = (invs[i] * i) % MOD\n \n return modFacts, invs\n \n \n def modCombi(n, r):\n global MOD\n return (modFacts[n] * invs[n - r] * invs[r]) % MOD\n \n \n N, M, K = map(int, input().split())\n modFacts, invs = prepare(N * M)\n var = modCombi(N * M - 2, K - 2)\n \n ans = 0\n if N < M:\n N, M = M, N\n L = [0] * (N + 1)\n for i in range(1, N + 1):\n L[i] = L[i - 1] + i\n for x in range(1, N + 1):\n- Sx = (M * (L[N - x] + L[x - 1])) % MOD\n- Sy = (N * (L[M - x] + L[x - 1])) % MOD\n- ans += ((Sx + Sy) * M) % MOD\n+ for y in range(1, M + 1):\n+ Sx = (M * (L[N - x] + L[x - 1])) % MOD\n+ Sy = (N * (L[M - y] + L[y - 1])) % MOD\n+ ans += (Sx + Sy) % MOD\n \n print((ans * invs[2] * var) % MOD)\n \n \n", "FL_content": " MOD = 10 ** 9 + 7\n \n \n def prepare(n):\n global MOD\n modFacts = [0] * (n + 1)\n modFacts[0] = 1\n for i in range(n):\n modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD\n \n invs = [1] * (n + 1)\n invs[n] = pow(modFacts[n], MOD - 2, MOD)\n for i in range(n, 1, -1):\n invs[i - 1] = (invs[i] * i) % MOD\n \n return modFacts, invs\n \n \n def modCombi(n, r):\n global MOD\n return (modFacts[n] * invs[n - r] * invs[r]) % MOD\n \n \n N, M, K = map(int, input().split())\n modFacts, invs = prepare(N * M)\n var = modCombi(N * M - 2, K - 2)\n \n ans = 0\n if N < M:\n N, M = M, N\n L = [0] * (N + 1)\n for i in range(1, N + 1):\n L[i] = L[i - 1] + i\n for x in range(1, N + 1):\n- Sx = (M * (L[N - x] + L[x - 1])) % MOD\n- Sy = (N * (L[M - x] + L[x - 1])) % MOD\n- ans += ((Sx + Sy) * M) % MOD\n \n print((ans * invs[2] * var) % MOD)\n \n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 41 }, { "user_id": "u524039871", "problem_id": "p03039", "submission1_id": "s829475490", "submission2_id": "s359751127", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m,k=map(int,input().split())\nM=10**9+7\ndef combi(x,y):\n c=1\n m=min(x-y,y)\n for iii in range(y):\n c=c*(x-iii)*pow(y-iii,-1)%M\n return c\n\nrem_combi=combi(n*m-2,k-2)\n\ndef calc(num):\n out=0\n for iii in range(num):\n out+=iii*(num-iii)%M\n return out\n\nx_cost=m*m*calc(n)%M\ny_cost=n*n*calc(m)%M\nans=rem_combi*(x_cost+y_cost)%M\nprint(int(ans))", "code2": "n,m,k=map(int,input().split())\nM=10**9+7\ndef combi(x,y):\n c=1\n m=min(x-y,y)\n for iii in range(y):\n c=c*(x-iii)*pow(y-iii,M-2,M)%M\n return c\n\nrem_combi=combi(n*m-2,k-2)\n\ndef calc(num):\n out=0\n for iii in range(num):\n out+=iii*(num-iii)%M\n return out\n\nx_cost=m*m*calc(n)%M\ny_cost=n*n*calc(m)%M\nans=rem_combi*(x_cost+y_cost)%M\nprint(int(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559098595", "date2": "1559098651", "bleu_score": "0.9821456482780219", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 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, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 20, "total_score": 92, "input": "110 101 1145\n", "actual_output": "102109923\n", "expected_output": "34756206\n\n", "anno_code": ["n,m,k=map(int,input().split()) # (0): n=110, m=101, k=1145\nM=10**9+7 # (1): M=1000000007\ndef combi(x,y): # (2): combi=\n c=1 # (4): c=1\n m=min(x-y,y) # (5): m=1143\n for iii in range(y): # (6): iii=0 (8): iii=1 ... (2292): n=110, m=101, k=1145, M=1000000007, combi=, rem_combi=639936840.705078\n c=c*(x-iii)*pow(y-iii,-1)%M # (7): c=9.718285 (9): c=94.519259 ... (2291): c=639936840.705078\n return c\n\nrem_combi=combi(n*m-2,k-2) # (3): x=11108, y=1143\n\ndef calc(num): # (2293): calc=\n out=0 # (2295): out=0 (2518): out=0\n for iii in range(num): # (2296): iii=0 (2298): iii=1 ... (2721): n=110, m=101, k=1145, M=1000000007, combi=, rem_combi=639936840.705078, calc=, x_cost=262734801, y_cost=77569986\n out+=iii*(num-iii)%M # (2297): NO CHANGE (2299): out=109 ... (2720): out=171700\n return out\n\nx_cost=m*m*calc(n)%M # (2294): num=110\ny_cost=n*n*calc(m)%M # (2517): num=101\nans=rem_combi*(x_cost+y_cost)%M # (2722): ans=745179552.0\nprint(int(ans))"], "anno_status": [true], "diff_content": " n,m,k=map(int,input().split())\n M=10**9+7\n def combi(x,y):\n c=1\n m=min(x-y,y)\n for iii in range(y):\n- c=c*(x-iii)*pow(y-iii,-1)%M\n+ c=c*(x-iii)*pow(y-iii,M-2,M)%M\n return c\n \n rem_combi=combi(n*m-2,k-2)\n \n def calc(num):\n out=0\n for iii in range(num):\n out+=iii*(num-iii)%M\n return out\n \n x_cost=m*m*calc(n)%M\n y_cost=n*n*calc(m)%M\n ans=rem_combi*(x_cost+y_cost)%M\n print(int(ans))\n", "FL_content": " n,m,k=map(int,input().split())\n M=10**9+7\n def combi(x,y):\n c=1\n m=min(x-y,y)\n for iii in range(y):\n- c=c*(x-iii)*pow(y-iii,-1)%M\n return c\n \n rem_combi=combi(n*m-2,k-2)\n \n def calc(num):\n out=0\n for iii in range(num):\n out+=iii*(num-iii)%M\n return out\n \n x_cost=m*m*calc(n)%M\n y_cost=n*n*calc(m)%M\n ans=rem_combi*(x_cost+y_cost)%M\n print(int(ans))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u227082700", "problem_id": "p03039", "submission1_id": "s991424053", "submission2_id": "s481435936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m,k=map(int,input().split())\nmod=10**9+7\nf=[1]\nfor i in range(2*10**5+7):f+=[f[-1]*(i+1)%mod]\ndef comb(a,b):return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod\nans=0\nfor i in range(1,n):\n ans+=(i*(n-i)*m**2)*(comb(n+m-2,k-2))\n ans%=mod\nfor i in range(1,m):\n ans+=(i*(m-i)*n**2)*(comb(n+m-2,k-2))\n ans%=mod\nprint(ans)", "code2": "n,m,k=map(int,input().split())\nmod=10**9+7\nf=[1]\nfor i in range(2*10**5+7):f+=[f[-1]*(i+1)%mod]\ndef comb(a,b):return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod\nans=0\nfor i in range(1,n):\n ans+=(i*(n-i)*m**2)*(comb(n*m-2,k-2))\n ans%=mod\nfor i in range(1,m):\n ans+=(i*(m-i)*n**2)*(comb(n*m-2,k-2))\n ans%=mod\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587562123", "date2": "1587562219", "bleu_score": "0.9846382470165468", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "101 111 38\n", "actual_output": "961797304\n", "expected_output": "745365380\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n,m,k=map(int,input().split())\n mod=10**9+7\n f=[1]\n for i in range(2*10**5+7):f+=[f[-1]*(i+1)%mod]\n def comb(a,b):return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod\n ans=0\n for i in range(1,n):\n- ans+=(i*(n-i)*m**2)*(comb(n+m-2,k-2))\n+ ans+=(i*(n-i)*m**2)*(comb(n*m-2,k-2))\n ans%=mod\n for i in range(1,m):\n- ans+=(i*(m-i)*n**2)*(comb(n+m-2,k-2))\n+ ans+=(i*(m-i)*n**2)*(comb(n*m-2,k-2))\n ans%=mod\n print(ans)\n", "FL_content": " n,m,k=map(int,input().split())\n mod=10**9+7\n f=[1]\n for i in range(2*10**5+7):f+=[f[-1]*(i+1)%mod]\n def comb(a,b):return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod\n ans=0\n for i in range(1,n):\n- ans+=(i*(n-i)*m**2)*(comb(n+m-2,k-2))\n ans%=mod\n for i in range(1,m):\n- ans+=(i*(m-i)*n**2)*(comb(n+m-2,k-2))\n ans%=mod\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u046432236", "problem_id": "p03039", "submission1_id": "s501011609", "submission2_id": "s916489600", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def cmb(n, r):\n if n - r < r: r = n - r\n if r == 0: return 1\n if r == 1: return n\n\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n\n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p-1,r,p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n\n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n\n return result\n\nlist=input().split(\" \")\nn=int(list[0])\nm=int(list[1])\nk=int(list[2])\n\nniko1=int(m*m*(n*(n+1)*(2*n+1)/6 - (n+1)*n*(n+1)/2 + n*n*(n+1)/2))\nniko2=int(n*n*(m*(m+1)*(2*m+1)/6 - (m+1)*m*(m+1)/2 + m*m*(m+1)/2))\nniko1=niko1%(10**9+7)\nniko2=niko2%(10**9+7)\nniko=niko1+niko2\nkosu=cmb(m*n-2, k-2)\nkosu=kosu%(10**9+7)\nkotae=int(niko*kosu/2)\nkotae=kotae%(10**9+7)\nprint(kotae)", "code2": "def cmb(n, r):\n if n - r < r: r = n - r\n if r == 0: return 1\n if r == 1: return n\n \n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n \n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p-1,r,p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n \n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n \n return result\n \nlist=input().split(\" \")\nn=int(list[0])\nm=int(list[1])\nk=int(list[2])\n \nniko1=int((n*(n+1)*(2*n+1)/6 - (n+1)*n*(n+1)/2 + n*n*(n+1)/2)/2)\nniko2=int((m*(m+1)*(2*m+1)/6 - (m+1)*m*(m+1)/2 + m*m*(m+1)/2)/2)\nniko1=niko1%(10**9+7)\nniko2=niko2%(10**9+7)\nniko1=niko1*m\nniko2=niko2*n\nniko1=niko1%(10**9+7)\nniko2=niko2%(10**9+7)\nniko1=niko1*m\nniko2=niko2*n\nniko1=niko1%(10**9+7)\nniko2=niko2%(10**9+7)\nniko=niko1+niko2\nkosu=cmb(m*n-2, k-2)\nkosu=kosu%(10**9+7)\nkotae=int(niko*kosu)\nkotae=kotae%(10**9+7)\n\nprint(kotae)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558835960", "date2": "1558836566", "bleu_score": "0.8421934125467976", "code1_test_status": [0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0], "code1_test_score": 42, "total_score": 92, "input": "100 111 681\n", "actual_output": "564141200\n", "expected_output": "564141216\n\n", "anno_code": ["def cmb(n, r): # (0): cmb=\n if n - r < r: r = n - r # (11): NO CHANGE\n if r == 0: return 1\n if r == 1: return n\n\n numerator = [n - r + k + 1 for k in range(r)] # (12): numerator=[10420, 10421, ..., 11097, 11098]\n denominator = [k + 1 for k in range(r)] # (13): denominator=[1, 2, ..., 678, 679]\n\n for p in range(2,r+1): # (14): p=2 (1036): p=3 ... (8056): NO CHANGE\n pivot = denominator[p - 1] # (15): pivot=2 (1037): pivot=3 ... (8054): NO CHANGE\n if pivot > 1: # (16): NO CHANGE (1038): NO CHANGE ... (8055): NO CHANGE\n offset = (n - r) % p # (17): offset=1 (1039): offset=0 ... (8045): offset=264\n for k in range(p-1,r,p): # (18): k=1 (21): k=3 ... (8049): NO CHANGE\n numerator[k - offset] /= pivot # (19): numerator=[5210.0, 10421, ..., 11097, 11098] (22): numerator=[5210.0, 10421, ..., 11097, 11098] ... (8047): numerator=[1.0, 1.0, ..., 3699.0, 11098]\n denominator[k] /= pivot # (20): denominator=[1, 1.0, ..., 678, 679] (23): denominator=[1, 1.0, ..., 678, 679] ... (8048): denominator=[1, 1.0, ..., 1.0, 1.0]\n\n result = 1 # (8057): result=1\n for k in range(r): # (8058): k=0 (8060): k=1 ... (9753): cmb=, list=['100', '111', '681'], n=100, m=111, k=681, niko1=106589272, niko2=558399972, niko=664989244, kosu=5694713735662451157583813963164730845817038921772942540641478763314653242804586343887204049867082672329423458847072285002359942933919692528412603938650782335982150693850253314951819735332608154770100535206096886560699945776851179396028256126856777052744224576964596029339893984628266051326916563342183624305509848721795987280235017554930573903669456962512164850499004745396581212445719753133992144443297899449028439111301032546846423456659667798264856366273234071146529233349100326758239374210753288581049187901786964827556452230747886731711641156140243427577096711367525517870198508042397511739859714092990897660453950551461185129340703460248437572993394539780693493339196975556805522432093218030379986390571508051114876970495469998968747901955275678785971629237206802007134659229377965030114422437829987107184396742631719970415363320816656868105989937734188160447871752290400094930154865031526107391887966325416007146564317443566626699459351235013418070920112407999273456923908894005701881480217691919208884192179920498055225408372792882545507292167470809393854683239765895272322292541630327831592647528480\n if numerator[k] > 1: # (8059): NO CHANGE (8061): NO CHANGE ... (9751): NO CHANGE\n result *= int(numerator[k]) # (8066): result=1489 (8069): result=1940167 ... (9752): result=5694713735662451157583813963164730845817038921772942540641478763314653242804586343887204049867082672329423458847072285002359942933919692528412603938650782335982150693850253314951819735332608154770100535206096886560699945776851179396028256126856777052744224576964596029339893984628266051326916563342183624305509848721795987280235017554930573903669456962512164850499004745396581212445719753133992144443297899449028439111301032546846423456659667798264856366273234071146529233349100326758239374210753288581049187901786964827556452230747886731711641156140243427577096711367525517870198508042397511739859714092990897660453950551461185129340703460248437572993394539780693493339196975556805522432093218030379986390571508051114876970495469998968747901955275678785971629237206802007134659229377965030114422437829987107184396742631719970415363320816656868105989937734188160447871752290400094930154865031526107391887966325416007146564317443566626699459351235013418070920112407999273456923908894005701881480217691919208884192179920498055225408372792882545507292167470809393854683239765895272322292541630327831592647528480\n\n return result\n\nlist=input().split(\" \") # (1): list=['100', '111', '681']\nn=int(list[0]) # (2): n=100\nm=int(list[1]) # (3): m=111\nk=int(list[2]) # (4): k=681\n\nniko1=int(m*m*(n*(n+1)*(2*n+1)/6 - (n+1)*n*(n+1)/2 + n*n*(n+1)/2)) # (5): niko1=4106589300\nniko2=int(n*n*(m*(m+1)*(2*m+1)/6 - (m+1)*m*(m+1)/2 + m*m*(m+1)/2)) # (6): niko2=4558400000\nniko1=niko1%(10**9+7) # (7): niko1=106589272\nniko2=niko2%(10**9+7) # (8): niko2=558399972\nniko=niko1+niko2 # (9): niko=664989244\nkosu=cmb(m*n-2, k-2) # (10): n=11098, r=679\nkosu=kosu%(10**9+7) # (9754): kosu=553523160\nkotae=int(niko*kosu/2) # (9755): kotae=184043473852445504\nkotae=kotae%(10**9+7) # (9756): kotae=564141200\nprint(kotae)"], "anno_status": [false], "diff_content": " def cmb(n, r):\n if n - r < r: r = n - r\n if r == 0: return 1\n if r == 1: return n\n-\n+ \n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n-\n+ \n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p-1,r,p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n-\n+ \n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n-\n+ \n return result\n-\n+ \n list=input().split(\" \")\n n=int(list[0])\n m=int(list[1])\n k=int(list[2])\n-\n-niko1=int(m*m*(n*(n+1)*(2*n+1)/6 - (n+1)*n*(n+1)/2 + n*n*(n+1)/2))\n-niko2=int(n*n*(m*(m+1)*(2*m+1)/6 - (m+1)*m*(m+1)/2 + m*m*(m+1)/2))\n+ \n+niko1=int((n*(n+1)*(2*n+1)/6 - (n+1)*n*(n+1)/2 + n*n*(n+1)/2)/2)\n+niko2=int((m*(m+1)*(2*m+1)/6 - (m+1)*m*(m+1)/2 + m*m*(m+1)/2)/2)\n+niko1=niko1%(10**9+7)\n+niko2=niko2%(10**9+7)\n+niko1=niko1*m\n+niko2=niko2*n\n+niko1=niko1%(10**9+7)\n+niko2=niko2%(10**9+7)\n+niko1=niko1*m\n+niko2=niko2*n\n niko1=niko1%(10**9+7)\n niko2=niko2%(10**9+7)\n niko=niko1+niko2\n kosu=cmb(m*n-2, k-2)\n kosu=kosu%(10**9+7)\n-kotae=int(niko*kosu/2)\n+kotae=int(niko*kosu)\n kotae=kotae%(10**9+7)\n+\n print(kotae)\n", "FL_content": " def cmb(n, r):\n if n - r < r: r = n - r\n if r == 0: return 1\n if r == 1: return n\n-\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n-\n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p-1,r,p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n-\n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n-\n return result\n-\n list=input().split(\" \")\n n=int(list[0])\n m=int(list[1])\n k=int(list[2])\n-\n-niko1=int(m*m*(n*(n+1)*(2*n+1)/6 - (n+1)*n*(n+1)/2 + n*n*(n+1)/2))\n-niko2=int(n*n*(m*(m+1)*(2*m+1)/6 - (m+1)*m*(m+1)/2 + m*m*(m+1)/2))\n niko1=niko1%(10**9+7)\n niko2=niko2%(10**9+7)\n niko=niko1+niko2\n kosu=cmb(m*n-2, k-2)\n kosu=kosu%(10**9+7)\n-kotae=int(niko*kosu/2)\n kotae=kotae%(10**9+7)\n print(kotae)\n", "added_lines": 18, "removed_lines": 9, "code1_lines": 38 }, { "user_id": "u316341119", "problem_id": "p03039", "submission1_id": "s246052148", "submission2_id": "s483161957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import factorial\nN, M, K = map(int, input().split())\n\nMOD = 10**9+7\n\ndef comb(n, r):\n r = n-r if n-r < r else r\n if r == 0:\n return 1\n ndfact = 1\n for i in range(n, n-r, -1):\n ndfact *= i\n ndfact %= MOD\n return ndfact \n\np = comb(N*M-2, K-2) % MOD\nans = 0\nfor i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n ans += d * cnt\n ans %= MOD\n\nprint((ans*p)%MOD)\n", "code2": "from math import factorial\nN, M, K = map(int, input().split())\n\nMOD = 10**9+7\n\nfact = [1] * (N*M+1)\nfor i in range(2, N*M+1):\n fact[i] = fact[i-1] * i % MOD\n\ndef comb(n, r):\n r = n-r if n-r < r else r\n return fact[n] * pow(fact[r], MOD-2, MOD) * pow(fact[n-r], MOD-2, MOD) % MOD\n\np = comb(N*M-2, K-2)\nans = 0\nfor i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n ans += d * cnt % MOD\nans = ans * p % MOD\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558844329", "date2": "1558849426", "bleu_score": "0.7962039475659786", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 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, 1, 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], "code1_test_score": 13, "total_score": 92, "input": "100 111 619\n", "actual_output": "38091022\n", "expected_output": "555736529\n\n", "anno_code": ["from math import factorial\nN, M, K = map(int, input().split()) # (0): N=100, M=111, K=619\n\nMOD = 10**9+7 # (1): MOD=1000000007\n\ndef comb(n, r): # (2): comb=\n r = n-r if n-r < r else r # (4): NO CHANGE\n if r == 0: # (5): NO CHANGE\n return 1\n ndfact = 1 # (6): ndfact=1\n for i in range(n, n-r, -1): # (7): i=11098 (10): i=11097 ... (1858): factorial=, N=100, M=111, K=619, MOD=1000000007, comb=, p=55309256\n ndfact *= i # (8): ndfact=11098 (11): ndfact=123154506 ... (1856): ndfact=5816055349968\n ndfact %= MOD # (9): NO CHANGE (12): NO CHANGE ... (1857): ndfact=55309256\n return ndfact \n\np = comb(N*M-2, K-2) % MOD # (3): n=11098, r=617\nans = 0 # (1859): ans=0\nfor i in range(N): # (1860): i=0 (2635): i=1 ... (90646): NO CHANGE\n for j in range(M): # (1861): j=0 (1864): j=1 ... (90645): NO CHANGE\n if i == 0 and j == 0: # (1862): NO CHANGE (1865): NO CHANGE ... (90638): NO CHANGE\n continue # (1863): NO CHANGE\n d = i+j # (1866): d=1 (1873): d=2 ... (90639): d=209\n cnt = (N-i) * (M-j) # (1867): cnt=11000 (1874): cnt=10900 ... (90640): cnt=1\n if i != 0 and j != 0: # (1868): NO CHANGE (1875): NO CHANGE ... (90641): NO CHANGE\n cnt *= 2 # (2648): cnt=21780 (2656): cnt=21582 ... (90642): cnt=2\n ans += d * cnt # (1869): ans=11000 (1876): ans=32800 ... (90643): ans=332494622\n ans %= MOD # (1870): NO CHANGE (1877): NO CHANGE ... (90644): NO CHANGE\n\nprint((ans*p)%MOD)\n"], "anno_status": [true], "diff_content": " from math import factorial\n N, M, K = map(int, input().split())\n \n MOD = 10**9+7\n \n+fact = [1] * (N*M+1)\n+for i in range(2, N*M+1):\n+ fact[i] = fact[i-1] * i % MOD\n+\n def comb(n, r):\n r = n-r if n-r < r else r\n- if r == 0:\n- return 1\n- ndfact = 1\n- for i in range(n, n-r, -1):\n- ndfact *= i\n- ndfact %= MOD\n- return ndfact \n+ return fact[n] * pow(fact[r], MOD-2, MOD) * pow(fact[n-r], MOD-2, MOD) % MOD\n \n-p = comb(N*M-2, K-2) % MOD\n+p = comb(N*M-2, K-2)\n ans = 0\n for i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n- ans += d * cnt\n- ans %= MOD\n+ ans += d * cnt % MOD\n+ans = ans * p % MOD\n \n-print((ans*p)%MOD)\n+print(ans)\n \n", "FL_content": " from math import factorial\n N, M, K = map(int, input().split())\n \n MOD = 10**9+7\n \n def comb(n, r):\n r = n-r if n-r < r else r\n- if r == 0:\n- return 1\n- ndfact = 1\n- for i in range(n, n-r, -1):\n- ndfact *= i\n- ndfact %= MOD\n- return ndfact \n \n-p = comb(N*M-2, K-2) % MOD\n ans = 0\n for i in range(N):\n for j in range(M):\n if i == 0 and j == 0:\n continue\n d = i+j\n cnt = (N-i) * (M-j)\n if i != 0 and j != 0:\n cnt *= 2\n- ans += d * cnt\n- ans %= MOD\n \n-print((ans*p)%MOD)\n \n", "added_lines": 9, "removed_lines": 11, "code1_lines": 30 }, { "user_id": "u265506056", "problem_id": "p03039", "submission1_id": "s768582534", "submission2_id": "s317202450", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M,K=map(int,input().split())\nMOD=10**9+7\nans=0\nx,y=1,1\nk=min(K-2,N*M-K)\nfor i in range(k):\n x*=N*M-2-i\n y*=K-2-i\n x%=MOD\n y%=MOD\ncomb=x*pow(y,MOD-2,MOD)\ncomb%=MOD\nfor i in range(1,N):\n a=i*comb*(N-i)*M**2\n ans+=a\n ans%=MOD\nfor i in range(1,M):\n a=i*comb*(M-i)*N**2\n ans+=a\n ans%=MOD\nprint(ans%MOD)", "code2": "N,M,K=map(int,input().split())\nMOD=10**9+7\nans=0\nx,y=1,1\nk=min(K-2,N*M-K)\nfor i in range(k):\n x*=N*M-2-i\n y*=k-i\n x%=MOD\n y%=MOD\ncomb=x*pow(y,MOD-2,MOD)\ncomb%=MOD\nfor i in range(1,N):\n a=i*comb*(N-i)*M**2\n ans+=a\n ans%=MOD\nfor i in range(1,M):\n a=i*comb*(M-i)*N**2\n ans+=a\n ans%=MOD\nprint(ans%MOD)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589840083", "date2": "1589840401", "bleu_score": "0.986250982205661", "code1_test_status": [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, 0, 1, 1, 1, 1, 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, 1, 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], "code1_test_score": 84, "total_score": 92, "input": "110 011 767\n", "actual_output": "33235204\n", "expected_output": "372655943\n\n", "anno_code": ["N,M,K=map(int,input().split()) # (0): N=110, M=11, K=767\nMOD=10**9+7 # (1): MOD=1000000007\nans=0 # (2): ans=0\nx,y=1,1 # (3): x=1, y=1\nk=min(K-2,N*M-K) # (4): k=443\nfor i in range(k): # (5): i=0 (10): i=1 ... (2220): NO CHANGE\n x*=N*M-2-i # (6): x=1208 (11): x=1458056 ... (2216): x=283682263846\n y*=K-2-i # (7): y=765 (12): y=584460 ... (2217): y=273938960551\n x%=MOD # (8): NO CHANGE (13): NO CHANGE ... (2218): x=682261865\n y%=MOD # (9): NO CHANGE (14): NO CHANGE ... (2219): y=938958640\ncomb=x*pow(y,MOD-2,MOD) # (2221): comb=213785657638409215\ncomb%=MOD # (2222): comb=141909623\nfor i in range(1,N): # (2223): i=1 (2227): i=2 ... (2659): NO CHANGE\n a=i*comb*(N-i)*M**2 # (2224): a=1871646017747 (2228): a=3708949906728 ... (2656): a=1871646017747\n ans+=a # (2225): ans=1871646017747 (2229): ans=3709595911378 ... (2657): ans=1872619466656\n ans%=MOD # (2226): ans=646004650 (2230): ans=595885415 ... (2658): ans=619453552\nfor i in range(1,M): # (2660): i=1 (2664): i=2 ... (2700): NO CHANGE\n a=i*comb*(M-i)*N**2 # (2661): a=17171064383000 (2665): a=30907915889400 ... (2697): a=17171064383000\n ans+=a # (2662): ans=17171683836552 (2666): ans=30908599605755 ... (2698): ans=17172033355408\n ans%=MOD # (2663): ans=683716355 (2667): ans=599389399 ... (2699): ans=33235204\nprint(ans%MOD)"], "anno_status": [true], "diff_content": " N,M,K=map(int,input().split())\n MOD=10**9+7\n ans=0\n x,y=1,1\n k=min(K-2,N*M-K)\n for i in range(k):\n x*=N*M-2-i\n- y*=K-2-i\n+ y*=k-i\n x%=MOD\n y%=MOD\n comb=x*pow(y,MOD-2,MOD)\n comb%=MOD\n for i in range(1,N):\n a=i*comb*(N-i)*M**2\n ans+=a\n ans%=MOD\n for i in range(1,M):\n a=i*comb*(M-i)*N**2\n ans+=a\n ans%=MOD\n print(ans%MOD)\n", "FL_content": " N,M,K=map(int,input().split())\n MOD=10**9+7\n ans=0\n x,y=1,1\n k=min(K-2,N*M-K)\n for i in range(k):\n x*=N*M-2-i\n- y*=K-2-i\n x%=MOD\n y%=MOD\n comb=x*pow(y,MOD-2,MOD)\n comb%=MOD\n for i in range(1,N):\n a=i*comb*(N-i)*M**2\n ans+=a\n ans%=MOD\n for i in range(1,M):\n a=i*comb*(M-i)*N**2\n ans+=a\n ans%=MOD\n print(ans%MOD)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u229333839", "problem_id": "p03206", "submission1_id": "s276135749", "submission2_id": "s672525866", "status1": "Wrong Answer", "status2": "Accepted", "code1": "C = \"Christmas\"\nE =\" EVE\"\nD = input()\nD = int(D)\na = 25 - D\nq=\"\"\n \nwhile a > 0:\n q = q + E\n a = a - 1\n \nprint(C+q)", "code2": "C = \"Christmas\"\nE =\" Eve\"\nD = input()\nD = int(D)\na = 25 - D\nq=\"\"\n \nwhile a > 0:\n q = q + E\n a = a - 1\n \nprint(C+q)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566063396", "date2": "1566063441", "bleu_score": "0.9692817763533064", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-68\n", "actual_output": "Christmas EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["C = \"Christmas\" # (0): C=Christmas\nE =\" EVE\" # (1): E= EVE\nD = input() # (2): D=-68\nD = int(D) # (3): D=-68\na = 25 - D # (4): a=93\nq=\"\" # (5): q=\n \nwhile a > 0: # (6): NO CHANGE (9): NO CHANGE ... (285): NO CHANGE\n q = q + E # (7): q= EVE (10): q= EVE EVE ... (283): q= EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE\n a = a - 1 # (8): a=92 (11): a=91 ... (284): a=0\n \nprint(C+q)"], "anno_status": [true], "diff_content": " C = \"Christmas\"\n-E =\" EVE\"\n+E =\" Eve\"\n D = input()\n D = int(D)\n a = 25 - D\n q=\"\"\n \n while a > 0:\n q = q + E\n a = a - 1\n \n print(C+q)\n", "FL_content": " C = \"Christmas\"\n-E =\" EVE\"\n D = input()\n D = int(D)\n a = 25 - D\n q=\"\"\n \n while a > 0:\n q = q + E\n a = a - 1\n \n print(C+q)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u375065632", "problem_id": "p03206", "submission1_id": "s111233505", "submission2_id": "s304813133", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = int(input())\nprint(\"christmas\"+\"Eve\"*(25-x))", "code2": "x = int(input())\nprint(\"Christmas\"+\" Eve\"*(25-x))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601057485", "date2": "1601057582", "bleu_score": "0.8921877278718924", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-397\n", "actual_output": "christmasEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["x = int(input()) # (0): x=-397\nprint(\"christmas\"+\"Eve\"*(25-x))"], "anno_status": [true], "diff_content": " x = int(input())\n-print(\"christmas\"+\"Eve\"*(25-x))\n+print(\"Christmas\"+\" Eve\"*(25-x))\n", "FL_content": " x = int(input())\n-print(\"christmas\"+\"Eve\"*(25-x))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u704001626", "problem_id": "p03206", "submission1_id": "s983851982", "submission2_id": "s990734464", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\na = 25 - int(input())\nprint(\"Christmas \" + \"Eve\" * a)\n", "code2": "\na = 25 - int(input())\nprint(\"Christmas\" + \" Eve\" * a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544499449", "date2": "1544499708", "bleu_score": "0.9139262297949446", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-177\n", "actual_output": "Christmas EveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["\na = 25 - int(input()) # (0): a=202\nprint(\"Christmas \" + \"Eve\" * a)\n"], "anno_status": [true], "diff_content": " \n a = 25 - int(input())\n-print(\"Christmas \" + \"Eve\" * a)\n-\n+print(\"Christmas\" + \" Eve\" * a)\n", "FL_content": " \n a = 25 - int(input())\n-print(\"Christmas \" + \"Eve\" * a)\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u797127558", "problem_id": "p03206", "submission1_id": "s951704579", "submission2_id": "s670274804", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nprint(\"Christmas\",\"Eve\"*3)", "code2": "a=int(input())\nprint(\"Christmas\",\"Eve \"*(25-a))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596056546", "date2": "1596056663", "bleu_score": "0.8008883000549176", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-88\n", "actual_output": "Christmas EveEveEve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["a=int(input()) # (0): a=-88\nprint(\"Christmas\",\"Eve\"*3)"], "anno_status": [true], "diff_content": " a=int(input())\n-print(\"Christmas\",\"Eve\"*3)\n+print(\"Christmas\",\"Eve \"*(25-a))\n", "FL_content": " a=int(input())\n-print(\"Christmas\",\"Eve\"*3)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u587742016", "problem_id": "p03206", "submission1_id": "s039694479", "submission2_id": "s555481068", "status1": "Wrong Answer", "status2": "Accepted", "code1": "target = int(input())\ncommon_msg = \"Christmas\"\nadditional_msg = \"Eve\"\nprint(common_msg + \" \".join([\"Eve\" for i in range(25 - target)]))\n", "code2": "target = int(input())\ncommon_msg = \"Christmas\"\nadditional_msg = \"Eve\"\nprint(common_msg + \"\".join([\" Eve\" for i in range(25 - target)]))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1547576317", "date2": "1547576371", "bleu_score": "0.9735996792375748", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-324\n", "actual_output": "ChristmasEve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["target = int(input()) # (0): target=-324\ncommon_msg = \"Christmas\" # (1): common_msg=Christmas\nadditional_msg = \"Eve\" # (2): additional_msg=Eve\nprint(common_msg + \" \".join([\"Eve\" for i in range(25 - target)]))\n"], "anno_status": [true], "diff_content": " target = int(input())\n common_msg = \"Christmas\"\n additional_msg = \"Eve\"\n-print(common_msg + \" \".join([\"Eve\" for i in range(25 - target)]))\n+print(common_msg + \"\".join([\" Eve\" for i in range(25 - target)]))\n \n", "FL_content": " target = int(input())\n common_msg = \"Christmas\"\n additional_msg = \"Eve\"\n-print(common_msg + \" \".join([\"Eve\" for i in range(25 - target)]))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u302957509", "problem_id": "p03206", "submission1_id": "s801739845", "submission2_id": "s026815783", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"Christmas\" + \" \".join([\"Eve\"] * (25 - int(input()))))", "code2": "print(\"Christmas\" + (\" Eve\" * (25 - int(input()))))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570148766", "date2": "1570148972", "bleu_score": "0.7519016530144769", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-82\n", "actual_output": "ChristmasEve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["print(\"Christmas\" + \" \".join([\"Eve\"] * (25 - int(input()))))"], "anno_status": [true], "diff_content": "-print(\"Christmas\" + \" \".join([\"Eve\"] * (25 - int(input()))))\n+print(\"Christmas\" + (\" Eve\" * (25 - int(input()))))\n+\n", "FL_content": "-print(\"Christmas\" + \" \".join([\"Eve\"] * (25 - int(input()))))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u869265610", "problem_id": "p03206", "submission1_id": "s071277962", "submission2_id": "s318498258", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nprint(\"christmas\"+\"Eve\"*(25-a))", "code2": "a=int(input())\nprint(\"Christmas\"+\" Eve\"*(25-a))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587228814", "date2": "1587229061", "bleu_score": "0.8873133342926623", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-515\n", "actual_output": "christmasEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["a=int(input()) # (0): a=-515\nprint(\"christmas\"+\"Eve\"*(25-a))"], "anno_status": [false], "diff_content": " a=int(input())\n-print(\"christmas\"+\"Eve\"*(25-a))\n+print(\"Christmas\"+\" Eve\"*(25-a))\n", "FL_content": " a=int(input())\n-print(\"christmas\"+\"Eve\"*(25-a))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u112567325", "problem_id": "p03206", "submission1_id": "s678277620", "submission2_id": "s671705022", "status1": "Wrong Answer", "status2": "Accepted", "code1": "D = int(input())\n\nans = \"Christmas\"\nfor i in range(D-25):\n ans += \" Eve\"\nprint(ans)", "code2": "D = int(input())\n\nans = \"Christmas\"\nfor i in range(-(D-25)):\n ans += \" Eve\"\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576671798", "date2": "1576671907", "bleu_score": "0.9469031117307336", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-929\n", "actual_output": "Christmas\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["D = int(input()) # (0): D=-929\n\nans = \"Christmas\" # (1): ans=Christmas\nfor i in range(D-25): # (2): NO CHANGE\n ans += \" Eve\"\nprint(ans)"], "anno_status": [false], "diff_content": " D = int(input())\n \n ans = \"Christmas\"\n-for i in range(D-25):\n+for i in range(-(D-25)):\n ans += \" Eve\"\n print(ans)\n", "FL_content": " D = int(input())\n \n ans = \"Christmas\"\n-for i in range(D-25):\n ans += \" Eve\"\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u047931063", "problem_id": "p03206", "submission1_id": "s807307833", "submission2_id": "s363608270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "D = int(input())\n\nA = [\"Chrinstmas\"]\n\nfor i in range(25 - D):\n A.append(\"Eve\")\n\nS = ''.join(A)\n\nprint(S)", "code2": "D = int(input())\n\nA = [\"Christmas\"]\n\nfor i in range(25 - D):\n A.append(\"Eve\")\n\nS = ' '.join(A)\n\nprint(S)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593983626", "date2": "1593983783", "bleu_score": "0.9516662471848664", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-55\n", "actual_output": "ChrinstmasEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["D = int(input()) # (0): D=-55\n\nA = [\"Chrinstmas\"] # (1): A=['Chrinstmas']\n\nfor i in range(25 - D): # (2): i=0 (4): i=1 ... (162): NO CHANGE\n A.append(\"Eve\") # (3): A=['Chrinstmas', 'Eve'] (5): A=['Chrinstmas', 'Eve', 'Eve'] ... (161): A=[Chrinstmas, Eve, ..., Eve, Eve]\n\nS = ''.join(A) # (163): S=ChrinstmasEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\n\nprint(S)"], "anno_status": [true], "diff_content": " D = int(input())\n \n-A = [\"Chrinstmas\"]\n+A = [\"Christmas\"]\n \n for i in range(25 - D):\n A.append(\"Eve\")\n \n-S = ''.join(A)\n+S = ' '.join(A)\n \n print(S)\n+\n", "FL_content": " D = int(input())\n \n-A = [\"Chrinstmas\"]\n \n for i in range(25 - D):\n A.append(\"Eve\")\n \n-S = ''.join(A)\n \n print(S)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u333139319", "problem_id": "p03206", "submission1_id": "s319945325", "submission2_id": "s146546479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "d = int(input())\n\n\nprint(\"Chirstmas\"+\" Eve\" * (25 - d))", "code2": "d = int(input())\n\n\nprint(\"Christmas\"+\" Eve\" * (25 - d))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544321633", "date2": "1544321910", "bleu_score": "0.9252340656105403", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-45\n", "actual_output": "Chirstmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["d = int(input()) # (0): d=-45\n\n\nprint(\"Chirstmas\"+\" Eve\" * (25 - d))"], "anno_status": [true], "diff_content": " d = int(input())\n \n \n-print(\"Chirstmas\"+\" Eve\" * (25 - d))\n+print(\"Christmas\"+\" Eve\" * (25 - d))\n+\n", "FL_content": " d = int(input())\n \n \n-print(\"Chirstmas\"+\" Eve\" * (25 - d))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u365156087", "problem_id": "p03206", "submission1_id": "s753879111", "submission2_id": "s067843044", "status1": "Wrong Answer", "status2": "Accepted", "code1": "D = int(input())\nprint('Chrismas' + \" Eve\"*(25-D))", "code2": "D = int(input())\nprint('Christmas' + \" Eve\"*(25-D))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599487744", "date2": "1599487802", "bleu_score": "0.948661035297062", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-31\n", "actual_output": "Chrismas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["D = int(input()) # (0): D=-31\nprint('Chrismas' + \" Eve\"*(25-D))"], "anno_status": [true], "diff_content": " D = int(input())\n-print('Chrismas' + \" Eve\"*(25-D))\n+print('Christmas' + \" Eve\"*(25-D))\n", "FL_content": " D = int(input())\n-print('Chrismas' + \" Eve\"*(25-D))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u552201227", "problem_id": "p03206", "submission1_id": "s486069755", "submission2_id": "s687238249", "status1": "Wrong Answer", "status2": "Accepted", "code1": "D = int(input())\nprint(\"Christmas\"+\"Eve\"*(25-D))", "code2": "D = int(input())\nprint(\"Christmas\"+\" Eve\"*(25-D))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587270870", "date2": "1587270899", "bleu_score": "0.926934323706186", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-49\n", "actual_output": "ChristmasEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["D = int(input()) # (0): D=-49\nprint(\"Christmas\"+\"Eve\"*(25-D))"], "anno_status": [true], "diff_content": " D = int(input())\n-print(\"Christmas\"+\"Eve\"*(25-D))\n+print(\"Christmas\"+\" Eve\"*(25-D))\n+\n", "FL_content": " D = int(input())\n-print(\"Christmas\"+\"Eve\"*(25-D))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u857673087", "problem_id": "p03206", "submission1_id": "s432614583", "submission2_id": "s908567814", "status1": "Wrong Answer", "status2": "Accepted", "code1": "D = int(input())\n\nprint('Chiristmas'+' Eve'*(25-D))\n", "code2": "D = int(input())\n\nprint('Christmas'+' Eve'*(25-D))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588732995", "date2": "1588733040", "bleu_score": "0.9500778747262152", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-46\n", "actual_output": "Chiristmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["D = int(input()) # (0): D=-46\n\nprint('Chiristmas'+' Eve'*(25-D))\n"], "anno_status": [true], "diff_content": " D = int(input())\n \n-print('Chiristmas'+' Eve'*(25-D))\n+print('Christmas'+' Eve'*(25-D))\n \n", "FL_content": " D = int(input())\n \n-print('Chiristmas'+' Eve'*(25-D))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u843318346", "problem_id": "p03206", "submission1_id": "s510464175", "submission2_id": "s805874861", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nnokori = n-25\neve = ' Eve'*nokori\nprint('Christmas'+eve)", "code2": "n = int(input())\nnokori = 25-n\neve = ' Eve'*nokori\nprint('Christmas'+eve)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583747236", "date2": "1583747269", "bleu_score": "0.9262645935748454", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-463\n", "actual_output": "Christmas\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["n = int(input()) # (0): n=-463\nnokori = n-25 # (1): nokori=-488\neve = ' Eve'*nokori # (2): eve=\nprint('Christmas'+eve)"], "anno_status": [true], "diff_content": " n = int(input())\n-nokori = n-25\n+nokori = 25-n\n eve = ' Eve'*nokori\n print('Christmas'+eve)\n+\n", "FL_content": " n = int(input())\n-nokori = n-25\n eve = ' Eve'*nokori\n print('Christmas'+eve)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u332793228", "problem_id": "p03206", "submission1_id": "s437951803", "submission2_id": "s402617972", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"Chrismas\"+\" Eve\"*(25-int(input())))", "code2": "print(\"Christmas\"+\" Eve\"*(25-int(input())))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589751788", "date2": "1589751892", "bleu_score": "0.9385522307631307", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-83\n", "actual_output": "Chrismas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["print(\"Chrismas\"+\" Eve\"*(25-int(input())))"], "anno_status": [true], "diff_content": "-print(\"Chrismas\"+\" Eve\"*(25-int(input())))\n+print(\"Christmas\"+\" Eve\"*(25-int(input())))\n", "FL_content": "-print(\"Chrismas\"+\" Eve\"*(25-int(input())))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u043236471", "problem_id": "p03206", "submission1_id": "s044476386", "submission2_id": "s979107971", "status1": "Wrong Answer", "status2": "Accepted", "code1": "D = int(input())\nres = 'Christmas'\nfor _ in range(D, 25):\n res += 'Eve'\nprint(res)", "code2": "D = int(input())\nres = 'Christmas'\nfor _ in range(D, 25):\n res += ' Eve'\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553691001", "date2": "1553692045", "bleu_score": "0.9701381722705915", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-180\n", "actual_output": "ChristmasEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["D = int(input()) # (0): D=-180\nres = 'Christmas' # (1): res=Christmas\nfor _ in range(D, 25): # (2): _=-180 (4): _=-179 ... (412): NO CHANGE\n res += 'Eve' # (3): res=ChristmasEve (5): res=ChristmasEveEve ... (411): res=ChristmasEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEveEve\nprint(res)"], "anno_status": [true], "diff_content": " D = int(input())\n res = 'Christmas'\n for _ in range(D, 25):\n- res += 'Eve'\n+ res += ' Eve'\n print(res)\n", "FL_content": " D = int(input())\n res = 'Christmas'\n for _ in range(D, 25):\n- res += 'Eve'\n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u899578884", "problem_id": "p03206", "submission1_id": "s730565293", "submission2_id": "s879807054", "status1": "Wrong Answer", "status2": "Accepted", "code1": "D = int(input())\nstr = \"Christmas\"\nwhile D < 25:\n str += \" EVE\"\n D += 1\nprint(str)\n", "code2": "D = int(input())\nstr = \"Christmas\"\nwhile D < 25:\n str += \" Eve\"\n D += 1\nprint(str)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1549662374", "date2": "1549662436", "bleu_score": "0.959738079715196", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-895\n", "actual_output": "Christmas EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE\n", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["D = int(input()) # (0): D=-895\nstr = \"Christmas\" # (1): str=Christmas\nwhile D < 25: # (2): NO CHANGE (5): NO CHANGE ... (2762): NO CHANGE\n str += \" EVE\" # (3): str=Christmas EVE (6): str=Christmas EVE EVE ... (2760): str=Christmas EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE EVE\n D += 1 # (4): D=-894 (7): D=-893 ... (2761): D=25\nprint(str)\n"], "anno_status": [false], "diff_content": " D = int(input())\n str = \"Christmas\"\n while D < 25:\n- str += \" EVE\"\n+ str += \" Eve\"\n D += 1\n print(str)\n \n", "FL_content": " D = int(input())\n str = \"Christmas\"\n while D < 25:\n- str += \" EVE\"\n D += 1\n print(str)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u256901785", "problem_id": "p03206", "submission1_id": "s300815748", "submission2_id": "s849613656", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nprint('Chrismas ', end='')\nfor i in range(0,25-n):\n print('Eve ',end='')\n", "code2": "n = int(input())\nprint('Christmas ', end='')\nfor i in range(0,25-n):\n print('Eve ',end='')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562797580", "date2": "1562797630", "bleu_score": "0.9727436279095398", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 35, "input": "-177\n", "actual_output": "Chrismas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve ", "expected_output": "Christmas Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve Eve\n\n", "anno_code": ["n = int(input()) # (0): n=-177\nprint('Chrismas ', end='') # (1): NO CHANGE\nfor i in range(0,25-n): # (2): i=0 (4): i=1 ... (404): i=201\n print('Eve ',end='') # (3): NO CHANGE (5): NO CHANGE ... (405): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n-print('Chrismas ', end='')\n+print('Christmas ', end='')\n for i in range(0,25-n):\n print('Eve ',end='')\n \n", "FL_content": " n = int(input())\n-print('Chrismas ', end='')\n for i in range(0,25-n):\n print('Eve ',end='')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u888548672", "problem_id": "p00375", "submission1_id": "s466298205", "submission2_id": "s548486311", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print((int(input())-30)/2)\n", "code2": "print(int((int(input())-30)/2))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1555985575", "date2": "1555985615", "bleu_score": "0.8185803520071983", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 37, "input": "2835\n", "actual_output": "1402.5\n", "expected_output": "1402\n\n", "anno_code": ["print((int(input())-30)/2)\n"], "anno_status": [true], "diff_content": "-print((int(input())-30)/2)\n+print(int((int(input())-30)/2))\n \n", "FL_content": "-print((int(input())-30)/2)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u565812827", "problem_id": "p00375", "submission1_id": "s963872729", "submission2_id": "s513377610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nprint((a-30)/2)\n", "code2": "a=int(input())\nprint((a-30)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1551323591", "date2": "1551323709", "bleu_score": "0.8805984603596387", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 37, "input": "319\n", "actual_output": "144.5\n", "expected_output": "144\n\n", "anno_code": ["a=int(input()) # (0): a=319\nprint((a-30)/2)\n"], "anno_status": [true], "diff_content": " a=int(input())\n-print((a-30)/2)\n+print((a-30)\n \n", "FL_content": " a=int(input())\n-print((a-30)/2)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u118642796", "problem_id": "p03568", "submission1_id": "s635241837", "submission2_id": "s892343144", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(i) for i in input().split()]\n\nans = 2**N\ntmp = 1\nfor a in A:\n if a%2==0:\n tmp *= 2\nprint(ans - tmp)", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\n\nans = 3**N\ntmp = 1\nfor a in A:\n if a%2==0:\n tmp *= 2\nprint(ans - tmp) \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553657935", "date2": "1553658061", "bleu_score": "0.9651324673660481", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 47, "input": "10\n28 110 6 3 8 0 6 2 -1 210\n", "actual_output": "768\n", "expected_output": "58793\n\n", "anno_code": ["N = int(input()) # (0): N=10\nA = [int(i) for i in input().split()] # (1): A=[28, 110, 6, 3, 8, 0, 6, 2, -1, 210]\n\nans = 2**N # (2): ans=1024\ntmp = 1 # (3): tmp=1\nfor a in A: # (4): a=28 (7): a=110 ... (32): NO CHANGE\n if a%2==0: # (5): NO CHANGE (8): NO CHANGE ... (30): NO CHANGE\n tmp *= 2 # (6): tmp=2 (9): tmp=4 ... (31): tmp=256\nprint(ans - tmp)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(i) for i in input().split()]\n \n-ans = 2**N\n+ans = 3**N\n tmp = 1\n for a in A:\n if a%2==0:\n tmp *= 2\n-print(ans - tmp)\n+print(ans - tmp) \n+\n", "FL_content": " N = int(input())\n A = [int(i) for i in input().split()]\n \n-ans = 2**N\n tmp = 1\n for a in A:\n if a%2==0:\n tmp *= 2\n-print(ans - tmp)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u444349080", "problem_id": "p03568", "submission1_id": "s915873875", "submission2_id": "s761769365", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=list(map(int,input().split()))\nhiku=1\nans=1\nfor i in A:\n if i%2 == 1:hiku*=2\n ans*=3\nprint(ans-hiku)", "code2": "N=int(input())\nA=list(map(int,input().split()))\nhiku=1\nans=1\nfor i in A:\n if i%2 == 0:hiku*=2\n ans*=3\nprint(ans-hiku)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564158102", "date2": "1564158154", "bleu_score": "0.9805794919592197", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 6, "total_score": 47, "input": "10\n60 101 94 98 83 7 6 25 114 120\n", "actual_output": "59033\n", "expected_output": "58985\n\n", "anno_code": ["N=int(input()) # (0): N=10\nA=list(map(int,input().split())) # (1): A=[60, 101, 94, 98, 83, 7, 6, 25, 114, 120]\nhiku=1 # (2): hiku=1\nans=1 # (3): ans=1\nfor i in A: # (4): i=60 (7): i=101 ... (34): NO CHANGE\n if i%2 == 1:hiku*=2 # (5): NO CHANGE (8): hiku=2 ... (32): NO CHANGE\n ans*=3 # (6): ans=3 (9): ans=9 ... (33): ans=59049\nprint(ans-hiku)"], "anno_status": [true], "diff_content": " N=int(input())\n A=list(map(int,input().split()))\n hiku=1\n ans=1\n for i in A:\n- if i%2 == 1:hiku*=2\n+ if i%2 == 0:hiku*=2\n ans*=3\n print(ans-hiku)\n", "FL_content": " N=int(input())\n A=list(map(int,input().split()))\n hiku=1\n ans=1\n for i in A:\n- if i%2 == 1:hiku*=2\n ans*=3\n print(ans-hiku)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u225388820", "problem_id": "p03568", "submission1_id": "s444693788", "submission2_id": "s926661146", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nf=1\nfor i in a:\n if i&1:\n f=0\nprint(3**n-1-f)", "code2": "n=int(input())\na=list(map(int,input().split()))\nf=1\nfor i in a:\n if i%2==0:\n f<<=1\nprint(3**n-f)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586792770", "date2": "1586792972", "bleu_score": "0.8791511169144224", "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, 1, 0], "code1_test_score": 2, "total_score": 47, "input": "3\n1 8 -3\n", "actual_output": "26\n", "expected_output": "25\n\n", "anno_code": ["n=int(input()) # (0): n=3\na=list(map(int,input().split())) # (1): a=[1, 8, -3]\nf=1 # (2): f=1\nfor i in a: # (3): i=1 (6): i=8 ... (11): NO CHANGE\n if i&1: # (4): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n f=0 # (5): f=0 (10): NO CHANGE\nprint(3**n-1-f)"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int,input().split()))\n f=1\n for i in a:\n- if i&1:\n- f=0\n-print(3**n-1-f)\n+ if i%2==0:\n+ f<<=1\n+print(3**n-f)\n", "FL_content": " n=int(input())\n a=list(map(int,input().split()))\n f=1\n for i in a:\n- if i&1:\n- f=0\n-print(3**n-1-f)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u664481257", "problem_id": "p03568", "submission1_id": "s870608822", "submission2_id": "s648862073", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nfrom functools import reduce\nfrom itertools import repeat\n\n\ndef multipler(x, y):\n return x*y\n\ndef hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n\ndef check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n\ndef check_hun(l: list):\n return [True if x == 100 else False for x in l]\n\ndef main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n\n basis = [3 for t in hun_one]\n\n \n remover = [2 if o else 1 for o in odds]\n\n remover_num = int(reduce(multipler, remover))\n if sum(huns) > 0:\n remover_num = int(remover_num / 2 ** sum(huns))\n\n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n\nif __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n\n print(main(num, data))\n", "code2": "\n\n\n\n\nfrom functools import reduce\nfrom itertools import repeat\n\n\ndef multipler(x, y):\n return x*y\n\ndef hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n\ndef check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n\ndef check_hun(l: list):\n return [True if x == 100 else False for x in l]\n\ndef main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n\n basis = [3 for t in hun_one]\n\n \n remover = [2 if o else 1 for o in odds]\n\n remover_num = int(reduce(multipler, remover))\n \n \n\n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n\nif __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n\n print(main(num, data))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508726178", "date2": "1508726243", "bleu_score": "0.9207403611215617", "code1_test_status": [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, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 42, "total_score": 47, "input": "10\n105 100 94 98 114 7 6 27 114 120\n", "actual_output": "58985\n", "expected_output": "58921\n\n", "anno_code": ["\n\n\n\n\nfrom functools import reduce\nfrom itertools import repeat\n\n\ndef multipler(x, y): # (0): multipler=\n return x*y\n\ndef hundred_or_one(l: list): # (1): hundred_or_one=\n return [True if x == 100 else False for x in l]\n \n\ndef check_odds(l :list): # (2): check_odds=\n return [True if x % 2 == 0 else False for x in l]\n\ndef check_hun(l: list): # (3): check_hun=\n return [True if x == 100 else False for x in l]\n\ndef main(num, data:list): # (4): main=\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n\n basis = [3 for t in hun_one]\n\n \n remover = [2 if o else 1 for o in odds]\n\n remover_num = int(reduce(multipler, remover))\n if sum(huns) > 0:\n remover_num = int(remover_num / 2 ** sum(huns))\n\n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n\nif __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n\n print(main(num, data))\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n from functools import reduce\n from itertools import repeat\n \n \n def multipler(x, y):\n return x*y\n \n def hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n \n def check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n \n def check_hun(l: list):\n return [True if x == 100 else False for x in l]\n \n def main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n \n basis = [3 for t in hun_one]\n \n \n remover = [2 if o else 1 for o in odds]\n \n remover_num = int(reduce(multipler, remover))\n- if sum(huns) > 0:\n- remover_num = int(remover_num / 2 ** sum(huns))\n+ \n+ \n \n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n \n if __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n \n print(main(num, data))\n \n", "FL_content": " \n \n \n \n \n from functools import reduce\n from itertools import repeat\n \n \n def multipler(x, y):\n return x*y\n \n def hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n \n def check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n \n def check_hun(l: list):\n return [True if x == 100 else False for x in l]\n \n def main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n \n basis = [3 for t in hun_one]\n \n \n remover = [2 if o else 1 for o in odds]\n \n remover_num = int(reduce(multipler, remover))\n- if sum(huns) > 0:\n- remover_num = int(remover_num / 2 ** sum(huns))\n \n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n \n if __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n \n print(main(num, data))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 51 }, { "user_id": "u210718367", "problem_id": "p03568", "submission1_id": "s121127956", "submission2_id": "s649156372", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nans=1\nfor k in a:\n if k&1:\n ans*=2\nprint(ans)", "code2": "n=int(input())\na=list(map(int,input().split()))\nans=1\nfor k in a:\n if k%2==0:\n ans*=2\nprint(pow(3,n)-ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582645188", "date2": "1582645311", "bleu_score": "0.8413273331051553", "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], "code1_test_score": 1, "total_score": 47, "input": "10\n105 100 94 98 114 7 6 27 114 120\n", "actual_output": "8\n", "expected_output": "58921\n\n", "anno_code": ["n=int(input()) # (0): n=10\na=list(map(int,input().split())) # (1): a=[105, 100, 94, 98, 114, 7, 6, 27, 114, 120]\nans=1 # (2): ans=1\nfor k in a: # (3): k=105 (6): k=100 ... (26): NO CHANGE\n if k&1: # (4): NO CHANGE (7): NO CHANGE ... (25): NO CHANGE\n ans*=2 # (5): ans=2 (16): ans=4 (21): ans=8\nprint(ans)"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int,input().split()))\n ans=1\n for k in a:\n- if k&1:\n+ if k%2==0:\n ans*=2\n-print(ans)\n+print(pow(3,n)-ans)\n", "FL_content": " n=int(input())\n a=list(map(int,input().split()))\n ans=1\n for k in a:\n- if k&1:\n ans*=2\n-print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u664481257", "problem_id": "p03568", "submission1_id": "s632278234", "submission2_id": "s648862073", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nfrom functools import reduce\nfrom itertools import repeat\n\n\ndef multipler(x, y):\n return x*y\n\ndef hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n\ndef check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n\ndef check_hun(l: list):\n return [True if x == 100 else False for x in l]\n\ndef main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n\n basis = [2 if t else 3 for t in hun_one]\n remover = [2 if o else 1 for o in odds]\n\n remover_num = int(reduce(multipler, remover))\n \n \n\n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n\nif __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n\n print(main(num, data))\n", "code2": "\n\n\n\n\nfrom functools import reduce\nfrom itertools import repeat\n\n\ndef multipler(x, y):\n return x*y\n\ndef hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n\ndef check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n\ndef check_hun(l: list):\n return [True if x == 100 else False for x in l]\n\ndef main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n\n basis = [3 for t in hun_one]\n\n \n remover = [2 if o else 1 for o in odds]\n\n remover_num = int(reduce(multipler, remover))\n \n \n\n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n\nif __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n\n print(main(num, data))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508726051", "date2": "1508726243", "bleu_score": "0.9846487666746674", "code1_test_status": [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, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 42, "total_score": 47, "input": "10\n105 100 11 98 114 7 6 43 114 120\n", "actual_output": "39302\n", "expected_output": "58985\n\n", "anno_code": ["\n\n\n\n\nfrom functools import reduce\nfrom itertools import repeat\n\n\ndef multipler(x, y): # (0): multipler=\n return x*y\n\ndef hundred_or_one(l: list): # (1): hundred_or_one=\n return [True if x == 100 else False for x in l]\n \n\ndef check_odds(l :list): # (2): check_odds=\n return [True if x % 2 == 0 else False for x in l]\n\ndef check_hun(l: list): # (3): check_hun=\n return [True if x == 100 else False for x in l]\n\ndef main(num, data:list): # (4): main=\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n\n basis = [2 if t else 3 for t in hun_one]\n remover = [2 if o else 1 for o in odds]\n\n remover_num = int(reduce(multipler, remover))\n \n \n\n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n\nif __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n\n print(main(num, data))\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n from functools import reduce\n from itertools import repeat\n \n \n def multipler(x, y):\n return x*y\n \n def hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n \n def check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n \n def check_hun(l: list):\n return [True if x == 100 else False for x in l]\n \n def main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n \n- basis = [2 if t else 3 for t in hun_one]\n+ basis = [3 for t in hun_one]\n+\n+ \n remover = [2 if o else 1 for o in odds]\n \n remover_num = int(reduce(multipler, remover))\n \n \n \n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n \n if __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n \n print(main(num, data))\n \n", "FL_content": " \n \n \n \n \n from functools import reduce\n from itertools import repeat\n \n \n def multipler(x, y):\n return x*y\n \n def hundred_or_one(l: list):\n return [True if x == 100 else False for x in l]\n \n \n def check_odds(l :list):\n return [True if x % 2 == 0 else False for x in l]\n \n def check_hun(l: list):\n return [True if x == 100 else False for x in l]\n \n def main(num, data:list):\n \n hun_one = hundred_or_one(data)\n odds = check_odds(data) \n huns = check_hun(data)\n \n- basis = [2 if t else 3 for t in hun_one]\n remover = [2 if o else 1 for o in odds]\n \n remover_num = int(reduce(multipler, remover))\n \n \n \n basic_answer = reduce(multipler, basis)\n \n \n return basic_answer - remover_num\n \n if __name__ == '__main__':\n \n \n num = int(input())\n data = input().split(\" \")\n data = [int(i) for i in data]\n \n print(main(num, data))\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 49 }, { "user_id": "u858670323", "problem_id": "p03568", "submission1_id": "s628453262", "submission2_id": "s696351545", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nA=list(map(int,input().rstrip().split(' ')))\nans=1\nfor a in A:\n if(a%2==1):\n ans*=3\n \nprint(ans)", "code2": "n=int(input())\nA=list(map(int,input().rstrip().split(' ')))\nXans=1\nfor a in A:\n if(a%2==1):\n Xans*=1\n else:\n Xans*=2\n \nprint(3**n-Xans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587084715", "date2": "1587084859", "bleu_score": "0.7532182317693306", "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], "code1_test_score": 1, "total_score": 47, "input": "10\n60 101 56 71 73 7 6 25 114 84\n", "actual_output": "243\n", "expected_output": "59017\n\n", "anno_code": ["n=int(input()) # (0): n=10\nA=list(map(int,input().rstrip().split(' '))) # (1): A=[60, 101, 56, 71, 73, 7, 6, 25, 114, 84]\nans=1 # (2): ans=1\nfor a in A: # (3): a=60 (5): a=101 ... (28): NO CHANGE\n if(a%2==1): # (4): NO CHANGE (6): NO CHANGE ... (27): NO CHANGE\n ans*=3 # (7): ans=3 (12): ans=9 ... (23): ans=243\n \nprint(ans)"], "anno_status": [true], "diff_content": " n=int(input())\n A=list(map(int,input().rstrip().split(' ')))\n-ans=1\n+Xans=1\n for a in A:\n if(a%2==1):\n- ans*=3\n+ Xans*=1\n+ else:\n+ Xans*=2\n \n-print(ans)\n+print(3**n-Xans)\n+\n", "FL_content": " n=int(input())\n A=list(map(int,input().rstrip().split(' ')))\n-ans=1\n for a in A:\n if(a%2==1):\n- ans*=3\n \n-print(ans)\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u857428111", "problem_id": "p03568", "submission1_id": "s090027677", "submission2_id": "s614609096", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\ninput= lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(10**9)\ndef pin(type=int):return map(type,input().split())\ndef tupin(t=int):return tuple(pin(t))\ndef lispin(t=int):return list(pin(t))\n\ndef resolve():\n N=int(input())\n t=3**N\n s=1\n f=0\n for a in pin():\n if a>1 and a%2:\n f=1\n s*=1\n else:\n s*=2\n\n print(t-s)\n\nresolve()\n", "code2": "\n\nimport sys\ninput= lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(10**9)\ndef pin(type=int):return map(type,input().split())\ndef tupin(t=int):return tuple(pin(t))\ndef lispin(t=int):return list(pin(t))\n\ndef resolve():\n N=int(input())\n t=3**N\n s=1\n f=0\n for a in pin():\n if a%2:\n f=1\n s*=1\n else:\n s*=2\n\n print(t-s)\n\nresolve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589269880", "date2": "1589269954", "bleu_score": "0.9766705874797585", "code1_test_status": [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, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 39, "total_score": 47, "input": "3\n0 8 -3\n", "actual_output": "19\n", "expected_output": "23\n\n", "anno_code": ["\n\nimport sys\ninput= lambda: sys.stdin.readline().rstrip() # (0): input= at 0x000001EFB66A9BD0>\nsys.setrecursionlimit(10**9) # (1): pin=, tupin=, lispin=\ndef pin(type=int):return map(type,input().split())\ndef tupin(t=int):return tuple(pin(t))\ndef lispin(t=int):return list(pin(t))\n\ndef resolve(): # (2): resolve=\n N=int(input()) # (4): N=3\n t=3**N # (5): t=27\n s=1 # (6): s=1\n f=0 # (7): f=0\n for a in pin(): # (8): a=0 (11): a=8 ... (17): NO CHANGE\n if a>1 and a%2: # (9): NO CHANGE (12): NO CHANGE (15): NO CHANGE\n f=1\n s*=1\n else:\n s*=2 # (10): s=2 (13): s=4 (16): s=8\n\n print(t-s)\n\nresolve() # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n import sys\n input= lambda: sys.stdin.readline().rstrip()\n sys.setrecursionlimit(10**9)\n def pin(type=int):return map(type,input().split())\n def tupin(t=int):return tuple(pin(t))\n def lispin(t=int):return list(pin(t))\n \n def resolve():\n N=int(input())\n t=3**N\n s=1\n f=0\n for a in pin():\n- if a>1 and a%2:\n+ if a%2:\n f=1\n s*=1\n else:\n s*=2\n \n print(t-s)\n \n resolve()\n-\n", "FL_content": " \n \n import sys\n input= lambda: sys.stdin.readline().rstrip()\n sys.setrecursionlimit(10**9)\n def pin(type=int):return map(type,input().split())\n def tupin(t=int):return tuple(pin(t))\n def lispin(t=int):return list(pin(t))\n \n def resolve():\n N=int(input())\n t=3**N\n s=1\n f=0\n for a in pin():\n- if a>1 and a%2:\n f=1\n s*=1\n else:\n s*=2\n \n print(t-s)\n \n resolve()\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 25 }, { "user_id": "u422104747", "problem_id": "p03568", "submission1_id": "s155477142", "submission2_id": "s696654678", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=input().split()\nx=1\nfor i in s:\n if(int(i)%2==0):\n x*=2\nprint(2**n-x)", "code2": "n=int(input())\ns=input().split()\nx=1\nfor i in s:\n if(int(i)%2==0):\n x*=2\nprint(3**n-x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508798463", "date2": "1508798701", "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], "code1_test_score": 0, "total_score": 47, "input": "10\n0 010 2 0 0 0 0 -2 2 10\n", "actual_output": "0\n", "expected_output": "58025\n\n", "anno_code": ["n=int(input()) # (0): n=10\ns=input().split() # (1): s=['0', '010', '2', '0', '0', '0', '0', '-2', '2', '10']\nx=1 # (2): x=1\nfor i in s: # (3): i=0 (6): i=010 ... (33): NO CHANGE\n if(int(i)%2==0): # (4): NO CHANGE (7): NO CHANGE ... (31): NO CHANGE\n x*=2 # (5): x=2 (8): x=4 ... (32): x=1024\nprint(2**n-x)"], "anno_status": [true], "diff_content": " n=int(input())\n s=input().split()\n x=1\n for i in s:\n if(int(i)%2==0):\n x*=2\n-print(2**n-x)\n+print(3**n-x)\n", "FL_content": " n=int(input())\n s=input().split()\n x=1\n for i in s:\n if(int(i)%2==0):\n x*=2\n-print(2**n-x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u776189585", "problem_id": "p03568", "submission1_id": "s188085057", "submission2_id": "s634397456", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def get_result(A):\n res = 1\n total = 1\n for i, ai in enumerate(A):\n res *= 2 if ai % 2 == 0 else 1\n total *= 3 if ai > 1 else 2\n return total - res\nn = input()\nA = [int(ai) for ai in input().split()]\nprint(get_result(A))", "code2": "def get_result(A):\n res = 1\n total = 3 ** len(A)\n for i, ai in enumerate(A):\n res *= 2 if ai % 2 == 0 else 1\n return total - res\nn = input()\nA = [int(ai) for ai in input().split()]\nprint(get_result(A))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508721144", "date2": "1508721225", "bleu_score": "0.8497537691494066", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 27, "total_score": 47, "input": "10\n16 010 3 2 7 7 6 43 0 135\n", "actual_output": "39334\n", "expected_output": "59017\n\n", "anno_code": ["def get_result(A): # (0): get_result=\n res = 1 # (4): res=1\n total = 1 # (5): total=1\n for i, ai in enumerate(A): # (6): i=0, ai=16 (9): i=1, ai=10 ... (33): i=9, ai=135\n res *= 2 if ai % 2 == 0 else 1 # (7): res=2 (10): res=4 ... (34): NO CHANGE\n total *= 3 if ai > 1 else 2 # (8): total=3 (11): total=9 ... (35): total=39366\n return total - res\nn = input() # (1): n=10\nA = [int(ai) for ai in input().split()] # (2): A=[16, 10, 3, 2, 7, 7, 6, 43, 0, 135]\nprint(get_result(A)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def get_result(A):\n res = 1\n- total = 1\n+ total = 3 ** len(A)\n for i, ai in enumerate(A):\n res *= 2 if ai % 2 == 0 else 1\n- total *= 3 if ai > 1 else 2\n return total - res\n n = input()\n A = [int(ai) for ai in input().split()]\n print(get_result(A))\n", "FL_content": " def get_result(A):\n res = 1\n- total = 1\n for i, ai in enumerate(A):\n res *= 2 if ai % 2 == 0 else 1\n- total *= 3 if ai > 1 else 2\n return total - res\n n = input()\n A = [int(ai) for ai in input().split()]\n print(get_result(A))\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u459150945", "problem_id": "p03568", "submission1_id": "s304868794", "submission2_id": "s612939222", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nAn = list(map(int, input().split()))\nodd = sum([1 for a in An if a % 2 != 0])\nprint(3**N - 2**odd)\n", "code2": "N = int(input())\nAn = list(map(int, input().split()))\neven = sum([1 for a in An if a % 2 == 0])\nprint(3**N - 2**even)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590968873", "date2": "1590969000", "bleu_score": "0.88559445162629", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 6, "total_score": 47, "input": "3\n3 3 3\n", "actual_output": "19\n", "expected_output": "26\n", "anno_code": ["N = int(input()) # (0): N=3\nAn = list(map(int, input().split())) # (1): An=[3, 3, 3]\nodd = sum([1 for a in An if a % 2 != 0]) # (2): odd=3\nprint(3**N - 2**odd)\n"], "anno_status": [true], "diff_content": " N = int(input())\n An = list(map(int, input().split()))\n-odd = sum([1 for a in An if a % 2 != 0])\n-print(3**N - 2**odd)\n+even = sum([1 for a in An if a % 2 == 0])\n+print(3**N - 2**even)\n \n", "FL_content": " N = int(input())\n An = list(map(int, input().split()))\n-odd = sum([1 for a in An if a % 2 != 0])\n-print(3**N - 2**odd)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u432042540", "problem_id": "p03568", "submission1_id": "s875668735", "submission2_id": "s424470166", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = [int(i) for i in input().split()]\nprint(a)\n\ncnt = 0\nfor i in range(n):\n if a[i] % 2 == 0:\n cnt += 1\n\nx = 3 ** n - 2 ** cnt\n\nprint(x)", "code2": "n = int(input())\na = [int(i) for i in input().split()]\n\ncnt = 0\nfor i in range(n):\n if a[i] % 2 == 0:\n cnt += 1\n\nx = 3 ** n - 2 ** cnt\n\nprint(x)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508721224", "date2": "1508721290", "bleu_score": "0.9418719214922339", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 47, "input": "10\n90 52 56 71 44 8 13 30 57 84\n", "actual_output": "[90, 52, 56, 71, 44, 8, 13, 30, 57, 84]\n58921\n", "expected_output": "58921\n", "anno_code": ["n = int(input()) # (0): n=10\na = [int(i) for i in input().split()] # (1): a=[90, 52, 56, 71, 44, 8, 13, 30, 57, 84]\nprint(a) # (2): NO CHANGE\n\ncnt = 0 # (3): cnt=0\nfor i in range(n): # (4): i=0 (7): i=1 ... (31): NO CHANGE\n if a[i] % 2 == 0: # (5): NO CHANGE (8): NO CHANGE ... (29): NO CHANGE\n cnt += 1 # (6): cnt=1 (9): cnt=2 ... (30): cnt=7\n\nx = 3 ** n - 2 ** cnt # (32): x=58921\n\nprint(x)"], "anno_status": [true], "diff_content": " n = int(input())\n a = [int(i) for i in input().split()]\n-print(a)\n \n cnt = 0\n for i in range(n):\n if a[i] % 2 == 0:\n cnt += 1\n \n x = 3 ** n - 2 ** cnt\n \n print(x)\n+\n", "FL_content": " n = int(input())\n a = [int(i) for i in input().split()]\n-print(a)\n \n cnt = 0\n for i in range(n):\n if a[i] % 2 == 0:\n cnt += 1\n \n x = 3 ** n - 2 ** cnt\n \n print(x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u232873434", "problem_id": "p03568", "submission1_id": "s031526394", "submission2_id": "s501079363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\n\neven_num = 0\n\nfor i in range(N):\n if A[i]%2:\n even_num += 1\n\nprint(1*3**(N-1)*even_num+2*3**(N-1)*(N-even_num)-2**(N-even_num))", "code2": "N = int(input())\nA = list(map(int,input().split()))\n\neven_num = 0\n\nfor i in range(N):\n if A[i]%2==0:\n even_num += 1\nprint(3**N-2**even_num)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593879699", "date2": "1593880298", "bleu_score": "0.7097538801233063", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 47, "input": "10\n16 010 3 2 7 7 6 43 0 135\n", "actual_output": "295213\n", "expected_output": "59017\n\n", "anno_code": ["N = int(input()) # (0): N=10\nA = list(map(int,input().split())) # (1): A=[16, 10, 3, 2, 7, 7, 6, 43, 0, 135]\n\neven_num = 0 # (2): even_num=0\n\nfor i in range(N): # (3): i=0 (5): i=1 ... (28): NO CHANGE\n if A[i]%2: # (4): NO CHANGE (6): NO CHANGE ... (26): NO CHANGE\n even_num += 1 # (9): even_num=1 (14): even_num=2 ... (27): even_num=5\n\nprint(1*3**(N-1)*even_num+2*3**(N-1)*(N-even_num)-2**(N-even_num))"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n \n even_num = 0\n \n for i in range(N):\n- if A[i]%2:\n+ if A[i]%2==0:\n even_num += 1\n-\n-print(1*3**(N-1)*even_num+2*3**(N-1)*(N-even_num)-2**(N-even_num))\n+print(3**N-2**even_num)\n", "FL_content": " N = int(input())\n A = list(map(int,input().split()))\n \n even_num = 0\n \n for i in range(N):\n- if A[i]%2:\n even_num += 1\n-\n-print(1*3**(N-1)*even_num+2*3**(N-1)*(N-even_num)-2**(N-even_num))\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u423585790", "problem_id": "p03568", "submission1_id": "s568635411", "submission2_id": "s336571371", "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 S(): return input().rstrip()\ndef LS(): return S().split()\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 n = II()\n a = LI()\n ans = 3 ** n\n a = sum(map(lambda x: x & 1, a))\n na = n - a\n print(ans - 2 ** na * a)\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 S(): return input().rstrip()\ndef LS(): return S().split()\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 n = II()\n a = LI()\n ans = 3 ** n\n a = sum(map(lambda x: x & 1, a))\n na = n - a\n print(ans - 2 ** na)\n return\n\n\n\nif __name__ == '__main__':\n solve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585688030", "date2": "1585688098", "bleu_score": "0.9954581202455652", "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, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 47, "input": "10\n60 101 94 98 114 7 6 27 114 120\n", "actual_output": "58665\n", "expected_output": "58921\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=, S=, LS=, 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 S(): return input().rstrip()\ndef LS(): return S().split()\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 n = II()\n a = LI()\n ans = 3 ** n\n a = sum(map(lambda x: x & 1, a))\n na = n - a\n print(ans - 2 ** na * a)\n return\n\n\n\nif __name__ == '__main__':\n solve()\n"], "anno_status": [true], "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 S(): return input().rstrip()\n def LS(): return S().split()\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 n = II()\n a = LI()\n ans = 3 ** n\n a = sum(map(lambda x: x & 1, a))\n na = n - a\n- print(ans - 2 ** na * a)\n+ print(ans - 2 ** na)\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 S(): return input().rstrip()\n def LS(): return S().split()\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 n = II()\n a = LI()\n ans = 3 ** n\n a = sum(map(lambda x: x & 1, a))\n na = n - a\n- print(ans - 2 ** na * a)\n return\n \n \n \n if __name__ == '__main__':\n solve()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 40 }, { "user_id": "u785205215", "problem_id": "p03568", "submission1_id": "s831671657", "submission2_id": "s641351914", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\ndef readLine_int_list():return list(map(int, stdin.readline().split()))\n\nn = int(input())\na = readLine_int_list()\neven = [i for i in a if i%2 == 0]\ne = len(even)\none = a.count(1)\n\n\nif e == 0:\n if n == 1:\n print(2-one)\n else:\n print(n**3 - 1 - one)\nelse:\n print(3**n - (2**e) - one)", "code2": "from sys import stdin\ndef readLine_int_list():return list(map(int, stdin.readline().split()))\n\nn = int(input())\na = readLine_int_list()\neven = [i for i in a if i%2 == 0]\ne = len(even)\n\nif e == 0:\n if n == 1:\n print(2)\n else:\n print(3**n - 1)\nelse:\n print(3**n - (2**e))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508726630", "date2": "1508726874", "bleu_score": "0.8653178083122225", "code1_test_status": [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, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 42, "total_score": 47, "input": "3\n1 1 -4\n", "actual_output": "23\n", "expected_output": "25\n\n", "anno_code": ["from sys import stdin\ndef readLine_int_list():return list(map(int, stdin.readline().split()))\n\nn = int(input()) # (0): n=3\na = readLine_int_list() # (1): a=[1, 1, -4]\neven = [i for i in a if i%2 == 0] # (2): even=[-4]\ne = len(even) # (3): e=1\none = a.count(1) # (4): one=2\n\n\nif e == 0: # (5): NO CHANGE\n if n == 1:\n print(2-one)\n else:\n print(n**3 - 1 - one)\nelse:\n print(3**n - (2**e) - one)"], "anno_status": [true], "diff_content": " from sys import stdin\n def readLine_int_list():return list(map(int, stdin.readline().split()))\n \n n = int(input())\n a = readLine_int_list()\n even = [i for i in a if i%2 == 0]\n e = len(even)\n-one = a.count(1)\n-\n \n if e == 0:\n if n == 1:\n- print(2-one)\n+ print(2)\n else:\n- print(n**3 - 1 - one)\n+ print(3**n - 1)\n else:\n- print(3**n - (2**e) - one)\n+ print(3**n - (2**e))\n", "FL_content": " from sys import stdin\n def readLine_int_list():return list(map(int, stdin.readline().split()))\n \n n = int(input())\n a = readLine_int_list()\n even = [i for i in a if i%2 == 0]\n e = len(even)\n-one = a.count(1)\n-\n \n if e == 0:\n if n == 1:\n- print(2-one)\n else:\n- print(n**3 - 1 - one)\n else:\n- print(3**n - (2**e) - one)\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 17 }, { "user_id": "u535171899", "problem_id": "p03568", "submission1_id": "s590949576", "submission2_id": "s945385004", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nn = int(input())\na_inputs = list(map(int,input().split()))\n\nall_pair = 1\nodd_pair = 1\n\nfor i in range(n):\n if a_inputs[i]==1:\n all_pair*=2\n odd_pair*=1\n else:\n if a_inputs[i]%2==0:\n odd_pair*=2\n else:\n odd_pair*=1\n all_pair*=3\n\nprint(all_pair-odd_pair)\n\n\n", "code2": "\n\n\nn = int(input())\na_inputs = list(map(int,input().split()))\n\nall_pair = 1\nodd_pair = 1\n\nfor i in range(n):\n if a_inputs[i]%2==0:\n odd_pair*=2\n else:\n odd_pair*=1\n all_pair*=3\n\nprint(all_pair-odd_pair)\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588804690", "date2": "1588805134", "bleu_score": "0.6650488802833427", "code1_test_status": [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, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 42, "total_score": 47, "input": "3\n1 0 -4\n", "actual_output": "14\n", "expected_output": "23\n\n", "anno_code": ["\n\n\nn = int(input()) # (0): n=3\na_inputs = list(map(int,input().split())) # (1): a_inputs=[1, 0, -4]\n\nall_pair = 1 # (2): all_pair=1\nodd_pair = 1 # (3): odd_pair=1\n\nfor i in range(n): # (4): i=0 (8): i=1 ... (18): NO CHANGE\n if a_inputs[i]==1: # (5): NO CHANGE (9): NO CHANGE (14): NO CHANGE\n all_pair*=2 # (6): all_pair=2\n odd_pair*=1 # (7): NO CHANGE\n else:\n if a_inputs[i]%2==0: # (10): NO CHANGE (15): NO CHANGE\n odd_pair*=2 # (11): odd_pair=2 (16): odd_pair=4\n else:\n odd_pair*=1\n all_pair*=3 # (12): all_pair=6 (17): all_pair=18\n\nprint(all_pair-odd_pair)\n\n\n"], "anno_status": [true], "diff_content": " \n \n \n n = int(input())\n a_inputs = list(map(int,input().split()))\n \n all_pair = 1\n odd_pair = 1\n \n for i in range(n):\n- if a_inputs[i]==1:\n- all_pair*=2\n- odd_pair*=1\n+ if a_inputs[i]%2==0:\n+ odd_pair*=2\n else:\n- if a_inputs[i]%2==0:\n- odd_pair*=2\n- else:\n- odd_pair*=1\n- all_pair*=3\n+ odd_pair*=1\n+ all_pair*=3\n \n print(all_pair-odd_pair)\n \n \n \n", "FL_content": " \n \n \n n = int(input())\n a_inputs = list(map(int,input().split()))\n \n all_pair = 1\n odd_pair = 1\n \n for i in range(n):\n- if a_inputs[i]==1:\n- all_pair*=2\n- odd_pair*=1\n else:\n- if a_inputs[i]%2==0:\n- odd_pair*=2\n- else:\n- odd_pair*=1\n- all_pair*=3\n \n print(all_pair-odd_pair)\n \n \n \n", "added_lines": 4, "removed_lines": 8, "code1_lines": 24 }, { "user_id": "u991134049", "problem_id": "p03568", "submission1_id": "s550529663", "submission2_id": "s173861905", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nkisuu = 0\nfor i in range(N):\n if A[i] % 2 == 0:\n kisuu += 2\nprint(2**N-kisuu)", "code2": "N = int(input())\nA = list(map(int, input().split()))\nkisuu = 1\nfor i in range(N):\n if A[i] % 2 == 0:\n kisuu *= 2\nprint(3**N-kisuu)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590209420", "date2": "1590209745", "bleu_score": "0.9357627163994144", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 47, "input": "10\n16 010 3 98 7 7 6 43 0 135\n", "actual_output": "1014\n", "expected_output": "59017\n\n", "anno_code": ["N = int(input()) # (0): N=10\nA = list(map(int, input().split())) # (1): A=[16, 10, 3, 98, 7, 7, 6, 43, 0, 135]\nkisuu = 0 # (2): kisuu=0\nfor i in range(N): # (3): i=0 (6): i=1 ... (28): NO CHANGE\n if A[i] % 2 == 0: # (4): NO CHANGE (7): NO CHANGE ... (27): NO CHANGE\n kisuu += 2 # (5): kisuu=2 (8): kisuu=4 ... (25): kisuu=10\nprint(2**N-kisuu)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n-kisuu = 0\n+kisuu = 1\n for i in range(N):\n if A[i] % 2 == 0:\n- kisuu += 2\n-print(2**N-kisuu)\n+ kisuu *= 2\n+print(3**N-kisuu)\n+\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n-kisuu = 0\n for i in range(N):\n if A[i] % 2 == 0:\n- kisuu += 2\n-print(2**N-kisuu)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u425762225", "problem_id": "p03568", "submission1_id": "s590516680", "submission2_id": "s990364347", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve(n,a):\n even = 0\n \n for i in range(n):\n if a[i] % 2 == 1:\n even += 1\n \n return 3**n - 2**even\n \ndef main():\n N = int(input())\n a = list(map(int,input().split()))\n print(solve(N,a))", "code2": "def solve(n,a):\n even = 0\n \n for i in range(n):\n if a[i] % 2 == 0:\n even += 1\n \n return 3**n - 2**even\n \ndef main():\n N = int(input())\n a = list(map(int,input().split()))\n print(solve(N,a))\n \nmain()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593436404", "date2": "1593436586", "bleu_score": "0.9373101687076681", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 47, "input": "10\n60 101 56 71 73 7 6 25 114 84\n", "actual_output": "", "expected_output": "59017\n\n", "anno_code": ["def solve(n,a): # (0): solve=\n even = 0\n \n for i in range(n):\n if a[i] % 2 == 1:\n even += 1\n \n return 3**n - 2**even\n \ndef main():\n N = int(input())\n a = list(map(int,input().split()))\n print(solve(N,a))"], "anno_status": [true], "diff_content": " def solve(n,a):\n even = 0\n \n for i in range(n):\n- if a[i] % 2 == 1:\n+ if a[i] % 2 == 0:\n even += 1\n \n return 3**n - 2**even\n \n def main():\n N = int(input())\n a = list(map(int,input().split()))\n print(solve(N,a))\n+ \n+main()\n+\n", "FL_content": " def solve(n,a):\n even = 0\n \n for i in range(n):\n- if a[i] % 2 == 1:\n even += 1\n \n return 3**n - 2**even\n \n def main():\n N = int(input())\n a = list(map(int,input().split()))\n print(solve(N,a))\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u112007848", "problem_id": "p03568", "submission1_id": "s961797563", "submission2_id": "s677062580", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split(\" \")))\nkisuu = 1\nkake = 1\nfor i in a:\n if i != 1:\n kake *= 3\n else:\n kake *= 2\n if i % 2 == 0:\n kisuu *= 2\nprint(kake - kisuu)", "code2": "n = int(input())\na = list(map(int, input().split(\" \")))\nkisuu = 1\nkake = 1\nfor i in a:\n kake *= 3\n if i % 2 == 0:\n kisuu *= 2\nprint(kake - kisuu)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600648217", "date2": "1600648440", "bleu_score": "0.7800688000981885", "code1_test_status": [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, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 42, "total_score": 47, "input": "10\n-1 001 91 -1 0 -1 1 0 1 245\n", "actual_output": "17492\n", "expected_output": "59045\n\n", "anno_code": ["n = int(input()) # (0): n=10\na = list(map(int, input().split(\" \"))) # (1): a=[-1, 1, 91, -1, 0, -1, 1, 0, 1, 245]\nkisuu = 1 # (2): kisuu=1\nkake = 1 # (3): kake=1\nfor i in a: # (4): i=-1 (8): i=1 ... (46): NO CHANGE\n if i != 1: # (5): NO CHANGE (9): NO CHANGE ... (43): NO CHANGE\n kake *= 3 # (6): kake=3 (14): kake=18 ... (44): kake=17496\n else:\n kake *= 2 # (10): kake=6 (31): kake=972 (40): kake=5832\n if i % 2 == 0: # (7): NO CHANGE (11): NO CHANGE ... (45): NO CHANGE\n kisuu *= 2 # (24): kisuu=2 (37): kisuu=4\nprint(kake - kisuu)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split(\" \")))\n kisuu = 1\n kake = 1\n for i in a:\n- if i != 1:\n- kake *= 3\n- else:\n- kake *= 2\n+ kake *= 3\n if i % 2 == 0:\n kisuu *= 2\n print(kake - kisuu)\n", "FL_content": " n = int(input())\n a = list(map(int, input().split(\" \")))\n kisuu = 1\n kake = 1\n for i in a:\n- if i != 1:\n- kake *= 3\n- else:\n- kake *= 2\n if i % 2 == 0:\n kisuu *= 2\n print(kake - kisuu)\n", "added_lines": 1, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u989306199", "problem_id": "p03568", "submission1_id": "s393761427", "submission2_id": "s967680959", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = list(map(int, input().split()))\n\nans = 1\nfor a in A:\n if a == 1:\n ans *= 2\n else:\n ans *= 3\n\nodd = 1\nfor a in A:\n if a%2 == 0:\n odd *= 2\n\nprint(ans-odd)\n", "code2": "n = int(input())\nA = list(map(int, input().split()))\n\nans = 1\nfor a in A:\n \n \n \n ans *= 3\n\nodd = 1\nfor a in A:\n if a%2 == 0:\n odd *= 2\n\nprint(ans-odd)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588196037", "date2": "1588203185", "bleu_score": "0.836239901041571", "code1_test_status": [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, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 42, "total_score": 47, "input": "3\n1 1 -4\n", "actual_output": "10\n", "expected_output": "25\n\n", "anno_code": ["n = int(input()) # (0): n=3\nA = list(map(int, input().split())) # (1): A=[1, 1, -4]\n\nans = 1 # (2): ans=1\nfor a in A: # (3): a=1 (6): NO CHANGE ... (12): NO CHANGE\n if a == 1: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n ans *= 2 # (5): ans=2 (8): ans=4\n else:\n ans *= 3 # (11): ans=12\n\nodd = 1 # (13): odd=1\nfor a in A: # (14): a=1 (16): NO CHANGE ... (21): NO CHANGE\n if a%2 == 0: # (15): NO CHANGE (17): NO CHANGE (19): NO CHANGE\n odd *= 2 # (20): odd=2\n\nprint(ans-odd)\n"], "anno_status": [true], "diff_content": " n = int(input())\n A = list(map(int, input().split()))\n \n ans = 1\n for a in A:\n- if a == 1:\n- ans *= 2\n- else:\n+ \n+ \n+ \n ans *= 3\n \n odd = 1\n for a in A:\n if a%2 == 0:\n odd *= 2\n \n print(ans-odd)\n \n", "FL_content": " n = int(input())\n A = list(map(int, input().split()))\n \n ans = 1\n for a in A:\n- if a == 1:\n- ans *= 2\n- else:\n ans *= 3\n \n odd = 1\n for a in A:\n if a%2 == 0:\n odd *= 2\n \n print(ans-odd)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u798894056", "problem_id": "p03041", "submission1_id": "s343295932", "submission2_id": "s621518116", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = list(map(int, input().split()))\ns = input()\nprint(s.replace(s[K - 1], s[K - 1].lower()))", "code2": "N, K = list(map(int, input().split()))\nS = list(input())\nS[K - 1] = S[K - 1].lower()\nprint(\"\".join(S))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558315189", "date2": "1558315514", "bleu_score": "0.7191029283457502", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "3 3\nBBBA\n", "actual_output": "bbbA\n", "expected_output": "BBbA\n\n", "anno_code": ["N, K = list(map(int, input().split())) # (0): N=3, K=3\ns = input() # (1): s=BBBA\nprint(s.replace(s[K - 1], s[K - 1].lower()))"], "anno_status": [true], "diff_content": " N, K = list(map(int, input().split()))\n-s = input()\n-print(s.replace(s[K - 1], s[K - 1].lower()))\n+S = list(input())\n+S[K - 1] = S[K - 1].lower()\n+print(\"\".join(S))\n", "FL_content": " N, K = list(map(int, input().split()))\n-s = input()\n-print(s.replace(s[K - 1], s[K - 1].lower()))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u182139295", "problem_id": "p03041", "submission1_id": "s677368663", "submission2_id": "s339100678", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nn, k = map(int, input().split())\n\n\ns = list(input())\n\na = s[k:k+1]\n\na = ','.join(a)\n\na = a.lower()\n\ns[k:k+1] = a\n\nprint(s)", "code2": "\n\n\nn, k = map(int, input().split())\n\ns = list(input())\n\n\na = s[k-1:k]\n\na = ','.join(a)\n\na = a.lower()\n\ns[k-1:k] = a\n\ns = ''.join(s)\n\nprint(\"{}\".format(s))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558317706", "date2": "1558319267", "bleu_score": "0.7380452597705346", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 4\nABBC\n", "actual_output": "['A', 'B', 'B', 'C']\n", "expected_output": "ABBc\n\n", "anno_code": ["\n\n\nn, k = map(int, input().split()) # (0): n=2, k=4\n\n\ns = list(input()) # (1): s=['A', 'B', 'B', 'C']\n\na = s[k:k+1] # (2): a=[]\n\na = ','.join(a) # (3): a=\n\na = a.lower() # (4): NO CHANGE\n\ns[k:k+1] = a # (5): NO CHANGE\n\nprint(s)"], "anno_status": [true], "diff_content": " \n \n \n n, k = map(int, input().split())\n \n-\n s = list(input())\n \n-a = s[k:k+1]\n+\n+a = s[k-1:k]\n \n a = ','.join(a)\n \n a = a.lower()\n \n-s[k:k+1] = a\n+s[k-1:k] = a\n+\n+s = ''.join(s)\n+\n+print(\"{}\".format(s))\n \n-print(s)\n", "FL_content": " \n \n \n n, k = map(int, input().split())\n \n-\n s = list(input())\n \n-a = s[k:k+1]\n \n a = ','.join(a)\n \n a = a.lower()\n \n-s[k:k+1] = a\n \n-print(s)\n", "added_lines": 7, "removed_lines": 4, "code1_lines": 17 }, { "user_id": "u086172144", "problem_id": "p03041", "submission1_id": "s725342659", "submission2_id": "s322229874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = list(map(int, input().split()))\nS = input()\nprint(S.replace(S[K - 1], S[K - 1].lower()))\n", "code2": "N, K = list(map(int, input().split()))\nS = input()\nprint(S[:K - 1] + S[K - 1].lower() + S[K:])\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597007708", "date2": "1597007906", "bleu_score": "0.8319164500640064", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "6 3\nCAC\n", "actual_output": "cAc\n", "expected_output": "CAc\n\n", "anno_code": ["N, K = list(map(int, input().split())) # (0): N=6, K=3\nS = input() # (1): S=CAC\nprint(S.replace(S[K - 1], S[K - 1].lower()))\n"], "anno_status": [true], "diff_content": " N, K = list(map(int, input().split()))\n S = input()\n-print(S.replace(S[K - 1], S[K - 1].lower()))\n+print(S[:K - 1] + S[K - 1].lower() + S[K:])\n \n", "FL_content": " N, K = list(map(int, input().split()))\n S = input()\n-print(S.replace(S[K - 1], S[K - 1].lower()))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u471684875", "problem_id": "p03041", "submission1_id": "s123809757", "submission2_id": "s497269274", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\ns=str(input())\n\n\nprint(s.replace(s[k-1],s[k-1].lower()))", "code2": "n,k=list(map(int,input().split()))\ns=str(input())\n\ny=s[:k-1]+s[k-1].lower()+s[k:]\n\nprint(y)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565121962", "date2": "1565127093", "bleu_score": "0.7352380134478862", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "1 4\nFABA\n", "actual_output": "FaBa\n", "expected_output": "FABa\n\n", "anno_code": ["n,k=map(int,input().split()) # (0): n=1, k=4\ns=str(input()) # (1): s=FABA\n\n\nprint(s.replace(s[k-1],s[k-1].lower()))"], "anno_status": [true], "diff_content": "-n,k=map(int,input().split())\n+n,k=list(map(int,input().split()))\n s=str(input())\n \n+y=s[:k-1]+s[k-1].lower()+s[k:]\n \n-print(s.replace(s[k-1],s[k-1].lower()))\n+print(y)\n", "FL_content": "-n,k=map(int,input().split())\n s=str(input())\n \n \n-print(s.replace(s[k-1],s[k-1].lower()))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u514894322", "problem_id": "p03041", "submission1_id": "s789178306", "submission2_id": "s568522017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k = map(int,input().split())\ns = str(input())\nans = ''\nfor i in range(len(s)):\n if i == k:\n ans = ans + s[i].lower()\n else:\n ans = ans + s[i]\nprint (ans)", "code2": "n,k = map(int,input().split())\ns = str(input())\nans = ''\nfor i in range(len(s)):\n if i == k-1:\n ans = ans + s[i].lower()\n else:\n ans = ans + s[i]\nprint (ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564352871", "date2": "1564352938", "bleu_score": "0.9785205742012956", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9 1\nBAB\n", "actual_output": "BaB\n", "expected_output": "bAB\n\n", "anno_code": ["n,k = map(int,input().split()) # (0): n=9, k=1\ns = str(input()) # (1): s=BAB\nans = '' # (2): ans=\nfor i in range(len(s)): # (3): i=0 (6): i=1 ... (12): NO CHANGE\n if i == k: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n ans = ans + s[i].lower() # (8): ans=Ba\n else:\n ans = ans + s[i] # (5): ans=B (11): ans=BaB\nprint (ans)"], "anno_status": [true], "diff_content": " n,k = map(int,input().split())\n s = str(input())\n ans = ''\n for i in range(len(s)):\n- if i == k:\n+ if i == k-1:\n ans = ans + s[i].lower()\n else:\n ans = ans + s[i]\n print (ans)\n", "FL_content": " n,k = map(int,input().split())\n s = str(input())\n ans = ''\n for i in range(len(s)):\n- if i == k:\n ans = ans + s[i].lower()\n else:\n ans = ans + s[i]\n print (ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u393253137", "problem_id": "p03041", "submission1_id": "s314743347", "submission2_id": "s964442485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\ns=input()\nprint(s.replace(s[k-1],s[k-1].lower()))", "code2": "n,k=map(int,input().split())\ns=input()\nprint(s[:k-1]+s[k-1].lower()+s[k:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575150054", "date2": "1575150588", "bleu_score": "0.7984001122850782", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "1 4\nEABA\n", "actual_output": "EaBa\n", "expected_output": "EABa\n\n", "anno_code": ["n,k=map(int,input().split()) # (0): n=1, k=4\ns=input() # (1): s=EABA\nprint(s.replace(s[k-1],s[k-1].lower()))"], "anno_status": [true], "diff_content": " n,k=map(int,input().split())\n s=input()\n-print(s.replace(s[k-1],s[k-1].lower()))\n+print(s[:k-1]+s[k-1].lower()+s[k:])\n", "FL_content": " n,k=map(int,input().split())\n s=input()\n-print(s.replace(s[k-1],s[k-1].lower()))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u628581330", "problem_id": "p03041", "submission1_id": "s743787260", "submission2_id": "s793644122", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def character(n,k,s):\n res = str(s).replace(s[k-1],s[k-1].lower())\n return res\nn,k = map(int, input().split())\ns = input()\nprint(character(n,k,s))", "code2": "def character(n,k,s):\n res = s[:k-1] + s[k-1].lower() + s[k:]\n return res\nn,k = map(int, input().split())\ns = input()\nprint(character(n,k,s))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558314395", "date2": "1558315062", "bleu_score": "0.8579204210243617", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "9 1\nBAB\n", "actual_output": "bAb\n", "expected_output": "bAB\n\n", "anno_code": ["def character(n,k,s): # (0): character=\n res = str(s).replace(s[k-1],s[k-1].lower())\n return res\nn,k = map(int, input().split()) # (1): n=9, k=1\ns = input() # (2): s=BAB\nprint(character(n,k,s)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def character(n,k,s):\n- res = str(s).replace(s[k-1],s[k-1].lower())\n+ res = s[:k-1] + s[k-1].lower() + s[k:]\n return res\n n,k = map(int, input().split())\n s = input()\n print(character(n,k,s))\n", "FL_content": " def character(n,k,s):\n- res = str(s).replace(s[k-1],s[k-1].lower())\n return res\n n,k = map(int, input().split())\n s = input()\n print(character(n,k,s))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u726212005", "problem_id": "p03041", "submission1_id": "s536678123", "submission2_id": "s259650644", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\nn,k=map(int,input().split())\n\ns=list(input())\n\nprint(s[0:k-1],end='')\nprint(s[k-1].lower(),end='')\nprint(s[k:],end='')", "code2": "n,k=map(int,input().split())\n\ns=str(input())\n\nprint(s[0:k-1],end='')\nprint(s[k-1].lower(),end='')\nprint(s[k:],end='')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1559254431", "date2": "1559254702", "bleu_score": "0.8673684249689909", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 1\nBAAC\n", "actual_output": "[]b['A', 'A', 'C']", "expected_output": "bAAC\n\n", "anno_code": ["import copy\nn,k=map(int,input().split()) # (0): n=4, k=1\n\ns=list(input()) # (1): s=['B', 'A', 'A', 'C']\n\nprint(s[0:k-1],end='') # (2): NO CHANGE\nprint(s[k-1].lower(),end='') # (3): NO CHANGE\nprint(s[k:],end='')"], "anno_status": [true], "diff_content": "-import copy\n n,k=map(int,input().split())\n \n-s=list(input())\n+s=str(input())\n \n print(s[0:k-1],end='')\n print(s[k-1].lower(),end='')\n print(s[k:],end='')\n", "FL_content": "-import copy\n n,k=map(int,input().split())\n \n-s=list(input())\n \n print(s[0:k-1],end='')\n print(s[k-1].lower(),end='')\n print(s[k:],end='')\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u224554402", "problem_id": "p03041", "submission1_id": "s389420737", "submission2_id": "s391755262", "status1": "Wrong Answer", "status2": "Accepted", "code1": "p,q = input().split()\nq_ = int(q) -1 \nn = input()\nx = n.replace(n[q_], n[q_].lower(), 1)\nprint(x)", "code2": "p,q = input().split()\nq_ = int(q) \nn = input()\n\nprint(n[:q_-1] + n[q_-1].lower() + n[q_:])\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585873657", "date2": "1585874618", "bleu_score": "0.6967170435759471", "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, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 80, "total_score": 102, "input": "2 4\nABBB\n", "actual_output": "AbBB\n", "expected_output": "ABBb\n\n", "anno_code": ["p,q = input().split() # (0): p=2, q=4\nq_ = int(q) -1 # (1): q_=3\nn = input() # (2): n=ABBB\nx = n.replace(n[q_], n[q_].lower(), 1) # (3): x=AbBB\nprint(x)"], "anno_status": [true], "diff_content": " p,q = input().split()\n-q_ = int(q) -1 \n+q_ = int(q) \n n = input()\n-x = n.replace(n[q_], n[q_].lower(), 1)\n-print(x)\n+\n+print(n[:q_-1] + n[q_-1].lower() + n[q_:])\n+\n+\n+\n", "FL_content": " p,q = input().split()\n-q_ = int(q) -1 \n n = input()\n-x = n.replace(n[q_], n[q_].lower(), 1)\n-print(x)\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u173720816", "problem_id": "p03041", "submission1_id": "s286056702", "submission2_id": "s675209023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int, input().split())\nS=input()\nS=S.replace(S[K-1], chr(ord(S[K-1])+32))\nprint(S)", "code2": "N,K=map(int, input().split())\nS=list(input())\nS[K-1]=S[K-1].lower()\nprint(\"\".join(S))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561185644", "date2": "1561185862", "bleu_score": "0.6488238623962994", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "1 4\nEABB\n", "actual_output": "EAbb\n", "expected_output": "EABb\n\n", "anno_code": ["N,K=map(int, input().split()) # (0): N=1, K=4\nS=input() # (1): S=EABB\nS=S.replace(S[K-1], chr(ord(S[K-1])+32)) # (2): S=EAbb\nprint(S)"], "anno_status": [true], "diff_content": " N,K=map(int, input().split())\n-S=input()\n-S=S.replace(S[K-1], chr(ord(S[K-1])+32))\n-print(S)\n+S=list(input())\n+S[K-1]=S[K-1].lower()\n+print(\"\".join(S))\n+\n", "FL_content": " N,K=map(int, input().split())\n-S=input()\n-S=S.replace(S[K-1], chr(ord(S[K-1])+32))\n-print(S)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 4 }, { "user_id": "u516272298", "problem_id": "p03041", "submission1_id": "s664100588", "submission2_id": "s794624153", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k = map(int,input().split())\ns = str(input())\nprint(s.replace(s[k-1],s[k-1].lower()))", "code2": "n,k = map(int,input().split())\ns = str(input())\nb = s[k-1].lower()\nprint(s[:k-1]+b+s[k:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558314238", "date2": "1558316475", "bleu_score": "0.7981992889323785", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "3 2\nACC\n", "actual_output": "Acc\n", "expected_output": "AcC\n\n", "anno_code": ["n,k = map(int,input().split()) # (0): n=3, k=2\ns = str(input()) # (1): s=ACC\nprint(s.replace(s[k-1],s[k-1].lower()))"], "anno_status": [true], "diff_content": " n,k = map(int,input().split())\n s = str(input())\n-print(s.replace(s[k-1],s[k-1].lower()))\n+b = s[k-1].lower()\n+print(s[:k-1]+b+s[k:])\n", "FL_content": " n,k = map(int,input().split())\n s = str(input())\n-print(s.replace(s[k-1],s[k-1].lower()))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u716611746", "problem_id": "p03041", "submission1_id": "s858323890", "submission2_id": "s542876813", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\n\ndef main():\n\n N, K = [int(x) for x in sys.stdin.readline().rstrip().split()]\n S = list(sys.stdin.readline().rstrip())\n\n S_new = []\n for i, s in enumerate(S):\n if i + 1 == K:\n s = s.lower()\n S_new.append(s)\n\n print(S_new)\n\n\nif __name__ == \"__main__\":\n main()", "code2": "import sys\n\n\ndef main():\n\n N, K = [int(x) for x in sys.stdin.readline().rstrip().split()]\n S = list(sys.stdin.readline().rstrip())\n\n S_new = []\n for i, s in enumerate(S):\n if i + 1 == K:\n s = s.lower()\n S_new.append(s)\n\n print(\"\".join(S_new))\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558315756", "date2": "1558315819", "bleu_score": "0.9641982927772691", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 4\nEABA\n", "actual_output": "['E', 'A', 'B', 'a']\n", "expected_output": "EABa\n\n", "anno_code": ["import sys\n\n\ndef main(): # (0): main=\n\n N, K = [int(x) for x in sys.stdin.readline().rstrip().split()]\n S = list(sys.stdin.readline().rstrip())\n\n S_new = []\n for i, s in enumerate(S):\n if i + 1 == K:\n s = s.lower()\n S_new.append(s)\n\n print(S_new)\n\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " import sys\n \n \n def main():\n \n N, K = [int(x) for x in sys.stdin.readline().rstrip().split()]\n S = list(sys.stdin.readline().rstrip())\n \n S_new = []\n for i, s in enumerate(S):\n if i + 1 == K:\n s = s.lower()\n S_new.append(s)\n \n- print(S_new)\n+ print(\"\".join(S_new))\n \n \n if __name__ == \"__main__\":\n main()\n+\n", "FL_content": " import sys\n \n \n def main():\n \n N, K = [int(x) for x in sys.stdin.readline().rstrip().split()]\n S = list(sys.stdin.readline().rstrip())\n \n S_new = []\n for i, s in enumerate(S):\n if i + 1 == K:\n s = s.lower()\n S_new.append(s)\n \n- print(S_new)\n \n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u182139295", "problem_id": "p03041", "submission1_id": "s420716449", "submission2_id": "s339100678", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nn, k = map(int, input().split())\n\n\ns = list(input())\n\na = s[k:k+1]\n\na = ','.join(a)\n\na = a.lower()\n\ns[k:k+1] = a\n\ns = ','.join(s)\nprint(s)\n\n", "code2": "\n\n\nn, k = map(int, input().split())\n\ns = list(input())\n\n\na = s[k-1:k]\n\na = ','.join(a)\n\na = a.lower()\n\ns[k-1:k] = a\n\ns = ''.join(s)\n\nprint(\"{}\".format(s))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558317869", "date2": "1558319267", "bleu_score": "0.8318567612712179", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9 4\nBBAC\n", "actual_output": "B,B,A,C\n", "expected_output": "BBAc\n\n", "anno_code": ["\n\n\nn, k = map(int, input().split()) # (0): n=9, k=4\n\n\ns = list(input()) # (1): s=['B', 'B', 'A', 'C']\n\na = s[k:k+1] # (2): a=[]\n\na = ','.join(a) # (3): a=\n\na = a.lower() # (4): NO CHANGE\n\ns[k:k+1] = a # (5): NO CHANGE\n\ns = ','.join(s) # (6): s=B,B,A,C\nprint(s)\n\n"], "anno_status": [true], "diff_content": " \n \n \n n, k = map(int, input().split())\n \n-\n s = list(input())\n \n-a = s[k:k+1]\n+\n+a = s[k-1:k]\n \n a = ','.join(a)\n \n a = a.lower()\n \n-s[k:k+1] = a\n+s[k-1:k] = a\n \n-s = ','.join(s)\n-print(s)\n+s = ''.join(s)\n \n+print(\"{}\".format(s))\n \n", "FL_content": " \n \n \n n, k = map(int, input().split())\n \n-\n s = list(input())\n \n-a = s[k:k+1]\n \n a = ','.join(a)\n \n a = a.lower()\n \n-s[k:k+1] = a\n \n-s = ','.join(s)\n-print(s)\n \n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 20 }, { "user_id": "u694402282", "problem_id": "p03041", "submission1_id": "s323754770", "submission2_id": "s568295599", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ns = input()\nt = s[k-1]\nans = s[:k-1] + t.lower() + s[k:]\n", "code2": "n, k = map(int, input().split())\ns = input()\nt = s[k-1]\nans = s[:k-1] + t.lower() + s[k:]\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588284557", "date2": "1588284636", "bleu_score": "0.8894324070317984", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "0 1\nD@BA\n", "actual_output": "", "expected_output": "d@BA\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=0, k=1\ns = input() # (1): s=D@BA\nt = s[k-1] # (2): t=D\nans = s[:k-1] + t.lower() + s[k:]\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n s = input()\n t = s[k-1]\n ans = s[:k-1] + t.lower() + s[k:]\n+print(ans)\n \n", "FL_content": " n, k = map(int, input().split())\n s = input()\n t = s[k-1]\n ans = s[:k-1] + t.lower() + s[k:]\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u535659144", "problem_id": "p03041", "submission1_id": "s096364623", "submission2_id": "s997198741", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b=map(int,input().split())\ns=input()\nprint(s.replace(s[b-1],s[b-1].lower()))", "code2": "a,b=map(int,input().split())\ns=list(input())\ns[b-1]=s[b-1].lower()\nprint(\"\".join(s))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588279556", "date2": "1588279885", "bleu_score": "0.7375701845814518", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "5 1\nBBE@\n", "actual_output": "bbE@\n", "expected_output": "bBE@\n\n", "anno_code": ["a,b=map(int,input().split()) # (0): a=5, b=1\ns=input() # (1): s=BBE@\nprint(s.replace(s[b-1],s[b-1].lower()))"], "anno_status": [true], "diff_content": " a,b=map(int,input().split())\n-s=input()\n-print(s.replace(s[b-1],s[b-1].lower()))\n+s=list(input())\n+s[b-1]=s[b-1].lower()\n+print(\"\".join(s))\n", "FL_content": " a,b=map(int,input().split())\n-s=input()\n-print(s.replace(s[b-1],s[b-1].lower()))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u609255576", "problem_id": "p03041", "submission1_id": "s489265290", "submission2_id": "s606487207", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inputstr1 = input().split()\nn = inputstr1[0]\nk = inputstr1[1]\ns = input()\ns_list = list(s)\ns_list[int(k) - 1] = s_list[int(k)-1].lower()\ns = \"\".join(s_list)\nprint(\"S:\"+s)\n", "code2": "inputstr1 = input().split()\nn = inputstr1[0]\nk = inputstr1[1]\ns = input()\ns_list = list(s)\ns_list[int(k) - 1] = s_list[int(k)-1].lower()\ns = \"\".join(s_list)\nprint(s)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558462237", "date2": "1558462326", "bleu_score": "0.9614123641971644", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9 1\nBBAE\n", "actual_output": "S:bBAE\n", "expected_output": "bBAE\n\n", "anno_code": ["inputstr1 = input().split() # (0): inputstr1=['9', '1']\nn = inputstr1[0] # (1): n=9\nk = inputstr1[1] # (2): k=1\ns = input() # (3): s=BBAE\ns_list = list(s) # (4): s_list=['B', 'B', 'A', 'E']\ns_list[int(k) - 1] = s_list[int(k)-1].lower() # (5): s_list=['b', 'B', 'A', 'E']\ns = \"\".join(s_list) # (6): s=bBAE\nprint(\"S:\"+s)\n"], "anno_status": [true], "diff_content": " inputstr1 = input().split()\n n = inputstr1[0]\n k = inputstr1[1]\n s = input()\n s_list = list(s)\n s_list[int(k) - 1] = s_list[int(k)-1].lower()\n s = \"\".join(s_list)\n-print(\"S:\"+s)\n+print(s)\n \n", "FL_content": " inputstr1 = input().split()\n n = inputstr1[0]\n k = inputstr1[1]\n s = input()\n s_list = list(s)\n s_list[int(k) - 1] = s_list[int(k)-1].lower()\n s = \"\".join(s_list)\n-print(\"S:\"+s)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u752898745", "problem_id": "p03041", "submission1_id": "s871954842", "submission2_id": "s744019827", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split());s=input();print(s[k-1].lower())", "code2": "n,k=map(int,input().split());s=input();print(s[:k-1]+s[k-1].lower()+s[k:])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587522742", "date2": "1587524394", "bleu_score": "0.7928076662725507", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 1\nABAB\n", "actual_output": "a\n", "expected_output": "aBAB\n\n", "anno_code": ["n,k=map(int,input().split());s=input();print(s[k-1].lower())"], "anno_status": [true], "diff_content": "-n,k=map(int,input().split());s=input();print(s[k-1].lower())\n+n,k=map(int,input().split());s=input();print(s[:k-1]+s[k-1].lower()+s[k:])\n", "FL_content": "-n,k=map(int,input().split());s=input();print(s[k-1].lower())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u369320902", "problem_id": "p03041", "submission1_id": "s118693254", "submission2_id": "s758505236", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input().split()\nb = input()\n \nlist = list(b)\n \nfor i in list:\n if i == int(a[1]) - 1:\n list[i] = list[i].lower()\n \nprint(''.join(list))", "code2": "a = input().split()\nb = input()\n \nc = list(b)\n \nfor i in range(len(c)):\n if i == int(a[1]) - 1:\n c[i] = c[i].lower()\n \nprint(''.join(c))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558314555", "date2": "1558315197", "bleu_score": "0.8135348362814775", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9 2\nABB\n", "actual_output": "ABB\n", "expected_output": "AbB\n\n", "anno_code": ["a = input().split() # (0): a=['9', '2']\nb = input() # (1): b=ABB\n \nlist = list(b) # (2): list=['A', 'B', 'B']\n \nfor i in list: # (3): i=A (5): i=B ... (9): NO CHANGE\n if i == int(a[1]) - 1: # (4): NO CHANGE (6): NO CHANGE (8): NO CHANGE\n list[i] = list[i].lower()\n \nprint(''.join(list))"], "anno_status": [true], "diff_content": " a = input().split()\n b = input()\n \n-list = list(b)\n+c = list(b)\n \n-for i in list:\n+for i in range(len(c)):\n if i == int(a[1]) - 1:\n- list[i] = list[i].lower()\n+ c[i] = c[i].lower()\n \n-print(''.join(list))\n+print(''.join(c))\n", "FL_content": " a = input().split()\n b = input()\n \n-list = list(b)\n \n-for i in list:\n if i == int(a[1]) - 1:\n- list[i] = list[i].lower()\n \n-print(''.join(list))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 10 }, { "user_id": "u333731247", "problem_id": "p03041", "submission1_id": "s419862107", "submission2_id": "s435368689", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nS=list(input())\n\nS[K-1]=S[K-1].lower()\n\nprint(S)", "code2": "N,K=map(int,input().split())\nS=list(input())\nANS=' '\n\nS[K-1]=S[K-1].lower()\n\nfor i in S:\n ANS+=i\n\nprint(ANS)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565639567", "date2": "1565639804", "bleu_score": "0.6684084238295688", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9 2\nABB\n", "actual_output": "['A', 'b', 'B']\n", "expected_output": "AbB\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=9, K=2\nS=list(input()) # (1): S=['A', 'B', 'B']\n\nS[K-1]=S[K-1].lower() # (2): S=['A', 'b', 'B']\n\nprint(S)"], "anno_status": [true], "diff_content": " N,K=map(int,input().split())\n S=list(input())\n+ANS=' '\n \n S[K-1]=S[K-1].lower()\n \n-print(S)\n+for i in S:\n+ ANS+=i\n+\n+print(ANS)\n", "FL_content": " N,K=map(int,input().split())\n S=list(input())\n \n S[K-1]=S[K-1].lower()\n \n-print(S)\n", "added_lines": 5, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u329455846", "problem_id": "p03041", "submission1_id": "s976906064", "submission2_id": "s616111609", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N , K = map(int,input().split())\nstr_t = list(input())\nans =''\nfor i in range(len(str_t)):\n if i == K:\n ans += str_t[i].lower()\n else:\n ans += str_t[i].upper()\nprint(ans)", "code2": "N , K = map(int,input().split())\nstr_t = list(input())\nans =''\nK = K-1\nfor i in range(len(str_t)):\n if i == K:\n ans += str_t[i].lower()\n else:\n ans += str_t[i].upper()\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559330125", "date2": "1559330211", "bleu_score": "0.9554361300970328", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2\nBB@E\n", "actual_output": "BB@E\n", "expected_output": "Bb@E\n\n", "anno_code": ["N , K = map(int,input().split()) # (0): N=-1, K=2\nstr_t = list(input()) # (1): str_t=['B', 'B', '@', 'E']\nans ='' # (2): ans=\nfor i in range(len(str_t)): # (3): i=0 (6): i=1 ... (15): NO CHANGE\n if i == K: # (4): NO CHANGE (7): NO CHANGE ... (13): NO CHANGE\n ans += str_t[i].lower() # (11): ans=BB@\n else:\n ans += str_t[i].upper() # (5): ans=B (8): ans=BB (14): ans=BB@E\nprint(ans)"], "anno_status": [true], "diff_content": " N , K = map(int,input().split())\n str_t = list(input())\n ans =''\n+K = K-1\n for i in range(len(str_t)):\n if i == K:\n ans += str_t[i].lower()\n else:\n ans += str_t[i].upper()\n print(ans)\n", "FL_content": " N , K = map(int,input().split())\n str_t = list(input())\n ans =''\n for i in range(len(str_t)):\n if i == K:\n ans += str_t[i].lower()\n else:\n ans += str_t[i].upper()\n print(ans)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u898097781", "problem_id": "p00026", "submission1_id": "s312714823", "submission2_id": "s675538869", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n drop(1,1,1)\n\nn = 0\nm = 0\nfor f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n\nprint(n)\nprint(m)\n\n", "code2": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n drop(x,y,z)\n\nn = 0\nm = 0\nfor f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n\nprint(n)\nprint(m)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525328505", "date2": "1525328565", "bleu_score": "0.9696094001737522", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n6,2,3\n2,4,2\n4,5,2\n3,6,3\n4,1,1\n", "actual_output": "95\n6\n", "expected_output": "62\n4\n\n", "anno_code": ["import sys\n\nlines = [] # (0): lines=[]\nfor line in sys.stdin: # (1): line=3,5,3 (3): line=6,2,3 ... (13): NO CHANGE\n lines.append(line.strip().split(',')) # (2): lines (4): lines ... (12): lines\n\nfield = [[0 for i in range(10)] for j in range(10)] # (14): field\n\ndef drop(x, y, z): # (15): drop=\n if z==1: # (19): NO CHANGE (53): NO CHANGE ... (189): NO CHANGE\n for i in range(-1,2): # (20): i=-1 (29): i=0 ... (219): sys=, lines=[['3', '5', '3'], ['6', '2', '3'], ['2', '4', '2'], ['4', '5', '2'], ['3', '6', '3'], ['4', '1', '1']], line=['4', '1', '1'], field, drop=, x=4\n for j in range(-1,2): # (21): j=-1 (23): j=0 ... (218): NO CHANGE\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10: # (22): NO CHANGE (24): NO CHANGE ... (217): NO CHANGE\n field[y+j][x+i] += 1 # (25): NO CHANGE (32): NO CHANGE ... (215): NO CHANGE\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines: # (16): line=['3', '5', '3'] (50): line=['6', '2', '3'] ... (220): NO CHANGE\n x,y,z = map(int, line) # (17): x=3, y=5, z=3 (51): x=6, y=2 ... (187): x=4, y=1, z=1\n drop(1,1,1) # (18): x=1, y=1, z=1 (52): x=1, y=1, z=1 ... (188): x=1\n\nn = 0 # (221): n=0\nm = 0 # (222): m=0\nfor f in field: # (223): f=[0, 6, 0, 0, 0, 0, 0, 0, 0, 0] (265): f=[6, 6, 6, 0, 0, 0, 0, 0, 0, 0] ... (639): NO CHANGE\n for e in f: # (224): e=0 (228): e=6 ... (638): NO CHANGE\n if e > m: # (225): NO CHANGE (229): NO CHANGE ... (635): NO CHANGE\n m = e # (230): m=6\n if e==0: # (226): NO CHANGE (231): NO CHANGE ... (636): NO CHANGE\n n+=1 # (227): n=1 (235): n=2 ... (637): n=95\n\nprint(n) # (640): NO CHANGE\nprint(m)\n\n"], "anno_status": [true], "diff_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n+ if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n \n \n \n for line in lines:\n x,y,z = map(int, line)\n- drop(1,1,1)\n+ drop(x,y,z)\n \n n = 0\n m = 0\n for f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n \n print(n)\n print(m)\n \n \n", "FL_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n \n \n \n for line in lines:\n x,y,z = map(int, line)\n- drop(1,1,1)\n \n n = 0\n m = 0\n for f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n \n print(n)\n print(m)\n \n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 44 }, { "user_id": "u964040941", "problem_id": "p00026", "submission1_id": "s090239443", "submission2_id": "s426531926", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\npaper = [[0] * 10 for i in range(10)]\n\nfor line in sys.stdin:\n x,y,s = map(int,line.split(','))\n for i in range(10):\n for j in range(10):\n if s == 1:\n if abs(i - y) + abs(j - x) <= 1:\n paper [i] [j] += 1\n if s == 2:\n if abs(i - y) <= 1 and abs(j - x) <= 1:\n paper [i] [j] += 1\n if s == 3:\n if abs(i - y) + abs(j - x) <= 2:\n paper [i] [j] += 1\n\nans = [0,0]\nfor i in range(10):\n for j in range(10):\n if paper [i] [j] == 0:\n ans [0] += 1\n if paper [i] [j] > ans [1]:\n ans [1] = paper [i] [j]\n\nprint(ans [0],ans [1])", "code2": "paper = [[0] * 10 for i in range(10)]\n\nwhile True:\n try:\n x,y,s = map(int,input().split(','))\n except:\n break\n if s == 1:\n for i in range(10):\n for j in range(10):\n if abs(x - i) + abs(y - j) <= 1:\n paper [i] [j] += 1\n elif s == 2:\n for i in range(10):\n for j in range(10):\n if abs(x - i) <= 1 and abs(y - j) <= 1:\n paper [i] [j] += 1\n else:\n for i in range(10):\n for j in range(10):\n if abs(x - i) + abs(y - j) <= 2:\n paper [i] [j] += 1\n\nls = sum(paper,[])\nprint(ls.count(0))\nprint(max(ls))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480740411", "date2": "1485442676", "bleu_score": "0.7539327967449538", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,6,1\n2,4,2\n6,4,2\n2,6,3\n1,4,2\n", "actual_output": "69 4\n", "expected_output": "69\n4\n\n", "anno_code": ["import sys\n\npaper = [[0] * 10 for i in range(10)] # (0): paper\n\nfor line in sys.stdin: # (1): line=2,5,3 (537): line=3,6,1 ... (3197): NO CHANGE\n x,y,s = map(int,line.split(',')) # (2): x=2, y=5, s=3 (538): x=3, y=6, s=1 ... (2666): x=1, y=4, s=2\n for i in range(10): # (3): i=0 (55): i=1 ... (3196): NO CHANGE\n for j in range(10): # (4): j=0 (9): j=1 ... (3195): NO CHANGE\n if s == 1: # (5): NO CHANGE (10): NO CHANGE ... (3191): NO CHANGE\n if abs(i - y) + abs(j - x) <= 1: # (542): NO CHANGE (547): NO CHANGE ... (1060): NO CHANGE\n paper [i] [j] += 1 # (818): paper (866): paper ... (926): paper\n if s == 2: # (6): NO CHANGE (11): NO CHANGE ... (3192): NO CHANGE\n if abs(i - y) <= 1 and abs(j - x) <= 1: # (1071): NO CHANGE (1076): NO CHANGE ... (3193): NO CHANGE\n paper [i] [j] += 1 # (1233): paper (1239): paper ... (2950): paper\n if s == 3: # (7): NO CHANGE (12): NO CHANGE ... (3194): NO CHANGE\n if abs(i - y) + abs(j - x) <= 2: # (8): NO CHANGE (13): NO CHANGE ... (2662): NO CHANGE\n paper [i] [j] += 1 # (175): paper (223): paper ... (2575): paper\n\nans = [0,0] # (3198): ans=[0, 0]\nfor i in range(10): # (3199): i=0 (3241): i=1 ... (3592): NO CHANGE\n for j in range(10): # (3200): j=0 (3204): j=1 ... (3591): NO CHANGE\n if paper [i] [j] == 0: # (3201): NO CHANGE (3205): NO CHANGE ... (3588): NO CHANGE\n ans [0] += 1 # (3202): ans=[1, 0] (3206): ans=[2, 0] ... (3589): ans=[69, 4]\n if paper [i] [j] > ans [1]: # (3203): NO CHANGE (3207): NO CHANGE ... (3590): NO CHANGE\n ans [1] = paper [i] [j] # (3329): ans=[30, 1] (3333): ans=[30, 2] ... (3373): ans=[33, 4]\n\nprint(ans [0],ans [1])"], "anno_status": [true], "diff_content": "-import sys\n-\n paper = [[0] * 10 for i in range(10)]\n \n-for line in sys.stdin:\n- x,y,s = map(int,line.split(','))\n- for i in range(10):\n- for j in range(10):\n- if s == 1:\n- if abs(i - y) + abs(j - x) <= 1:\n+while True:\n+ try:\n+ x,y,s = map(int,input().split(','))\n+ except:\n+ break\n+ if s == 1:\n+ for i in range(10):\n+ for j in range(10):\n+ if abs(x - i) + abs(y - j) <= 1:\n paper [i] [j] += 1\n- if s == 2:\n- if abs(i - y) <= 1 and abs(j - x) <= 1:\n+ elif s == 2:\n+ for i in range(10):\n+ for j in range(10):\n+ if abs(x - i) <= 1 and abs(y - j) <= 1:\n paper [i] [j] += 1\n- if s == 3:\n- if abs(i - y) + abs(j - x) <= 2:\n+ else:\n+ for i in range(10):\n+ for j in range(10):\n+ if abs(x - i) + abs(y - j) <= 2:\n paper [i] [j] += 1\n \n-ans = [0,0]\n-for i in range(10):\n- for j in range(10):\n- if paper [i] [j] == 0:\n- ans [0] += 1\n- if paper [i] [j] > ans [1]:\n- ans [1] = paper [i] [j]\n-\n-print(ans [0],ans [1])\n+ls = sum(paper,[])\n+print(ls.count(0))\n+print(max(ls))\n", "FL_content": "-import sys\n-\n paper = [[0] * 10 for i in range(10)]\n \n-for line in sys.stdin:\n- x,y,s = map(int,line.split(','))\n- for i in range(10):\n- for j in range(10):\n- if s == 1:\n- if abs(i - y) + abs(j - x) <= 1:\n paper [i] [j] += 1\n- if s == 2:\n- if abs(i - y) <= 1 and abs(j - x) <= 1:\n paper [i] [j] += 1\n- if s == 3:\n- if abs(i - y) + abs(j - x) <= 2:\n paper [i] [j] += 1\n \n-ans = [0,0]\n-for i in range(10):\n- for j in range(10):\n- if paper [i] [j] == 0:\n- ans [0] += 1\n- if paper [i] [j] > ans [1]:\n- ans [1] = paper [i] [j]\n-\n-print(ans [0],ans [1])\n", "added_lines": 20, "removed_lines": 21, "code1_lines": 27 }, { "user_id": "u203261375", "problem_id": "p00026", "submission1_id": "s724596557", "submission2_id": "s847098597", "status1": "Wrong Answer", "status2": "Accepted", "code1": "area = [[0 for i in range(10)] for j in range(10)]\n\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n\n if s == 3:\n if (0 <= x+2 <= 9) and (0 <= y <= 9):\n area[x+2][y] += 1\n if (0 <= x <= 9) and (0 <= y+2 <= 9):\n area[x][y+2] += 1\n if (0 <= x-2 <= 9) and (0 <= y <= 9):\n area[x-2][y] += 1\n if (0 <= x <= 9) and (0 <= y-2 <= 9):\n area[x][y-2] += 1\n if s >= 2:\n if (0 <= x+1 <= 9) and (0 <= y+1 <= 9):\n area[x+1][y+1] += 1\n if (0 <= x+1 <= 9) and (0 <= y-1 <= 9):\n area[x+1][y-1] += 1\n if (0 <= x-1 <= 9) and (0 <= y+1 <= 9):\n area[x-1][y+1] += 1\n if (0 <= x-1 <= 9) and (0 <= y-1 <= 9):\n area[x-1][y-1] += 1\n if s >= 1:\n if (0 <= x+1 <= 9) and (0 <= y <= 9):\n area[x+1][y] += 1\n if (0 <= x <= 9) and (0 <= y+1 <= 9):\n area[x][y+1] += 1\n if (0 <= x-1 <= 9) and (0 <= y <= 9):\n area[x-1][y] += 1\n if (0 <= x <= 9) and (0 <= y-1 <= 9):\n area[x][y-1] += 1\n area[x][y] += 1\n print(area)\n\nmax = 0\ncnt = 0\n\nfor i in range(10):\n for j in range(10):\n if area[i][j] == 0:\n cnt += 1\n if area[i][j] > max:\n max = area[i][j]\nprint(cnt)\nprint(max)", "code2": "def check(x, y):\n return 0 <= x <= 9 and 0 <= y <= 9\n\n\ndef small(x, y, area):\n if check(x+1, y):\n area[x+1][y] += 1\n if check(x, y+1):\n area[x][y+1] += 1\n if check(x-1, y):\n area[x-1][y] += 1\n if check(x, y-1):\n area[x][y-1] += 1\n area[x][y] += 1\n return area\n\n\ndef mediam(x, y, area):\n area = small(x, y, area)\n if check(x+1, y+1):\n area[x+1][y+1] += 1\n if check(x+1, y-1):\n area[x+1][y-1] += 1\n if check(x-1, y+1):\n area[x-1][y+1] += 1\n if check(x-1, y-1):\n area[x-1][y-1] += 1\n return area\n\n\ndef large(x, y, area):\n area = mediam(x, y, area)\n if check(x+2, y):\n area[x+2][y] += 1\n if check(x, y+2):\n area[x][y+2] += 1\n if check(x-2, y):\n area[x-2][y] += 1\n if check(x, y-2):\n area[x][y-2] += 1\n return area\n\narea = [[0 for i in range(10)] for j in range(10)]\n\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n\n if s == 1:\n area = small(x, y, area)\n if s == 2:\n area = mediam(x, y, area)\n if s == 3:\n area = large(x, y, area)\n\nmax = 0\ncnt = 0\n\nfor i in range(10):\n for j in range(10):\n if area[i][j] == 0:\n cnt += 1\n if area[i][j] > max:\n max = area[i][j]\nprint(cnt)\nprint(max)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1513497529", "date2": "1513498589", "bleu_score": "0.6947371167125835", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,6,1\n2,4,2\n4,4,2\n4,6,3\n4,1,1\n", "actual_output": "[[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, 1, 0, 0, 0], [0, 0, 0, 1, 1, 1, 1, 1, 0, 0], [0, 0, 0, 0, 1, 1, 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, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]\n[[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, 2, 0, 0, 0], [0, 0, 0, 1, 1, 2, 2, 2, 0, 0], [0, 0, 0, 0, 1, 1, 2, 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]]\n[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 1, 2, 0, 0, 0, 0], [0, 0, 0, 1, 2, 2, 2, 0, 0, 0], [0, 0, 0, 2, 2, 3, 2, 2, 0, 0], [0, 0, 0, 0, 1, 1, 2, 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]]\n[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 1, 2, 0, 0, 0, 0], [0, 0, 0, 1, 2, 2, 2, 0, 0, 0], [0, 0, 0, 3, 3, 4, 2, 2, 0, 0], [0, 0, 0, 1, 2, 2, 2, 0, 0, 0], [0, 0, 0, 1, 1, 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]]\n[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 1, 2, 0, 0, 0, 0], [0, 0, 0, 1, 2, 2, 3, 0, 0, 0], [0, 0, 0, 3, 3, 5, 3, 3, 0, 0], [0, 0, 0, 1, 3, 3, 3, 1, 1, 0], [0, 0, 0, 1, 1, 3, 1, 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, 0, 0, 0]]\n[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 1, 2, 0, 0, 0, 0], [0, 0, 0, 1, 2, 2, 3, 0, 0, 0], [0, 1, 0, 3, 3, 5, 3, 3, 0, 0], [1, 1, 1, 1, 3, 3, 3, 1, 1, 0], [0, 1, 0, 1, 1, 3, 1, 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, 0, 0, 0]]\n71\n5\n", "expected_output": "71\n5\n\n", "anno_code": ["area = [[0 for i in range(10)] for j in range(10)] # (0): area\n\nwhile True: # (1): NO CHANGE (33): NO CHANGE ... (145): NO CHANGE\n try: # (2): NO CHANGE (34): NO CHANGE ... (146): NO CHANGE\n x, y, s = map(int, input().split(',')) # (3): x=3, y=5, s=3 (35): y=6, s=1 ... (147): NO CHANGE\n except: # (148): NO CHANGE\n break # (149): NO CHANGE\n\n if s == 3: # (4): NO CHANGE (36): NO CHANGE ... (132): NO CHANGE\n if (0 <= x+2 <= 9) and (0 <= y <= 9): # (5): NO CHANGE (101): NO CHANGE\n area[x+2][y] += 1 # (6): area (102): area\n if (0 <= x <= 9) and (0 <= y+2 <= 9): # (7): NO CHANGE (103): NO CHANGE\n area[x][y+2] += 1 # (8): area (104): area\n if (0 <= x-2 <= 9) and (0 <= y <= 9): # (9): NO CHANGE (105): NO CHANGE\n area[x-2][y] += 1 # (10): area (106): area\n if (0 <= x <= 9) and (0 <= y-2 <= 9): # (11): NO CHANGE (107): NO CHANGE\n area[x][y-2] += 1 # (12): area (108): area\n if s >= 2: # (13): NO CHANGE (37): NO CHANGE ... (133): NO CHANGE\n if (0 <= x+1 <= 9) and (0 <= y+1 <= 9): # (14): NO CHANGE (54): NO CHANGE ... (110): NO CHANGE\n area[x+1][y+1] += 1 # (15): area (55): area ... (111): area\n if (0 <= x+1 <= 9) and (0 <= y-1 <= 9): # (16): NO CHANGE (56): NO CHANGE ... (112): NO CHANGE\n area[x+1][y-1] += 1 # (17): area (57): area ... (113): area\n if (0 <= x-1 <= 9) and (0 <= y+1 <= 9): # (18): NO CHANGE (58): NO CHANGE ... (114): NO CHANGE\n area[x-1][y+1] += 1 # (19): area (59): area ... (115): area\n if (0 <= x-1 <= 9) and (0 <= y-1 <= 9): # (20): NO CHANGE (60): NO CHANGE ... (116): NO CHANGE\n area[x-1][y-1] += 1 # (21): area (61): area ... (117): area\n if s >= 1: # (22): NO CHANGE (38): NO CHANGE ... (134): NO CHANGE\n if (0 <= x+1 <= 9) and (0 <= y <= 9): # (23): NO CHANGE (39): NO CHANGE ... (135): NO CHANGE\n area[x+1][y] += 1 # (24): area (40): area ... (136): area\n if (0 <= x <= 9) and (0 <= y+1 <= 9): # (25): NO CHANGE (41): NO CHANGE ... (137): NO CHANGE\n area[x][y+1] += 1 # (26): area (42): area ... (138): area\n if (0 <= x-1 <= 9) and (0 <= y <= 9): # (27): NO CHANGE (43): NO CHANGE ... (139): NO CHANGE\n area[x-1][y] += 1 # (28): area (44): area ... (140): area\n if (0 <= x <= 9) and (0 <= y-1 <= 9): # (29): NO CHANGE (45): NO CHANGE ... (141): NO CHANGE\n area[x][y-1] += 1 # (30): area (46): area ... (142): area\n area[x][y] += 1 # (31): area (47): area ... (143): area\n print(area) # (32): NO CHANGE (48): NO CHANGE ... (144): NO CHANGE\n\nmax = 0 # (150): max=0\ncnt = 0 # (151): cnt=0\n\nfor i in range(10): # (152): i=0 (194): i=1 ... (547): NO CHANGE\n for j in range(10): # (153): j=0 (157): j=1 ... (546): NO CHANGE\n if area[i][j] == 0: # (154): NO CHANGE (158): NO CHANGE ... (543): NO CHANGE\n cnt += 1 # (155): cnt=1 (159): cnt=2 ... (544): cnt=71\n if area[i][j] > max: # (156): NO CHANGE (160): NO CHANGE ... (545): NO CHANGE\n max = area[i][j] # (210): max=1 (217): max=2 ... (295): max=5\nprint(cnt) # (548): NO CHANGE\nprint(max)"], "anno_status": [false], "diff_content": "+def check(x, y):\n+ return 0 <= x <= 9 and 0 <= y <= 9\n+\n+\n+def small(x, y, area):\n+ if check(x+1, y):\n+ area[x+1][y] += 1\n+ if check(x, y+1):\n+ area[x][y+1] += 1\n+ if check(x-1, y):\n+ area[x-1][y] += 1\n+ if check(x, y-1):\n+ area[x][y-1] += 1\n+ area[x][y] += 1\n+ return area\n+\n+\n+def mediam(x, y, area):\n+ area = small(x, y, area)\n+ if check(x+1, y+1):\n+ area[x+1][y+1] += 1\n+ if check(x+1, y-1):\n+ area[x+1][y-1] += 1\n+ if check(x-1, y+1):\n+ area[x-1][y+1] += 1\n+ if check(x-1, y-1):\n+ area[x-1][y-1] += 1\n+ return area\n+\n+\n+def large(x, y, area):\n+ area = mediam(x, y, area)\n+ if check(x+2, y):\n+ area[x+2][y] += 1\n+ if check(x, y+2):\n+ area[x][y+2] += 1\n+ if check(x-2, y):\n+ area[x-2][y] += 1\n+ if check(x, y-2):\n+ area[x][y-2] += 1\n+ return area\n+\n area = [[0 for i in range(10)] for j in range(10)]\n \n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n \n+ if s == 1:\n+ area = small(x, y, area)\n+ if s == 2:\n+ area = mediam(x, y, area)\n if s == 3:\n- if (0 <= x+2 <= 9) and (0 <= y <= 9):\n- area[x+2][y] += 1\n- if (0 <= x <= 9) and (0 <= y+2 <= 9):\n- area[x][y+2] += 1\n- if (0 <= x-2 <= 9) and (0 <= y <= 9):\n- area[x-2][y] += 1\n- if (0 <= x <= 9) and (0 <= y-2 <= 9):\n- area[x][y-2] += 1\n- if s >= 2:\n- if (0 <= x+1 <= 9) and (0 <= y+1 <= 9):\n- area[x+1][y+1] += 1\n- if (0 <= x+1 <= 9) and (0 <= y-1 <= 9):\n- area[x+1][y-1] += 1\n- if (0 <= x-1 <= 9) and (0 <= y+1 <= 9):\n- area[x-1][y+1] += 1\n- if (0 <= x-1 <= 9) and (0 <= y-1 <= 9):\n- area[x-1][y-1] += 1\n- if s >= 1:\n- if (0 <= x+1 <= 9) and (0 <= y <= 9):\n- area[x+1][y] += 1\n- if (0 <= x <= 9) and (0 <= y+1 <= 9):\n- area[x][y+1] += 1\n- if (0 <= x-1 <= 9) and (0 <= y <= 9):\n- area[x-1][y] += 1\n- if (0 <= x <= 9) and (0 <= y-1 <= 9):\n- area[x][y-1] += 1\n- area[x][y] += 1\n- print(area)\n+ area = large(x, y, area)\n \n max = 0\n cnt = 0\n \n for i in range(10):\n for j in range(10):\n if area[i][j] == 0:\n cnt += 1\n if area[i][j] > max:\n max = area[i][j]\n print(cnt)\n print(max)\n", "FL_content": " area = [[0 for i in range(10)] for j in range(10)]\n \n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n \n if s == 3:\n- if (0 <= x+2 <= 9) and (0 <= y <= 9):\n- area[x+2][y] += 1\n- if (0 <= x <= 9) and (0 <= y+2 <= 9):\n- area[x][y+2] += 1\n- if (0 <= x-2 <= 9) and (0 <= y <= 9):\n- area[x-2][y] += 1\n- if (0 <= x <= 9) and (0 <= y-2 <= 9):\n- area[x][y-2] += 1\n- if s >= 2:\n- if (0 <= x+1 <= 9) and (0 <= y+1 <= 9):\n- area[x+1][y+1] += 1\n- if (0 <= x+1 <= 9) and (0 <= y-1 <= 9):\n- area[x+1][y-1] += 1\n- if (0 <= x-1 <= 9) and (0 <= y+1 <= 9):\n- area[x-1][y+1] += 1\n- if (0 <= x-1 <= 9) and (0 <= y-1 <= 9):\n- area[x-1][y-1] += 1\n- if s >= 1:\n- if (0 <= x+1 <= 9) and (0 <= y <= 9):\n- area[x+1][y] += 1\n- if (0 <= x <= 9) and (0 <= y+1 <= 9):\n- area[x][y+1] += 1\n- if (0 <= x-1 <= 9) and (0 <= y <= 9):\n- area[x-1][y] += 1\n- if (0 <= x <= 9) and (0 <= y-1 <= 9):\n- area[x][y-1] += 1\n- area[x][y] += 1\n- print(area)\n \n max = 0\n cnt = 0\n \n for i in range(10):\n for j in range(10):\n if area[i][j] == 0:\n cnt += 1\n if area[i][j] > max:\n max = area[i][j]\n print(cnt)\n print(max)\n", "added_lines": 47, "removed_lines": 28, "code1_lines": 49 }, { "user_id": "u358919705", "problem_id": "p00026", "submission1_id": "s743554912", "submission2_id": "s115588064", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = [[0] * 14 for _ in range(14)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\nprint(sum(a[i][2:12].count(0) for i in range(2, 12)))\nprint(max(max(a[i][2:12]) for i in range(2, 12)))\nprint(a)", "code2": "a = [[0] * 14 for _ in range(14)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\nprint(sum(a[i][2:12].count(0) for i in range(2, 12)))\nprint(max(max(a[i][2:12]) for i in range(2, 12)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1471991602", "date2": "1471991749", "bleu_score": "0.9840852192523116", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,6,1\n2,4,2\n4,6,2\n3,7,3\n1,4,1\n", "actual_output": "73\n5\n[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 2, 3, 3, 1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 2, 3, 2, 3, 2, 1, 0, 0, 0], [0, 0, 0, 0, 0, 1, 2, 5, 4, 3, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0, 2, 3, 2, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 1, 1, 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, 0, 0, 0, 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", "expected_output": "73\n5\n\n", "anno_code": ["a = [[0] * 14 for _ in range(14)] # (0): a\nwhile True: # (1): NO CHANGE (37): NO CHANGE ... (163): NO CHANGE\n try: # (2): NO CHANGE (38): NO CHANGE ... (164): NO CHANGE\n x, y, s = map(int, input().split(',')) # (3): x=2, y=5, s=3 (39): x=3, y=6, s=1 ... (165): NO CHANGE\n except: # (166): NO CHANGE\n break # (167): NO CHANGE\n x += 2 # (4): x=4 (40): x=5 ... (148): x=3\n y += 2 # (5): y=7 (41): y=8 ... (149): y=6\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]: # (6): d=(0, 0) (8): d=(0, -1) ... (160): NO CHANGE\n a[x + d[0]][y + d[1]] += 1 # (7): a (9): a ... (159): a\n if s >= 2: # (17): NO CHANGE (53): NO CHANGE ... (161): NO CHANGE\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]: # (18): d=(1, 1) (20): d=(1, -1) ... (134): NO CHANGE\n a[x + d[0]][y + d[1]] += 1 # (19): a (21): a ... (133): a\n if s == 3: # (27): NO CHANGE (54): NO CHANGE ... (162): NO CHANGE\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]: # (28): d=(0, 2) (30): d=(0, -2) ... (144): NO CHANGE\n a[x + d[0]][y + d[1]] += 1 # (29): a (31): a ... (143): a\nprint(sum(a[i][2:12].count(0) for i in range(2, 12))) # (168): NO CHANGE\nprint(max(max(a[i][2:12]) for i in range(2, 12))) # (169): NO CHANGE\nprint(a)"], "anno_status": [false], "diff_content": " a = [[0] * 14 for _ in range(14)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\n print(sum(a[i][2:12].count(0) for i in range(2, 12)))\n print(max(max(a[i][2:12]) for i in range(2, 12)))\n-print(a)\n", "FL_content": " a = [[0] * 14 for _ in range(14)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\n print(sum(a[i][2:12].count(0) for i in range(2, 12)))\n print(max(max(a[i][2:12]) for i in range(2, 12)))\n-print(a)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u905313459", "problem_id": "p00026", "submission1_id": "s200123623", "submission2_id": "s930056758", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\nn2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\nn3 = n2 + [[a*2, b*2] for a, b in n1]\nmas = [[0]*10 for i in range(10)]\nfor i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n for j in eval(\"n\"+str(a)):\n try:\n mas[y+j[1]][x+j[0]] += 1\n except IndexError:\n continue\n except:\n break\nprint(len([i for x in mas for i in x if not i]))\nprint(max([max(v) for v in mas]))", "code2": "import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\nn2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\nn3 = n2 + [[a*2, b*2] for a, b in n1]\nmas = [[0]*10 for i in range(10)]\nfor i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n for k,l in eval(\"n\"+str(a)):\n try:\n if y+l >= 0 and x+k >= 0:\n mas[y+l][x+k] += 1\n except IndexError:\n continue\n except ValueError:\n break\nprint(len([i for x in mas for i in x if not i]))\nprint(max([max(v) for v in mas]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1496470810", "date2": "1496471410", "bleu_score": "0.883833518823457", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 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, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 62, "total_score": 101, "input": "1,5,2\n1,6,3\n3,4,1\n4,5,3\n3,7,3\n2,3,2\n", "actual_output": "62\n3\n", "expected_output": "63\n3\n\n", "anno_code": ["import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]] # (0): n1\nn2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]] # (1): n2\nn3 = n2 + [[a*2, b*2] for a, b in n1] # (2): n3\nmas = [[0]*10 for i in range(10)] # (3): mas\nfor i in sys.stdin: # (4): i=1,5,2 (33): i=1,6,3 ... (202): NO CHANGE\n try: # (5): NO CHANGE (34): NO CHANGE ... (174): NO CHANGE\n x, y, a = list(map(int, i.split(\",\"))) # (6): x=1, y=5, a=2 (35): y=6, a=3 ... (175): x=2, y=3, a=2\n mas[y][x] += 1 # (7): mas (36): mas ... (176): mas\n for j in eval(\"n\"+str(a)): # (8): j=[0, 1] (11): j=[1, 0] ... (201): NO CHANGE\n try: # (9): NO CHANGE (12): NO CHANGE ... (199): NO CHANGE\n mas[y+j[1]][x+j[0]] += 1 # (10): mas (13): mas ... (200): mas\n except IndexError:\n continue\n except:\n break\nprint(len([i for x in mas for i in x if not i])) # (203): NO CHANGE\nprint(max([max(v) for v in mas]))"], "anno_status": [true], "diff_content": " import sys\n n1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\n n2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\n n3 = n2 + [[a*2, b*2] for a, b in n1]\n mas = [[0]*10 for i in range(10)]\n for i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n- for j in eval(\"n\"+str(a)):\n+ for k,l in eval(\"n\"+str(a)):\n try:\n- mas[y+j[1]][x+j[0]] += 1\n+ if y+l >= 0 and x+k >= 0:\n+ mas[y+l][x+k] += 1\n except IndexError:\n continue\n- except:\n+ except ValueError:\n break\n print(len([i for x in mas for i in x if not i]))\n print(max([max(v) for v in mas]))\n", "FL_content": " import sys\n n1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\n n2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\n n3 = n2 + [[a*2, b*2] for a, b in n1]\n mas = [[0]*10 for i in range(10)]\n for i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n- for j in eval(\"n\"+str(a)):\n try:\n- mas[y+j[1]][x+j[0]] += 1\n except IndexError:\n continue\n- except:\n break\n print(len([i for x in mas for i in x if not i]))\n print(max([max(v) for v in mas]))\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u299798926", "problem_id": "p00026", "submission1_id": "s663219549", "submission2_id": "s138880683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=[[int(0) for i in range(10)]for j in range(10)]\ncount=0\nwhile 1:\n try:\n x,y,s = map(int, input().split(','))\n if s==1:\n for i in range(x-1,x+1):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]+1\n for i in range(y-1,y+1):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n A[x][y]=A[x][y]-1 \n elif s==2:\n for i in range(x-1,x+1):\n for j in range(y-1,y+1):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n else:\n for i in range(x-2,x+2):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]+1\n for i in range(y-2,y+2):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n for i in range(x-1,x+1):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]-1\n for i in range(y-1,y+1):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]-1\n for i in range(x-1,x+1):\n for j in range(y-1,y+1):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n except EOFError:\n break\n \nfor i in range(10):\n for j in range(10):\n if A[i][j]==0:\n count=count+1\nprint(count)\nprint(max(A))", "code2": "A=[[int(0) for i in range(10)]for j in range(10)]\ncount=0\nwhile 1:\n try:\n x,y,s = map(int, input().split(','))\n if s==1:\n for i in range(x-1,x+2):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]+1\n for i in range(y-1,y+2):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n A[x][y]=A[x][y]-1 \n elif s==2:\n for i in range(x-1,x+2):\n for j in range(y-1,y+2):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n else:\n for i in range(x-2,x+3):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]+1\n for i in range(y-2,y+3):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n for i in range(x-1,x+2):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]-1\n for i in range(y-1,y+2):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]-1\n for i in range(x-1,x+2):\n for j in range(y-1,y+2):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n except:\n break\nnum=0\nfor i in range(10):\n for j in range(10):\n if A[i][j]==0:\n count=count+1\n if A[i][j]!=0:\n if num=0 and i<=9: # (69): NO CHANGE (72): NO CHANGE ... (194): NO CHANGE\n A[i][y]=A[i][y]+1 # (70): A (73): A ... (195): A\n for i in range(y-1,y+1): # (75): i=5 (78): i=6 ... (203): NO CHANGE\n if i>=0 and i<=9: # (76): NO CHANGE (79): NO CHANGE ... (201): NO CHANGE\n A[x][i]=A[x][i]+1 # (77): A (80): A ... (202): A\n A[x][y]=A[x][y]-1 # (82): A=[[0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1, 0, 0, 0, 0], [0, 0, 0, 1, 1, 1, 2, 0, 0, 0], [0, 0, 0, 0, 0, 2, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]] (101): A (204): A\n elif s==2: # (6): NO CHANGE (106): NO CHANGE (128): NO CHANGE\n for i in range(x-1,x+1): # (107): NO CHANGE (115): i=5 (123): NO CHANGE\n for j in range(y-1,y+1): # (108): j=4 (111): j=5 ... (122): NO CHANGE\n if i>=0 and i<=9 and j>=0 and j<=9: # (109): NO CHANGE (112): NO CHANGE ... (120): NO CHANGE\n A[i][j]=A[i][j]+1 # (110): A (113): A ... (121): A\n else:\n for i in range(x-2,x+2): # (7): i=0 (10): i=1 ... (141): NO CHANGE\n if i>=0 and i<=9: # (8): NO CHANGE (11): NO CHANGE ... (139): NO CHANGE\n A[i][y]=A[i][y]+1 # (9): A (12): A ... (140): A\n for i in range(y-2,y+2): # (20): NO CHANGE (23): i=4 ... (154): NO CHANGE\n if i>=0 and i<=9: # (21): NO CHANGE (24): NO CHANGE ... (152): NO CHANGE\n A[x][i]=A[x][i]+1 # (22): A (25): A ... (153): A\n for i in range(x-1,x+1): # (33): i=1 (36): i=2 ... (161): NO CHANGE\n if i>=0 and i<=9: # (34): NO CHANGE (37): NO CHANGE ... (159): NO CHANGE\n A[i][y]=A[i][y]-1 # (35): A (38): A ... (160): A\n for i in range(y-1,y+1): # (40): i=4 (43): i=5 ... (168): NO CHANGE\n if i>=0 and i<=9: # (41): NO CHANGE (44): NO CHANGE ... (166): NO CHANGE\n A[x][i]=A[x][i]-1 # (42): A (45): A ... (167): A\n for i in range(x-1,x+1): # (47): i=1 (55): i=2 ... (185): NO CHANGE\n for j in range(y-1,y+1): # (48): j=4 (51): j=5 ... (184): NO CHANGE\n if i>=0 and i<=9 and j>=0 and j<=9: # (49): NO CHANGE (52): NO CHANGE ... (182): NO CHANGE\n A[i][j]=A[i][j]+1 # (50): A (53): A ... (183): A\n except EOFError: # (208): NO CHANGE\n break # (209): NO CHANGE\n \nfor i in range(10): # (210): i=0 (241): i=1 ... (510): NO CHANGE\n for j in range(10): # (211): j=0 (214): j=1 ... (509): NO CHANGE\n if A[i][j]==0: # (212): NO CHANGE (215): NO CHANGE ... (507): NO CHANGE\n count=count+1 # (213): count=1 (216): count=2 ... (508): count=80\nprint(count) # (511): NO CHANGE\nprint(max(A))"], "anno_status": [false], "diff_content": " A=[[int(0) for i in range(10)]for j in range(10)]\n count=0\n while 1:\n try:\n x,y,s = map(int, input().split(','))\n if s==1:\n- for i in range(x-1,x+1):\n+ for i in range(x-1,x+2):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]+1\n- for i in range(y-1,y+1):\n+ for i in range(y-1,y+2):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n- A[x][y]=A[x][y]-1 \n+ A[x][y]=A[x][y]-1 \n elif s==2:\n- for i in range(x-1,x+1):\n- for j in range(y-1,y+1):\n+ for i in range(x-1,x+2):\n+ for j in range(y-1,y+2):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n else:\n- for i in range(x-2,x+2):\n+ for i in range(x-2,x+3):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]+1\n- for i in range(y-2,y+2):\n+ for i in range(y-2,y+3):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n- for i in range(x-1,x+1):\n+ for i in range(x-1,x+2):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]-1\n- for i in range(y-1,y+1):\n+ for i in range(y-1,y+2):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]-1\n- for i in range(x-1,x+1):\n- for j in range(y-1,y+1):\n+ for i in range(x-1,x+2):\n+ for j in range(y-1,y+2):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n- except EOFError:\n+ except:\n break\n- \n+num=0\n for i in range(10):\n for j in range(10):\n if A[i][j]==0:\n count=count+1\n+ if A[i][j]!=0:\n+ if num=0 and i<=9:\n A[i][y]=A[i][y]+1\n- for i in range(y-1,y+1):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n- A[x][y]=A[x][y]-1 \n elif s==2:\n- for i in range(x-1,x+1):\n- for j in range(y-1,y+1):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n else:\n- for i in range(x-2,x+2):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]+1\n- for i in range(y-2,y+2):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]+1\n- for i in range(x-1,x+1):\n if i>=0 and i<=9:\n A[i][y]=A[i][y]-1\n- for i in range(y-1,y+1):\n if i>=0 and i<=9:\n A[x][i]=A[x][i]-1\n- for i in range(x-1,x+1):\n- for j in range(y-1,y+1):\n if i>=0 and i<=9 and j>=0 and j<=9:\n A[i][j]=A[i][j]+1\n- except EOFError:\n break\n- \n for i in range(10):\n for j in range(10):\n if A[i][j]==0:\n count=count+1\n print(count)\n-print(max(A))\n", "added_lines": 17, "removed_lines": 14, "code1_lines": 44 }, { "user_id": "u898097781", "problem_id": "p00026", "submission1_id": "s784331640", "submission2_id": "s675538869", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\n", "code2": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n drop(x,y,z)\n\nn = 0\nm = 0\nfor f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n\nprint(n)\nprint(m)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525328343", "date2": "1525328565", "bleu_score": "0.7625111527651829", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,2\n3,6,1\n1,3,3\n3,5,3\n3,7,3\n2,5,1\n", "actual_output": "", "expected_output": "67\n5\n\n", "anno_code": ["import sys\n\nlines = [] # (0): lines=[]\nfor line in sys.stdin: # (1): line=1,5,2 (3): line=3,6,1 ... (13): NO CHANGE\n lines.append(line.strip().split(',')) # (2): lines (4): lines ... (12): lines\n\nfield = [[0 for i in range(10)] for j in range(10)] # (14): field\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\n"], "anno_status": [true], "diff_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n+ if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n \n \n \n+for line in lines:\n+ x,y,z = map(int, line)\n+ drop(x,y,z)\n+\n+n = 0\n+m = 0\n+for f in field:\n+ for e in f:\n+ if e > m:\n+ m = e\n+ if e==0:\n+ n+=1\n+\n+print(n)\n+print(m)\n+\n \n", "FL_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n \n \n \n \n", "added_lines": 19, "removed_lines": 3, "code1_lines": 28 }, { "user_id": "u898097781", "problem_id": "p00026", "submission1_id": "s089739881", "submission2_id": "s675538869", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n \n\nn = 0\nm = 0\nfor f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n\nprint(n)\nprint(m)\n\n", "code2": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n drop(x,y,z)\n\nn = 0\nm = 0\nfor f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n\nprint(n)\nprint(m)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525328496", "date2": "1525328565", "bleu_score": "0.9688569895584808", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,5,1\n2,4,2\n5,4,2\n3,6,2\n1,4,1\n", "actual_output": "100\n0\n", "expected_output": "75\n4\n\n", "anno_code": ["import sys\n\nlines = [] # (0): lines=[]\nfor line in sys.stdin: # (1): line=3,5,3 (3): line=3,5,1 ... (13): NO CHANGE\n lines.append(line.strip().split(',')) # (2): lines (4): lines ... (12): lines\n\nfield = [[0 for i in range(10)] for j in range(10)] # (14): field\n\ndef drop(x, y, z): # (15): drop=\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines: # (16): line=['3', '5', '3'] (18): line=['3', '5', '1'] ... (28): NO CHANGE\n x,y,z = map(int, line) # (17): x=3, y=5, z=3 (19): z=1 ... (27): x=1, y=4, z=1\n \n\nn = 0 # (29): n=0\nm = 0 # (30): m=0\nfor f in field: # (31): f=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (73): NO CHANGE ... (451): NO CHANGE\n for e in f: # (32): e=0 (36): NO CHANGE ... (450): NO CHANGE\n if e > m: # (33): NO CHANGE (37): NO CHANGE ... (447): NO CHANGE\n m = e\n if e==0: # (34): NO CHANGE (38): NO CHANGE ... (448): NO CHANGE\n n+=1 # (35): n=1 (39): n=2 ... (449): n=100\n\nprint(n) # (452): NO CHANGE\nprint(m)\n\n"], "anno_status": [true], "diff_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n+ if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n \n \n \n for line in lines:\n x,y,z = map(int, line)\n- \n+ drop(x,y,z)\n \n n = 0\n m = 0\n for f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n \n print(n)\n print(m)\n \n \n", "FL_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n \n \n \n for line in lines:\n x,y,z = map(int, line)\n- \n \n n = 0\n m = 0\n for f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n \n print(n)\n print(m)\n \n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 44 }, { "user_id": "u301729341", "problem_id": "p00026", "submission1_id": "s570127393", "submission2_id": "s459683545", "status1": "Wrong Answer", "status2": "Accepted", "code1": "Masu = []\ndef access(x,y):\n if x < 0 or y < 0 or x > 9 or y > 9:\n return\n Masu[y][x] += 1\n\nfor i in range(10):\n Masu.append([0,0,0,0,0,0,0,0,0,0])\nkosu = 0\nkomax = 0\nwhile True:\n try:\n \n x,y,s = map(int,input().split(\",\"))\n if s == 1:\n for j in range(3):\n access(y +1 - j,x)\n access(y,x - 1)\n access(y,x + 1)\n\n elif s == 2:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n elif s == 3:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n access(y - 2,x)\n access(y + 2,x)\n access(y,x + 2)\n access(y,x - 2)\n print(Masu)\n \n except (EOFError,ValueError):\n for i in range(10):\n kosu += Masu[i].count(0)\n for j in range(10):\n if komax < max(Masu[j]):\n komax = max(Masu[j])\n print(kosu)\n print(komax)\n break", "code2": "Masu = []\ndef access(x,y):\n if x < 0 or y < 0 or x > 9 or y > 9:\n return\n Masu[y][x] += 1\n\nfor i in range(10):\n Masu.append([0,0,0,0,0,0,0,0,0,0])\nkosu = 0\nkomax = 0\nwhile True:\n try:\n \n x,y,s = map(int,input().split(\",\"))\n if s == 1:\n for j in range(3):\n access(y +1 - j,x)\n access(y,x - 1)\n access(y,x + 1)\n\n elif s == 2:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n elif s == 3:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n access(y - 2,x)\n access(y + 2,x)\n access(y,x + 2)\n access(y,x - 2)\n \n except (EOFError,ValueError):\n for i in range(10):\n kosu += Masu[i].count(0)\n for j in range(10):\n if komax < max(Masu[j]):\n komax = max(Masu[j])\n print(kosu)\n print(komax)\n break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1481098739", "date2": "1481098812", "bleu_score": "0.9811148253987172", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,6,2\n3,4,2\n4,5,2\n3,4,3\n1,4,1\n", "actual_output": "[[0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1, 1, 0, 0, 0], [0, 0, 0, 1, 1, 1, 1, 1, 0, 0], [0, 0, 0, 0, 1, 1, 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, 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[[0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1, 1, 0, 0, 0], [0, 0, 0, 1, 1, 2, 2, 2, 0, 0], [0, 0, 0, 0, 1, 2, 2, 1, 0, 0], [0, 0, 0, 0, 0, 2, 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]]\n[[0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1, 1, 0, 0, 0], [0, 0, 0, 2, 2, 3, 2, 2, 0, 0], [0, 0, 0, 1, 2, 3, 2, 1, 0, 0], [0, 0, 0, 1, 1, 3, 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]]\n[[0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1, 1, 0, 0, 0], [0, 0, 0, 2, 2, 3, 2, 2, 0, 0], [0, 0, 0, 1, 3, 4, 3, 1, 0, 0], [0, 0, 0, 1, 2, 4, 2, 1, 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]]\n[[0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 2, 1, 1, 0, 0, 0], [0, 0, 0, 3, 3, 4, 2, 2, 0, 0], [0, 0, 1, 2, 4, 5, 4, 1, 0, 0], [0, 0, 0, 2, 3, 5, 2, 1, 0, 0], [0, 0, 0, 0, 2, 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]]\n[[0, 0, 0, 0, 1, 1, 0, 0, 0, 0], [0, 0, 0, 1, 3, 2, 1, 0, 0, 0], [0, 0, 0, 3, 4, 4, 2, 2, 0, 0], [0, 0, 1, 2, 4, 5, 4, 1, 0, 0], [0, 0, 0, 2, 3, 5, 2, 1, 0, 0], [0, 0, 0, 0, 2, 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]]\n75\n5\n", "expected_output": "75\n5\n\n", "anno_code": ["Masu = [] # (0): Masu=[]\ndef access(x,y): # (1): access=\n if x < 0 or y < 0 or x > 9 or y > 9: # (34): NO CHANGE (38): NO CHANGE ... (317): NO CHANGE\n return\n Masu[y][x] += 1 # (35): Masu=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 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, 0, 0, 0, 0, 0, 0]], access=, i=9, kosu=0, komax=0, x=2, y=5, s=3, k=0, l=0 (39): Masu=[[0, 0, 0, 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, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], access=, i=9, kosu=0, komax=0, x=2, y=5, s=3, k=0, l=1 ... (318): Masu, access=, i=9, kosu=0, komax=0, x=1, y=4, s=1, k=2, l=2, j=2\n\nfor i in range(10): # (2): i=0 (4): i=1 ... (22): NO CHANGE\n Masu.append([0,0,0,0,0,0,0,0,0,0]) # (3): Masu (5): Masu ... (21): Masu\nkosu = 0 # (23): kosu=0\nkomax = 0 # (24): komax=0\nwhile True: # (25): NO CHANGE (87): NO CHANGE ... (320): NO CHANGE\n try: # (26): NO CHANGE (88): NO CHANGE ... (321): NO CHANGE\n \n x,y,s = map(int,input().split(\",\")) # (27): x=2, y=5, s=3 (89): x=3, y=6, s=2 ... (322): NO CHANGE\n if s == 1: # (28): NO CHANGE (90): NO CHANGE ... (299): NO CHANGE\n for j in range(3): # (300): j=0 (304): j=1 ... (312): NO CHANGE\n access(y +1 - j,x) # (301): x=5, y=1 (305): x=4, y=1 (309): x=3, y=1\n access(y,x - 1) # (313): x=4, y=0\n access(y,x + 1) # (316): x=4, y=2\n\n elif s == 2: # (29): NO CHANGE (91): NO CHANGE ... (238): NO CHANGE\n for k in range(3): # (92): k=0 (106): k=1 ... (232): NO CHANGE\n for l in range(3): # (93): l=0 (97): l=1 ... (231): NO CHANGE\n access(y + 1 - k,x + 1 -l) # (94): x=7, y=4 (98): x=7, y=3 ... (228): y=3\n elif s == 3: # (30): NO CHANGE (239): NO CHANGE\n for k in range(3): # (31): k=0 (45): k=1 ... (282): NO CHANGE\n for l in range(3): # (32): l=0 (36): l=1 ... (281): NO CHANGE\n access(y + 1 - k,x + 1 -l) # (33): x=6, y=3 (37): x=6, y=2 ... (278): y=2\n access(y - 2,x) # (74): x=3, y=2 (283): x=2, y=3\n access(y + 2,x) # (77): x=7, y=2 (286): x=6, y=3\n access(y,x + 2) # (80): x=5, y=4 (289): x=4, y=5\n access(y,x - 2) # (83): x=5, y=0 (292): x=4, y=1\n print(Masu) # (86): NO CHANGE (135): NO CHANGE ... (319): NO CHANGE\n \n except (EOFError,ValueError): # (323): NO CHANGE\n for i in range(10): # (324): i=0 (326): i=1 ... (344): NO CHANGE\n kosu += Masu[i].count(0) # (325): kosu=8 (327): kosu=14 ... (343): kosu=75\n for j in range(10): # (345): j=0 (348): j=1 ... (369): NO CHANGE\n if komax < max(Masu[j]): # (346): NO CHANGE (349): NO CHANGE ... (368): NO CHANGE\n komax = max(Masu[j]) # (347): komax=1 (350): komax=3 ... (356): komax=5\n print(kosu) # (370): NO CHANGE\n print(komax) # (371): NO CHANGE\n break"], "anno_status": [false], "diff_content": " Masu = []\n def access(x,y):\n if x < 0 or y < 0 or x > 9 or y > 9:\n return\n Masu[y][x] += 1\n \n for i in range(10):\n Masu.append([0,0,0,0,0,0,0,0,0,0])\n kosu = 0\n komax = 0\n while True:\n try:\n \n x,y,s = map(int,input().split(\",\"))\n if s == 1:\n for j in range(3):\n access(y +1 - j,x)\n access(y,x - 1)\n access(y,x + 1)\n \n elif s == 2:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n elif s == 3:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n access(y - 2,x)\n access(y + 2,x)\n access(y,x + 2)\n access(y,x - 2)\n- print(Masu)\n \n except (EOFError,ValueError):\n for i in range(10):\n kosu += Masu[i].count(0)\n for j in range(10):\n if komax < max(Masu[j]):\n komax = max(Masu[j])\n print(kosu)\n print(komax)\n break\n", "FL_content": " Masu = []\n def access(x,y):\n if x < 0 or y < 0 or x > 9 or y > 9:\n return\n Masu[y][x] += 1\n \n for i in range(10):\n Masu.append([0,0,0,0,0,0,0,0,0,0])\n kosu = 0\n komax = 0\n while True:\n try:\n \n x,y,s = map(int,input().split(\",\"))\n if s == 1:\n for j in range(3):\n access(y +1 - j,x)\n access(y,x - 1)\n access(y,x + 1)\n \n elif s == 2:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n elif s == 3:\n for k in range(3):\n for l in range(3):\n access(y + 1 - k,x + 1 -l)\n access(y - 2,x)\n access(y + 2,x)\n access(y,x + 2)\n access(y,x - 2)\n- print(Masu)\n \n except (EOFError,ValueError):\n for i in range(10):\n kosu += Masu[i].count(0)\n for j in range(10):\n if komax < max(Masu[j]):\n komax = max(Masu[j])\n print(kosu)\n print(komax)\n break\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 43 }, { "user_id": "u546285759", "problem_id": "p00026", "submission1_id": "s344383441", "submission2_id": "s152224981", "status1": "Wrong Answer", "status2": "Accepted", "code1": "t = [[0 for i in range(10)] for j in range(10)]\ncase1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\ncase2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\ncase3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n try:\n t[y+_y][x+_x] += 1\n except IndexError:\n continue\nprint(sum(1 for l in t for v in l if not v))\nprint(max(v for l in t for v in l))", "code2": "t = [[0 for i in range(10)] for j in range(10)]\ncase1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\ncase2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\ncase3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n if y+_y < 0 or x+_x < 0:\n continue\n try:\n t[y+_y][x+_x] += 1\n except IndexError:\n continue\n\nprint(sum(1 for l in t for v in l if not v))\nprint(max(v for l in t for v in l))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1497691578", "date2": "1497692084", "bleu_score": "0.8929428505616193", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 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, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 62, "total_score": 101, "input": "2,5,3\n1,4,3\n3,4,2\n5,5,2\n3,6,3\n1,4,1\n", "actual_output": "69\n4\n", "expected_output": "70\n4\n\n", "anno_code": ["t = [[0 for i in range(10)] for j in range(10)] # (0): t\ncase1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)] # (1): case1=[(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\ncase2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)] # (2): case2=[(1, -1), (1, 1), (-1, 1), (-1, -1)]\ncase3 = [(0, -2), (2, 0), (0, 2), (-2, 0)] # (3): case3=[(0, -2), (2, 0), (0, 2), (-2, 0)]\nwhile True: # (4): NO CHANGE (53): NO CHANGE ... (242): NO CHANGE\n try: # (5): NO CHANGE (54): NO CHANGE ... (243): NO CHANGE\n x, y, s = map(int, input().split(',')) # (6): x=2, y=5, s=3 (55): x=1, y=4 ... (244): NO CHANGE\n except: # (245): NO CHANGE\n break # (246): NO CHANGE\n for c in [case1, case2, case3][:s]: # (7): c=[(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)] (24): c=[(1, -1), (1, 1), (-1, 1), (-1, -1)] ... (241): NO CHANGE\n for _x, _y in c: # (8): _x=0, _y=0 (11): _y=-1 ... (240): NO CHANGE\n try: # (9): NO CHANGE (12): NO CHANGE ... (238): NO CHANGE\n t[y+_y][x+_x] += 1 # (10): t (13): t ... (239): t\n except IndexError:\n continue\nprint(sum(1 for l in t for v in l if not v)) # (247): NO CHANGE\nprint(max(v for l in t for v in l))"], "anno_status": [true], "diff_content": " t = [[0 for i in range(10)] for j in range(10)]\n case1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\n case2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\n case3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n+ if y+_y < 0 or x+_x < 0:\n+ continue\n try:\n t[y+_y][x+_x] += 1\n except IndexError:\n continue\n+\n print(sum(1 for l in t for v in l if not v))\n print(max(v for l in t for v in l))\n", "FL_content": " t = [[0 for i in range(10)] for j in range(10)]\n case1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\n case2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\n case3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n try:\n t[y+_y][x+_x] += 1\n except IndexError:\n continue\n print(sum(1 for l in t for v in l if not v))\n print(max(v for l in t for v in l))\n", "added_lines": 3, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u898097781", "problem_id": "p00026", "submission1_id": "s238208352", "submission2_id": "s675538869", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n drop(1,1,1)\n\n", "code2": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n drop(x,y,z)\n\nn = 0\nm = 0\nfor f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n\nprint(n)\nprint(m)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525328439", "date2": "1525328565", "bleu_score": "0.8269319293712653", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,2\n3,6,1\n3,4,2\n4,5,2\n3,6,3\n1,4,1\n", "actual_output": "", "expected_output": "76\n5\n\n", "anno_code": ["import sys\n\nlines = [] # (0): lines=[]\nfor line in sys.stdin: # (1): line=3,5,2 (3): line=3,6,1 ... (13): NO CHANGE\n lines.append(line.strip().split(',')) # (2): lines (4): lines ... (12): lines\n\nfield = [[0 for i in range(10)] for j in range(10)] # (14): field\n\ndef drop(x, y, z): # (15): drop=\n if z==1: # (19): NO CHANGE (53): NO CHANGE ... (189): NO CHANGE\n for i in range(-1,2): # (20): i=-1 (29): i=0 ... (219): sys=, lines=[['3', '5', '2'], ['3', '6', '1'], ['3', '4', '2'], ['4', '5', '2'], ['3', '6', '3'], ['1', '4', '1']], line=['1', '4', '1'], field, drop=, y=4\n for j in range(-1,2): # (21): j=-1 (23): j=0 ... (218): NO CHANGE\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10: # (22): NO CHANGE (24): NO CHANGE ... (217): NO CHANGE\n field[y+j][x+i] += 1 # (25): NO CHANGE (32): NO CHANGE ... (215): NO CHANGE\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines: # (16): line=['3', '5', '2'] (50): line=['3', '6', '1'] ... (186): line=['1', '4', '1']\n x,y,z = map(int, line) # (17): x=3, y=5, z=2 (51): y=6, z=1 ... (187): x=1, y=4, z=1\n drop(1,1,1) # (18): x=1, y=1, z=1 (52): x=1, y=1 ... (188): y=1\n\n"], "anno_status": [true], "diff_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n+ if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n \n \n \n for line in lines:\n x,y,z = map(int, line)\n- drop(1,1,1)\n+ drop(x,y,z)\n+\n+n = 0\n+m = 0\n+for f in field:\n+ for e in f:\n+ if e > m:\n+ m = e\n+ if e==0:\n+ n+=1\n+\n+print(n)\n+print(m)\n \n \n", "FL_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n \n \n \n for line in lines:\n x,y,z = map(int, line)\n- drop(1,1,1)\n \n \n", "added_lines": 16, "removed_lines": 4, "code1_lines": 32 }, { "user_id": "u905313459", "problem_id": "p00026", "submission1_id": "s932436861", "submission2_id": "s930056758", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\nn2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\nn3 = n2 + [[a*2, b*2] for a, b in n1]\nmas = [[0]*10 for i in range(10)]\nfor i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n for k,l in eval(\"n\"+str(a)):\n try:\n if y+l>= 0 and x+k >= 0:\n mas[y+l][x+k] += 1\n except IndexError:\n continue\n except ValueError:\n break\nprint(mas)\nprint(len([i for x in mas for i in x if not i]))\nprint(max([max(v) for v in mas]))", "code2": "import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\nn2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\nn3 = n2 + [[a*2, b*2] for a, b in n1]\nmas = [[0]*10 for i in range(10)]\nfor i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n for k,l in eval(\"n\"+str(a)):\n try:\n if y+l >= 0 and x+k >= 0:\n mas[y+l][x+k] += 1\n except IndexError:\n continue\n except ValueError:\n break\nprint(len([i for x in mas for i in x if not i]))\nprint(max([max(v) for v in mas]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1496471351", "date2": "1496471410", "bleu_score": "0.978833930667809", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,2\n3,6,1\n2,4,2\n6,4,2\n3,6,2\n1,4,1\n", "actual_output": "[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 2, 1, 1, 0, 1, 1, 1, 0, 0], [1, 2, 3, 2, 1, 1, 1, 1, 0, 0], [0, 2, 3, 4, 2, 1, 1, 1, 0, 0], [0, 0, 3, 3, 3, 0, 0, 0, 0, 0], [0, 0, 1, 2, 1, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]\n73\n4\n", "expected_output": "73\n4\n\n", "anno_code": ["import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]] # (0): n1\nn2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]] # (1): n2\nn3 = n2 + [[a*2, b*2] for a, b in n1] # (2): n3\nmas = [[0]*10 for i in range(10)] # (3): mas\nfor i in sys.stdin: # (4): i=3,5,2 (41): i=3,6,1 ... (194): NO CHANGE\n try: # (5): NO CHANGE (42): NO CHANGE ... (174): NO CHANGE\n x, y, a = list(map(int, i.split(\",\"))) # (6): x=3, y=5, a=2 (43): y=6, a=1 ... (175): x=1, y=4, a=1\n mas[y][x] += 1 # (7): mas (44): mas ... (176): mas\n for k,l in eval(\"n\"+str(a)): # (8): k=0, l=1 (12): k=1, l=0 ... (193): NO CHANGE\n try: # (9): NO CHANGE (13): NO CHANGE ... (190): NO CHANGE\n if y+l>= 0 and x+k >= 0: # (10): NO CHANGE (14): NO CHANGE ... (191): NO CHANGE\n mas[y+l][x+k] += 1 # (11): mas (15): mas ... (192): mas\n except IndexError:\n continue\n except ValueError:\n break\nprint(mas) # (195): NO CHANGE\nprint(len([i for x in mas for i in x if not i])) # (196): NO CHANGE\nprint(max([max(v) for v in mas]))"], "anno_status": [true], "diff_content": " import sys\n n1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\n n2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\n n3 = n2 + [[a*2, b*2] for a, b in n1]\n mas = [[0]*10 for i in range(10)]\n for i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n for k,l in eval(\"n\"+str(a)):\n try:\n- if y+l>= 0 and x+k >= 0:\n+ if y+l >= 0 and x+k >= 0:\n mas[y+l][x+k] += 1\n except IndexError:\n continue\n except ValueError:\n break\n-print(mas)\n print(len([i for x in mas for i in x if not i]))\n print(max([max(v) for v in mas]))\n", "FL_content": " import sys\n n1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\n n2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\n n3 = n2 + [[a*2, b*2] for a, b in n1]\n mas = [[0]*10 for i in range(10)]\n for i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n for k,l in eval(\"n\"+str(a)):\n try:\n- if y+l>= 0 and x+k >= 0:\n mas[y+l][x+k] += 1\n except IndexError:\n continue\n except ValueError:\n break\n-print(mas)\n print(len([i for x in mas for i in x if not i]))\n print(max([max(v) for v in mas]))\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u193025715", "problem_id": "p00026", "submission1_id": "s165128973", "submission2_id": "s083529398", "status1": "Wrong Answer", "status2": "Accepted", "code1": "paper = [0 for i in range(100)]\nwhite_points = None\ndeep_points = None\n\ndef small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n\ndef middle(x, y):\n p = small(x, y)\n for i, j in zip([1, -1, 1, -1], [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n\ndef big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n\nwhile True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n print(paper.count(0))\n print(max(paper))\n break\n\n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n if not 0 <= p[1] * 10 + p[0] <= 99: continue\n paper[p[1] * 10 + p[0]] += 1", "code2": "\n\npaper = [[0] * 10 for i in range(10)]\n\ndef small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n\ndef middle(x, y):\n p = small(x, y)\n for i, j in zip([1, -1, 1, -1], [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n\ndef big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n\nwhile True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n break\n\n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n if 0 <= p[0] < 10 and 0 <= p[1] < 10:\n paper[p[1]][p[0]] += 1\n\nprint(sum(paper[y][x] == 0 for y in range(10) for x in range(10)))\nprint(max(paper[y][x] for y in range(10) for x in range(10)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1408265248", "date2": "1408266164", "bleu_score": "0.8686962021926141", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 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, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 63, "total_score": 101, "input": "1,5,2\n3,6,1\n1,4,3\n4,5,3\n3,7,3\n2,4,1\n", "actual_output": "66\n4\n", "expected_output": "67\n4\n\n", "anno_code": ["paper = [0 for i in range(100)] # (0): paper=[0, 0, ..., 0, 0]\nwhite_points = None # (1): white_points=None\ndeep_points = None # (2): deep_points=None\n\ndef small(x, y): # (3): small=\n p = [[x, y]] # (13): p (65): p ... (327): p\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]): # (14): i=-1, j=0 (16): i=0, j=-1 ... (336): paper=[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, 1, 0, 1, 0, 0, 0, 0, 1, 2, 2, 2, 2, 1, 1, 0, 0, 0, 0, 2, 2, 3, 3, 1, 1, 1, 0, 0, 0, 1, 2, 3, 3, 3, 1, 0, 0, 0, 0, 0, 1, 1, 2, 2, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], white_points=None, deep_points=None, small=, middle=, big=, size=1, bp, p=[3, 9]\n p.append([x + i, y + j]) # (15): p (17): p ... (335): p\n return p\n\ndef middle(x, y): # (4): middle=\n p = small(x, y) # (12): NO CHANGE (99): NO CHANGE ... (253): NO CHANGE\n for i, j in zip([1, -1, 1, -1], [1, 1, -1, -1]): # (23): i=1, j=1 (25): i=-1 ... (272): NO CHANGE\n p.append([x + i, y + j]) # (24): p (26): p ... (271): p\n return p\n\ndef big(x, y): # (5): big=\n p = middle(x, y) # (98): NO CHANGE (175): NO CHANGE (252): NO CHANGE\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]): # (119): i=-2, j=0 (121): i=0, j=-2 ... (281): paper=[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, 1, 0, 1, 0, 0, 0, 0, 1, 2, 2, 2, 2, 1, 1, 0, 0, 0, 0, 2, 2, 3, 2, 1, 1, 1, 0, 0, 0, 1, 2, 2, 2, 2, 1, 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], white_points=None, deep_points=None, small=, middle=, big=, size=3, bp, p=[4, 7]\n p.append([x + i, y + j]) # (120): p (122): p ... (280): p\n return p\n\nwhile True: # (6): NO CHANGE (60): NO CHANGE ... (353): NO CHANGE\n try: # (7): NO CHANGE (61): NO CHANGE ... (354): NO CHANGE\n x, y, size = map(int, input().split(',')) # (8): x=1, y=5, size=2 (62): x=3, y=6, size=1 ... (355): NO CHANGE\n except: # (356): NO CHANGE\n print(paper.count(0)) # (357): NO CHANGE\n print(max(paper)) # (358): NO CHANGE\n break\n\n if size == 1: # (9): NO CHANGE (63): NO CHANGE ... (325): NO CHANGE\n bp = small(x, y) # (64): NO CHANGE (326): NO CHANGE\n elif size == 2: # (10): NO CHANGE (95): NO CHANGE ... (249): NO CHANGE\n bp = middle(x, y) # (11): NO CHANGE\n elif size == 3: # (96): NO CHANGE (173): NO CHANGE (250): NO CHANGE\n bp = big(x, y) # (97): NO CHANGE (174): NO CHANGE (251): NO CHANGE\n for p in bp: # (32): p=[1, 5] (35): p=[0, 5] ... (352): NO CHANGE\n if not 0 <= p[1] * 10 + p[0] <= 99: continue # (33): NO CHANGE (36): NO CHANGE ... (350): NO CHANGE\n paper[p[1] * 10 + p[0]] += 1 # (34): paper=[0, 0, ..., 0, 0] (37): paper=[0, 0, ..., 0, 0] ... (351): paper=[0, 0, ..., 0, 0]\n"], "anno_status": [false], "diff_content": "-paper = [0 for i in range(100)]\n-white_points = None\n-deep_points = None\n+\n+\n+paper = [[0] * 10 for i in range(10)]\n \n def small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n \n def middle(x, y):\n p = small(x, y)\n for i, j in zip([1, -1, 1, -1], [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n \n def big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n \n while True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n- print(paper.count(0))\n- print(max(paper))\n break\n \n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n- if not 0 <= p[1] * 10 + p[0] <= 99: continue\n- paper[p[1] * 10 + p[0]] += 1\n+ if 0 <= p[0] < 10 and 0 <= p[1] < 10:\n+ paper[p[1]][p[0]] += 1\n+\n+print(sum(paper[y][x] == 0 for y in range(10) for x in range(10)))\n+print(max(paper[y][x] for y in range(10) for x in range(10)))\n", "FL_content": "-paper = [0 for i in range(100)]\n-white_points = None\n-deep_points = None\n \n def small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n \n def middle(x, y):\n p = small(x, y)\n for i, j in zip([1, -1, 1, -1], [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n \n def big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n \n while True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n- print(paper.count(0))\n- print(max(paper))\n break\n \n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n- if not 0 <= p[1] * 10 + p[0] <= 99: continue\n- paper[p[1] * 10 + p[0]] += 1\n", "added_lines": 8, "removed_lines": 7, "code1_lines": 39 }, { "user_id": "u546285759", "problem_id": "p00026", "submission1_id": "s347239489", "submission2_id": "s152224981", "status1": "Wrong Answer", "status2": "Accepted", "code1": "t = [[0 for i in range(10)] for j in range(10)]\ncase1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\ncase2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\ncase3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n try:\n t[x+_x][y+_y] += 1\n except IndexError:\n continue\nprint(sum(1 for l in t for v in l if not v))\nprint(max(v for l in t for v in l))", "code2": "t = [[0 for i in range(10)] for j in range(10)]\ncase1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\ncase2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\ncase3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n if y+_y < 0 or x+_x < 0:\n continue\n try:\n t[y+_y][x+_x] += 1\n except IndexError:\n continue\n\nprint(sum(1 for l in t for v in l if not v))\nprint(max(v for l in t for v in l))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1497691117", "date2": "1497692084", "bleu_score": "0.8882933189009133", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 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, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 62, "total_score": 101, "input": "2,5,3\n1,6,3\n3,4,2\n4,5,2\n3,5,3\n1,4,1\n", "actual_output": "72\n4\n", "expected_output": "73\n4\n\n", "anno_code": ["t = [[0 for i in range(10)] for j in range(10)] # (0): t\ncase1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)] # (1): case1=[(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\ncase2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)] # (2): case2=[(1, -1), (1, 1), (-1, 1), (-1, -1)]\ncase3 = [(0, -2), (2, 0), (0, 2), (-2, 0)] # (3): case3=[(0, -2), (2, 0), (0, 2), (-2, 0)]\nwhile True: # (4): NO CHANGE (53): NO CHANGE ... (242): NO CHANGE\n try: # (5): NO CHANGE (54): NO CHANGE ... (243): NO CHANGE\n x, y, s = map(int, input().split(',')) # (6): x=2, y=5, s=3 (55): x=1, y=6 ... (244): NO CHANGE\n except: # (245): NO CHANGE\n break # (246): NO CHANGE\n for c in [case1, case2, case3][:s]: # (7): c=[(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)] (24): c=[(1, -1), (1, 1), (-1, 1), (-1, -1)] ... (241): NO CHANGE\n for _x, _y in c: # (8): _x=0, _y=0 (11): _y=-1 ... (240): NO CHANGE\n try: # (9): NO CHANGE (12): NO CHANGE ... (238): NO CHANGE\n t[x+_x][y+_y] += 1 # (10): t (13): t ... (239): t\n except IndexError:\n continue\nprint(sum(1 for l in t for v in l if not v)) # (247): NO CHANGE\nprint(max(v for l in t for v in l))"], "anno_status": [true], "diff_content": " t = [[0 for i in range(10)] for j in range(10)]\n case1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\n case2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\n case3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n+ if y+_y < 0 or x+_x < 0:\n+ continue\n try:\n- t[x+_x][y+_y] += 1\n+ t[y+_y][x+_x] += 1\n except IndexError:\n continue\n+\n print(sum(1 for l in t for v in l if not v))\n print(max(v for l in t for v in l))\n", "FL_content": " t = [[0 for i in range(10)] for j in range(10)]\n case1 = [(0, 0), (0, -1), (1, 0), (0, 1), (-1, 0)]\n case2 = [(1, -1), (1, 1), (-1, 1), (-1, -1)]\n case3 = [(0, -2), (2, 0), (0, 2), (-2, 0)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n for c in [case1, case2, case3][:s]:\n for _x, _y in c:\n try:\n- t[x+_x][y+_y] += 1\n except IndexError:\n continue\n print(sum(1 for l in t for v in l if not v))\n print(max(v for l in t for v in l))\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u766477342", "problem_id": "p00026", "submission1_id": "s391579770", "submission2_id": "s594056350", "status1": "Wrong Answer", "status2": "Accepted", "code1": "d = [[0] * 10 for i in range(10)]\n\ndef b(x, y):\n for i in range(x - 2, x + 3):\n a = 3 - abs(x - i)\n for a in range(y - a + 1, y + a):\n if 0 <= i < 10 and 0 <= a < 10:\n d[a][i] += 1\n\n\ndef m(x, y):\n for i in range(x - 1, x + 2):\n for j in range(y - 1, y + 2):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n\n\ndef s(x, y):\n r = (1, 0)\n for i in range(x - 1, x + 2):\n a = abs(x - i)\n for j in range(y - r[a], y + r[a] + 1):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n\nwhile 1:\n try:\n f = (None, s, m, b)\n x, y, size = list(map(int, input().split(',')))\n f[size](x, y)\n\n except:\n break\n\n\nr1 = r2 = 0\nfor i in range(10):\n for j in range(10):\n r1 += 1 if d[i][j] == 0 else 0\n r2 = max(r2, d[i][j])\n\nprint(r1, r2)", "code2": "d = [[0] * 10 for i in range(10)]\n\ndef b(x, y):\n for i in range(x - 2, x + 3):\n a = 3 - abs(x - i)\n for a in range(y - a + 1, y + a):\n if 0 <= i < 10 and 0 <= a < 10:\n d[a][i] += 1\n\n\ndef m(x, y):\n for i in range(x - 1, x + 2):\n for j in range(y - 1, y + 2):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n\n\ndef s(x, y):\n r = (1, 0)\n for i in range(x - 1, x + 2):\n a = abs(x - i)\n for j in range(y - r[a], y + r[a] + 1):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n\nwhile 1:\n try:\n f = (None, s, m, b)\n x, y, size = list(map(int, input().split(',')))\n f[size](x, y)\n except:\n break\n\n\nr1 = r2 = 0\nfor i in range(10):\n for j in range(10):\n r1 += 1 if d[i][j] == 0 else 0\n r2 = max(r2, d[i][j])\n\nprint(r1)\nprint(r2)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1468325407", "date2": "1468326063", "bleu_score": "0.9887386522217063", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,6,2\n2,4,3\n6,5,2\n3,6,2\n1,4,2\n", "actual_output": "69 5\n", "expected_output": "69\n5\n\n", "anno_code": ["d = [[0] * 10 for i in range(10)] # (0): d\n\ndef b(x, y): # (1): b=\n for i in range(x - 2, x + 3): # (9): i=0 (15): i=1 ... (162): d, b=, m=, s=, f=(None, , , ), size=3\n a = 3 - abs(x - i) # (10): a=1 (16): a=2 ... (157): a=1\n for a in range(y - a + 1, y + a): # (11): a=5 (14): NO CHANGE ... (161): NO CHANGE\n if 0 <= i < 10 and 0 <= a < 10: # (12): NO CHANGE (18): NO CHANGE ... (159): NO CHANGE\n d[a][i] += 1 # (13): NO CHANGE (19): NO CHANGE ... (160): NO CHANGE\n\n\ndef m(x, y): # (2): m=\n for i in range(x - 1, x + 2): # (69): i=2 (80): i=3 ... (279): d, b=, m=, s=, f=(None, , , ), size=2\n for j in range(y - 1, y + 2): # (70): j=5 (73): j=6 ... (278): NO CHANGE\n if 0 <= i < 10 and 0 <= j < 10: # (71): NO CHANGE (74): NO CHANGE ... (276): NO CHANGE\n d[j][i] += 1 # (72): NO CHANGE (75): NO CHANGE ... (277): NO CHANGE\n\n\ndef s(x, y): # (3): s=\n r = (1, 0)\n for i in range(x - 1, x + 2):\n a = abs(x - i)\n for j in range(y - r[a], y + r[a] + 1):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n\nwhile 1: # (4): NO CHANGE (64): NO CHANGE ... (280): NO CHANGE\n try: # (5): NO CHANGE (65): NO CHANGE ... (281): NO CHANGE\n f = (None, s, m, b) # (6): f=(None, , , ) (66): NO CHANGE ... (282): NO CHANGE\n x, y, size = list(map(int, input().split(','))) # (7): x=2, y=5, size=3 (67): x=3, y=6, size=2 ... (283): NO CHANGE\n f[size](x, y) # (8): NO CHANGE (68): NO CHANGE ... (245): NO CHANGE\n\n except: # (284): NO CHANGE\n break # (285): NO CHANGE\n\n\nr1 = r2 = 0 # (286): r1=0, r2=0\nfor i in range(10): # (287): i=0 (319): i=1 ... (607): NO CHANGE\n for j in range(10): # (288): j=0 (291): j=1 ... (606): NO CHANGE\n r1 += 1 if d[i][j] == 0 else 0 # (289): r1=1 (292): r1=2 ... (604): r1=69\n r2 = max(r2, d[i][j]) # (290): NO CHANGE (293): NO CHANGE ... (605): NO CHANGE\n\nprint(r1, r2)"], "anno_status": [false], "diff_content": " d = [[0] * 10 for i in range(10)]\n \n def b(x, y):\n for i in range(x - 2, x + 3):\n a = 3 - abs(x - i)\n for a in range(y - a + 1, y + a):\n if 0 <= i < 10 and 0 <= a < 10:\n d[a][i] += 1\n \n \n def m(x, y):\n for i in range(x - 1, x + 2):\n for j in range(y - 1, y + 2):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n \n \n def s(x, y):\n r = (1, 0)\n for i in range(x - 1, x + 2):\n a = abs(x - i)\n for j in range(y - r[a], y + r[a] + 1):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n \n while 1:\n try:\n f = (None, s, m, b)\n x, y, size = list(map(int, input().split(',')))\n f[size](x, y)\n-\n except:\n break\n \n \n r1 = r2 = 0\n for i in range(10):\n for j in range(10):\n r1 += 1 if d[i][j] == 0 else 0\n r2 = max(r2, d[i][j])\n \n-print(r1, r2)\n+print(r1)\n+print(r2)\n", "FL_content": " d = [[0] * 10 for i in range(10)]\n \n def b(x, y):\n for i in range(x - 2, x + 3):\n a = 3 - abs(x - i)\n for a in range(y - a + 1, y + a):\n if 0 <= i < 10 and 0 <= a < 10:\n d[a][i] += 1\n \n \n def m(x, y):\n for i in range(x - 1, x + 2):\n for j in range(y - 1, y + 2):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n \n \n def s(x, y):\n r = (1, 0)\n for i in range(x - 1, x + 2):\n a = abs(x - i)\n for j in range(y - r[a], y + r[a] + 1):\n if 0 <= i < 10 and 0 <= j < 10:\n d[j][i] += 1\n \n while 1:\n try:\n f = (None, s, m, b)\n x, y, size = list(map(int, input().split(',')))\n f[size](x, y)\n-\n except:\n break\n \n \n r1 = r2 = 0\n for i in range(10):\n for j in range(10):\n r1 += 1 if d[i][j] == 0 else 0\n r2 = max(r2, d[i][j])\n \n-print(r1, r2)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 42 }, { "user_id": "u898097781", "problem_id": "p00026", "submission1_id": "s131154299", "submission2_id": "s675538869", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\ndrop(1,1,1)\n\n", "code2": "import sys\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.strip().split(','))\n\nfield = [[0 for i in range(10)] for j in range(10)]\n\ndef drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n\n\n\nfor line in lines:\n x,y,z = map(int, line)\n drop(x,y,z)\n\nn = 0\nm = 0\nfor f in field:\n for e in f:\n if e > m:\n m = e\n if e==0:\n n+=1\n\nprint(n)\nprint(m)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525328406", "date2": "1525328565", "bleu_score": "0.7664176627661053", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,6,1\n3,4,2\n5,5,2\n3,5,3\n1,4,1\n", "actual_output": "", "expected_output": "74\n4\n\n", "anno_code": ["import sys\n\nlines = [] # (0): lines=[]\nfor line in sys.stdin: # (1): line=2,5,3 (3): line=3,6,1 ... (13): NO CHANGE\n lines.append(line.strip().split(',')) # (2): lines (4): lines ... (12): lines\n\nfield = [[0 for i in range(10)] for j in range(10)] # (14): field\n\ndef drop(x, y, z): # (15): drop=\n if z==1: # (17): NO CHANGE\n for i in range(-1,2): # (18): i=-1 (27): i=0 (38): i=1\n for j in range(-1,2): # (19): j=-1 (21): j=0 ... (46): NO CHANGE\n if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10: # (20): NO CHANGE (22): NO CHANGE ... (45): NO CHANGE\n field[y+j][x+i] += 1 # (23): NO CHANGE (30): NO CHANGE ... (43): NO CHANGE\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n\ndrop(1,1,1) # (16): x=1, y=1, z=1\n\n"], "anno_status": [true], "diff_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<2 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n+ if 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n+ if abs(i)+abs(j)<3 and 0<=y+j<=9 and 0<=x+i<=9:\n field[y+j][x+i] += 1\n \n-drop(1,1,1)\n+\n+\n+for line in lines:\n+ x,y,z = map(int, line)\n+ drop(x,y,z)\n+\n+n = 0\n+m = 0\n+for f in field:\n+ for e in f:\n+ if e > m:\n+ m = e\n+ if e==0:\n+ n+=1\n+\n+print(n)\n+print(m)\n \n \n", "FL_content": " import sys\n \n lines = []\n for line in sys.stdin:\n lines.append(line.strip().split(','))\n \n field = [[0 for i in range(10)] for j in range(10)]\n \n def drop(x, y, z):\n if z==1:\n for i in range(-1,2):\n for j in range(-1,2):\n- if abs(i)+abs(j)<2 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n elif z==2:\n for i in range(-1,2):\n for j in range(-1,2):\n- if 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n else:\n for i in range(-2,3):\n for j in range(-2,3):\n- if abs(i)+abs(j)<3 and 0<=y+j<=10 and 0<=x+i<=10:\n field[y+j][x+i] += 1\n \n-drop(1,1,1)\n \n \n", "added_lines": 20, "removed_lines": 4, "code1_lines": 28 }, { "user_id": "u661290476", "problem_id": "p00026", "submission1_id": "s956045492", "submission2_id": "s634855216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nboard=[[0]*10 for i in range(10)]\nink=[[[0,0,0,0,0],[0,0,1,0,0],[0,1,1,1,0],[0,0,1,0,0],[0,0,0,0,0]],\n[[0,0,0,0,0],[0,1,1,1,0],[0,1,1,1,0],[0,1,1,1,0],[0,0,0,0,0]],\n[[0,0,1,0,0],[0,1,1,1,0],[1,1,1,1,1],[0,1,1,1,0],[0,0,1,0,0]]]\n\nwhile True:\n try:\n x,y,s=map(int,input().split(\",\"))\n except:\n break\n for i in range(5):\n for j in range(5):\n if 0<=i+y-2<=9 and 0<=j+x-2<=9:\n board[i+y-2][j+x-2]+=ink[s-1][i][j]\n\nflat=sum(board,[])\nprint(flat.count(0))\nprint(flat.count(max(flat)))", "code2": "\nboard=[[0]*10 for i in range(10)]\nink=[[[0,0,0,0,0],[0,0,1,0,0],[0,1,1,1,0],[0,0,1,0,0],[0,0,0,0,0]],\n[[0,0,0,0,0],[0,1,1,1,0],[0,1,1,1,0],[0,1,1,1,0],[0,0,0,0,0]],\n[[0,0,1,0,0],[0,1,1,1,0],[1,1,1,1,1],[0,1,1,1,0],[0,0,1,0,0]]]\n\nwhile True:\n try:\n x,y,s=map(int,input().split(\",\"))\n except:\n break\n for i in range(5):\n for j in range(5):\n if 0<=i+y-2<=9 and 0<=j+x-2<=9:\n board[i+y-2][j+x-2]+=ink[s-1][i][j]\n \nflat=sum(board,[])\nprint(flat.count(0))\nprint(max(flat))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1482327260", "date2": "1482330999", "bleu_score": "0.9745712194815744", "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, 1, 0, 0, 0, 0, 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, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 101, "input": "2,5,3\n3,6,1\n3,4,2\n4,5,2\n3,6,3\n2,4,1\n", "actual_output": "77\n2\n", "expected_output": "77\n5\n", "anno_code": ["\nboard=[[0]*10 for i in range(10)] # (0): board\nink=[[[0,0,0,0,0],[0,0,1,0,0],[0,1,1,1,0],[0,0,1,0,0],[0,0,0,0,0]], # (1): NO CHANGE (4): ink\n[[0,0,0,0,0],[0,1,1,1,0],[0,1,1,1,0],[0,1,1,1,0],[0,0,0,0,0]], # (2): NO CHANGE\n[[0,0,1,0,0],[0,1,1,1,0],[1,1,1,1,1],[0,1,1,1,0],[0,0,1,0,0]]] # (3): NO CHANGE\n\nwhile True: # (5): NO CHANGE (94): NO CHANGE ... (539): NO CHANGE\n try: # (6): NO CHANGE (95): NO CHANGE ... (540): NO CHANGE\n x,y,s=map(int,input().split(\",\")) # (7): x=2, y=5, s=3 (96): x=3, y=6, s=1 ... (541): NO CHANGE\n except: # (542): NO CHANGE\n break # (543): NO CHANGE\n for i in range(5): # (8): i=0 (25): i=1 ... (538): NO CHANGE\n for j in range(5): # (9): j=0 (12): j=1 ... (537): NO CHANGE\n if 0<=i+y-2<=9 and 0<=j+x-2<=9: # (10): NO CHANGE (13): NO CHANGE ... (535): NO CHANGE\n board[i+y-2][j+x-2]+=ink[s-1][i][j] # (11): NO CHANGE (14): NO CHANGE ... (536): NO CHANGE\n\nflat=sum(board,[]) # (544): flat=[0, 0, ..., 0, 0]\nprint(flat.count(0)) # (545): NO CHANGE\nprint(flat.count(max(flat)))"], "anno_status": [true], "diff_content": " \n board=[[0]*10 for i in range(10)]\n ink=[[[0,0,0,0,0],[0,0,1,0,0],[0,1,1,1,0],[0,0,1,0,0],[0,0,0,0,0]],\n [[0,0,0,0,0],[0,1,1,1,0],[0,1,1,1,0],[0,1,1,1,0],[0,0,0,0,0]],\n [[0,0,1,0,0],[0,1,1,1,0],[1,1,1,1,1],[0,1,1,1,0],[0,0,1,0,0]]]\n \n while True:\n try:\n x,y,s=map(int,input().split(\",\"))\n except:\n break\n for i in range(5):\n for j in range(5):\n if 0<=i+y-2<=9 and 0<=j+x-2<=9:\n board[i+y-2][j+x-2]+=ink[s-1][i][j]\n-\n+ \n flat=sum(board,[])\n print(flat.count(0))\n-print(flat.count(max(flat)))\n+print(max(flat))\n", "FL_content": " \n board=[[0]*10 for i in range(10)]\n ink=[[[0,0,0,0,0],[0,0,1,0,0],[0,1,1,1,0],[0,0,1,0,0],[0,0,0,0,0]],\n [[0,0,0,0,0],[0,1,1,1,0],[0,1,1,1,0],[0,1,1,1,0],[0,0,0,0,0]],\n [[0,0,1,0,0],[0,1,1,1,0],[1,1,1,1,1],[0,1,1,1,0],[0,0,1,0,0]]]\n \n while True:\n try:\n x,y,s=map(int,input().split(\",\"))\n except:\n break\n for i in range(5):\n for j in range(5):\n if 0<=i+y-2<=9 and 0<=j+x-2<=9:\n board[i+y-2][j+x-2]+=ink[s-1][i][j]\n-\n flat=sum(board,[])\n print(flat.count(0))\n-print(flat.count(max(flat)))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u905313459", "problem_id": "p00026", "submission1_id": "s847892407", "submission2_id": "s930056758", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\nn2 = n1 + [[a, b] for a in [-1,1] for b in [-1, 1]]\nn3 = n2 + [[a*2, b*2] for a, b in n1]\nmas = [[0]*10 for i in range(10)]\nfor i in sys.stdin:\n try:\n x, y, a = list(map(int,i.split(\",\")))\n mas[y][x] += 1\n for j in eval(\"n\"+str(a)):\n try:\n mas[y+j[1]][x+j[0]] += 1\n except IndexError:\n continue\n except:\n break\nprint(len([i for x in mas for i in x if not i]))\nprint(max([max(v) for v in mas]))", "code2": "import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\nn2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\nn3 = n2 + [[a*2, b*2] for a, b in n1]\nmas = [[0]*10 for i in range(10)]\nfor i in sys.stdin:\n try:\n x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n for k,l in eval(\"n\"+str(a)):\n try:\n if y+l >= 0 and x+k >= 0:\n mas[y+l][x+k] += 1\n except IndexError:\n continue\n except ValueError:\n break\nprint(len([i for x in mas for i in x if not i]))\nprint(max([max(v) for v in mas]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1496470487", "date2": "1496471410", "bleu_score": "0.8752111327169505", "code1_test_status": [1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 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, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 62, "total_score": 101, "input": "2,5,3\n1,6,3\n3,4,2\n4,5,2\n3,6,3\n2,4,1\n", "actual_output": "72\n5\n", "expected_output": "73\n5\n\n", "anno_code": ["import sys\nn1 = [[0, 1], [1, 0], [-1, 0], [0, -1]] # (0): n1\nn2 = n1 + [[a, b] for a in [-1,1] for b in [-1, 1]] # (1): n2\nn3 = n2 + [[a*2, b*2] for a, b in n1] # (2): n3\nmas = [[0]*10 for i in range(10)] # (3): mas\nfor i in sys.stdin: # (4): i=2,5,3 (45): i=1,6,3 ... (202): NO CHANGE\n try: # (5): NO CHANGE (46): NO CHANGE ... (186): NO CHANGE\n x, y, a = list(map(int,i.split(\",\"))) # (6): x=2, y=5, a=3 (47): x=1, y=6 ... (187): x=2, y=4, a=1\n mas[y][x] += 1 # (7): mas (48): mas ... (188): mas\n for j in eval(\"n\"+str(a)): # (8): j=[0, 1] (11): j=[1, 0] ... (201): NO CHANGE\n try: # (9): NO CHANGE (12): NO CHANGE ... (199): NO CHANGE\n mas[y+j[1]][x+j[0]] += 1 # (10): mas (13): mas ... (200): mas\n except IndexError:\n continue\n except:\n break\nprint(len([i for x in mas for i in x if not i])) # (203): NO CHANGE\nprint(max([max(v) for v in mas]))"], "anno_status": [true], "diff_content": " import sys\n n1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\n-n2 = n1 + [[a, b] for a in [-1,1] for b in [-1, 1]]\n+n2 = n1 + [[a, b] for a in [-1, 1] for b in [-1, 1]]\n n3 = n2 + [[a*2, b*2] for a, b in n1]\n mas = [[0]*10 for i in range(10)]\n for i in sys.stdin:\n try:\n- x, y, a = list(map(int,i.split(\",\")))\n+ x, y, a = list(map(int, i.split(\",\")))\n mas[y][x] += 1\n- for j in eval(\"n\"+str(a)):\n+ for k,l in eval(\"n\"+str(a)):\n try:\n- mas[y+j[1]][x+j[0]] += 1\n+ if y+l >= 0 and x+k >= 0:\n+ mas[y+l][x+k] += 1\n except IndexError:\n continue\n- except:\n+ except ValueError:\n break\n print(len([i for x in mas for i in x if not i]))\n print(max([max(v) for v in mas]))\n", "FL_content": " import sys\n n1 = [[0, 1], [1, 0], [-1, 0], [0, -1]]\n-n2 = n1 + [[a, b] for a in [-1,1] for b in [-1, 1]]\n n3 = n2 + [[a*2, b*2] for a, b in n1]\n mas = [[0]*10 for i in range(10)]\n for i in sys.stdin:\n try:\n- x, y, a = list(map(int,i.split(\",\")))\n mas[y][x] += 1\n- for j in eval(\"n\"+str(a)):\n try:\n- mas[y+j[1]][x+j[0]] += 1\n except IndexError:\n continue\n- except:\n break\n print(len([i for x in mas for i in x if not i]))\n print(max([max(v) for v in mas]))\n", "added_lines": 6, "removed_lines": 5, "code1_lines": 18 }, { "user_id": "u193025715", "problem_id": "p00026", "submission1_id": "s692785629", "submission2_id": "s083529398", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\npaper = [0 for i in range(100)]\nwhite_points = None\ndeep_points = None\n\ndef small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n\ndef middle(x, y):\n p = small(x, y)\n for i, j in zip([1, -1] * 2, [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n\ndef big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n\nwhile True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n print(paper.count(0))\n print(max(paper))\n break\n\n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n if not 0 <= p[0] * 10 + p[1] <= 99: continue\n paper[p[0] * 10 + p[1]] += 1", "code2": "\n\npaper = [[0] * 10 for i in range(10)]\n\ndef small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n\ndef middle(x, y):\n p = small(x, y)\n for i, j in zip([1, -1, 1, -1], [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n\ndef big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n\nwhile True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n break\n\n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n if 0 <= p[0] < 10 and 0 <= p[1] < 10:\n paper[p[1]][p[0]] += 1\n\nprint(sum(paper[y][x] == 0 for y in range(10) for x in range(10)))\nprint(max(paper[y][x] for y in range(10) for x in range(10)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1408264141", "date2": "1408266164", "bleu_score": "0.8625303675865534", "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, 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], "code1_test_score": 98, "total_score": 101, "input": "1,5,2\n6,1,3\n1,4,3\n4,6,3\n3,7,3\n2,4,2\n", "actual_output": "55\n3\n", "expected_output": "56\n3\n\n", "anno_code": ["\n\npaper = [0 for i in range(100)] # (0): paper=[0, 0, ..., 0, 0]\nwhite_points = None # (1): white_points=None\ndeep_points = None # (2): deep_points=None\n\ndef small(x, y): # (3): small=\n p = [[x, y]] # (13): p (69): p ... (374): p\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]): # (14): i=-1, j=0 (16): i=0, j=-1 ... (383): NO CHANGE\n p.append([x + i, y + j]) # (15): p (17): p ... (382): p\n return p\n\ndef middle(x, y): # (4): middle=\n p = small(x, y) # (12): NO CHANGE (68): NO CHANGE ... (373): NO CHANGE\n for i, j in zip([1, -1] * 2, [1, 1, -1, -1]): # (23): i=1, j=1 (25): i=-1 ... (392): paper=[0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 1, 1, 2, 2, 2, 1, 0, 0, 0, 0, 0, 1, 2, 2, 3, 1, 1, 0, 0, 0, 0, 0, 1, 2, 2, 2, 1, 1, 0, 1, 0, 0, 1, 1, 2, 2, 2, 0, 1, 1, 1, 0, 0, 1, 1, 2, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 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], white_points=None, deep_points=None, small=, middle=, big=, size=2, bp, p=[3, 9]\n p.append([x + i, y + j]) # (24): p (26): p ... (391): p\n return p\n\ndef big(x, y): # (5): big=\n p = middle(x, y) # (67): NO CHANGE (144): NO CHANGE ... (297): NO CHANGE\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]): # (88): i=-2, j=0 (90): i=0, j=-2 ... (326): paper=[0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, 0, 1, 1, 2, 2, 2, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 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], white_points=None, deep_points=None, small=, middle=, big=, size=3, bp, p=[4, 8]\n p.append([x + i, y + j]) # (89): p (91): p ... (325): p\n return p\n\nwhile True: # (6): NO CHANGE (60): NO CHANGE ... (421): NO CHANGE\n try: # (7): NO CHANGE (61): NO CHANGE ... (422): NO CHANGE\n x, y, size = map(int, input().split(',')) # (8): x=1, y=5, size=2 (62): x=6, y=1, size=3 ... (423): NO CHANGE\n except: # (424): NO CHANGE\n print(paper.count(0)) # (425): NO CHANGE\n print(max(paper)) # (426): NO CHANGE\n break\n\n if size == 1: # (9): NO CHANGE (63): NO CHANGE ... (370): NO CHANGE\n bp = small(x, y)\n elif size == 2: # (10): NO CHANGE (64): NO CHANGE ... (371): NO CHANGE\n bp = middle(x, y) # (11): NO CHANGE (372): NO CHANGE\n elif size == 3: # (65): NO CHANGE (142): NO CHANGE ... (295): NO CHANGE\n bp = big(x, y) # (66): NO CHANGE (143): NO CHANGE ... (296): NO CHANGE\n for p in bp: # (32): p=[1, 5] (35): p=[0, 5] ... (420): NO CHANGE\n if not 0 <= p[0] * 10 + p[1] <= 99: continue # (33): NO CHANGE (36): NO CHANGE ... (418): NO CHANGE\n paper[p[0] * 10 + p[1]] += 1 # (34): paper=[0, 0, ..., 0, 0] (37): paper=[0, 0, ..., 0, 0] ... (419): paper=[0, 0, ..., 0, 0]\n"], "anno_status": [false], "diff_content": " \n \n-paper = [0 for i in range(100)]\n-white_points = None\n-deep_points = None\n+paper = [[0] * 10 for i in range(10)]\n \n def small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n \n def middle(x, y):\n p = small(x, y)\n- for i, j in zip([1, -1] * 2, [1, 1, -1, -1]):\n+ for i, j in zip([1, -1, 1, -1], [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n \n def big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n \n while True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n- print(paper.count(0))\n- print(max(paper))\n break\n \n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n- if not 0 <= p[0] * 10 + p[1] <= 99: continue\n- paper[p[0] * 10 + p[1]] += 1\n+ if 0 <= p[0] < 10 and 0 <= p[1] < 10:\n+ paper[p[1]][p[0]] += 1\n+\n+print(sum(paper[y][x] == 0 for y in range(10) for x in range(10)))\n+print(max(paper[y][x] for y in range(10) for x in range(10)))\n", "FL_content": " \n \n-paper = [0 for i in range(100)]\n-white_points = None\n-deep_points = None\n \n def small(x, y):\n p = [[x, y]]\n for i, j in zip([-1, 0, 1, 0], [0, -1, 0, 1]):\n p.append([x + i, y + j])\n return p\n \n def middle(x, y):\n p = small(x, y)\n- for i, j in zip([1, -1] * 2, [1, 1, -1, -1]):\n p.append([x + i, y + j])\n return p\n \n def big(x, y):\n p = middle(x, y)\n for i, j in zip([-2, 0, 2, 0], [0, -2, 0, 2]):\n p.append([x + i, y + j])\n return p\n \n while True:\n try:\n x, y, size = map(int, input().split(','))\n except:\n- print(paper.count(0))\n- print(max(paper))\n break\n \n if size == 1:\n bp = small(x, y)\n elif size == 2:\n bp = middle(x, y)\n elif size == 3:\n bp = big(x, y)\n for p in bp:\n- if not 0 <= p[0] * 10 + p[1] <= 99: continue\n- paper[p[0] * 10 + p[1]] += 1\n", "added_lines": 7, "removed_lines": 8, "code1_lines": 41 }, { "user_id": "u358919705", "problem_id": "p00026", "submission1_id": "s163690300", "submission2_id": "s115588064", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = [[0] * 14 for _ in range(14)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\nprint(sum(a[i][2:12].count(0) for i in range(2, 12)))\nprint(max(max(a[i]) for i in range(14)))\nprint(a)", "code2": "a = [[0] * 14 for _ in range(14)]\nwhile True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\nprint(sum(a[i][2:12].count(0) for i in range(2, 12)))\nprint(max(max(a[i][2:12]) for i in range(2, 12)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1471991542", "date2": "1471991749", "bleu_score": "0.9767485220815104", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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,5,3\n3,6,2\n2,4,3\n6,3,2\n2,7,3\n2,4,1\n", "actual_output": "63\n5\n[[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, 2, 1, 1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 2, 3, 2, 2, 2, 1, 0, 0, 0], [0, 0, 0, 0, 1, 2, 3, 5, 4, 2, 1, 1, 0, 0], [0, 0, 0, 0, 0, 1, 2, 3, 2, 2, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 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, 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, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]\n", "expected_output": "63\n5\n\n", "anno_code": ["a = [[0] * 14 for _ in range(14)] # (0): a\nwhile True: # (1): NO CHANGE (37): NO CHANGE ... (181): NO CHANGE\n try: # (2): NO CHANGE (38): NO CHANGE ... (182): NO CHANGE\n x, y, s = map(int, input().split(',')) # (3): x=1, y=5, s=3 (39): y=6, s=2 ... (183): NO CHANGE\n except: # (184): NO CHANGE\n break # (185): NO CHANGE\n x += 2 # (4): x=3 (40): x=5 ... (166): x=4\n y += 2 # (5): y=7 (41): y=8 ... (167): y=6\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]: # (6): d=(0, 0) (8): d=(0, -1) ... (178): NO CHANGE\n a[x + d[0]][y + d[1]] += 1 # (7): a (9): a ... (177): a\n if s >= 2: # (17): NO CHANGE (53): NO CHANGE ... (179): NO CHANGE\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]: # (18): d=(1, 1) (20): d=(1, -1) ... (152): NO CHANGE\n a[x + d[0]][y + d[1]] += 1 # (19): a (21): a ... (151): a\n if s == 3: # (27): NO CHANGE (63): NO CHANGE ... (180): NO CHANGE\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]: # (28): d=(0, 2) (30): d=(0, -2) ... (162): NO CHANGE\n a[x + d[0]][y + d[1]] += 1 # (29): a (31): a ... (161): a\nprint(sum(a[i][2:12].count(0) for i in range(2, 12))) # (186): NO CHANGE\nprint(max(max(a[i]) for i in range(14))) # (187): NO CHANGE\nprint(a)"], "anno_status": [false], "diff_content": " a = [[0] * 14 for _ in range(14)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\n print(sum(a[i][2:12].count(0) for i in range(2, 12)))\n-print(max(max(a[i]) for i in range(14)))\n-print(a)\n+print(max(max(a[i][2:12]) for i in range(2, 12)))\n", "FL_content": " a = [[0] * 14 for _ in range(14)]\n while True:\n try:\n x, y, s = map(int, input().split(','))\n except:\n break\n x += 2\n y += 2\n for d in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\n a[x + d[0]][y + d[1]] += 1\n if s >= 2:\n for d in [(1, 1), (1, -1), (-1, 1), (-1, -1)]:\n a[x + d[0]][y + d[1]] += 1\n if s == 3:\n for d in [(0, 2), (0, -2), (2, 0), (-2, 0)]:\n a[x + d[0]][y + d[1]] += 1\n print(sum(a[i][2:12].count(0) for i in range(2, 12)))\n-print(max(max(a[i]) for i in range(14)))\n-print(a)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u375500286", "problem_id": "p03625", "submission1_id": "s696635497", "submission2_id": "s023612074", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\na.sort(reverse=True)\nans=[]\nfor i in range(n-1):\n if a[i]==a[i+1]:\n ans.append(a[i])\n i=i+2\nif len(ans) >= 2:\n print(ans[0]*ans[1]) \nelse:\n print(0)\n", "code2": "n = int(input())\na = list(map(int,input().split()))\na.sort(reverse=True)\nans=[]\ni=0\nwhile i= 2:\n print(ans[0]*ans[1]) \nelse:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563737087", "date2": "1563737615", "bleu_score": "0.8898482840289076", "code1_test_status": [0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 79, "total_score": 101, "input": "10\n3 3 6 3 4 4 1 5 5 5\n", "actual_output": "25\n", "expected_output": "20\n\n", "anno_code": ["n = int(input()) # (0): n=10\na = list(map(int,input().split())) # (1): a=[3, 3, 6, 3, 4, 4, 1, 5, 5, 5]\na.sort(reverse=True) # (2): a=[6, 5, 5, 5, 4, 4, 3, 3, 3, 1]\nans=[] # (3): ans=[]\nfor i in range(n-1): # (4): i=0 (6): i=1 ... (32): NO CHANGE\n if a[i]==a[i+1]: # (5): NO CHANGE (7): NO CHANGE ... (31): NO CHANGE\n ans.append(a[i]) # (8): ans=[5] (12): ans=[5, 5] ... (28): ans=[5, 5, 4, 3, 3]\n i=i+2 # (9): i=3 (13): i=4 ... (29): i=9\nif len(ans) >= 2: # (33): NO CHANGE\n print(ans[0]*ans[1]) \nelse:\n print(0)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n a.sort(reverse=True)\n ans=[]\n-for i in range(n-1):\n+i=0\n+while i= 2:\n print(ans[0]*ans[1]) \n else:\n print(0)\n-\n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n a.sort(reverse=True)\n ans=[]\n-for i in range(n-1):\n if a[i]==a[i+1]:\n ans.append(a[i])\n- i=i+2\n if len(ans) >= 2:\n print(ans[0]*ans[1]) \n else:\n print(0)\n-\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u681444474", "problem_id": "p03625", "submission1_id": "s923626047", "submission2_id": "s944509814", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN=int(input())\nA=list(map(int,input().split()))\nA.sort(reverse=True)\ncnt=1\nans=[]\nfor i in range(N-1):\n \n if A[i]==A[i+1]:\n cnt+=1\n elif cnt>=2:\n ans.append(A[i-1])\n cnt=1\n if len(ans)==2:\n break\n\nif len(ans)<=1:\n print(0)\nelse:\n print(ans[0]*ans[1])", "code2": "\nN=int(input())\nA=list(map(int,input().split()))\nA.sort(reverse=True)\nans=[]\nl=0\nwhile l=2: # (7): NO CHANGE (10): NO CHANGE ... (34): NO CHANGE\n ans.append(A[i-1]) # (26): ans=[2]\n cnt=1 # (27): cnt=1\n if len(ans)==2: # (28): NO CHANGE\n break\n\nif len(ans)<=1: # (36): NO CHANGE\n print(0)\nelse:\n print(ans[0]*ans[1])"], "anno_status": [true], "diff_content": " \n N=int(input())\n A=list(map(int,input().split()))\n A.sort(reverse=True)\n-cnt=1\n ans=[]\n-for i in range(N-1):\n+l=0\n+while l=2:\n- ans.append(A[i-1])\n- cnt=1\n+ if A[l]==A[l+1]:\n+ ans.append(A[l])\n if len(ans)==2:\n break\n+ else:\n+ l+=2\n+ else:\n+ l+=1\n \n if len(ans)<=1:\n print(0)\n else:\n print(ans[0]*ans[1])\n", "FL_content": " \n N=int(input())\n A=list(map(int,input().split()))\n A.sort(reverse=True)\n-cnt=1\n ans=[]\n-for i in range(N-1):\n \n- if A[i]==A[i+1]:\n- cnt+=1\n- elif cnt>=2:\n- ans.append(A[i-1])\n- cnt=1\n if len(ans)==2:\n break\n \n if len(ans)<=1:\n print(0)\n else:\n print(ans[0]*ans[1])\n", "added_lines": 8, "removed_lines": 7, "code1_lines": 20 }, { "user_id": "u835283937", "problem_id": "p03625", "submission1_id": "s584911385", "submission2_id": "s499199673", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\ndef main():\n N = int(input())\n A = [int(a) for a in input().split()]\n\n edge = defaultdict(int)\n\n for i in range(N):\n edge[A[i]] += 1\n edge = [ [k, v] for k, v in edge.items() if v >= 2 ]\n print(edge)\n edge.sort(key = lambda x : x[0])\n print(edge)\n\n if len(edge) >= 2 :\n print(edge[-1][0]*edge[-2][0])\n\n elif len(edge) == 1:\n if edge[-1][1] >= 4:\n print(edge[-1][0]**2)\n else:\n print(0)\n else:\n print(0)\n\nif __name__ == \"__main__\":\n main()", "code2": "from collections import defaultdict\ndef main():\n N = int(input())\n A = [int(a) for a in input().split()]\n\n edge = defaultdict(int)\n\n for i in range(N):\n edge[A[i]] += 1\n\n edge = [ [k, v] for k, v in edge.items() if v >= 2 ]\n edge.sort(key = lambda x : x[0])\n\n if len(edge) >= 2 :\n if edge[-1][1] >= 4:\n print(max(edge[-1][0]**2, edge[-1][0]*edge[-2][0]))\n else:\n print(edge[-1][0]*edge[-2][0])\n \n elif len(edge) == 1:\n if edge[-1][1] >= 4:\n print(edge[-1][0]**2)\n else:\n print(0)\n else:\n print(0)\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588187372", "date2": "1588188259", "bleu_score": "0.8465278246610898", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 -1 5 0 11\n", "actual_output": "[[0, 2], [-1, 2]]\n[[-1, 2], [0, 2]]\n0\n", "expected_output": "0\n\n", "anno_code": ["from collections import defaultdict\ndef main(): # (0): main=\n N = int(input())\n A = [int(a) for a in input().split()]\n\n edge = defaultdict(int)\n\n for i in range(N):\n edge[A[i]] += 1\n edge = [ [k, v] for k, v in edge.items() if v >= 2 ]\n print(edge)\n edge.sort(key = lambda x : x[0])\n print(edge)\n\n if len(edge) >= 2 :\n print(edge[-1][0]*edge[-2][0])\n\n elif len(edge) == 1:\n if edge[-1][1] >= 4:\n print(edge[-1][0]**2)\n else:\n print(0)\n else:\n print(0)\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " from collections import defaultdict\n def main():\n N = int(input())\n A = [int(a) for a in input().split()]\n \n edge = defaultdict(int)\n \n for i in range(N):\n edge[A[i]] += 1\n+\n edge = [ [k, v] for k, v in edge.items() if v >= 2 ]\n- print(edge)\n edge.sort(key = lambda x : x[0])\n- print(edge)\n \n if len(edge) >= 2 :\n- print(edge[-1][0]*edge[-2][0])\n-\n+ if edge[-1][1] >= 4:\n+ print(max(edge[-1][0]**2, edge[-1][0]*edge[-2][0]))\n+ else:\n+ print(edge[-1][0]*edge[-2][0])\n+ \n elif len(edge) == 1:\n if edge[-1][1] >= 4:\n print(edge[-1][0]**2)\n else:\n print(0)\n else:\n print(0)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " from collections import defaultdict\n def main():\n N = int(input())\n A = [int(a) for a in input().split()]\n \n edge = defaultdict(int)\n \n for i in range(N):\n edge[A[i]] += 1\n edge = [ [k, v] for k, v in edge.items() if v >= 2 ]\n- print(edge)\n edge.sort(key = lambda x : x[0])\n- print(edge)\n \n if len(edge) >= 2 :\n- print(edge[-1][0]*edge[-2][0])\n-\n elif len(edge) == 1:\n if edge[-1][1] >= 4:\n print(edge[-1][0]**2)\n else:\n print(0)\n else:\n print(0)\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 6, "removed_lines": 4, "code1_lines": 27 }, { "user_id": "u993642190", "problem_id": "p03625", "submission1_id": "s175217567", "submission2_id": "s284634568", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections as cl\n\nN = int(input())\nsticks = [int(i) for i in input().split()]\n\nsticks.sort(reverse=True)\n\nw = 0\nh = 0\n\nfor k,v in sorted(cl.Counter(sticks).items(), key=lambda x: x[0], reverse=True):\n if (v < 2) :\n continue\n \n if (v >= 4) :\n \n w = k\n h = k\n break\n \n if (v >= 2) :\n if (w == 0) :\n w = k\n else :\n h = k\n break\n\n\nprint(w*h)", "code2": "import collections as cl\n\nN = int(input())\nsticks = [int(i) for i in input().split()]\n\nsticks.sort(reverse=True)\n\nw = 0\nh = 0\n\nfor k,v in sorted(cl.Counter(sticks).items(), key=lambda x: x[0], reverse=True):\n if (v < 2) :\n continue\n \n if (v >= 4) :\n \n if (w == 0) :\n w = k\n h = k\n else :\n h = k\n break\n \n if (v >= 2) :\n if (w == 0) :\n w = k\n else :\n h = k\n break\n\n\nprint(w*h)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548276893", "date2": "1548277040", "bleu_score": "0.8748752078404824", "code1_test_status": [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, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n-2 2 1 1 4 2 1 41 -1 1\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["import collections as cl\n\nN = int(input()) # (0): N=10\nsticks = [int(i) for i in input().split()] # (1): sticks=[-2, 2, 1, 1, 4, 2, 1, 41, -1, 1]\n\nsticks.sort(reverse=True) # (2): sticks=[41, 4, 2, 2, 1, 1, 1, 1, -1, -2]\n\nw = 0 # (3): w=0\nh = 0 # (4): h=0\n\nfor k,v in sorted(cl.Counter(sticks).items(), key=lambda x: x[0], reverse=True): # (5): k=41, v=1 (8): k=4 ... (17): k=1, v=4\n if (v < 2) : # (6): NO CHANGE (9): NO CHANGE ... (18): NO CHANGE\n continue # (7): NO CHANGE (10): NO CHANGE\n \n if (v >= 4) : # (13): NO CHANGE (19): NO CHANGE\n \n w = k # (20): w=1\n h = k # (21): h=1\n break # (22): NO CHANGE\n \n if (v >= 2) : # (14): NO CHANGE\n if (w == 0) : # (15): NO CHANGE\n w = k # (16): w=2\n else :\n h = k\n break\n\n\nprint(w*h)"], "anno_status": [true], "diff_content": " import collections as cl\n \n N = int(input())\n sticks = [int(i) for i in input().split()]\n \n sticks.sort(reverse=True)\n \n w = 0\n h = 0\n \n for k,v in sorted(cl.Counter(sticks).items(), key=lambda x: x[0], reverse=True):\n if (v < 2) :\n continue\n \n if (v >= 4) :\n \n- w = k\n- h = k\n+ if (w == 0) :\n+ w = k\n+ h = k\n+ else :\n+ h = k\n break\n \n if (v >= 2) :\n if (w == 0) :\n w = k\n else :\n h = k\n break\n \n \n print(w*h)\n", "FL_content": " import collections as cl\n \n N = int(input())\n sticks = [int(i) for i in input().split()]\n \n sticks.sort(reverse=True)\n \n w = 0\n h = 0\n \n for k,v in sorted(cl.Counter(sticks).items(), key=lambda x: x[0], reverse=True):\n if (v < 2) :\n continue\n \n if (v >= 4) :\n \n- w = k\n- h = k\n break\n \n if (v >= 2) :\n if (w == 0) :\n w = k\n else :\n h = k\n break\n \n \n print(w*h)\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u353797797", "problem_id": "p03625", "submission1_id": "s797592306", "submission2_id": "s431666523", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nimport sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\np2D = lambda x: print(*x, sep=\"\\n\")\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\n\ndef main():\n n=int(input())\n aa=LI()\n cnt=Counter(aa)\n mx=-1\n for a,an in sorted(cnt.items(),reverse=True):\n if an>3 and mx==-1:\n print(a*a)\n elif an>1:\n if mx==-1:mx=a\n else:\n print(mx*a)\n break\n else:\n print(0)\n\n\n\nmain()", "code2": "from collections import Counter\nimport sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\np2D = lambda x: print(*x, sep=\"\\n\")\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\n\ndef main():\n n=int(input())\n aa=LI()\n cnt=Counter(aa)\n mx=-1\n for a,an in sorted(cnt.items(),reverse=True):\n if an>3 and mx==-1:\n print(a*a)\n break\n elif an>1:\n if mx==-1:mx=a\n else:\n print(mx*a)\n break\n else:\n print(0)\n\n\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575692127", "date2": "1575692255", "bleu_score": "0.9728301102190094", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n-1 1 1 3 1 2 4 15 1 0\n", "actual_output": "1\n0\n", "expected_output": "1\n\n", "anno_code": ["from collections import Counter\nimport sys\n\nsys.setrecursionlimit(10 ** 6) # (0): NO CHANGE\nint1 = lambda x: int(x) - 1 # (1): int1= at 0x0000016382BB9BD0>\np2D = lambda x: print(*x, sep=\"\\n\") # (2): p2D= at 0x0000016382BB9B40>, MI=, LI=, LLI=\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\n\ndef main(): # (3): main=\n n=int(input()) # (5): n=10\n aa=LI() # (6): aa=[-1, 1, 1, 3, 1, 2, 4, 15, 1, 0]\n cnt=Counter(aa) # (7): cnt=Counter({1: 4, -1: 1, 3: 1, 2: 1, 4: 1, 15: 1, 0: 1})\n mx=-1 # (8): mx=-1\n for a,an in sorted(cnt.items(),reverse=True): # (9): a=15, an=1 (12): a=4 ... (30): NO CHANGE\n if an>3 and mx==-1: # (10): NO CHANGE (13): NO CHANGE ... (28): NO CHANGE\n print(a*a) # (23): NO CHANGE\n elif an>1: # (11): NO CHANGE (14): NO CHANGE ... (29): NO CHANGE\n if mx==-1:mx=a\n else:\n print(mx*a)\n break\n else:\n print(0)\n\n\n\nmain() # (4): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import Counter\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 MI(): return map(int, sys.stdin.readline().split())\n def LI(): return list(map(int, sys.stdin.readline().split()))\n def LLI(rows_number): return [LI() for _ in range(rows_number)]\n \n def main():\n n=int(input())\n aa=LI()\n cnt=Counter(aa)\n mx=-1\n for a,an in sorted(cnt.items(),reverse=True):\n if an>3 and mx==-1:\n print(a*a)\n+ break\n elif an>1:\n if mx==-1:mx=a\n else:\n print(mx*a)\n break\n else:\n print(0)\n \n \n \n main()\n", "FL_content": " from collections import Counter\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 MI(): return map(int, sys.stdin.readline().split())\n def LI(): return list(map(int, sys.stdin.readline().split()))\n def LLI(rows_number): return [LI() for _ in range(rows_number)]\n \n def main():\n n=int(input())\n aa=LI()\n cnt=Counter(aa)\n mx=-1\n for a,an in sorted(cnt.items(),reverse=True):\n if an>3 and mx==-1:\n print(a*a)\n elif an>1:\n if mx==-1:mx=a\n else:\n print(mx*a)\n break\n else:\n print(0)\n \n \n \n main()\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u415905784", "problem_id": "p03625", "submission1_id": "s683036892", "submission2_id": "s049309471", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(x) for x in input().split()]\nA.sort(reverse=True)\npre = 0\ne1, e2 = 0, 0\nfor a in A:\n if pre == a:\n if e1 == 0:\n e1 = a\n elif e2 == 0:\n e2 == a\n pre = 0\n else:\n pre = a\nprint(e1 * e2)", "code2": "N = int(input())\nA = [int(x) for x in input().split()]\nA.sort(reverse=True)\npre = 0\ne1, e2 = 0, 0\nfor a in A:\n if pre == a:\n if e1 == 0:\n e1 = a\n elif e2 == 0:\n e2 = a\n pre = 0\n else:\n pre = a\nprint(e1 * e2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536036824", "date2": "1536036907", "bleu_score": "0.9924032469048959", "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, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 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], "code1_test_score": 38, "total_score": 101, "input": "10\n0 2 1 2 4 2 4 15 0 0\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["N = int(input()) # (0): N=10\nA = [int(x) for x in input().split()] # (1): A=[0, 2, 1, 2, 4, 2, 4, 15, 0, 0]\nA.sort(reverse=True) # (2): A=[15, 4, 4, 2, 2, 2, 1, 0, 0, 0]\npre = 0 # (3): pre=0\ne1, e2 = 0, 0 # (4): e1=0, e2=0\nfor a in A: # (5): a=15 (8): a=4 ... (46): NO CHANGE\n if pre == a: # (6): NO CHANGE (9): NO CHANGE ... (41): NO CHANGE\n if e1 == 0: # (13): NO CHANGE (21): NO CHANGE ... (42): NO CHANGE\n e1 = a # (14): e1=4\n elif e2 == 0: # (22): NO CHANGE (37): NO CHANGE (43): NO CHANGE\n e2 == a # (23): NO CHANGE (38): NO CHANGE (44): NO CHANGE\n pre = 0 # (15): pre=0 (24): pre=0 ... (45): NO CHANGE\n else:\n pre = a # (7): pre=15 (10): pre=4 ... (33): pre=0\nprint(e1 * e2)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(x) for x in input().split()]\n A.sort(reverse=True)\n pre = 0\n e1, e2 = 0, 0\n for a in A:\n if pre == a:\n if e1 == 0:\n e1 = a\n elif e2 == 0:\n- e2 == a\n+ e2 = a\n pre = 0\n else:\n pre = a\n print(e1 * e2)\n", "FL_content": " N = int(input())\n A = [int(x) for x in input().split()]\n A.sort(reverse=True)\n pre = 0\n e1, e2 = 0, 0\n for a in A:\n if pre == a:\n if e1 == 0:\n e1 = a\n elif e2 == 0:\n- e2 == a\n pre = 0\n else:\n pre = a\n print(e1 * e2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u370721525", "problem_id": "p03625", "submission1_id": "s597083599", "submission2_id": "s791180578", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nS = sorted(A, reverse=True)\nw, h = 0, 0\n\ncnt = 0\ntmp = 0\nl = S[0]\nfor i in range(N):\n if S[i] != l:\n if cnt == 0:\n if tmp > 3:\n w, h = l, l\n break\n elif tmp > 1:\n w = l\n tmp = 1\n l = S[i]\n cnt += 1\n else:\n tmp = 1\n l = S[i]\n else:\n h = l\n break\n else:\n tmp += 1\n if i == N-1:\n h = l\nans = w * h\nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\nS = sorted(A, reverse=True)\nw, h = 0, 0\n\ncnt = 0\ntmp = S[0]\nfor i in range(N):\n if S[i] == tmp:\n cnt += 1\n if cnt == 2:\n if w == 0:\n w = tmp\n cnt = 0\n else:\n h = tmp\n break\n else:\n cnt = 1\n tmp = S[i]\n \nans = w * h\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594469386", "date2": "1594470185", "bleu_score": "0.6484500011960984", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 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, 0, 0, 1, 1], "code1_test_score": 64, "total_score": 101, "input": "10\n0 2 12 7 5 1 0 9 3 2\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["N = int(input()) # (0): N=10\nA = list(map(int, input().split())) # (1): A=[0, 2, 12, 7, 5, 1, 0, 9, 3, 2]\nS = sorted(A, reverse=True) # (2): S=[12, 9, 7, 5, 3, 2, 2, 1, 0, 0]\nw, h = 0, 0 # (3): w=0, h=0\n\ncnt = 0 # (4): cnt=0\ntmp = 0 # (5): tmp=0\nl = S[0] # (6): l=12\nfor i in range(N): # (7): i=0 (11): i=1 ... (59): i=8\n if S[i] != l: # (8): NO CHANGE (12): NO CHANGE ... (60): NO CHANGE\n if cnt == 0: # (13): NO CHANGE (20): NO CHANGE ... (61): NO CHANGE\n if tmp > 3: # (14): NO CHANGE (21): NO CHANGE ... (53): NO CHANGE\n w, h = l, l\n break\n elif tmp > 1: # (15): NO CHANGE (22): NO CHANGE ... (54): NO CHANGE\n w = l # (55): w=2\n tmp = 1 # (56): tmp=1\n l = S[i] # (57): l=1\n cnt += 1 # (58): cnt=1\n else:\n tmp = 1 # (16): NO CHANGE (23): NO CHANGE ... (44): NO CHANGE\n l = S[i] # (17): l=9 (24): l=7 ... (45): l=2\n else:\n h = l # (62): h=1\n break # (63): NO CHANGE\n else:\n tmp += 1 # (9): tmp=1 (48): tmp=2\n if i == N-1: # (10): NO CHANGE (49): NO CHANGE\n h = l\nans = w * h # (64): ans=2\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n S = sorted(A, reverse=True)\n w, h = 0, 0\n \n cnt = 0\n-tmp = 0\n-l = S[0]\n+tmp = S[0]\n for i in range(N):\n- if S[i] != l:\n- if cnt == 0:\n- if tmp > 3:\n- w, h = l, l\n- break\n- elif tmp > 1:\n- w = l\n- tmp = 1\n- l = S[i]\n- cnt += 1\n+ if S[i] == tmp:\n+ cnt += 1\n+ if cnt == 2:\n+ if w == 0:\n+ w = tmp\n+ cnt = 0\n else:\n- tmp = 1\n- l = S[i]\n- else:\n- h = l\n- break\n+ h = tmp\n+ break\n else:\n- tmp += 1\n- if i == N-1:\n- h = l\n+ cnt = 1\n+ tmp = S[i]\n+ \n ans = w * h\n print(ans)\n \n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n S = sorted(A, reverse=True)\n w, h = 0, 0\n \n cnt = 0\n-tmp = 0\n-l = S[0]\n for i in range(N):\n- if S[i] != l:\n- if cnt == 0:\n- if tmp > 3:\n- w, h = l, l\n- break\n- elif tmp > 1:\n- w = l\n- tmp = 1\n- l = S[i]\n- cnt += 1\n else:\n- tmp = 1\n- l = S[i]\n- else:\n- h = l\n- break\n else:\n- tmp += 1\n- if i == N-1:\n- h = l\n ans = w * h\n print(ans)\n \n", "added_lines": 12, "removed_lines": 20, "code1_lines": 32 }, { "user_id": "u619819312", "problem_id": "p03625", "submission1_id": "s215373055", "submission2_id": "s645651369", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nn=int(input())\na=list(map(int,input().split()))\np=Counter(a)\nc=0\nd=0\nfor a,b in p.items():\n if b>3:\n if c1:\n if c==0:\n c=a\n else:\n if d>c:\n c=a\n else:\n d=a\nprint(c*d)", "code2": "from collections import Counter\nn=int(input())\na=list(map(int,input().split()))\np=Counter(a)\nc=0\nd=0\nfor a,b in p.items():\n if b>3:\n if c1:\n if c==0:\n c=a\n else:\n if d>c and c3: # (6): NO CHANGE (12): NO CHANGE ... (24): NO CHANGE\n if c1: # (13): NO CHANGE (16): NO CHANGE ... (25): NO CHANGE\n if c==0: # (20): NO CHANGE\n c=a\n else:\n if d>c: # (21): NO CHANGE\n c=a\n else:\n d=a # (22): d=2\nprint(c*d)"], "anno_status": [true], "diff_content": " from collections import Counter\n n=int(input())\n a=list(map(int,input().split()))\n p=Counter(a)\n c=0\n d=0\n for a,b in p.items():\n if b>3:\n if c1:\n if c==0:\n c=a\n else:\n- if d>c:\n+ if d>c and c3:\n if c1:\n if c==0:\n c=a\n else:\n- if d>c:\n c=a\n- else:\n d=a\n print(c*d)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 21 }, { "user_id": "u647999897", "problem_id": "p03625", "submission1_id": "s758070047", "submission2_id": "s573199973", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\ndef solve():\n N = int(input())\n A = list(map(int, input().split()))\n cnter = Counter(A)\n cnter_list = list(cnter.items())\n cnter_list.sort(key=lambda x:x[0], reverse=True)\n\n double_cnt = 0\n ans = 1\n for elem in cnter_list:\n if elem[1] >= 2:\n double_cnt += 1\n ans *= elem[0]\n if double_cnt >= 2:\n break\n else:\n print(0)\n return\n \n print(ans)\n\nif __name__ == '__main__':\n solve()", "code2": "from collections import Counter\ndef solve():\n N = int(input())\n A = list(map(int, input().split()))\n cnter = Counter(A)\n cnter_list = list(cnter.items())\n cnter_list.sort(key=lambda x:x[0], reverse=True)\n\n double_cnt = 0\n ans = 1\n for elem in cnter_list:\n if elem[1] >= 4:\n if double_cnt == 0:\n ans = elem[0] * elem[0]\n break\n\n if elem[1] >= 2:\n double_cnt += 1\n ans *= elem[0]\n if double_cnt >= 2:\n break\n else:\n print(0)\n return\n \n print(ans)\n\nif __name__ == '__main__':\n solve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585275440", "date2": "1585275797", "bleu_score": "0.8078455878943859", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n-1 1 1 3 1 2 4 15 1 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["from collections import Counter\ndef solve(): # (0): solve=\n N = int(input())\n A = list(map(int, input().split()))\n cnter = Counter(A)\n cnter_list = list(cnter.items())\n cnter_list.sort(key=lambda x:x[0], reverse=True)\n\n double_cnt = 0\n ans = 1\n for elem in cnter_list:\n if elem[1] >= 2:\n double_cnt += 1\n ans *= elem[0]\n if double_cnt >= 2:\n break\n else:\n print(0)\n return\n \n print(ans)\n\nif __name__ == '__main__':\n solve()"], "anno_status": [true], "diff_content": " from collections import Counter\n def solve():\n N = int(input())\n A = list(map(int, input().split()))\n cnter = Counter(A)\n cnter_list = list(cnter.items())\n cnter_list.sort(key=lambda x:x[0], reverse=True)\n \n double_cnt = 0\n ans = 1\n for elem in cnter_list:\n+ if elem[1] >= 4:\n+ if double_cnt == 0:\n+ ans = elem[0] * elem[0]\n+ break\n+\n if elem[1] >= 2:\n double_cnt += 1\n ans *= elem[0]\n if double_cnt >= 2:\n break\n else:\n print(0)\n return\n \n print(ans)\n \n if __name__ == '__main__':\n solve()\n", "FL_content": " from collections import Counter\n def solve():\n N = int(input())\n A = list(map(int, input().split()))\n cnter = Counter(A)\n cnter_list = list(cnter.items())\n cnter_list.sort(key=lambda x:x[0], reverse=True)\n \n double_cnt = 0\n ans = 1\n for elem in cnter_list:\n if elem[1] >= 2:\n double_cnt += 1\n ans *= elem[0]\n if double_cnt >= 2:\n break\n else:\n print(0)\n return\n \n print(ans)\n \n if __name__ == '__main__':\n solve()\n", "added_lines": 5, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u059210959", "problem_id": "p03625", "submission1_id": "s611443599", "submission2_id": "s462920234", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport copy\nimport random\nimport bisect \nimport math\n\n\nN = int(input())\nA = [int(i) for i in input().split()]\n\nA.sort()\nlen_dic = {}\nfor a in A:\n if a in len_dic.keys():\n len_dic[a] += 1\n\n else:\n len_dic[a] = 1\n\nans = [0,0]\nfor k, v in sorted(len_dic.items(),key=lambda x:-x[0]):\n if v >= 4 and ans[0] == 0:\n ans = [k,k]\n elif v >= 2:\n if ans[0]==0:\n ans[0] = k\n elif ans[1] == 0:\n ans[1] = k\n else:\n break\n\nprint(ans[0]*ans[1])\n", "code2": "\nimport copy\nimport random\nimport bisect \nimport math\n\n\nN = int(input())\nA = [int(i) for i in input().split()]\n\nA.sort()\nlen_dic = {}\nfor a in A:\n if a in len_dic.keys():\n len_dic[a] += 1\n\n else:\n len_dic[a] = 1\n\nans = [0,0]\nfor k, v in sorted(len_dic.items(),key=lambda x:-x[0]):\n if v >= 4 and ans[0] == 0:\n ans = [k,k]\n elif v >= 2:\n if ans[0]==0:\n ans[0] = k\n elif ans[1] == 0:\n ans[1] = k\n\nprint(ans[0]*ans[1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555867631", "date2": "1555867747", "bleu_score": "0.9512258601854041", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 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, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0], "code1_test_score": 51, "total_score": 101, "input": "10\n0 2 1 2 4 2 4 15 0 0\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["\nimport copy\nimport random\nimport bisect \nimport math\n\n\nN = int(input()) # (0): N=10\nA = [int(i) for i in input().split()] # (1): A=[0, 2, 1, 2, 4, 2, 4, 15, 0, 0]\n\nA.sort() # (2): A=[0, 0, 0, 1, 2, 2, 2, 4, 4, 15]\nlen_dic = {} # (3): len_dic={}\nfor a in A: # (4): a=0 (7): NO CHANGE ... (34): NO CHANGE\n if a in len_dic.keys(): # (5): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n len_dic[a] += 1 # (9): len_dic={0: 2} (12): len_dic={0: 3} ... (30): len_dic={0: 3, 1: 1, 2: 3, 4: 2}\n\n else:\n len_dic[a] = 1 # (6): len_dic={0: 1} (15): len_dic={0: 3, 1: 1} ... (33): len_dic={0: 3, 1: 1, 2: 3, 4: 2, 15: 1}\n\nans = [0,0] # (35): ans=[0, 0]\nfor k, v in sorted(len_dic.items(),key=lambda x:-x[0]): # (36): k=15, v=1\n if v >= 4 and ans[0] == 0: # (37): NO CHANGE\n ans = [k,k]\n elif v >= 2: # (38): NO CHANGE\n if ans[0]==0:\n ans[0] = k\n elif ans[1] == 0:\n ans[1] = k\n else:\n break # (39): NO CHANGE\n\nprint(ans[0]*ans[1])\n"], "anno_status": [true], "diff_content": " \n import copy\n import random\n import bisect \n import math\n \n \n N = int(input())\n A = [int(i) for i in input().split()]\n \n A.sort()\n len_dic = {}\n for a in A:\n if a in len_dic.keys():\n len_dic[a] += 1\n \n else:\n len_dic[a] = 1\n \n ans = [0,0]\n for k, v in sorted(len_dic.items(),key=lambda x:-x[0]):\n if v >= 4 and ans[0] == 0:\n ans = [k,k]\n elif v >= 2:\n if ans[0]==0:\n ans[0] = k\n elif ans[1] == 0:\n ans[1] = k\n- else:\n- break\n \n print(ans[0]*ans[1])\n \n", "FL_content": " \n import copy\n import random\n import bisect \n import math\n \n \n N = int(input())\n A = [int(i) for i in input().split()]\n \n A.sort()\n len_dic = {}\n for a in A:\n if a in len_dic.keys():\n len_dic[a] += 1\n \n else:\n len_dic[a] = 1\n \n ans = [0,0]\n for k, v in sorted(len_dic.items(),key=lambda x:-x[0]):\n if v >= 4 and ans[0] == 0:\n ans = [k,k]\n elif v >= 2:\n if ans[0]==0:\n ans[0] = k\n elif ans[1] == 0:\n ans[1] = k\n- else:\n- break\n \n print(ans[0]*ans[1])\n \n", "added_lines": 0, "removed_lines": 2, "code1_lines": 33 }, { "user_id": "u470542271", "problem_id": "p03625", "submission1_id": "s076698114", "submission2_id": "s291329589", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\ntmp = []\nfrom collections import Counter\nc = Counter(a)\nfor k in c.keys():\n if c[k] >= 2:\n tmp.append(k)\n\ntmp.sort()\nif len(tmp) >= 2:\n print(tmp[-1] * tmp[-2])\nelse:\n print(0)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n\ntmp = []\nfrom collections import Counter\nc = Counter(a)\nfor k in c.keys():\n if c[k] >= 2:\n tmp.append(k)\n if c[k] >= 4:\n tmp.append(k)\n\ntmp.sort()\n\nif len(tmp) >= 2:\n print(tmp[-1] * tmp[-2])\nelse:\n print(0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575008052", "date2": "1575008171", "bleu_score": "0.8542559133467847", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n-1 1 1 3 1 2 4 15 1 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=10\na = list(map(int, input().split())) # (1): a=[-1, 1, 1, 3, 1, 2, 4, 15, 1, 0]\n\ntmp = [] # (2): tmp=[], Counter=\nfrom collections import Counter\nc = Counter(a) # (3): c=Counter({1: 4, -1: 1, 3: 1, 2: 1, 4: 1, 15: 1, 0: 1})\nfor k in c.keys(): # (4): k=-1 (6): k=1 ... (19): NO CHANGE\n if c[k] >= 2: # (5): NO CHANGE (7): NO CHANGE ... (18): NO CHANGE\n tmp.append(k) # (8): tmp=[1]\n\ntmp.sort() # (20): NO CHANGE\nif len(tmp) >= 2: # (21): NO CHANGE\n print(tmp[-1] * tmp[-2])\nelse:\n print(0)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n tmp = []\n from collections import Counter\n c = Counter(a)\n for k in c.keys():\n if c[k] >= 2:\n tmp.append(k)\n+ if c[k] >= 4:\n+ tmp.append(k)\n \n tmp.sort()\n+\n if len(tmp) >= 2:\n print(tmp[-1] * tmp[-2])\n else:\n print(0)\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n \n tmp = []\n from collections import Counter\n c = Counter(a)\n for k in c.keys():\n if c[k] >= 2:\n tmp.append(k)\n \n tmp.sort()\n if len(tmp) >= 2:\n print(tmp[-1] * tmp[-2])\n else:\n print(0)\n \n", "added_lines": 3, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u017415492", "problem_id": "p03625", "submission1_id": "s993952455", "submission2_id": "s756485108", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nn=int(input())\na=list(map(int,input().split()))\nx1=0\nx2=0\ncount=Counter(a)\nfor i in count:\n if count[i]>=2:\n if x1<=i:\n x2=x1\n x1=i\n if x1>i and x2<=i:\n x2=i\nprint(x1*x2)\n ", "code2": "from collections import Counter\nn=int(input())\na=list(map(int,input().split()))\nx1=0\nx2=0\ncount=Counter(a)\nfor i in count:\n if count[i]>=4:\n if x1<=i:\n x2=i\n x1=i\n if count[i]>=2:\n if x1<=i:\n x2=x1\n x1=i\n elif x2 <= i < x1:\n x2=i\nprint(x1*x2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588908242", "date2": "1588908634", "bleu_score": "0.7890431939459742", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n3 3 6 3 4 3 2 2 5 3\n", "actual_output": "6\n", "expected_output": "9\n\n", "anno_code": ["from collections import Counter\nn=int(input()) # (0): n=10\na=list(map(int,input().split())) # (1): a=[3, 3, 6, 3, 4, 3, 2, 2, 5, 3]\nx1=0 # (2): x1=0\nx2=0 # (3): x2=0\ncount=Counter(a) # (4): count=Counter({3: 5, 2: 2, 6: 1, 4: 1, 5: 1})\nfor i in count: # (5): i=3 (11): i=6 ... (22): NO CHANGE\n if count[i]>=2: # (6): NO CHANGE (12): NO CHANGE ... (21): NO CHANGE\n if x1<=i: # (7): NO CHANGE (17): NO CHANGE\n x2=x1 # (8): NO CHANGE\n x1=i # (9): x1=3\n if x1>i and x2<=i: # (10): NO CHANGE (18): NO CHANGE\n x2=i # (19): x2=2\nprint(x1*x2)\n "], "anno_status": [true], "diff_content": " from collections import Counter\n n=int(input())\n a=list(map(int,input().split()))\n x1=0\n x2=0\n count=Counter(a)\n for i in count:\n+ if count[i]>=4:\n+ if x1<=i:\n+ x2=i\n+ x1=i\n if count[i]>=2:\n if x1<=i:\n x2=x1\n x1=i\n- if x1>i and x2<=i:\n+ elif x2 <= i < x1:\n x2=i\n print(x1*x2)\n- \n", "FL_content": " from collections import Counter\n n=int(input())\n a=list(map(int,input().split()))\n x1=0\n x2=0\n count=Counter(a)\n for i in count:\n if count[i]>=2:\n if x1<=i:\n x2=x1\n x1=i\n- if x1>i and x2<=i:\n x2=i\n print(x1*x2)\n- \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u427344224", "problem_id": "p03625", "submission1_id": "s817431784", "submission2_id": "s954054032", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nN = int(input())\nA_list = list(map(int, input().split()))\ncounter = Counter(A_list)\ncounter = sorted(counter.items(), key=lambda x: -x[0])\n\nlong_side = 0\nshort_side = 0\nchoice = 0\n\nfor k, v in counter:\n if v % 4 == 0 and choice == 0:\n long_side = k\n short_side = k\n choice = 4\n\n elif v >= 2:\n if choice == 2:\n short_side = k\n choice = 4\n else:\n long_side = k\n choice = 2\n\n if choice == 4:\n print(long_side*short_side)\n exit()\nprint(0)", "code2": "from collections import Counter\nN = int(input())\nA_list = list(map(int, input().split()))\ncounter = Counter(A_list)\ncounter = sorted(counter.items(), key=lambda x: -x[0])\n\nlong_side = 0\nshort_side = 0\nchoice = 0\n\nfor k, v in counter:\n if v >= 4 and choice == 0:\n long_side = k\n short_side = k\n choice = 4\n\n elif v >= 2:\n if choice == 2:\n short_side = k\n choice = 4\n else:\n long_side = k\n choice = 2\n\n if choice == 4:\n print(long_side*short_side)\n exit()\nprint(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536437494", "date2": "1536437589", "bleu_score": "0.9862960239973173", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 101, "input": "10\n3 3 6 3 4 3 2 2 5 3\n", "actual_output": "6\n", "expected_output": "9\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " from collections import Counter\n N = int(input())\n A_list = list(map(int, input().split()))\n counter = Counter(A_list)\n counter = sorted(counter.items(), key=lambda x: -x[0])\n \n long_side = 0\n short_side = 0\n choice = 0\n \n for k, v in counter:\n- if v % 4 == 0 and choice == 0:\n+ if v >= 4 and choice == 0:\n long_side = k\n short_side = k\n choice = 4\n \n elif v >= 2:\n if choice == 2:\n short_side = k\n choice = 4\n else:\n long_side = k\n choice = 2\n \n if choice == 4:\n print(long_side*short_side)\n exit()\n print(0)\n", "FL_content": " from collections import Counter\n N = int(input())\n A_list = list(map(int, input().split()))\n counter = Counter(A_list)\n counter = sorted(counter.items(), key=lambda x: -x[0])\n \n long_side = 0\n short_side = 0\n choice = 0\n \n for k, v in counter:\n- if v % 4 == 0 and choice == 0:\n long_side = k\n short_side = k\n choice = 4\n \n elif v >= 2:\n if choice == 2:\n short_side = k\n choice = 4\n else:\n long_side = k\n choice = 2\n \n if choice == 4:\n print(long_side*short_side)\n exit()\n print(0)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 28 }, { "user_id": "u090225501", "problem_id": "p03625", "submission1_id": "s237224257", "submission2_id": "s102363443", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n = int(input())\n a = [int(s) for s in input().split()]\n print(solve(a))\n\ndef solve(a):\n cands = set()\n s = set()\n for i in a:\n if i in s:\n cands.add(i)\n else:\n s.add(i)\n \n x = sorted(cands, reverse=True)\n if len(x) < 2:\n return 0\n \n return x[0] * x[1]\n\nmain()\n", "code2": "def main():\n n = int(input())\n a = [int(s) for s in input().split()]\n print(solve(a))\n\ndef solve(a):\n cands = []\n s = set()\n for i in a:\n if i in s:\n cands.append(i)\n s.remove(i)\n else:\n s.add(i)\n \n x = sorted(cands, reverse=True)\n if len(x) < 2:\n return 0\n \n return x[0] * x[1]\n\nmain()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552233004", "date2": "1552233156", "bleu_score": "0.9167032351323129", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "6\n3 2 2 4 2 2\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["def main(): # (0): main=\n n = int(input()) # (3): n=6\n a = [int(s) for s in input().split()] # (4): a=[3, 2, 2, 4, 2, 2]\n print(solve(a)) # (5): NO CHANGE\n\ndef solve(a): # (1): solve=\n cands = set() # (6): cands=set()\n s = set() # (7): s=set()\n for i in a: # (8): i=3 (11): i=2 ... (26): NO CHANGE\n if i in s: # (9): NO CHANGE (12): NO CHANGE ... (24): NO CHANGE\n cands.add(i) # (16): cands={2} (22): NO CHANGE (25): NO CHANGE\n else:\n s.add(i) # (10): s={3} (13): s={2, 3} (19): s={2, 3, 4}\n \n x = sorted(cands, reverse=True) # (27): x=[2]\n if len(x) < 2:\n return 0\n \n return x[0] * x[1]\n\nmain() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n n = int(input())\n a = [int(s) for s in input().split()]\n print(solve(a))\n \n def solve(a):\n- cands = set()\n+ cands = []\n s = set()\n for i in a:\n if i in s:\n- cands.add(i)\n+ cands.append(i)\n+ s.remove(i)\n else:\n s.add(i)\n \n x = sorted(cands, reverse=True)\n if len(x) < 2:\n return 0\n \n return x[0] * x[1]\n \n main()\n \n", "FL_content": " def main():\n n = int(input())\n a = [int(s) for s in input().split()]\n print(solve(a))\n \n def solve(a):\n- cands = set()\n s = set()\n for i in a:\n if i in s:\n- cands.add(i)\n else:\n s.add(i)\n \n x = sorted(cands, reverse=True)\n if len(x) < 2:\n return 0\n \n return x[0] * x[1]\n \n main()\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 22 }, { "user_id": "u761529120", "problem_id": "p03625", "submission1_id": "s915349997", "submission2_id": "s371098867", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\n\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n \n B = collections.Counter(A)\n\n c = []\n\n for k, v in B.items():\n if v >= 2:\n c.append(k)\n if v >= 4:\n c.append(k)\n if len(c) < 2:\n print(0)\n else:\n c.sort\n print(c[-1] * c[-2])\n\nmain()", "code2": "import collections\n\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n \n B = collections.Counter(A)\n\n c = []\n\n for k, v in B.items():\n if v >= 2:\n c.append(k)\n if v >= 4:\n c.append(k)\n if len(c) < 2:\n print(0)\n else:\n c.sort()\n print(c[-1] * c[-2])\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564451592", "date2": "1564451765", "bleu_score": "0.9900555799612992", "code1_test_status": [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, 1, 1, 1, 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, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 101, "input": "10\n-2 2 1 1 4 2 1 41 -1 1\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["import collections\n\ndef main(): # (0): main=\n N = int(input()) # (2): N=10\n A = list(map(int, input().split())) # (3): A=[-2, 2, 1, 1, 4, 2, 1, 41, -1, 1]\n \n B = collections.Counter(A) # (4): B=Counter({1: 4, 2: 2, -2: 1, 4: 1, 41: 1, -1: 1})\n\n c = [] # (5): c=[]\n\n for k, v in B.items(): # (6): k=-2, v=1 (9): k=2, v=2 ... (27): NO CHANGE\n if v >= 2: # (7): NO CHANGE (10): NO CHANGE ... (25): NO CHANGE\n c.append(k) # (11): c=[2] (15): c=[2, 1]\n if v >= 4: # (8): NO CHANGE (12): NO CHANGE ... (26): NO CHANGE\n c.append(k) # (17): c=[2, 1, 1]\n if len(c) < 2: # (28): NO CHANGE\n print(0)\n else:\n c.sort # (29): NO CHANGE\n print(c[-1] * c[-2])\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import collections\n \n def main():\n N = int(input())\n A = list(map(int, input().split()))\n \n B = collections.Counter(A)\n \n c = []\n \n for k, v in B.items():\n if v >= 2:\n c.append(k)\n if v >= 4:\n c.append(k)\n if len(c) < 2:\n print(0)\n else:\n- c.sort\n+ c.sort()\n print(c[-1] * c[-2])\n \n main()\n", "FL_content": " import collections\n \n def main():\n N = int(input())\n A = list(map(int, input().split()))\n \n B = collections.Counter(A)\n \n c = []\n \n for k, v in B.items():\n if v >= 2:\n c.append(k)\n if v >= 4:\n c.append(k)\n if len(c) < 2:\n print(0)\n else:\n- c.sort\n print(c[-1] * c[-2])\n \n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u054556734", "problem_id": "p03625", "submission1_id": "s894629652", "submission2_id": "s849297120", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\na.sort(reverse=True)\n\nans=[]\ntmp=0\nflag=True\nfor el in a:\n if len(ans)==2: break\n if el != tmp: tmp=el; flag=True\n else:\n if flag: ans.append(el); tmp=el; flag=False\n\ntry: ans=ans[0]*ans[1]\nexcept: ans=0\nprint(ans)\n", "code2": "n=int(input())\na=list(map(int,input().split()))\na.sort(reverse=True)\n\nans=[]\ntmp=0\ncount=0\nfor el in a:\n if len(ans)==2: break\n if el != tmp: tmp=el; count=0\n else:\n if count%2==0: ans.append(el); tmp=el;\n count+=1\n\ntry: ans=ans[0]*ans[1]\nexcept: ans=0\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1503442976", "date2": "1503444082", "bleu_score": "0.8419972946064435", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n-2 2 1 2 4 2 1 41 0 2\n", "actual_output": "2\n", "expected_output": "4\n\n", "anno_code": ["n=int(input()) # (0): n=10\na=list(map(int,input().split())) # (1): a=[-2, 2, 1, 2, 4, 2, 1, 41, 0, 2]\na.sort(reverse=True) # (2): a=[41, 4, 2, 2, 2, 2, 1, 1, 0, -2]\n\nans=[] # (3): ans=[]\ntmp=0 # (4): tmp=0\nflag=True # (5): flag=True\nfor el in a: # (6): el=41 (9): el=4 ... (34): el=0\n if len(ans)==2: break # (7): NO CHANGE (10): NO CHANGE ... (35): NO CHANGE\n if el != tmp: tmp=el; flag=True # (8): tmp=41 (11): tmp=4 ... (32): NO CHANGE\n else:\n if flag: ans.append(el); tmp=el; flag=False # (18): ans=[2], flag=False (22): NO CHANGE ... (33): ans=[2, 1], flag=False\n\ntry: ans=ans[0]*ans[1] # (36): ans=2\nexcept: ans=0\nprint(ans)\n"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int,input().split()))\n a.sort(reverse=True)\n \n ans=[]\n tmp=0\n-flag=True\n+count=0\n for el in a:\n if len(ans)==2: break\n- if el != tmp: tmp=el; flag=True\n+ if el != tmp: tmp=el; count=0\n else:\n- if flag: ans.append(el); tmp=el; flag=False\n+ if count%2==0: ans.append(el); tmp=el;\n+ count+=1\n \n try: ans=ans[0]*ans[1]\n except: ans=0\n print(ans)\n \n", "FL_content": " n=int(input())\n a=list(map(int,input().split()))\n a.sort(reverse=True)\n \n ans=[]\n tmp=0\n-flag=True\n for el in a:\n if len(ans)==2: break\n- if el != tmp: tmp=el; flag=True\n else:\n- if flag: ans.append(el); tmp=el; flag=False\n \n try: ans=ans[0]*ans[1]\n except: ans=0\n print(ans)\n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u638057737", "problem_id": "p03625", "submission1_id": "s463672501", "submission2_id": "s887841961", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nfreq = {}\narr = map(int,input().split())\nfor i in arr:\n try:\n freq[i] += 1\n except KeyError:\n freq[i] = 1\n\nto_multiply = [] \nfor i in sorted(freq.keys(),reverse=True):\n if freq[i] >= 2:\n to_multiply.append(i)\nif len(to_multiply) >= 2:\n print(to_multiply[0] * to_multiply[1])\nelse:\n print(\"0\")\n \n", "code2": "N = int(input())\nfreq = {}\narr = map(int,input().split())\nfor i in arr:\n try:\n freq[i] += 1\n except KeyError:\n freq[i] = 1\n\nto_multiply = [] \nfor i in sorted(freq.keys(),reverse=True):\n if freq[i] >= 4:\n to_multiply.append(i)\n to_multiply.append(i)\n elif freq[i] >= 2:\n to_multiply.append(i)\nif len(to_multiply) >= 2:\n print(to_multiply[0] * to_multiply[1])\nelse:\n print(\"0\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1503278979", "date2": "1503279262", "bleu_score": "0.8265818472931782", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n-2 2 1 2 4 2 1 41 0 2\n", "actual_output": "2\n", "expected_output": "4\n\n", "anno_code": ["N = int(input()) # (0): N=10\nfreq = {} # (1): freq={}\narr = map(int,input().split()) # (2): arr=\nfor i in arr: # (3): i=-2 (8): i=2 ... (45): NO CHANGE\n try: # (4): NO CHANGE (9): NO CHANGE ... (43): NO CHANGE\n freq[i] += 1 # (5): NO CHANGE (10): NO CHANGE ... (44): freq={-2: 1, 2: 4, 1: 2, 4: 1, 41: 1, 0: 1}\n except KeyError: # (6): NO CHANGE (11): NO CHANGE ... (40): NO CHANGE\n freq[i] = 1 # (7): freq={-2: 1} (12): freq={-2: 1, 2: 1} ... (41): freq={-2: 1, 2: 3, 1: 2, 4: 1, 41: 1, 0: 1}\n\nto_multiply = [] # (46): to_multiply=[]\nfor i in sorted(freq.keys(),reverse=True): # (47): i=41 (49): i=4 ... (61): NO CHANGE\n if freq[i] >= 2: # (48): NO CHANGE (50): NO CHANGE ... (60): NO CHANGE\n to_multiply.append(i) # (53): to_multiply=[2] (56): to_multiply=[2, 1]\nif len(to_multiply) >= 2: # (62): NO CHANGE\n print(to_multiply[0] * to_multiply[1])\nelse:\n print(\"0\")\n \n"], "anno_status": [true], "diff_content": " N = int(input())\n freq = {}\n arr = map(int,input().split())\n for i in arr:\n try:\n freq[i] += 1\n except KeyError:\n freq[i] = 1\n \n to_multiply = [] \n for i in sorted(freq.keys(),reverse=True):\n- if freq[i] >= 2:\n+ if freq[i] >= 4:\n+ to_multiply.append(i)\n+ to_multiply.append(i)\n+ elif freq[i] >= 2:\n to_multiply.append(i)\n if len(to_multiply) >= 2:\n print(to_multiply[0] * to_multiply[1])\n else:\n print(\"0\")\n- \n \n", "FL_content": " N = int(input())\n freq = {}\n arr = map(int,input().split())\n for i in arr:\n try:\n freq[i] += 1\n except KeyError:\n freq[i] = 1\n \n to_multiply = [] \n for i in sorted(freq.keys(),reverse=True):\n- if freq[i] >= 2:\n to_multiply.append(i)\n if len(to_multiply) >= 2:\n print(to_multiply[0] * to_multiply[1])\n else:\n print(\"0\")\n- \n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u550943777", "problem_id": "p03625", "submission1_id": "s231338952", "submission2_id": "s542024655", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\narr = sorted(list(map(int,input().split())))\nb = {}\nfor i in arr:\n if i not in b:\n b[i] = 1\n else:\n b[i] += 1\nh = 0\nw = 0\nfor i in b:\n if b[i] >= 4 and h*w < i**2:\n h = i\n w = i\n elif b[i] >= 2:\n if w*i > h*i:\n h = i\n else:\n w = i\nprint(0)\n", "code2": "N = int(input())\narr = sorted(list(map(int,input().split())))\nb = {}\nfor i in arr:\n if i not in b:\n b[i] = 1\n else:\n b[i] += 1\nh = 0\nw = 0\nb1 = sorted(b)[::-1]\nfor i in b1:\n if b[i] >= 4:\n if h < i:\n h = i\n w = i\n break\n else:\n w = i\n break\n elif b[i] >= 2:\n if h == 0:\n h = i\n else:\n w = i\n break\n \nprint(h*w)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546132846", "date2": "1546187486", "bleu_score": "0.682532055505364", "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, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 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], "code1_test_score": 38, "total_score": 101, "input": "10\n-2 2 12 1 4 2 1 41 -1 1\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=10\narr = sorted(list(map(int,input().split()))) # (1): arr=[-2, -1, 1, 1, 1, 2, 2, 4, 12, 41]\nb = {} # (2): b={}\nfor i in arr: # (3): i=-2 (6): i=-1 ... (33): NO CHANGE\n if i not in b: # (4): NO CHANGE (7): NO CHANGE ... (31): NO CHANGE\n b[i] = 1 # (5): b={-2: 1} (8): b={-2: 1, -1: 1} ... (32): b={-2: 1, -1: 1, 1: 3, 2: 2, 4: 1, 12: 1, 41: 1}\n else:\n b[i] += 1 # (14): b={-2: 1, -1: 1, 1: 2} (17): b={-2: 1, -1: 1, 1: 3} (23): b={-2: 1, -1: 1, 1: 3, 2: 2}\nh = 0 # (34): h=0\nw = 0 # (35): w=0\nfor i in b: # (36): i=-2 (39): i=-1 ... (61): NO CHANGE\n if b[i] >= 4 and h*w < i**2: # (37): NO CHANGE (40): NO CHANGE ... (59): NO CHANGE\n h = i\n w = i\n elif b[i] >= 2: # (38): NO CHANGE (41): NO CHANGE ... (60): NO CHANGE\n if w*i > h*i: # (45): NO CHANGE (50): NO CHANGE\n h = i # (51): h=2\n else:\n w = i # (46): w=1\nprint(0)\n"], "anno_status": [true], "diff_content": " N = int(input())\n arr = sorted(list(map(int,input().split())))\n b = {}\n for i in arr:\n- if i not in b:\n- b[i] = 1\n- else:\n- b[i] += 1\n+ if i not in b:\n+ b[i] = 1\n+ else:\n+ b[i] += 1\n h = 0\n w = 0\n-for i in b:\n- if b[i] >= 4 and h*w < i**2:\n- h = i\n- w = i\n+b1 = sorted(b)[::-1]\n+for i in b1:\n+ if b[i] >= 4:\n+ if h < i:\n+ h = i\n+ w = i\n+ break\n+ else:\n+ w = i\n+ break\n elif b[i] >= 2:\n- if w*i > h*i:\n+ if h == 0:\n h = i\n else:\n w = i\n-print(0)\n+ break\n+ \n+print(h*w)\n \n", "FL_content": " N = int(input())\n arr = sorted(list(map(int,input().split())))\n b = {}\n for i in arr:\n- if i not in b:\n- b[i] = 1\n- else:\n- b[i] += 1\n h = 0\n w = 0\n-for i in b:\n- if b[i] >= 4 and h*w < i**2:\n- h = i\n- w = i\n elif b[i] >= 2:\n- if w*i > h*i:\n h = i\n else:\n w = i\n-print(0)\n \n", "added_lines": 18, "removed_lines": 10, "code1_lines": 21 }, { "user_id": "u013629972", "problem_id": "p03625", "submission1_id": "s825046753", "submission2_id": "s569398679", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools\nsys.setrecursionlimit(10**7)\ninf = 10 ** 20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef pf(s): return print(s, flush=True)\n\nN=I()\nA=LI()\nB = []\ncounts = collections.Counter(A)\nfor count in counts.items():\n if count[1] >= 2:\n B.append(count[0])\nB.sort(reverse=True)\nif len(B) < 2:\n print(0)\nelse:\n print(B[0]*B[1])\n ", "code2": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools\nsys.setrecursionlimit(10**7)\ninf = 10 ** 20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef pf(s): return print(s, flush=True)\n\nN=I()\nA=LI()\nB = []\ncounts = collections.Counter(A)\nfor count in counts.items():\n if count[1] >= 2:\n B.append(count)\nB.sort(reverse=True)\nif len(B) ==0:\n print(0)\nelif len(B) == 1:\n if B[0][1] >= 4:\n print(B[0][0]**2)\n else:\n print(0)\nelse:\n if B[0][1] >= 4:\n print(B[0][0]**2)\n else:\n print(B[0][0]*B[1][0])\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555163194", "date2": "1555163838", "bleu_score": "0.8440797349649933", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 101, "input": "10\n-1 1 1 3 1 2 4 15 1 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\ninf = 10 ** 20 # (1): inf=100000000000000000000\neps = 1.0 / 10**10 # (2): eps=1e-10\nmod = 10**9+7 # (3): mod=1000000007\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)] # (4): dd=[(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)] # (5): ddn=[(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)], LI=, LI_=, LF=, LS=, I=, F=, pf=\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef pf(s): return print(s, flush=True)\n\nN=I() # (6): N=10\nA=LI() # (7): A=[-1, 1, 1, 3, 1, 2, 4, 15, 1, 0]\nB = [] # (8): B=[]\ncounts = collections.Counter(A) # (9): counts=Counter({1: 4, -1: 1, 3: 1, 2: 1, 4: 1, 15: 1, 0: 1})\nfor count in counts.items(): # (10): count=(-1, 1) (12): count=(1, 4) ... (25): NO CHANGE\n if count[1] >= 2: # (11): NO CHANGE (13): NO CHANGE ... (24): NO CHANGE\n B.append(count[0]) # (14): B=[1]\nB.sort(reverse=True) # (26): NO CHANGE\nif len(B) < 2: # (27): NO CHANGE\n print(0)\nelse:\n print(B[0]*B[1])\n "], "anno_status": [true], "diff_content": " import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools\n sys.setrecursionlimit(10**7)\n inf = 10 ** 20\n eps = 1.0 / 10**10\n mod = 10**9+7\n dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\n ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def pf(s): return print(s, flush=True)\n \n N=I()\n A=LI()\n B = []\n counts = collections.Counter(A)\n for count in counts.items():\n if count[1] >= 2:\n- B.append(count[0])\n+ B.append(count)\n B.sort(reverse=True)\n-if len(B) < 2:\n+if len(B) ==0:\n print(0)\n+elif len(B) == 1:\n+ if B[0][1] >= 4:\n+ print(B[0][0]**2)\n+ else:\n+ print(0)\n else:\n- print(B[0]*B[1])\n+ if B[0][1] >= 4:\n+ print(B[0][0]**2)\n+ else:\n+ print(B[0][0]*B[1][0])\n \n", "FL_content": " import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools\n sys.setrecursionlimit(10**7)\n inf = 10 ** 20\n eps = 1.0 / 10**10\n mod = 10**9+7\n dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\n ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n def LI(): return [int(x) for x in sys.stdin.readline().split()]\n def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\n def LF(): return [float(x) for x in sys.stdin.readline().split()]\n def LS(): return sys.stdin.readline().split()\n def I(): return int(sys.stdin.readline())\n def F(): return float(sys.stdin.readline())\n def pf(s): return print(s, flush=True)\n \n N=I()\n A=LI()\n B = []\n counts = collections.Counter(A)\n for count in counts.items():\n if count[1] >= 2:\n- B.append(count[0])\n B.sort(reverse=True)\n-if len(B) < 2:\n print(0)\n else:\n- print(B[0]*B[1])\n \n", "added_lines": 11, "removed_lines": 3, "code1_lines": 28 }, { "user_id": "u619197965", "problem_id": "p03625", "submission1_id": "s492415172", "submission2_id": "s690352223", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nn=int(input())\na=sorted([int(i) for i in input().split()])\ncnt=Counter(a)\nkey=sorted(list(cnt.keys()))[::-1]\none=two=0\nfor i in key:\n if cnt[i]>=4:\n one=two=i\n elif cnt[i]>=2:\n if one==0:\n one=i\n else:\n two=i\n break\nprint(one*two)", "code2": "from collections import Counter\nn=int(input())\na=sorted([int(i) for i in input().split()])\ncnt=Counter(a)\nkey=sorted(list(cnt.keys()))[::-1]\none=two=0\nfor i in key:\n if cnt[i]>=4 and one==0:\n one=two=i\n break\n elif cnt[i]>=2:\n if one==0:\n one=i\n else:\n two=i\n break\nprint(one*two)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1569255094", "date2": "1569255497", "bleu_score": "0.9232817163273835", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 101, "input": "10\n3 3 6 6 4 3 1 6 3 10\n", "actual_output": "9\n", "expected_output": "18\n\n", "anno_code": ["from collections import Counter\nn=int(input()) # (0): n=10\na=sorted([int(i) for i in input().split()]) # (1): a=[1, 3, 3, 3, 3, 4, 6, 6, 6, 10]\ncnt=Counter(a) # (2): cnt=Counter({3: 4, 6: 3, 1: 1, 4: 1, 10: 1})\nkey=sorted(list(cnt.keys()))[::-1] # (3): key=[10, 6, 4, 3, 1]\none=two=0 # (4): one=0, two=0\nfor i in key: # (5): i=10 (8): i=6 ... (22): NO CHANGE\n if cnt[i]>=4: # (6): NO CHANGE (9): NO CHANGE ... (20): NO CHANGE\n one=two=i # (18): one=3, two=3\n elif cnt[i]>=2: # (7): NO CHANGE (10): NO CHANGE ... (21): NO CHANGE\n if one==0: # (11): NO CHANGE\n one=i # (12): one=6\n else:\n two=i\n break\nprint(one*two)"], "anno_status": [true], "diff_content": " from collections import Counter\n n=int(input())\n a=sorted([int(i) for i in input().split()])\n cnt=Counter(a)\n key=sorted(list(cnt.keys()))[::-1]\n one=two=0\n for i in key:\n- if cnt[i]>=4:\n+ if cnt[i]>=4 and one==0:\n one=two=i\n+ break\n elif cnt[i]>=2:\n if one==0:\n one=i\n else:\n two=i\n break\n print(one*two)\n", "FL_content": " from collections import Counter\n n=int(input())\n a=sorted([int(i) for i in input().split()])\n cnt=Counter(a)\n key=sorted(list(cnt.keys()))[::-1]\n one=two=0\n for i in key:\n- if cnt[i]>=4:\n one=two=i\n elif cnt[i]>=2:\n if one==0:\n one=i\n else:\n two=i\n break\n print(one*two)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u987549444", "problem_id": "p02665", "submission1_id": "s451615379", "submission2_id": "s109353404", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\na=int(stdin.readline())\nA=stdin.readline().split()\nsum=0\nfor k in range(0,a+1):\n sum+=int(A[k])\n\nsum-=int(A[a])\nver=1\nlay=1\nK=0\nT=0\n\nif a==0:\n if A[0]!=0:\n print(-1)\n K=1\n else:\n print(1)\n K=1\n\nfor l in range(0,a):\n if lay-int(A[l])<=0:\n print(-1)\n K=1\n break\n if (lay-int(A[l]))*2-sum+int(A[l])<=int(A[a]):\n lay=(lay-int(A[l]))*2\n ver+=lay\n sum-=int(A[l])\n T=l\n else:\n lay-=int(A[l])\n sum-=int(A[l])\n x=lay-sum-int(A[a])\n if x==0:\n ver+=lay\n elif x<0:\n print(-1)\n K=1\n \n else:\n lay=sum+int(A[a])\n ver+=lay\n T=l\n break\n\nif K==0:\n for u in range(T+1,a):\n lay -= int(A[u])\n sum -= int(A[u])\n ver+=lay\n\nif K==0:\n print(ver)", "code2": "from sys import stdin\n\na=int(stdin.readline())\nA=stdin.readline().split()\nsum=0\nfor k in range(0,a+1):\n sum+=int(A[k])\n\nsum-=int(A[a])\nver=1\nlay=1\nK=0\nT=0\n\nif a==0:\n if A[0]!='1':\n print(-1)\n K=1\n else:\n print(1)\n K=1\n\nfor l in range(0,a):\n if lay-int(A[l])<=0:\n print(-1)\n K=1\n break\n if (lay-int(A[l]))*20:\n print(-1)\n K=1\n else:\n lay=sum+int(A[a])\n ver+=lay\n T=l\n break\n\nif K==0:\n for u in range(T+1,a):\n lay -= int(A[u])\n sum -= int(A[u])\n ver+=lay\n\nif K==0:\n print(ver)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590894337", "date2": "1590939688", "bleu_score": "0.9053782438216864", "code1_test_status": [1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 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, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 26, "total_score": 101, "input": "4\n-1 0 -1 2 10\n", "actual_output": "-1\n", "expected_output": "35\n\n", "anno_code": ["from sys import stdin\n\na=int(stdin.readline()) # (0): a=4\nA=stdin.readline().split() # (1): A=['-1', '0', '-1', '2', '10']\nsum=0 # (2): sum=0\nfor k in range(0,a+1): # (3): k=0 (5): k=1 ... (13): NO CHANGE\n sum+=int(A[k]) # (4): sum=-1 (6): NO CHANGE ... (12): sum=10\n\nsum-=int(A[a]) # (14): sum=0\nver=1 # (15): ver=1\nlay=1 # (16): lay=1\nK=0 # (17): K=0\nT=0 # (18): T=0\n\nif a==0: # (19): NO CHANGE\n if A[0]!=0:\n print(-1)\n K=1\n else:\n print(1)\n K=1\n\nfor l in range(0,a): # (20): l=0 (27): l=1 (34): l=2\n if lay-int(A[l])<=0: # (21): NO CHANGE (28): NO CHANGE (35): NO CHANGE\n print(-1)\n K=1\n break\n if (lay-int(A[l]))*2-sum+int(A[l])<=int(A[a]): # (22): NO CHANGE (29): NO CHANGE (36): NO CHANGE\n lay=(lay-int(A[l]))*2 # (23): lay=4 (30): lay=8\n ver+=lay # (24): ver=5 (31): ver=13\n sum-=int(A[l]) # (25): sum=1 (32): NO CHANGE\n T=l # (26): NO CHANGE (33): T=1\n else:\n lay-=int(A[l]) # (37): lay=9\n sum-=int(A[l]) # (38): sum=2\n x=lay-sum-int(A[a]) # (39): x=-3\n if x==0: # (40): NO CHANGE\n ver+=lay\n elif x<0: # (41): NO CHANGE\n print(-1) # (42): NO CHANGE\n K=1 # (43): K=1\n \n else:\n lay=sum+int(A[a])\n ver+=lay\n T=l # (44): T=2\n break # (45): NO CHANGE\n\nif K==0: # (46): NO CHANGE\n for u in range(T+1,a):\n lay -= int(A[u])\n sum -= int(A[u])\n ver+=lay\n\nif K==0:\n print(ver)"], "anno_status": [true], "diff_content": " from sys import stdin\n \n a=int(stdin.readline())\n A=stdin.readline().split()\n sum=0\n for k in range(0,a+1):\n sum+=int(A[k])\n \n sum-=int(A[a])\n ver=1\n lay=1\n K=0\n T=0\n \n if a==0:\n- if A[0]!=0:\n+ if A[0]!='1':\n print(-1)\n K=1\n else:\n print(1)\n K=1\n \n for l in range(0,a):\n if lay-int(A[l])<=0:\n print(-1)\n K=1\n break\n+ if (lay-int(A[l]))*20:\n+ print(-1)\n+ K=1\n else:\n lay=sum+int(A[a])\n ver+=lay\n T=l\n break\n \n if K==0:\n for u in range(T+1,a):\n lay -= int(A[u])\n sum -= int(A[u])\n ver+=lay\n \n if K==0:\n print(ver)\n", "FL_content": " from sys import stdin\n \n a=int(stdin.readline())\n A=stdin.readline().split()\n sum=0\n for k in range(0,a+1):\n sum+=int(A[k])\n \n sum-=int(A[a])\n ver=1\n lay=1\n K=0\n T=0\n \n if a==0:\n- if A[0]!=0:\n print(-1)\n K=1\n else:\n print(1)\n K=1\n \n for l in range(0,a):\n if lay-int(A[l])<=0:\n print(-1)\n K=1\n break\n if (lay-int(A[l]))*2-sum+int(A[l])<=int(A[a]):\n lay=(lay-int(A[l]))*2\n ver+=lay\n sum-=int(A[l])\n T=l\n else:\n lay-=int(A[l])\n sum-=int(A[l])\n x=lay-sum-int(A[a])\n if x==0:\n ver+=lay\n- elif x<0:\n- print(-1)\n- K=1\n- \n else:\n lay=sum+int(A[a])\n ver+=lay\n T=l\n break\n \n if K==0:\n for u in range(T+1,a):\n lay -= int(A[u])\n sum -= int(A[u])\n ver+=lay\n \n if K==0:\n print(ver)\n", "added_lines": 8, "removed_lines": 5, "code1_lines": 56 }, { "user_id": "u708255304", "problem_id": "p02665", "submission1_id": "s084629975", "submission2_id": "s927853998", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\n\nA = list(map(int, input().split()))\nfor i in range(N):\n if A[i] > 2**i:\n print(-1)\n exit()\n\nif A[0] != 0:\n if N == 0 and A[0] == 1:\n print(1)\n exit()\n else:\n print(-1)\n exit()\n\nlimit = [1]\nfor i in range(1, N+1):\n if i == N:\n limit.append(A[i])\n else:\n limit.append((limit[-1]-A[i-1])*2)\n\n\n\nans = [A[-1]]\nnow_leaf = A[-1]\nfor i in range(N-1, -1, -1):\n \n ans.append(min(now_leaf+A[i], limit[i]))\n now_leaf = ans[-1]\n\nprint(sum(ans))\n", "code2": "\nN = int(input())\n\nA = list(map(int, input().split()))\n\n\nlimit = [1]\nfor i in range(1, N+1):\n if i == N: \n limit.append(A[i])\n else:\n limit.append((limit[-1]-A[i-1])*2)\n if limit[-1] < 0:\n print(-1)\n exit()\n\n\nif N == 0:\n if A[0] != 1:\n print(-1)\n exit()\n\n\nans = [A[-1]]\nnow_leaf = A[-1] \nfor i in range(N-1, -1, -1):\n \n ans.append(min(now_leaf+A[i], limit[i]))\n now_leaf = ans[-1]\n\nfor i in range(N):\n \n if (ans[N-i]-A[i])*2 < A[i+1]: \n print(-1)\n exit()\nprint(sum(ans))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590891725", "date2": "1590898201", "bleu_score": "0.8769815478810575", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 45, "total_score": 101, "input": "4\n-2 0 -1 1 5\n", "actual_output": "-1\n", "expected_output": "22\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " \n N = int(input())\n \n A = list(map(int, input().split()))\n-for i in range(N):\n- if A[i] > 2**i:\n- print(-1)\n- exit()\n \n-if A[0] != 0:\n- if N == 0 and A[0] == 1:\n- print(1)\n- exit()\n- else:\n- print(-1)\n- exit()\n \n limit = [1]\n for i in range(1, N+1):\n- if i == N:\n+ if i == N: \n limit.append(A[i])\n else:\n limit.append((limit[-1]-A[i-1])*2)\n+ if limit[-1] < 0:\n+ print(-1)\n+ exit()\n \n \n+if N == 0:\n+ if A[0] != 1:\n+ print(-1)\n+ exit()\n+\n \n ans = [A[-1]]\n-now_leaf = A[-1]\n+now_leaf = A[-1] \n for i in range(N-1, -1, -1):\n \n ans.append(min(now_leaf+A[i], limit[i]))\n now_leaf = ans[-1]\n \n+for i in range(N):\n+ \n+ if (ans[N-i]-A[i])*2 < A[i+1]: \n+ print(-1)\n+ exit()\n print(sum(ans))\n \n", "FL_content": " \n N = int(input())\n \n A = list(map(int, input().split()))\n-for i in range(N):\n- if A[i] > 2**i:\n- print(-1)\n- exit()\n \n-if A[0] != 0:\n- if N == 0 and A[0] == 1:\n- print(1)\n- exit()\n- else:\n- print(-1)\n- exit()\n \n limit = [1]\n for i in range(1, N+1):\n- if i == N:\n limit.append(A[i])\n else:\n limit.append((limit[-1]-A[i-1])*2)\n \n \n \n ans = [A[-1]]\n-now_leaf = A[-1]\n for i in range(N-1, -1, -1):\n \n ans.append(min(now_leaf+A[i], limit[i]))\n now_leaf = ans[-1]\n \n print(sum(ans))\n \n", "added_lines": 15, "removed_lines": 13, "code1_lines": 35 }, { "user_id": "u266014018", "problem_id": "p02665", "submission1_id": "s752377186", "submission2_id": "s345635453", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n import sys\n import math\n input = sys.stdin.buffer.readline\n n = int(input())\n A = list(map(int, input().split()))\n ans = 0\n nodes = 0\n for i in range(n,-1,-1):\n if i == 0:\n ans +=1 \n break\n if math.ceil(nodes/2) + A[i] > 2**i:\n \n print(-1)\n exit(0)\n nodes += A[i]\n nodes = min(2**i,nodes)\n ans += nodes\n print(ans)\n\nif __name__ == '__main__':\n main()", "code2": "def main():\n import sys\n import math\n input = sys.stdin.buffer.readline\n n = int(input())\n A = list(map(int, input().split()))\n ans = 0\n node = 1\n max_node = sum(A)\n for i in range(n+1):\n ans += node\n max_node -= A[i]\n node = min(max_node,(node-A[i])*2)\n if node < 0:\n print(-1)\n exit(0)\n print(ans)\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590893935", "date2": "1590896819", "bleu_score": "0.749603048090692", "code1_test_status": [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, 1, 0, 0, 0, 0, 0, 0, 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, 1, 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, 1, 1, 1, 0, 0], "code1_test_score": 13, "total_score": 101, "input": "4\n-1 1 -1 1 17\n", "actual_output": "-1\n", "expected_output": "42\n\n", "anno_code": ["def main(): # (0): main=\n import sys\n import math\n input = sys.stdin.buffer.readline\n n = int(input())\n A = list(map(int, input().split()))\n ans = 0\n nodes = 0\n for i in range(n,-1,-1):\n if i == 0:\n ans +=1 \n break\n if math.ceil(nodes/2) + A[i] > 2**i:\n \n print(-1)\n exit(0)\n nodes += A[i]\n nodes = min(2**i,nodes)\n ans += nodes\n print(ans)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " def main():\n import sys\n import math\n input = sys.stdin.buffer.readline\n n = int(input())\n A = list(map(int, input().split()))\n ans = 0\n- nodes = 0\n- for i in range(n,-1,-1):\n- if i == 0:\n- ans +=1 \n- break\n- if math.ceil(nodes/2) + A[i] > 2**i:\n- \n+ node = 1\n+ max_node = sum(A)\n+ for i in range(n+1):\n+ ans += node\n+ max_node -= A[i]\n+ node = min(max_node,(node-A[i])*2)\n+ if node < 0:\n print(-1)\n exit(0)\n- nodes += A[i]\n- nodes = min(2**i,nodes)\n- ans += nodes\n print(ans)\n \n+\n if __name__ == '__main__':\n main()\n", "FL_content": " def main():\n import sys\n import math\n input = sys.stdin.buffer.readline\n n = int(input())\n A = list(map(int, input().split()))\n ans = 0\n- nodes = 0\n- for i in range(n,-1,-1):\n- if i == 0:\n- ans +=1 \n- break\n- if math.ceil(nodes/2) + A[i] > 2**i:\n- \n print(-1)\n exit(0)\n- nodes += A[i]\n- nodes = min(2**i,nodes)\n- ans += nodes\n print(ans)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 8, "removed_lines": 10, "code1_lines": 23 }, { "user_id": "u038724782", "problem_id": "p02665", "submission1_id": "s300284426", "submission2_id": "s345630544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na_l = list(map(int,input().split()))\n\nif a_l[0] != 0:\n if n == 0:\n print(1)\n else:\n print(-1)\n exit()\n\ntree = [0]*(n+1)\ntree[0] = 1\nfor i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n\n\nif tree[-1] < a_l[-1]:\n print(-1)\n exit()\n\nwhile tree[-1] != a_l[-1]:\n tree[-1] -= 1\n i = 1\n while True:\n i += 1 \n if tree[-(i-1)] >= (tree[-i] - a_l[-i]):\n break\n tree[-i] -= 1\n\n\nans = 0\nfor val in tree:\n ans += val\nprint(ans)", "code2": "n = int(input())\na_l = list(map(int,input().split()))\n\n\n\n\n\n\n\n\ntree = [0]*(n+1)\ntree[0] = 1\nfor i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n\n\nif tree[-1] < a_l[-1]:\n print(-1)\n exit()\n\n\ntree[-1] = a_l[-1]\nfor i in range(2,n+2):\n \n if tree[-i] == tree[-(i-1)] + a_l[-i]:\n break\n else:\n tree[-i] = min(tree[-i], tree[-(i-1)] + a_l[-i])\n \n\n\n\n\n\n\n\n\n\n\n\n\nans = 0\nfor val in tree:\n ans += val\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590889314", "date2": "1590890941", "bleu_score": "0.7267070821616879", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 46, "total_score": 101, "input": "4\n-1 0 -1 3 5\n", "actual_output": "-1\n", "expected_output": "25\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())\n a_l = list(map(int,input().split()))\n \n-if a_l[0] != 0:\n- if n == 0:\n- print(1)\n- else:\n- print(-1)\n- exit()\n+\n+\n+\n+\n+\n+\n \n tree = [0]*(n+1)\n tree[0] = 1\n for i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n \n \n if tree[-1] < a_l[-1]:\n print(-1)\n exit()\n \n-while tree[-1] != a_l[-1]:\n- tree[-1] -= 1\n- i = 1\n- while True:\n- i += 1 \n- if tree[-(i-1)] >= (tree[-i] - a_l[-i]):\n- break\n- tree[-i] -= 1\n+\n+tree[-1] = a_l[-1]\n+for i in range(2,n+2):\n+ \n+ if tree[-i] == tree[-(i-1)] + a_l[-i]:\n+ break\n+ else:\n+ tree[-i] = min(tree[-i], tree[-(i-1)] + a_l[-i])\n+ \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n \n ans = 0\n for val in tree:\n ans += val\n print(ans)\n", "FL_content": " n = int(input())\n a_l = list(map(int,input().split()))\n \n-if a_l[0] != 0:\n- if n == 0:\n- print(1)\n- else:\n- print(-1)\n- exit()\n \n tree = [0]*(n+1)\n tree[0] = 1\n for i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n \n \n if tree[-1] < a_l[-1]:\n print(-1)\n exit()\n \n-while tree[-1] != a_l[-1]:\n- tree[-1] -= 1\n- i = 1\n- while True:\n- i += 1 \n- if tree[-(i-1)] >= (tree[-i] - a_l[-i]):\n- break\n- tree[-i] -= 1\n \n \n ans = 0\n for val in tree:\n ans += val\n print(ans)\n", "added_lines": 25, "removed_lines": 14, "code1_lines": 34 }, { "user_id": "u086138398", "problem_id": "p02665", "submission1_id": "s087686149", "submission2_id": "s778767279", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\n\nA = list(map(int,input().split()))\n\nB = [0] * (N+1)\nB[0] = 1 - A[0]\nfor i in range(0,N):\n if 2*B[i] < A[i+1]:\n print(\"-1\")\n exit()\n B_max = sum(A[i+2:])\n B[i+1] = min(2*B[i]-1,B_max)\nif B[-1] != 0:\n print(\"-1\")\nelse:\n print(sum(A)+sum(B))\n", "code2": "N = int(input())\n\nA = list(map(int,input().split()))\ns = sum(A[1:])\nB = [0] * (N+1)\nB[0] = 1 - A[0]\nfor i in range(0,N):\n s -= A[i+1]\n if 2*B[i] < A[i+1]:\n print(\"-1\")\n exit()\n B[i+1] = min(2*B[i]-A[i+1],s)\nif B[-1] != 0:\n print(\"-1\")\nelse:\n print(sum(A)+sum(B))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1591575396", "date2": "1591575934", "bleu_score": "0.9118729221548816", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 0, 0, 1], "code1_test_score": 15, "total_score": 101, "input": "4\n-2 1 -3 4 27\n", "actual_output": "61\n", "expected_output": "70\n\n", "anno_code": ["N = int(input()) # (0): N=4\n\nA = list(map(int,input().split())) # (1): A=[-2, 1, -3, 4, 27]\n\nB = [0] * (N+1) # (2): B=[0, 0, 0, 0, 0]\nB[0] = 1 - A[0] # (3): B=[3, 0, 0, 0, 0]\nfor i in range(0,N): # (4): i=0 (8): i=1 ... (20): NO CHANGE\n if 2*B[i] < A[i+1]: # (5): NO CHANGE (9): NO CHANGE ... (17): NO CHANGE\n print(\"-1\")\n exit()\n B_max = sum(A[i+2:]) # (6): B_max=28 (10): B_max=31 ... (18): B_max=0\n B[i+1] = min(2*B[i]-1,B_max) # (7): B=[3, 5, 0, 0, 0] (11): B=[3, 5, 9, 0, 0] ... (19): NO CHANGE\nif B[-1] != 0: # (21): NO CHANGE\n print(\"-1\")\nelse:\n print(sum(A)+sum(B))\n"], "anno_status": [true], "diff_content": " N = int(input())\n \n A = list(map(int,input().split()))\n-\n+s = sum(A[1:])\n B = [0] * (N+1)\n B[0] = 1 - A[0]\n for i in range(0,N):\n+ s -= A[i+1]\n if 2*B[i] < A[i+1]:\n print(\"-1\")\n exit()\n- B_max = sum(A[i+2:])\n- B[i+1] = min(2*B[i]-1,B_max)\n+ B[i+1] = min(2*B[i]-A[i+1],s)\n if B[-1] != 0:\n print(\"-1\")\n else:\n print(sum(A)+sum(B))\n \n", "FL_content": " N = int(input())\n \n A = list(map(int,input().split()))\n-\n B = [0] * (N+1)\n B[0] = 1 - A[0]\n for i in range(0,N):\n if 2*B[i] < A[i+1]:\n print(\"-1\")\n exit()\n- B_max = sum(A[i+2:])\n- B[i+1] = min(2*B[i]-1,B_max)\n if B[-1] != 0:\n print(\"-1\")\n else:\n print(sum(A)+sum(B))\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u663438907", "problem_id": "p02665", "submission1_id": "s211772377", "submission2_id": "s688902642", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nN = int(input())\nA = list(map(int, input().split()))\n\nl = []\n\nif A[0] != 0:\n print(-1)\n sys.exit()\n\nfor i in range(N):\n if A[i] > A[i+1]+1:\n print(-1)\n sys.exit()\n\ntemp = 1\nfor i in range(N+1):\n l.append(temp-A[i])\n temp = (temp-A[i])*2\n\nans = 1\nnode = 0\nfor i in range(N, 0, -1):\n if l[i-1] >= node + A[i]:\n node += A[i]\n ans += node\n else:\n ans += node + A[i]\n node = l[i-1]\n\nprint(ans)", "code2": "import sys\nN = int(input())\nA = list(map(int, input().split()))\n\nl = []\n\nif N == 0:\n if A[0] != 1:\n print(-1)\n exit()\n\ntemp = 1\nfor i in range(N+1):\n l.append(temp-A[i])\n temp = (temp-A[i])*2\n\nfor i in range(N+1):\n if l[i] < 0:\n print(-1)\n sys.exit()\n\n\n\nans = 1\nnode = 0\nfor i in range(N, 0, -1):\n if l[i-1] >= node + A[i]:\n node += A[i]\n ans += node\n else:\n ans += node + A[i]\n node = l[i-1]\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590893683", "date2": "1590895368", "bleu_score": "0.9253462797109457", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 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, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 31, "total_score": 101, "input": "4\n-4 -1 0 1 17\n", "actual_output": "-1\n", "expected_output": "64\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n N = int(input())\n A = list(map(int, input().split()))\n \n l = []\n \n-if A[0] != 0:\n- print(-1)\n- sys.exit()\n-\n-for i in range(N):\n- if A[i] > A[i+1]+1:\n+if N == 0:\n+ if A[0] != 1:\n print(-1)\n- sys.exit()\n+ exit()\n \n temp = 1\n for i in range(N+1):\n l.append(temp-A[i])\n temp = (temp-A[i])*2\n \n+for i in range(N+1):\n+ if l[i] < 0:\n+ print(-1)\n+ sys.exit()\n+\n+\n+\n ans = 1\n node = 0\n for i in range(N, 0, -1):\n if l[i-1] >= node + A[i]:\n node += A[i]\n ans += node\n else:\n ans += node + A[i]\n node = l[i-1]\n \n print(ans)\n", "FL_content": " import sys\n N = int(input())\n A = list(map(int, input().split()))\n \n l = []\n \n-if A[0] != 0:\n- print(-1)\n- sys.exit()\n-\n-for i in range(N):\n- if A[i] > A[i+1]+1:\n print(-1)\n- sys.exit()\n \n temp = 1\n for i in range(N+1):\n l.append(temp-A[i])\n temp = (temp-A[i])*2\n \n ans = 1\n node = 0\n for i in range(N, 0, -1):\n if l[i-1] >= node + A[i]:\n node += A[i]\n ans += node\n else:\n ans += node + A[i]\n node = l[i-1]\n \n print(ans)\n", "added_lines": 10, "removed_lines": 7, "code1_lines": 31 }, { "user_id": "u994988729", "problem_id": "p02665", "submission1_id": "s489060775", "submission2_id": "s474063211", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\n\nleaf = []\nmiki = []\nunder = 1\n\nfor i, a in enumerate(A):\n can = 2 ** i\n if a > can or under == 0:\n print(-1)\n exit()\n miki.append(under - a)\n under = miki[-1] * 2\n\n\nans = 0\nchild = 0\nfor i in reversed(range(N + 1)):\n child = min(child, miki[i]) + A[i]\n ans += child\n\nprint(ans)", "code2": "N = int(input())\nA = list(map(int, input().split()))\n\nif N == 0:\n if A[0] != 1:\n print(-1)\n else:\n print(1)\n exit()\n\n\nleaf = []\nmiki = []\nunder = 1\n\nfor i, a in enumerate(A):\n if a > under:\n print(-1)\n exit()\n miki.append(under - a)\n under = miki[-1] * 2\n\n\nans = 0\nchild = 0\nfor i in reversed(range(N + 1)):\n child = min(child, miki[i]) + A[i]\n ans += child\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590888572", "date2": "1590889765", "bleu_score": "0.8144083010682012", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 67, "total_score": 101, "input": "4\n-1 0 -1 2 19\n", "actual_output": "-1\n", "expected_output": "50\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n \n+if N == 0:\n+ if A[0] != 1:\n+ print(-1)\n+ else:\n+ print(1)\n+ exit()\n+\n+\n leaf = []\n miki = []\n under = 1\n \n for i, a in enumerate(A):\n- can = 2 ** i\n- if a > can or under == 0:\n+ if a > under:\n print(-1)\n exit()\n miki.append(under - a)\n under = miki[-1] * 2\n \n \n ans = 0\n child = 0\n for i in reversed(range(N + 1)):\n child = min(child, miki[i]) + A[i]\n ans += child\n \n print(ans)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n \n leaf = []\n miki = []\n under = 1\n \n for i, a in enumerate(A):\n- can = 2 ** i\n- if a > can or under == 0:\n print(-1)\n exit()\n miki.append(under - a)\n under = miki[-1] * 2\n \n \n ans = 0\n child = 0\n for i in reversed(range(N + 1)):\n child = min(child, miki[i]) + A[i]\n ans += child\n \n print(ans)\n", "added_lines": 9, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u076245995", "problem_id": "p02665", "submission1_id": "s539980600", "submission2_id": "s141272349", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\ns = [0] * (N + 2)\nfor i in range(N + 1):\n s[i + 1] = s[i] + A[i]\nnode, leaf = 1, 1\nfor d in range(1, N + 1):\n if leaf < A[d]:\n print(-1)\n break\n leaf = min((leaf - A[d - 1]) * 2, s[N + 1] - s[d])\n if leaf < A[d]:\n print(-1)\n break\n node += leaf\nelse:\n print(node)", "code2": "N = int(input())\nA_leaf = list(map(int, input().split()))\nif N == 0:\n print(1 if A_leaf[0] == 1 else -1)\n exit()\ns = [0]*(N+2)\nfor i in range(1, N+2):\n s[i] = s[i-1] + A_leaf[i-1]\nnode = [1]*(N+1)\nfor i in range(1, N+1):\n node[i] = min((node[i-1] - A_leaf[i-1])*2, s[N+1]-s[i])\n if node[i] < A_leaf[i]:\n print(-1)\n exit()\nelse:\n print(sum(node))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590937905", "date2": "1590943610", "bleu_score": "0.6573148671368947", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 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, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 76, "total_score": 101, "input": "4\n-1 0 -1 3 22\n", "actual_output": "-1\n", "expected_output": "53\n\n", "anno_code": ["N = int(input()) # (0): N=4\nA = list(map(int, input().split())) # (1): A=[-1, 0, -1, 3, 22]\ns = [0] * (N + 2) # (2): s=[0, 0, 0, 0, 0, 0]\nfor i in range(N + 1): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n s[i + 1] = s[i] + A[i] # (4): s=[0, -1, 0, 0, 0, 0] (6): s=[0, -1, -1, 0, 0, 0] ... (12): s=[0, -1, -1, -2, 1, 23]\nnode, leaf = 1, 1 # (14): node=1, leaf=1\nfor d in range(1, N + 1): # (15): d=1 (20): d=2 ... (30): d=4\n if leaf < A[d]: # (16): NO CHANGE (21): NO CHANGE ... (31): NO CHANGE\n print(-1) # (32): NO CHANGE\n break\n leaf = min((leaf - A[d - 1]) * 2, s[N + 1] - s[d]) # (17): leaf=4 (22): leaf=8 (27): leaf=18\n if leaf < A[d]: # (18): NO CHANGE (23): NO CHANGE (28): NO CHANGE\n print(-1)\n break\n node += leaf # (19): node=5 (24): node=13 (29): node=31\nelse:\n print(node)"], "anno_status": [true], "diff_content": " N = int(input())\n-A = list(map(int, input().split()))\n-s = [0] * (N + 2)\n-for i in range(N + 1):\n- s[i + 1] = s[i] + A[i]\n-node, leaf = 1, 1\n-for d in range(1, N + 1):\n- if leaf < A[d]:\n+A_leaf = list(map(int, input().split()))\n+if N == 0:\n+ print(1 if A_leaf[0] == 1 else -1)\n+ exit()\n+s = [0]*(N+2)\n+for i in range(1, N+2):\n+ s[i] = s[i-1] + A_leaf[i-1]\n+node = [1]*(N+1)\n+for i in range(1, N+1):\n+ node[i] = min((node[i-1] - A_leaf[i-1])*2, s[N+1]-s[i])\n+ if node[i] < A_leaf[i]:\n print(-1)\n- break\n- leaf = min((leaf - A[d - 1]) * 2, s[N + 1] - s[d])\n- if leaf < A[d]:\n- print(-1)\n- break\n- node += leaf\n+ exit()\n else:\n- print(node)\n+ print(sum(node))\n", "FL_content": " N = int(input())\n-A = list(map(int, input().split()))\n-s = [0] * (N + 2)\n-for i in range(N + 1):\n- s[i + 1] = s[i] + A[i]\n-node, leaf = 1, 1\n-for d in range(1, N + 1):\n- if leaf < A[d]:\n print(-1)\n- break\n- leaf = min((leaf - A[d - 1]) * 2, s[N + 1] - s[d])\n- if leaf < A[d]:\n- print(-1)\n- break\n- node += leaf\n else:\n- print(node)\n", "added_lines": 13, "removed_lines": 14, "code1_lines": 17 }, { "user_id": "u076245995", "problem_id": "p02665", "submission1_id": "s883166910", "submission2_id": "s141272349", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA_leaf = list(map(int, input().split()))\ns = [0]*(N+2)\nfor i in range(1, N+2):\n s[i] = s[i-1] + A_leaf[i-1]\nnode = [1]*(N+1)\nfor i in range(1, N+1):\n node[i] = min(node[i-1] - A_leaf[i-1], (s[N+1]-s[i]) / 2)*2\n if node[i] <= 0:\n print(-1)\n break\nelse:\n print(int(sum(node)))", "code2": "N = int(input())\nA_leaf = list(map(int, input().split()))\nif N == 0:\n print(1 if A_leaf[0] == 1 else -1)\n exit()\ns = [0]*(N+2)\nfor i in range(1, N+2):\n s[i] = s[i-1] + A_leaf[i-1]\nnode = [1]*(N+1)\nfor i in range(1, N+1):\n node[i] = min((node[i-1] - A_leaf[i-1])*2, s[N+1]-s[i])\n if node[i] < A_leaf[i]:\n print(-1)\n exit()\nelse:\n print(sum(node))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590942633", "date2": "1590943610", "bleu_score": "0.7856151207374289", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 101, "input": "3\n0 1 -1 1\n", "actual_output": "-1\n", "expected_output": "3\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA_leaf = list(map(int, input().split())) # (1): A_leaf=[0, 1, -1, 1]\ns = [0]*(N+2) # (2): s=[0, 0, 0, 0, 0]\nfor i in range(1, N+2): # (3): i=1 (5): i=2 ... (11): NO CHANGE\n s[i] = s[i-1] + A_leaf[i-1] # (4): NO CHANGE (6): s=[0, 0, 1, 0, 0] ... (10): s=[0, 0, 1, 0, 1]\nnode = [1]*(N+1) # (12): node=[1, 1, 1, 1]\nfor i in range(1, N+1): # (13): i=1 (16): i=2\n node[i] = min(node[i-1] - A_leaf[i-1], (s[N+1]-s[i]) / 2)*2 # (14): NO CHANGE (17): node=[1, 1.0, 0.0, 1]\n if node[i] <= 0: # (15): NO CHANGE (18): NO CHANGE\n print(-1) # (19): NO CHANGE\n break\nelse:\n print(int(sum(node)))"], "anno_status": [true], "diff_content": " N = int(input())\n A_leaf = list(map(int, input().split()))\n+if N == 0:\n+ print(1 if A_leaf[0] == 1 else -1)\n+ exit()\n s = [0]*(N+2)\n for i in range(1, N+2):\n s[i] = s[i-1] + A_leaf[i-1]\n node = [1]*(N+1)\n for i in range(1, N+1):\n- node[i] = min(node[i-1] - A_leaf[i-1], (s[N+1]-s[i]) / 2)*2\n- if node[i] <= 0:\n+ node[i] = min((node[i-1] - A_leaf[i-1])*2, s[N+1]-s[i])\n+ if node[i] < A_leaf[i]:\n print(-1)\n- break\n+ exit()\n else:\n- print(int(sum(node)))\n+ print(sum(node))\n", "FL_content": " N = int(input())\n A_leaf = list(map(int, input().split()))\n s = [0]*(N+2)\n for i in range(1, N+2):\n s[i] = s[i-1] + A_leaf[i-1]\n node = [1]*(N+1)\n for i in range(1, N+1):\n- node[i] = min(node[i-1] - A_leaf[i-1], (s[N+1]-s[i]) / 2)*2\n- if node[i] <= 0:\n print(-1)\n- break\n else:\n- print(int(sum(node)))\n", "added_lines": 7, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u528470578", "problem_id": "p02665", "submission1_id": "s914957160", "submission2_id": "s348945679", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\nans, cnt, node = 0, sum(a), 1\nfor i in range(n + 1):\n ans += node\n if node <= 0:\n print(-1)\n break\n cnt -= a[i]\n node = min(cnt, (node - a[i]) * 2)\nelse:\n print(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n\nans, cnt, node = 0, sum(a), 1\nfor i in range(n + 1):\n ans += node\n cnt -= a[i]\n node = min(cnt, (node - a[i]) * 2)\n if node < 0:\n print(-1)\n break\nelse:\n print(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1590896289", "date2": "1590896330", "bleu_score": "0.9837418195131997", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 101, "input": "3\n0 1 -1 1\n", "actual_output": "-1\n", "expected_output": "3\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(map(int, input().split())) # (1): a=[0, 1, -1, 1]\n\nans, cnt, node = 0, sum(a), 1 # (2): ans=0, cnt=1, node=1\nfor i in range(n + 1): # (3): i=0 (8): i=1 (13): i=2\n ans += node # (4): ans=1 (9): ans=2 (14): NO CHANGE\n if node <= 0: # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n print(-1) # (16): NO CHANGE\n break\n cnt -= a[i] # (6): NO CHANGE (11): cnt=0\n node = min(cnt, (node - a[i]) * 2) # (7): NO CHANGE (12): node=0\nelse:\n print(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n ans, cnt, node = 0, sum(a), 1\n for i in range(n + 1):\n ans += node\n- if node <= 0:\n- print(-1)\n- break\n cnt -= a[i]\n node = min(cnt, (node - a[i]) * 2)\n+ if node < 0:\n+ print(-1)\n+ break\n else:\n print(ans)\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n \n ans, cnt, node = 0, sum(a), 1\n for i in range(n + 1):\n ans += node\n- if node <= 0:\n- print(-1)\n- break\n cnt -= a[i]\n node = min(cnt, (node - a[i]) * 2)\n else:\n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u550943777", "problem_id": "p02665", "submission1_id": "s389169550", "submission2_id": "s655529829", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\narr = list(map(int,input().split()))\nans = [0]*(n+1)\nans[0] = 1\nc_sum = [0]*(n+1)\nc_sum[0] = arr[0]\nfor i in range(1,n+1):\n c_sum[i] = c_sum[i-1] + arr[i]\nroot = [0]*(n+1)\nroot[0] = arr[0]\nfor d in range(n+1):\n if d==0:\n ans[d] = min(1-arr[0],c_sum[-1])\n else:\n ans[d] = min(root[d-1]*2,(c_sum[-1] - c_sum[d-1]))\n if ans[d] < 0:\n print(-1)\n exit()\n root[d] = ans[d] - arr[d]\nprint(sum(ans))\n\n\n", "code2": "n = int(input())\narr = list(map(int,input().split()))\nans = [0]*(n+1)\nans[0] = 1\nc_sum = [0]*(n+1)\nc_sum[0] = arr[0]\nfor i in range(1,n+1):\n c_sum[i] = c_sum[i-1] + arr[i]\nroot = [0]*(n+1)\nfor d in range(n+1):\n if d==0:\n ans[d] = min(1,c_sum[-1])\n else:\n ans[d] = min(root[d-1]*2,(c_sum[-1] - c_sum[d-1]))\n root[d] = ans[d] - arr[d]\n if root[d] < 0:\n print(-1)\n exit()\nprint(sum(ans))\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590895974", "date2": "1590897617", "bleu_score": "0.9345334813290455", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 45, "total_score": 101, "input": "4\n-2 1 -1 2 28\n", "actual_output": "89\n", "expected_output": "67\n\n", "anno_code": ["n = int(input()) # (0): n=4\narr = list(map(int,input().split())) # (1): arr=[-2, 1, -1, 2, 28]\nans = [0]*(n+1) # (2): ans=[0, 0, 0, 0, 0]\nans[0] = 1 # (3): ans=[1, 0, 0, 0, 0]\nc_sum = [0]*(n+1) # (4): c_sum=[0, 0, 0, 0, 0]\nc_sum[0] = arr[0] # (5): c_sum=[-2, 0, 0, 0, 0]\nfor i in range(1,n+1): # (6): i=1 (8): i=2 ... (14): NO CHANGE\n c_sum[i] = c_sum[i-1] + arr[i] # (7): c_sum=[-2, -1, 0, 0, 0] (9): c_sum=[-2, -1, -2, 0, 0] ... (13): c_sum=[-2, -1, -2, 0, 28]\nroot = [0]*(n+1) # (15): root=[0, 0, 0, 0, 0]\nroot[0] = arr[0] # (16): root=[-2, 0, 0, 0, 0]\nfor d in range(n+1): # (17): d=0 (22): d=1 ... (42): NO CHANGE\n if d==0: # (18): NO CHANGE (23): NO CHANGE ... (38): NO CHANGE\n ans[d] = min(1-arr[0],c_sum[-1]) # (19): ans=[3, 0, 0, 0, 0]\n else:\n ans[d] = min(root[d-1]*2,(c_sum[-1] - c_sum[d-1])) # (24): ans=[3, 10, 0, 0, 0] (29): ans=[3, 10, 18, 0, 0] ... (39): ans=[3, 10, 18, 30, 28]\n if ans[d] < 0: # (20): NO CHANGE (25): NO CHANGE ... (40): NO CHANGE\n print(-1)\n exit()\n root[d] = ans[d] - arr[d] # (21): root=[5, 0, 0, 0, 0] (26): root=[5, 9, 0, 0, 0] ... (41): NO CHANGE\nprint(sum(ans))\n\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n arr = list(map(int,input().split()))\n ans = [0]*(n+1)\n ans[0] = 1\n c_sum = [0]*(n+1)\n c_sum[0] = arr[0]\n for i in range(1,n+1):\n c_sum[i] = c_sum[i-1] + arr[i]\n root = [0]*(n+1)\n-root[0] = arr[0]\n for d in range(n+1):\n if d==0:\n- ans[d] = min(1-arr[0],c_sum[-1])\n+ ans[d] = min(1,c_sum[-1])\n else:\n ans[d] = min(root[d-1]*2,(c_sum[-1] - c_sum[d-1]))\n- if ans[d] < 0:\n+ root[d] = ans[d] - arr[d]\n+ if root[d] < 0:\n print(-1)\n exit()\n- root[d] = ans[d] - arr[d]\n print(sum(ans))\n \n \n \n", "FL_content": " n = int(input())\n arr = list(map(int,input().split()))\n ans = [0]*(n+1)\n ans[0] = 1\n c_sum = [0]*(n+1)\n c_sum[0] = arr[0]\n for i in range(1,n+1):\n c_sum[i] = c_sum[i-1] + arr[i]\n root = [0]*(n+1)\n-root[0] = arr[0]\n for d in range(n+1):\n if d==0:\n- ans[d] = min(1-arr[0],c_sum[-1])\n else:\n ans[d] = min(root[d-1]*2,(c_sum[-1] - c_sum[d-1]))\n- if ans[d] < 0:\n print(-1)\n exit()\n- root[d] = ans[d] - arr[d]\n print(sum(ans))\n \n \n \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 23 }, { "user_id": "u368796742", "problem_id": "p02665", "submission1_id": "s285868944", "submission2_id": "s932420505", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\nans = 0\n\nl = [0]*(n+1)\nl[-1] = a[-1]\nfor i in range(n-1,-1,-1):\n l[i] += l[i+1]+a[i]\n\nif a[0] == 1:\n if n > 0:\n print(-1)\n exit()\n else:\n print(1)\n exit()\nb = 2\nans = 1\nfor i in range(1,n+1):\n if b*2 < a[i]:\n print(-1)\n exit()\n else:\n if i == n:\n ans += a[-1]\n else:\n b = (b-a[i])*2\n ans += min(b,l[i+1])\n\nprint(ans)\n\n", "code2": "n = int(input())\na = list(map(int,input().split()))\nans = 0\n\nl = [0]*(n+1)\nl[-1] = a[-1]\nfor i in range(n-1,-1,-1):\n l[i] += l[i+1]+a[i]\n\nif a[0] == 1:\n if n > 0:\n print(-1)\n exit()\n else:\n print(1)\n exit()\nb = 1\nans = 0\nfor i in range(n+1):\n if b < a[i]:\n print(-1)\n exit()\n else: \n b = min(b,l[i])\n ans += b\n b = (b-a[i])*2 \nprint(ans)\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590896386", "date2": "1590928784", "bleu_score": "0.8371173175470693", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 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, 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, 1, 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, 0, 1], "code1_test_score": 18, "total_score": 101, "input": "10\n0 -1 1 1 3 4 4 5 13 9 34\n", "actual_output": "345\n", "expected_output": "313\n\n", "anno_code": ["n = int(input()) # (0): n=10\na = list(map(int,input().split())) # (1): a=[0, -1, 1, 1, 3, 4, 4, 5, 13, 9, 34]\nans = 0 # (2): ans=0\n\nl = [0]*(n+1) # (3): l=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nl[-1] = a[-1] # (4): l=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 34]\nfor i in range(n-1,-1,-1): # (5): i=9 (7): i=8 ... (25): NO CHANGE\n l[i] += l[i+1]+a[i] # (6): l=[0, 0, 0, 0, 0, 0, 0, 0, 0, 43, 34] (8): l=[0, 0, 0, 0, 0, 0, 0, 0, 56, 43, 34] ... (24): l=[73, 73, 74, 73, 72, 69, 65, 61, 56, 43, 34]\n\nif a[0] == 1: # (26): NO CHANGE\n if n > 0:\n print(-1)\n exit()\n else:\n print(1)\n exit()\nb = 2 # (27): b=2\nans = 1 # (28): ans=1\nfor i in range(1,n+1): # (29): i=1 (34): i=2 ... (78): NO CHANGE\n if b*2 < a[i]: # (30): NO CHANGE (35): NO CHANGE ... (75): NO CHANGE\n print(-1)\n exit()\n else:\n if i == n: # (31): NO CHANGE (36): NO CHANGE ... (76): NO CHANGE\n ans += a[-1] # (77): ans=345\n else:\n b = (b-a[i])*2 # (32): b=6 (37): b=10 ... (72): b=658\n ans += min(b,l[i+1]) # (33): ans=7 (38): ans=17 ... (73): ans=311\n\nprint(ans)\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n ans = 0\n \n l = [0]*(n+1)\n l[-1] = a[-1]\n for i in range(n-1,-1,-1):\n l[i] += l[i+1]+a[i]\n \n if a[0] == 1:\n if n > 0:\n print(-1)\n exit()\n else:\n print(1)\n exit()\n-b = 2\n-ans = 1\n-for i in range(1,n+1):\n- if b*2 < a[i]:\n+b = 1\n+ans = 0\n+for i in range(n+1):\n+ if b < a[i]:\n print(-1)\n exit()\n- else:\n- if i == n:\n- ans += a[-1]\n- else:\n- b = (b-a[i])*2\n- ans += min(b,l[i+1])\n-\n+ else: \n+ b = min(b,l[i])\n+ ans += b\n+ b = (b-a[i])*2 \n print(ans)\n \n \n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n ans = 0\n \n l = [0]*(n+1)\n l[-1] = a[-1]\n for i in range(n-1,-1,-1):\n l[i] += l[i+1]+a[i]\n \n if a[0] == 1:\n if n > 0:\n print(-1)\n exit()\n else:\n print(1)\n exit()\n-b = 2\n-ans = 1\n-for i in range(1,n+1):\n- if b*2 < a[i]:\n print(-1)\n exit()\n- else:\n- if i == n:\n- ans += a[-1]\n- else:\n- b = (b-a[i])*2\n- ans += min(b,l[i+1])\n-\n print(ans)\n \n \n", "added_lines": 8, "removed_lines": 11, "code1_lines": 32 }, { "user_id": "u038724782", "problem_id": "p02665", "submission1_id": "s155098193", "submission2_id": "s345630544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na_l = list(map(int,input().split()))\n\nif a_l[0] != 0:\n if n == 0:\n print(1)\n else:\n print(-1)\n exit()\n\ntree = [0]*(n+1)\ntree[0] = 1\nfor i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n\n\nif tree[-1] < a_l[-1]:\n print(-1)\n exit()\n\n\ntree[-1] = a_l[-1]\nfor i in range(2,n+2):\n \n if tree[-i] == tree[-(i-1)] + a_l[-i]:\n break\n else:\n tree[-i] = min(tree[-i], tree[-(i-1)] + a_l[-i])\n \n\n\n\n\n\n\n\n\n\n\n\n\nans = 0\nfor val in tree:\n ans += val\nprint(ans)", "code2": "n = int(input())\na_l = list(map(int,input().split()))\n\n\n\n\n\n\n\n\ntree = [0]*(n+1)\ntree[0] = 1\nfor i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n\n\nif tree[-1] < a_l[-1]:\n print(-1)\n exit()\n\n\ntree[-1] = a_l[-1]\nfor i in range(2,n+2):\n \n if tree[-i] == tree[-(i-1)] + a_l[-i]:\n break\n else:\n tree[-i] = min(tree[-i], tree[-(i-1)] + a_l[-i])\n \n\n\n\n\n\n\n\n\n\n\n\n\nans = 0\nfor val in tree:\n ans += val\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590890584", "date2": "1590890941", "bleu_score": "0.8236808816856849", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 46, "total_score": 101, "input": "4\n-1 0 -1 2 5\n", "actual_output": "-1\n", "expected_output": "23\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())\n a_l = list(map(int,input().split()))\n \n-if a_l[0] != 0:\n- if n == 0:\n- print(1)\n- else:\n- print(-1)\n- exit()\n+\n+\n+\n+\n+\n+\n \n tree = [0]*(n+1)\n tree[0] = 1\n for i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n \n \n if tree[-1] < a_l[-1]:\n print(-1)\n exit()\n \n \n tree[-1] = a_l[-1]\n for i in range(2,n+2):\n \n if tree[-i] == tree[-(i-1)] + a_l[-i]:\n break\n else:\n tree[-i] = min(tree[-i], tree[-(i-1)] + a_l[-i])\n \n \n \n \n \n \n \n \n \n \n \n \n \n ans = 0\n for val in tree:\n ans += val\n print(ans)\n", "FL_content": " n = int(input())\n a_l = list(map(int,input().split()))\n \n-if a_l[0] != 0:\n- if n == 0:\n- print(1)\n- else:\n- print(-1)\n- exit()\n \n tree = [0]*(n+1)\n tree[0] = 1\n for i in range(1,n+1):\n tree[i] = (tree[i-1] - a_l[i-1]) * 2\n \n \n if tree[-1] < a_l[-1]:\n print(-1)\n exit()\n \n \n tree[-1] = a_l[-1]\n for i in range(2,n+2):\n \n if tree[-i] == tree[-(i-1)] + a_l[-i]:\n break\n else:\n tree[-i] = min(tree[-i], tree[-(i-1)] + a_l[-i])\n \n \n \n \n \n \n \n \n \n \n \n \n \n ans = 0\n for val in tree:\n ans += val\n print(ans)\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 45 }, { "user_id": "u540799318", "problem_id": "p02665", "submission1_id": "s589490096", "submission2_id": "s873501593", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom math import factorial\nfrom collections import Counter\nfrom fractions import Fraction\nimport heapq, bisect, fractions\nimport math\nimport itertools\nsys.setrecursionlimit(10 ** 5 + 10)\nINF = 10**15 +5\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()))\nMOD = 10**9 + 7\n\nn = INT()\na = LIST()\nif a[0]>0:\n print(1)\n sys.exit()\nc = [1]*(n+1)\nfor i in range(1, n+1):\n c[i] = (c[i-1]-a[i-1])*2\nif a[n]>c[n]:\n print(-1)\n sys.exit()\nb = [0]*(n+1)\nres = [0]*(n+1)\nb[n] = a[n]\nres[n] = a[n]\nfor i in range(n-1, -1, -1):\n if (c[i]-a[i])*2 c[n]:\n print(-1)\n sys.exit()\nb = [0]*(n+1)\nres = [0]*(n+1)\nb[n] = a[n]\nres[n] = a[n]\nfor i in range(n-1, -1, -1):\n if (c[i]-a[i])*2 0:\n- print(1)\n- sys.exit()\n+\n c = [1]*(n+1)\n for i in range(1, n+1):\n c[i] = (c[i-1]-a[i-1])*2\n if a[n]>c[n]:\n print(-1)\n sys.exit()\n b = [0]*(n+1)\n res = [0]*(n+1)\n b[n] = a[n]\n res[n] = a[n]\n for i in range(n-1, -1, -1):\n if (c[i]-a[i])*2 0:\n- print(1)\n- sys.exit()\n c = [1]*(n+1)\n for i in range(1, n+1):\n c[i] = (c[i-1]-a[i-1])*2\n if a[n]>c[n]:\n print(-1)\n sys.exit()\n b = [0]*(n+1)\n res = [0]*(n+1)\n b[n] = a[n]\n res[n] = a[n]\n for i in range(n-1, -1, -1):\n if (c[i]-a[i])*2 A[i+1]:\n root = last + A[i]\n elif root > (last + A[i+1])*2:\n root = (last + A[i+1])*2\n count+=root\n root = (root-A[i])*2\n if root < A[i+1]:\n print(-1)\n break\nelse:\n print(count)\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\nsa = sum(A)\nlast = A[-1]\ncount = last\nroot = 1\nfor i in range(N):\n sa -= A[i]\n if root <= A[i]:\n print(-1)\n break\n elif root-A[i] > sa:\n root = sa + A[i]\n count+=root\n root = (root-A[i])*2\nelse:\n if count == 0 or root < last:\n count = -1\n print(count)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590894841", "date2": "1590900157", "bleu_score": "0.8053562855219336", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 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, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 67, "total_score": 101, "input": "10\n0 0 1 0 3 3 5 8 13 23 34\n", "actual_output": "298\n", "expected_output": "284\n\n", "anno_code": ["N = int(input()) # (0): N=10\nA = list(map(int, input().split())) # (1): A=[0, 0, 1, 0, 3, 3, 5, 8, 13, 23, 34]\nlast = A[-1] # (2): last=34\ncount = last # (3): count=34\nroot = 1 # (4): root=1\nfor i in range(N): # (5): i=0 (11): i=1 ... (65): NO CHANGE\n if i+1 == N and root > A[i+1]: # (6): NO CHANGE (12): NO CHANGE ... (60): NO CHANGE\n root = last + A[i] # (61): root=57\n elif root > (last + A[i+1])*2: # (7): NO CHANGE (13): NO CHANGE ... (55): NO CHANGE\n root = (last + A[i+1])*2\n count+=root # (8): count=35 (14): count=37 ... (62): count=298\n root = (root-A[i])*2 # (9): root=2 (15): root=4 ... (63): root=68\n if root < A[i+1]: # (10): NO CHANGE (16): NO CHANGE ... (64): NO CHANGE\n print(-1)\n break\nelse:\n print(count)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n+sa = sum(A)\n last = A[-1]\n count = last\n root = 1\n for i in range(N):\n- if i+1 == N and root > A[i+1]:\n- root = last + A[i]\n- elif root > (last + A[i+1])*2:\n- root = (last + A[i+1])*2\n- count+=root\n- root = (root-A[i])*2\n- if root < A[i+1]:\n+ sa -= A[i]\n+ if root <= A[i]:\n print(-1)\n break\n+ elif root-A[i] > sa:\n+ root = sa + A[i]\n+ count+=root\n+ root = (root-A[i])*2\n else:\n+ if count == 0 or root < last:\n+ count = -1\n print(count)\n \n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n last = A[-1]\n count = last\n root = 1\n for i in range(N):\n- if i+1 == N and root > A[i+1]:\n- root = last + A[i]\n- elif root > (last + A[i+1])*2:\n- root = (last + A[i+1])*2\n- count+=root\n- root = (root-A[i])*2\n- if root < A[i+1]:\n print(-1)\n break\n else:\n print(count)\n \n", "added_lines": 9, "removed_lines": 7, "code1_lines": 18 }, { "user_id": "u583285098", "problem_id": "p02665", "submission1_id": "s431028962", "submission2_id": "s146459427", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nlast = A[-1]\ncount = last\nroot = 1\nfor i in range(N):\n if root > last + A[i]:\n root = last + A[i]\n count+=root\n root = (root-A[i])*2\n if root < A[i+1]:\n print(-1)\n break\nelse:\n print(count)", "code2": "N = int(input())\nA = list(map(int, input().split()))\nsa = sum(A)\nlast = A[-1]\ncount = last\nroot = 1\nfor i in range(N):\n sa -= A[i]\n if root <= A[i]:\n print(-1)\n break\n elif root-A[i] > sa:\n root = sa + A[i]\n count+=root\n root = (root-A[i])*2\nelse:\n if count == 0 or root < last:\n count = -1\n print(count)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590893929", "date2": "1590900157", "bleu_score": "0.7410351523604264", "code1_test_status": [1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 64, "total_score": 101, "input": "10\n0 0 1 -1 5 6 5 9 13 23 34\n", "actual_output": "245\n", "expected_output": "256\n\n", "anno_code": ["N = int(input()) # (0): N=10\nA = list(map(int, input().split())) # (1): A=[0, 0, 1, -1, 5, 6, 5, 9, 13, 23, 34]\nlast = A[-1] # (2): last=34\ncount = last # (3): count=34\nroot = 1 # (4): root=1\nfor i in range(N): # (5): i=0 (10): i=1 ... (57): NO CHANGE\n if root > last + A[i]: # (6): NO CHANGE (11): NO CHANGE ... (52): NO CHANGE\n root = last + A[i] # (47): root=47 (53): root=57\n count+=root # (7): count=35 (12): count=37 ... (54): count=245\n root = (root-A[i])*2 # (8): root=2 (13): root=4 ... (55): root=68\n if root < A[i+1]: # (9): NO CHANGE (14): NO CHANGE ... (56): NO CHANGE\n print(-1)\n break\nelse:\n print(count)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n+sa = sum(A)\n last = A[-1]\n count = last\n root = 1\n for i in range(N):\n- if root > last + A[i]:\n- root = last + A[i]\n- count+=root\n- root = (root-A[i])*2\n- if root < A[i+1]:\n+ sa -= A[i]\n+ if root <= A[i]:\n print(-1)\n break\n+ elif root-A[i] > sa:\n+ root = sa + A[i]\n+ count+=root\n+ root = (root-A[i])*2\n else:\n+ if count == 0 or root < last:\n+ count = -1\n print(count)\n+\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n last = A[-1]\n count = last\n root = 1\n for i in range(N):\n- if root > last + A[i]:\n- root = last + A[i]\n- count+=root\n- root = (root-A[i])*2\n- if root < A[i+1]:\n print(-1)\n break\n else:\n print(count)\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 15 }, { "user_id": "u270343876", "problem_id": "p02665", "submission1_id": "s305478809", "submission2_id": "s606258536", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())+1\na = list(map(int, input().split()))\nm_node = [1]*n\nnode = 0\ntotal = 0\n\nif n == 1:\n if a[0] != 1:\n print(\"-1\", end=\"\")\n exit()\n else:\n print(\"1\", end=\"\")\n exit()\n\nfor i in range(1, n):\n m_node[i] = (m_node[i-1] - a[i-1])*2\n if m_node[i] <= 0:\n print(\"-1\", end=\"\")\n exit()\nfor i in reversed(range(n)):\n if a[i] >= m_node[i]:\n print(\"-1\", end=\"\")\n exit()\n node = min((node+a[i]), m_node[i])\n total += node\n\nprint(total, end=\"\")", "code2": "n = int(input())+1\na = list(map(int, input().split()))\nm_node = [1]*n\nnode = 0\ntotal = 0\n\nif n == 1:\n if a[0] != 1:\n print(\"-1\", end=\"\")\n exit()\n else:\n print(\"1\", end=\"\")\n exit()\n\nfor i in range(1, n):\n m_node[i] = (m_node[i-1] - a[i-1])*2\n if m_node[i] <= 0:\n print(\"-1\", end=\"\")\n exit()\nfor i in reversed(range(n)):\n if a[i] > m_node[i]:\n print(\"-1\", end=\"\")\n exit()\n node = min((node+a[i]), m_node[i])\n total += node\n\nprint(total, end=\"\")\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1590893689", "date2": "1590893751", "bleu_score": "0.9951713685049894", "code1_test_status": [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, 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, 0], "code1_test_score": 97, "total_score": 101, "input": "3\n0 1 1 2\n", "actual_output": "-1", "expected_output": "7\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())+1\n a = list(map(int, input().split()))\n m_node = [1]*n\n node = 0\n total = 0\n \n if n == 1:\n if a[0] != 1:\n print(\"-1\", end=\"\")\n exit()\n else:\n print(\"1\", end=\"\")\n exit()\n \n for i in range(1, n):\n m_node[i] = (m_node[i-1] - a[i-1])*2\n if m_node[i] <= 0:\n print(\"-1\", end=\"\")\n exit()\n for i in reversed(range(n)):\n- if a[i] >= m_node[i]:\n+ if a[i] > m_node[i]:\n print(\"-1\", end=\"\")\n exit()\n node = min((node+a[i]), m_node[i])\n total += node\n \n print(total, end=\"\")\n+\n", "FL_content": " n = int(input())+1\n a = list(map(int, input().split()))\n m_node = [1]*n\n node = 0\n total = 0\n \n if n == 1:\n if a[0] != 1:\n print(\"-1\", end=\"\")\n exit()\n else:\n print(\"1\", end=\"\")\n exit()\n \n for i in range(1, n):\n m_node[i] = (m_node[i-1] - a[i-1])*2\n if m_node[i] <= 0:\n print(\"-1\", end=\"\")\n exit()\n for i in reversed(range(n)):\n- if a[i] >= m_node[i]:\n print(\"-1\", end=\"\")\n exit()\n node = min((node+a[i]), m_node[i])\n total += node\n \n print(total, end=\"\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u927282564", "problem_id": "p02665", "submission1_id": "s495879611", "submission2_id": "s512457060", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=list(map(int,input().split()))\ntemp=1\nsumm=0\ncont=0\ntemplist=[1]\nfor i in range(N+1):\n \n if A[i]templist[-(i+2)]:\n print(summ)\n break\n\n", "code2": "N=int(input())\nA=list(map(int,input().split()))\ntemp=1\nsumm=0\ncont=0\ntemplist=[1]\nfor i in range(N+1):\n \n if A[i]templist[-(i+2)]:\n print(summ)\n break\n if i==N-1:\n print(summ)\n break\n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590893634", "date2": "1590893728", "bleu_score": "0.916249630488969", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 101, "input": "3\n0 1 -1 1\n", "actual_output": "", "expected_output": "3\n\n", "anno_code": ["N=int(input()) # (0): N=3\nA=list(map(int,input().split())) # (1): A=[0, 1, -1, 1]\ntemp=1 # (2): temp=1\nsumm=0 # (3): summ=0\ncont=0 # (4): cont=0\ntemplist=[1] # (5): templist=[1]\nfor i in range(N+1): # (6): i=0 (12): i=1 ... (30): NO CHANGE\n \n if A[i]templist[-(i+2)]: # (37): NO CHANGE (41): NO CHANGE (45): NO CHANGE\n print(summ)\n break\n\n"], "anno_status": [true], "diff_content": " N=int(input())\n A=list(map(int,input().split()))\n temp=1\n summ=0\n cont=0\n templist=[1]\n for i in range(N+1):\n \n if A[i]templist[-(i+2)]:\n print(summ)\n break\n-\n-\n+ if i==N-1:\n+ print(summ)\n+ break\n+ \n", "FL_content": " N=int(input())\n A=list(map(int,input().split()))\n temp=1\n summ=0\n cont=0\n templist=[1]\n for i in range(N+1):\n \n if A[i]templist[-(i+2)]:\n print(summ)\n break\n-\n-\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 46 }, { "user_id": "u325149030", "problem_id": "p02665", "submission1_id": "s592655803", "submission2_id": "s046853745", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nB = [0] *(N+1)\nB[0] = 1\nans = 0\nfor i in range(1, N+1):\n B[i] = (B[i-1] - A[i-1])*2\n if B[i] <= 0:\n ans = -1\n break\nif ans == 0:\n check = 0\n for j in range(N, 0, -1):\n check += A[j]\n if check < B[j-1]:\n ans += check\n else:\n last = j\n for k in range(last+1):\n ans += B[k]\n break\nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\nB = [0] *(N+1)\nB[0] = 1\nans = 0\nfor i in range(1, N+1):\n B[i] = (B[i-1] - A[i-1])*2\n if B[i] <= 0:\n ans = -1\n break\nif B[N] < A[N]:\n ans = -1\nif ans == 0:\n check = 0\n for j in range(N, 0, -1):\n check += A[j]\n if check < B[j]:\n ans += check\n else:\n last = j\n for k in range(1, last+1):\n ans += B[k]\n break\n ans += 1\nif N == 0 and A[0] == 1:\n ans = 1\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590891180", "date2": "1590895704", "bleu_score": "0.8385062305622987", "code1_test_status": [0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 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, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 30, "total_score": 101, "input": "4\n0 0 -1 2 10\n", "actual_output": "33\n", "expected_output": "27\n\n", "anno_code": ["N = int(input()) # (0): N=4\nA = list(map(int, input().split())) # (1): A=[0, 0, -1, 2, 10]\nB = [0] *(N+1) # (2): B=[0, 0, 0, 0, 0]\nB[0] = 1 # (3): B=[1, 0, 0, 0, 0]\nans = 0 # (4): ans=0\nfor i in range(1, N+1): # (5): i=1 (8): i=2 ... (17): NO CHANGE\n B[i] = (B[i-1] - A[i-1])*2 # (6): B=[1, 2, 0, 0, 0] (9): B=[1, 2, 4, 0, 0] ... (15): B=[1, 2, 4, 10, 16]\n if B[i] <= 0: # (7): NO CHANGE (10): NO CHANGE ... (16): NO CHANGE\n ans = -1\n break\nif ans == 0: # (18): NO CHANGE\n check = 0 # (19): check=0\n for j in range(N, 0, -1): # (20): j=4\n check += A[j] # (21): check=10\n if check < B[j-1]: # (22): NO CHANGE\n ans += check\n else:\n last = j # (23): last=4\n for k in range(last+1): # (24): k=0 (26): k=1 ... (34): NO CHANGE\n ans += B[k] # (25): ans=1 (27): ans=3 ... (33): ans=33\n break # (35): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n B = [0] *(N+1)\n B[0] = 1\n ans = 0\n for i in range(1, N+1):\n B[i] = (B[i-1] - A[i-1])*2\n if B[i] <= 0:\n ans = -1\n break\n+if B[N] < A[N]:\n+ ans = -1\n if ans == 0:\n check = 0\n for j in range(N, 0, -1):\n check += A[j]\n- if check < B[j-1]:\n+ if check < B[j]:\n ans += check\n else:\n last = j\n- for k in range(last+1):\n+ for k in range(1, last+1):\n ans += B[k]\n break\n+ ans += 1\n+if N == 0 and A[0] == 1:\n+ ans = 1\n print(ans)\n \n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n B = [0] *(N+1)\n B[0] = 1\n ans = 0\n for i in range(1, N+1):\n B[i] = (B[i-1] - A[i-1])*2\n if B[i] <= 0:\n ans = -1\n break\n if ans == 0:\n check = 0\n for j in range(N, 0, -1):\n check += A[j]\n- if check < B[j-1]:\n ans += check\n else:\n last = j\n- for k in range(last+1):\n ans += B[k]\n break\n print(ans)\n \n", "added_lines": 7, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u254088063", "problem_id": "p02665", "submission1_id": "s465691989", "submission2_id": "s981251811", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nbottom = sum(A)\n\nif A[0] >= 2:\n print(-1)\nelse:\n print(1)\n\nexit()\nret = 1\nchildren = 1 - A[0]\nbottom -= A[0]\n \nfor i in range(N):\n children = children * 2 - A[i+1]\n if children <= -1:\n ret = -1\n break\n \n bottom -= A[i+1]\n if children >= bottom:\n children = bottom\n ret += children + A[i+1]\nprint(ret)\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\nbottom = sum(A)\n\nif A[0] >= 2:\n print(-1)\n exit()\n\nret = 1\nchildren = 1 - A[0]\nbottom -= A[0]\n \nfor i in range(N):\n children = children * 2 - A[i+1]\n if children <= -1:\n ret = -1\n break\n \n bottom -= A[i+1]\n if children >= bottom:\n children = bottom\n ret += children + A[i+1]\nprint(ret)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1590896614", "date2": "1590896842", "bleu_score": "0.9522471854363572", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 1, "total_score": 101, "input": "4\n0 1 -3 2 14\n", "actual_output": "1\n", "expected_output": "29\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n bottom = sum(A)\n \n if A[0] >= 2:\n print(-1)\n-else:\n- print(1)\n+ exit()\n \n-exit()\n ret = 1\n children = 1 - A[0]\n bottom -= A[0]\n \n for i in range(N):\n children = children * 2 - A[i+1]\n if children <= -1:\n ret = -1\n break\n \n bottom -= A[i+1]\n if children >= bottom:\n children = bottom\n ret += children + A[i+1]\n print(ret)\n \n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n bottom = sum(A)\n \n if A[0] >= 2:\n print(-1)\n-else:\n- print(1)\n \n-exit()\n ret = 1\n children = 1 - A[0]\n bottom -= A[0]\n \n for i in range(N):\n children = children * 2 - A[i+1]\n if children <= -1:\n ret = -1\n break\n \n bottom -= A[i+1]\n if children >= bottom:\n children = bottom\n ret += children + A[i+1]\n print(ret)\n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 26 }, { "user_id": "u883048396", "problem_id": "p03296", "submission1_id": "s851092520", "submission2_id": "s526380194", "status1": "Wrong Answer", "status2": "Accepted", "code1": "iN = int(input())\naS = [int(x) for x in input().rstrip().split()]\n\n\n\n\n\n\n\niCounter = 0\nif iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\nelse:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n if aS[i] < 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\nprint(iCounter)\n", "code2": "iN = int(input())\naS = [int(x) for x in input().rstrip().split()]\n\n\n\n\n\n\n\niCounter = 0\nif iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\nelse:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n if aS[i] < 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\n if aS[iN-2] == aS[iN-1] :\n iCounter += 1\nprint(iCounter)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536900665", "date2": "1536900926", "bleu_score": "0.9314434843264369", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 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, 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": 92, "total_score": 104, "input": "5\n1 2 9 2 2\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["iN = int(input()) # (0): iN=5\naS = [int(x) for x in input().rstrip().split()] # (1): aS=[1, 2, 9, 2, 2]\n\n\n\n\n\n\n\niCounter = 0 # (2): iCounter=0\nif iN == 2: # (3): NO CHANGE\n if aS[0] == aS[1]:\n iCounter += 1\nelse:\n for i in range(1,iN-1): # (4): i=1 (6): i=2 ... (10): NO CHANGE\n if aS[i] == aS[i-1]: # (5): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n if aS[i] == aS[i+1]:\n if aS[i] < 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\nprint(iCounter)\n"], "anno_status": [true], "diff_content": " iN = int(input())\n aS = [int(x) for x in input().rstrip().split()]\n \n \n \n \n \n \n \n iCounter = 0\n if iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\n else:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n if aS[i] < 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\n+ if aS[iN-2] == aS[iN-1] :\n+ iCounter += 1\n print(iCounter)\n \n", "FL_content": " iN = int(input())\n aS = [int(x) for x in input().rstrip().split()]\n \n \n \n \n \n \n \n iCounter = 0\n if iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\n else:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n if aS[i] < 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\n print(iCounter)\n \n", "added_lines": 2, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u384679440", "problem_id": "p03296", "submission1_id": "s351944973", "submission2_id": "s761441725", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = list(map(int, input().split()))\nans = 0\ncount = 1\nfor i in range(1, len(a)):\n\tif a[i] == a[i-1]:\n\t\tcount += 1\n\t\tif i == len(a) - 1 and count > 2:\n\t\t\tans += int(count / 2)\n\t\telif i == len(a) - 1 and count == 2:\n\t\t\tans += 1\n\telif a[i] != a[i-1] and count == 2:\n\t\tans += 1\n\t\tcount = 1\n\telif a[i] != a[i-1] and count > 2:\n\t\tans += count - 2\n\t\tcount = 1\nprint(ans)", "code2": "N = int(input())\na = list(map(int, input().split()))\nans = 0\ncount = 1\nfor i in range(1, len(a)):\n\tif a[i] == a[i-1]:\n\t\tcount += 1\n\t\tif i == len(a) - 1 and count > 2:\n\t\t\tans += int(count / 2)\n\t\telif i == len(a) - 1 and count == 2:\n\t\t\tans += 1\n\telif a[i] != a[i-1] and count == 2:\n\t\tans += 1\n\t\tcount = 1\n\telif a[i] != a[i-1] and count > 2:\n\t\tans += int(count / 2)\n\t\tcount = 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531619023", "date2": "1531619180", "bleu_score": "0.9732166465963902", "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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "14\n1 1 3 3 3 4 4 4 4 4 1 2 3 4\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["N = int(input()) # (0): N=14\na = list(map(int, input().split())) # (1): a=[1, 1, 3, 3, 3, 4, 4, 4, 4, 4, 1, 2, 3, 4]\nans = 0 # (2): ans=0\ncount = 1 # (3): count=1\nfor i in range(1, len(a)): # (4): i=1 (9): i=2 ... (68): NO CHANGE\n\tif a[i] == a[i-1]: # (5): NO CHANGE (10): NO CHANGE ... (65): NO CHANGE\n\t\tcount += 1 # (6): count=2 (16): count=2 ... (47): count=5\n\t\tif i == len(a) - 1 and count > 2: # (7): NO CHANGE (17): NO CHANGE ... (48): NO CHANGE\n\t\t\tans += int(count / 2)\n\t\telif i == len(a) - 1 and count == 2: # (8): NO CHANGE (18): NO CHANGE ... (49): NO CHANGE\n\t\t\tans += 1\n\telif a[i] != a[i-1] and count == 2: # (11): NO CHANGE (26): NO CHANGE ... (66): NO CHANGE\n\t\tans += 1 # (12): ans=1\n\t\tcount = 1 # (13): count=1\n\telif a[i] != a[i-1] and count > 2: # (27): NO CHANGE (53): NO CHANGE ... (67): NO CHANGE\n\t\tans += count - 2 # (28): ans=2 (54): ans=5\n\t\tcount = 1 # (29): count=1 (55): count=1\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n a = list(map(int, input().split()))\n ans = 0\n count = 1\n for i in range(1, len(a)):\n \tif a[i] == a[i-1]:\n \t\tcount += 1\n \t\tif i == len(a) - 1 and count > 2:\n \t\t\tans += int(count / 2)\n \t\telif i == len(a) - 1 and count == 2:\n \t\t\tans += 1\n \telif a[i] != a[i-1] and count == 2:\n \t\tans += 1\n \t\tcount = 1\n \telif a[i] != a[i-1] and count > 2:\n-\t\tans += count - 2\n+\t\tans += int(count / 2)\n \t\tcount = 1\n print(ans)\n", "FL_content": " N = int(input())\n a = list(map(int, input().split()))\n ans = 0\n count = 1\n for i in range(1, len(a)):\n \tif a[i] == a[i-1]:\n \t\tcount += 1\n \t\tif i == len(a) - 1 and count > 2:\n \t\t\tans += int(count / 2)\n \t\telif i == len(a) - 1 and count == 2:\n \t\t\tans += 1\n \telif a[i] != a[i-1] and count == 2:\n \t\tans += 1\n \t\tcount = 1\n \telif a[i] != a[i-1] and count > 2:\n-\t\tans += count - 2\n \t\tcount = 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u556589653", "problem_id": "p03296", "submission1_id": "s223409442", "submission2_id": "s302762166", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nans = 0\nK = max(A)+1\nfor i in range(N-2):\n if A[i] == A[i+1]:\n A[i+1] = K\n K += 1\n ans += 1\nprint(ans)", "code2": "N = int(input())\na = list(map(int,input().split()))\nans = 0\nP = max(a)\nfor i in range(N-1):\n if a[i+1] == a[i]:\n P += 1\n a[i+1] = P\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583076416", "date2": "1585107738", "bleu_score": "0.7623015244402782", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 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, 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": 92, "total_score": 104, "input": "5\n8 3 9 2 2\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=5\nA = list(map(int,input().split())) # (1): A=[8, 3, 9, 2, 2]\nans = 0 # (2): ans=0\nK = max(A)+1 # (3): K=10\nfor i in range(N-2): # (4): i=0 (6): i=1 ... (10): NO CHANGE\n if A[i] == A[i+1]: # (5): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n A[i+1] = K\n K += 1\n ans += 1\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n-A = list(map(int,input().split()))\n+a = list(map(int,input().split()))\n ans = 0\n-K = max(A)+1\n-for i in range(N-2):\n- if A[i] == A[i+1]:\n- A[i+1] = K\n- K += 1\n- ans += 1\n+P = max(a)\n+for i in range(N-1):\n+ if a[i+1] == a[i]:\n+ P += 1\n+ a[i+1] = P\n+ ans += 1\n print(ans)\n", "FL_content": " N = int(input())\n-A = list(map(int,input().split()))\n ans = 0\n-K = max(A)+1\n-for i in range(N-2):\n- if A[i] == A[i+1]:\n- A[i+1] = K\n- K += 1\n- ans += 1\n print(ans)\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 10 }, { "user_id": "u966378542", "problem_id": "p03296", "submission1_id": "s080223372", "submission2_id": "s656732440", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = input()\ndata = input().split()\nbef = -1\ncount = 0\nresult = 0\n\nfor i in range(len(data)):\n\tt = int(data[i])\n\tif bef != t:\n\t\tif count > 1:\n\t\t\tresult += int(count) / 2\n\t\t\tprint(result)\n\t\tcount = 1\n\t\tbef = t\n\telse:\n\t\tcount += 1\n\nif count > 1:\n\tresult += int(count / 2)\nprint(result)", "code2": "N = input()\ndata = input().split()\nbef = -1\ncount = 0\nresult = 0\n\nfor i in range(len(data)):\n\tt = int(data[i])\n\tif bef != t:\n\t\tif count > 1:\n\t\t\tresult += int(count / 2)\n\t\tcount = 1\n\t\tbef = t\n\telse:\n\t\tcount += 1\n\nif count > 1:\n\tresult += int(count / 2)\nprint(result)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531617500", "date2": "1531617640", "bleu_score": "0.927117145655509", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 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, 0, 1, 1, 1, 0, 0, 1], "code1_test_score": 61, "total_score": 104, "input": "5\n1 2 1 1 0\n", "actual_output": "1.0\n1.0\n", "expected_output": "1\n\n", "anno_code": ["N = input() # (0): N=5\ndata = input().split() # (1): data=['1', '2', '1', '1', '0']\nbef = -1 # (2): bef=-1\ncount = 0 # (3): count=0\nresult = 0 # (4): result=0\n\nfor i in range(len(data)): # (5): i=0 (11): i=1 ... (35): NO CHANGE\n\tt = int(data[i]) # (6): t=1 (12): t=2 ... (28): t=0\n\tif bef != t: # (7): NO CHANGE (13): NO CHANGE ... (29): NO CHANGE\n\t\tif count > 1: # (8): NO CHANGE (14): NO CHANGE ... (30): NO CHANGE\n\t\t\tresult += int(count) / 2 # (31): result=1.0\n\t\t\tprint(result) # (32): NO CHANGE\n\t\tcount = 1 # (9): count=1 (15): NO CHANGE ... (33): count=1\n\t\tbef = t # (10): bef=1 (16): bef=2 ... (34): bef=0\n\telse:\n\t\tcount += 1 # (26): count=2\n\nif count > 1: # (36): NO CHANGE\n\tresult += int(count / 2)\nprint(result)"], "anno_status": [true], "diff_content": " N = input()\n data = input().split()\n bef = -1\n count = 0\n result = 0\n \n for i in range(len(data)):\n \tt = int(data[i])\n \tif bef != t:\n \t\tif count > 1:\n-\t\t\tresult += int(count) / 2\n-\t\t\tprint(result)\n+\t\t\tresult += int(count / 2)\n \t\tcount = 1\n \t\tbef = t\n \telse:\n \t\tcount += 1\n \n if count > 1:\n \tresult += int(count / 2)\n print(result)\n", "FL_content": " N = input()\n data = input().split()\n bef = -1\n count = 0\n result = 0\n \n for i in range(len(data)):\n \tt = int(data[i])\n \tif bef != t:\n \t\tif count > 1:\n-\t\t\tresult += int(count) / 2\n-\t\t\tprint(result)\n \t\tcount = 1\n \t\tbef = t\n \telse:\n \t\tcount += 1\n \n if count > 1:\n \tresult += int(count / 2)\n print(result)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u616217092", "problem_id": "p03296", "submission1_id": "s445967406", "submission2_id": "s796273346", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\n\ndef get(l, r):\n for i in range(1, 10001):\n if i != l and i != r:\n return i\n assert False, 'damepo'\n\n\ndef main():\n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n l = a[0]\n count = 0\n for i, x in enumerate(a[1:-1]):\n idx = i + 1\n l = a[idx - 1]\n r = a[idx + 1]\n if l != x != r:\n pass\n elif (idx + 3) < len(a):\n if x == r == a[idx + 2] and x != a[idx + 3]:\n continue\n elif (idx + 2) < len(a):\n if x == r == a[idx + 2]:\n continue\n x = get(l, r)\n count += 1\n a[idx] = x\n \n print(count)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "from sys import stdin\n\n\ndef get(l, r):\n for i in range(1, 10001):\n if i != l and i != r:\n return i\n assert False, 'damepo'\n\n\ndef main():\n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n\n count = 0\n if N == 2:\n if a[0] == a[1]:\n count += 1\n else:\n for i, x in enumerate(a[1:-1]):\n idx = i + 1\n l = a[idx - 1]\n r = a[idx + 1]\n if (l == x and x != r) or (l == x == r) or ((idx == len(a) - 2) and x == r):\n x = get(l, r)\n count += 1\n a[idx] = x\n \n print(count)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531619614", "date2": "1531622563", "bleu_score": "0.8543187401824381", "code1_test_status": [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, 1, 0, 0, 0, 1, 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, 1, 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, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0], "code1_test_score": 14, "total_score": 104, "input": "5\n3 1 12 3 4\n", "actual_output": "3\n", "expected_output": "0\n\n", "anno_code": ["from sys import stdin\n\n\ndef get(l, r): # (0): get=\n for i in range(1, 10001):\n if i != l and i != r:\n return i\n assert False, 'damepo'\n\n\ndef main(): # (1): main=\n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n l = a[0]\n count = 0\n for i, x in enumerate(a[1:-1]):\n idx = i + 1\n l = a[idx - 1]\n r = a[idx + 1]\n if l != x != r:\n pass\n elif (idx + 3) < len(a):\n if x == r == a[idx + 2] and x != a[idx + 3]:\n continue\n elif (idx + 2) < len(a):\n if x == r == a[idx + 2]:\n continue\n x = get(l, r)\n count += 1\n a[idx] = x\n \n print(count)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " from sys import stdin\n \n \n def get(l, r):\n for i in range(1, 10001):\n if i != l and i != r:\n return i\n assert False, 'damepo'\n \n \n def main():\n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n- l = a[0]\n+\n count = 0\n- for i, x in enumerate(a[1:-1]):\n- idx = i + 1\n- l = a[idx - 1]\n- r = a[idx + 1]\n- if l != x != r:\n- pass\n- elif (idx + 3) < len(a):\n- if x == r == a[idx + 2] and x != a[idx + 3]:\n- continue\n- elif (idx + 2) < len(a):\n- if x == r == a[idx + 2]:\n- continue\n- x = get(l, r)\n- count += 1\n- a[idx] = x\n- \n+ if N == 2:\n+ if a[0] == a[1]:\n+ count += 1\n+ else:\n+ for i, x in enumerate(a[1:-1]):\n+ idx = i + 1\n+ l = a[idx - 1]\n+ r = a[idx + 1]\n+ if (l == x and x != r) or (l == x == r) or ((idx == len(a) - 2) and x == r):\n+ x = get(l, r)\n+ count += 1\n+ a[idx] = x\n+ \n print(count)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " from sys import stdin\n \n \n def get(l, r):\n for i in range(1, 10001):\n if i != l and i != r:\n return i\n assert False, 'damepo'\n \n \n def main():\n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n- l = a[0]\n count = 0\n- for i, x in enumerate(a[1:-1]):\n- idx = i + 1\n- l = a[idx - 1]\n- r = a[idx + 1]\n- if l != x != r:\n- pass\n- elif (idx + 3) < len(a):\n- if x == r == a[idx + 2] and x != a[idx + 3]:\n- continue\n- elif (idx + 2) < len(a):\n- if x == r == a[idx + 2]:\n- continue\n- x = get(l, r)\n- count += 1\n- a[idx] = x\n- \n print(count)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 14, "removed_lines": 17, "code1_lines": 37 }, { "user_id": "u396976991", "problem_id": "p03296", "submission1_id": "s605909545", "submission2_id": "s378229807", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\na=[]\na=input().split()\nsum=0\n\nfor i in range (1,N-2):\n if a[i-1]==a[i] or a[i+1]==a[i]:\n i=i+1\n sum=sum+1\n\nprint(sum)", "code2": "N=int(input())\na=[]\na=input().split()\nsum=0\n \nfor i in range (1,N):\n if a[i-1]==a[i]:\n a[i]=i+10001\n sum=sum+1\n \nprint(sum)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531618939", "date2": "1531620765", "bleu_score": "0.8422169632466463", "code1_test_status": [0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1], "code1_test_score": 58, "total_score": 104, "input": "14\n1 1 3 2 3 4 3 4 4 4 1 2 3 4\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["N=int(input()) # (0): N=14\na=[] # (1): a=[]\na=input().split() # (2): a=['1', '1', '3', '2', '3', '4', '3', '4', '4', '4', '1', '2', '3', '4']\nsum=0 # (3): sum=0\n\nfor i in range (1,N-2): # (4): i=1 (8): NO CHANGE ... (34): NO CHANGE\n if a[i-1]==a[i] or a[i+1]==a[i]: # (5): NO CHANGE (9): NO CHANGE ... (33): NO CHANGE\n i=i+1 # (6): i=2 (20): i=8 ... (28): i=10\n sum=sum+1 # (7): sum=1 (21): sum=2 ... (29): sum=4\n\nprint(sum)"], "anno_status": [true], "diff_content": " N=int(input())\n a=[]\n a=input().split()\n sum=0\n-\n-for i in range (1,N-2):\n- if a[i-1]==a[i] or a[i+1]==a[i]:\n- i=i+1\n+ \n+for i in range (1,N):\n+ if a[i-1]==a[i]:\n+ a[i]=i+10001\n sum=sum+1\n-\n+ \n print(sum)\n", "FL_content": " N=int(input())\n a=[]\n a=input().split()\n sum=0\n-\n-for i in range (1,N-2):\n- if a[i-1]==a[i] or a[i+1]==a[i]:\n- i=i+1\n sum=sum+1\n-\n print(sum)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u578501242", "problem_id": "p03296", "submission1_id": "s352105312", "submission2_id": "s531420195", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a =int(input())\nb =list(map(int,input().split()))\nprint(a)\nprint(b)\nx=0\nfor i in range(a-1):\n\tif b[i]==b[i+1]:\n\t\tb[i+1]=11111\n\t\tx=x+1\nprint(x)", "code2": "a =int(input())\nb =list(map(int,input().split()))\nx=0\nfor i in range(a-1):\n\tif b[i]==b[i+1]:\n\t\tb[i+1]=11111\n\t\tx=x+1\nprint(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583825568", "date2": "1583825609", "bleu_score": "0.8630902718219211", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "14\n1 1 2 3 3 3 4 4 4 4 1 2 3 4\n", "actual_output": "14\n[1, 1, 2, 3, 3, 3, 4, 4, 4, 4, 1, 2, 3, 4]\n4\n", "expected_output": "4\n\n", "anno_code": ["a =int(input()) # (0): a=14\nb =list(map(int,input().split())) # (1): b=[1, 1, 2, 3, 3, 3, 4, 4, 4, 4, 1, 2, 3, 4]\nprint(a) # (2): NO CHANGE\nprint(b) # (3): NO CHANGE\nx=0 # (4): x=0\nfor i in range(a-1): # (5): i=0 (9): i=1 ... (39): NO CHANGE\n\tif b[i]==b[i+1]: # (6): NO CHANGE (10): NO CHANGE ... (38): NO CHANGE\n\t\tb[i+1]=11111 # (7): b=[1, 11111, 2, 3, 3, 3, 4, 4, 4, 4, 1, 2, 3, 4] (15): b=[1, 11111, 2, 3, 11111, 3, 4, 4, 4, 4, 1, 2, 3, 4] ... (29): b=[1, 11111, 2, 3, 11111, 3, 4, 11111, 4, 11111, 1, 2, 3, 4]\n\t\tx=x+1 # (8): x=1 (16): x=2 ... (30): x=4\nprint(x)"], "anno_status": [true], "diff_content": " a =int(input())\n b =list(map(int,input().split()))\n-print(a)\n-print(b)\n x=0\n for i in range(a-1):\n \tif b[i]==b[i+1]:\n \t\tb[i+1]=11111\n \t\tx=x+1\n print(x)\n", "FL_content": " a =int(input())\n b =list(map(int,input().split()))\n-print(a)\n-print(b)\n x=0\n for i in range(a-1):\n \tif b[i]==b[i+1]:\n \t\tb[i+1]=11111\n \t\tx=x+1\n print(x)\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u265768297", "problem_id": "p03296", "submission1_id": "s062899045", "submission2_id": "s300532690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nans=0\nfor i in range(n-2):\n if a[i]==a[i+1]:\n a[i+1]=-1\n ans+=1\nprint(ans)", "code2": "n=int(input())\na=list(map(int,input().split()))\nans=0\nfor i in range(n-1):\n if a[i]==a[i+1]:\n a[i+1]=-1\n ans+=1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586901296", "date2": "1586901931", "bleu_score": "0.9817159352587469", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 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, 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": 92, "total_score": 104, "input": "5\n15 5 12 3 3\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n=int(input()) # (0): n=5\na=list(map(int,input().split())) # (1): a=[15, 5, 12, 3, 3]\nans=0 # (2): ans=0\nfor i in range(n-2): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n if a[i]==a[i+1]: # (4): NO CHANGE (6): NO CHANGE (8): NO CHANGE\n a[i+1]=-1\n ans+=1\nprint(ans)"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int,input().split()))\n ans=0\n-for i in range(n-2):\n+for i in range(n-1):\n if a[i]==a[i+1]:\n a[i+1]=-1\n ans+=1\n print(ans)\n", "FL_content": " n=int(input())\n a=list(map(int,input().split()))\n ans=0\n-for i in range(n-2):\n if a[i]==a[i+1]:\n a[i+1]=-1\n ans+=1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u308097393", "problem_id": "p03296", "submission1_id": "s713494763", "submission2_id": "s796348756", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = [int(x) for x in input().split()]\ncount = 0\nif (N==len(a))and(2<=N):\n for i in range(1,N-1):\n if (a[i-1]==a[i]):\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n if a[i]==a[i+1]:\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n count += 1\n print(count)", "code2": "N = int(input())\na = [int(x) for x in input().split()]\ncount = 0\na.append(0)\nif (N+1==len(a))and(2<=N):\n for i in range(1,N):\n if (a[i-1]==a[i]):\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n if a[i]==a[i+1]:\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n count += 1\n print(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536533349", "date2": "1536533725", "bleu_score": "0.9546557340704771", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 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, 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": 92, "total_score": 104, "input": "5\n4 2 9 2 2\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=5\na = [int(x) for x in input().split()] # (1): a=[4, 2, 9, 2, 2]\ncount = 0 # (2): count=0\nif (N==len(a))and(2<=N): # (3): NO CHANGE\n for i in range(1,N-1): # (4): i=1 (6): i=2 ... (10): NO CHANGE\n if (a[i-1]==a[i]): # (5): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n if a[i]==a[i+1]:\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n count += 1\n print(count)"], "anno_status": [true], "diff_content": " N = int(input())\n a = [int(x) for x in input().split()]\n count = 0\n-if (N==len(a))and(2<=N):\n- for i in range(1,N-1):\n+a.append(0)\n+if (N+1==len(a))and(2<=N):\n+ for i in range(1,N):\n if (a[i-1]==a[i]):\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n if a[i]==a[i+1]:\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n count += 1\n print(count)\n", "FL_content": " N = int(input())\n a = [int(x) for x in input().split()]\n count = 0\n-if (N==len(a))and(2<=N):\n- for i in range(1,N-1):\n if (a[i-1]==a[i]):\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n if a[i]==a[i+1]:\n a[i] += 1\n if a[i] > 10000:\n a[i] = 1\n count += 1\n print(count)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u934246119", "problem_id": "p03296", "submission1_id": "s133778417", "submission2_id": "s356959326", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na_tmp = input().split()\na = []\nans = 0\nfor _ in a_tmp:\n a.append(int(_))\ni = 0\nsame = 1\nwhile i < n-1:\n tmp = a[i]\n i += 1\n if a[i] == tmp:\n same += 1\n if same == 3:\n ans += 1\n same = 1\n else:\n if same >= 2:\n ans += 1\n same = 1\nprint(ans)\n", "code2": "n = int(input())\na_tmp = input().split()\na = []\nans = 0\nfor _ in a_tmp:\n a.append(int(_))\ni = 0\nsame = 1\nwhile i < n-1:\n tmp = a[i]\n i += 1\n if a[i] == tmp:\n same += 1\n if same == 3:\n ans += 1\n same = 1\n else:\n if same >= 2:\n ans += 1\n same = 1\nif same >= 2:\n ans += 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531618874", "date2": "1531619531", "bleu_score": "0.9206787780724986", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 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, 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": 92, "total_score": 104, "input": "5\n1 1 3 2 2\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=5\na_tmp = input().split() # (1): a_tmp=['1', '1', '3', '2', '2']\na = [] # (2): a=[]\nans = 0 # (3): ans=0\nfor _ in a_tmp: # (4): _=1 (6): NO CHANGE ... (14): NO CHANGE\n a.append(int(_)) # (5): a=[1] (7): a=[1, 1] ... (13): a=[1, 1, 3, 2, 2]\ni = 0 # (15): i=0\nsame = 1 # (16): same=1\nwhile i < n-1: # (17): NO CHANGE (23): NO CHANGE ... (41): NO CHANGE\n tmp = a[i] # (18): tmp=1 (24): NO CHANGE ... (36): tmp=2\n i += 1 # (19): i=1 (25): i=2 ... (37): i=4\n if a[i] == tmp: # (20): NO CHANGE (26): NO CHANGE ... (38): NO CHANGE\n same += 1 # (21): same=2 (39): same=2\n if same == 3: # (22): NO CHANGE (40): NO CHANGE\n ans += 1\n same = 1\n else:\n if same >= 2: # (27): NO CHANGE (34): NO CHANGE\n ans += 1 # (28): ans=1\n same = 1 # (29): same=1\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a_tmp = input().split()\n a = []\n ans = 0\n for _ in a_tmp:\n a.append(int(_))\n i = 0\n same = 1\n while i < n-1:\n tmp = a[i]\n i += 1\n if a[i] == tmp:\n same += 1\n if same == 3:\n ans += 1\n same = 1\n else:\n if same >= 2:\n ans += 1\n same = 1\n+if same >= 2:\n+ ans += 1\n+\n print(ans)\n \n", "FL_content": " n = int(input())\n a_tmp = input().split()\n a = []\n ans = 0\n for _ in a_tmp:\n a.append(int(_))\n i = 0\n same = 1\n while i < n-1:\n tmp = a[i]\n i += 1\n if a[i] == tmp:\n same += 1\n if same == 3:\n ans += 1\n same = 1\n else:\n if same >= 2:\n ans += 1\n same = 1\n print(ans)\n \n", "added_lines": 3, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u580806822", "problem_id": "p03296", "submission1_id": "s773308466", "submission2_id": "s750008470", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=[int(i)for i in input().split()]\n\ncount=0\np=1\nwhile p\n \n N = int(input())\n *A, = map(int, input().split())\n\n \n ans = 0\n i = 0\n while i < N:\n if A[i-1] == A[i]:\n ans += 1\n i += 2\n else:\n i += 1\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n \n N = int(input())\n *A, = map(int, input().split())\n \n \n ans = 0\n- i = 0\n+ i = 1\n while i < N:\n if A[i-1] == A[i]:\n ans += 1\n i += 2\n else:\n i += 1\n print(ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " def main():\n \n N = int(input())\n *A, = map(int, input().split())\n \n \n ans = 0\n- i = 0\n while i < N:\n if A[i-1] == A[i]:\n ans += 1\n i += 2\n else:\n i += 1\n print(ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u883048396", "problem_id": "p03296", "submission1_id": "s249497643", "submission2_id": "s526380194", "status1": "Wrong Answer", "status2": "Accepted", "code1": "iN = int(input())\naS = [int(x) for x in input().rstrip().split()]\n\n\n\niCounter = 0\nif iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\nelse:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n if aS[i] != 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n if i == iN - 2:\n continue\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\nprint(iCounter)\n", "code2": "iN = int(input())\naS = [int(x) for x in input().rstrip().split()]\n\n\n\n\n\n\n\niCounter = 0\nif iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\nelse:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n if aS[i] < 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\n if aS[iN-2] == aS[iN-1] :\n iCounter += 1\nprint(iCounter)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536899527", "date2": "1536900926", "bleu_score": "0.875799627373055", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 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, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 104, "input": "5\n1 0 1 1 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["iN = int(input()) # (0): iN=5\naS = [int(x) for x in input().rstrip().split()] # (1): aS=[1, 0, 1, 1, 0]\n\n\n\niCounter = 0 # (2): iCounter=0\nif iN == 2: # (3): NO CHANGE\n if aS[0] == aS[1]:\n iCounter += 1\nelse:\n for i in range(1,iN-1): # (4): i=1 (6): i=2 ... (13): NO CHANGE\n if aS[i] == aS[i-1]: # (5): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n if aS[i] == aS[i+1]: # (10): NO CHANGE\n if aS[i] != 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n if i == iN - 2: # (11): NO CHANGE\n continue # (12): NO CHANGE\n else:\n iU = max(aS[i],aS[i+1])\n if iU < 10000:\n iU += 1\n else:\n iU -= 1\n if iU == min(aS[1],aS[i+1]):\n iU -= 1\n aS[i] = iU\n iCounter += 1\nprint(iCounter)\n"], "anno_status": [true], "diff_content": " iN = int(input())\n aS = [int(x) for x in input().rstrip().split()]\n \n \n \n+\n+\n+\n+\n iCounter = 0\n if iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\n else:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n- if aS[i] != 10000:\n+ if aS[i] < 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n- if i == iN - 2:\n- continue\n+ iU = max(aS[i],aS[i+1])\n+ if iU < 10000:\n+ iU += 1\n else:\n- iU = max(aS[i],aS[i+1])\n- if iU < 10000:\n- iU += 1\n- else:\n+ iU -= 1\n+ if iU == min(aS[1],aS[i+1]):\n iU -= 1\n- if iU == min(aS[1],aS[i+1]):\n- iU -= 1\n- aS[i] = iU\n- iCounter += 1\n+ aS[i] = iU\n+ iCounter += 1\n+ if aS[iN-2] == aS[iN-1] :\n+ iCounter += 1\n print(iCounter)\n \n", "FL_content": " iN = int(input())\n aS = [int(x) for x in input().rstrip().split()]\n \n \n \n iCounter = 0\n if iN == 2:\n if aS[0] == aS[1]:\n iCounter += 1\n else:\n for i in range(1,iN-1):\n if aS[i] == aS[i-1]:\n if aS[i] == aS[i+1]:\n- if aS[i] != 10000:\n aS[i] += 1\n else:\n aS[i] -= 1\n iCounter += 1\n else:\n- if i == iN - 2:\n- continue\n else:\n- iU = max(aS[i],aS[i+1])\n- if iU < 10000:\n- iU += 1\n- else:\n iU -= 1\n- if iU == min(aS[1],aS[i+1]):\n- iU -= 1\n- aS[i] = iU\n- iCounter += 1\n print(iCounter)\n \n", "added_lines": 14, "removed_lines": 11, "code1_lines": 33 }, { "user_id": "u006657459", "problem_id": "p03296", "submission1_id": "s461582626", "submission2_id": "s004435502", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import random\nN = int(input())\na = [int(ai) for ai in input().split()]\n\ncount = 0\nfor i in range(0, N-1):\n if a[i] == a[i+1]:\n count += 1\n while a[i] == a[i+1]:\n a[i+1] = random.randint(1, N)\nprint(count)", "code2": "import random\nN = int(input())\na = [int(ai) for ai in input().split()]\n\nrandom.seed(42)\ncount = 0\nfor i in range(0, N-1):\n if a[i] == a[i+1]:\n count += 1\n while a[i] == a[i+1]:\n a[i+1] = random.randint(1, N)\n if i < N - 2:\n while a[i+1] == a[i+2]:\n a[i+1] = random.randint(1, N)\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531783528", "date2": "1531783874", "bleu_score": "0.64333085772387", "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, 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, 0, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "5\n1 1 2 2 2\n", "actual_output": "3\n", "expected_output": "2\n", "anno_code": ["import random\nN = int(input()) # (0): N=5\na = [int(ai) for ai in input().split()] # (1): a=[1, 1, 2, 2, 2]\n\ncount = 0 # (2): count=0\nfor i in range(0, N-1): # (3): i=0 (9): i=1 ... (21): NO CHANGE\n if a[i] == a[i+1]: # (4): NO CHANGE (10): NO CHANGE ... (19): NO CHANGE\n count += 1 # (5): count=1 (14): count=2\n while a[i] == a[i+1]: # (6): NO CHANGE (8): NO CHANGE ... (20): NO CHANGE\n a[i+1] = random.randint(1, N) # (7): a=[1, 4, 2, 2, 2] (16): a=[1, 4, 2, 5, 2]\nprint(count)"], "anno_status": [true], "diff_content": " import random\n N = int(input())\n a = [int(ai) for ai in input().split()]\n \n+random.seed(42)\n count = 0\n for i in range(0, N-1):\n if a[i] == a[i+1]:\n count += 1\n while a[i] == a[i+1]:\n a[i+1] = random.randint(1, N)\n+ if i < N - 2:\n+ while a[i+1] == a[i+2]:\n+ a[i+1] = random.randint(1, N)\n+\n print(count)\n", "FL_content": " import random\n N = int(input())\n a = [int(ai) for ai in input().split()]\n \n count = 0\n for i in range(0, N-1):\n if a[i] == a[i+1]:\n count += 1\n while a[i] == a[i+1]:\n a[i+1] = random.randint(1, N)\n print(count)\n", "added_lines": 5, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u340010271", "problem_id": "p03296", "submission1_id": "s450929218", "submission2_id": "s959775395", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\na=list(map(int,input().split()))\nans=0\nfor i in range(N-1):\n if a[i]==a[i+1]:\n ans+=1\nprint(ans)", "code2": "N=int(input())\na=list(map(int,input().split()))\nans=0\nfor i in range(N-1):\n if a[i]==a[i+1]:\n a[i+1]=10**4+i+1\n ans+=1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552767620", "date2": "1552767785", "bleu_score": "0.826978177375737", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1], "code1_test_score": 91, "total_score": 104, "input": "14\n1 2 2 3 3 3 4 4 4 4 1 2 3 4\n", "actual_output": "6\n", "expected_output": "4\n", "anno_code": ["N=int(input()) # (0): N=14\na=list(map(int,input().split())) # (1): a=[1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 1, 2, 3, 4]\nans=0 # (2): ans=0\nfor i in range(N-1): # (3): i=0 (5): i=1 ... (35): NO CHANGE\n if a[i]==a[i+1]: # (4): NO CHANGE (6): NO CHANGE ... (34): NO CHANGE\n ans+=1 # (7): ans=1 (12): ans=2 ... (26): ans=6\nprint(ans)"], "anno_status": [true], "diff_content": " N=int(input())\n a=list(map(int,input().split()))\n ans=0\n for i in range(N-1):\n if a[i]==a[i+1]:\n+ a[i+1]=10**4+i+1\n ans+=1\n print(ans)\n", "FL_content": " N=int(input())\n a=list(map(int,input().split()))\n ans=0\n for i in range(N-1):\n if a[i]==a[i+1]:\n ans+=1\n print(ans)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u628538573", "problem_id": "p03296", "submission1_id": "s254868178", "submission2_id": "s295014810", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = input().split()\ncount = 0\nfor i in range(n - 1):\n\tif a[i] == a[i + 1]:\n\t\tif i + 1 < n - 2:\n\t\t\tif a[i] != 1 and a[i + 2] != 1:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 2 and a[i + 2] != 2:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 3 and a[i + 2] != 3:\n\t\t\t\ta[i + 1] = 3\n\t\t\t\tcount += 1\n\t\tif i == n - 2:\n\t\t\tif a[i] == 1:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\t\tflag = 1\n\t\t\telse:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\t\tflag = 1\n\nprint(count)", "code2": "n = int(input())\na = input().split()\ncount = 0\nfor i in range(n - 1):\n\tif a[i] == a[i + 1]:\n\t\tif i + 1 < n - 1:\n\t\t\tif a[i] != 1 and a[i + 2] != 1:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 2 and a[i + 2] != 2:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 3 and a[i + 2] != 3:\n\t\t\t\ta[i + 1] = 3\n\t\t\t\tcount += 1\n\n\t\tif i == n - 2:\n\t\t\tif a[i] == 1:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telse:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531617093", "date2": "1531617702", "bleu_score": "0.9369141119418402", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 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, 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, 0, 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, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 104, "input": "5\n2 0 1 1 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = input().split() # (1): a=['2', '0', '1', '1', '0']\ncount = 0 # (2): count=0\nfor i in range(n - 1): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n\tif a[i] == a[i + 1]: # (4): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n\t\tif i + 1 < n - 2: # (9): NO CHANGE\n\t\t\tif a[i] != 1 and a[i + 2] != 1:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 2 and a[i + 2] != 2:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 3 and a[i + 2] != 3:\n\t\t\t\ta[i + 1] = 3\n\t\t\t\tcount += 1\n\t\tif i == n - 2: # (10): NO CHANGE\n\t\t\tif a[i] == 1:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\t\tflag = 1\n\t\t\telse:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\t\tflag = 1\n\nprint(count)"], "anno_status": [true], "diff_content": " n = int(input())\n a = input().split()\n count = 0\n for i in range(n - 1):\n \tif a[i] == a[i + 1]:\n-\t\tif i + 1 < n - 2:\n+\t\tif i + 1 < n - 1:\n \t\t\tif a[i] != 1 and a[i + 2] != 1:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 2 and a[i + 2] != 2:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 3 and a[i + 2] != 3:\n \t\t\t\ta[i + 1] = 3\n \t\t\t\tcount += 1\n+\n \t\tif i == n - 2:\n \t\t\tif a[i] == 1:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n-\t\t\t\tflag = 1\n \t\t\telse:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n-\t\t\t\tflag = 1\n \n print(count)\n", "FL_content": " n = int(input())\n a = input().split()\n count = 0\n for i in range(n - 1):\n \tif a[i] == a[i + 1]:\n-\t\tif i + 1 < n - 2:\n \t\t\tif a[i] != 1 and a[i + 2] != 1:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 2 and a[i + 2] != 2:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 3 and a[i + 2] != 3:\n \t\t\t\ta[i + 1] = 3\n \t\t\t\tcount += 1\n \t\tif i == n - 2:\n \t\t\tif a[i] == 1:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n-\t\t\t\tflag = 1\n \t\t\telse:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n-\t\t\t\tflag = 1\n \n print(count)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 26 }, { "user_id": "u396976991", "problem_id": "p03296", "submission1_id": "s917691137", "submission2_id": "s378229807", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\na=[]\na=input().split()\nsum=0\n\nfor i in range (1,N-1):\n if a[i-1]==a[i]:\n a[i]=i+10000\n sum=sum+1\n\nprint(sum)", "code2": "N=int(input())\na=[]\na=input().split()\nsum=0\n \nfor i in range (1,N):\n if a[i-1]==a[i]:\n a[i]=i+10001\n sum=sum+1\n \nprint(sum)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531620347", "date2": "1531620765", "bleu_score": "0.9327833153332715", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 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, 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": 92, "total_score": 104, "input": "5\n15 5 12 3 3\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N=int(input()) # (0): N=5\na=[] # (1): a=[]\na=input().split() # (2): a=['15', '5', '12', '3', '3']\nsum=0 # (3): sum=0\n\nfor i in range (1,N-1): # (4): i=1 (6): i=2 ... (10): NO CHANGE\n if a[i-1]==a[i]: # (5): NO CHANGE (7): NO CHANGE (9): NO CHANGE\n a[i]=i+10000\n sum=sum+1\n\nprint(sum)"], "anno_status": [true], "diff_content": " N=int(input())\n a=[]\n a=input().split()\n sum=0\n-\n-for i in range (1,N-1):\n+ \n+for i in range (1,N):\n if a[i-1]==a[i]:\n- a[i]=i+10000\n+ a[i]=i+10001\n sum=sum+1\n-\n+ \n print(sum)\n", "FL_content": " N=int(input())\n a=[]\n a=input().split()\n sum=0\n-\n-for i in range (1,N-1):\n if a[i-1]==a[i]:\n- a[i]=i+10000\n sum=sum+1\n-\n print(sum)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 11 }, { "user_id": "u183896397", "problem_id": "p03296", "submission1_id": "s048632900", "submission2_id": "s087503425", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\nans = 0\nbefor = a[0]\nfor i in range(1,n-1):\n after = a[i+1]\n if a[i] == befor:\n ans += 1\n for j in range(1,10001):\n if j != after:\n a[i] = j\n break\n befor = a[i]\n\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int,input().split()))\nans = 0\nbefor = a[0]\nfor i in range(1,n-1):\n after = a[i+1]\n if a[i] == befor:\n ans += 1\n for j in range(1,10001):\n if j != after:\n a[i] = j\n break\n befor = a[i]\nif befor == a[-1]:\n ans += 1\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576388683", "date2": "1576388861", "bleu_score": "0.8982567951887626", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 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, 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": 92, "total_score": 104, "input": "5\n8 3 9 2 2\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int,input().split())) # (1): a=[8, 3, 9, 2, 2]\nans = 0 # (2): ans=0\nbefor = a[0] # (3): befor=8\nfor i in range(1,n-1): # (4): i=1 (8): i=2 ... (16): NO CHANGE\n after = a[i+1] # (5): after=9 (9): after=2 (13): NO CHANGE\n if a[i] == befor: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n ans += 1\n for j in range(1,10001):\n if j != after:\n a[i] = j\n break\n befor = a[i] # (7): befor=3 (11): befor=9 (15): befor=2\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n ans = 0\n befor = a[0]\n for i in range(1,n-1):\n after = a[i+1]\n if a[i] == befor:\n ans += 1\n for j in range(1,10001):\n if j != after:\n a[i] = j\n break\n befor = a[i]\n-\n+if befor == a[-1]:\n+ ans += 1\n print(ans)\n \n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n ans = 0\n befor = a[0]\n for i in range(1,n-1):\n after = a[i+1]\n if a[i] == befor:\n ans += 1\n for j in range(1,10001):\n if j != after:\n a[i] = j\n break\n befor = a[i]\n-\n print(ans)\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u628538573", "problem_id": "p03296", "submission1_id": "s342930021", "submission2_id": "s295014810", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = input().split()\ncount = 0\nfor i in range(n - 1):\n\tif a[i] == a[i + 1]:\n\t\tif i + 1 < n - 2:\n\t\t\tif a[i] != 1 and a[i + 2] != 1:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 2 and a[i + 2] != 2:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 3 and a[i + 2] != 3:\n\t\t\t\ta[i + 1] = 3\n\t\t\t\tcount += 1\n\n\t\tif i == n - 2:\n\t\t\tif a[i] == 1:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telse:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\nprint(count)", "code2": "n = int(input())\na = input().split()\ncount = 0\nfor i in range(n - 1):\n\tif a[i] == a[i + 1]:\n\t\tif i + 1 < n - 1:\n\t\t\tif a[i] != 1 and a[i + 2] != 1:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 2 and a[i + 2] != 2:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 3 and a[i + 2] != 3:\n\t\t\t\ta[i + 1] = 3\n\t\t\t\tcount += 1\n\n\t\tif i == n - 2:\n\t\t\tif a[i] == 1:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telse:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531617468", "date2": "1531617702", "bleu_score": "0.9942626876947902", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 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, 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, 0, 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, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 104, "input": "5\n2 0 1 1 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = input().split() # (1): a=['2', '0', '1', '1', '0']\ncount = 0 # (2): count=0\nfor i in range(n - 1): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n\tif a[i] == a[i + 1]: # (4): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n\t\tif i + 1 < n - 2: # (9): NO CHANGE\n\t\t\tif a[i] != 1 and a[i + 2] != 1:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 2 and a[i + 2] != 2:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telif a[i] != 3 and a[i + 2] != 3:\n\t\t\t\ta[i + 1] = 3\n\t\t\t\tcount += 1\n\n\t\tif i == n - 2: # (10): NO CHANGE\n\t\t\tif a[i] == 1:\n\t\t\t\ta[i + 1] = 2\n\t\t\t\tcount += 1\n\t\t\telse:\n\t\t\t\ta[i + 1] = 1\n\t\t\t\tcount += 1\n\nprint(count)"], "anno_status": [true], "diff_content": " n = int(input())\n a = input().split()\n count = 0\n for i in range(n - 1):\n \tif a[i] == a[i + 1]:\n-\t\tif i + 1 < n - 2:\n+\t\tif i + 1 < n - 1:\n \t\t\tif a[i] != 1 and a[i + 2] != 1:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 2 and a[i + 2] != 2:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 3 and a[i + 2] != 3:\n \t\t\t\ta[i + 1] = 3\n \t\t\t\tcount += 1\n \n \t\tif i == n - 2:\n \t\t\tif a[i] == 1:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n \t\t\telse:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n \n print(count)\n", "FL_content": " n = int(input())\n a = input().split()\n count = 0\n for i in range(n - 1):\n \tif a[i] == a[i + 1]:\n-\t\tif i + 1 < n - 2:\n \t\t\tif a[i] != 1 and a[i + 2] != 1:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 2 and a[i + 2] != 2:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n \t\t\telif a[i] != 3 and a[i + 2] != 3:\n \t\t\t\ta[i + 1] = 3\n \t\t\t\tcount += 1\n \n \t\tif i == n - 2:\n \t\t\tif a[i] == 1:\n \t\t\t\ta[i + 1] = 2\n \t\t\t\tcount += 1\n \t\t\telse:\n \t\t\t\ta[i + 1] = 1\n \t\t\t\tcount += 1\n \n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u113295414", "problem_id": "p02281", "submission1_id": "s045277997", "submission2_id": "s328944268", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ntree = [[] for i in range(n)]\nfor i in range(n):\n id, left, right = map(int, input().split())\n tree[id] = [left, right]\n\ndef preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n\ndef inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n\ndef postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n\nprint('Preoder')\npreoder(0)\nprint('')\nprint('Inorder')\ninorder(0)\nprint('')\nprint('Postorder')\npostorder(0)\n\n", "code2": "n = int(input())\ntree = [[-1, -1, True] for i in range(n)]\nfor i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n\ndef preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n\ndef inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n\ndef postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n\nroot = 0\nfor i, node in enumerate(tree):\n if node[2] == True:\n root = i\n\nprint('Preorder')\npreoder(root)\nprint('')\nprint('Inorder')\ninorder(root)\nprint('')\nprint('Postorder')\npostorder(root)\nprint('')\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529225398", "date2": "1529227142", "bleu_score": "0.7140748192420414", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 1 4\n1 2 5\n2 -1 -1\n3 -1 -1\n4 3 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preoder\n 0 1 2 5 6 7 4 3 8\nInorder\n 2 1 6 5 7 0 3 4 8\nPostorder\n 2 6 7 5 1 3 8 4 0", "expected_output": "Preorder\n 0 1 2 5 6 7 4 3 8\nInorder\n 2 1 6 5 7 0 3 4 8\nPostorder\n 2 6 7 5 1 3 8 4 0\n\n", "anno_code": ["n = int(input()) # (0): n=9\ntree = [[] for i in range(n)] # (1): tree\nfor i in range(n): # (2): i=0 (5): tree, i=1 ... (29): NO CHANGE\n id, left, right = map(int, input().split()) # (3): id=0, left=1, right=4 (6): tree=[[1, 4], [], [], [], [], [], [], [], []], id=1, left=2, right=5 ... (27): tree, id=8\n tree[id] = [left, right] # (4): tree (7): tree ... (28): tree\n\ndef preoder(id): # (30): preoder=\n if id == -1: # (35): NO CHANGE (38): NO CHANGE ... (89): NO CHANGE\n return # (45): id=2 (48): id=1 ... (90): n=9, tree, i=8, id=8, left=-1, right=-1, preoder=, inorder=, postorder=\n print(' ' + str(id), end='') # (36): NO CHANGE (39): NO CHANGE ... (84): NO CHANGE\n preoder(tree[id][0]) # (37): id=1 (40): id=2 ... (85): id=-1\n preoder(tree[id][1]) # (46): id=-1 (49): id=5 ... (88): id=-1\n\ndef inorder(id): # (31): inorder=\n if id == -1: # (94): NO CHANGE (96): NO CHANGE ... (148): NO CHANGE\n return # (101): id=2 (105): id=1 ... (149): n=9, tree, i=8, id=8, left=-1, right=-1, preoder=, inorder=, postorder=\n inorder(tree[id][0]) # (95): id=1 (97): id=2 ... (143): id=-1\n print(' ' + str(id), end='') # (102): NO CHANGE (106): NO CHANGE ... (146): NO CHANGE\n inorder(tree[id][1]) # (103): id=-1 (107): id=5 ... (147): id=-1\n\ndef postorder(id): # (32): postorder=\n if id == -1: # (153): NO CHANGE (155): NO CHANGE ... (204): NO CHANGE\n return # (160): id=2 (163): id=2 ... (205): id=8\n postorder(tree[id][0]) # (154): id=1 (156): id=2 ... (200): id=-1\n postorder(tree[id][1]) # (161): id=-1 (165): id=5 ... (203): id=-1\n print(' ' + str(id), end='') # (164): id=1 (175): id=5 ... (207): id=0\n\nprint('Preoder') # (33): NO CHANGE\npreoder(0) # (34): id=0\nprint('') # (91): NO CHANGE\nprint('Inorder') # (92): NO CHANGE\ninorder(0) # (93): id=0\nprint('') # (150): NO CHANGE\nprint('Postorder') # (151): NO CHANGE\npostorder(0) # (152): id=0\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n-tree = [[] for i in range(n)]\n+tree = [[-1, -1, True] for i in range(n)]\n for i in range(n):\n id, left, right = map(int, input().split())\n- tree[id] = [left, right]\n+ if left != -1:\n+ tree[id][0] = left\n+ tree[left][2] = False\n+ if right != -1:\n+ tree[id][1] = right\n+ tree[right][2] = False\n \n def preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n \n def inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n \n def postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n \n-print('Preoder')\n-preoder(0)\n+root = 0\n+for i, node in enumerate(tree):\n+ if node[2] == True:\n+ root = i\n+\n+print('Preorder')\n+preoder(root)\n print('')\n print('Inorder')\n-inorder(0)\n+inorder(root)\n print('')\n print('Postorder')\n-postorder(0)\n+postorder(root)\n+print('')\n \n \n", "FL_content": " n = int(input())\n-tree = [[] for i in range(n)]\n for i in range(n):\n id, left, right = map(int, input().split())\n- tree[id] = [left, right]\n \n def preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n \n def inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n \n def postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n \n-print('Preoder')\n-preoder(0)\n print('')\n print('Inorder')\n-inorder(0)\n print('')\n print('Postorder')\n-postorder(0)\n \n \n", "added_lines": 17, "removed_lines": 6, "code1_lines": 37 }, { "user_id": "u510829608", "problem_id": "p02281", "submission1_id": "s157089794", "submission2_id": "s023112529", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ntree = [None for _ in range(N)]\nroot = set(range(N))\n\nfor i in range(N):\n i, l, r = map(int,input().split())\n tree[i] = (l, r)\n root -= {l, r}\n\nroot_node = root.pop()\n\ndef preorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n print(\" {}\".format(i), end = \"\")\n preorder(l)\n preorder(r)\n \ndef inorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n inorder(l)\n print(\" {}\".format(i), end = \"\")\n inorder(r)\n \ndef postorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n inorder(l)\n inorder(r)\n print(\" {}\".format(i), end = \"\")\n \nprint('Preorder')\npreorder(root_node)\nprint()\n\nprint('Inorder')\ninorder(root_node)\nprint()\n\nprint('Postorder')\npostorder(root_node)\nprint()", "code2": "N = int(input())\ntree = [None for _ in range(N)]\nroot = set(range(N))\n\nfor i in range(N):\n i, l, r = map(int,input().split())\n tree[i] = (l, r)\n root -= {l, r}\n\nroot_node = root.pop()\n\ndef preorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n print(\" {}\".format(i), end = \"\")\n preorder(l)\n preorder(r)\n \ndef inorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n inorder(l)\n print(\" {}\".format(i), end = \"\")\n inorder(r)\n \ndef postorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n postorder(l)\n postorder(r)\n print(\" {}\".format(i), end = \"\")\n \nprint('Preorder')\npreorder(root_node)\nprint()\n\nprint('Inorder')\ninorder(root_node)\nprint()\n\nprint('Postorder')\npostorder(root_node)\nprint()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502609921", "date2": "1502610076", "bleu_score": "0.9855270280676452", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 3 2 0 6 5 7 4 8\nPostorder\n 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8 1\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["N = int(input()) # (0): N=9\ntree = [None for _ in range(N)] # (1): tree=[None, None, None, None, None, None, None, None, None]\nroot = set(range(N)) # (2): root={0, 1, 2, 3, 4, 5, 6, 7, 8}\n\nfor i in range(N): # (3): i=0 (7): tree=[(2, 4), None, None, None, None, None, None, None, None], i=1 ... (39): NO CHANGE\n i, l, r = map(int,input().split()) # (4): l=2, r=4 (8): tree=[(2, 4), None, None, None, None, None, None, None, None], l=0, r=3 ... (36): tree=[(2, 4), (0, 3), (-1, -1), (-1, 0), (5, 8), (6, 7), (-1, -1), (-1, -1), None]\n tree[i] = (l, r) # (5): tree=[(2, 4), None, None, None, None, None, None, None, None] (9): tree=[(2, 4), (0, 3), None, None, None, None, None, None, None] ... (37): tree=[(2, 4), (0, 3), (-1, -1), (-1, 0), (5, 8), (6, 7), (-1, -1), (-1, -1), (-1, -1)]\n root -= {l, r} # (6): tree=[(2, 4), None, None, None, None, None, None, None, None], root={0, 1, 3, 5, 6, 7, 8} (10): tree=[(2, 4), (0, 3), None, None, None, None, None, None, None], root={1, 5, 6, 7, 8} ... (38): NO CHANGE\n\nroot_node = root.pop() # (40): root=set(), root_node=1\n\ndef preorder(i): # (41): preorder=\n if i == -1: # (46): NO CHANGE (50): NO CHANGE ... (158): NO CHANGE\n return # (59): i=2, l=-1, r=-1 (62): i=0, l=2, r=4 ... (159): N=9, tree=[(2, 4), (0, 3), (-1, -1), (-1, 0), (5, 8), (6, 7), (-1, -1), (-1, -1), (-1, -1)], root=set(), i=8, l=-1, r=-1, root_node=1, preorder=, inorder=, postorder=\n (l, r) = tree[i] # (47): l=0, r=3 (51): l=2, r=4 ... (152): l=-1, r=-1\n print(\" {}\".format(i), end = \"\") # (48): NO CHANGE (52): NO CHANGE ... (153): NO CHANGE\n preorder(l) # (49): i=0 (53): i=2 ... (154): i=-1\n preorder(r) # (60): i=-1 (63): i=4 ... (157): i=-1\n \ndef inorder(i): # (42): inorder=\n if i == -1: # (163): NO CHANGE (166): NO CHANGE ... (391): NO CHANGE\n return # (173): i=2, l=-1, r=-1 (177): i=0, l=2, r=4 ... (392): i=1, l=0, r=3\n (l, r) = tree[i] # (164): l=0, r=3 (167): l=2, r=4 ... (385): l=-1, r=-1\n inorder(l) # (165): i=0 (168): i=2 ... (386): i=-1\n print(\" {}\".format(i), end = \"\") # (174): NO CHANGE (178): NO CHANGE ... (389): NO CHANGE\n inorder(r) # (175): i=-1 (179): i=4 ... (390): i=-1\n \ndef postorder(i): # (43): postorder=\n if i == -1: # (280): NO CHANGE\n return\n (l, r) = tree[i] # (281): l=0, r=3\n inorder(l) # (282): i=0\n inorder(r) # (334): i=3\n print(\" {}\".format(i), end = \"\") # (393): N=9, tree=[(2, 4), (0, 3), (-1, -1), (-1, 0), (5, 8), (6, 7), (-1, -1), (-1, -1), (-1, -1)], root=set(), i=8, l=-1, r=-1, root_node=1, preorder=, inorder=, postorder=\n \nprint('Preorder') # (44): NO CHANGE\npreorder(root_node) # (45): i=1\nprint() # (160): NO CHANGE\n\nprint('Inorder') # (161): NO CHANGE\ninorder(root_node) # (162): i=1\nprint() # (277): NO CHANGE\n\nprint('Postorder') # (278): NO CHANGE\npostorder(root_node) # (279): i=1\nprint()"], "anno_status": [false], "diff_content": " N = int(input())\n tree = [None for _ in range(N)]\n root = set(range(N))\n \n for i in range(N):\n i, l, r = map(int,input().split())\n tree[i] = (l, r)\n root -= {l, r}\n \n root_node = root.pop()\n \n def preorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n print(\" {}\".format(i), end = \"\")\n preorder(l)\n preorder(r)\n \n def inorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n inorder(l)\n print(\" {}\".format(i), end = \"\")\n inorder(r)\n \n def postorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n- inorder(l)\n- inorder(r)\n+ postorder(l)\n+ postorder(r)\n print(\" {}\".format(i), end = \"\")\n \n print('Preorder')\n preorder(root_node)\n print()\n \n print('Inorder')\n inorder(root_node)\n print()\n \n print('Postorder')\n postorder(root_node)\n print()\n", "FL_content": " N = int(input())\n tree = [None for _ in range(N)]\n root = set(range(N))\n \n for i in range(N):\n i, l, r = map(int,input().split())\n tree[i] = (l, r)\n root -= {l, r}\n \n root_node = root.pop()\n \n def preorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n print(\" {}\".format(i), end = \"\")\n preorder(l)\n preorder(r)\n \n def inorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n inorder(l)\n print(\" {}\".format(i), end = \"\")\n inorder(r)\n \n def postorder(i):\n if i == -1:\n return\n (l, r) = tree[i]\n- inorder(l)\n- inorder(r)\n print(\" {}\".format(i), end = \"\")\n \n print('Preorder')\n preorder(root_node)\n print()\n \n print('Inorder')\n inorder(root_node)\n print()\n \n print('Postorder')\n postorder(root_node)\n print()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 46 }, { "user_id": "u007270338", "problem_id": "p02281", "submission1_id": "s939698139", "submission2_id": "s519586607", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\nT = [None for i in range(N)]\nclass Tree:\n def __init__(self, ID,p=-1):\n self.ID = ID\n\n def makeTree(self, tree):\n ID = tree.ID\n if ID == -1:\n return\n else:\n for i in range(N):\n if trees[i][0] == ID:\n [ID,l,r] = trees[i]\n tree.l = Tree(l)\n tree.r = Tree(r)\n treeL = tree.l\n treeR = tree.r\n treeL.p = tree\n treeR.p = tree\n\n self.makeTree(self,treeL)\n self.makeTree(self,treeR)\n\ndef preParse(tree):\n ID = tree.ID\n if ID == -1:\n return\n else:\n global preList\n preList.append(ID)\n treeL = tree.l\n treeR = tree.r\n preParse(treeL)\n preParse(treeR)\n \ndef inParse(tree):\n ID = tree.ID\n if ID == -1:\n return\n else:\n global inList\n treeL = tree.l\n treeR = tree.r\n inParse(treeL)\n inList.append(ID)\n inParse(treeR)\n\ndef posParse(tree):\n ID = tree.ID\n if ID == -1:\n return\n else:\n global posList\n treeL = tree.l\n treeR = tree.r\n posParse(treeL)\n posParse(treeR)\n posList.append(ID)\n \n \ntrees = [list(map(int,input().split())) for i in range(N)]\nID = trees[0][0]\ntree = Tree(ID)\nTree.makeTree(Tree,tree)\n\npreList = []\ninList = []\nposList = []\npreParse(tree)\ninParse(tree)\nposParse(tree)\n\ndef convert(List, order):\n a = \" \" + \" \".join([str(num) for num in List])\n print(\"{}\".format(order))\n print(a)\nconvert(preList, \"Preorder\")\nconvert(inList, \"Inorder\")\nconvert(posList, \"Postorder\")\n", "code2": "\nN = int(input())\nT = []\nclass Tree:\n def __init__(self,ID,l=None,r=None,p=-1):\n self.ID = ID\n self.l = l\n self.r = r\n self.p = p\n\n def makeTree(self):\n for i in range(N):\n T.append(Tree(i))\n\n\ndef preParse(tree):\n if tree == None:\n return\n else:\n ID = tree.ID\n global preList\n preList.append(ID)\n preParse(tree.l)\n preParse(tree.r)\n \ndef inParse(tree):\n if tree == None:\n return\n else:\n ID = tree.ID\n global inList\n inParse(tree.l)\n inList.append(ID)\n inParse(tree.r)\n\ndef posParse(tree):\n if tree == None:\n return\n else:\n ID = tree.ID\n global posList\n posParse(tree.l)\n posParse(tree.r)\n posList.append(ID)\n \n \ntrees = [list(map(int,input().split())) for i in range(N)]\nTree.makeTree(Tree)\nfor i in range(N):\n ID,l,r = trees[i]\n tree = T[ID]\n if l != -1:\n T[l].p = tree\n tree.l = T[l]\n if r != -1:\n T[r].p = tree\n tree.r = T[r]\n \nfor i in range(N):\n if T[i].p == -1:\n parent = T[i]\n\npreList = []\ninList = []\nposList = []\npreParse(parent)\ninParse(parent)\nposParse(parent)\n\ndef convert(List, order):\n a = \" \" + \" \".join([str(num) for num in List])\n print(\"{}\".format(order))\n print(a)\nconvert(preList, \"Preorder\")\nconvert(inList, \"Inorder\")\nconvert(posList, \"Postorder\")\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529780605", "date2": "1529786662", "bleu_score": "0.7266546393600114", "code1_test_status": [1, 1, 0, 0, 0], "code1_test_score": 2, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3\nInorder\n 2 0 6 5 7 4 8 1 3\nPostorder\n 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["\nN = int(input()) # (0): N=9\nT = [None for i in range(N)] # (1): T=[None, None, None, None, None, None, None, None, None]\nclass Tree: # (2): Tree=\n def __init__(self, ID,p=-1):\n self.ID = ID # (9): N=9, T=[None, None, None, None, None, None, None, None, None], Tree=, preParse=, inParse=, posParse=, trees, tree= (17): self=, tree=, ID=0, i=0, l=2, r=4 ... (219): self=, tree=, ID=8, i=8, l=-1, r=-1\n\n def makeTree(self, tree):\n ID = tree.ID # (11): ID=0 (25): ID=2 ... (229): ID=-1\n if ID == -1: # (12): NO CHANGE (26): NO CHANGE ... (230): NO CHANGE\n return # (45): tree=, ID=2, i=2, l=-1, r=-1, treeL=, treeR= (49): tree=, ID=2, i=2, l=-1, r=-1, treeL=, treeR= ... (231): tree=, ID=8, i=8, l=-1, r=-1, treeL=, treeR=\n else:\n for i in range(N): # (13): i=0 (27): i=0 ... (258): N=9, T=[None, None, None, None, None, None, None, None, None], Tree=, preParse=, inParse=, posParse=, trees\n if trees[i][0] == ID: # (14): NO CHANGE (28): NO CHANGE ... (257): NO CHANGE\n [ID,l,r] = trees[i] # (15): l=2, r=4 (33): l=-1, r=-1 ... (215): l=-1, r=-1\n tree.l = Tree(l) # (16): self=, ID=2, p=-1 (34): self=, ID=-1, p=-1 ... (216): self=, ID=-1, p=-1\n tree.r = Tree(r) # (18): self=, ID=4, p=-1 (36): self=, ID=-1, p=-1 ... (218): self=, ID=-1, p=-1\n treeL = tree.l # (20): treeL= (38): treeL= ... (220): treeL=\n treeR = tree.r # (21): treeR= (39): treeR= ... (221): treeR=\n treeL.p = tree # (22): NO CHANGE (40): NO CHANGE ... (222): NO CHANGE\n treeR.p = tree # (23): NO CHANGE (41): NO CHANGE ... (223): NO CHANGE\n\n self.makeTree(self,treeL) # (24): tree= (42): tree= ... (224): tree=\n self.makeTree(self,treeR) # (46): tree= (63): tree= ... (228): tree=\n\ndef preParse(tree): # (3): preParse=\n ID = tree.ID # (263): ID=0 (269): ID=2 ... (333): ID=-1\n if ID == -1: # (264): NO CHANGE (270): NO CHANGE ... (334): NO CHANGE\n return # (277): tree=, ID=2, treeL=, treeR= (281): tree=, ID=0, treeL=, treeR= ... (335): N=9, T=[None, None, None, None, None, None, None, None, None], Tree=, preParse=, inParse=, posParse=, trees=[[0, 2, 4], [1, 0, 3], [2, -1, -1], [3, -1, -1], [4, 5, 8], [5, 6, 7], [6, -1, -1], [7, -1, -1], [8, -1, -1]], ID=0, tree=, preList=[0, 2, 4, 5, 6, 7, 8], inList=[], posList=[]\n else:\n global preList\n preList.append(ID) # (265): NO CHANGE (271): NO CHANGE ... (325): NO CHANGE\n treeL = tree.l # (266): treeL= (272): treeL= ... (326): treeL=\n treeR = tree.r # (267): treeR= (273): treeR= ... (327): treeR=\n preParse(treeL) # (268): tree= (274): tree= ... (328): tree=\n preParse(treeR) # (278): tree= (282): tree= ... (332): tree=\n \ndef inParse(tree): # (4): inParse=\n ID = tree.ID # (337): ID=0 (342): ID=2 ... (407): ID=-1\n if ID == -1: # (338): NO CHANGE (343): NO CHANGE ... (408): NO CHANGE\n return # (349): tree=, ID=2, treeL=, treeR= (354): tree=, ID=0, treeL=, treeR= ... (409): N=9, T=[None, None, None, None, None, None, None, None, None], Tree=, preParse=, inParse=, posParse=, trees=[[0, 2, 4], [1, 0, 3], [2, -1, -1], [3, -1, -1], [4, 5, 8], [5, 6, 7], [6, -1, -1], [7, -1, -1], [8, -1, -1]], ID=0, tree=, preList=[0, 2, 4, 5, 6, 7, 8], inList=[2, 0, 6, 5, 7, 4, 8], posList=[]\n else:\n global inList\n treeL = tree.l # (339): treeL= (344): treeL= ... (399): treeL=\n treeR = tree.r # (340): treeR= (345): treeR= ... (400): treeR=\n inParse(treeL) # (341): tree= (346): tree= ... (401): tree=\n inList.append(ID) # (350): NO CHANGE (355): NO CHANGE ... (405): NO CHANGE\n inParse(treeR) # (351): tree= (356): tree= ... (406): tree=\n\ndef posParse(tree): # (5): posParse=\n ID = tree.ID # (411): ID=0 (416): ID=2 ... (478): ID=-1\n if ID == -1: # (412): NO CHANGE (417): NO CHANGE ... (479): NO CHANGE\n return # (423): tree=, ID=2, treeL=, treeR= (427): tree=, ID=2, treeL=, treeR= ... (480): tree=, ID=8, treeL=, treeR=\n else:\n global posList\n treeL = tree.l # (413): treeL= (418): treeL= ... (471): treeL=\n treeR = tree.r # (414): treeR= (419): treeR= ... (472): treeR=\n posParse(treeL) # (415): tree= (420): tree= ... (473): tree=\n posParse(treeR) # (424): tree= (429): tree= ... (477): tree=\n posList.append(ID) # (428): tree=, ID=0, treeL=, treeR= (452): tree=, ID=5, treeL=, treeR= ... (483): N=9, T=[None, None, None, None, None, None, None, None, None], Tree=, preParse=, inParse=, posParse=, trees=[[0, 2, 4], [1, 0, 3], [2, -1, -1], [3, -1, -1], [4, 5, 8], [5, 6, 7], [6, -1, -1], [7, -1, -1], [8, -1, -1]], preList=[0, 2, 4, 5, 6, 7, 8], inList=[2, 0, 6, 5, 7, 4, 8], posList=[2, 6, 7, 5, 8, 4, 0]\n \n \ntrees = [list(map(int,input().split())) for i in range(N)] # (6): trees\nID = trees[0][0] # (7): ID=0\ntree = Tree(ID) # (8): self=, p=-1\nTree.makeTree(Tree,tree) # (10): self=\n\npreList = [] # (259): preList=[]\ninList = [] # (260): inList=[]\nposList = [] # (261): posList=[]\npreParse(tree) # (262): NO CHANGE\ninParse(tree) # (336): NO CHANGE\nposParse(tree) # (410): NO CHANGE\n\ndef convert(List, order): # (484): convert=\n a = \" \" + \" \".join([str(num) for num in List]) # (486): a= 0 2 4 5 6 7 8 (490): a= 2 0 6 5 7 4 8 (494): a= 2 6 7 5 8 4 0\n print(\"{}\".format(order)) # (487): NO CHANGE (491): NO CHANGE (495): NO CHANGE\n print(a) # (488): N=9, T=[None, None, None, None, None, None, None, None, None], Tree=, preParse=, inParse=, posParse=, trees=[[0, 2, 4], [1, 0, 3], [2, -1, -1], [3, -1, -1], [4, 5, 8], [5, 6, 7], [6, -1, -1], [7, -1, -1], [8, -1, -1]], ID=0, tree=, preList=[0, 2, 4, 5, 6, 7, 8], inList=[2, 0, 6, 5, 7, 4, 8], posList=[2, 6, 7, 5, 8, 4, 0], convert= (492): N=9, T=[None, None, None, None, None, None, None, None, None], Tree=, preParse=, inParse=, posParse=, trees=[[0, 2, 4], [1, 0, 3], [2, -1, -1], [3, -1, -1], [4, 5, 8], [5, 6, 7], [6, -1, -1], [7, -1, -1], [8, -1, -1]], ID=0, tree=, preList=[0, 2, 4, 5, 6, 7, 8], inList=[2, 0, 6, 5, 7, 4, 8], posList=[2, 6, 7, 5, 8, 4, 0], convert=\nconvert(preList, \"Preorder\") # (485): List=[0, 2, 4, 5, 6, 7, 8], order=Preorder\nconvert(inList, \"Inorder\") # (489): List=[2, 0, 6, 5, 7, 4, 8], order=Inorder\nconvert(posList, \"Postorder\") # (493): List=[2, 6, 7, 5, 8, 4, 0], order=Postorder\n"], "anno_status": [false], "diff_content": " \n N = int(input())\n-T = [None for i in range(N)]\n+T = []\n class Tree:\n- def __init__(self, ID,p=-1):\n+ def __init__(self,ID,l=None,r=None,p=-1):\n self.ID = ID\n+ self.l = l\n+ self.r = r\n+ self.p = p\n \n- def makeTree(self, tree):\n- ID = tree.ID\n- if ID == -1:\n- return\n- else:\n- for i in range(N):\n- if trees[i][0] == ID:\n- [ID,l,r] = trees[i]\n- tree.l = Tree(l)\n- tree.r = Tree(r)\n- treeL = tree.l\n- treeR = tree.r\n- treeL.p = tree\n- treeR.p = tree\n+ def makeTree(self):\n+ for i in range(N):\n+ T.append(Tree(i))\n \n- self.makeTree(self,treeL)\n- self.makeTree(self,treeR)\n \n def preParse(tree):\n- ID = tree.ID\n- if ID == -1:\n+ if tree == None:\n return\n else:\n+ ID = tree.ID\n global preList\n preList.append(ID)\n- treeL = tree.l\n- treeR = tree.r\n- preParse(treeL)\n- preParse(treeR)\n+ preParse(tree.l)\n+ preParse(tree.r)\n \n def inParse(tree):\n- ID = tree.ID\n- if ID == -1:\n+ if tree == None:\n return\n else:\n+ ID = tree.ID\n global inList\n- treeL = tree.l\n- treeR = tree.r\n- inParse(treeL)\n+ inParse(tree.l)\n inList.append(ID)\n- inParse(treeR)\n+ inParse(tree.r)\n \n def posParse(tree):\n- ID = tree.ID\n- if ID == -1:\n+ if tree == None:\n return\n else:\n+ ID = tree.ID\n global posList\n- treeL = tree.l\n- treeR = tree.r\n- posParse(treeL)\n- posParse(treeR)\n+ posParse(tree.l)\n+ posParse(tree.r)\n posList.append(ID)\n \n \n trees = [list(map(int,input().split())) for i in range(N)]\n-ID = trees[0][0]\n-tree = Tree(ID)\n-Tree.makeTree(Tree,tree)\n+Tree.makeTree(Tree)\n+for i in range(N):\n+ ID,l,r = trees[i]\n+ tree = T[ID]\n+ if l != -1:\n+ T[l].p = tree\n+ tree.l = T[l]\n+ if r != -1:\n+ T[r].p = tree\n+ tree.r = T[r]\n+ \n+for i in range(N):\n+ if T[i].p == -1:\n+ parent = T[i]\n \n preList = []\n inList = []\n posList = []\n-preParse(tree)\n-inParse(tree)\n-posParse(tree)\n+preParse(parent)\n+inParse(parent)\n+posParse(parent)\n \n def convert(List, order):\n a = \" \" + \" \".join([str(num) for num in List])\n print(\"{}\".format(order))\n print(a)\n convert(preList, \"Preorder\")\n convert(inList, \"Inorder\")\n convert(posList, \"Postorder\")\n \n+\n", "FL_content": " \n N = int(input())\n-T = [None for i in range(N)]\n class Tree:\n- def __init__(self, ID,p=-1):\n self.ID = ID\n \n- def makeTree(self, tree):\n- ID = tree.ID\n- if ID == -1:\n- return\n- else:\n- for i in range(N):\n- if trees[i][0] == ID:\n- [ID,l,r] = trees[i]\n- tree.l = Tree(l)\n- tree.r = Tree(r)\n- treeL = tree.l\n- treeR = tree.r\n- treeL.p = tree\n- treeR.p = tree\n \n- self.makeTree(self,treeL)\n- self.makeTree(self,treeR)\n \n def preParse(tree):\n- ID = tree.ID\n- if ID == -1:\n return\n else:\n global preList\n preList.append(ID)\n- treeL = tree.l\n- treeR = tree.r\n- preParse(treeL)\n- preParse(treeR)\n \n def inParse(tree):\n- ID = tree.ID\n- if ID == -1:\n return\n else:\n global inList\n- treeL = tree.l\n- treeR = tree.r\n- inParse(treeL)\n inList.append(ID)\n- inParse(treeR)\n \n def posParse(tree):\n- ID = tree.ID\n- if ID == -1:\n return\n else:\n global posList\n- treeL = tree.l\n- treeR = tree.r\n- posParse(treeL)\n- posParse(treeR)\n posList.append(ID)\n \n \n trees = [list(map(int,input().split())) for i in range(N)]\n-ID = trees[0][0]\n-tree = Tree(ID)\n-Tree.makeTree(Tree,tree)\n \n preList = []\n inList = []\n posList = []\n-preParse(tree)\n-inParse(tree)\n-posParse(tree)\n \n def convert(List, order):\n a = \" \" + \" \".join([str(num) for num in List])\n print(\"{}\".format(order))\n print(a)\n convert(preList, \"Preorder\")\n convert(inList, \"Inorder\")\n convert(posList, \"Postorder\")\n \n", "added_lines": 38, "removed_lines": 42, "code1_lines": 82 }, { "user_id": "u113295414", "problem_id": "p02281", "submission1_id": "s400383604", "submission2_id": "s328944268", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ntree = [[-1, -1, True] for i in range(n)]\nfor i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n\ndef preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n\ndef inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n\ndef postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n\nroot = 0\nfor i, node in enumerate(tree):\n if node[2] == True:\n root = i\n\nprint('Preoder')\npreoder(root)\nprint('')\nprint('Inorder')\ninorder(root)\nprint('')\nprint('Postorder')\npostorder(root)\n\n", "code2": "n = int(input())\ntree = [[-1, -1, True] for i in range(n)]\nfor i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n\ndef preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n\ndef inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n\ndef postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n\nroot = 0\nfor i, node in enumerate(tree):\n if node[2] == True:\n root = i\n\nprint('Preorder')\npreoder(root)\nprint('')\nprint('Inorder')\ninorder(root)\nprint('')\nprint('Postorder')\npostorder(root)\nprint('')\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529226904", "date2": "1529227142", "bleu_score": "0.9857904237898695", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preoder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["n = int(input()) # (0): n=9\ntree = [[-1, -1, True] for i in range(n)] # (1): tree\nfor i in range(n): # (2): i=0 (10): i=1 ... (56): NO CHANGE\n id, left, right = map(int, input().split()) # (3): id=0, left=2, right=4 (11): id=1, left=0, right=3 ... (53): id=8\n if left != -1: # (4): NO CHANGE (12): NO CHANGE ... (54): NO CHANGE\n tree[id][0] = left # (5): tree (13): tree ... (39): tree\n tree[left][2] = False # (6): tree (14): tree ... (40): tree\n if right != -1: # (7): NO CHANGE (15): NO CHANGE ... (55): NO CHANGE\n tree[id][1] = right # (8): tree (16): tree ... (42): tree\n tree[right][2] = False # (9): tree (17): tree ... (43): tree\n\ndef preoder(id): # (57): preoder=\n if id == -1: # (83): NO CHANGE (86): NO CHANGE ... (179): NO CHANGE\n return # (93): id=2 (96): id=0 ... (180): n=9, tree, i=8, id=8, left=-1, right=-1, preoder=, inorder=, postorder=, root=1, node=[-1, -1, False]\n print(' ' + str(id), end='') # (84): NO CHANGE (87): NO CHANGE ... (174): NO CHANGE\n preoder(tree[id][0]) # (85): id=0 (88): id=2 ... (175): id=-1\n preoder(tree[id][1]) # (94): id=-1 (97): id=4 ... (178): id=-1\n\ndef inorder(id): # (58): inorder=\n if id == -1: # (184): NO CHANGE (186): NO CHANGE ... (280): NO CHANGE\n return # (191): id=2 (195): id=0 ... (281): n=9, tree, i=8, id=8, left=-1, right=-1, preoder=, inorder=, postorder=, root=1, node=[-1, -1, False]\n inorder(tree[id][0]) # (185): id=0 (187): id=2 ... (275): id=-1\n print(' ' + str(id), end='') # (192): NO CHANGE (196): NO CHANGE ... (278): NO CHANGE\n inorder(tree[id][1]) # (193): id=-1 (197): id=4 ... (279): id=-1\n\ndef postorder(id): # (59): postorder=\n if id == -1: # (285): NO CHANGE (287): NO CHANGE ... (376): NO CHANGE\n return # (292): id=2 (295): id=2 ... (377): id=8\n postorder(tree[id][0]) # (286): id=0 (288): id=2 ... (372): id=-1\n postorder(tree[id][1]) # (293): id=-1 (297): id=4 ... (375): id=-1\n print(' ' + str(id), end='') # (296): id=0 (309): id=5 ... (381): id=1\n\nroot = 0 # (60): root=0\nfor i, node in enumerate(tree): # (61): i=0, node=[2, 4, False] (63): i=1, node=[0, 3, True] ... (80): NO CHANGE\n if node[2] == True: # (62): NO CHANGE (64): NO CHANGE ... (79): NO CHANGE\n root = i # (65): root=1\n\nprint('Preoder') # (81): NO CHANGE\npreoder(root) # (82): id=1\nprint('') # (181): NO CHANGE\nprint('Inorder') # (182): NO CHANGE\ninorder(root) # (183): id=1\nprint('') # (282): NO CHANGE\nprint('Postorder') # (283): NO CHANGE\npostorder(root) # (284): id=1\n\n"], "anno_status": [false], "diff_content": " n = int(input())\n tree = [[-1, -1, True] for i in range(n)]\n for i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n \n def preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n \n def inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n \n def postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n \n root = 0\n for i, node in enumerate(tree):\n if node[2] == True:\n root = i\n \n-print('Preoder')\n+print('Preorder')\n preoder(root)\n print('')\n print('Inorder')\n inorder(root)\n print('')\n print('Postorder')\n postorder(root)\n+print('')\n \n \n", "FL_content": " n = int(input())\n tree = [[-1, -1, True] for i in range(n)]\n for i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n \n def preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n \n def inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n \n def postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n \n root = 0\n for i, node in enumerate(tree):\n if node[2] == True:\n root = i\n \n-print('Preoder')\n preoder(root)\n print('')\n print('Inorder')\n inorder(root)\n print('')\n print('Postorder')\n postorder(root)\n \n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 47 }, { "user_id": "u777299405", "problem_id": "p02281", "submission1_id": "s259446344", "submission2_id": "s617632377", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ntree = [0] * n\nroot = set(range(n))\nfor i in range(n):\n node_id, left, right = map(int, input().split())\n tree[node_id] = (left, right)\n root -= {left, right}\nroot_node = root.pop()\n\n\ndef preorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield i\n yield from preorder(left)\n yield from preorder(right)\n\n\ndef inorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from inorder(left)\n yield i\n yield from inorder(right)\n\n\ndef postorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from postorder(left)\n yield from postorder(right)\n yield i\n\nprint(\"preorder\\n \", end=\"\")\nprint(*preorder(root_node))\nprint(\"inorder\\n \", end=\"\")\nprint(*inorder(root_node))\nprint(\"postorder\\n \", end=\"\")\nprint(*postorder(root_node))", "code2": "n = int(input())\ntree = [0] * n\nroot = set(range(n))\nfor i in range(n):\n node_id, left, right = map(int, input().split())\n tree[node_id] = (left, right)\n root -= {left, right}\nroot_node = root.pop()\n\n\ndef preorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield i\n yield from preorder(left)\n yield from preorder(right)\n\n\ndef inorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from inorder(left)\n yield i\n yield from inorder(right)\n\n\ndef postorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from postorder(left)\n yield from postorder(right)\n yield i\n\nprint(\"Preorder\\n \", end=\"\")\nprint(*preorder(root_node))\nprint(\"Inorder\\n \", end=\"\")\nprint(*inorder(root_node))\nprint(\"Postorder\\n \", end=\"\")\nprint(*postorder(root_node))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1501825512", "date2": "1501825818", "bleu_score": "0.9909555627696582", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 1 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "preorder\n 0 2 4 5 6 7 8\ninorder\n 2 0 6 5 7 4 8\npostorder\n 2 6 7 5 8 4 0\n", "expected_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0\n\n", "anno_code": ["n = int(input()) # (0): n=9\ntree = [0] * n # (1): tree=[0, 0, 0, 0, 0, 0, 0, 0, 0]\nroot = set(range(n)) # (2): root={0, 1, 2, 3, 4, 5, 6, 7, 8}\nfor i in range(n): # (3): i=0 (7): tree=[(2, 4), 0, 0, 0, 0, 0, 0, 0, 0], i=1 ... (39): NO CHANGE\n node_id, left, right = map(int, input().split()) # (4): node_id=0, left=2, right=4 (8): tree=[(2, 4), 0, 0, 0, 0, 0, 0, 0, 0], node_id=1, left=1, right=3 ... (36): tree=[(2, 4), (1, 3), (-1, -1), (-1, -1), (5, 8), (6, 7), (-1, -1), (-1, -1), 0], node_id=8\n tree[node_id] = (left, right) # (5): tree=[(2, 4), 0, 0, 0, 0, 0, 0, 0, 0] (9): tree=[(2, 4), (1, 3), 0, 0, 0, 0, 0, 0, 0] ... (37): tree=[(2, 4), (1, 3), (-1, -1), (-1, -1), (5, 8), (6, 7), (-1, -1), (-1, -1), (-1, -1)]\n root -= {left, right} # (6): tree=[(2, 4), 0, 0, 0, 0, 0, 0, 0, 0], root={0, 1, 3, 5, 6, 7, 8} (10): tree=[(2, 4), (1, 3), 0, 0, 0, 0, 0, 0, 0], root={0, 5, 6, 7, 8} ... (38): NO CHANGE\nroot_node = root.pop() # (40): root=set(), root_node=0\n\n\ndef preorder(i): # (41): preorder=\n if i == -1: # (46): NO CHANGE (50): NO CHANGE ... (95): NO CHANGE\n return # (55): i=2, left=-1, right=-1 (58): i=0, left=2, right=4 ... (96): n=9, tree=[(2, 4), (1, 3), (-1, -1), (-1, -1), (5, 8), (6, 7), (-1, -1), (-1, -1), (-1, -1)], root=set(), i=8, node_id=8, left=-1, right=-1, root_node=0, preorder=, inorder=, postorder=\n (left, right) = tree[i] # (47): left=2, right=4 (51): left=-1, right=-1 ... (89): left=-1, right=-1\n yield i # (48): NO CHANGE (52): NO CHANGE ... (90): NO CHANGE\n yield from preorder(left) # (49): i=2 (53): i=-1 ... (91): i=-1\n yield from preorder(right) # (56): i=-1 (59): i=4 ... (94): i=-1\n\n\ndef inorder(i): # (42): inorder=\n if i == -1: # (99): NO CHANGE (102): NO CHANGE ... (148): NO CHANGE\n return # (106): i=2, left=-1, right=-1 (110): i=0, left=2, right=4 ... (149): n=9, tree=[(2, 4), (1, 3), (-1, -1), (-1, -1), (5, 8), (6, 7), (-1, -1), (-1, -1), (-1, -1)], root=set(), i=8, node_id=8, left=-1, right=-1, root_node=0, preorder=, inorder=, postorder=\n (left, right) = tree[i] # (100): left=2, right=4 (103): left=-1, right=-1 ... (142): left=-1, right=-1\n yield from inorder(left) # (101): i=2 (104): i=-1 ... (143): i=-1\n yield i # (107): NO CHANGE (111): NO CHANGE ... (146): NO CHANGE\n yield from inorder(right) # (108): i=-1 (112): i=4 ... (147): i=-1\n\n\ndef postorder(i): # (43): postorder=\n if i == -1: # (152): NO CHANGE (155): NO CHANGE ... (198): NO CHANGE\n return # (159): i=2, left=-1, right=-1 (162): i=2, left=-1, right=-1 ... (199): i=8, left=-1, right=-1\n (left, right) = tree[i] # (153): left=2, right=4 (156): left=-1, right=-1 ... (193): left=-1, right=-1\n yield from postorder(left) # (154): i=2 (157): i=-1 ... (194): i=-1\n yield from postorder(right) # (160): i=-1 (164): i=4 ... (197): i=-1\n yield i # (163): i=0, left=2, right=4 (179): i=5, left=6, right=7 ... (201): i=0, left=2, right=4\n\nprint(\"preorder\\n \", end=\"\") # (44): NO CHANGE\nprint(*preorder(root_node)) # (45): i=0\nprint(\"inorder\\n \", end=\"\") # (97): NO CHANGE\nprint(*inorder(root_node)) # (98): i=0\nprint(\"postorder\\n \", end=\"\") # (150): NO CHANGE\nprint(*postorder(root_node)) # (151): i=0\n"], "anno_status": [false], "diff_content": " n = int(input())\n tree = [0] * n\n root = set(range(n))\n for i in range(n):\n node_id, left, right = map(int, input().split())\n tree[node_id] = (left, right)\n root -= {left, right}\n root_node = root.pop()\n \n \n def preorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield i\n yield from preorder(left)\n yield from preorder(right)\n \n \n def inorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from inorder(left)\n yield i\n yield from inorder(right)\n \n \n def postorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from postorder(left)\n yield from postorder(right)\n yield i\n \n-print(\"preorder\\n \", end=\"\")\n+print(\"Preorder\\n \", end=\"\")\n print(*preorder(root_node))\n-print(\"inorder\\n \", end=\"\")\n+print(\"Inorder\\n \", end=\"\")\n print(*inorder(root_node))\n-print(\"postorder\\n \", end=\"\")\n+print(\"Postorder\\n \", end=\"\")\n print(*postorder(root_node))\n", "FL_content": " n = int(input())\n tree = [0] * n\n root = set(range(n))\n for i in range(n):\n node_id, left, right = map(int, input().split())\n tree[node_id] = (left, right)\n root -= {left, right}\n root_node = root.pop()\n \n \n def preorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield i\n yield from preorder(left)\n yield from preorder(right)\n \n \n def inorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from inorder(left)\n yield i\n yield from inorder(right)\n \n \n def postorder(i):\n if i == -1:\n return\n (left, right) = tree[i]\n yield from postorder(left)\n yield from postorder(right)\n yield i\n \n-print(\"preorder\\n \", end=\"\")\n print(*preorder(root_node))\n-print(\"inorder\\n \", end=\"\")\n print(*inorder(root_node))\n-print(\"postorder\\n \", end=\"\")\n print(*postorder(root_node))\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 42 }, { "user_id": "u089830331", "problem_id": "p02281", "submission1_id": "s811679059", "submission2_id": "s796801487", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef walk(T, nid, order):\n if nid < 0: return\n lid, rid = T[nid]\n\n if order == \"pre\":\n sys.stdout.write(\" \" + str(nid))\n walk(T, lid, order)\n walk(T, rid, order)\n elif order == \"in\":\n walk(T, lid, order)\n sys.stdout.write(\" \" + str(nid))\n walk(T, rid, order)\n else:\n walk(T, lid, order)\n walk(T, rid, order)\n sys.stdout.write(\" \" + str(nid))\n\nT = {}\nfor i in range(int(input())):\n nid, lid, rid = map(int, input().split())\n T[nid] = [lid, rid]\n\nprint(\"Preorder\"), walk(T, 0, \"pre\"), print()\nprint(\"Inorder\"), walk(T, 0, \"in\"), print()\nprint(\"Postorder\"), walk(T, 0, \"post\"), print()", "code2": "import sys\n\ndef walk(T, nid, order):\n if nid < 0: return\n pid, lid, rid = T[nid]\n\n if order == \"pre\":\n sys.stdout.write(\" \" + str(nid))\n walk(T, lid, order)\n walk(T, rid, order)\n elif order == \"in\":\n walk(T, lid, order)\n sys.stdout.write(\" \" + str(nid))\n walk(T, rid, order)\n else:\n walk(T, lid, order)\n walk(T, rid, order)\n sys.stdout.write(\" \" + str(nid))\n\nT = {}\nfor i in range(int(input())):\n nid, lid, rid = map(int, input().split())\n T[nid] = [-1, lid, rid]\n\n\nfor nid in T:\n pid, lid, rid = T[nid]\n if lid >= 0: T[lid][0] = nid\n if rid >= 0: T[rid][0] = nid\n\n\nfor nid in T:\n if T[nid][0] == -1: root_id = nid\n\nprint(\"Preorder\"), walk(T, root_id, \"pre\"), print()\nprint(\"Inorder\"), walk(T, root_id, \"in\"), print()\nprint(\"Postorder\"), walk(T, root_id, \"post\"), print()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1490570947", "date2": "1490571333", "bleu_score": "0.7663845347667255", "code1_test_status": [1, 1, 0, 0, 0], "code1_test_score": 2, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3\nInorder\n 2 0 6 5 7 4 8 1 3\nPostorder\n 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["import sys\n\ndef walk(T, nid, order): # (0): walk=\n if nid < 0: return # (31): NO CHANGE (36): NO CHANGE ... (193): nid=8, lid=-1, rid=-1\n lid, rid = T[nid] # (32): lid=2, rid=4 (37): lid=-1, rid=-1 ... (187): lid=-1, rid=-1\n\n if order == \"pre\": # (33): NO CHANGE (38): NO CHANGE ... (188): NO CHANGE\n sys.stdout.write(\" \" + str(nid)) # (34): NO CHANGE (39): NO CHANGE ... (76): NO CHANGE\n walk(T, lid, order) # (35): nid=2 (40): nid=-1 ... (77): nid=-1\n walk(T, rid, order) # (42): nid=-1 (44): nid=4 ... (79): nid=-1\n elif order == \"in\": # (85): NO CHANGE (90): NO CHANGE ... (189): NO CHANGE\n walk(T, lid, order) # (86): nid=2 (91): nid=-1 ... (134): nid=-1\n sys.stdout.write(\" \" + str(nid)) # (93): NO CHANGE (96): NO CHANGE ... (136): NO CHANGE\n walk(T, rid, order) # (94): nid=-1 (97): nid=4 ... (137): nid=-1\n else:\n walk(T, lid, order) # (144): nid=2 (149): nid=-1 ... (190): nid=-1\n walk(T, rid, order) # (151): nid=-1 (154): nid=4 ... (192): nid=-1\n sys.stdout.write(\" \" + str(nid)) # (153): nid=0, lid=2, rid=4 (173): nid=5, lid=6, rid=7 ... (195): nid=0, lid=2, rid=4\n\nT = {} # (1): T={}\nfor i in range(int(input())): # (2): i=0 (5): i=1 ... (29): NO CHANGE\n nid, lid, rid = map(int, input().split()) # (3): nid=0, lid=2, rid=4 (6): nid=1, lid=0, rid=3 ... (27): nid=8\n T[nid] = [lid, rid] # (4): T={0: [2, 4]} (7): T={0: [2, 4], 1: [0, 3]} ... (28): T={0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, -1], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]}\n\nprint(\"Preorder\"), walk(T, 0, \"pre\"), print() # (30): nid=0, order=pre\nprint(\"Inorder\"), walk(T, 0, \"in\"), print() # (81): nid=0, order=in\nprint(\"Postorder\"), walk(T, 0, \"post\"), print() # (139): nid=0, order=post\n"], "anno_status": [true], "diff_content": " import sys\n \n def walk(T, nid, order):\n if nid < 0: return\n- lid, rid = T[nid]\n+ pid, lid, rid = T[nid]\n \n if order == \"pre\":\n sys.stdout.write(\" \" + str(nid))\n walk(T, lid, order)\n walk(T, rid, order)\n elif order == \"in\":\n walk(T, lid, order)\n sys.stdout.write(\" \" + str(nid))\n walk(T, rid, order)\n else:\n walk(T, lid, order)\n walk(T, rid, order)\n sys.stdout.write(\" \" + str(nid))\n \n T = {}\n for i in range(int(input())):\n nid, lid, rid = map(int, input().split())\n- T[nid] = [lid, rid]\n+ T[nid] = [-1, lid, rid]\n \n-print(\"Preorder\"), walk(T, 0, \"pre\"), print()\n-print(\"Inorder\"), walk(T, 0, \"in\"), print()\n-print(\"Postorder\"), walk(T, 0, \"post\"), print()\n+\n+for nid in T:\n+ pid, lid, rid = T[nid]\n+ if lid >= 0: T[lid][0] = nid\n+ if rid >= 0: T[rid][0] = nid\n+\n+\n+for nid in T:\n+ if T[nid][0] == -1: root_id = nid\n+\n+print(\"Preorder\"), walk(T, root_id, \"pre\"), print()\n+print(\"Inorder\"), walk(T, root_id, \"in\"), print()\n+print(\"Postorder\"), walk(T, root_id, \"post\"), print()\n", "FL_content": " import sys\n \n def walk(T, nid, order):\n if nid < 0: return\n- lid, rid = T[nid]\n \n if order == \"pre\":\n sys.stdout.write(\" \" + str(nid))\n walk(T, lid, order)\n walk(T, rid, order)\n elif order == \"in\":\n walk(T, lid, order)\n sys.stdout.write(\" \" + str(nid))\n walk(T, rid, order)\n else:\n walk(T, lid, order)\n walk(T, rid, order)\n sys.stdout.write(\" \" + str(nid))\n \n T = {}\n for i in range(int(input())):\n nid, lid, rid = map(int, input().split())\n- T[nid] = [lid, rid]\n \n-print(\"Preorder\"), walk(T, 0, \"pre\"), print()\n-print(\"Inorder\"), walk(T, 0, \"in\"), print()\n-print(\"Postorder\"), walk(T, 0, \"post\"), print()\n", "added_lines": 15, "removed_lines": 5, "code1_lines": 27 }, { "user_id": "u798803522", "problem_id": "p02281", "submission1_id": "s861790031", "submission2_id": "s520571577", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\ndef preorder(here, conn, chain):\n if here == -1:\n return\n chain.append(here)\n if conn[here]:\n preorder(conn[here][0], conn, chain)\n preorder(conn[here][1], conn, chain)\n\ndef inorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n inorder(conn[here][0], conn, chain)\n chain.append(here)\n inorder(conn[here][1], conn, chain)\n\ndef postorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n postorder(conn[here][0], conn, chain)\n postorder(conn[here][1], conn, chain)\n chain.append(here)\n\nquery = int(input())\nconnect = defaultdict(list)\nfor _ in range(query):\n here, left, right = (int(n) for n in input().split(\" \"))\n connect[here] = [left, right]\npreo = []\nino = []\nposto = []\npreorder(0, connect, preo)\ninorder(0, connect, ino)\npostorder(0, connect, posto)\n\nprint(\"Preorder\")\nprint(*preo)\nprint(\"Inorder\")\nprint(*ino)\nprint(\"Postorder\")\nprint(*posto)", "code2": "from collections import defaultdict\ndef preorder(here, conn, chain):\n if here == -1:\n return\n chain.append(here)\n if conn[here]:\n preorder(conn[here][0], conn, chain)\n preorder(conn[here][1], conn, chain)\n\ndef inorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n inorder(conn[here][0], conn, chain)\n chain.append(here)\n inorder(conn[here][1], conn, chain)\n\ndef postorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n postorder(conn[here][0], conn, chain)\n postorder(conn[here][1], conn, chain)\n chain.append(here)\n\nquery = int(input())\nconnect = defaultdict(list)\nin_v = [0 for n in range(query + 1)]\nfor _ in range(query):\n here, left, right = (int(n) for n in input().split(\" \"))\n connect[here] = [left, right]\n in_v[left] += 1\n in_v[right] += 1\nfor i in range(query):\n if not in_v[i]:\n root = i\n break\npreo = []\nino = []\nposto = []\npreorder(root, connect, preo)\ninorder(root, connect, ino)\npostorder(root, connect, posto)\n\nprint(\"Preorder\")\nprint(\"\", end = \" \")\nprint(*preo)\nprint(\"Inorder\")\nprint(\"\", end = \" \")\nprint(*ino)\nprint(\"Postorder\")\nprint(\"\", end = \" \")\nprint(*posto)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1509797617", "date2": "1509811807", "bleu_score": "0.8112931286711907", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n0 2 4 5 6 7 8\nInorder\n2 0 6 5 7 4 8\nPostorder\n2 6 7 5 8 4 0\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["from collections import defaultdict\ndef preorder(here, conn, chain): # (0): preorder=\n if here == -1: # (37): NO CHANGE (41): NO CHANGE ... (86): NO CHANGE\n return # (46): here=2 (49): here=0 ... (87): defaultdict=, preorder=, inorder=, postorder=, query=9, connect=defaultdict(, {0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, 0], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]}), _=8, here=8, left=-1, right=-1, preo=[0, 2, 4, 5, 6, 7, 8], ino=[], posto=[]\n chain.append(here) # (38): chain=[0] (42): chain=[0, 2] ... (80): chain=[0, 2, 4, 5, 6, 7, 8]\n if conn[here]: # (39): NO CHANGE (43): NO CHANGE ... (81): NO CHANGE\n preorder(conn[here][0], conn, chain) # (40): here=2 (44): here=-1 ... (82): here=-1\n preorder(conn[here][1], conn, chain) # (47): here=-1 (50): here=4 ... (85): here=-1\n\ndef inorder(here, conn, chain): # (1): inorder=\n if here == -1: # (89): NO CHANGE (92): NO CHANGE ... (138): NO CHANGE\n return # (96): here=2 (100): here=0 ... (139): defaultdict=, preorder=, inorder=, postorder=, query=9, connect=defaultdict(, {0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, 0], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]}), _=8, here=8, left=-1, right=-1, preo=[0, 2, 4, 5, 6, 7, 8], ino=[2, 0, 6, 5, 7, 4, 8], posto=[]\n if conn[here]: # (90): NO CHANGE (93): NO CHANGE ... (132): NO CHANGE\n inorder(conn[here][0], conn, chain) # (91): here=2 (94): here=-1 ... (133): here=-1\n chain.append(here) # (97): chain=[2] (101): chain=[2, 0] ... (136): chain=[2, 0, 6, 5, 7, 4, 8]\n inorder(conn[here][1], conn, chain) # (98): here=-1 (102): here=4 ... (137): here=-1\n\ndef postorder(here, conn, chain): # (2): postorder=\n if here == -1: # (141): NO CHANGE (144): NO CHANGE ... (187): NO CHANGE\n return # (148): here=2 (151): here=2 ... (188): here=8\n if conn[here]: # (142): NO CHANGE (145): NO CHANGE ... (182): NO CHANGE\n postorder(conn[here][0], conn, chain) # (143): here=2 (146): here=-1 ... (183): here=-1\n postorder(conn[here][1], conn, chain) # (149): here=-1 (153): here=4 ... (186): here=-1\n chain.append(here) # (152): here=0, chain=[2] (168): here=5, chain=[2, 6] ... (191): defaultdict=, preorder=, inorder=, postorder=, query=9, connect=defaultdict(, {0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, 0], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]}), _=8, here=8, left=-1, right=-1, preo=[0, 2, 4, 5, 6, 7, 8], ino=[2, 0, 6, 5, 7, 4, 8], posto=[2, 6, 7, 5, 8, 4, 0]\n\nquery = int(input()) # (3): query=9\nconnect = defaultdict(list) # (4): connect=defaultdict(, {})\nfor _ in range(query): # (5): _=0 (8): _=1 ... (32): NO CHANGE\n here, left, right = (int(n) for n in input().split(\" \")) # (6): here=0, left=2, right=4 (9): here=1, left=0, right=3 ... (30): here=8\n connect[here] = [left, right] # (7): connect=defaultdict(, {0: [2, 4]}) (10): connect=defaultdict(, {0: [2, 4], 1: [0, 3]}) ... (31): connect=defaultdict(, {0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, 0], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]})\npreo = [] # (33): preo=[]\nino = [] # (34): ino=[]\nposto = [] # (35): posto=[]\npreorder(0, connect, preo) # (36): here=0, conn=defaultdict(, {0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, 0], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]}), chain=[]\ninorder(0, connect, ino) # (88): here=0, conn=defaultdict(, {0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, 0], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]}), chain=[]\npostorder(0, connect, posto) # (140): here=0, conn=defaultdict(, {0: [2, 4], 1: [0, 3], 2: [-1, -1], 3: [-1, 0], 4: [5, 8], 5: [6, 7], 6: [-1, -1], 7: [-1, -1], 8: [-1, -1]}), chain=[]\n\nprint(\"Preorder\") # (192): NO CHANGE\nprint(*preo) # (193): NO CHANGE\nprint(\"Inorder\") # (194): NO CHANGE\nprint(*ino) # (195): NO CHANGE\nprint(\"Postorder\") # (196): NO CHANGE\nprint(*posto)"], "anno_status": [false], "diff_content": " from collections import defaultdict\n def preorder(here, conn, chain):\n if here == -1:\n return\n chain.append(here)\n if conn[here]:\n preorder(conn[here][0], conn, chain)\n preorder(conn[here][1], conn, chain)\n \n def inorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n inorder(conn[here][0], conn, chain)\n chain.append(here)\n inorder(conn[here][1], conn, chain)\n \n def postorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n postorder(conn[here][0], conn, chain)\n postorder(conn[here][1], conn, chain)\n chain.append(here)\n \n query = int(input())\n connect = defaultdict(list)\n+in_v = [0 for n in range(query + 1)]\n for _ in range(query):\n here, left, right = (int(n) for n in input().split(\" \"))\n connect[here] = [left, right]\n+ in_v[left] += 1\n+ in_v[right] += 1\n+for i in range(query):\n+ if not in_v[i]:\n+ root = i\n+ break\n preo = []\n ino = []\n posto = []\n-preorder(0, connect, preo)\n-inorder(0, connect, ino)\n-postorder(0, connect, posto)\n+preorder(root, connect, preo)\n+inorder(root, connect, ino)\n+postorder(root, connect, posto)\n \n print(\"Preorder\")\n+print(\"\", end = \" \")\n print(*preo)\n print(\"Inorder\")\n+print(\"\", end = \" \")\n print(*ino)\n print(\"Postorder\")\n+print(\"\", end = \" \")\n print(*posto)\n", "FL_content": " from collections import defaultdict\n def preorder(here, conn, chain):\n if here == -1:\n return\n chain.append(here)\n if conn[here]:\n preorder(conn[here][0], conn, chain)\n preorder(conn[here][1], conn, chain)\n \n def inorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n inorder(conn[here][0], conn, chain)\n chain.append(here)\n inorder(conn[here][1], conn, chain)\n \n def postorder(here, conn, chain):\n if here == -1:\n return\n if conn[here]:\n postorder(conn[here][0], conn, chain)\n postorder(conn[here][1], conn, chain)\n chain.append(here)\n \n query = int(input())\n connect = defaultdict(list)\n for _ in range(query):\n here, left, right = (int(n) for n in input().split(\" \"))\n connect[here] = [left, right]\n preo = []\n ino = []\n posto = []\n-preorder(0, connect, preo)\n-inorder(0, connect, ino)\n-postorder(0, connect, posto)\n \n print(\"Preorder\")\n print(*preo)\n print(\"Inorder\")\n print(*ino)\n print(\"Postorder\")\n print(*posto)\n", "added_lines": 13, "removed_lines": 3, "code1_lines": 43 }, { "user_id": "u404682284", "problem_id": "p02281", "submission1_id": "s808071461", "submission2_id": "s388170202", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class NullNode():\n def __init__(self):\n self.id = -1\n\nclass Node():\n def __init__(self, id):\n self.id = id\n self.parent = NullNode()\n self.left = NullNode()\n self.right = NullNode()\n\n def inorder(self, node_list, out_list=[]):\n pass\n\n def postorder(self, node_list, out_list=[]):\n pass\n\ndef preorder(node, out_list=[]):\n if node.id != -1:\n out_list.append(str(node.id))\n out_list = preorder(node.left, out_list)\n out_list = preorder(node.right, out_list)\n return out_list\n\ndef inorder(node, out_list=[]):\n if node.id != -1:\n out_list = inorder(node.left, out_list)\n out_list.append(str(node.id))\n out_list = inorder(node.right, out_list)\n return out_list\n\ndef postorder(node, out_list=[]):\n if node.id != -1:\n out_list = postorder(node.left, out_list)\n out_list = postorder(node.right, out_list)\n out_list.append(str(node.id))\n return out_list\n\nn = int(input())\nnode_list = [Node(id) for id in range(n)]\nfor i in range(n):\n [id, left, right] = [int(j) for j in input().split()]\n i_node = node_list[id]\n if left != -1:\n i_node.left = node_list[left]\n node_list[left].parent = node_list[id]\n if right != -1:\n i_node.right = node_list[right]\n node_list[right].parent = node_list[id]\n\nprint('Preorder')\nout_list = preorder(node_list[0])\nprint(' ' + ' '.join(out_list))\n\nprint('Inorder')\nout_list = inorder(node_list[0])\nprint(' ' + ' '.join(out_list))\n\nprint('Postorder')\nout_list = postorder(node_list[0])\nprint(' ' + ' '.join(out_list))\n\n", "code2": "class NullNode():\n def __init__(self):\n self.id = -1\n\nclass Node():\n def __init__(self, id):\n self.id = id\n self.parent = NullNode()\n self.left = NullNode()\n self.right = NullNode()\n\ndef preorder(node, out_list=[]):\n if node.id != -1:\n out_list.append(str(node.id))\n out_list = preorder(node.left, out_list)\n out_list = preorder(node.right, out_list)\n return out_list\n\ndef inorder(node, out_list=[]):\n if node.id != -1:\n out_list = inorder(node.left, out_list)\n out_list.append(str(node.id))\n out_list = inorder(node.right, out_list)\n return out_list\n\ndef postorder(node, out_list=[]):\n if node.id != -1:\n out_list = postorder(node.left, out_list)\n out_list = postorder(node.right, out_list)\n out_list.append(str(node.id))\n return out_list\n\nn = int(input())\nnode_list = [Node(id) for id in range(n)]\nfor i in range(n):\n [id, left, right] = [int(j) for j in input().split()]\n i_node = node_list[id]\n if left != -1:\n i_node.left = node_list[left]\n node_list[left].parent = node_list[id]\n if right != -1:\n i_node.right = node_list[right]\n node_list[right].parent = node_list[id]\n\nfor node in node_list:\n if node.parent.id == -1:\n root = node\n\nprint('Preorder')\nout_list = preorder(root)\nprint(' ' + ' '.join(out_list))\n\nprint('Inorder')\nout_list = inorder(root)\nprint(' ' + ' '.join(out_list))\n\nprint('Postorder')\nout_list = postorder(root)\nprint(' ' + ' '.join(out_list))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528216362", "date2": "1528218025", "bleu_score": "0.9219885077708493", "code1_test_status": [1, 1, 0, 0, 0], "code1_test_score": 2, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3\nInorder\n 2 0 6 5 7 4 8 1 3\nPostorder\n 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["class NullNode(): # (0): NullNode=\n def __init__(self):\n self.id = -1 # (9): self=, id=0 (11): self=, id=0 ... (69): NullNode=, Node=, preorder=, inorder=, postorder=, n=9, node_list\n\nclass Node(): # (1): Node=\n def __init__(self, id):\n self.id = id # (7): NO CHANGE (14): NO CHANGE ... (63): NO CHANGE\n self.parent = NullNode() # (8): self= (15): self= ... (64): self=\n self.left = NullNode() # (10): self= (17): self= ... (66): self=\n self.right = NullNode() # (12): self= (19): self= ... (68): self=\n\n def inorder(self, node_list, out_list=[]):\n pass\n\n def postorder(self, node_list, out_list=[]):\n pass\n\ndef preorder(node, out_list=[]): # (2): preorder=\n if node.id != -1: # (134): NO CHANGE (137): NO CHANGE ... (169): NullNode=, Node=, preorder=, inorder=, postorder=, n=9, node_list, i=8, id=8, left=-1, right=-1, i_node=\n out_list.append(str(node.id)) # (135): out_list=['0'] (138): out_list=['0', '2'] ... (165): out_list=['0', '2', '4', '5', '6', '7', '8']\n out_list = preorder(node.left, out_list) # (136): node= (139): node= ... (166): node=\n out_list = preorder(node.right, out_list) # (141): node= (143): node= ... (168): node=\n return out_list\n\ndef inorder(node, out_list=[]): # (3): inorder=\n if node.id != -1: # (173): NO CHANGE (175): NO CHANGE ... (208): NullNode=, Node=, preorder=, inorder=, postorder=, n=9, node_list, i=8, id=8, left=-1, right=-1, i_node=\n out_list = inorder(node.left, out_list) # (174): node= (176): node= ... (204): node=\n out_list.append(str(node.id)) # (178): out_list=['2'] (181): out_list=['2', '0'] ... (206): out_list=['2', '0', '6', '5', '7', '4', '8']\n out_list = inorder(node.right, out_list) # (179): node= (182): node= ... (207): node=\n return out_list\n\ndef postorder(node, out_list=[]): # (4): postorder=\n if node.id != -1: # (212): NO CHANGE (214): NO CHANGE ... (244): node=\n out_list = postorder(node.left, out_list) # (213): node= (215): node= ... (241): node=\n out_list = postorder(node.right, out_list) # (217): node= (220): node= ... (243): node=\n out_list.append(str(node.id)) # (219): node=, out_list=['2'] (230): node=, out_list=['2', '6'] ... (247): NullNode=, Node=, preorder=, inorder=, postorder=, n=9, node_list, i=8, id=8, left=-1, right=-1, i_node=, out_list=['2', '6', '7', '5', '8', '4', '0']\n return out_list\n\nn = int(input()) # (5): n=9\nnode_list = [Node(id) for id in range(n)] # (6): self=, id=0\nfor i in range(n): # (70): node_list=[, , , , , , , , ], i=0 (79): node_list, i=1 ... (131): node_list\n [id, left, right] = [int(j) for j in input().split()] # (71): node_list=[, , , , , , , , ], id=0, left=2, right=4 (80): node_list=[, , , , , , , , ], id=1, left=0, right=3 ... (127): node_list, id=8\n i_node = node_list[id] # (72): node_list=[, , , , , , , , ], i_node= (81): node_list=[, , , , , , , , ], i_node= ... (128): node_list, i_node=\n if left != -1: # (73): node_list (82): node_list ... (129): node_list\n i_node.left = node_list[left] # (74): node_list (83): node_list ... (111): node_list\n node_list[left].parent = node_list[id] # (75): node_list (84): node_list ... (112): node_list\n if right != -1: # (76): node_list (85): node_list ... (130): node_list\n i_node.right = node_list[right] # (77): node_list (86): node_list ... (114): node_list\n node_list[right].parent = node_list[id] # (78): node_list (87): node_list ... (115): node_list\n\nprint('Preorder') # (132): node_list\nout_list = preorder(node_list[0]) # (133): node=, out_list=[]\nprint(' ' + ' '.join(out_list)) # (170): node_list\n\nprint('Inorder') # (171): node_list\nout_list = inorder(node_list[0]) # (172): node=, out_list=[]\nprint(' ' + ' '.join(out_list)) # (209): node_list\n\nprint('Postorder') # (210): node_list\nout_list = postorder(node_list[0]) # (211): node=, out_list=[]\nprint(' ' + ' '.join(out_list))\n\n"], "anno_status": [false], "diff_content": " class NullNode():\n def __init__(self):\n self.id = -1\n \n class Node():\n def __init__(self, id):\n self.id = id\n self.parent = NullNode()\n self.left = NullNode()\n self.right = NullNode()\n \n- def inorder(self, node_list, out_list=[]):\n- pass\n-\n- def postorder(self, node_list, out_list=[]):\n- pass\n-\n def preorder(node, out_list=[]):\n if node.id != -1:\n out_list.append(str(node.id))\n out_list = preorder(node.left, out_list)\n out_list = preorder(node.right, out_list)\n return out_list\n \n def inorder(node, out_list=[]):\n if node.id != -1:\n out_list = inorder(node.left, out_list)\n out_list.append(str(node.id))\n out_list = inorder(node.right, out_list)\n return out_list\n \n def postorder(node, out_list=[]):\n if node.id != -1:\n out_list = postorder(node.left, out_list)\n out_list = postorder(node.right, out_list)\n out_list.append(str(node.id))\n return out_list\n \n n = int(input())\n node_list = [Node(id) for id in range(n)]\n for i in range(n):\n [id, left, right] = [int(j) for j in input().split()]\n i_node = node_list[id]\n if left != -1:\n i_node.left = node_list[left]\n node_list[left].parent = node_list[id]\n if right != -1:\n i_node.right = node_list[right]\n node_list[right].parent = node_list[id]\n \n+for node in node_list:\n+ if node.parent.id == -1:\n+ root = node\n+\n print('Preorder')\n-out_list = preorder(node_list[0])\n+out_list = preorder(root)\n print(' ' + ' '.join(out_list))\n \n print('Inorder')\n-out_list = inorder(node_list[0])\n+out_list = inorder(root)\n print(' ' + ' '.join(out_list))\n \n print('Postorder')\n-out_list = postorder(node_list[0])\n+out_list = postorder(root)\n print(' ' + ' '.join(out_list))\n \n \n", "FL_content": " class NullNode():\n def __init__(self):\n self.id = -1\n \n class Node():\n def __init__(self, id):\n self.id = id\n self.parent = NullNode()\n self.left = NullNode()\n self.right = NullNode()\n \n- def inorder(self, node_list, out_list=[]):\n- pass\n-\n- def postorder(self, node_list, out_list=[]):\n- pass\n-\n def preorder(node, out_list=[]):\n if node.id != -1:\n out_list.append(str(node.id))\n out_list = preorder(node.left, out_list)\n out_list = preorder(node.right, out_list)\n return out_list\n \n def inorder(node, out_list=[]):\n if node.id != -1:\n out_list = inorder(node.left, out_list)\n out_list.append(str(node.id))\n out_list = inorder(node.right, out_list)\n return out_list\n \n def postorder(node, out_list=[]):\n if node.id != -1:\n out_list = postorder(node.left, out_list)\n out_list = postorder(node.right, out_list)\n out_list.append(str(node.id))\n return out_list\n \n n = int(input())\n node_list = [Node(id) for id in range(n)]\n for i in range(n):\n [id, left, right] = [int(j) for j in input().split()]\n i_node = node_list[id]\n if left != -1:\n i_node.left = node_list[left]\n node_list[left].parent = node_list[id]\n if right != -1:\n i_node.right = node_list[right]\n node_list[right].parent = node_list[id]\n \n print('Preorder')\n-out_list = preorder(node_list[0])\n print(' ' + ' '.join(out_list))\n \n print('Inorder')\n-out_list = inorder(node_list[0])\n print(' ' + ' '.join(out_list))\n \n print('Postorder')\n-out_list = postorder(node_list[0])\n print(' ' + ' '.join(out_list))\n \n \n", "added_lines": 7, "removed_lines": 9, "code1_lines": 63 }, { "user_id": "u637322311", "problem_id": "p02281", "submission1_id": "s179648532", "submission2_id": "s263704549", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nclass Node(object):\n def __init__(self, parent=None, left=None, right=None):\n self.parent = parent\n self.left = left\n self.right = right\n\ndef print_nodes(nodes, n):\n A = []\n B = []\n C = []\n def walk_tree(nodes, u):\n if u == -1:\n return\n r = nodes[u].right\n l = nodes[u].left\n nonlocal A\n A.append(u)\n walk_tree(nodes, l)\n B.append(u)\n walk_tree(nodes, r)\n C.append(u)\n\n for i in range(n):\n if nodes[i].parent == None:\n walk_tree(nodes, i)\n print(\"Preorder\", end=\"\\n \")\n print(*A, sep=\" \")\n print(\"Ineorder\", end=\"\\n \")\n print(*B, sep=\" \")\n print(\"Postorder\", end=\"\\n \")\n print(*C, sep=\" \")\n\ndef read_binary_tree(nodes, n):\n for _ in range(n):\n i = [int(i) for i in stdin.readline().strip().split()]\n nodes[i[0]].left = i[1]\n nodes[i[0]].right = i[2]\n if i[1] != -1:\n nodes[i[1]].parent = i[0]\n if i[2] != -1:\n nodes[i[2]].parent = i[0]\n\nn = int(input())\nnodes = [Node() for _ in range(n)]\nread_binary_tree(nodes, n)\nprint_nodes(nodes, n)\n", "code2": "from sys import stdin\n\nclass Node(object):\n def __init__(self, parent=None, left=None, right=None):\n self.parent = parent\n self.left = left\n self.right = right\n\ndef print_nodes(nodes, n):\n A = []\n B = []\n C = []\n def walk_tree(nodes, u):\n if u == -1:\n return\n r = nodes[u].right\n l = nodes[u].left\n nonlocal A\n A.append(u)\n walk_tree(nodes, l)\n B.append(u)\n walk_tree(nodes, r)\n C.append(u)\n\n for i in range(n):\n if nodes[i].parent == None:\n walk_tree(nodes, i)\n print(\"Preorder\", end=\"\\n \")\n print(*A, sep=\" \")\n print(\"Inorder\", end=\"\\n \")\n print(*B, sep=\" \")\n print(\"Postorder\", end=\"\\n \")\n print(*C, sep=\" \")\n\ndef read_binary_tree(nodes, n):\n for _ in range(n):\n i = [int(i) for i in stdin.readline().strip().split()]\n nodes[i[0]].left = i[1]\n nodes[i[0]].right = i[2]\n if i[1] != -1:\n nodes[i[1]].parent = i[0]\n if i[2] != -1:\n nodes[i[2]].parent = i[0]\n\nn = int(input())\nnodes = [Node() for _ in range(n)]\nread_binary_tree(nodes, n)\nprint_nodes(nodes, n)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1535210425", "date2": "1535210521", "bleu_score": "0.9979443276953575", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 1 0 2 4 5 6 7 8 3\nIneorder\n 2 0 6 5 7 4 8 1 3\nPostorder\n 2 6 7 5 8 4 0 3 1\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3\nInorder\n 2 0 6 5 7 4 8 1 3\nPostorder\n 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["from sys import stdin\n\nclass Node(object): # (0): Node=\n def __init__(self, parent=None, left=None, right=None):\n self.parent = parent # (5): NO CHANGE (8): NO CHANGE ... (29): NO CHANGE\n self.left = left # (6): NO CHANGE (9): NO CHANGE ... (30): NO CHANGE\n self.right = right # (7): self= (10): self= ... (31): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p02281\\\\input_s179648532.txt' mode='r' encoding='utf-8'>, Node=, print_nodes=, read_binary_tree=, n=9, nodes\n\ndef print_nodes(nodes, n): # (1): print_nodes=\n A = [] # (97): nodes, A=[]\n B = [] # (98): nodes, B=[]\n C = [] # (99): nodes, C=[]\n def walk_tree(nodes, u): # (100): nodes, walk_tree=.walk_tree at 0x000001CA7C185E10>\n if u == -1: # (106): nodes (111): nodes ... (194): nodes\n return # (122): nodes=[, , , , , , , , ], u=2, r=-1, l=-1 (126): nodes=[, , , , , , , , ], u=2, r=-1, l=-1 ... (195): nodes, u=3, r=-1, l=-1\n r = nodes[u].right # (107): nodes=[, , , , , , , , ], r=3 (112): nodes=[, , , , , , , , ], r=4 ... (186): nodes, r=-1\n l = nodes[u].left # (108): nodes=[, , , , , , , , ], l=0 (113): nodes=[, , , , , , , , ], l=2 ... (187): nodes, l=-1\n nonlocal A\n A.append(u) # (109): nodes=[, , , , , , , , ], A=[1] (114): nodes=[, , , , , , , , ], A=[1, 0] ... (188): nodes, A=[1, 0, 2, 4, 5, 6, 7, 8, 3]\n walk_tree(nodes, l) # (110): nodes=[, , , , , , , , ], u=0 (115): nodes=[, , , , , , , , ], u=2 ... (189): nodes, u=-1\n B.append(u) # (123): nodes=[, , , , , , , , ], B=[2] (128): nodes=[, , , , , , , , ], B=[2, 0] ... (192): nodes, B=[2, 0, 6, 5, 7, 4, 8, 1, 3]\n walk_tree(nodes, r) # (124): nodes=[, , , , , , , , ], u=-1 (129): nodes=[, , , , , , , , ], u=4 ... (193): nodes, u=-1\n C.append(u) # (127): nodes=[, , , , , , , , ], u=0, C=[2], r=4, l=2 (151): nodes=[, , , , , , , , ], u=5, C=[2, 6], r=7, l=6 ... (197): nodes=[, , , , , , , , ], n=9, C=[2, 6, 7, 5, 8, 4, 0, 3, 1], i=1\n\n for i in range(n): # (101): nodes=[, , , , , , , , ], i=0 (103): nodes=[, , , , , , , , ], i=1 ... (216): nodes, i=8\n if nodes[i].parent == None: # (102): nodes (104): nodes ... (217): nodes\n walk_tree(nodes, i) # (105): nodes, u=1\n print(\"Preorder\", end=\"\\n \") # (198): nodes\n print(*A, sep=\" \") # (199): nodes\n print(\"Ineorder\", end=\"\\n \") # (200): nodes\n print(*B, sep=\" \") # (201): nodes\n print(\"Postorder\", end=\"\\n \") # (202): nodes\n print(*C, sep=\" \") # (203): nodes\n\ndef read_binary_tree(nodes, n): # (2): read_binary_tree=\n for _ in range(n): # (33): nodes=[, , , , , , , , ], _=0 (41): nodes, _=1 ... (95): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p02281\\\\input_s179648532.txt' mode='r' encoding='utf-8'>, Node=, print_nodes=, read_binary_tree=, nodes\n i = [int(i) for i in stdin.readline().strip().split()] # (34): nodes=[, , , , , , , , ], i=[0, 2, 4] (42): nodes=[, , , , , , , , ], i=[1, 0, 3] ... (90): nodes, i=[8, -1, -1]\n nodes[i[0]].left = i[1] # (35): nodes (43): nodes ... (91): nodes\n nodes[i[0]].right = i[2] # (36): nodes (44): nodes ... (92): nodes\n if i[1] != -1: # (37): nodes (45): nodes ... (93): nodes\n nodes[i[1]].parent = i[0] # (38): nodes (46): nodes ... (74): nodes\n if i[2] != -1: # (39): nodes (47): nodes ... (94): nodes\n nodes[i[2]].parent = i[0] # (40): nodes (48): nodes ... (76): nodes\n\nn = int(input()) # (3): n=9\nnodes = [Node() for _ in range(n)] # (4): self=, parent=None, left=None, right=None\nread_binary_tree(nodes, n) # (32): nodes\nprint_nodes(nodes, n) # (96): nodes\n"], "anno_status": [false], "diff_content": " from sys import stdin\n \n class Node(object):\n def __init__(self, parent=None, left=None, right=None):\n self.parent = parent\n self.left = left\n self.right = right\n \n def print_nodes(nodes, n):\n A = []\n B = []\n C = []\n def walk_tree(nodes, u):\n if u == -1:\n return\n r = nodes[u].right\n l = nodes[u].left\n nonlocal A\n A.append(u)\n walk_tree(nodes, l)\n B.append(u)\n walk_tree(nodes, r)\n C.append(u)\n \n for i in range(n):\n if nodes[i].parent == None:\n walk_tree(nodes, i)\n print(\"Preorder\", end=\"\\n \")\n print(*A, sep=\" \")\n- print(\"Ineorder\", end=\"\\n \")\n+ print(\"Inorder\", end=\"\\n \")\n print(*B, sep=\" \")\n print(\"Postorder\", end=\"\\n \")\n print(*C, sep=\" \")\n \n def read_binary_tree(nodes, n):\n for _ in range(n):\n i = [int(i) for i in stdin.readline().strip().split()]\n nodes[i[0]].left = i[1]\n nodes[i[0]].right = i[2]\n if i[1] != -1:\n nodes[i[1]].parent = i[0]\n if i[2] != -1:\n nodes[i[2]].parent = i[0]\n \n n = int(input())\n nodes = [Node() for _ in range(n)]\n read_binary_tree(nodes, n)\n print_nodes(nodes, n)\n \n", "FL_content": " from sys import stdin\n \n class Node(object):\n def __init__(self, parent=None, left=None, right=None):\n self.parent = parent\n self.left = left\n self.right = right\n \n def print_nodes(nodes, n):\n A = []\n B = []\n C = []\n def walk_tree(nodes, u):\n if u == -1:\n return\n r = nodes[u].right\n l = nodes[u].left\n nonlocal A\n A.append(u)\n walk_tree(nodes, l)\n B.append(u)\n walk_tree(nodes, r)\n C.append(u)\n \n for i in range(n):\n if nodes[i].parent == None:\n walk_tree(nodes, i)\n print(\"Preorder\", end=\"\\n \")\n print(*A, sep=\" \")\n- print(\"Ineorder\", end=\"\\n \")\n print(*B, sep=\" \")\n print(\"Postorder\", end=\"\\n \")\n print(*C, sep=\" \")\n \n def read_binary_tree(nodes, n):\n for _ in range(n):\n i = [int(i) for i in stdin.readline().strip().split()]\n nodes[i[0]].left = i[1]\n nodes[i[0]].right = i[2]\n if i[1] != -1:\n nodes[i[1]].parent = i[0]\n if i[2] != -1:\n nodes[i[2]].parent = i[0]\n \n n = int(input())\n nodes = [Node() for _ in range(n)]\n read_binary_tree(nodes, n)\n print_nodes(nodes, n)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 49 }, { "user_id": "u113295414", "problem_id": "p02281", "submission1_id": "s038199979", "submission2_id": "s328944268", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ntree = [[-1, -1, True] for i in range(n)]\nfor i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n\ndef preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n\ndef inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n\ndef postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n\nfor i, node in enumerate(tree):\n if node[2] == True:\n root = i\n\nprint('Preoder')\npreoder(root)\nprint('')\nprint('Inorder')\ninorder(root)\nprint('')\nprint('Postorder')\npostorder(root)\n\n", "code2": "n = int(input())\ntree = [[-1, -1, True] for i in range(n)]\nfor i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n\ndef preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n\ndef inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n\ndef postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n\nroot = 0\nfor i, node in enumerate(tree):\n if node[2] == True:\n root = i\n\nprint('Preorder')\npreoder(root)\nprint('')\nprint('Inorder')\ninorder(root)\nprint('')\nprint('Postorder')\npostorder(root)\nprint('')\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529226831", "date2": "1529227142", "bleu_score": "0.9749237900295609", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 0 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preoder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["n = int(input()) # (0): n=9\ntree = [[-1, -1, True] for i in range(n)] # (1): tree\nfor i in range(n): # (2): i=0 (10): i=1 ... (58): NO CHANGE\n id, left, right = map(int, input().split()) # (3): id=0, left=2, right=4 (11): id=1, left=0, right=3 ... (55): id=8\n if left != -1: # (4): NO CHANGE (12): NO CHANGE ... (56): NO CHANGE\n tree[id][0] = left # (5): tree (13): tree ... (41): tree\n tree[left][2] = False # (6): tree (14): tree ... (42): tree\n if right != -1: # (7): NO CHANGE (15): NO CHANGE ... (57): NO CHANGE\n tree[id][1] = right # (8): tree (16): tree ... (44): tree\n tree[right][2] = False # (9): tree (17): tree ... (45): tree\n\ndef preoder(id): # (59): preoder=\n if id == -1: # (84): NO CHANGE (87): NO CHANGE ... (222): NO CHANGE\n return # (94): id=2 (97): id=0 ... (223): n=9, tree=[[2, 4, False], [0, 3, True], [-1, -1, False], [0, 0, False], [5, 8, False], [6, 7, False], [-1, -1, False], [-1, -1, False], [-1, -1, False]], i=8, id=8, left=-1, right=-1, preoder=, inorder=, postorder=, node=[-1, -1, False], root=1\n print(' ' + str(id), end='') # (85): NO CHANGE (88): NO CHANGE ... (217): NO CHANGE\n preoder(tree[id][0]) # (86): id=0 (89): id=2 ... (218): id=-1\n preoder(tree[id][1]) # (95): id=-1 (98): id=4 ... (221): id=-1\n\ndef inorder(id): # (60): inorder=\n if id == -1: # (227): NO CHANGE (229): NO CHANGE ... (365): NO CHANGE\n return # (234): id=2 (238): id=0 ... (366): n=9, tree=[[2, 4, False], [0, 3, True], [-1, -1, False], [0, 0, False], [5, 8, False], [6, 7, False], [-1, -1, False], [-1, -1, False], [-1, -1, False]], i=8, id=8, left=-1, right=-1, preoder=, inorder=, postorder=, node=[-1, -1, False], root=1\n inorder(tree[id][0]) # (228): id=0 (230): id=2 ... (360): id=-1\n print(' ' + str(id), end='') # (235): NO CHANGE (239): NO CHANGE ... (363): NO CHANGE\n inorder(tree[id][1]) # (236): id=-1 (240): id=4 ... (364): id=-1\n\ndef postorder(id): # (61): postorder=\n if id == -1: # (370): NO CHANGE (372): NO CHANGE ... (503): NO CHANGE\n return # (377): id=2 (380): id=2 ... (504): id=8\n postorder(tree[id][0]) # (371): id=0 (373): id=2 ... (499): id=-1\n postorder(tree[id][1]) # (378): id=-1 (382): id=4 ... (502): id=-1\n print(' ' + str(id), end='') # (381): id=0 (394): id=5 ... (508): id=1\n\nfor i, node in enumerate(tree): # (62): i=0, node=[2, 4, False] (64): i=1, node=[0, 3, True] ... (81): NO CHANGE\n if node[2] == True: # (63): NO CHANGE (65): NO CHANGE ... (80): NO CHANGE\n root = i # (66): root=1\n\nprint('Preoder') # (82): NO CHANGE\npreoder(root) # (83): id=1\nprint('') # (224): NO CHANGE\nprint('Inorder') # (225): NO CHANGE\ninorder(root) # (226): id=1\nprint('') # (367): NO CHANGE\nprint('Postorder') # (368): NO CHANGE\npostorder(root) # (369): id=1\n\n"], "anno_status": [false], "diff_content": " n = int(input())\n tree = [[-1, -1, True] for i in range(n)]\n for i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n \n def preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n \n def inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n \n def postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n \n+root = 0\n for i, node in enumerate(tree):\n if node[2] == True:\n root = i\n \n-print('Preoder')\n+print('Preorder')\n preoder(root)\n print('')\n print('Inorder')\n inorder(root)\n print('')\n print('Postorder')\n postorder(root)\n+print('')\n \n \n", "FL_content": " n = int(input())\n tree = [[-1, -1, True] for i in range(n)]\n for i in range(n):\n id, left, right = map(int, input().split())\n if left != -1:\n tree[id][0] = left\n tree[left][2] = False\n if right != -1:\n tree[id][1] = right\n tree[right][2] = False\n \n def preoder(id):\n if id == -1:\n return\n print(' ' + str(id), end='')\n preoder(tree[id][0])\n preoder(tree[id][1])\n \n def inorder(id):\n if id == -1:\n return\n inorder(tree[id][0])\n print(' ' + str(id), end='')\n inorder(tree[id][1])\n \n def postorder(id):\n if id == -1:\n return\n postorder(tree[id][0])\n postorder(tree[id][1])\n print(' ' + str(id), end='')\n \n for i, node in enumerate(tree):\n if node[2] == True:\n root = i\n \n-print('Preoder')\n preoder(root)\n print('')\n print('Inorder')\n inorder(root)\n print('')\n print('Postorder')\n postorder(root)\n \n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 46 }, { "user_id": "u247976584", "problem_id": "p02281", "submission1_id": "s707945101", "submission2_id": "s606110633", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import namedtuple\n\nclass TreeWalk:\n def __init__(self, t):\n self.t = t\n\n def preParse(self, u):\n if u == -1:\n return \n print(\" \", str(u), end = \"\")\n self.preParse(self.t[u].l)\n self.preParse(self.t[u].r)\n\n def inParse(self, u):\n if u == -1:\n return \n self.inParse(self.t[u].l)\n print(\" \", str(u), end = \"\")\n self.inParse(self.t[u].r)\n\n def postParse(self, u):\n if u == -1:\n return \n self.inParse(self.t[u].l)\n self.inParse(self.t[u].r)\n print(\" \", str(u), end = \"\")\n \nif __name__ == '__main__':\n n = int(input().rstrip())\n Node = namedtuple('Node', ['p', 'l', 'r'])\n t = [Node(-1, -1, -1)] * n\n root = -1\n for i in range(n):\n v, l, r = [int(i) for i in input().rstrip().split(\" \")]\n t[v] = t[v]._replace(l = l, r = r)\n if l != -1:\n t[l] = t[l]._replace(p = v)\n if r != -1:\n t[r] = t[r]._replace(p = v)\n for i in range(n):\n if (t[i].p == -1):\n root = i\n\n x = TreeWalk(t)\n print(\"Preorder\")\n x.preParse(root)\n print()\n print(\"Inorder\")\n x.inParse(root)\n print()\n print(\"Postorder\")\n x.postParse(root)", "code2": "from collections import namedtuple\n\nclass TreeWalk:\n def __init__(self, t):\n self.t = t\n\n def preParse(self, u):\n if u == -1:\n return \n print(\"\", str(u), end = \"\")\n self.preParse(self.t[u].l)\n self.preParse(self.t[u].r)\n\n def inParse(self, u):\n if u == -1:\n return \n self.inParse(self.t[u].l)\n print(\"\", str(u), end = \"\")\n self.inParse(self.t[u].r)\n\n def postParse(self, u):\n if u == -1:\n return \n self.postParse(self.t[u].l)\n self.postParse(self.t[u].r)\n print(\"\", str(u), end = \"\")\n \nif __name__ == '__main__':\n n = int(input().rstrip())\n Node = namedtuple('Node', ['p', 'l', 'r'])\n t = [Node(-1, -1, -1)] * n\n root = -1\n for i in range(n):\n v, l, r = [int(i) for i in input().rstrip().split(\" \")]\n t[v] = t[v]._replace(l = l, r = r)\n if l != -1:\n t[l] = t[l]._replace(p = v)\n if r != -1:\n t[r] = t[r]._replace(p = v)\n for i in range(n):\n if (t[i].p == -1):\n root = i\n\n x = TreeWalk(t)\n print(\"Preorder\")\n x.preParse(root)\n print()\n print(\"Inorder\")\n x.inParse(root)\n print()\n print(\"Postorder\")\n x.postParse(root)\n print()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1455339771", "date2": "1455340022", "bleu_score": "0.9796412004679067", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 0 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\nPostorder\n 2 0 6 5 7 4 8 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8 1", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["from collections import namedtuple\n\nclass TreeWalk: # (0): TreeWalk=\n def __init__(self, t):\n self.t = t\n\n def preParse(self, u):\n if u == -1:\n return \n print(\" \", str(u), end = \"\")\n self.preParse(self.t[u].l)\n self.preParse(self.t[u].r)\n\n def inParse(self, u):\n if u == -1:\n return \n self.inParse(self.t[u].l)\n print(\" \", str(u), end = \"\")\n self.inParse(self.t[u].r)\n\n def postParse(self, u):\n if u == -1:\n return \n self.inParse(self.t[u].l)\n self.inParse(self.t[u].r)\n print(\" \", str(u), end = \"\")\n \nif __name__ == '__main__':\n n = int(input().rstrip())\n Node = namedtuple('Node', ['p', 'l', 'r'])\n t = [Node(-1, -1, -1)] * n\n root = -1\n for i in range(n):\n v, l, r = [int(i) for i in input().rstrip().split(\" \")]\n t[v] = t[v]._replace(l = l, r = r)\n if l != -1:\n t[l] = t[l]._replace(p = v)\n if r != -1:\n t[r] = t[r]._replace(p = v)\n for i in range(n):\n if (t[i].p == -1):\n root = i\n\n x = TreeWalk(t)\n print(\"Preorder\")\n x.preParse(root)\n print()\n print(\"Inorder\")\n x.inParse(root)\n print()\n print(\"Postorder\")\n x.postParse(root)"], "anno_status": [true], "diff_content": " from collections import namedtuple\n \n class TreeWalk:\n def __init__(self, t):\n self.t = t\n \n def preParse(self, u):\n if u == -1:\n return \n- print(\" \", str(u), end = \"\")\n+ print(\"\", str(u), end = \"\")\n self.preParse(self.t[u].l)\n self.preParse(self.t[u].r)\n \n def inParse(self, u):\n if u == -1:\n return \n self.inParse(self.t[u].l)\n- print(\" \", str(u), end = \"\")\n+ print(\"\", str(u), end = \"\")\n self.inParse(self.t[u].r)\n \n def postParse(self, u):\n if u == -1:\n return \n- self.inParse(self.t[u].l)\n- self.inParse(self.t[u].r)\n- print(\" \", str(u), end = \"\")\n+ self.postParse(self.t[u].l)\n+ self.postParse(self.t[u].r)\n+ print(\"\", str(u), end = \"\")\n \n if __name__ == '__main__':\n n = int(input().rstrip())\n Node = namedtuple('Node', ['p', 'l', 'r'])\n t = [Node(-1, -1, -1)] * n\n root = -1\n for i in range(n):\n v, l, r = [int(i) for i in input().rstrip().split(\" \")]\n t[v] = t[v]._replace(l = l, r = r)\n if l != -1:\n t[l] = t[l]._replace(p = v)\n if r != -1:\n t[r] = t[r]._replace(p = v)\n for i in range(n):\n if (t[i].p == -1):\n root = i\n \n x = TreeWalk(t)\n print(\"Preorder\")\n x.preParse(root)\n print()\n print(\"Inorder\")\n x.inParse(root)\n print()\n print(\"Postorder\")\n x.postParse(root)\n+ print()\n", "FL_content": " from collections import namedtuple\n \n class TreeWalk:\n def __init__(self, t):\n self.t = t\n \n def preParse(self, u):\n if u == -1:\n return \n- print(\" \", str(u), end = \"\")\n self.preParse(self.t[u].l)\n self.preParse(self.t[u].r)\n \n def inParse(self, u):\n if u == -1:\n return \n self.inParse(self.t[u].l)\n- print(\" \", str(u), end = \"\")\n self.inParse(self.t[u].r)\n \n def postParse(self, u):\n if u == -1:\n return \n- self.inParse(self.t[u].l)\n- self.inParse(self.t[u].r)\n- print(\" \", str(u), end = \"\")\n \n if __name__ == '__main__':\n n = int(input().rstrip())\n Node = namedtuple('Node', ['p', 'l', 'r'])\n t = [Node(-1, -1, -1)] * n\n root = -1\n for i in range(n):\n v, l, r = [int(i) for i in input().rstrip().split(\" \")]\n t[v] = t[v]._replace(l = l, r = r)\n if l != -1:\n t[l] = t[l]._replace(p = v)\n if r != -1:\n t[r] = t[r]._replace(p = v)\n for i in range(n):\n if (t[i].p == -1):\n root = i\n \n x = TreeWalk(t)\n print(\"Preorder\")\n x.preParse(root)\n print()\n print(\"Inorder\")\n x.inParse(root)\n print()\n print(\"Postorder\")\n x.postParse(root)\n", "added_lines": 6, "removed_lines": 5, "code1_lines": 52 }, { "user_id": "u805716376", "problem_id": "p02281", "submission1_id": "s745083285", "submission2_id": "s935768709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def s(x):\n print('',x,end='')\ndef p(u):\n if u+1:s(u);p(R[u]);p(L[u])\ndef i(u):\n if u+1:i(R[u]);s(u);i(L[u])\ndef o(u):\n if u+1:o(R[u]);o(L[u]);s(u)\n \nn = int(input())\nR, L = [0]*n, [0]*n\nfor _ in range(n):\n a, b, c = map(int, input().split())\n R[a] = b\n L[a] = c\nprint(R)\nprint(L)\nroot = (set(range(n))-set(R)-set(L)).pop()\nprint('Preorder');p(root)\nprint('\\nInorder');i(root)\nprint('\\nPostorder');o(root)\nprint()\n \n", "code2": "def s(x):\n print('',x,end='')\ndef p(u):\n if u+1:s(u);p(R[u]);p(L[u])\ndef i(u):\n if u+1:i(R[u]);s(u);i(L[u])\ndef o(u):\n if u+1:o(R[u]);o(L[u]);s(u)\n \nn = int(input())\nR, L = [0]*n, [0]*n\nfor _ in range(n):\n a, b, c = map(int, input().split())\n R[a] = b\n L[a] = c\n\nroot = (set(range(n))-set(R)-set(L)).pop()\nprint('Preorder');p(root)\nprint('\\nInorder');i(root)\nprint('\\nPostorder');o(root)\nprint()\n \n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556798847", "date2": "1556798909", "bleu_score": "0.9578616600616516", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 0 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "[2, 0, -1, 0, 5, 6, -1, -1, -1]\n[4, 3, -1, 0, 8, 7, -1, -1, -1]\nPreorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["def s(x): # (0): s=\n print('',x,end='') # (48): u=0 (50): u=2 ... (258): s=, p=, i=, o=, n=9, R=[2, 0, -1, 0, 5, 6, -1, -1, -1], L=[4, 3, -1, 0, 8, 7, -1, -1, -1], _=8, a=8, b=-1, c=-1, root=1\ndef p(u): # (1): p=\n if u+1:s(u);p(R[u]);p(L[u]) # (47): x=1 (49): x=0 ... (116): s=, p=, i=, o=, n=9, R=[2, 0, -1, 0, 5, 6, -1, -1, -1], L=[4, 3, -1, 0, 8, 7, -1, -1, -1], _=8, a=8, b=-1, c=-1, root=1\ndef i(u): # (2): i=\n if u+1:i(R[u]);s(u);i(L[u]) # (118): u=0 (119): u=2 ... (187): s=, p=, i=, o=, n=9, R=[2, 0, -1, 0, 5, 6, -1, -1, -1], L=[4, 3, -1, 0, 8, 7, -1, -1, -1], _=8, a=8, b=-1, c=-1, root=1\ndef o(u): # (3): o=\n if u+1:o(R[u]);o(L[u]);s(u) # (189): u=0 (190): u=2 ... (253): x=8\n \nn = int(input()) # (4): n=9\nR, L = [0]*n, [0]*n # (5): R=[0, 0, 0, 0, 0, 0, 0, 0, 0], L=[0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor _ in range(n): # (6): _=0 (10): _=1 ... (42): NO CHANGE\n a, b, c = map(int, input().split()) # (7): a=0, b=2, c=4 (11): a=1, b=0, c=3 ... (39): a=8\n R[a] = b # (8): R=[2, 0, 0, 0, 0, 0, 0, 0, 0] (12): NO CHANGE ... (40): R=[2, 0, -1, 0, 5, 6, -1, -1, -1]\n L[a] = c # (9): L=[4, 0, 0, 0, 0, 0, 0, 0, 0] (13): L=[4, 3, 0, 0, 0, 0, 0, 0, 0] ... (41): L=[4, 3, -1, 0, 8, 7, -1, -1, -1]\nprint(R) # (43): NO CHANGE\nprint(L) # (44): NO CHANGE\nroot = (set(range(n))-set(R)-set(L)).pop() # (45): root=1\nprint('Preorder');p(root) # (46): u=1\nprint('\\nInorder');i(root) # (117): u=1\nprint('\\nPostorder');o(root) # (188): u=1\nprint()\n \n"], "anno_status": [false], "diff_content": " def s(x):\n print('',x,end='')\n def p(u):\n if u+1:s(u);p(R[u]);p(L[u])\n def i(u):\n if u+1:i(R[u]);s(u);i(L[u])\n def o(u):\n if u+1:o(R[u]);o(L[u]);s(u)\n \n n = int(input())\n R, L = [0]*n, [0]*n\n for _ in range(n):\n a, b, c = map(int, input().split())\n R[a] = b\n L[a] = c\n-print(R)\n-print(L)\n+\n root = (set(range(n))-set(R)-set(L)).pop()\n print('Preorder');p(root)\n print('\\nInorder');i(root)\n print('\\nPostorder');o(root)\n print()\n \n \n", "FL_content": " def s(x):\n print('',x,end='')\n def p(u):\n if u+1:s(u);p(R[u]);p(L[u])\n def i(u):\n if u+1:i(R[u]);s(u);i(L[u])\n def o(u):\n if u+1:o(R[u]);o(L[u]);s(u)\n \n n = int(input())\n R, L = [0]*n, [0]*n\n for _ in range(n):\n a, b, c = map(int, input().split())\n R[a] = b\n L[a] = c\n-print(R)\n-print(L)\n root = (set(range(n))-set(R)-set(L)).pop()\n print('Preorder');p(root)\n print('\\nInorder');i(root)\n print('\\nPostorder');o(root)\n print()\n \n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u938045879", "problem_id": "p02281", "submission1_id": "s059449949", "submission2_id": "s057732936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nroot = set(range(n))\nnodes = [0 for i in range(n)]\nfor i in range(n):\n node = list(map(int, input().split()))\n children = node[1:3]\n root -= set(children)\n nodes[node[0]] = children\n\ndef preorder(id):\n if(id == -1):\n return\n order.append(id)\n preorder(nodes[id][0])\n preorder(nodes[id][1])\n\ndef inorder(id):\n if(id == -1):\n return\n inorder(nodes[id][0])\n order.append(id)\n inorder(nodes[id][1])\n\ndef postorder(id):\n if(id == -1):\n return\n postorder(nodes[id][0])\n postorder(nodes[id][1])\n order.append(id)\n\norder = []\npreorder(list(root)[0])\nprint(*order)\norder = []\ninorder(list(root)[0])\nprint(*order)\norder = []\npostorder(list(root)[0])\nprint(*order)\n\n", "code2": "n = int(input())\nroot = set(range(n))\nnodes = [0 for i in range(n)]\nfor i in range(n):\n node = list(map(int, input().split()))\n children = node[1:3]\n root -= set(children)\n nodes[node[0]] = children\n\ndef preorder(id):\n if(id == -1):\n return\n order.append(id)\n preorder(nodes[id][0])\n preorder(nodes[id][1])\n\ndef inorder(id):\n if(id == -1):\n return\n inorder(nodes[id][0])\n order.append(id)\n inorder(nodes[id][1])\n\ndef postorder(id):\n if(id == -1):\n return\n postorder(nodes[id][0])\n postorder(nodes[id][1])\n order.append(id)\n\norder = []\npreorder(list(root)[0])\nprint('Preorder')\nprint(' ', end='')\nprint(*order)\norder = []\ninorder(list(root)[0])\nprint('Inorder')\nprint(' ', end='')\nprint(*order)\norder = []\npostorder(list(root)[0])\nprint('Postorder')\nprint(' ', end='')\nprint(*order)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527784512", "date2": "1527784676", "bleu_score": "0.8694882936950596", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 0 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\n2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\n2 6 7 5 8 4 0 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 2 0 6 5 7 4 8 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["n = int(input()) # (0): n=9\nroot = set(range(n)) # (1): root={0, 1, 2, 3, 4, 5, 6, 7, 8}\nnodes = [0 for i in range(n)] # (2): nodes=[0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n): # (3): i=0 (8): nodes, i=1 ... (48): NO CHANGE\n node = list(map(int, input().split())) # (4): node=[0, 2, 4] (9): nodes=[[2, 4], 0, 0, 0, 0, 0, 0, 0, 0], node=[1, 0, 3] ... (44): nodes, node=[8, -1, -1]\n children = node[1:3] # (5): children=[2, 4] (10): nodes, children=[0, 3] ... (45): nodes\n root -= set(children) # (6): root={0, 1, 3, 5, 6, 7, 8} (11): root={1, 5, 6, 7, 8}, nodes ... (46): nodes\n nodes[node[0]] = children # (7): nodes (12): nodes ... (47): nodes\n\ndef preorder(id): # (49): preorder=\n if(id == -1): # (54): NO CHANGE (57): NO CHANGE ... (192): NO CHANGE\n return # (64): id=2 (67): id=0 ... (193): n=9, root={1}, nodes=[[2, 4], [0, 3], [-1, -1], [0, 0], [5, 8], [6, 7], [-1, -1], [-1, -1], [-1, -1]], i=8, node=[8, -1, -1], children=[-1, -1], preorder=, inorder=, postorder=, order=[1, 0, ..., 7, 8]\n order.append(id) # (55): NO CHANGE (58): NO CHANGE ... (187): NO CHANGE\n preorder(nodes[id][0]) # (56): id=0 (59): id=2 ... (188): id=-1\n preorder(nodes[id][1]) # (65): id=-1 (68): id=4 ... (191): id=-1\n\ndef inorder(id): # (50): inorder=\n if(id == -1): # (197): NO CHANGE (199): NO CHANGE ... (335): NO CHANGE\n return # (204): id=2 (208): id=0 ... (336): n=9, root={1}, nodes=[[2, 4], [0, 3], [-1, -1], [0, 0], [5, 8], [6, 7], [-1, -1], [-1, -1], [-1, -1]], i=8, node=[8, -1, -1], children=[-1, -1], preorder=, inorder=, postorder=, order=[2, 0, ..., 4, 8]\n inorder(nodes[id][0]) # (198): id=0 (200): id=2 ... (330): id=-1\n order.append(id) # (205): NO CHANGE (209): NO CHANGE ... (333): NO CHANGE\n inorder(nodes[id][1]) # (206): id=-1 (210): id=4 ... (334): id=-1\n\ndef postorder(id): # (51): postorder=\n if(id == -1): # (340): NO CHANGE (342): NO CHANGE ... (473): NO CHANGE\n return # (347): id=2 (350): id=2 ... (474): id=8\n postorder(nodes[id][0]) # (341): id=0 (343): id=2 ... (469): id=-1\n postorder(nodes[id][1]) # (348): id=-1 (352): id=4 ... (472): id=-1\n order.append(id) # (351): id=0 (364): id=5 ... (479): n=9, root={1}, nodes=[[2, 4], [0, 3], [-1, -1], [0, 0], [5, 8], [6, 7], [-1, -1], [-1, -1], [-1, -1]], i=8, node=[8, -1, -1], children=[-1, -1], preorder=, inorder=, postorder=, order=[2, 6, ..., 3, 1]\n\norder = [] # (52): order=[]\npreorder(list(root)[0]) # (53): id=1\nprint(*order) # (194): NO CHANGE\norder = [] # (195): order=[]\ninorder(list(root)[0]) # (196): id=1\nprint(*order) # (337): NO CHANGE\norder = [] # (338): order=[]\npostorder(list(root)[0]) # (339): id=1\nprint(*order)\n\n"], "anno_status": [false], "diff_content": " n = int(input())\n root = set(range(n))\n nodes = [0 for i in range(n)]\n for i in range(n):\n node = list(map(int, input().split()))\n children = node[1:3]\n root -= set(children)\n nodes[node[0]] = children\n \n def preorder(id):\n if(id == -1):\n return\n order.append(id)\n preorder(nodes[id][0])\n preorder(nodes[id][1])\n \n def inorder(id):\n if(id == -1):\n return\n inorder(nodes[id][0])\n order.append(id)\n inorder(nodes[id][1])\n \n def postorder(id):\n if(id == -1):\n return\n postorder(nodes[id][0])\n postorder(nodes[id][1])\n order.append(id)\n \n order = []\n preorder(list(root)[0])\n+print('Preorder')\n+print(' ', end='')\n print(*order)\n order = []\n inorder(list(root)[0])\n+print('Inorder')\n+print(' ', end='')\n print(*order)\n order = []\n postorder(list(root)[0])\n+print('Postorder')\n+print(' ', end='')\n print(*order)\n \n \n", "FL_content": " n = int(input())\n root = set(range(n))\n nodes = [0 for i in range(n)]\n for i in range(n):\n node = list(map(int, input().split()))\n children = node[1:3]\n root -= set(children)\n nodes[node[0]] = children\n \n def preorder(id):\n if(id == -1):\n return\n order.append(id)\n preorder(nodes[id][0])\n preorder(nodes[id][1])\n \n def inorder(id):\n if(id == -1):\n return\n inorder(nodes[id][0])\n order.append(id)\n inorder(nodes[id][1])\n \n def postorder(id):\n if(id == -1):\n return\n postorder(nodes[id][0])\n postorder(nodes[id][1])\n order.append(id)\n \n order = []\n preorder(list(root)[0])\n print(*order)\n order = []\n inorder(list(root)[0])\n print(*order)\n order = []\n postorder(list(root)[0])\n print(*order)\n \n \n", "added_lines": 6, "removed_lines": 0, "code1_lines": 41 }, { "user_id": "u357267874", "problem_id": "p02281", "submission1_id": "s014941305", "submission2_id": "s547774364", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Node:\n def __init__(self, id):\n self.id = id\n self.left = None\n self.right = None\n\nroot = None\nn = int(input())\nnode_list = []\nfor i in range(n):\n node_list.append(Node(i))\n\nfor i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n node.left = node_list[left]\n if right > -1:\n node.right = node_list[right]\n if id == 0:\n root = node\n\ndef preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n\ndef inorder(node):\n if node is None:\n return\n \n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n\ndef postorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n postorder(node.left)\n postorder(node.right)\n\nprint('Preorder')\npreorder(root)\nprint('')\n\nprint('Inorder')\ninorder(root)\nprint('')\n\nprint('Postorder')\npostorder(root)\nprint('')\n", "code2": "class Node:\n def __init__(self, id):\n self.id = id\n self.parent = None\n self.left = None\n self.right = None\n\nroot = None\nn = int(input())\nnode_list = []\nfor i in range(n):\n node_list.append(Node(i))\n\nfor i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n node_list[left].parent = node\n node.left = node_list[left]\n if right > -1:\n node_list[right].parent = node\n node.right = node_list[right]\n\nroot = None\nfor node in node_list:\n if node.parent is None:\n root = node\n break\n\ndef preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n\ndef inorder(node):\n if node is None:\n return\n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n\ndef postorder(node):\n if node is None:\n return\n postorder(node.left)\n postorder(node.right)\n print(' ' + str(node.id), end='')\n\nprint('Preorder')\npreorder(root)\nprint('')\n\nprint('Inorder')\ninorder(root)\nprint('')\n\nprint('Postorder')\npostorder(root)\nprint('')\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559347219", "date2": "1559347485", "bleu_score": "0.8553317675350205", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 1 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 0 2 4 5 6 7 8\n", "expected_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0\n\n", "anno_code": ["class Node: # (0): Node=\n def __init__(self, id):\n self.id = id # (6): NO CHANGE (11): NO CHANGE ... (46): NO CHANGE\n self.left = None # (7): NO CHANGE (12): NO CHANGE ... (47): NO CHANGE\n self.right = None # (8): Node=, root=None, n=9, node_list=[], i=0 (13): Node=, root=None, n=9, node_list=[, ], i=1 ... (48): Node=, root=None, n=9, node_list, i=8\n\nroot = None # (1): root=None\nn = int(input()) # (2): n=9\nnode_list = [] # (3): node_list=[]\nfor i in range(n): # (4): i=0 (9): node_list, i=1 ... (49): node_list\n node_list.append(Node(i)) # (5): self=, id=0 (10): self=, id=1 ... (45): self=, id=8\n\nfor i in range(n): # (50): node_list=[, , , , , , , , ], i=0 (59): node_list, i=1 ... (113): node_list\n id, left, right = list(map(int, input().split())) # (51): node_list=[, , , , , , , , ], id=0, left=2, right=4 (60): node_list=[, , , , , , , , ], id=1, left=1, right=3 ... (108): node_list, id=8\n node = node_list[id] # (52): node_list=[, , , , , , , , ], node= (61): node_list=[, , , , , , , , ], node= ... (109): node_list, node=\n if left > -1: # (53): node_list (62): node_list ... (110): node_list\n node.left = node_list[left] # (54): node_list (63): node_list ... (91): node_list\n if right > -1: # (55): node_list (64): node_list ... (111): node_list\n node.right = node_list[right] # (56): node_list (65): node_list ... (93): node_list\n if id == 0: # (57): node_list (66): node_list ... (112): node_list\n root = node # (58): root=, node_list\n\ndef preorder(node): # (114): node_list, preorder=\n if node is None: # (119): NO CHANGE (122): NO CHANGE ... (161): NO CHANGE\n return # (126): node= (129): node= ... (162): Node=, root=, n=9, node_list, i=8, id=8, left=-1, right=-1, node=, preorder=, inorder=, postorder=\n print(' ' + str(node.id), end='') # (120): NO CHANGE (123): NO CHANGE ... (156): NO CHANGE\n preorder(node.left) # (121): node= (124): node=None ... (157): node=None\n preorder(node.right) # (127): node=None (130): node= ... (160): node=None\n\ndef inorder(node): # (115): node_list, inorder=\n if node is None: # (166): NO CHANGE (168): NO CHANGE ... (208): NO CHANGE\n return # (171): node= (175): node= ... (209): Node=, root=, n=9, node_list, i=8, id=8, left=-1, right=-1, node=, preorder=, inorder=, postorder=\n \n inorder(node.left) # (167): node= (169): node=None ... (203): node=None\n print(' ' + str(node.id), end='') # (172): NO CHANGE (176): NO CHANGE ... (206): NO CHANGE\n inorder(node.right) # (173): node=None (177): node= ... (207): node=None\n\ndef postorder(node): # (116): node_list, postorder=\n if node is None: # (213): NO CHANGE (216): NO CHANGE ... (255): NO CHANGE\n return # (220): node= (223): node= ... (256): Node=, root=, n=9, node_list, i=8, id=8, left=-1, right=-1, node=, preorder=, inorder=, postorder=\n print(' ' + str(node.id), end='') # (214): NO CHANGE (217): NO CHANGE ... (250): NO CHANGE\n postorder(node.left) # (215): node= (218): node=None ... (251): node=None\n postorder(node.right) # (221): node=None (224): node= ... (254): node=None\n\nprint('Preorder') # (117): node_list\npreorder(root) # (118): node=\nprint('') # (163): node_list\n\nprint('Inorder') # (164): node_list\ninorder(root) # (165): node=\nprint('') # (210): node_list\n\nprint('Postorder') # (211): node_list\npostorder(root) # (212): node=\nprint('')\n"], "anno_status": [false], "diff_content": " class Node:\n def __init__(self, id):\n self.id = id\n+ self.parent = None\n self.left = None\n self.right = None\n \n root = None\n n = int(input())\n node_list = []\n for i in range(n):\n node_list.append(Node(i))\n \n for i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n+ node_list[left].parent = node\n node.left = node_list[left]\n if right > -1:\n+ node_list[right].parent = node\n node.right = node_list[right]\n- if id == 0:\n+\n+root = None\n+for node in node_list:\n+ if node.parent is None:\n root = node\n+ break\n \n def preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n \n def inorder(node):\n if node is None:\n return\n- \n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n \n def postorder(node):\n if node is None:\n return\n- print(' ' + str(node.id), end='')\n postorder(node.left)\n postorder(node.right)\n+ print(' ' + str(node.id), end='')\n \n print('Preorder')\n preorder(root)\n print('')\n \n print('Inorder')\n inorder(root)\n print('')\n \n print('Postorder')\n postorder(root)\n print('')\n \n", "FL_content": " class Node:\n def __init__(self, id):\n self.id = id\n self.left = None\n self.right = None\n \n root = None\n n = int(input())\n node_list = []\n for i in range(n):\n node_list.append(Node(i))\n \n for i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n node.left = node_list[left]\n if right > -1:\n node.right = node_list[right]\n- if id == 0:\n root = node\n \n def preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n \n def inorder(node):\n if node is None:\n return\n- \n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n \n def postorder(node):\n if node is None:\n return\n- print(' ' + str(node.id), end='')\n postorder(node.left)\n postorder(node.right)\n \n print('Preorder')\n preorder(root)\n print('')\n \n print('Inorder')\n inorder(root)\n print('')\n \n print('Postorder')\n postorder(root)\n print('')\n \n", "added_lines": 9, "removed_lines": 3, "code1_lines": 56 }, { "user_id": "u851695354", "problem_id": "p02281", "submission1_id": "s712517092", "submission2_id": "s998818119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nclass Tree:\n def __init__(self,parent,left,right):\n self.parent = parent\n self.left = left\n self.right = right\n\n\ndef preparse(u):\n if u == -1: return\n print(\" \", end=\"\")\n print(u, end=\"\")\n preparse(trees[u].left)\n preparse(trees[u].right)\n\n\ndef inparse(u):\n if u == -1: return\n \n inparse(trees[u].left)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n \n inparse(trees[u].right)\n \n\ndef postparse(u):\n if u == -1: return\n \n postparse(trees[u].left)\n \n postparse(trees[u].right)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n\n\nN = int(input())\n\ntrees = [Tree(-1,-1,-1) for i in range(N)]\nfor i in range(N):\n l = list(map(int, input().split()))\n no = l[0]\n left = l[1]\n right = l[2]\n trees[no].left = left\n trees[no].right = right\n if left != -1: trees[left].parent = no\n if right != -1: trees[right].parent = no\n\nprint(\"Preorder\")\npreparse(0)\nprint(\"\")\nprint(\"Inorder\")\ninparse(0)\nprint(\"\")\nprint(\"Postorder\")\npostparse(0)", "code2": "\nclass Tree:\n def __init__(self,parent,left,right):\n self.parent = parent\n self.left = left\n self.right = right\n\n\ndef preparse(u):\n if u == -1: return\n print(\" \", end=\"\")\n print(u, end=\"\")\n preparse(trees[u].left)\n preparse(trees[u].right)\n\n\ndef inparse(u):\n if u == -1: return\n \n inparse(trees[u].left)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n \n inparse(trees[u].right)\n \n\ndef postparse(u):\n if u == -1: return\n \n postparse(trees[u].left)\n \n postparse(trees[u].right)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n\n\nN = int(input())\n\ntrees = [Tree(-1,-1,-1) for i in range(N)]\nfor i in range(N):\n l = list(map(int, input().split()))\n no = l[0]\n left = l[1]\n right = l[2]\n trees[no].left = left\n trees[no].right = right\n if left != -1: trees[left].parent = no\n if right != -1: trees[right].parent = no\n\nr = 0\nfor i in range(N):\n if trees[i].parent == -1:\n r = i\n\nprint(\"Preorder\")\npreparse(r)\nprint(\"\")\nprint(\"Inorder\")\ninparse(r)\nprint(\"\")\nprint(\"Postorder\")\npostparse(r)\nprint(\"\")", "original_language1": "Python3", "original_language2": "Python3", "date1": "1489764897", "date2": "1489765134", "bleu_score": "0.9210205240751228", "code1_test_status": [1, 1, 0, 0, 0], "code1_test_score": 2, "total_score": 5, "input": "9\n0 2 4\n1 0 3\n2 -1 -1\n3 -1 0\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0", "expected_output": "Preorder\n 1 0 2 4 5 6 7 8 3 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8 1 3 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0 2 6 7 5 8 4 0 3 1\n\n", "anno_code": ["\nclass Tree: # (0): Tree=\n def __init__(self,parent,left,right):\n self.parent = parent # (6): NO CHANGE (9): NO CHANGE ... (30): NO CHANGE\n self.left = left # (7): NO CHANGE (10): NO CHANGE ... (31): NO CHANGE\n self.right = right # (8): self= (11): self= ... (32): Tree=, preparse=, inparse=, postparse=, N=9, trees\n\n\ndef preparse(u): # (1): preparse=\n if u == -1: return # (117): NO CHANGE (121): NO CHANGE ... (159): Tree=, preparse=, inparse=, postparse=, N=9, trees=[, , , , , , , , ], i=8, l=[8, -1, -1], no=8, left=-1, right=-1\n print(\" \", end=\"\") # (118): NO CHANGE (122): NO CHANGE ... (154): NO CHANGE\n print(u, end=\"\") # (119): NO CHANGE (123): NO CHANGE ... (155): NO CHANGE\n preparse(trees[u].left) # (120): u=2 (124): u=-1 ... (156): u=-1\n preparse(trees[u].right) # (126): u=-1 (128): u=4 ... (158): u=-1\n\n\ndef inparse(u): # (2): inparse=\n if u == -1: return # (163): NO CHANGE (165): NO CHANGE ... (205): Tree=, preparse=, inparse=, postparse=, N=9, trees=[, , , , , , , , ], i=8, l=[8, -1, -1], no=8, left=-1, right=-1\n \n inparse(trees[u].left) # (164): u=2 (166): u=-1 ... (200): u=-1\n \n print(\" \", end=\"\") # (168): NO CHANGE (172): NO CHANGE ... (202): NO CHANGE\n print(u, end=\"\") # (169): NO CHANGE (173): NO CHANGE ... (203): NO CHANGE\n \n inparse(trees[u].right) # (170): u=-1 (174): u=4 ... (204): u=-1\n \n\ndef postparse(u): # (3): postparse=\n if u == -1: return # (209): NO CHANGE (211): NO CHANGE ... (245): u=8\n \n postparse(trees[u].left) # (210): u=2 (212): u=-1 ... (242): u=-1\n \n postparse(trees[u].right) # (214): u=-1 (218): u=4 ... (244): u=-1\n \n print(\" \", end=\"\") # (216): NO CHANGE (228): NO CHANGE ... (250): NO CHANGE\n print(u, end=\"\") # (217): u=0 (229): u=5 ... (249): u=0\n\n\nN = int(input()) # (4): N=9\n\ntrees = [Tree(-1,-1,-1) for i in range(N)] # (5): self=, parent=-1, left=-1, right=-1\nfor i in range(N): # (33): trees=[, , , , , , , , ], i=0 (42): trees, i=1 ... (114): trees\n l = list(map(int, input().split())) # (34): trees=[, , , , , , , , ], l=[0, 2, 4] (43): trees=[, , , , , , , , ], l=[1, 0, 3] ... (106): trees, l=[8, -1, -1]\n no = l[0] # (35): trees=[, , , , , , , , ], no=0 (44): trees=[, , , , , , , , ], no=1 ... (107): trees, no=8\n left = l[1] # (36): trees=[, , , , , , , , ], left=2 (45): trees, left=0 ... (108): trees\n right = l[2] # (37): trees=[, , , , , , , , ], right=4 (46): trees, right=3 ... (109): trees\n trees[no].left = left # (38): trees (47): trees ... (110): trees\n trees[no].right = right # (39): trees (48): trees ... (111): trees\n if left != -1: trees[left].parent = no # (40): trees (49): trees ... (112): trees\n if right != -1: trees[right].parent = no # (41): trees (50): trees ... (113): trees\n\nprint(\"Preorder\") # (115): trees\npreparse(0) # (116): u=0\nprint(\"\") # (160): trees\nprint(\"Inorder\") # (161): trees\ninparse(0) # (162): u=0\nprint(\"\") # (206): trees\nprint(\"Postorder\") # (207): trees\npostparse(0) # (208): u=0\n"], "anno_status": [false], "diff_content": " \n class Tree:\n def __init__(self,parent,left,right):\n self.parent = parent\n self.left = left\n self.right = right\n \n \n def preparse(u):\n if u == -1: return\n print(\" \", end=\"\")\n print(u, end=\"\")\n preparse(trees[u].left)\n preparse(trees[u].right)\n \n \n def inparse(u):\n if u == -1: return\n \n inparse(trees[u].left)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n \n inparse(trees[u].right)\n \n \n def postparse(u):\n if u == -1: return\n \n postparse(trees[u].left)\n \n postparse(trees[u].right)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n \n \n N = int(input())\n \n trees = [Tree(-1,-1,-1) for i in range(N)]\n for i in range(N):\n l = list(map(int, input().split()))\n no = l[0]\n left = l[1]\n right = l[2]\n trees[no].left = left\n trees[no].right = right\n if left != -1: trees[left].parent = no\n if right != -1: trees[right].parent = no\n \n+r = 0\n+for i in range(N):\n+ if trees[i].parent == -1:\n+ r = i\n+\n print(\"Preorder\")\n-preparse(0)\n+preparse(r)\n print(\"\")\n print(\"Inorder\")\n-inparse(0)\n+inparse(r)\n print(\"\")\n print(\"Postorder\")\n-postparse(0)\n+postparse(r)\n+print(\"\")\n", "FL_content": " \n class Tree:\n def __init__(self,parent,left,right):\n self.parent = parent\n self.left = left\n self.right = right\n \n \n def preparse(u):\n if u == -1: return\n print(\" \", end=\"\")\n print(u, end=\"\")\n preparse(trees[u].left)\n preparse(trees[u].right)\n \n \n def inparse(u):\n if u == -1: return\n \n inparse(trees[u].left)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n \n inparse(trees[u].right)\n \n \n def postparse(u):\n if u == -1: return\n \n postparse(trees[u].left)\n \n postparse(trees[u].right)\n \n print(\" \", end=\"\")\n print(u, end=\"\")\n \n \n N = int(input())\n \n trees = [Tree(-1,-1,-1) for i in range(N)]\n for i in range(N):\n l = list(map(int, input().split()))\n no = l[0]\n left = l[1]\n right = l[2]\n trees[no].left = left\n trees[no].right = right\n if left != -1: trees[left].parent = no\n if right != -1: trees[right].parent = no\n \n print(\"Preorder\")\n-preparse(0)\n print(\"\")\n print(\"Inorder\")\n-inparse(0)\n print(\"\")\n print(\"Postorder\")\n-postparse(0)\n", "added_lines": 9, "removed_lines": 3, "code1_lines": 59 }, { "user_id": "u357267874", "problem_id": "p02281", "submission1_id": "s879594741", "submission2_id": "s547774364", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class Node:\n def __init__(self, id):\n self.id = id\n self.parent = None\n self.left = None\n self.right = None\n\nroot = None\nn = int(input())\nnode_list = []\nfor i in range(n):\n node_list.append(Node(i))\n\nfor i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n node_list[left].parent = node\n node.left = node_list[left]\n if right > -1:\n node_list[right].parent = node\n node.right = node_list[right]\n\nroot = None\nfor node in node_list:\n if node.parent is None:\n root = node\n break\n\ndef preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n\ndef inorder(node):\n if node is None:\n return\n \n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n\ndef postorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n postorder(node.left)\n postorder(node.right)\n\nprint('Preorder')\npreorder(root)\nprint('')\n\nprint('Inorder')\ninorder(root)\nprint('')\n\nprint('Postorder')\npostorder(root)\nprint('')\n", "code2": "class Node:\n def __init__(self, id):\n self.id = id\n self.parent = None\n self.left = None\n self.right = None\n\nroot = None\nn = int(input())\nnode_list = []\nfor i in range(n):\n node_list.append(Node(i))\n\nfor i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n node_list[left].parent = node\n node.left = node_list[left]\n if right > -1:\n node_list[right].parent = node\n node.right = node_list[right]\n\nroot = None\nfor node in node_list:\n if node.parent is None:\n root = node\n break\n\ndef preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n\ndef inorder(node):\n if node is None:\n return\n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n\ndef postorder(node):\n if node is None:\n return\n postorder(node.left)\n postorder(node.right)\n print(' ' + str(node.id), end='')\n\nprint('Preorder')\npreorder(root)\nprint('')\n\nprint('Inorder')\ninorder(root)\nprint('')\n\nprint('Postorder')\npostorder(root)\nprint('')\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559347428", "date2": "1559347485", "bleu_score": "0.9953562489459643", "code1_test_status": [0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 5, "input": "9\n0 2 4\n1 1 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n", "actual_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 0 2 4 5 6 7 8\n", "expected_output": "Preorder\n 0 2 4 5 6 7 8\nInorder\n 2 0 6 5 7 4 8\nPostorder\n 2 6 7 5 8 4 0\n\n", "anno_code": ["class Node: # (0): Node=\n def __init__(self, id):\n self.id = id # (6): NO CHANGE (12): NO CHANGE ... (54): NO CHANGE\n self.parent = None # (7): NO CHANGE (13): NO CHANGE ... (55): NO CHANGE\n self.left = None # (8): NO CHANGE (14): NO CHANGE ... (56): NO CHANGE\n self.right = None # (9): Node=, root=None, n=9, node_list=[], i=0 (15): Node=, root=None, n=9, node_list=[, ], i=1 ... (57): Node=, root=None, n=9, node_list, i=8\n\nroot = None # (1): root=None\nn = int(input()) # (2): n=9\nnode_list = [] # (3): node_list=[]\nfor i in range(n): # (4): i=0 (10): node_list, i=1 ... (58): node_list\n node_list.append(Node(i)) # (5): self=, id=0 (11): self=, id=1 ... (53): self=, id=8\n\nfor i in range(n): # (59): node_list=[, , , , , , , , ], i=0 (68): node_list, i=1 ... (120): node_list\n id, left, right = list(map(int, input().split())) # (60): node_list=[, , , , , , , , ], id=0, left=2, right=4 (69): node_list=[, , , , , , , , ], id=1, left=1, right=3 ... (116): node_list, id=8\n node = node_list[id] # (61): node_list=[, , , , , , , , ], node= (70): node_list=[, , , , , , , , ], node= ... (117): node_list, node=\n if left > -1: # (62): node_list (71): node_list ... (118): node_list\n node_list[left].parent = node # (63): node_list (72): node_list ... (100): node_list\n node.left = node_list[left] # (64): node_list (73): node_list ... (101): node_list\n if right > -1: # (65): node_list (74): node_list ... (119): node_list\n node_list[right].parent = node # (66): node_list (75): node_list ... (103): node_list\n node.right = node_list[right] # (67): node_list (76): node_list ... (104): node_list\n\nroot = None # (121): node_list\nfor node in node_list: # (122): node_list, node=\n if node.parent is None: # (123): node_list\n root = node # (124): root=, node_list\n break # (125): node_list\n\ndef preorder(node): # (126): node_list, preorder=\n if node is None: # (131): NO CHANGE (134): NO CHANGE ... (173): NO CHANGE\n return # (138): node= (141): node= ... (174): Node=, root=, n=9, node_list, i=8, id=8, left=-1, right=-1, node=, preorder=, inorder=, postorder=\n print(' ' + str(node.id), end='') # (132): NO CHANGE (135): NO CHANGE ... (168): NO CHANGE\n preorder(node.left) # (133): node= (136): node=None ... (169): node=None\n preorder(node.right) # (139): node=None (142): node= ... (172): node=None\n\ndef inorder(node): # (127): node_list, inorder=\n if node is None: # (178): NO CHANGE (180): NO CHANGE ... (220): NO CHANGE\n return # (183): node= (187): node= ... (221): Node=, root=, n=9, node_list, i=8, id=8, left=-1, right=-1, node=, preorder=, inorder=, postorder=\n \n inorder(node.left) # (179): node= (181): node=None ... (215): node=None\n print(' ' + str(node.id), end='') # (184): NO CHANGE (188): NO CHANGE ... (218): NO CHANGE\n inorder(node.right) # (185): node=None (189): node= ... (219): node=None\n\ndef postorder(node): # (128): node_list, postorder=\n if node is None: # (225): NO CHANGE (228): NO CHANGE ... (267): NO CHANGE\n return # (232): node= (235): node= ... (268): Node=, root=, n=9, node_list, i=8, id=8, left=-1, right=-1, node=, preorder=, inorder=, postorder=\n print(' ' + str(node.id), end='') # (226): NO CHANGE (229): NO CHANGE ... (262): NO CHANGE\n postorder(node.left) # (227): node= (230): node=None ... (263): node=None\n postorder(node.right) # (233): node=None (236): node= ... (266): node=None\n\nprint('Preorder') # (129): node_list\npreorder(root) # (130): NO CHANGE\nprint('') # (175): node_list\n\nprint('Inorder') # (176): node_list\ninorder(root) # (177): NO CHANGE\nprint('') # (222): node_list\n\nprint('Postorder') # (223): node_list\npostorder(root) # (224): NO CHANGE\nprint('')\n"], "anno_status": [false], "diff_content": " class Node:\n def __init__(self, id):\n self.id = id\n self.parent = None\n self.left = None\n self.right = None\n \n root = None\n n = int(input())\n node_list = []\n for i in range(n):\n node_list.append(Node(i))\n \n for i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n node_list[left].parent = node\n node.left = node_list[left]\n if right > -1:\n node_list[right].parent = node\n node.right = node_list[right]\n \n root = None\n for node in node_list:\n if node.parent is None:\n root = node\n break\n \n def preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n \n def inorder(node):\n if node is None:\n return\n- \n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n \n def postorder(node):\n if node is None:\n return\n- print(' ' + str(node.id), end='')\n postorder(node.left)\n postorder(node.right)\n+ print(' ' + str(node.id), end='')\n \n print('Preorder')\n preorder(root)\n print('')\n \n print('Inorder')\n inorder(root)\n print('')\n \n print('Postorder')\n postorder(root)\n print('')\n \n", "FL_content": " class Node:\n def __init__(self, id):\n self.id = id\n self.parent = None\n self.left = None\n self.right = None\n \n root = None\n n = int(input())\n node_list = []\n for i in range(n):\n node_list.append(Node(i))\n \n for i in range(n):\n id, left, right = list(map(int, input().split()))\n node = node_list[id]\n if left > -1:\n node_list[left].parent = node\n node.left = node_list[left]\n if right > -1:\n node_list[right].parent = node\n node.right = node_list[right]\n \n root = None\n for node in node_list:\n if node.parent is None:\n root = node\n break\n \n def preorder(node):\n if node is None:\n return\n print(' ' + str(node.id), end='')\n preorder(node.left)\n preorder(node.right)\n \n def inorder(node):\n if node is None:\n return\n- \n inorder(node.left)\n print(' ' + str(node.id), end='')\n inorder(node.right)\n \n def postorder(node):\n if node is None:\n return\n- print(' ' + str(node.id), end='')\n postorder(node.left)\n postorder(node.right)\n \n print('Preorder')\n preorder(root)\n print('')\n \n print('Inorder')\n inorder(root)\n print('')\n \n print('Postorder')\n postorder(root)\n print('')\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 63 }, { "user_id": "u557494880", "problem_id": "p03716", "submission1_id": "s775514001", "submission2_id": "s439911358", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nS = []\nP = A[:N]\nQ = A[2*N:]\nfor i in range(N):\n Q[i] *= -1\nR = A[N:2*N]\np = [0]*(N+1)\nq = [0]*(N+1)\nimport heapq\nheapq.heapify(P)\nheapq.heapify(Q)\nsp = sum(P)\nsq = sum(Q)\np[0] = sp\nq[0] = sq\n\nfor i in range(1,N+1):\n heapq.heappush(P,R[i-1])\n heapq.heappop(P)\n sp = sum(P)\n p[i] = sum(Q)\nfor i in range(1,N+1):\n heapq.heappush(Q,-R[-i])\n heapq.heappop(Q)\n sq = sum(Q)\n q[i] = sq\n\nans = -(10**100)\nfor k in range(N+1):\n ans = max(ans,p[k] + q[N-k])\n \nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int,input().split()))\nS = []\nP = A[:N]\nQ = A[2*N:]\nfor i in range(N):\n Q[i] *= -1\nR = A[N:2*N]\np = [0]*(N+1)\nq = [0]*(N+1)\nimport heapq\nheapq.heapify(P)\nheapq.heapify(Q)\nsp = sum(P)\nsq = sum(Q)\np[0] = sp\nq[0] = sq\n\nfor i in range(1,N+1):\n heapq.heappush(P,R[i-1])\n x = heapq.heappop(P)\n heapq.heappush(Q,-R[-i])\n y = heapq.heappop(Q)\n sp = sp + R[i-1] - x\n sq = sq - R[-i] - y\n p[i] = sp\n q[i] = sq\nans = -(10**100)\nfor k in range(N+1):\n ans = max(ans,p[k] + q[N-k])\n \nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573456966", "date2": "1573457486", "bleu_score": "0.9190379763846078", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "-1\n", "expected_output": "1\n", "anno_code": ["N = int(input()) # (0): N=2\nA = list(map(int,input().split())) # (1): A=[3, 1, 4, 1, 5, 9]\nS = [] # (2): S=[]\nP = A[:N] # (3): P=[3, 1]\nQ = A[2*N:] # (4): Q=[5, 9]\nfor i in range(N): # (5): i=0 (7): i=1 (9): NO CHANGE\n Q[i] *= -1 # (6): Q=[-5, 9] (8): Q=[-5, -9]\nR = A[N:2*N] # (10): R=[4, 1]\np = [0]*(N+1) # (11): p=[0, 0, 0]\nq = [0]*(N+1) # (12): q=[0, 0, 0], heapq=\nimport heapq\nheapq.heapify(P) # (13): P=[1, 3]\nheapq.heapify(Q) # (14): Q=[-9, -5]\nsp = sum(P) # (15): sp=4\nsq = sum(Q) # (16): sq=-14\np[0] = sp # (17): p=[4, 0, 0]\nq[0] = sq # (18): q=[-14, 0, 0]\n\nfor i in range(1,N+1): # (19): NO CHANGE (24): i=2 (29): NO CHANGE\n heapq.heappush(P,R[i-1]) # (20): P=[1, 3, 4] (25): P=[1, 4, 3]\n heapq.heappop(P) # (21): P=[3, 4] (26): P=[3, 4]\n sp = sum(P) # (22): sp=7 (27): NO CHANGE\n p[i] = sum(Q) # (23): p=[4, -14, 0] (28): p=[4, -14, -14]\nfor i in range(1,N+1): # (30): i=1 (35): i=2 (40): NO CHANGE\n heapq.heappush(Q,-R[-i]) # (31): Q=[-9, -5, -1] (36): Q=[-5, -1, -4]\n heapq.heappop(Q) # (32): Q=[-5, -1] (37): Q=[-4, -1]\n sq = sum(Q) # (33): sq=-6 (38): sq=-5\n q[i] = sq # (34): q=[-14, -6, 0] (39): q=[-14, -6, -5]\n\nans = -(10**100) # (41): ans=-10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\nfor k in range(N+1): # (42): k=0 (44): k=1 ... (48): NO CHANGE\n ans = max(ans,p[k] + q[N-k]) # (43): ans=-1 (45): NO CHANGE (47): NO CHANGE\n \nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n S = []\n P = A[:N]\n Q = A[2*N:]\n for i in range(N):\n Q[i] *= -1\n R = A[N:2*N]\n p = [0]*(N+1)\n q = [0]*(N+1)\n import heapq\n heapq.heapify(P)\n heapq.heapify(Q)\n sp = sum(P)\n sq = sum(Q)\n p[0] = sp\n q[0] = sq\n \n for i in range(1,N+1):\n heapq.heappush(P,R[i-1])\n- heapq.heappop(P)\n- sp = sum(P)\n- p[i] = sum(Q)\n-for i in range(1,N+1):\n+ x = heapq.heappop(P)\n heapq.heappush(Q,-R[-i])\n- heapq.heappop(Q)\n- sq = sum(Q)\n+ y = heapq.heappop(Q)\n+ sp = sp + R[i-1] - x\n+ sq = sq - R[-i] - y\n+ p[i] = sp\n q[i] = sq\n-\n ans = -(10**100)\n for k in range(N+1):\n ans = max(ans,p[k] + q[N-k])\n \n print(ans)\n \n", "FL_content": " N = int(input())\n A = list(map(int,input().split()))\n S = []\n P = A[:N]\n Q = A[2*N:]\n for i in range(N):\n Q[i] *= -1\n R = A[N:2*N]\n p = [0]*(N+1)\n q = [0]*(N+1)\n import heapq\n heapq.heapify(P)\n heapq.heapify(Q)\n sp = sum(P)\n sq = sum(Q)\n p[0] = sp\n q[0] = sq\n \n for i in range(1,N+1):\n heapq.heappush(P,R[i-1])\n- heapq.heappop(P)\n- sp = sum(P)\n- p[i] = sum(Q)\n-for i in range(1,N+1):\n heapq.heappush(Q,-R[-i])\n- heapq.heappop(Q)\n- sq = sum(Q)\n q[i] = sq\n-\n ans = -(10**100)\n for k in range(N+1):\n ans = max(ans,p[k] + q[N-k])\n \n print(ans)\n \n", "added_lines": 5, "removed_lines": 7, "code1_lines": 35 }, { "user_id": "u207097826", "problem_id": "p03716", "submission1_id": "s096813467", "submission2_id": "s469812461", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nfrom heapq import heappush, heappop\nimport sys\n\nN = int(input())\na = list(map(int,input().split()))\n\nhq = []\nhq_r = []\nfor i in range(N):\n heappush(hq,a[i])\n heappush(hq_r,-1*a[-1-i])\n\n\nmax_A = [0 for _ in range(N+1)]\nmax_A[0] = sum(hq)\n\nmin_C = [0 for _ in range(N+1)]\nmin_C[0] = sum(hq_r) * (-1)\n\nfor i in range(N):\n heappush(hq, a[N+i])\n heappush(hq_r, -1*a[-N-1-i])\n minus = heappop(hq)\n minus_r = heappop(hq_r)\n max_A[i+1] = max_A[i] + a[N+i] - minus\n min_C[i+1] = min_C[i] + a[-N-1-i] + minus_r\n \nmax_val = -10e+100\nprint(max_val)\nfor i in range(N+1):\n kari = max_A[i] - min_C[-1-i]\n if max_val < kari:\n max_val =kari\nprint(max_val)", "code2": "\n\nfrom heapq import heappush, heappop\nimport sys\n\nN = int(input())\na = list(map(int,input().split()))\n\nhq = []\nhq_r = []\nfor i in range(N):\n heappush(hq,a[i])\n heappush(hq_r,-1*a[-1-i])\n\n\nmax_A = [0 for _ in range(N+1)]\nmax_A[0] = sum(hq)\n\nmin_C = [0 for _ in range(N+1)]\nmin_C[0] = sum(hq_r) * (-1)\n\nfor i in range(N):\n heappush(hq, a[N+i])\n heappush(hq_r, -1*a[-N-1-i])\n minus = heappop(hq)\n minus_r = heappop(hq_r)\n max_A[i+1] = max_A[i] + a[N+i] - minus\n min_C[i+1] = min_C[i] + a[-N-1-i] + minus_r\n \nmax_val = -10e+100\nfor i in range(N+1):\n kari = max_A[i] - min_C[-1-i]\n if max_val < kari:\n max_val =kari\nprint(max_val)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588551547", "date2": "1588551608", "bleu_score": "0.9765882296832089", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "-1e+101\n1\n", "expected_output": "1\n", "anno_code": ["\n\nfrom heapq import heappush, heappop\nimport sys\n\nN = int(input()) # (0): N=2\na = list(map(int,input().split())) # (1): a=[3, 1, 4, 1, 5, 9]\n\nhq = [] # (2): hq=[]\nhq_r = [] # (3): hq_r=[]\nfor i in range(N): # (4): i=0 (7): i=1 (10): NO CHANGE\n heappush(hq,a[i]) # (5): hq=[3] (8): hq=[1, 3]\n heappush(hq_r,-1*a[-1-i]) # (6): hq_r=[-9] (9): hq_r=[-9, -5]\n\n\nmax_A = [0 for _ in range(N+1)] # (11): max_A=[0, 0, 0]\nmax_A[0] = sum(hq) # (12): max_A=[4, 0, 0]\n\nmin_C = [0 for _ in range(N+1)] # (13): min_C=[0, 0, 0]\nmin_C[0] = sum(hq_r) * (-1) # (14): min_C=[14, 0, 0]\n\nfor i in range(N): # (15): i=0 (22): i=1 (29): NO CHANGE\n heappush(hq, a[N+i]) # (16): hq=[1, 3, 4] (23): hq=[1, 4, 3]\n heappush(hq_r, -1*a[-N-1-i]) # (17): hq_r=[-9, -5, -1] (24): hq_r=[-5, -1, -4]\n minus = heappop(hq) # (18): hq=[3, 4], minus=1 (25): hq=[3, 4]\n minus_r = heappop(hq_r) # (19): hq_r=[-5, -1], minus_r=-9 (26): hq_r=[-4, -1], minus_r=-5\n max_A[i+1] = max_A[i] + a[N+i] - minus # (20): max_A=[4, 7, 0] (27): max_A=[4, 7, 7]\n min_C[i+1] = min_C[i] + a[-N-1-i] + minus_r # (21): min_C=[14, 6, 0] (28): min_C=[14, 6, 5]\n \nmax_val = -10e+100 # (30): max_val=-1e+101\nprint(max_val) # (31): NO CHANGE\nfor i in range(N+1): # (32): i=0 (36): i=1 ... (43): NO CHANGE\n kari = max_A[i] - min_C[-1-i] # (33): kari=-1 (37): kari=1 (41): kari=-7\n if max_val < kari: # (34): NO CHANGE (38): NO CHANGE (42): NO CHANGE\n max_val =kari # (35): max_val=-1 (39): max_val=1\nprint(max_val)"], "anno_status": [true], "diff_content": " \n \n from heapq import heappush, heappop\n import sys\n \n N = int(input())\n a = list(map(int,input().split()))\n \n hq = []\n hq_r = []\n for i in range(N):\n heappush(hq,a[i])\n heappush(hq_r,-1*a[-1-i])\n \n \n max_A = [0 for _ in range(N+1)]\n max_A[0] = sum(hq)\n \n min_C = [0 for _ in range(N+1)]\n min_C[0] = sum(hq_r) * (-1)\n \n for i in range(N):\n heappush(hq, a[N+i])\n heappush(hq_r, -1*a[-N-1-i])\n minus = heappop(hq)\n minus_r = heappop(hq_r)\n max_A[i+1] = max_A[i] + a[N+i] - minus\n min_C[i+1] = min_C[i] + a[-N-1-i] + minus_r\n \n max_val = -10e+100\n-print(max_val)\n for i in range(N+1):\n kari = max_A[i] - min_C[-1-i]\n if max_val < kari:\n max_val =kari\n print(max_val)\n", "FL_content": " \n \n from heapq import heappush, heappop\n import sys\n \n N = int(input())\n a = list(map(int,input().split()))\n \n hq = []\n hq_r = []\n for i in range(N):\n heappush(hq,a[i])\n heappush(hq_r,-1*a[-1-i])\n \n \n max_A = [0 for _ in range(N+1)]\n max_A[0] = sum(hq)\n \n min_C = [0 for _ in range(N+1)]\n min_C[0] = sum(hq_r) * (-1)\n \n for i in range(N):\n heappush(hq, a[N+i])\n heappush(hq_r, -1*a[-N-1-i])\n minus = heappop(hq)\n minus_r = heappop(hq_r)\n max_A[i+1] = max_A[i] + a[N+i] - minus\n min_C[i+1] = min_C[i] + a[-N-1-i] + minus_r\n \n max_val = -10e+100\n-print(max_val)\n for i in range(N+1):\n kari = max_A[i] - min_C[-1-i]\n if max_val < kari:\n max_val =kari\n print(max_val)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 36 }, { "user_id": "u540799318", "problem_id": "p03716", "submission1_id": "s815837487", "submission2_id": "s375623004", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom collections import Counter, deque, defaultdict\nfrom math import factorial\nimport heapq, bisect\nimport math\nimport itertools\nsys.setrecursionlimit(10 ** 5 + 10)\nINF = 10*5\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()))\n\nn = INT()\na = LIST()\n\na1 = a[:2*n]\na2 = a[n:]\na2.reverse()\nfor i in range(2*n):\n a2[i] = a2[i]*-1\n\ndef searchmax(a):\n print(a)\n maxl = [0]*(n+1)\n left = a[:n]\n center = a[n:]\n heapq.heapify(left)\n maxl[0] = sum(left)\n for i in range(1,n+1):\n heapq.heappushpop(left, center[i-1])\n maxl[i] = sum(left)\n print(maxl)\n return maxl\n\nmaxll = searchmax(a1)\nminrr = searchmax(a2)\nminrr.reverse()\n\nres = [INF *-1]*(n+1)\nfor i in range(n+1):\n res[i] = maxll[i] + minrr[i]\n\nprint(max(res)) \n\n\n\n", "code2": "import sys\nfrom collections import Counter, deque, defaultdict\nfrom math import factorial\nimport heapq, bisect\nimport math\nimport itertools\nsys.setrecursionlimit(10 ** 5 + 10)\nINF = 10*5\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()))\n\ndef main():\n n = INT()\n a = LIST()\n\n a1 = a[:2*n]\n a2 = a[n:]\n a2.reverse()\n for i in range(2*n):\n a2[i] = a2[i]*-1\n\n def searchmax(a):\n maxl = [0]*(n+1)\n left = a[:n]\n center = a[n:]\n heapq.heapify(left)\n maxl[0] = sum(left)\n for i in range(1,n+1):\n poped = heapq.heappushpop(left, center[i-1])\n maxl[i] = max(maxl[i-1], maxl[i-1]-poped+center[i-1])\n return maxl\n\n maxll = searchmax(a1)\n minrr = searchmax(a2)\n minrr.reverse()\n\n res = [INF *-1]*(n+1)\n for i in range(n+1):\n res[i] = maxll[i] + minrr[i]\n\n print(max(res)) \n\nif __name__ == '__main__':\n main()\n \n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1569245664", "date2": "1569246343", "bleu_score": "0.8074383416808745", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "[3, 1, 4, 1]\n[4, 7, 7]\n[-9, -5, -1, -4]\n[-14, -6, -5]\n1\n", "expected_output": "1\n", "anno_code": ["import sys\nfrom collections import Counter, deque, defaultdict\nfrom math import factorial\nimport heapq, bisect\nimport math\nimport itertools\nsys.setrecursionlimit(10 ** 5 + 10) # (0): NO CHANGE\nINF = 10*5 # (1): INF=50, 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()))\n\nn = INT() # (2): n=2\na = LIST() # (3): a=[3, 1, 4, 1, 5, 9]\n\na1 = a[:2*n] # (4): a1=[3, 1, 4, 1]\na2 = a[n:] # (5): a2=[4, 1, 5, 9]\na2.reverse() # (6): a2=[9, 5, 1, 4]\nfor i in range(2*n): # (7): i=0 (9): i=1 ... (15): NO CHANGE\n a2[i] = a2[i]*-1 # (8): a2=[-9, 5, 1, 4] (10): a2=[-9, -5, 1, 4] ... (14): a2=[-9, -5, -1, -4]\n\ndef searchmax(a): # (16): searchmax=\n print(a) # (18): NO CHANGE (33): NO CHANGE\n maxl = [0]*(n+1) # (19): maxl=[0, 0, 0] (34): maxl=[0, 0, 0]\n left = a[:n] # (20): left=[3, 1] (35): left=[-9, -5]\n center = a[n:] # (21): center=[4, 1] (36): center=[-1, -4]\n heapq.heapify(left) # (22): left=[1, 3] (37): NO CHANGE\n maxl[0] = sum(left) # (23): maxl=[4, 0, 0] (38): maxl=[-14, 0, 0]\n for i in range(1,n+1): # (24): i=1 (27): i=2 ... (45): NO CHANGE\n heapq.heappushpop(left, center[i-1]) # (25): left=[3, 4] (28): NO CHANGE ... (43): left=[-4, -1]\n maxl[i] = sum(left) # (26): maxl=[4, 7, 0] (29): maxl=[4, 7, 7] ... (44): maxl=[-14, -6, -5]\n print(maxl) # (31): sys=, Counter=, deque=, defaultdict=, factorial=, heapq=, bisect=, math=, itertools=, INF=50, input=, INT=, MAP=, LIST=, n=2, a=[3, 1, 4, 1, 5, 9], a1=[3, 1, 4, 1], a2=[-9, -5, -1, -4], i=3, searchmax=, maxll=[4, 7, 7] (46): sys=, Counter=, deque=, defaultdict=, factorial=, heapq=, bisect=, math=, itertools=, INF=50, input=, INT=, MAP=, LIST=, n=2, a=[3, 1, 4, 1, 5, 9], a1=[3, 1, 4, 1], a2=[-9, -5, -1, -4], i=3, searchmax=, maxll=[4, 7, 7], minrr=[-14, -6, -5]\n return maxl\n\nmaxll = searchmax(a1) # (17): a=[3, 1, 4, 1]\nminrr = searchmax(a2) # (32): a=[-9, -5, -1, -4]\nminrr.reverse() # (47): minrr=[-5, -6, -14]\n\nres = [INF *-1]*(n+1) # (48): res=[-50, -50, -50]\nfor i in range(n+1): # (49): i=0 (51): i=1 ... (55): NO CHANGE\n res[i] = maxll[i] + minrr[i] # (50): res=[-1, -50, -50] (52): res=[-1, 1, -50] (54): res=[-1, 1, -7]\n\nprint(max(res)) \n\n\n\n"], "anno_status": [false], "diff_content": " import sys\n from collections import Counter, deque, defaultdict\n from math import factorial\n import heapq, bisect\n import math\n import itertools\n sys.setrecursionlimit(10 ** 5 + 10)\n INF = 10*5\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 \n-n = INT()\n-a = LIST()\n-\n-a1 = a[:2*n]\n-a2 = a[n:]\n-a2.reverse()\n-for i in range(2*n):\n- a2[i] = a2[i]*-1\n-\n-def searchmax(a):\n- print(a)\n- maxl = [0]*(n+1)\n- left = a[:n]\n- center = a[n:]\n- heapq.heapify(left)\n- maxl[0] = sum(left)\n- for i in range(1,n+1):\n- heapq.heappushpop(left, center[i-1])\n- maxl[i] = sum(left)\n- print(maxl)\n- return maxl\n-\n-maxll = searchmax(a1)\n-minrr = searchmax(a2)\n-minrr.reverse()\n-\n-res = [INF *-1]*(n+1)\n-for i in range(n+1):\n- res[i] = maxll[i] + minrr[i]\n-\n-print(max(res)) \n-\n-\n+def main():\n+ n = INT()\n+ a = LIST()\n+\n+ a1 = a[:2*n]\n+ a2 = a[n:]\n+ a2.reverse()\n+ for i in range(2*n):\n+ a2[i] = a2[i]*-1\n+\n+ def searchmax(a):\n+ maxl = [0]*(n+1)\n+ left = a[:n]\n+ center = a[n:]\n+ heapq.heapify(left)\n+ maxl[0] = sum(left)\n+ for i in range(1,n+1):\n+ poped = heapq.heappushpop(left, center[i-1])\n+ maxl[i] = max(maxl[i-1], maxl[i-1]-poped+center[i-1])\n+ return maxl\n+\n+ maxll = searchmax(a1)\n+ minrr = searchmax(a2)\n+ minrr.reverse()\n+\n+ res = [INF *-1]*(n+1)\n+ for i in range(n+1):\n+ res[i] = maxll[i] + minrr[i]\n+\n+ print(max(res)) \n+\n+if __name__ == '__main__':\n+ main()\n+ \n \n \n", "FL_content": " import sys\n from collections import Counter, deque, defaultdict\n from math import factorial\n import heapq, bisect\n import math\n import itertools\n sys.setrecursionlimit(10 ** 5 + 10)\n INF = 10*5\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 \n-n = INT()\n-a = LIST()\n-\n-a1 = a[:2*n]\n-a2 = a[n:]\n-a2.reverse()\n-for i in range(2*n):\n- a2[i] = a2[i]*-1\n-\n-def searchmax(a):\n- print(a)\n- maxl = [0]*(n+1)\n- left = a[:n]\n- center = a[n:]\n- heapq.heapify(left)\n- maxl[0] = sum(left)\n- for i in range(1,n+1):\n- heapq.heappushpop(left, center[i-1])\n- maxl[i] = sum(left)\n- print(maxl)\n- return maxl\n-\n-maxll = searchmax(a1)\n-minrr = searchmax(a2)\n-minrr.reverse()\n-\n-res = [INF *-1]*(n+1)\n-for i in range(n+1):\n- res[i] = maxll[i] + minrr[i]\n-\n-print(max(res)) \n-\n-\n \n \n", "added_lines": 34, "removed_lines": 33, "code1_lines": 48 }, { "user_id": "u850491413", "problem_id": "p03716", "submission1_id": "s354972164", "submission2_id": "s645558140", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nfrom collections import deque, defaultdict\nimport copy\nimport bisect\n\nimport math\nimport heapq\nfrom itertools import combinations, permutations\n\nimport sys\ndef input():\n\treturn sys.stdin.readline().strip()\n\nN = int(input())\na = list(map(int, input().split()))\n\na_max = a[:N]\na_min = a[2*N:]\n\na_max_sum = sum(a_max)\nscore = [a_max_sum]\nheapq.heapify(a_max)\nfor i in range(N):\n\theapq.heappush(a_max, a[N + i])\n\ta_max_sum += a[N + i]\n\ta_max_sum -= heapq.heappop(a_max)\n\tscore.append(a_max_sum)\nprint(score)\n\na_min_sum = sum(a_min)\nscore[N] -= a_min_sum\nfor i in range(len(a_min)):\n\ta_min[i] *= -1\nheapq.heapify(a_min)\nfor i in range(N):\n\theapq.heappush(a_min, -a[2*N - 1 - i])\n\ta_min_sum += a[2*N - 1 - i]\n\ta_min_sum += heapq.heappop(a_min)\n\tscore[N - i - 1] -=a_min_sum\n\nprint(max(score))", "code2": "\nimport sys\nfrom collections import deque, defaultdict\nimport copy\nimport bisect\n\nimport math\nimport heapq\nfrom itertools import combinations, permutations\n\nimport sys\ndef input():\n\treturn sys.stdin.readline().strip()\n\nN = int(input())\na = list(map(int, input().split()))\n\na_max = a[:N]\na_min = a[2*N:]\n\na_max_sum = sum(a_max)\nscore = [a_max_sum]\nheapq.heapify(a_max)\nfor i in range(N):\n\theapq.heappush(a_max, a[N + i])\n\ta_max_sum += a[N + i]\n\ta_max_sum -= heapq.heappop(a_max)\n\tscore.append(a_max_sum)\n\na_min_sum = sum(a_min)\nscore[N] -= a_min_sum\nfor i in range(len(a_min)):\n\ta_min[i] *= -1\nheapq.heapify(a_min)\nfor i in range(N):\n\theapq.heappush(a_min, -a[2*N - 1 - i])\n\ta_min_sum += a[2*N - 1 - i]\n\ta_min_sum += heapq.heappop(a_min)\n\tscore[N - i - 1] -=a_min_sum\n\nprint(max(score))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1568174189", "date2": "1568174254", "bleu_score": "0.9832612685418782", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "[4, 7, 7]\n1\n", "expected_output": "1\n", "anno_code": ["\nimport sys\nfrom collections import deque, defaultdict\nimport copy\nimport bisect\n\nimport math\nimport heapq\nfrom itertools import combinations, permutations\n\nimport sys\ndef input(): # (0): input=\n\treturn sys.stdin.readline().strip()\n\nN = int(input()) # (1): N=2\na = list(map(int, input().split())) # (2): a=[3, 1, 4, 1, 5, 9]\n\na_max = a[:N] # (3): a_max=[3, 1]\na_min = a[2*N:] # (4): a_min=[5, 9]\n\na_max_sum = sum(a_max) # (5): a_max_sum=4\nscore = [a_max_sum] # (6): score=[4]\nheapq.heapify(a_max) # (7): a_max=[1, 3]\nfor i in range(N): # (8): i=0 (13): i=1 (18): NO CHANGE\n\theapq.heappush(a_max, a[N + i]) # (9): a_max=[1, 3, 4] (14): a_max=[1, 4, 3]\n\ta_max_sum += a[N + i] # (10): a_max_sum=8 (15): a_max_sum=8\n\ta_max_sum -= heapq.heappop(a_max) # (11): a_max=[3, 4], a_max_sum=7 (16): a_max=[3, 4], a_max_sum=7\n\tscore.append(a_max_sum) # (12): score=[4, 7] (17): score=[4, 7, 7]\nprint(score) # (19): NO CHANGE\n\na_min_sum = sum(a_min) # (20): a_min_sum=14\nscore[N] -= a_min_sum # (21): score=[4, 7, -7]\nfor i in range(len(a_min)): # (22): i=0 (24): i=1 (26): NO CHANGE\n\ta_min[i] *= -1 # (23): a_min=[-5, 9] (25): a_min=[-5, -9]\nheapq.heapify(a_min) # (27): a_min=[-9, -5]\nfor i in range(N): # (28): i=0 (33): i=1 (38): NO CHANGE\n\theapq.heappush(a_min, -a[2*N - 1 - i]) # (29): a_min=[-9, -5, -1] (34): a_min=[-5, -1, -4]\n\ta_min_sum += a[2*N - 1 - i] # (30): a_min_sum=15 (35): a_min_sum=10\n\ta_min_sum += heapq.heappop(a_min) # (31): a_min=[-5, -1], a_min_sum=6 (36): a_min=[-4, -1], a_min_sum=5\n\tscore[N - i - 1] -=a_min_sum # (32): score=[4, 1, -7] (37): score=[-1, 1, -7]\n\nprint(max(score))"], "anno_status": [true], "diff_content": " \n import sys\n from collections import deque, defaultdict\n import copy\n import bisect\n \n import math\n import heapq\n from itertools import combinations, permutations\n \n import sys\n def input():\n \treturn sys.stdin.readline().strip()\n \n N = int(input())\n a = list(map(int, input().split()))\n \n a_max = a[:N]\n a_min = a[2*N:]\n \n a_max_sum = sum(a_max)\n score = [a_max_sum]\n heapq.heapify(a_max)\n for i in range(N):\n \theapq.heappush(a_max, a[N + i])\n \ta_max_sum += a[N + i]\n \ta_max_sum -= heapq.heappop(a_max)\n \tscore.append(a_max_sum)\n-print(score)\n \n a_min_sum = sum(a_min)\n score[N] -= a_min_sum\n for i in range(len(a_min)):\n \ta_min[i] *= -1\n heapq.heapify(a_min)\n for i in range(N):\n \theapq.heappush(a_min, -a[2*N - 1 - i])\n \ta_min_sum += a[2*N - 1 - i]\n \ta_min_sum += heapq.heappop(a_min)\n \tscore[N - i - 1] -=a_min_sum\n \n print(max(score))\n", "FL_content": " \n import sys\n from collections import deque, defaultdict\n import copy\n import bisect\n \n import math\n import heapq\n from itertools import combinations, permutations\n \n import sys\n def input():\n \treturn sys.stdin.readline().strip()\n \n N = int(input())\n a = list(map(int, input().split()))\n \n a_max = a[:N]\n a_min = a[2*N:]\n \n a_max_sum = sum(a_max)\n score = [a_max_sum]\n heapq.heapify(a_max)\n for i in range(N):\n \theapq.heappush(a_max, a[N + i])\n \ta_max_sum += a[N + i]\n \ta_max_sum -= heapq.heappop(a_max)\n \tscore.append(a_max_sum)\n-print(score)\n \n a_min_sum = sum(a_min)\n score[N] -= a_min_sum\n for i in range(len(a_min)):\n \ta_min[i] *= -1\n heapq.heapify(a_min)\n for i in range(N):\n \theapq.heappush(a_min, -a[2*N - 1 - i])\n \ta_min_sum += a[2*N - 1 - i]\n \ta_min_sum += heapq.heappop(a_min)\n \tscore[N - i - 1] -=a_min_sum\n \n print(max(score))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 42 }, { "user_id": "u197457087", "problem_id": "p03716", "submission1_id": "s522750953", "submission2_id": "s443714117", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nN = int(input())\nA = list(map(int,input().split()))\nC = A[N:(2*N)]\n\nL = []\nR = []\nfor i in range(N):\n heapq.heappush(L,A[i]) \n heapq.heappush(R,-A[-1-i]) \n \n\n\nlp = 0 \nrp = 0\nfor i in range(N):\n \n if C[lp] - L[0] >= -C[-1-rp] - R[0]: \n heapq.heappush(L, C[lp]) \n temp = heapq.heappop(L)\n lp += 1\n else:\n heapq.heappush(R, -C[-1-rp])\n temp = heapq.heappop(R) \n rp += 1\nprint(L,R,lp,rp)\nans = sum(L) + sum(R)\nprint(ans)\n ", "code2": "import heapq\n\nN = int(input())\nA = list(map(int,input().split()))\nC = A[N:(2*N)]\n\nL = []\nR = []\nfor i in range(N):\n heapq.heappush(L,A[i]) \n heapq.heappush(R,-A[-1-i]) \n\n\nansL = [sum(L)]\nfor i in range(N):\n heapq.heappush(L,C[i])\n rmv = heapq.heappop(L)\n temp = ansL[i] + C[i] - rmv \n ansL.append(temp)\n \n\nansR = [sum(R)]\nfor i in range(N):\n heapq.heappush(R,-C[-1-i])\n rmv = heapq.heappop(R)\n temp = ansR[i] - C[-1-i] - rmv\n ansR.append(temp)\n \n\nans = -float('inf')\nfor i in range(N+1):\n temp = ansL[i]+ansR[-1-i]\n ans = max(ans,temp)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589732713", "date2": "1589741871", "bleu_score": "0.6378750621842556", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "[3, 4] [-5, -1] 1 1\n1\n", "expected_output": "1\n", "anno_code": ["import heapq\n\nN = int(input()) # (0): N=2\nA = list(map(int,input().split())) # (1): A=[3, 1, 4, 1, 5, 9]\nC = A[N:(2*N)] # (2): C=[4, 1]\n\nL = [] # (3): L=[]\nR = [] # (4): R=[]\nfor i in range(N): # (5): i=0 (8): i=1 (11): NO CHANGE\n heapq.heappush(L,A[i]) # (6): L=[3] (9): L=[1, 3]\n heapq.heappush(R,-A[-1-i]) # (7): R=[-9] (10): R=[-9, -5]\n \n\n\nlp = 0 # (12): lp=0\nrp = 0 # (13): rp=0\nfor i in range(N): # (14): i=0 (19): i=1 (24): NO CHANGE\n \n if C[lp] - L[0] >= -C[-1-rp] - R[0]: # (15): NO CHANGE (20): NO CHANGE\n heapq.heappush(L, C[lp]) # (21): L=[1, 3, 4]\n temp = heapq.heappop(L) # (22): L=[3, 4], temp=1\n lp += 1 # (23): lp=1\n else:\n heapq.heappush(R, -C[-1-rp]) # (16): R=[-9, -5, -1]\n temp = heapq.heappop(R) # (17): R=[-5, -1], temp=-9\n rp += 1 # (18): rp=1\nprint(L,R,lp,rp) # (25): NO CHANGE\nans = sum(L) + sum(R) # (26): ans=1\nprint(ans)\n "], "anno_status": [true], "diff_content": " import heapq\n \n N = int(input())\n A = list(map(int,input().split()))\n C = A[N:(2*N)]\n \n L = []\n R = []\n for i in range(N):\n heapq.heappush(L,A[i]) \n heapq.heappush(R,-A[-1-i]) \n- \n \n \n-lp = 0 \n-rp = 0\n+ansL = [sum(L)]\n+for i in range(N):\n+ heapq.heappush(L,C[i])\n+ rmv = heapq.heappop(L)\n+ temp = ansL[i] + C[i] - rmv \n+ ansL.append(temp)\n+ \n+\n+ansR = [sum(R)]\n for i in range(N):\n+ heapq.heappush(R,-C[-1-i])\n+ rmv = heapq.heappop(R)\n+ temp = ansR[i] - C[-1-i] - rmv\n+ ansR.append(temp)\n \n- if C[lp] - L[0] >= -C[-1-rp] - R[0]: \n- heapq.heappush(L, C[lp]) \n- temp = heapq.heappop(L)\n- lp += 1\n- else:\n- heapq.heappush(R, -C[-1-rp])\n- temp = heapq.heappop(R) \n- rp += 1\n-print(L,R,lp,rp)\n-ans = sum(L) + sum(R)\n+\n+ans = -float('inf')\n+for i in range(N+1):\n+ temp = ansL[i]+ansR[-1-i]\n+ ans = max(ans,temp)\n+\n print(ans)\n- \n", "FL_content": " import heapq\n \n N = int(input())\n A = list(map(int,input().split()))\n C = A[N:(2*N)]\n \n L = []\n R = []\n for i in range(N):\n heapq.heappush(L,A[i]) \n heapq.heappush(R,-A[-1-i]) \n- \n \n \n-lp = 0 \n-rp = 0\n for i in range(N):\n \n- if C[lp] - L[0] >= -C[-1-rp] - R[0]: \n- heapq.heappush(L, C[lp]) \n- temp = heapq.heappop(L)\n- lp += 1\n- else:\n- heapq.heappush(R, -C[-1-rp])\n- temp = heapq.heappop(R) \n- rp += 1\n-print(L,R,lp,rp)\n-ans = sum(L) + sum(R)\n print(ans)\n- \n", "added_lines": 19, "removed_lines": 14, "code1_lines": 30 }, { "user_id": "u041351774", "problem_id": "p03716", "submission1_id": "s961895692", "submission2_id": "s752217906", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nn=int(input())\na=list(map(int,input().split()))\nq=a[0:n]\nheapq.heapify(q)\np=list(map(lambda x: x*(-1),a[2*n:3*n]))\nheapq.heapify(p)\nsums=[0]*(n+1)\nsums[0]=sum(q)\nsums[n]=sum(p)\nam=a[n:2*n]\nfor i in range(0,n):\n heapq.heappush(q,am[i])\n heapq.heappop(q)\n sums[i+1]=sum(q)\nfor i in range(n-1,-1,-1):\n heapq.heappush(p,(-1)*am[i])\n heapq.heappop(p)\n sums[i]+=sum(p)\nprint(max(sums))", "code2": "import heapq\nn=int(input())\na=list(map(int,input().split()))\nq=a[0:n]\nsums=[0]*(n+1)\nsums[0]=sum(q)\nheapq.heapify(q)\nam=a[n:2*n]\nfor i in range(0,n):\n heapq.heappush(q,am[i])\n sums[i+1]=sums[i]+am[i]-heapq.heappop(q)\np=a[2*n:3*n]\np=list(map(lambda x: x*(-1),p))\nsump=sum(p)\nsums[n]+=sump\nheapq.heapify(p)\nfor i in range(n-1,-1,-1):\n heapq.heappush(p,(-1)*am[i])\n sump=sump-am[i]-heapq.heappop(p)\n sums[i]+=sump\nprint(max(sums))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587937631", "date2": "1587938727", "bleu_score": "0.8793428930612864", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "7\n", "expected_output": "1\n", "anno_code": ["import heapq\nn=int(input()) # (0): n=2\na=list(map(int,input().split())) # (1): a=[3, 1, 4, 1, 5, 9]\nq=a[0:n] # (2): q=[3, 1]\nheapq.heapify(q) # (3): q=[1, 3]\np=list(map(lambda x: x*(-1),a[2*n:3*n])) # (4): p=[-5, -9]\nheapq.heapify(p) # (5): p=[-9, -5]\nsums=[0]*(n+1) # (6): sums=[0, 0, 0]\nsums[0]=sum(q) # (7): sums=[4, 0, 0]\nsums[n]=sum(p) # (8): sums=[4, 0, -14]\nam=a[n:2*n] # (9): am=[4, 1]\nfor i in range(0,n): # (10): i=0 (14): i=1 (18): NO CHANGE\n heapq.heappush(q,am[i]) # (11): q=[1, 3, 4] (15): q=[1, 4, 3]\n heapq.heappop(q) # (12): q=[3, 4] (16): q=[3, 4]\n sums[i+1]=sum(q) # (13): sums=[4, 7, -14] (17): sums=[4, 7, 7]\nfor i in range(n-1,-1,-1): # (19): NO CHANGE (23): i=0 (27): NO CHANGE\n heapq.heappush(p,(-1)*am[i]) # (20): p=[-9, -5, -1] (24): p=[-5, -1, -4]\n heapq.heappop(p) # (21): p=[-5, -1] (25): p=[-4, -1]\n sums[i]+=sum(p) # (22): sums=[4, 1, 7] (26): sums=[-1, 1, 7]\nprint(max(sums))"], "anno_status": [true], "diff_content": " import heapq\n n=int(input())\n a=list(map(int,input().split()))\n q=a[0:n]\n-heapq.heapify(q)\n-p=list(map(lambda x: x*(-1),a[2*n:3*n]))\n-heapq.heapify(p)\n sums=[0]*(n+1)\n sums[0]=sum(q)\n-sums[n]=sum(p)\n+heapq.heapify(q)\n am=a[n:2*n]\n for i in range(0,n):\n heapq.heappush(q,am[i])\n- heapq.heappop(q)\n- sums[i+1]=sum(q)\n+ sums[i+1]=sums[i]+am[i]-heapq.heappop(q)\n+p=a[2*n:3*n]\n+p=list(map(lambda x: x*(-1),p))\n+sump=sum(p)\n+sums[n]+=sump\n+heapq.heapify(p)\n for i in range(n-1,-1,-1):\n heapq.heappush(p,(-1)*am[i])\n- heapq.heappop(p)\n- sums[i]+=sum(p)\n+ sump=sump-am[i]-heapq.heappop(p)\n+ sums[i]+=sump\n print(max(sums))\n", "FL_content": " import heapq\n n=int(input())\n a=list(map(int,input().split()))\n q=a[0:n]\n-heapq.heapify(q)\n-p=list(map(lambda x: x*(-1),a[2*n:3*n]))\n-heapq.heapify(p)\n sums=[0]*(n+1)\n sums[0]=sum(q)\n-sums[n]=sum(p)\n am=a[n:2*n]\n for i in range(0,n):\n heapq.heappush(q,am[i])\n- heapq.heappop(q)\n- sums[i+1]=sum(q)\n for i in range(n-1,-1,-1):\n heapq.heappush(p,(-1)*am[i])\n- heapq.heappop(p)\n- sums[i]+=sum(p)\n print(max(sums))\n", "added_lines": 9, "removed_lines": 8, "code1_lines": 20 }, { "user_id": "u850491413", "problem_id": "p03716", "submission1_id": "s232463726", "submission2_id": "s645558140", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nfrom collections import deque, defaultdict\nimport copy\nimport bisect\n\nimport math\nimport heapq\nfrom itertools import combinations, permutations\n\nimport sys\ndef input():\n\treturn sys.stdin.readline().strip()\n\nN = int(input())\na = list(map(int, input().split()))\n\na_max = a[:N]\na_min = a[2*N:]\n\na_max_sum = sum(a_max)\nscore = [a_max_sum]\nheapq.heapify(a_max)\nfor i in range(N):\n\theapq.heappush(a_max, a[N + i])\n\ta_max_sum += a[N + i]\n\ta_max_sum -= heapq.heappop(a_max)\n\tscore.append(a_max_sum)\nprint(score)\n\na_min_sum = sum(a_min)\nscore[N] -= a_min_sum\nfor i in range(len(a_min)):\n\ta_min[i] *= -1\nheapq.heapify(a_min)\nfor i in range(N):\n\theapq.heappush(a_min, -a[2*N - 1 - i])\n\ta_min_sum += a[2*N - 1 - i]\n\ta_min_sum += heapq.heappop(a_min)\n\tscore[N - i - 1] -=a_min_sum\nprint(score)\n\nprint(max(score))", "code2": "\nimport sys\nfrom collections import deque, defaultdict\nimport copy\nimport bisect\n\nimport math\nimport heapq\nfrom itertools import combinations, permutations\n\nimport sys\ndef input():\n\treturn sys.stdin.readline().strip()\n\nN = int(input())\na = list(map(int, input().split()))\n\na_max = a[:N]\na_min = a[2*N:]\n\na_max_sum = sum(a_max)\nscore = [a_max_sum]\nheapq.heapify(a_max)\nfor i in range(N):\n\theapq.heappush(a_max, a[N + i])\n\ta_max_sum += a[N + i]\n\ta_max_sum -= heapq.heappop(a_max)\n\tscore.append(a_max_sum)\n\na_min_sum = sum(a_min)\nscore[N] -= a_min_sum\nfor i in range(len(a_min)):\n\ta_min[i] *= -1\nheapq.heapify(a_min)\nfor i in range(N):\n\theapq.heappush(a_min, -a[2*N - 1 - i])\n\ta_min_sum += a[2*N - 1 - i]\n\ta_min_sum += heapq.heappop(a_min)\n\tscore[N - i - 1] -=a_min_sum\n\nprint(max(score))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1568174138", "date2": "1568174254", "bleu_score": "0.9661835701246749", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "[4, 7, 7]\n[-1, 1, -7]\n1\n", "expected_output": "1\n", "anno_code": ["\nimport sys\nfrom collections import deque, defaultdict\nimport copy\nimport bisect\n\nimport math\nimport heapq\nfrom itertools import combinations, permutations\n\nimport sys\ndef input(): # (0): input=\n\treturn sys.stdin.readline().strip()\n\nN = int(input()) # (1): N=2\na = list(map(int, input().split())) # (2): a=[3, 1, 4, 1, 5, 9]\n\na_max = a[:N] # (3): a_max=[3, 1]\na_min = a[2*N:] # (4): a_min=[5, 9]\n\na_max_sum = sum(a_max) # (5): a_max_sum=4\nscore = [a_max_sum] # (6): score=[4]\nheapq.heapify(a_max) # (7): a_max=[1, 3]\nfor i in range(N): # (8): i=0 (13): i=1 (18): NO CHANGE\n\theapq.heappush(a_max, a[N + i]) # (9): a_max=[1, 3, 4] (14): a_max=[1, 4, 3]\n\ta_max_sum += a[N + i] # (10): a_max_sum=8 (15): a_max_sum=8\n\ta_max_sum -= heapq.heappop(a_max) # (11): a_max=[3, 4], a_max_sum=7 (16): a_max=[3, 4], a_max_sum=7\n\tscore.append(a_max_sum) # (12): score=[4, 7] (17): score=[4, 7, 7]\nprint(score) # (19): NO CHANGE\n\na_min_sum = sum(a_min) # (20): a_min_sum=14\nscore[N] -= a_min_sum # (21): score=[4, 7, -7]\nfor i in range(len(a_min)): # (22): i=0 (24): i=1 (26): NO CHANGE\n\ta_min[i] *= -1 # (23): a_min=[-5, 9] (25): a_min=[-5, -9]\nheapq.heapify(a_min) # (27): a_min=[-9, -5]\nfor i in range(N): # (28): i=0 (33): i=1 (38): NO CHANGE\n\theapq.heappush(a_min, -a[2*N - 1 - i]) # (29): a_min=[-9, -5, -1] (34): a_min=[-5, -1, -4]\n\ta_min_sum += a[2*N - 1 - i] # (30): a_min_sum=15 (35): a_min_sum=10\n\ta_min_sum += heapq.heappop(a_min) # (31): a_min=[-5, -1], a_min_sum=6 (36): a_min=[-4, -1], a_min_sum=5\n\tscore[N - i - 1] -=a_min_sum # (32): score=[4, 1, -7] (37): score=[-1, 1, -7]\nprint(score) # (39): NO CHANGE\n\nprint(max(score))"], "anno_status": [true], "diff_content": " \n import sys\n from collections import deque, defaultdict\n import copy\n import bisect\n \n import math\n import heapq\n from itertools import combinations, permutations\n \n import sys\n def input():\n \treturn sys.stdin.readline().strip()\n \n N = int(input())\n a = list(map(int, input().split()))\n \n a_max = a[:N]\n a_min = a[2*N:]\n \n a_max_sum = sum(a_max)\n score = [a_max_sum]\n heapq.heapify(a_max)\n for i in range(N):\n \theapq.heappush(a_max, a[N + i])\n \ta_max_sum += a[N + i]\n \ta_max_sum -= heapq.heappop(a_max)\n \tscore.append(a_max_sum)\n-print(score)\n \n a_min_sum = sum(a_min)\n score[N] -= a_min_sum\n for i in range(len(a_min)):\n \ta_min[i] *= -1\n heapq.heapify(a_min)\n for i in range(N):\n \theapq.heappush(a_min, -a[2*N - 1 - i])\n \ta_min_sum += a[2*N - 1 - i]\n \ta_min_sum += heapq.heappop(a_min)\n \tscore[N - i - 1] -=a_min_sum\n-print(score)\n \n print(max(score))\n", "FL_content": " \n import sys\n from collections import deque, defaultdict\n import copy\n import bisect\n \n import math\n import heapq\n from itertools import combinations, permutations\n \n import sys\n def input():\n \treturn sys.stdin.readline().strip()\n \n N = int(input())\n a = list(map(int, input().split()))\n \n a_max = a[:N]\n a_min = a[2*N:]\n \n a_max_sum = sum(a_max)\n score = [a_max_sum]\n heapq.heapify(a_max)\n for i in range(N):\n \theapq.heappush(a_max, a[N + i])\n \ta_max_sum += a[N + i]\n \ta_max_sum -= heapq.heappop(a_max)\n \tscore.append(a_max_sum)\n-print(score)\n \n a_min_sum = sum(a_min)\n score[N] -= a_min_sum\n for i in range(len(a_min)):\n \ta_min[i] *= -1\n heapq.heapify(a_min)\n for i in range(N):\n \theapq.heappush(a_min, -a[2*N - 1 - i])\n \ta_min_sum += a[2*N - 1 - i]\n \ta_min_sum += heapq.heappop(a_min)\n \tscore[N - i - 1] -=a_min_sum\n-print(score)\n \n print(max(score))\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 43 }, { "user_id": "u147458211", "problem_id": "p03716", "submission1_id": "s506980286", "submission2_id": "s728501985", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nN = int(input())\na = list(map(int, input().split()))\n\nmax_result = -1000000\n\nfor k in range(N, 2*N+1):\n print(\"----------------\")\n big_a = a[:k]\n heapq.heapify(big_a)\n print(big_a)\n small_a =[(-x, x) for x in a[k:]]\n heapq.heapify(small_a)\n print(small_a)\n\n for i in range(len(big_a) - N):\n heapq.heappop(big_a)\n print(big_a)\n\n for i in range(len(small_a) - N):\n heapq.heappop(small_a)\n print(small_a)\n\n big_sum = sum(big_a)\n small_sum = 0\n for i in small_a:\n small_sum += i[1]\n\n if (big_sum - small_sum) > max_result:\n max_result = big_sum - small_sum\n\nprint(max_result)\n\n", "code2": "import heapq\nN = int(input())\na = list(map(int, input().split()))\n\nmax_result = -1000000\n\nbig_a = a[:N]\nbig_sum = [sum(big_a)]\nheapq.heapify(big_a)\nfor i in range(N):\n heapq.heappush(big_a, a[N+i])\n p = heapq.heappop(big_a)\n big_sum.append(big_sum[-1] + a[N+i] - p)\n\nsmall_a = [-i for i in a[-N:]]\nsmall_sum = [sum(small_a)]\nheapq.heapify(small_a)\nfor i in range(N):\n heapq.heappush(small_a, -a[-N-i-1])\n p = heapq.heappop(small_a)\n small_sum.append(small_sum[-1] - a[-N-i-1] - p)\n\nmax_result = -float('inf')\n\nfor m,s in zip(big_sum, small_sum[::-1]):\n max_result = max(m + s, max_result)\n\nprint(max_result)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1526189791", "date2": "1526240714", "bleu_score": "0.6890869789035831", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "----------------\n[1, 3]\n[(-9, 9), (-4, 4), (-5, 5), (-1, 1)]\n[1, 3]\n[(-4, 4), (-1, 1)]\n----------------\n[1, 3, 4]\n[(-9, 9), (-5, 5), (-1, 1)]\n[3, 4]\n[(-5, 5), (-1, 1)]\n----------------\n[1, 1, 4, 3]\n[(-9, 9), (-5, 5)]\n[3, 4]\n[(-9, 9), (-5, 5)]\n1\n", "expected_output": "1\n", "anno_code": ["import heapq\nN = int(input()) # (0): N=2\na = list(map(int, input().split())) # (1): a=[3, 1, 4, 1, 5, 9]\n\nmax_result = -1000000 # (2): max_result=-1000000\n\nfor k in range(N, 2*N+1): # (3): k=2 (28): k=3 ... (77): NO CHANGE\n print(\"----------------\") # (4): NO CHANGE (29): NO CHANGE (54): NO CHANGE\n big_a = a[:k] # (5): big_a=[3, 1] (30): big_a=[3, 1, 4] (55): big_a=[3, 1, 4, 1]\n heapq.heapify(big_a) # (6): big_a=[1, 3] (31): big_a=[1, 3, 4] (56): big_a=[1, 1, 4, 3]\n print(big_a) # (7): NO CHANGE (32): NO CHANGE (57): NO CHANGE\n small_a =[(-x, x) for x in a[k:]] # (8): small_a=[(-4, 4), (-1, 1), (-5, 5), (-9, 9)] (33): small_a=[(-1, 1), (-5, 5), (-9, 9)] (58): small_a=[(-5, 5), (-9, 9)]\n heapq.heapify(small_a) # (9): small_a=[(-9, 9), (-4, 4), (-5, 5), (-1, 1)] (34): small_a=[(-9, 9), (-5, 5), (-1, 1)] (59): small_a=[(-9, 9), (-5, 5)]\n print(small_a) # (10): NO CHANGE (35): NO CHANGE (60): NO CHANGE\n\n for i in range(len(big_a) - N): # (11): NO CHANGE (36): i=0 ... (65): NO CHANGE\n heapq.heappop(big_a) # (37): big_a=[3, 4] (62): big_a=[1, 3, 4] (64): big_a=[3, 4]\n print(big_a) # (12): NO CHANGE (39): NO CHANGE (66): NO CHANGE\n\n for i in range(len(small_a) - N): # (13): i=0 (15): i=1 ... (67): NO CHANGE\n heapq.heappop(small_a) # (14): small_a=[(-5, 5), (-4, 4), (-1, 1)] (16): small_a=[(-4, 4), (-1, 1)] (41): small_a=[(-5, 5), (-1, 1)]\n print(small_a) # (18): NO CHANGE (43): NO CHANGE (68): NO CHANGE\n\n big_sum = sum(big_a) # (19): big_sum=4 (44): big_sum=7 (69): NO CHANGE\n small_sum = 0 # (20): small_sum=0 (45): small_sum=0 (70): small_sum=0\n for i in small_a: # (21): i=(-4, 4) (23): i=(-1, 1) ... (75): NO CHANGE\n small_sum += i[1] # (22): small_sum=4 (24): small_sum=5 ... (74): small_sum=14\n\n if (big_sum - small_sum) > max_result: # (26): NO CHANGE (51): NO CHANGE (76): NO CHANGE\n max_result = big_sum - small_sum # (27): max_result=-1 (52): max_result=1\n\nprint(max_result)\n\n"], "anno_status": [true], "diff_content": " import heapq\n N = int(input())\n a = list(map(int, input().split()))\n \n max_result = -1000000\n \n-for k in range(N, 2*N+1):\n- print(\"----------------\")\n- big_a = a[:k]\n- heapq.heapify(big_a)\n- print(big_a)\n- small_a =[(-x, x) for x in a[k:]]\n- heapq.heapify(small_a)\n- print(small_a)\n-\n- for i in range(len(big_a) - N):\n- heapq.heappop(big_a)\n- print(big_a)\n-\n- for i in range(len(small_a) - N):\n- heapq.heappop(small_a)\n- print(small_a)\n-\n- big_sum = sum(big_a)\n- small_sum = 0\n- for i in small_a:\n- small_sum += i[1]\n-\n- if (big_sum - small_sum) > max_result:\n- max_result = big_sum - small_sum\n+big_a = a[:N]\n+big_sum = [sum(big_a)]\n+heapq.heapify(big_a)\n+for i in range(N):\n+ heapq.heappush(big_a, a[N+i])\n+ p = heapq.heappop(big_a)\n+ big_sum.append(big_sum[-1] + a[N+i] - p)\n+\n+small_a = [-i for i in a[-N:]]\n+small_sum = [sum(small_a)]\n+heapq.heapify(small_a)\n+for i in range(N):\n+ heapq.heappush(small_a, -a[-N-i-1])\n+ p = heapq.heappop(small_a)\n+ small_sum.append(small_sum[-1] - a[-N-i-1] - p)\n+\n+max_result = -float('inf')\n+\n+for m,s in zip(big_sum, small_sum[::-1]):\n+ max_result = max(m + s, max_result)\n \n print(max_result)\n \n \n", "FL_content": " import heapq\n N = int(input())\n a = list(map(int, input().split()))\n \n max_result = -1000000\n \n-for k in range(N, 2*N+1):\n- print(\"----------------\")\n- big_a = a[:k]\n- heapq.heapify(big_a)\n- print(big_a)\n- small_a =[(-x, x) for x in a[k:]]\n- heapq.heapify(small_a)\n- print(small_a)\n-\n- for i in range(len(big_a) - N):\n- heapq.heappop(big_a)\n- print(big_a)\n-\n- for i in range(len(small_a) - N):\n- heapq.heappop(small_a)\n- print(small_a)\n-\n- big_sum = sum(big_a)\n- small_sum = 0\n- for i in small_a:\n- small_sum += i[1]\n-\n- if (big_sum - small_sum) > max_result:\n- max_result = big_sum - small_sum\n \n print(max_result)\n \n \n", "added_lines": 20, "removed_lines": 24, "code1_lines": 34 }, { "user_id": "u038408819", "problem_id": "p03716", "submission1_id": "s458349180", "submission2_id": "s375090405", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = list(map(int, input().split()))\n\nimport heapq\nque1 = []\nheapq.heapify(que1)\nS = [0] * (2*N + 1)\nfor i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\nque2 = []\nheapq.heapify(que2)\nT = [0] * (2*N + 1)\nfor i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n\nfor i in range(N, 2*N):\n mi = heapq.heappop(que1)\n print(mi)\n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\nfor i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n print(ma)\n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n\nres = -float('Inf')\nfor i in range(N, 2*N):\n res = max(res, S[i] - T[3*N - i])\nprint(res)", "code2": "N = int(input())\na = list(map(int, input().split()))\n\nimport heapq\nque1 = []\nheapq.heapify(que1)\nS = [0] * (2*N + 1)\nfor i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\nque2 = []\nheapq.heapify(que2)\nT = [0] * (2*N + 1)\nfor i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n\nfor i in range(N, 2*N):\n mi = heapq.heappop(que1)\n \n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\nfor i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n \n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n\nres = -float('Inf')\nfor i in range(N, 2*N + 1):\n res = max(res, S[i] - T[3*N - i])\nprint(res)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584209294", "date2": "1584209569", "bleu_score": "0.9766073431611834", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "1\n3\n9\n5\n1\n", "expected_output": "1\n", "anno_code": ["N = int(input()) # (0): N=2\na = list(map(int, input().split())) # (1): a=[3, 1, 4, 1, 5, 9], heapq=\n\nimport heapq\nque1 = [] # (2): que1=[]\nheapq.heapify(que1) # (3): NO CHANGE\nS = [0] * (2*N + 1) # (4): S=[0, 0, 0, 0, 0]\nfor i in range(N): # (5): i=0 (8): i=1 (11): NO CHANGE\n S[i + 1] = S[i] + a[i] # (6): S=[0, 3, 0, 0, 0] (9): S=[0, 3, 4, 0, 0]\n \n heapq.heappush(que1, a[i]) # (7): que1=[3] (10): que1=[1, 3]\nque2 = [] # (12): que2=[]\nheapq.heapify(que2) # (13): NO CHANGE\nT = [0] * (2*N + 1) # (14): T=[0, 0, 0, 0, 0]\nfor i in range(N): # (15): i=0 (18): i=1 (21): NO CHANGE\n T[i + 1] = T[i] + a[3*N - i - 1] # (16): T=[0, 9, 0, 0, 0] (19): T=[0, 9, 14, 0, 0]\n \n heapq.heappush(que2, -a[3*N - i - 1]) # (17): que2=[-9] (20): que2=[-9, -5]\n\nfor i in range(N, 2*N): # (22): i=2 (28): i=3 (34): NO CHANGE\n mi = heapq.heappop(que1) # (23): que1=[3], mi=1 (29): que1=[4], mi=3\n print(mi) # (24): NO CHANGE (30): NO CHANGE\n if a[i] > mi: # (25): NO CHANGE (31): NO CHANGE\n S[i + 1] = S[i] - mi + a[i] # (26): S=[0, 3, 4, 7, 0]\n \n heapq.heappush(que1, a[i]) # (27): que1=[3, 4]\n else:\n S[i + 1] = S[i] # (32): S=[0, 3, 4, 7, 7]\n heapq.heappush(que1, mi) # (33): que1=[3, 4]\nfor i in range(N, 2*N): # (35): i=2 (41): i=3 (47): NO CHANGE\n ma = heapq.heappop(que2) * -1 # (36): que2=[-5], ma=9 (42): que2=[-1], ma=5\n print(ma) # (37): NO CHANGE (43): NO CHANGE\n if a[3*N - i - 1] < ma: # (38): NO CHANGE (44): NO CHANGE\n T[i + 1] = T[i] - ma + a[3*N - i - 1] # (39): T=[0, 9, 14, 6, 0] (45): T=[0, 9, 14, 6, 5]\n \n \n heapq.heappush(que2, -a[3*N - i - 1]) # (40): que2=[-5, -1] (46): que2=[-4, -1]\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n\nres = -float('Inf') # (48): res=-inf\nfor i in range(N, 2*N): # (49): i=2 (51): i=3 (53): NO CHANGE\n res = max(res, S[i] - T[3*N - i]) # (50): res=-1 (52): res=1\nprint(res)"], "anno_status": [false], "diff_content": " N = int(input())\n a = list(map(int, input().split()))\n \n import heapq\n que1 = []\n heapq.heapify(que1)\n S = [0] * (2*N + 1)\n for i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\n que2 = []\n heapq.heapify(que2)\n T = [0] * (2*N + 1)\n for i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n \n for i in range(N, 2*N):\n mi = heapq.heappop(que1)\n- print(mi)\n+ \n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\n for i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n- print(ma)\n+ \n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n \n res = -float('Inf')\n-for i in range(N, 2*N):\n+for i in range(N, 2*N + 1):\n res = max(res, S[i] - T[3*N - i])\n print(res)\n+\n", "FL_content": " N = int(input())\n a = list(map(int, input().split()))\n \n import heapq\n que1 = []\n heapq.heapify(que1)\n S = [0] * (2*N + 1)\n for i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\n que2 = []\n heapq.heapify(que2)\n T = [0] * (2*N + 1)\n for i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n \n for i in range(N, 2*N):\n mi = heapq.heappop(que1)\n- print(mi)\n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\n for i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n- print(ma)\n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n \n res = -float('Inf')\n-for i in range(N, 2*N):\n res = max(res, S[i] - T[3*N - i])\n print(res)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 45 }, { "user_id": "u497596438", "problem_id": "p03716", "submission1_id": "s974013935", "submission2_id": "s910404361", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import *\n\nN=int(input())\nA=list(map(int,input().split()))\nB=[]\nfor i in range(N):\n heappush(B,A[i])\nsumB=[sum(B)]\nfor i in range(N,2*N):\n heappush(B,A[i])\n poped=heappop(B)\n sumB.append(sumB[-1]-poped+A[i])\n\nA.reverse()\nC=[]\nfor i in range(N):\n heappush(C,A[i]*(-1))\nsumC=[(-1)*sum(C)]\nfor i in range(N,2*N):\n heappush(C,A[i]*(-1))\n poped=heappop(C)*(-1)\n sumC.append(sumC[-1]-poped+A[i])\nsumC.reverse()\nans=-10**19\nfor i,j in zip(sumB,sumC):\n ans=max(ans,i-j)\n", "code2": "from heapq import *\n\nN=int(input())\nA=list(map(int,input().split()))\nB=[]\nfor i in range(N):\n heappush(B,A[i])\nsumB=[sum(B)]\nfor i in range(N,2*N):\n heappush(B,A[i])\n poped=heappop(B)\n sumB.append(sumB[-1]-poped+A[i])\n\nA.reverse()\nC=[]\nfor i in range(N):\n heappush(C,A[i]*(-1))\nsumC=[(-1)*sum(C)]\nfor i in range(N,2*N):\n heappush(C,A[i]*(-1))\n poped=heappop(C)*(-1)\n sumC.append(sumC[-1]-poped+A[i])\nsumC.reverse()\nans=-10**19\nfor i,j in zip(sumB,sumC):\n ans=max(ans,i-j)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1555176451", "date2": "1555176498", "bleu_score": "0.9783676425468204", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "", "expected_output": "1\n", "anno_code": ["from heapq import *\n\nN=int(input()) # (0): N=2\nA=list(map(int,input().split())) # (1): A=[3, 1, 4, 1, 5, 9]\nB=[] # (2): B=[]\nfor i in range(N): # (3): i=0 (5): i=1 (7): NO CHANGE\n heappush(B,A[i]) # (4): B=[3] (6): B=[1, 3]\nsumB=[sum(B)] # (8): sumB=[4]\nfor i in range(N,2*N): # (9): i=2 (13): i=3 (17): NO CHANGE\n heappush(B,A[i]) # (10): B=[1, 3, 4] (14): B=[1, 4, 3]\n poped=heappop(B) # (11): B=[3, 4], poped=1 (15): B=[3, 4]\n sumB.append(sumB[-1]-poped+A[i]) # (12): sumB=[4, 7] (16): sumB=[4, 7, 7]\n\nA.reverse() # (18): A=[9, 5, 1, 4, 1, 3]\nC=[] # (19): C=[]\nfor i in range(N): # (20): i=0 (22): i=1 (24): NO CHANGE\n heappush(C,A[i]*(-1)) # (21): C=[-9] (23): C=[-9, -5]\nsumC=[(-1)*sum(C)] # (25): sumC=[14]\nfor i in range(N,2*N): # (26): i=2 (30): i=3 (34): NO CHANGE\n heappush(C,A[i]*(-1)) # (27): C=[-9, -5, -1] (31): C=[-5, -1, -4]\n poped=heappop(C)*(-1) # (28): poped=9, C=[-5, -1] (32): poped=5, C=[-4, -1]\n sumC.append(sumC[-1]-poped+A[i]) # (29): sumC=[14, 6] (33): sumC=[14, 6, 5]\nsumC.reverse() # (35): sumC=[5, 6, 14]\nans=-10**19 # (36): ans=-10000000000000000000\nfor i,j in zip(sumB,sumC): # (37): i=4, j=5 (39): i=7, j=6 (41): j=14\n ans=max(ans,i-j) # (38): ans=-1 (40): ans=1 (42): NO CHANGE\n"], "anno_status": [true], "diff_content": " from heapq import *\n \n N=int(input())\n A=list(map(int,input().split()))\n B=[]\n for i in range(N):\n heappush(B,A[i])\n sumB=[sum(B)]\n for i in range(N,2*N):\n heappush(B,A[i])\n poped=heappop(B)\n sumB.append(sumB[-1]-poped+A[i])\n \n A.reverse()\n C=[]\n for i in range(N):\n heappush(C,A[i]*(-1))\n sumC=[(-1)*sum(C)]\n for i in range(N,2*N):\n heappush(C,A[i]*(-1))\n poped=heappop(C)*(-1)\n sumC.append(sumC[-1]-poped+A[i])\n sumC.reverse()\n ans=-10**19\n for i,j in zip(sumB,sumC):\n ans=max(ans,i-j)\n+print(ans)\n \n", "FL_content": " from heapq import *\n \n N=int(input())\n A=list(map(int,input().split()))\n B=[]\n for i in range(N):\n heappush(B,A[i])\n sumB=[sum(B)]\n for i in range(N,2*N):\n heappush(B,A[i])\n poped=heappop(B)\n sumB.append(sumB[-1]-poped+A[i])\n \n A.reverse()\n C=[]\n for i in range(N):\n heappush(C,A[i]*(-1))\n sumC=[(-1)*sum(C)]\n for i in range(N,2*N):\n heappush(C,A[i]*(-1))\n poped=heappop(C)*(-1)\n sumC.append(sumC[-1]-poped+A[i])\n sumC.reverse()\n ans=-10**19\n for i,j in zip(sumB,sumC):\n ans=max(ans,i-j)\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u875291233", "problem_id": "p03716", "submission1_id": "s034415946", "submission2_id": "s294381717", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn = int(input())\na = [int(i) for i in input().split()]\n\nfrom heapq import *\n\npq1 = a[:n]\nheapify(pq1)\ns = sum(pq1)\nscore1 = [s]\nfor i in range(n):\n c=heappushpop(pq1, a[n+i])\n s += a[n+i] - c\n score1.append(s)\n\npq2 = [-i for i in a[2*n:]]\nheapify(pq2)\ns = sum(pq2)\nscore2 = [s]\nfor i in range(1,n+1):\n c=heappushpop(pq2, -a[2*n-i])\n s += -a[2*n-i] - c\n score2.append(s)\n\nprint(score1)\nprint(score2)\nans = -10**17\nfor i,j in zip(score1,reversed(score2)):\n ans = max(ans, i+j)\n\nprint(ans)\n \n", "code2": "\n\nn = int(input())\na = [int(i) for i in input().split()]\n\nfrom heapq import *\n\npq1 = a[:n]\nheapify(pq1)\ns = sum(pq1)\nscore1 = [s]\nfor i in range(n):\n c=heappushpop(pq1, a[n+i])\n s += a[n+i] - c\n score1.append(s)\n\npq2 = [-i for i in a[2*n:]]\nheapify(pq2)\ns = sum(pq2)\nscore2 = [s]\nfor i in range(1,n+1):\n c=heappushpop(pq2, -a[2*n-i])\n s += -a[2*n-i] - c\n score2.append(s)\n\n\n\nans = -10**17\nfor i,j in zip(score1,reversed(score2)):\n ans = max(ans, i+j)\n\nprint(ans)\n \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562160780", "date2": "1562160798", "bleu_score": "0.9438317485468809", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "[4, 7, 7]\n[-14, -6, -5]\n1\n", "expected_output": "1\n", "anno_code": ["\n\nn = int(input()) # (0): n=2\na = [int(i) for i in input().split()] # (1): a=[3, 1, 4, 1, 5, 9], heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=\n\nfrom heapq import *\n\npq1 = a[:n] # (2): pq1=[3, 1]\nheapify(pq1) # (3): pq1=[1, 3]\ns = sum(pq1) # (4): s=4\nscore1 = [s] # (5): score1=[4]\nfor i in range(n): # (6): i=0 (10): i=1 (14): NO CHANGE\n c=heappushpop(pq1, a[n+i]) # (7): pq1=[3, 4], c=1 (11): NO CHANGE\n s += a[n+i] - c # (8): s=7 (12): NO CHANGE\n score1.append(s) # (9): score1=[4, 7] (13): score1=[4, 7, 7]\n\npq2 = [-i for i in a[2*n:]] # (15): pq2=[-5, -9]\nheapify(pq2) # (16): pq2=[-9, -5]\ns = sum(pq2) # (17): s=-14\nscore2 = [s] # (18): score2=[-14]\nfor i in range(1,n+1): # (19): NO CHANGE (23): i=2 (27): NO CHANGE\n c=heappushpop(pq2, -a[2*n-i]) # (20): c=-9, pq2=[-5, -1] (24): c=-5, pq2=[-4, -1]\n s += -a[2*n-i] - c # (21): s=-6 (25): s=-5\n score2.append(s) # (22): score2=[-14, -6] (26): score2=[-14, -6, -5]\n\nprint(score1) # (28): NO CHANGE\nprint(score2) # (29): NO CHANGE\nans = -10**17 # (30): ans=-100000000000000000\nfor i,j in zip(score1,reversed(score2)): # (31): i=4, j=-5 (33): i=7, j=-6 ... (37): NO CHANGE\n ans = max(ans, i+j) # (32): ans=-1 (34): ans=1 (36): NO CHANGE\n\nprint(ans)\n \n"], "anno_status": [true], "diff_content": " \n \n n = int(input())\n a = [int(i) for i in input().split()]\n \n from heapq import *\n \n pq1 = a[:n]\n heapify(pq1)\n s = sum(pq1)\n score1 = [s]\n for i in range(n):\n c=heappushpop(pq1, a[n+i])\n s += a[n+i] - c\n score1.append(s)\n \n pq2 = [-i for i in a[2*n:]]\n heapify(pq2)\n s = sum(pq2)\n score2 = [s]\n for i in range(1,n+1):\n c=heappushpop(pq2, -a[2*n-i])\n s += -a[2*n-i] - c\n score2.append(s)\n \n-print(score1)\n-print(score2)\n+\n+\n ans = -10**17\n for i,j in zip(score1,reversed(score2)):\n ans = max(ans, i+j)\n \n print(ans)\n \n \n", "FL_content": " \n \n n = int(input())\n a = [int(i) for i in input().split()]\n \n from heapq import *\n \n pq1 = a[:n]\n heapify(pq1)\n s = sum(pq1)\n score1 = [s]\n for i in range(n):\n c=heappushpop(pq1, a[n+i])\n s += a[n+i] - c\n score1.append(s)\n \n pq2 = [-i for i in a[2*n:]]\n heapify(pq2)\n s = sum(pq2)\n score2 = [s]\n for i in range(1,n+1):\n c=heappushpop(pq2, -a[2*n-i])\n s += -a[2*n-i] - c\n score2.append(s)\n \n-print(score1)\n-print(score2)\n ans = -10**17\n for i,j in zip(score1,reversed(score2)):\n ans = max(ans, i+j)\n \n print(ans)\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 34 }, { "user_id": "u930705402", "problem_id": "p03716", "submission1_id": "s104168854", "submission2_id": "s107009798", "status1": "Wrong Answer", "status2": "Accepted", "code1": "INF=10**30\nfrom heapq import heapify,heappop,heappush\nN=int(input())\na=list(map(int,input().split()))\n\nright=list(map(lambda x:-x,a[2*N:]));heapify(right)\nrmin=[INF]*(3*N);rmin[2*N]=sum(right)*-1\n\nfor i in reversed(range(N,2*N)):\n p=heappop(right)*-1\n b=min(p,a[i])\n d=0 if b==p else b-p\n heappush(right,b*-1)\n rmin[i]=rmin[i+1]-d\n\nleft=a[:N];heapify(left)\nlmax=[-INF]*(3*N);lmax[N-1]=sum(left)\nfor i in range(N,2*N):\n p=heappop(left)\n b=max(p,a[i])\n d=0 if b==p else b-p\n heappush(left,b)\n lmax[i]=lmax[i-1]+d\nres=-INF\nfor i in range(N,2*N+1):\n res=max(res,lmax[i-1]-rmin[i])\nprint(res)", "code2": "INF=10**30\nfrom heapq import heapify,heappop,heappush\nN=int(input())\na=list(map(int,input().split()))\n\nright=list(map(lambda x:-x,a[2*N:]));heapify(right)\nrmin=[INF]*(3*N);rmin[2*N]=sum(right)*-1\n\nfor i in reversed(range(N,2*N)):\n p=heappop(right)*-1\n b=min(p,a[i])\n d=0 if b==p else b-p\n heappush(right,b*-1)\n rmin[i]=rmin[i+1]+d\n\nleft=a[:N];heapify(left)\nlmax=[-INF]*(3*N);lmax[N-1]=sum(left)\nfor i in range(N,2*N):\n p=heappop(left)\n b=max(p,a[i])\n d=0 if b==p else b-p\n heappush(left,b)\n lmax[i]=lmax[i-1]+d\nres=-INF\nfor i in range(N,2*N+1):\n res=max(res,lmax[i-1]-rmin[i])\nprint(res)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587503944", "date2": "1587504171", "bleu_score": "0.9959530282128177", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "-7\n", "expected_output": "1\n", "anno_code": ["INF=10**30 # (0): INF=1000000000000000000000000000000, heapify=, heappop=, heappush=\nfrom heapq import heapify,heappop,heappush\nN=int(input()) # (1): N=2\na=list(map(int,input().split())) # (2): a=[3, 1, 4, 1, 5, 9]\n\nright=list(map(lambda x:-x,a[2*N:]));heapify(right) # (3): right=[-9, -5]\nrmin=[INF]*(3*N);rmin[2*N]=sum(right)*-1 # (4): rmin=[1000000000000000000000000000000, 1000000000000000000000000000000, 1000000000000000000000000000000, 1000000000000000000000000000000, 14, 1000000000000000000000000000000]\n\nfor i in reversed(range(N,2*N)): # (5): i=3 (11): i=2 (17): NO CHANGE\n p=heappop(right)*-1 # (6): right=[-5], p=9 (12): right=[-1], p=5\n b=min(p,a[i]) # (7): b=1 (13): b=4\n d=0 if b==p else b-p # (8): d=-8 (14): d=-1\n heappush(right,b*-1) # (9): right=[-5, -1] (15): right=[-4, -1]\n rmin[i]=rmin[i+1]-d # (10): rmin=[1000000000000000000000000000000, 1000000000000000000000000000000, 1000000000000000000000000000000, 22, 14, 1000000000000000000000000000000] (16): rmin=[1000000000000000000000000000000, 1000000000000000000000000000000, 23, 22, 14, 1000000000000000000000000000000]\n\nleft=a[:N];heapify(left) # (18): left=[1, 3]\nlmax=[-INF]*(3*N);lmax[N-1]=sum(left) # (19): lmax=[-1000000000000000000000000000000, 4, -1000000000000000000000000000000, -1000000000000000000000000000000, -1000000000000000000000000000000, -1000000000000000000000000000000]\nfor i in range(N,2*N): # (20): NO CHANGE (26): i=3 (32): NO CHANGE\n p=heappop(left) # (21): p=1, left=[3] (27): p=3, left=[4]\n b=max(p,a[i]) # (22): NO CHANGE (28): b=3\n d=0 if b==p else b-p # (23): d=3 (29): d=0\n heappush(left,b) # (24): left=[3, 4] (30): left=[3, 4]\n lmax[i]=lmax[i-1]+d # (25): lmax=[-1000000000000000000000000000000, 4, 7, -1000000000000000000000000000000, -1000000000000000000000000000000, -1000000000000000000000000000000] (31): lmax=[-1000000000000000000000000000000, 4, 7, 7, -1000000000000000000000000000000, -1000000000000000000000000000000]\nres=-INF # (33): res=-1000000000000000000000000000000\nfor i in range(N,2*N+1): # (34): i=2 (36): i=3 ... (40): NO CHANGE\n res=max(res,lmax[i-1]-rmin[i]) # (35): res=-19 (37): res=-15 (39): res=-7\nprint(res)"], "anno_status": [false], "diff_content": " INF=10**30\n from heapq import heapify,heappop,heappush\n N=int(input())\n a=list(map(int,input().split()))\n \n right=list(map(lambda x:-x,a[2*N:]));heapify(right)\n rmin=[INF]*(3*N);rmin[2*N]=sum(right)*-1\n \n for i in reversed(range(N,2*N)):\n p=heappop(right)*-1\n b=min(p,a[i])\n d=0 if b==p else b-p\n heappush(right,b*-1)\n- rmin[i]=rmin[i+1]-d\n+ rmin[i]=rmin[i+1]+d\n \n left=a[:N];heapify(left)\n lmax=[-INF]*(3*N);lmax[N-1]=sum(left)\n for i in range(N,2*N):\n p=heappop(left)\n b=max(p,a[i])\n d=0 if b==p else b-p\n heappush(left,b)\n lmax[i]=lmax[i-1]+d\n res=-INF\n for i in range(N,2*N+1):\n res=max(res,lmax[i-1]-rmin[i])\n print(res)\n", "FL_content": " INF=10**30\n from heapq import heapify,heappop,heappush\n N=int(input())\n a=list(map(int,input().split()))\n \n right=list(map(lambda x:-x,a[2*N:]));heapify(right)\n rmin=[INF]*(3*N);rmin[2*N]=sum(right)*-1\n \n for i in reversed(range(N,2*N)):\n p=heappop(right)*-1\n b=min(p,a[i])\n d=0 if b==p else b-p\n heappush(right,b*-1)\n- rmin[i]=rmin[i+1]-d\n \n left=a[:N];heapify(left)\n lmax=[-INF]*(3*N);lmax[N-1]=sum(left)\n for i in range(N,2*N):\n p=heappop(left)\n b=max(p,a[i])\n d=0 if b==p else b-p\n heappush(left,b)\n lmax[i]=lmax[i-1]+d\n res=-INF\n for i in range(N,2*N+1):\n res=max(res,lmax[i-1]-rmin[i])\n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u163703551", "problem_id": "p03716", "submission1_id": "s419310295", "submission2_id": "s232415184", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport heapq\n\n\ndef solve(n, a):\n res = -10 ** 20\n for i in range(n, 2 * n + 1):\n l = a[0:i]\n r = a[i:3 * n]\n l.sort(reverse=True)\n r.sort()\n res0 = sum(l[0:n]) - sum(r[0:n])\n if res0 > res:\n res = res0\n return res\n\n\ndef find_best(n, a):\n h = list()\n s = 0\n best_s = 0\n res = list()\n for i in range(0, 2 * n):\n heapq.heappush(h, a[i])\n s += a[i]\n if len(h) > n:\n m = heapq.heappop(h)\n s -= m\n if len(h) == n:\n if best_s < s:\n best_s = s\n res.append(best_s)\n return res\n\n\ndef solve_large(n, a):\n res = -10 ** 20\n max_l = find_best(n, a)\n b = [-x for x in reversed(a)]\n max_r = find_best(n, b)\n max_r.reverse()\n for l, r in zip(max_l, max_r):\n res0 = l + r\n if res < res0:\n res = res0\n return res\n\n\n\nn = int(input())\na = list(map(int, input().split()))\nprint(solve_large(n, a))\n", "code2": "import os\nimport sys\nimport heapq\n\n\ndef solve(n, a):\n res = -10 ** 20\n for i in range(n, 2 * n + 1):\n l = a[0:i]\n r = a[i:3 * n]\n l.sort(reverse=True)\n r.sort()\n res0 = sum(l[0:n]) - sum(r[0:n])\n if res0 > res:\n res = res0\n return res\n\n\ndef find_best(n, a):\n h = list()\n s = 0\n best_s = -10**20\n res = list()\n for i in range(0, 2 * n):\n heapq.heappush(h, a[i])\n s += a[i]\n if len(h) > n:\n m = heapq.heappop(h)\n s -= m\n if len(h) == n:\n if best_s < s:\n best_s = s\n res.append(best_s)\n return res\n\n\ndef solve_large(n, a):\n res = -10 ** 20\n max_l = find_best(n, a)\n b = [-x for x in reversed(a)]\n max_r = find_best(n, b)\n max_r.reverse()\n for l, r in zip(max_l, max_r):\n res0 = l + r\n if res < res0:\n res = res0\n return res\n\n\ninput_file = 'd1.in'\nif os.path.exists(input_file):\n sys.stdin = open(input_file)\nn = int(input())\na = list(map(int, input().split()))\nprint(solve_large(n, a))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1495337474", "date2": "1495337849", "bleu_score": "0.9061456582080315", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "7\n", "expected_output": "1\n", "anno_code": ["import sys\nimport heapq\n\n\ndef solve(n, a): # (0): solve=\n res = -10 ** 20\n for i in range(n, 2 * n + 1):\n l = a[0:i]\n r = a[i:3 * n]\n l.sort(reverse=True)\n r.sort()\n res0 = sum(l[0:n]) - sum(r[0:n])\n if res0 > res:\n res = res0\n return res\n\n\ndef find_best(n, a): # (1): find_best=\n h = list() # (8): h=[] (47): h=[]\n s = 0 # (9): s=0 (48): s=0\n best_s = 0 # (10): best_s=0 (49): best_s=0\n res = list() # (11): res=[] (50): res=[]\n for i in range(0, 2 * n): # (12): i=0 (17): i=1 ... (81): a=[3, 1, 4, 1, 5, 9], res=-100000000000000000000, max_l=[4, 7, 7], b=[-9, -5, -1, -4, -1, -3], max_r=[0, 0, 0]\n heapq.heappush(h, a[i]) # (13): h=[3] (18): h=[1, 3] ... (73): h=[-5, -1, -4]\n s += a[i] # (14): s=3 (19): s=4 ... (74): s=-10\n if len(h) > n: # (15): NO CHANGE (20): NO CHANGE ... (75): NO CHANGE\n m = heapq.heappop(h) # (29): h=[3, 4], m=1 (39): h=[3, 4] ... (76): h=[-4, -1], m=-5\n s -= m # (30): s=7 (40): s=7 ... (77): s=-5\n if len(h) == n: # (16): NO CHANGE (21): NO CHANGE ... (78): NO CHANGE\n if best_s < s: # (22): NO CHANGE (32): NO CHANGE ... (79): NO CHANGE\n best_s = s # (23): best_s=4 (33): best_s=7\n res.append(best_s) # (24): res=[4] (34): res=[4, 7] ... (80): res=[0, 0, 0]\n return res\n\n\ndef solve_large(n, a): # (2): solve_large=\n res = -10 ** 20 # (6): res=-100000000000000000000\n max_l = find_best(n, a) # (7): NO CHANGE\n b = [-x for x in reversed(a)] # (45): b=[-9, -5, -1, -4, -1, -3]\n max_r = find_best(n, b) # (46): a=[-9, -5, -1, -4, -1, -3]\n max_r.reverse() # (82): NO CHANGE\n for l, r in zip(max_l, max_r): # (83): l=4, r=0 (87): l=7 (91): NO CHANGE\n res0 = l + r # (84): res0=4 (88): res0=7 (92): NO CHANGE\n if res < res0: # (85): NO CHANGE (89): NO CHANGE (93): NO CHANGE\n res = res0 # (86): res=4 (90): res=7\n return res\n\n\n\nn = int(input()) # (3): n=2\na = list(map(int, input().split())) # (4): a=[3, 1, 4, 1, 5, 9]\nprint(solve_large(n, a)) # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": "+import os\n import sys\n import heapq\n \n \n def solve(n, a):\n res = -10 ** 20\n for i in range(n, 2 * n + 1):\n l = a[0:i]\n r = a[i:3 * n]\n l.sort(reverse=True)\n r.sort()\n res0 = sum(l[0:n]) - sum(r[0:n])\n if res0 > res:\n res = res0\n return res\n \n \n def find_best(n, a):\n h = list()\n s = 0\n- best_s = 0\n+ best_s = -10**20\n res = list()\n for i in range(0, 2 * n):\n heapq.heappush(h, a[i])\n s += a[i]\n if len(h) > n:\n m = heapq.heappop(h)\n s -= m\n if len(h) == n:\n if best_s < s:\n best_s = s\n res.append(best_s)\n return res\n \n \n def solve_large(n, a):\n res = -10 ** 20\n max_l = find_best(n, a)\n b = [-x for x in reversed(a)]\n max_r = find_best(n, b)\n max_r.reverse()\n for l, r in zip(max_l, max_r):\n res0 = l + r\n if res < res0:\n res = res0\n return res\n \n \n-\n+input_file = 'd1.in'\n+if os.path.exists(input_file):\n+ sys.stdin = open(input_file)\n n = int(input())\n a = list(map(int, input().split()))\n print(solve_large(n, a))\n \n", "FL_content": " import sys\n import heapq\n \n \n def solve(n, a):\n res = -10 ** 20\n for i in range(n, 2 * n + 1):\n l = a[0:i]\n r = a[i:3 * n]\n l.sort(reverse=True)\n r.sort()\n res0 = sum(l[0:n]) - sum(r[0:n])\n if res0 > res:\n res = res0\n return res\n \n \n def find_best(n, a):\n h = list()\n s = 0\n- best_s = 0\n res = list()\n for i in range(0, 2 * n):\n heapq.heappush(h, a[i])\n s += a[i]\n if len(h) > n:\n m = heapq.heappop(h)\n s -= m\n if len(h) == n:\n if best_s < s:\n best_s = s\n res.append(best_s)\n return res\n \n \n def solve_large(n, a):\n res = -10 ** 20\n max_l = find_best(n, a)\n b = [-x for x in reversed(a)]\n max_r = find_best(n, b)\n max_r.reverse()\n for l, r in zip(max_l, max_r):\n res0 = l + r\n if res < res0:\n res = res0\n return res\n \n \n-\n n = int(input())\n a = list(map(int, input().split()))\n print(solve_large(n, a))\n \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 53 }, { "user_id": "u777923818", "problem_id": "p03716", "submission1_id": "s435237666", "submission2_id": "s628760075", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef inpl(): return tuple(map(int, input().split()))\nfrom bisect import bisect_left, insort\nN = int(input())\nA = inpl()\n\nbefore = sorted(A[:N])\nmiddle = sorted(A[N:-N])\nafter = sorted(A[-N:])\n\nS_before = [sum(before)]\nS_after = [sum(after)]\n\nfor m in middle:\n if before[0] < m:\n S_before.append(S_before[-1] + m - before[0])\n insort(before, m)\n before = before[1:]\n else:\n S_before.append(S_before[-1])\n\nfor m in middle[::-1]:\n if after[-1] > m:\n S_after.append(S_after[-1] - m + after[-1])\n insort(after, m)\n after = after[:-1]\n else:\n S_after.append(S_after[-1]) \n\nprint(max([b-a for b, a in zip(S_before, S_after[::-1])])) \n", "code2": "\ndef inpl(): return list(map(int, input().split()))\nfrom heapq import heapify, heappop, heappush\nfrom copy import deepcopy\n\nN = int(input())\nA = inpl()\n\nbefore = deepcopy(A[:N])\nheapify(before)\nmiddle = A[N:-N]\nafter = [-a for a in A[-N:]]\nheapify(after)\n\nsb = sum(A[:N])\nsa = -sum(A[-N:])\n\nSB = [sb]\nSA = [sa]\n\nfor m in middle:\n b = heappop(before)\n if b < m:\n heappush(before, m)\n sb += m - b\n else:\n heappush(before, b)\n SB.append(sb) \n\nfor m in middle[::-1]:\n m = -m\n a = heappop(after)\n if a < m:\n heappush(after, m)\n sa += m - a\n else:\n heappush(after, a)\n SA.append(sa) \n\n \nprint(max([b+a for b, a in zip(SB, SA[::-1])]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514757259", "date2": "1514759803", "bleu_score": "0.6325209945355924", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "-7\n", "expected_output": "1\n", "anno_code": ["\ndef inpl(): return tuple(map(int, input().split()))\nfrom bisect import bisect_left, insort\nN = int(input()) # (0): N=2\nA = inpl() # (1): A=(3, 1, 4, 1, 5, 9)\n\nbefore = sorted(A[:N]) # (2): before=[1, 3]\nmiddle = sorted(A[N:-N]) # (3): middle=[1, 4]\nafter = sorted(A[-N:]) # (4): after=[5, 9]\n\nS_before = [sum(before)] # (5): S_before=[4]\nS_after = [sum(after)] # (6): S_after=[14]\n\nfor m in middle: # (7): m=1 (10): m=4 (15): NO CHANGE\n if before[0] < m: # (8): NO CHANGE (11): NO CHANGE\n S_before.append(S_before[-1] + m - before[0]) # (12): S_before=[4, 4, 7]\n insort(before, m) # (13): before=[1, 3, 4]\n before = before[1:] # (14): before=[3, 4]\n else:\n S_before.append(S_before[-1]) # (9): S_before=[4, 4]\n\nfor m in middle[::-1]: # (16): NO CHANGE (21): m=1 (26): NO CHANGE\n if after[-1] > m: # (17): NO CHANGE (22): NO CHANGE\n S_after.append(S_after[-1] - m + after[-1]) # (18): S_after=[14, 19] (23): S_after=[14, 19, 23]\n insort(after, m) # (19): after=[4, 5, 9] (24): after=[1, 4, 5]\n after = after[:-1] # (20): after=[4, 5] (25): after=[1, 4]\n else:\n S_after.append(S_after[-1]) \n\nprint(max([b-a for b, a in zip(S_before, S_after[::-1])])) \n"], "anno_status": [true], "diff_content": " \n-def inpl(): return tuple(map(int, input().split()))\n-from bisect import bisect_left, insort\n+def inpl(): return list(map(int, input().split()))\n+from heapq import heapify, heappop, heappush\n+from copy import deepcopy\n+\n N = int(input())\n A = inpl()\n \n-before = sorted(A[:N])\n-middle = sorted(A[N:-N])\n-after = sorted(A[-N:])\n+before = deepcopy(A[:N])\n+heapify(before)\n+middle = A[N:-N]\n+after = [-a for a in A[-N:]]\n+heapify(after)\n+\n+sb = sum(A[:N])\n+sa = -sum(A[-N:])\n \n-S_before = [sum(before)]\n-S_after = [sum(after)]\n+SB = [sb]\n+SA = [sa]\n \n for m in middle:\n- if before[0] < m:\n- S_before.append(S_before[-1] + m - before[0])\n- insort(before, m)\n- before = before[1:]\n+ b = heappop(before)\n+ if b < m:\n+ heappush(before, m)\n+ sb += m - b\n else:\n- S_before.append(S_before[-1])\n+ heappush(before, b)\n+ SB.append(sb) \n \n for m in middle[::-1]:\n- if after[-1] > m:\n- S_after.append(S_after[-1] - m + after[-1])\n- insort(after, m)\n- after = after[:-1]\n+ m = -m\n+ a = heappop(after)\n+ if a < m:\n+ heappush(after, m)\n+ sa += m - a\n else:\n- S_after.append(S_after[-1]) \n-\n-print(max([b-a for b, a in zip(S_before, S_after[::-1])])) \n+ heappush(after, a)\n+ SA.append(sa) \n \n+ \n+print(max([b+a for b, a in zip(SB, SA[::-1])]))\n", "FL_content": " \n-def inpl(): return tuple(map(int, input().split()))\n-from bisect import bisect_left, insort\n N = int(input())\n A = inpl()\n \n-before = sorted(A[:N])\n-middle = sorted(A[N:-N])\n-after = sorted(A[-N:])\n \n-S_before = [sum(before)]\n-S_after = [sum(after)]\n \n for m in middle:\n- if before[0] < m:\n- S_before.append(S_before[-1] + m - before[0])\n- insort(before, m)\n- before = before[1:]\n else:\n- S_before.append(S_before[-1])\n \n for m in middle[::-1]:\n- if after[-1] > m:\n- S_after.append(S_after[-1] - m + after[-1])\n- insort(after, m)\n- after = after[:-1]\n else:\n- S_after.append(S_after[-1]) \n-\n-print(max([b-a for b, a in zip(S_before, S_after[::-1])])) \n \n", "added_lines": 29, "removed_lines": 19, "code1_lines": 31 }, { "user_id": "u038408819", "problem_id": "p03716", "submission1_id": "s077575791", "submission2_id": "s375090405", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = list(map(int, input().split()))\n\nimport heapq\nque1 = []\nheapq.heapify(que1)\nS = [0] * (2*N + 1)\nfor i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\nque2 = []\nheapq.heapify(que2)\nT = [0] * (2*N + 1)\nfor i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n\nfor i in range(N, 2*N):\n mi = heapq.heappop(que1)\n print(mi)\n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\nfor i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n print(ma)\n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n\nres = -float('Inf')\nfor i in range(N, 2*N + 1):\n res = max(res, S[i] - T[3*N - i])\nprint(res)\n", "code2": "N = int(input())\na = list(map(int, input().split()))\n\nimport heapq\nque1 = []\nheapq.heapify(que1)\nS = [0] * (2*N + 1)\nfor i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\nque2 = []\nheapq.heapify(que2)\nT = [0] * (2*N + 1)\nfor i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n\nfor i in range(N, 2*N):\n mi = heapq.heappop(que1)\n \n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\nfor i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n \n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n\nres = -float('Inf')\nfor i in range(N, 2*N + 1):\n res = max(res, S[i] - T[3*N - i])\nprint(res)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584209371", "date2": "1584209569", "bleu_score": "0.9779612901144311", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "2\n3 1 4 1 5 9\n", "actual_output": "1\n3\n9\n5\n1\n", "expected_output": "1\n", "anno_code": ["N = int(input()) # (0): N=2\na = list(map(int, input().split())) # (1): a=[3, 1, 4, 1, 5, 9], heapq=\n\nimport heapq\nque1 = [] # (2): que1=[]\nheapq.heapify(que1) # (3): NO CHANGE\nS = [0] * (2*N + 1) # (4): S=[0, 0, 0, 0, 0]\nfor i in range(N): # (5): i=0 (8): i=1 (11): NO CHANGE\n S[i + 1] = S[i] + a[i] # (6): S=[0, 3, 0, 0, 0] (9): S=[0, 3, 4, 0, 0]\n \n heapq.heappush(que1, a[i]) # (7): que1=[3] (10): que1=[1, 3]\nque2 = [] # (12): que2=[]\nheapq.heapify(que2) # (13): NO CHANGE\nT = [0] * (2*N + 1) # (14): T=[0, 0, 0, 0, 0]\nfor i in range(N): # (15): i=0 (18): i=1 (21): NO CHANGE\n T[i + 1] = T[i] + a[3*N - i - 1] # (16): T=[0, 9, 0, 0, 0] (19): T=[0, 9, 14, 0, 0]\n \n heapq.heappush(que2, -a[3*N - i - 1]) # (17): que2=[-9] (20): que2=[-9, -5]\n\nfor i in range(N, 2*N): # (22): i=2 (28): i=3 (34): NO CHANGE\n mi = heapq.heappop(que1) # (23): que1=[3], mi=1 (29): que1=[4], mi=3\n print(mi) # (24): NO CHANGE (30): NO CHANGE\n if a[i] > mi: # (25): NO CHANGE (31): NO CHANGE\n S[i + 1] = S[i] - mi + a[i] # (26): S=[0, 3, 4, 7, 0]\n \n heapq.heappush(que1, a[i]) # (27): que1=[3, 4]\n else:\n S[i + 1] = S[i] # (32): S=[0, 3, 4, 7, 7]\n heapq.heappush(que1, mi) # (33): que1=[3, 4]\nfor i in range(N, 2*N): # (35): i=2 (41): i=3 (47): NO CHANGE\n ma = heapq.heappop(que2) * -1 # (36): que2=[-5], ma=9 (42): que2=[-1], ma=5\n print(ma) # (37): NO CHANGE (43): NO CHANGE\n if a[3*N - i - 1] < ma: # (38): NO CHANGE (44): NO CHANGE\n T[i + 1] = T[i] - ma + a[3*N - i - 1] # (39): T=[0, 9, 14, 6, 0] (45): T=[0, 9, 14, 6, 5]\n \n \n heapq.heappush(que2, -a[3*N - i - 1]) # (40): que2=[-5, -1] (46): que2=[-4, -1]\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n\nres = -float('Inf') # (48): res=-inf\nfor i in range(N, 2*N + 1): # (49): i=2 (51): i=3 ... (55): NO CHANGE\n res = max(res, S[i] - T[3*N - i]) # (50): res=-1 (52): res=1 (54): NO CHANGE\nprint(res)\n"], "anno_status": [false], "diff_content": " N = int(input())\n a = list(map(int, input().split()))\n \n import heapq\n que1 = []\n heapq.heapify(que1)\n S = [0] * (2*N + 1)\n for i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\n que2 = []\n heapq.heapify(que2)\n T = [0] * (2*N + 1)\n for i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n \n for i in range(N, 2*N):\n mi = heapq.heappop(que1)\n- print(mi)\n+ \n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\n for i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n- print(ma)\n+ \n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n \n res = -float('Inf')\n for i in range(N, 2*N + 1):\n res = max(res, S[i] - T[3*N - i])\n print(res)\n \n", "FL_content": " N = int(input())\n a = list(map(int, input().split()))\n \n import heapq\n que1 = []\n heapq.heapify(que1)\n S = [0] * (2*N + 1)\n for i in range(N):\n S[i + 1] = S[i] + a[i]\n \n heapq.heappush(que1, a[i])\n que2 = []\n heapq.heapify(que2)\n T = [0] * (2*N + 1)\n for i in range(N):\n T[i + 1] = T[i] + a[3*N - i - 1]\n \n heapq.heappush(que2, -a[3*N - i - 1])\n \n for i in range(N, 2*N):\n mi = heapq.heappop(que1)\n- print(mi)\n if a[i] > mi:\n S[i + 1] = S[i] - mi + a[i]\n \n heapq.heappush(que1, a[i])\n else:\n S[i + 1] = S[i]\n heapq.heappush(que1, mi)\n for i in range(N, 2*N):\n ma = heapq.heappop(que2) * -1\n- print(ma)\n if a[3*N - i - 1] < ma:\n T[i + 1] = T[i] - ma + a[3*N - i - 1]\n \n \n heapq.heappush(que2, -a[3*N - i - 1])\n else:\n T[i + 1] = T[i]\n heapq.heappush(que2, -ma)\n \n res = -float('Inf')\n for i in range(N, 2*N + 1):\n res = max(res, S[i] - T[3*N - i])\n print(res)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 46 }, { "user_id": "u690781906", "problem_id": "p03200", "submission1_id": "s926955575", "submission2_id": "s093376892", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nw_count = s.count('W')\nans = 0\nfor i in range(w_count):\n if s[i] == 'B':\n ans += w_count - i + 1\nprint(ans)", "code2": "s = input()\nans = 0\nw_count = 0\nfor i in range(len(s)):\n if s[i] == 'W':\n ans += i - w_count\n w_count += 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578267260", "date2": "1578267876", "bleu_score": "0.7909351737087071", "code1_test_status": [1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "WBWBTC\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["s = input() # (0): s=WBWBTC\nw_count = s.count('W') # (1): w_count=2\nans = 0 # (2): ans=0\nfor i in range(w_count): # (3): i=0 (5): i=1 (8): NO CHANGE\n if s[i] == 'B': # (4): NO CHANGE (6): NO CHANGE\n ans += w_count - i + 1 # (7): ans=2\nprint(ans)"], "anno_status": [true], "diff_content": " s = input()\n-w_count = s.count('W')\n ans = 0\n-for i in range(w_count):\n- if s[i] == 'B':\n- ans += w_count - i + 1\n+w_count = 0\n+for i in range(len(s)):\n+ if s[i] == 'W':\n+ ans += i - w_count\n+ w_count += 1\n print(ans)\n+\n", "FL_content": " s = input()\n-w_count = s.count('W')\n ans = 0\n-for i in range(w_count):\n- if s[i] == 'B':\n- ans += w_count - i + 1\n print(ans)\n", "added_lines": 6, "removed_lines": 4, "code1_lines": 7 }, { "user_id": "u223904637", "problem_id": "p03200", "submission1_id": "s617975653", "submission2_id": "s310575038", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=list(input())\nans=0\nwf=0\nbf=0\nfor i in range(len(s)):\n if s[i]=='W':\n ans+=i\n wf=1\n else:\n bf=1\nif wf==0 or bf==0:\n print(0)\nelse:\n print(ans)", "code2": "s=list(input())\nans=0\nwf=0\nbf=0\nfor i in range(len(s)):\n if s[i]=='W':\n ans+=i\n wf+=1\n else:\n bf=1\nif wf==0 or bf==0:\n print(0)\nelse:\n print(ans-wf*(wf-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552349157", "date2": "1552349622", "bleu_score": "0.9288678656157988", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 95, "total_score": 102, "input": "WBWBVB\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["s=list(input()) # (0): s=['W', 'B', 'W', 'B', 'V', 'B']\nans=0 # (1): ans=0\nwf=0 # (2): wf=0\nbf=0 # (3): bf=0\nfor i in range(len(s)): # (4): i=0 (8): i=1 ... (24): NO CHANGE\n if s[i]=='W': # (5): NO CHANGE (9): NO CHANGE ... (22): NO CHANGE\n ans+=i # (6): NO CHANGE (13): ans=2\n wf=1 # (7): wf=1 (14): NO CHANGE\n else:\n bf=1 # (10): bf=1 (17): NO CHANGE ... (23): NO CHANGE\nif wf==0 or bf==0: # (25): NO CHANGE\n print(0)\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " s=list(input())\n ans=0\n wf=0\n bf=0\n for i in range(len(s)):\n if s[i]=='W':\n ans+=i\n- wf=1\n+ wf+=1\n else:\n bf=1\n if wf==0 or bf==0:\n print(0)\n else:\n- print(ans)\n+ print(ans-wf*(wf-1)\n+\n", "FL_content": " s=list(input())\n ans=0\n wf=0\n bf=0\n for i in range(len(s)):\n if s[i]=='W':\n ans+=i\n- wf=1\n else:\n bf=1\n if wf==0 or bf==0:\n print(0)\n else:\n- print(ans)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u581403769", "problem_id": "p03200", "submission1_id": "s074874248", "submission2_id": "s513024875", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\n\ncount = 0\nwhite = 0\nfor i in range(len(s)):\n if s[i] == 'W':\n count += i\n white += 1\n \nprint(count - white)", "code2": "s = list(input())\n\ncount = 0\nwhite = 0\nfor i in range(len(s)):\n if s[i] == 'W':\n count += i - white\n white += 1\n\nprint(count)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595977158", "date2": "1595977434", "bleu_score": "0.9096210723886125", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 95, "total_score": 102, "input": "WBWBUC\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["s = list(input()) # (0): s=['W', 'B', 'W', 'B', 'U', 'C']\n\ncount = 0 # (1): count=0\nwhite = 0 # (2): white=0\nfor i in range(len(s)): # (3): i=0 (7): i=1 ... (19): NO CHANGE\n if s[i] == 'W': # (4): NO CHANGE (8): NO CHANGE ... (18): NO CHANGE\n count += i # (5): NO CHANGE (11): count=2\n white += 1 # (6): white=1 (12): white=2\n \nprint(count - white)"], "anno_status": [true], "diff_content": " s = list(input())\n \n count = 0\n white = 0\n for i in range(len(s)):\n if s[i] == 'W':\n- count += i\n+ count += i - white\n white += 1\n- \n-print(count - white)\n+\n+print(count)\n+\n", "FL_content": " s = list(input())\n \n count = 0\n white = 0\n for i in range(len(s)):\n if s[i] == 'W':\n- count += i\n white += 1\n- \n-print(count - white)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u730476362", "problem_id": "p03200", "submission1_id": "s852320838", "submission2_id": "s466621836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\ncounter = 0\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nsum=0\nfor i in range(len(S)):\n if S[i]=='W':\n sum+=i\n counter+=1\nprint(sum-counter)", "code2": "S = input()\ncounter = 0\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nsum=0\nfor i in range(len(S)):\n if S[i]=='W':\n sum+=i\n counter+=1\n\nn=counter-1\nminus=n*(n+1)/2\nprint(int(sum-minus))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544927978", "date2": "1544928556", "bleu_score": "0.7992121873868319", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 95, "total_score": 102, "input": "WBVBVC\n", "actual_output": "-1\n", "expected_output": "0\n\n", "anno_code": ["S = input() # (0): S=WBVBVC\ncounter = 0 # (1): counter=0\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nsum=0 # (2): sum=0\nfor i in range(len(S)): # (3): i=0 (7): i=1 ... (17): NO CHANGE\n if S[i]=='W': # (4): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n sum+=i # (5): NO CHANGE\n counter+=1 # (6): counter=1\nprint(sum-counter)"], "anno_status": [true], "diff_content": " S = input()\n counter = 0\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n sum=0\n for i in range(len(S)):\n if S[i]=='W':\n sum+=i\n counter+=1\n-print(sum-counter)\n+\n+n=counter-1\n+minus=n*(n+1)/2\n+print(int(sum-minus))\n", "FL_content": " S = input()\n counter = 0\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n sum=0\n for i in range(len(S)):\n if S[i]=='W':\n sum+=i\n counter+=1\n-print(sum-counter)\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 28 }, { "user_id": "u580362735", "problem_id": "p03200", "submission1_id": "s621113641", "submission2_id": "s560907911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nans = 0\ntmp = 0\nfor i in range(len(S)):\n if S[i] == 'W':\n ans+=i-tmp\n else:\n tmp+=1\nprint(ans)", "code2": "S = input()\nans = 0\ntmp = 0\nfor i in range(len(S)):\n if S[i] == 'W':\n ans+=i-tmp\n tmp+=1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551800946", "date2": "1551800982", "bleu_score": "0.9299745235723618", "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, 0, 0], "code1_test_score": 100, "total_score": 102, "input": "BBW\n", "actual_output": "0\n", "expected_output": "2\n", "anno_code": ["S = input() # (0): S=BBW\nans = 0 # (1): ans=0\ntmp = 0 # (2): tmp=0\nfor i in range(len(S)): # (3): i=0 (6): i=1 ... (12): NO CHANGE\n if S[i] == 'W': # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n ans+=i-tmp # (11): NO CHANGE\n else:\n tmp+=1 # (5): tmp=1 (8): tmp=2\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n ans = 0\n tmp = 0\n for i in range(len(S)):\n if S[i] == 'W':\n ans+=i-tmp\n- else:\n tmp+=1\n print(ans)\n+\n", "FL_content": " S = input()\n ans = 0\n tmp = 0\n for i in range(len(S)):\n if S[i] == 'W':\n ans+=i-tmp\n- else:\n tmp+=1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u675918663", "problem_id": "p03200", "submission1_id": "s680229180", "submission2_id": "s988095295", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nline = next(map(str.strip, sys.stdin))\n\ncount = 0\nnb_bs = 0\nfor i, c in enumerate(line):\n if c == 'W' and nb_bs:\n count += nb_bs\n else:\n nb_bs += 1\n\nprint(count)", "code2": "import re\nimport sys\n\nline = next(map(str.strip, sys.stdin))\n\ncount = 0\nnb_bs = 0\nfor i, c in enumerate(line):\n if c == 'W' and nb_bs > 0:\n count += nb_bs\n elif c == 'B':\n nb_bs += 1\n\nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549101682", "date2": "1549102057", "bleu_score": "0.8664312723670099", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "WBWBVB\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["import sys\n\nline = next(map(str.strip, sys.stdin)) # (0): line=WBWBVB\n\ncount = 0 # (1): count=0\nnb_bs = 0 # (2): nb_bs=0\nfor i, c in enumerate(line): # (3): i=0, c=W (6): i=1, c=B ... (21): NO CHANGE\n if c == 'W' and nb_bs: # (4): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n count += nb_bs # (11): count=2\n else:\n nb_bs += 1 # (5): nb_bs=1 (8): nb_bs=2 ... (20): nb_bs=5\n\nprint(count)"], "anno_status": [true], "diff_content": "+import re\n import sys\n \n line = next(map(str.strip, sys.stdin))\n \n count = 0\n nb_bs = 0\n for i, c in enumerate(line):\n- if c == 'W' and nb_bs:\n+ if c == 'W' and nb_bs > 0:\n count += nb_bs\n- else:\n+ elif c == 'B':\n nb_bs += 1\n \n print(count)\n+\n", "FL_content": " import sys\n \n line = next(map(str.strip, sys.stdin))\n \n count = 0\n nb_bs = 0\n for i, c in enumerate(line):\n- if c == 'W' and nb_bs:\n count += nb_bs\n- else:\n nb_bs += 1\n \n print(count)\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u282347497", "problem_id": "p03200", "submission1_id": "s428752782", "submission2_id": "s316000722", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\nsum = [0] * (n + 1)\nsum[0] = (s[0] == 'B')\nfor i in range(1 , n):\n\tsum[i] = sum[i-1] + (s[i] == 'B')\nans = 0\nfor i in range(n - 1, 0 ,-1):\n\tprint(i)\n\tif s[i] == 'W':\n\t\tans += sum[i]\nprint(ans)\n\t", "code2": "s = input()\nn = len(s)\nsum = [0] * (n + 1)\nsum[0] = (s[0] == 'B')\nfor i in range(1 , n):\n\tsum[i] = sum[i-1] + (s[i] == 'B')\nans = 0\nfor i in range(n - 1, -1 ,-1):\n\tif s[i] == 'W':\n\t\tans += sum[i]\nprint(ans)\n\t", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596506765", "date2": "1596506992", "bleu_score": "0.9401998548228648", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "Y;D\n", "actual_output": "2\n1\n0\n", "expected_output": "0\n\n", "anno_code": ["s = input() # (0): s=Y;D\nn = len(s) # (1): n=3\nsum = [0] * (n + 1) # (2): sum=[0, 0, 0, 0]\nsum[0] = (s[0] == 'B') # (3): NO CHANGE\nfor i in range(1 , n): # (4): i=1 (6): i=2 (8): NO CHANGE\n\tsum[i] = sum[i-1] + (s[i] == 'B') # (5): NO CHANGE (7): NO CHANGE\nans = 0 # (9): ans=0\nfor i in range(n - 1, 0 ,-1): # (10): NO CHANGE (13): i=1 (16): NO CHANGE\n\tprint(i) # (11): NO CHANGE (14): NO CHANGE\n\tif s[i] == 'W': # (12): NO CHANGE (15): NO CHANGE\n\t\tans += sum[i]\nprint(ans)\n\t"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n sum = [0] * (n + 1)\n sum[0] = (s[0] == 'B')\n for i in range(1 , n):\n \tsum[i] = sum[i-1] + (s[i] == 'B')\n ans = 0\n-for i in range(n - 1, 0 ,-1):\n-\tprint(i)\n+for i in range(n - 1, -1 ,-1):\n \tif s[i] == 'W':\n \t\tans += sum[i]\n print(ans)\n \t\n", "FL_content": " s = input()\n n = len(s)\n sum = [0] * (n + 1)\n sum[0] = (s[0] == 'B')\n for i in range(1 , n):\n \tsum[i] = sum[i-1] + (s[i] == 'B')\n ans = 0\n-for i in range(n - 1, 0 ,-1):\n-\tprint(i)\n \tif s[i] == 'W':\n \t\tans += sum[i]\n print(ans)\n \t\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u212502386", "problem_id": "p03200", "submission1_id": "s773870702", "submission2_id": "s613155420", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\n\nstart=0\nfor i in range(len(S)):\n if S[i]=='B':\n break\n\n start=i\n\nleft_W=start\nans=0\nif start, math=, fractions=, itertools=, collections=, copy=, heapq=\nimport sys, math, fractions, itertools, collections, copy, heapq\n\n\ndef solve(S: str): # (1): solve=\n counter = 0\n tmp = S[0]\n for s in S[1:]:\n if s == tmp[-1]:\n tmp = tmp + s\n elif s == 'W' and tmp[-1] == 'B':\n tmp = tmp + s\n else:\n counter += 2 * min(tmp.count('B'), tmp.count('W'))\n tmp = s\n counter += 2 * min(tmp.count('B'), tmp.count('W'))\n print(counter)\n return\n\n\n\ndef main(): # (2): 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 S = next(tokens) \n solve(S)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys, math, fractions, itertools, collections, copy, heapq\n \n \n def solve(S: str):\n counter = 0\n- tmp = S[0]\n- for s in S[1:]:\n- if s == tmp[-1]:\n- tmp = tmp + s\n- elif s == 'W' and tmp[-1] == 'B':\n- tmp = tmp + s\n- else:\n- counter += 2 * min(tmp.count('B'), tmp.count('W'))\n- tmp = s\n- counter += 2 * min(tmp.count('B'), tmp.count('W'))\n+ c = 0\n+ for i, s in enumerate(S):\n+ if s == 'W':\n+ counter += i - c\n+ c += 1\n print(counter)\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 S = next(tokens) \n solve(S)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys, math, fractions, itertools, collections, copy, heapq\n \n \n def solve(S: str):\n counter = 0\n- tmp = S[0]\n- for s in S[1:]:\n- if s == tmp[-1]:\n- tmp = tmp + s\n- elif s == 'W' and tmp[-1] == 'B':\n- tmp = tmp + s\n- else:\n- counter += 2 * min(tmp.count('B'), tmp.count('W'))\n- tmp = s\n- counter += 2 * min(tmp.count('B'), tmp.count('W'))\n print(counter)\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 S = next(tokens) \n solve(S)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 5, "removed_lines": 10, "code1_lines": 33 }, { "user_id": "u023229441", "problem_id": "p03200", "submission1_id": "s811559395", "submission2_id": "s018456959", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nt=list(s).count(\"W\")\nA=[i for i,x in enumerate (list(s)) if x==\"W\"]\nprint(int(sum(A)-t*(t+1)/2))", "code2": "s=input()\nt=list(s).count(\"W\")\nA=[i for i,x in enumerate (list(s)) if x==\"W\"]\nprint(int(sum(A)-t*(t-1)/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548640143", "date2": "1548640218", "bleu_score": "0.9666465443060477", "code1_test_status": [0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 93, "total_score": 102, "input": "WBWBVC\n", "actual_output": "-1\n", "expected_output": "1\n\n", "anno_code": ["s=input() # (0): s=WBWBVC\nt=list(s).count(\"W\") # (1): t=2\nA=[i for i,x in enumerate (list(s)) if x==\"W\"] # (2): A=[0, 2]\nprint(int(sum(A)-t*(t+1)/2))"], "anno_status": [true], "diff_content": " s=input()\n t=list(s).count(\"W\")\n A=[i for i,x in enumerate (list(s)) if x==\"W\"]\n-print(int(sum(A)-t*(t+1)/2))\n+print(int(sum(A)-t*(t-1)/2))\n+\n", "FL_content": " s=input()\n t=list(s).count(\"W\")\n A=[i for i,x in enumerate (list(s)) if x==\"W\"]\n-print(int(sum(A)-t*(t+1)/2))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u112002050", "problem_id": "p03200", "submission1_id": "s894886678", "submission2_id": "s589994322", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nb_counts = []\ncnt = 0\nfor i in range(len(s)):\n if s[i] == \"B\":\n cnt += 1\n if s[i] == \"W\":\n cnt += sum(b_counts)\n b_counts.append(cnt)\n cnt = 0\nprint(sum(b_counts))\n", "code2": "s = list(input())\n\ncnt = 0\nprev_cnt = 0\nresult = 0\nfor i in range(len(s)):\n if s[i] == \"B\":\n cnt += 1\n if s[i] == \"W\":\n cnt += prev_cnt\n result += cnt\n prev_cnt = cnt\n cnt = 0\nprint(result)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544926903", "date2": "1544927629", "bleu_score": "0.6999495061607471", "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, 0, 1], "code1_test_score": 101, "total_score": 102, "input": "BWBWBW\n", "actual_output": "7\n", "expected_output": "6\n", "anno_code": ["s = list(input()) # (0): s=['B', 'W', 'B', 'W', 'B', 'W']\nb_counts = [] # (1): b_counts=[]\ncnt = 0 # (2): cnt=0\nfor i in range(len(s)): # (3): i=0 (7): i=1 ... (33): NO CHANGE\n if s[i] == \"B\": # (4): NO CHANGE (8): NO CHANGE ... (28): NO CHANGE\n cnt += 1 # (5): cnt=1 (15): cnt=1 (25): cnt=1\n if s[i] == \"W\": # (6): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\n cnt += sum(b_counts) # (10): NO CHANGE (20): cnt=2 (30): cnt=4\n b_counts.append(cnt) # (11): b_counts=[1] (21): b_counts=[1, 2] (31): b_counts=[1, 2, 4]\n cnt = 0 # (12): cnt=0 (22): cnt=0 (32): cnt=0\nprint(sum(b_counts))\n"], "anno_status": [true], "diff_content": " s = list(input())\n-b_counts = []\n+\n cnt = 0\n+prev_cnt = 0\n+result = 0\n for i in range(len(s)):\n if s[i] == \"B\":\n cnt += 1\n if s[i] == \"W\":\n- cnt += sum(b_counts)\n- b_counts.append(cnt)\n+ cnt += prev_cnt\n+ result += cnt\n+ prev_cnt = cnt\n cnt = 0\n-print(sum(b_counts))\n+print(result)\n \n", "FL_content": " s = list(input())\n-b_counts = []\n cnt = 0\n for i in range(len(s)):\n if s[i] == \"B\":\n cnt += 1\n if s[i] == \"W\":\n- cnt += sum(b_counts)\n- b_counts.append(cnt)\n cnt = 0\n-print(sum(b_counts))\n \n", "added_lines": 7, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u859897687", "problem_id": "p03200", "submission1_id": "s326323555", "submission2_id": "s120702317", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nm=[s[i]==\"B\" for i in range(len(s))]\nm1=[None for i in range(len(s))]\nm1[0]=m[0]\nfor i in range(1,len(s)):\n m1[i]=m1[i-1]+m[i]\nm2=[None for i in range(len(s))]\nm2[len(s)-1]=m[len(s)-1]\nfor i in range(len(s)-1,0,-1):\n m2[i-1]=m2[i]+m[i]\n \nans1=0\nans2=0\nfor i in range(1,len(s)):\n if s[i]==\"W\":\n ans1+=m1[i]\n ans2+=m2[i]\n \nprint(max(ans1,ans2))", "code2": "s=input()\nm=[s[i]==\"B\" for i in range(len(s))]\nm1=[None for i in range(len(s))]\nm1[0]=m[0]\nfor i in range(1,len(s)):\n m1[i]=m1[i-1]+m[i]\nm2=[None for i in range(len(s))]\nm2[len(s)-1]=m[len(s)-1]\nfor i in range(len(s)-1,0,-1):\n m2[i-1]=m2[i]+m[i]\n \nans1=0\nans2=0\nfor i in range(1,len(s)):\n if s[i]==\"W\":\n ans1+=m1[i]\n ans2+=m2[i]\n \nprint(ans1)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575008086", "date2": "1575053968", "bleu_score": "0.9681983851407074", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "WBWBVB\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["s=input() # (0): s=WBWBVB\nm=[s[i]==\"B\" for i in range(len(s))] # (1): m=[False, True, False, True, False, True]\nm1=[None for i in range(len(s))] # (2): m1=[None, None, None, None, None, None]\nm1[0]=m[0] # (3): m1=[False, None, None, None, None, None]\nfor i in range(1,len(s)): # (4): i=1 (6): i=2 ... (14): NO CHANGE\n m1[i]=m1[i-1]+m[i] # (5): m1=[False, 1, None, None, None, None] (7): m1=[False, 1, 1, None, None, None] ... (13): m1=[False, 1, 1, 2, 2, 3]\nm2=[None for i in range(len(s))] # (15): m2=[None, None, None, None, None, None]\nm2[len(s)-1]=m[len(s)-1] # (16): m2=[None, None, None, None, None, True]\nfor i in range(len(s)-1,0,-1): # (17): NO CHANGE (19): i=4 ... (27): NO CHANGE\n m2[i-1]=m2[i]+m[i] # (18): m2=[None, None, None, None, 2, True] (20): m2=[None, None, None, 2, 2, True] ... (26): m2=[4, 3, 3, 2, 2, True]\n \nans1=0 # (28): ans1=0\nans2=0 # (29): ans2=0\nfor i in range(1,len(s)): # (30): NO CHANGE (32): i=2 ... (42): NO CHANGE\n if s[i]==\"W\": # (31): NO CHANGE (33): NO CHANGE ... (41): NO CHANGE\n ans1+=m1[i] # (34): ans1=1\n ans2+=m2[i] # (35): ans2=3\n \nprint(max(ans1,ans2))"], "anno_status": [true], "diff_content": " s=input()\n m=[s[i]==\"B\" for i in range(len(s))]\n m1=[None for i in range(len(s))]\n m1[0]=m[0]\n for i in range(1,len(s)):\n m1[i]=m1[i-1]+m[i]\n m2=[None for i in range(len(s))]\n m2[len(s)-1]=m[len(s)-1]\n for i in range(len(s)-1,0,-1):\n m2[i-1]=m2[i]+m[i]\n \n ans1=0\n ans2=0\n for i in range(1,len(s)):\n if s[i]==\"W\":\n ans1+=m1[i]\n ans2+=m2[i]\n \n-print(max(ans1,ans2))\n+print(ans1)\n+\n+\n", "FL_content": " s=input()\n m=[s[i]==\"B\" for i in range(len(s))]\n m1=[None for i in range(len(s))]\n m1[0]=m[0]\n for i in range(1,len(s)):\n m1[i]=m1[i-1]+m[i]\n m2=[None for i in range(len(s))]\n m2[len(s)-1]=m[len(s)-1]\n for i in range(len(s)-1,0,-1):\n m2[i-1]=m2[i]+m[i]\n \n ans1=0\n ans2=0\n for i in range(1,len(s)):\n if s[i]==\"W\":\n ans1+=m1[i]\n ans2+=m2[i]\n \n-print(max(ans1,ans2))\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u170324846", "problem_id": "p03200", "submission1_id": "s210584047", "submission2_id": "s782721391", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\nA = []\n\nfor i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\n\nif len(A) == 1:\n print(sum(A))\nelse:\n print(sum(A)-len(A))", "code2": "S = input()\nN = len(S)\nA = []\n\nfor i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\nn = len(A)-1\nprint(sum(A)-(n+1)*n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562188734", "date2": "1562189253", "bleu_score": "0.7025423197723282", "code1_test_status": [1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "WBWBTC\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=WBWBTC\nN = len(S) # (1): N=6\nA = [] # (2): A=[]\n\nfor i, s in enumerate(S): # (3): i=0, s=W (6): i=1, s=B ... (17): NO CHANGE\n if s == \"W\": # (4): NO CHANGE (7): NO CHANGE ... (16): NO CHANGE\n A.append(i) # (5): A=[0] (10): A=[0, 2]\n\nif len(A) == 1: # (18): NO CHANGE\n print(sum(A))\nelse:\n print(sum(A)-len(A))"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n A = []\n \n for i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\n-\n-if len(A) == 1:\n- print(sum(A))\n-else:\n- print(sum(A)-len(A))\n+n = len(A)-1\n+print(sum(A)-(n+1)*n\n", "FL_content": " S = input()\n N = len(S)\n A = []\n \n for i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\n-\n-if len(A) == 1:\n- print(sum(A))\n-else:\n- print(sum(A)-len(A))\n", "added_lines": 2, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u831274245", "problem_id": "p03200", "submission1_id": "s051858594", "submission2_id": "s375611718", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input().strip()\n\ncount = 0\nsuma = 0\nfor i in S:\n if i==\"W\":\n suma += count\n else:\n count += 1\n", "code2": "S = input().strip()\n\ncount = 0\nsuma = 0\nfor i in S:\n if i==\"W\":\n suma += count\n else:\n count += 1\nprint(suma)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590613607", "date2": "1590613644", "bleu_score": "0.9047525095836212", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "WBWBTC\n", "actual_output": "", "expected_output": "1\n\n", "anno_code": ["S = input().strip() # (0): S=WBWBTC\n\ncount = 0 # (1): count=0\nsuma = 0 # (2): suma=0\nfor i in S: # (3): i=W (6): i=B ... (18): i=C\n if i==\"W\": # (4): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n suma += count # (5): NO CHANGE (11): suma=1\n else:\n count += 1 # (8): count=1 (14): count=2 ... (20): count=4\n"], "anno_status": [true], "diff_content": " S = input().strip()\n \n count = 0\n suma = 0\n for i in S:\n if i==\"W\":\n suma += count\n else:\n count += 1\n-\n+print(suma)\n", "FL_content": " S = input().strip()\n \n count = 0\n suma = 0\n for i in S:\n if i==\"W\":\n suma += count\n else:\n count += 1\n-\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u170324846", "problem_id": "p03200", "submission1_id": "s195667734", "submission2_id": "s782721391", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\nA = []\n\nfor i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\n\nprint(max(sum(A)-len(A), 0))", "code2": "S = input()\nN = len(S)\nA = []\n\nfor i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\nn = len(A)-1\nprint(sum(A)-(n+1)*n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562188500", "date2": "1562189253", "bleu_score": "0.8650723881878891", "code1_test_status": [1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 96, "total_score": 102, "input": "WBWBVB\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=WBWBVB\nN = len(S) # (1): N=6\nA = [] # (2): A=[]\n\nfor i, s in enumerate(S): # (3): i=0, s=W (6): i=1, s=B ... (17): NO CHANGE\n if s == \"W\": # (4): NO CHANGE (7): NO CHANGE ... (16): NO CHANGE\n A.append(i) # (5): A=[0] (10): A=[0, 2]\n\nprint(max(sum(A)-len(A), 0))"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n A = []\n \n for i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\n-\n-print(max(sum(A)-len(A), 0))\n+n = len(A)-1\n+print(sum(A)-(n+1)*n\n", "FL_content": " S = input()\n N = len(S)\n A = []\n \n for i, s in enumerate(S):\n if s == \"W\":\n A.append(i)\n-\n-print(max(sum(A)-len(A), 0))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u955125992", "problem_id": "p03200", "submission1_id": "s754840458", "submission2_id": "s621102526", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = str(input())\nn = len(s)\ncount = 0\nmax_W = 0\n\nfor i in range(n):\n if s[i] == 'W':\n count += i\n max_W = i\n\nif max_W == s.count('W') - 1 or s.count('W') == 0 or s.count('W') == n:\n print(0)\n exit()\n\nprint(count)", "code2": "s = str(input())\nn = len(s)\ndistance = 0\ncount = 0\nmax_W = 0\n\nfor i in range(n):\n if s[i] == 'W':\n distance += (i - count)\n count += 1\n max_W = i\n\nif s.count('W') == 0 or s.count('W') == n:\n print(0)\n exit()\n\nprint(distance)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588377096", "date2": "1588377563", "bleu_score": "0.8105938078928591", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 95, "total_score": 102, "input": "WBWBUB\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["s = str(input()) # (0): s=WBWBUB\nn = len(s) # (1): n=6\ncount = 0 # (2): count=0\nmax_W = 0 # (3): max_W=0\n\nfor i in range(n): # (4): i=0 (8): i=1 ... (20): NO CHANGE\n if s[i] == 'W': # (5): NO CHANGE (9): NO CHANGE ... (19): NO CHANGE\n count += i # (6): NO CHANGE (12): count=2\n max_W = i # (7): NO CHANGE (13): max_W=2\n\nif max_W == s.count('W') - 1 or s.count('W') == 0 or s.count('W') == n: # (21): NO CHANGE\n print(0)\n exit()\n\nprint(count)"], "anno_status": [true], "diff_content": " s = str(input())\n n = len(s)\n+distance = 0\n count = 0\n max_W = 0\n \n for i in range(n):\n if s[i] == 'W':\n- count += i\n+ distance += (i - count)\n+ count += 1\n max_W = i\n \n-if max_W == s.count('W') - 1 or s.count('W') == 0 or s.count('W') == n:\n+if s.count('W') == 0 or s.count('W') == n:\n print(0)\n exit()\n \n-print(count)\n+print(distance)\n", "FL_content": " s = str(input())\n n = len(s)\n count = 0\n max_W = 0\n \n for i in range(n):\n if s[i] == 'W':\n- count += i\n max_W = i\n \n-if max_W == s.count('W') - 1 or s.count('W') == 0 or s.count('W') == n:\n print(0)\n exit()\n \n-print(count)\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 15 }, { "user_id": "u584174687", "problem_id": "p03200", "submission1_id": "s749260039", "submission2_id": "s644652541", "status1": "Wrong Answer", "status2": "Accepted", "code1": "data = list(input())[::-1]\n\ncount = 0\n\n\ncount_b = 0\nfor i in range(len(data)):\n \n if data[i] == 'W':\n count += count_b\n \n \n \n else:\n count_b += 1\n \n \nprint(count)\n", "code2": "data = list(input())\n\ncount = 0\n\n\ncount_b = 0\nfor i in range(len(data)):\n \n if data[i] == 'W':\n count += count_b\n \n \n \n else:\n count_b += 1\n \n \nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544926560", "date2": "1544926718", "bleu_score": "0.9642961460247876", "code1_test_status": [0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 93, "total_score": 102, "input": "BBW\n", "actual_output": "0\n", "expected_output": "2\n", "anno_code": ["data = list(input())[::-1] # (0): data=['W', 'B', 'B']\n\ncount = 0 # (1): count=0\n\n\ncount_b = 0 # (2): count_b=0\nfor i in range(len(data)): # (3): i=0 (6): i=1 ... (12): NO CHANGE\n \n if data[i] == 'W': # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n count += count_b # (5): NO CHANGE\n \n \n \n else:\n count_b += 1 # (8): count_b=1 (11): count_b=2\n \n \nprint(count)\n"], "anno_status": [true], "diff_content": "-data = list(input())[::-1]\n+data = list(input())\n \n count = 0\n \n \n count_b = 0\n for i in range(len(data)):\n \n if data[i] == 'W':\n count += count_b\n \n \n \n else:\n count_b += 1\n \n \n print(count)\n \n", "FL_content": "-data = list(input())[::-1]\n \n count = 0\n \n \n count_b = 0\n for i in range(len(data)):\n \n if data[i] == 'W':\n count += count_b\n \n \n \n else:\n count_b += 1\n \n \n print(count)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u777028980", "problem_id": "p03200", "submission1_id": "s400602953", "submission2_id": "s405500135", "status1": "Wrong Answer", "status2": "Accepted", "code1": "hoge=input()\nans=0\ncount=0\nwhite=0\nfor i in hoge:\n \n if(i==\"W\"):\n ans+=count - white\n white+=1\n count+=1\n \nprint(count)", "code2": "hoge=input()\nans=0\ncount=0\nwhite=0\nfor i in hoge:\n \n if(i==\"W\"):\n ans+=count - white\n white+=1\n \n count+=1\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549998696", "date2": "1549998772", "bleu_score": "0.9347910435089406", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "9\\E\n", "actual_output": "3\n", "expected_output": "0\n\n", "anno_code": ["hoge=input() # (0): hoge=9\\E\nans=0 # (1): ans=0\ncount=0 # (2): count=0\nwhite=0 # (3): white=0\nfor i in hoge: # (4): i=9 (7): i=\\ ... (13): NO CHANGE\n \n if(i==\"W\"): # (5): NO CHANGE (8): NO CHANGE (11): NO CHANGE\n ans+=count - white\n white+=1\n count+=1 # (6): count=1 (9): count=2 (12): count=3\n \nprint(count)"], "anno_status": [true], "diff_content": " hoge=input()\n ans=0\n count=0\n white=0\n for i in hoge:\n \n if(i==\"W\"):\n ans+=count - white\n white+=1\n+ \n count+=1\n \n-print(count)\n+print(ans)\n", "FL_content": " hoge=input()\n ans=0\n count=0\n white=0\n for i in hoge:\n \n if(i==\"W\"):\n ans+=count - white\n white+=1\n count+=1\n \n-print(count)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u252729807", "problem_id": "p03200", "submission1_id": "s476729753", "submission2_id": "s007129541", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\n\nidx_w = 0\nidxes_b = []\n\nfor i, s in enumerate(S):\n if s == 'B':\n idxes_b.append(i)\n elif s == 'W':\n idx_w = i\n\n\nans = 0\nfor i, b in enumerate(idxes_b[::-1]):\n ans += idx_w - b - i\n\nprint(ans)", "code2": "S = input()\n\n\nidx_w = 0\nidxes_b = []\n\nfor i, s in enumerate(S):\n if s == 'B':\n idxes_b.append(i)\n elif s == 'W':\n idx_w = i\n\nidxes_b = [b for b in idxes_b if idx_w > b]\n\nans = 0\nfor i, b in enumerate(idxes_b[::-1]):\n ans += idx_w - b - i\n\nprint(max(0, ans))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593973728", "date2": "1593974096", "bleu_score": "0.8051392664645499", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 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], "code1_test_score": 80, "total_score": 102, "input": "DYB\n", "actual_output": "-2\n", "expected_output": "0\n\n", "anno_code": ["S = input() # (0): S=DYB\n\n\nidx_w = 0 # (1): idx_w=0\nidxes_b = [] # (2): idxes_b=[]\n\nfor i, s in enumerate(S): # (3): i=0, s=D (6): i=1, s=Y ... (12): NO CHANGE\n if s == 'B': # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n idxes_b.append(i) # (11): idxes_b=[2]\n elif s == 'W': # (5): NO CHANGE (8): NO CHANGE\n idx_w = i\n\n\nans = 0 # (13): ans=0\nfor i, b in enumerate(idxes_b[::-1]): # (14): i=0, b=2 (16): NO CHANGE\n ans += idx_w - b - i # (15): ans=-2\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n \n \n idx_w = 0\n idxes_b = []\n \n for i, s in enumerate(S):\n if s == 'B':\n idxes_b.append(i)\n elif s == 'W':\n idx_w = i\n \n+idxes_b = [b for b in idxes_b if idx_w > b]\n \n ans = 0\n for i, b in enumerate(idxes_b[::-1]):\n ans += idx_w - b - i\n \n-print(ans)\n+print(max(0, ans))\n", "FL_content": " S = input()\n \n \n idx_w = 0\n idxes_b = []\n \n for i, s in enumerate(S):\n if s == 'B':\n idxes_b.append(i)\n elif s == 'W':\n idx_w = i\n \n \n ans = 0\n for i, b in enumerate(idxes_b[::-1]):\n ans += idx_w - b - i\n \n-print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u726615467", "problem_id": "p03200", "submission1_id": "s621442079", "submission2_id": "s941288979", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nS = input()\n\nans = 0\nstate = 0\nmarker = 0\nfor i, Si in enumerate(S):\n \n if state < 1 and Si == 'B':\n state += 1\n elif state > 0 and Si == 'W':\n ans += i - marker\n marker += 1\n\nprint(ans)", "code2": "\nS = input()\n\nans = 0\nstate = 0\nfor i, Si in enumerate(S):\n \n if state < 1 and Si == 'B':\n state += 1\n marker = i\n elif state > 0 and Si == 'W':\n ans += i - marker\n marker += 1\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544926233", "date2": "1544926361", "bleu_score": "0.9496059573792326", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "WBWBVB\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["\nS = input() # (0): S=WBWBVB\n\nans = 0 # (1): ans=0\nstate = 0 # (2): state=0\nmarker = 0 # (3): marker=0\nfor i, Si in enumerate(S): # (4): i=0, Si=W (7): i=1, Si=B ... (24): NO CHANGE\n \n if state < 1 and Si == 'B': # (5): NO CHANGE (8): NO CHANGE ... (22): NO CHANGE\n state += 1 # (9): state=1\n elif state > 0 and Si == 'W': # (6): NO CHANGE (12): NO CHANGE ... (23): NO CHANGE\n ans += i - marker # (13): ans=2\n marker += 1 # (14): marker=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " \n S = input()\n \n ans = 0\n state = 0\n-marker = 0\n for i, Si in enumerate(S):\n \n if state < 1 and Si == 'B':\n state += 1\n+ marker = i\n elif state > 0 and Si == 'W':\n ans += i - marker\n marker += 1\n \n print(ans)\n", "FL_content": " \n S = input()\n \n ans = 0\n state = 0\n-marker = 0\n for i, Si in enumerate(S):\n \n if state < 1 and Si == 'B':\n state += 1\n elif state > 0 and Si == 'W':\n ans += i - marker\n marker += 1\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u389910364", "problem_id": "p03972", "submission1_id": "s806612982", "submission2_id": "s773558663", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\nH, W = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\nP.sort(reverse=True)\nQ.sort(reverse=True)\n\nans = 0\nv_nodes = W + 1\nh_nodes = H + 1\nwhile P or Q:\n if not Q or (P and P[-1] < Q[-1]):\n ans += P.pop() * h_nodes\n v_nodes -= 1\n else:\n ans += Q.pop() * v_nodes\n h_nodes -= 1\nprint(ans)\n", "code2": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n\nW,H = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\nedges = []\nfor p in P:\n edges.append((p, 'P'))\nfor q in Q:\n edges.append((q, 'Q'))\nedges.sort()\n\nans = 0\na = W + 1\nb = H + 1\nfor e, pq in edges:\n if pq == 'P':\n ans += e * b\n a -= 1\n else:\n ans += e * a\n b -= 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571705037", "date2": "1571705713", "bleu_score": "0.7777697925830229", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 74, "total_score": 102, "input": "1 4\n0\n6\n-1\n4\n4\n5\n1\n", "actual_output": "20\n", "expected_output": "12\n\n", "anno_code": ["import os\nimport sys\n\nif os.getenv(\"LOCAL\"): # (0): NO CHANGE\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(2147483647) # (1): NO CHANGE\nINF = float(\"inf\") # (2): INF=inf\nIINF = 10 ** 18 # (3): IINF=1000000000000000000\nMOD = 10 ** 9 + 7 # (4): MOD=1000000007\n\nH, W = list(map(int, sys.stdin.readline().split())) # (5): H=1, W=4\nP = [int(sys.stdin.readline()) for _ in range(W)] # (6): P=[0, 6, -1, 4]\nQ = [int(sys.stdin.readline()) for _ in range(H)] # (7): Q=[4]\n\nP.sort(reverse=True) # (8): P=[6, 4, 0, -1]\nQ.sort(reverse=True) # (9): NO CHANGE\n\nans = 0 # (10): ans=0\nv_nodes = W + 1 # (11): v_nodes=5\nh_nodes = H + 1 # (12): h_nodes=2\nwhile P or Q: # (13): NO CHANGE (17): NO CHANGE ... (33): NO CHANGE\n if not Q or (P and P[-1] < Q[-1]): # (14): NO CHANGE (18): NO CHANGE ... (30): NO CHANGE\n ans += P.pop() * h_nodes # (15): P=[6, 4, 0], ans=-2 (19): P=[6, 4] ... (31): P=[], ans=20\n v_nodes -= 1 # (16): v_nodes=4 (20): v_nodes=3 ... (32): v_nodes=1\n else:\n ans += Q.pop() * v_nodes # (23): Q=[], ans=10\n h_nodes -= 1 # (24): h_nodes=1\nprint(ans)\n"], "anno_status": [true], "diff_content": " import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(2147483647)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n-H, W = list(map(int, sys.stdin.readline().split()))\n+\n+W,H = list(map(int, sys.stdin.readline().split()))\n P = [int(sys.stdin.readline()) for _ in range(W)]\n Q = [int(sys.stdin.readline()) for _ in range(H)]\n \n-P.sort(reverse=True)\n-Q.sort(reverse=True)\n+edges = []\n+for p in P:\n+ edges.append((p, 'P'))\n+for q in Q:\n+ edges.append((q, 'Q'))\n+edges.sort()\n \n ans = 0\n-v_nodes = W + 1\n-h_nodes = H + 1\n-while P or Q:\n- if not Q or (P and P[-1] < Q[-1]):\n- ans += P.pop() * h_nodes\n- v_nodes -= 1\n+a = W + 1\n+b = H + 1\n+for e, pq in edges:\n+ if pq == 'P':\n+ ans += e * b\n+ a -= 1\n else:\n- ans += Q.pop() * v_nodes\n- h_nodes -= 1\n+ ans += e * a\n+ b -= 1\n print(ans)\n \n", "FL_content": " import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(2147483647)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n-H, W = list(map(int, sys.stdin.readline().split()))\n P = [int(sys.stdin.readline()) for _ in range(W)]\n Q = [int(sys.stdin.readline()) for _ in range(H)]\n \n-P.sort(reverse=True)\n-Q.sort(reverse=True)\n \n ans = 0\n-v_nodes = W + 1\n-h_nodes = H + 1\n-while P or Q:\n- if not Q or (P and P[-1] < Q[-1]):\n- ans += P.pop() * h_nodes\n- v_nodes -= 1\n else:\n- ans += Q.pop() * v_nodes\n- h_nodes -= 1\n print(ans)\n \n", "added_lines": 16, "removed_lines": 11, "code1_lines": 30 }, { "user_id": "u073852194", "problem_id": "p03972", "submission1_id": "s220502594", "submission2_id": "s835533849", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nfrom itertools import accumulate\n\nW, H = map(int,input().split())\n\nP = [int(input()) for _ in range(W)]\nQ = [int(input()) for _ in range(H)]\n\nP.sort()\nQ.sort()\n\ncum_p = [0] + list(accumulate(P))\ncum_q = [0] + list(accumulate(Q))\n\nres = 0\n\nN = min(len(cum_p), len(cum_q))\n\nfor i in range(N):\n res += cum_p[-1 - i] + cum_q[-1 - i]\n\nfor i in range(N - 1):\n res += min(P[-1 - i], Q[-1 - i])\n \nprint(res)", "code2": "import sys\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\nW, H = map(int,input().split())\n\nP = [int(input()) for _ in range(W)]\nQ = [int(input()) for _ in range(H)]\n\nP.sort()\nQ.sort()\n\nres = 0\n\nfor i in range(W):\n res += (H + 1 - bisect_left(Q, P[i])) * P[i]\n\nfor i in range(H):\n res += (W + 1 - bisect_right(P, Q[i])) * Q[i]\n \nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587091691", "date2": "1587093894", "bleu_score": "0.6284774417370425", "code1_test_status": [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, 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, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 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], "code1_test_score": 80, "total_score": 102, "input": "2 3\n1\n2\n-1\n6\n4\n1\n1\n", "actual_output": "18\n", "expected_output": "16\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, accumulate=\nfrom itertools import accumulate\n\nW, H = map(int,input().split()) # (1): W=2, H=3\n\nP = [int(input()) for _ in range(W)] # (2): P=[1, 2]\nQ = [int(input()) for _ in range(H)] # (3): Q=[-1, 6, 4]\n\nP.sort() # (4): NO CHANGE\nQ.sort() # (5): Q=[-1, 4, 6]\n\ncum_p = [0] + list(accumulate(P)) # (6): cum_p=[0, 1, 3]\ncum_q = [0] + list(accumulate(Q)) # (7): cum_q=[0, -1, 3, 9]\n\nres = 0 # (8): res=0\n\nN = min(len(cum_p), len(cum_q)) # (9): N=3\n\nfor i in range(N): # (10): i=0 (12): i=1 ... (16): NO CHANGE\n res += cum_p[-1 - i] + cum_q[-1 - i] # (11): res=12 (13): res=16 (15): res=15\n\nfor i in range(N - 1): # (17): i=0 (19): i=1 (21): NO CHANGE\n res += min(P[-1 - i], Q[-1 - i]) # (18): res=17 (20): res=18\n \nprint(res)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n-from itertools import accumulate\n+from bisect import bisect_left, bisect_right\n \n W, H = map(int,input().split())\n \n P = [int(input()) for _ in range(W)]\n Q = [int(input()) for _ in range(H)]\n \n P.sort()\n Q.sort()\n \n-cum_p = [0] + list(accumulate(P))\n-cum_q = [0] + list(accumulate(Q))\n-\n res = 0\n \n-N = min(len(cum_p), len(cum_q))\n-\n-for i in range(N):\n- res += cum_p[-1 - i] + cum_q[-1 - i]\n+for i in range(W):\n+ res += (H + 1 - bisect_left(Q, P[i])) * P[i]\n \n-for i in range(N - 1):\n- res += min(P[-1 - i], Q[-1 - i])\n+for i in range(H):\n+ res += (W + 1 - bisect_right(P, Q[i])) * Q[i]\n \n print(res)\n", "FL_content": " import sys\n input = sys.stdin.readline\n-from itertools import accumulate\n \n W, H = map(int,input().split())\n \n P = [int(input()) for _ in range(W)]\n Q = [int(input()) for _ in range(H)]\n \n P.sort()\n Q.sort()\n \n-cum_p = [0] + list(accumulate(P))\n-cum_q = [0] + list(accumulate(Q))\n-\n res = 0\n \n-N = min(len(cum_p), len(cum_q))\n-\n-for i in range(N):\n- res += cum_p[-1 - i] + cum_q[-1 - i]\n \n-for i in range(N - 1):\n- res += min(P[-1 - i], Q[-1 - i])\n \n print(res)\n", "added_lines": 5, "removed_lines": 10, "code1_lines": 26 }, { "user_id": "u584174687", "problem_id": "p03972", "submission1_id": "s390459019", "submission2_id": "s718084849", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter, defaultdict\nimport sys\nsys.setrecursionlimit(10 ** 5 + 10)\n\nfrom math import factorial\nimport heapq, bisect\nimport math\nimport itertools\n\n\nimport queue\nfrom collections import deque\n\n\n\n\ndef main():\n high, width = map(int, input().split())\n cost_w = [int(input()) for i in range(width)]\n cost_h = [int(input()) for i in range(high)]\n\n cost_w.sort()\n cost_h.sort()\n check_high, check_width = 0, 0\n width_ind = 0\n ans = 0\n for i in range(high):\n\n now_high = cost_h[i]\n while width_ind < width:\n if now_high < cost_w[width_ind]:\n break\n ans += (high + 1 - check_high) * cost_w[width_ind]\n check_width += 1\n width_ind += 1\n\n ans += (width + 1 - check_width) * cost_h[i]\n check_high += 1\n\n \n\n ans += sum(cost_w[width_ind:])\n\n print(ans)\n\n\n\n\n\n\n\nif __name__ == '__main__':\n main()\n\n", "code2": "from collections import Counter, defaultdict\nimport sys\nsys.setrecursionlimit(10 ** 5 + 10)\n\nfrom math import factorial\nimport heapq, bisect\nimport math\nimport itertools\n\n\nimport queue\nfrom collections import deque\n\n\n\n\ndef main():\n width, high = map(int, input().split())\n cost_w = [int(input()) for i in range(width)]\n cost_h = [int(input()) for i in range(high)]\n\n cost_w.sort()\n cost_h.sort()\n check_high, check_width = 0, 0\n width_ind = 0\n ans = 0\n for i in range(high):\n\n now_high = cost_h[i]\n while width_ind < width:\n if now_high < cost_w[width_ind]:\n break\n ans += (high + 1 - check_high) * cost_w[width_ind]\n check_width += 1\n width_ind += 1\n\n ans += (width + 1 - check_width) * cost_h[i]\n check_high += 1\n\n ans += sum(cost_w[width_ind:])\n\n print(ans)\n\n\n\n\n\n\n\nif __name__ == '__main__':\n main()\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1568324487", "date2": "1568325804", "bleu_score": "0.9860533300485703", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 74, "total_score": 102, "input": "1 3\n0\n2\n0\n7\n3\n1\n1\n", "actual_output": "11\n", "expected_output": "9\n\n", "anno_code": ["from collections import Counter, defaultdict\nimport sys\nsys.setrecursionlimit(10 ** 5 + 10) # (0): factorial=, heapq=, bisect=, math=, itertools=, queue=, deque=\n\nfrom math import factorial\nimport heapq, bisect\nimport math\nimport itertools\n\n\nimport queue\nfrom collections import deque\n\n\n\n\ndef main(): # (1): main=\n high, width = map(int, input().split())\n cost_w = [int(input()) for i in range(width)]\n cost_h = [int(input()) for i in range(high)]\n\n cost_w.sort()\n cost_h.sort()\n check_high, check_width = 0, 0\n width_ind = 0\n ans = 0\n for i in range(high):\n\n now_high = cost_h[i]\n while width_ind < width:\n if now_high < cost_w[width_ind]:\n break\n ans += (high + 1 - check_high) * cost_w[width_ind]\n check_width += 1\n width_ind += 1\n\n ans += (width + 1 - check_width) * cost_h[i]\n check_high += 1\n\n \n\n ans += sum(cost_w[width_ind:])\n\n print(ans)\n\n\n\n\n\n\n\nif __name__ == '__main__':\n main()\n\n"], "anno_status": [true], "diff_content": " from collections import Counter, defaultdict\n import sys\n sys.setrecursionlimit(10 ** 5 + 10)\n \n from math import factorial\n import heapq, bisect\n import math\n import itertools\n \n \n import queue\n from collections import deque\n \n \n \n \n def main():\n- high, width = map(int, input().split())\n+ width, high = map(int, input().split())\n cost_w = [int(input()) for i in range(width)]\n cost_h = [int(input()) for i in range(high)]\n \n cost_w.sort()\n cost_h.sort()\n check_high, check_width = 0, 0\n width_ind = 0\n ans = 0\n for i in range(high):\n \n now_high = cost_h[i]\n while width_ind < width:\n if now_high < cost_w[width_ind]:\n break\n ans += (high + 1 - check_high) * cost_w[width_ind]\n check_width += 1\n width_ind += 1\n \n ans += (width + 1 - check_width) * cost_h[i]\n check_high += 1\n \n- \n-\n ans += sum(cost_w[width_ind:])\n \n print(ans)\n \n \n \n \n \n \n \n if __name__ == '__main__':\n main()\n \n \n", "FL_content": " from collections import Counter, defaultdict\n import sys\n sys.setrecursionlimit(10 ** 5 + 10)\n \n from math import factorial\n import heapq, bisect\n import math\n import itertools\n \n \n import queue\n from collections import deque\n \n \n \n \n def main():\n- high, width = map(int, input().split())\n cost_w = [int(input()) for i in range(width)]\n cost_h = [int(input()) for i in range(high)]\n \n cost_w.sort()\n cost_h.sort()\n check_high, check_width = 0, 0\n width_ind = 0\n ans = 0\n for i in range(high):\n \n now_high = cost_h[i]\n while width_ind < width:\n if now_high < cost_w[width_ind]:\n break\n ans += (high + 1 - check_high) * cost_w[width_ind]\n check_width += 1\n width_ind += 1\n \n ans += (width + 1 - check_width) * cost_h[i]\n check_high += 1\n \n- \n-\n ans += sum(cost_w[width_ind:])\n \n print(ans)\n \n \n \n \n \n \n \n if __name__ == '__main__':\n main()\n \n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 55 }, { "user_id": "u283869437", "problem_id": "p03972", "submission1_id": "s815429233", "submission2_id": "s482038178", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W,H=map(int,input().split())\np=sorted(int(input())for _ in'_'*W)\np+=10**1000,\nq=sorted(int(input())for _ in'_'*H)\nq+=10**1000,\nz=i=j=0\nh,w=H+1,W+1\nwhile i, readstr=, readstrs=, readint=, readints=\ndef readstr():return readline().rstrip().decode()\ndef readstrs():return list(readline().decode().split())\ndef readint():return int(readline())\ndef readints():return list(map(int,readline().split()))\ndef printrows(x):print('\\n'.join(map(str,x))) # (2): printrows=\ndef printline(x):print(' '.join(map(str,x))) # (3): printline=, heapq=\n\nimport heapq\n\n\nw,h =readints() # (4): w=2, h=2\np = [readint() for i in range(w)] # (5): p=[3, 16]\nq = [readint() for i in range(h)] # (6): q=[2, 7]\n\nheapq.heapify(p) # (7): NO CHANGE\nheapq.heapify(q) # (8): NO CHANGE\n\nedge = 0 # (9): edge=0\ncost = 0 # (10): cost=0\nused = [0,0] # (11): used=[0, 0]\n\nwhile edge < (h+1)*(w+1)-1: # (12): NO CHANGE (22): NO CHANGE ... (52): NO CHANGE\n print(edge,cost) # (13): NO CHANGE (23): NO CHANGE ... (43): NO CHANGE\n if p and q: # (14): NO CHANGE (24): NO CHANGE ... (44): NO CHANGE\n if p[0]0:\n if p[i]>=q[j]:\n ans+=p[i]*(w-line)\n\n count-=w-line\n i+=1\n row+=1\n\n else:\n ans+=q[j]*(h-row)\n\n count-=h-row\n j+=1\n line+=1\nx=sum(p)*(h+1)+sum(q)*(w+1)\nprint(x-ans)\n", "code2": "w,h=map(int, input().split())\np=[int(input()) for i in range(w)]\nq=[int(input()) for i in range(h)]\np.append(0)\nq.append(0)\np.sort()\np.reverse()\nq.sort()\nq.reverse()\n\ncount=w*h\nrow=0\nline=0\ni=0\nj=0\nans=0\n\nwhile count>0:\n if p[i]>=q[j]:\n ans+=p[i]*(h-line)\n\n count-=h-line\n i+=1\n row+=1\n\n else:\n ans+=q[j]*(w-row)\n\n count-=w-row\n j+=1\n line+=1\nx=sum(p)*(h+1)+sum(q)*(w+1)\nprint(x-ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579666076", "date2": "1579666260", "bleu_score": "0.9773693717225111", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 51, "total_score": 102, "input": "2 4\n1\n6\n-2\n4\n4\n4\n1\n", "actual_output": "27\n", "expected_output": "28\n\n", "anno_code": ["h,w=map(int, input().split()) # (0): h=2, w=4\np=[int(input()) for i in range(w)] # (1): p=[1, 6, -2, 4]\nq=[int(input()) for i in range(h)] # (2): q=[4, 4]\np.append(0) # (3): p=[1, 6, -2, 4, 0]\nq.append(0) # (4): q=[4, 4, 0]\np.sort() # (5): p=[-2, 0, 1, 4, 6]\np.reverse() # (6): p=[6, 4, 1, 0, -2]\nq.sort() # (7): q=[0, 4, 4]\nq.reverse() # (8): q=[4, 4, 0]\n\ncount=h*w # (9): count=8\nrow=0 # (10): row=0\nline=0 # (11): line=0\ni=0 # (12): i=0\nj=0 # (13): j=0\nans=0 # (14): ans=0\n\nwhile count>0: # (15): NO CHANGE (21): NO CHANGE (27): NO CHANGE\n if p[i]>=q[j]: # (16): NO CHANGE (22): NO CHANGE\n ans+=p[i]*(w-line) # (17): ans=24 (23): ans=40\n\n count-=w-line # (18): count=4 (24): count=0\n i+=1 # (19): i=1 (25): i=2\n row+=1 # (20): row=1 (26): row=2\n\n else:\n ans+=q[j]*(h-row)\n\n count-=h-row\n j+=1\n line+=1\nx=sum(p)*(h+1)+sum(q)*(w+1) # (28): x=67\nprint(x-ans)\n"], "anno_status": [true], "diff_content": "-h,w=map(int, input().split())\n+w,h=map(int, input().split())\n p=[int(input()) for i in range(w)]\n q=[int(input()) for i in range(h)]\n p.append(0)\n q.append(0)\n p.sort()\n p.reverse()\n q.sort()\n q.reverse()\n \n-count=h*w\n+count=w*h\n row=0\n line=0\n i=0\n j=0\n ans=0\n \n while count>0:\n if p[i]>=q[j]:\n- ans+=p[i]*(w-line)\n+ ans+=p[i]*(h-line)\n \n- count-=w-line\n+ count-=h-line\n i+=1\n row+=1\n \n else:\n- ans+=q[j]*(h-row)\n+ ans+=q[j]*(w-row)\n \n- count-=h-row\n+ count-=w-row\n j+=1\n line+=1\n x=sum(p)*(h+1)+sum(q)*(w+1)\n print(x-ans)\n-\n", "FL_content": "-h,w=map(int, input().split())\n p=[int(input()) for i in range(w)]\n q=[int(input()) for i in range(h)]\n p.append(0)\n q.append(0)\n p.sort()\n p.reverse()\n q.sort()\n q.reverse()\n \n-count=h*w\n row=0\n line=0\n i=0\n j=0\n ans=0\n \n while count>0:\n if p[i]>=q[j]:\n- ans+=p[i]*(w-line)\n \n- count-=w-line\n i+=1\n row+=1\n \n else:\n- ans+=q[j]*(h-row)\n \n- count-=h-row\n j+=1\n line+=1\n x=sum(p)*(h+1)+sum(q)*(w+1)\n print(x-ans)\n-\n", "added_lines": 6, "removed_lines": 7, "code1_lines": 34 }, { "user_id": "u283869437", "problem_id": "p03972", "submission1_id": "s366542834", "submission2_id": "s482038178", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W,H=map(int,input().split())\np=sorted(int(input())for _ in'_'*W)\np+=10**18,\nq=sorted(int(input())for _ in'_'*H)\nq+=10**18,\nz=i=j=0\nh,w=H+1,W+1\nwhile i\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 w, h = LI()\n a = IR(w + h)\n a.sort()\n acc = list(itertools.accumulate(a))[::-1]\n ans = acc[0]\n for i in range(1, w + h, 2):\n ans += acc[i]\n print(ans)\n return\n\n\n\nif __name__ == '__main__':\n solve()\n"], "anno_status": [true], "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+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n def solve():\n w, h = LI()\n- a = IR(w + h)\n+ a = []\n+ x, y = 0, 1\n+ for _ in range(w):\n+ a.append((II(), x))\n+ for _ in range(h):\n+ a.append((II(), y))\n a.sort()\n- acc = list(itertools.accumulate(a))[::-1]\n- ans = acc[0]\n- for i in range(1, w + h, 2):\n- ans += acc[i]\n+ plus_x = h + 1\n+ plus_y = w + 1\n+ ans = 0\n+ for ai, xy in a:\n+ if xy:\n+ ans += ai * plus_y\n+ plus_x -= 1\n+ else:\n+ ans += ai * plus_x\n+ plus_y -= 1\n print(ans)\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 w, h = LI()\n- a = IR(w + h)\n a.sort()\n- acc = list(itertools.accumulate(a))[::-1]\n- ans = acc[0]\n- for i in range(1, w + h, 2):\n- ans += acc[i]\n print(ans)\n return\n \n \n \n if __name__ == '__main__':\n solve()\n \n", "added_lines": 89, "removed_lines": 5, "code1_lines": 42 }, { "user_id": "u591287669", "problem_id": "p03972", "submission1_id": "s095217309", "submission2_id": "s551927395", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h = map(int,input().split())\narr=[]\nfor i in range(w):\n arr.append( (int(input()),'p') )\nfor i in range(h):\n arr.append( (int(input()),'q') )\narr.sort()\nprint(arr)\nans=0\nfor a in arr:\n if a[1]=='p':\n ans+=a[0]*(h+1)\n w-=1\n else:\n ans+=a[0]*(w+1)\n h-=1\nprint(ans)\n", "code2": "w,h = map(int,input().split())\narr=[]\nfor i in range(w):\n arr.append( (int(input()),'p') )\nfor i in range(h):\n arr.append( (int(input()),'q') )\narr.sort()\n\nans=0\nfor a in arr:\n if a[1]=='p':\n ans+=a[0]*(h+1)\n w-=1\n else:\n ans+=a[0]*(w+1)\n h-=1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1476200683", "date2": "1476200714", "bleu_score": "0.9617081923707782", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 4\n1\n1\n-1\n1\n4\n0\n0\n", "actual_output": "[(-1, 'q'), (1, 'p'), (1, 'q'), (1, 'q'), (4, 'q')]\n8\n", "expected_output": "8\n\n", "anno_code": ["w,h = map(int,input().split()) # (0): w=1, h=4\narr=[] # (1): arr=[]\nfor i in range(w): # (2): i=0 (4): NO CHANGE\n arr.append( (int(input()),'p') ) # (3): arr=[(1, 'p')]\nfor i in range(h): # (5): NO CHANGE (7): i=1 ... (13): NO CHANGE\n arr.append( (int(input()),'q') ) # (6): arr=[(1, 'p'), (1, 'q')] (8): arr=[(1, 'p'), (1, 'q'), (-1, 'q')] ... (12): arr=[(1, 'p'), (1, 'q'), (-1, 'q'), (1, 'q'), (4, 'q')]\narr.sort() # (14): arr=[(-1, 'q'), (1, 'p'), (1, 'q'), (1, 'q'), (4, 'q')]\nprint(arr) # (15): NO CHANGE\nans=0 # (16): ans=0\nfor a in arr: # (17): a=(-1, 'q') (21): a=(1, 'p') ... (37): NO CHANGE\n if a[1]=='p': # (18): NO CHANGE (22): NO CHANGE ... (34): NO CHANGE\n ans+=a[0]*(h+1) # (23): ans=2\n w-=1 # (24): w=0\n else:\n ans+=a[0]*(w+1) # (19): ans=-2 (27): ans=3 ... (35): ans=8\n h-=1 # (20): h=3 (28): h=2 ... (36): h=0\nprint(ans)\n"], "anno_status": [true], "diff_content": " w,h = map(int,input().split())\n arr=[]\n for i in range(w):\n arr.append( (int(input()),'p') )\n for i in range(h):\n arr.append( (int(input()),'q') )\n arr.sort()\n-print(arr)\n+\n ans=0\n for a in arr:\n if a[1]=='p':\n ans+=a[0]*(h+1)\n w-=1\n else:\n ans+=a[0]*(w+1)\n h-=1\n print(ans)\n \n", "FL_content": " w,h = map(int,input().split())\n arr=[]\n for i in range(w):\n arr.append( (int(input()),'p') )\n for i in range(h):\n arr.append( (int(input()),'q') )\n arr.sort()\n-print(arr)\n ans=0\n for a in arr:\n if a[1]=='p':\n ans+=a[0]*(h+1)\n w-=1\n else:\n ans+=a[0]*(w+1)\n h-=1\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u476199965", "problem_id": "p03972", "submission1_id": "s916800039", "submission2_id": "s090421389", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h = list(map(int,input().split()))\npq = []\nfor i in range(w):\n pq.append((int(input()),0))\nfor i in range(h):\n pq.append((int(input()),1))\npq.sort()\nres = 0\nw+=1\nh+=1\ndic = {0:w,1:h}\n\nfor x in pq:\n print(dic[x[1]],x[0])\n res += dic[1-x[1]]*x[0]\n dic[x[1]] -= 1\n\nprint(res)\n", "code2": "w,h = list(map(int,input().split()))\npq = []\nfor i in range(w):\n pq.append((int(input()),0))\nfor i in range(h):\n pq.append((int(input()),1))\npq.sort()\nres = 0\nw+=1\nh+=1\ndic = {0:w,1:h}\n\nfor x in pq:\n res += dic[1-x[1]]*x[0]\n dic[x[1]] -= 1\n\nprint(res)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1534380983", "date2": "1534381033", "bleu_score": "0.9062094229560552", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 2\n3\n9\n0\n7\n", "actual_output": "3 0\n3 3\n2 7\n2 9\n29\n", "expected_output": "29\n\n", "anno_code": ["w,h = list(map(int,input().split())) # (0): w=2, h=2\npq = [] # (1): pq=[]\nfor i in range(w): # (2): i=0 (4): i=1 (6): NO CHANGE\n pq.append((int(input()),0)) # (3): pq=[(3, 0)] (5): pq=[(3, 0), (9, 0)]\nfor i in range(h): # (7): i=0 (9): i=1 (11): NO CHANGE\n pq.append((int(input()),1)) # (8): pq=[(3, 0), (9, 0), (0, 1)] (10): pq=[(3, 0), (9, 0), (0, 1), (7, 1)]\npq.sort() # (12): pq=[(0, 1), (3, 0), (7, 1), (9, 0)]\nres = 0 # (13): res=0\nw+=1 # (14): w=3\nh+=1 # (15): h=3\ndic = {0:w,1:h} # (16): dic={0: 3, 1: 3}\n\nfor x in pq: # (17): x=(0, 1) (21): x=(3, 0) ... (33): NO CHANGE\n print(dic[x[1]],x[0]) # (18): NO CHANGE (22): NO CHANGE ... (30): NO CHANGE\n res += dic[1-x[1]]*x[0] # (19): NO CHANGE (23): res=6 ... (31): res=29\n dic[x[1]] -= 1 # (20): dic={0: 3, 1: 2} (24): dic={0: 2, 1: 2} ... (32): dic={0: 1, 1: 1}\n\nprint(res)\n"], "anno_status": [true], "diff_content": " w,h = list(map(int,input().split()))\n pq = []\n for i in range(w):\n pq.append((int(input()),0))\n for i in range(h):\n pq.append((int(input()),1))\n pq.sort()\n res = 0\n w+=1\n h+=1\n dic = {0:w,1:h}\n \n for x in pq:\n- print(dic[x[1]],x[0])\n res += dic[1-x[1]]*x[0]\n dic[x[1]] -= 1\n \n print(res)\n \n", "FL_content": " w,h = list(map(int,input().split()))\n pq = []\n for i in range(w):\n pq.append((int(input()),0))\n for i in range(h):\n pq.append((int(input()),1))\n pq.sort()\n res = 0\n w+=1\n h+=1\n dic = {0:w,1:h}\n \n for x in pq:\n- print(dic[x[1]],x[0])\n res += dic[1-x[1]]*x[0]\n dic[x[1]] -= 1\n \n print(res)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u389910364", "problem_id": "p03972", "submission1_id": "s410984562", "submission2_id": "s773558663", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\nH, W = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\nedges = []\nfor p in P:\n edges.append((p, 'P'))\nfor q in Q:\n edges.append((q, 'Q'))\nedges.sort()\n\nans = 0\nv_nodes = W + 1\nh_nodes = H + 1\nfor e, pq in edges:\n if pq == 'P':\n ans += e * h_nodes\n v_nodes -= 1\n else:\n ans += e * v_nodes\n h_nodes -= 1\n\nprint(ans)\n", "code2": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n\nW,H = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\nedges = []\nfor p in P:\n edges.append((p, 'P'))\nfor q in Q:\n edges.append((q, 'Q'))\nedges.sort()\n\nans = 0\na = W + 1\nb = H + 1\nfor e, pq in edges:\n if pq == 'P':\n ans += e * b\n a -= 1\n else:\n ans += e * a\n b -= 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571705563", "date2": "1571705713", "bleu_score": "0.9065121814582632", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 74, "total_score": 102, "input": "4 2\n0\n0\n0\n3\n31\n2\n0\n", "actual_output": "36\n", "expected_output": "41\n\n", "anno_code": ["import os\nimport sys\n\nif os.getenv(\"LOCAL\"): # (0): NO CHANGE\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(2147483647) # (1): NO CHANGE\nINF = float(\"inf\") # (2): INF=inf\nIINF = 10 ** 18 # (3): IINF=1000000000000000000\nMOD = 10 ** 9 + 7 # (4): MOD=1000000007\n\nH, W = list(map(int, sys.stdin.readline().split())) # (5): H=4, W=2\nP = [int(sys.stdin.readline()) for _ in range(W)] # (6): P=[0, 0]\nQ = [int(sys.stdin.readline()) for _ in range(H)] # (7): Q=[0, 3, 31, 2]\n\nedges = [] # (8): edges=[]\nfor p in P: # (9): p=0 (11): NO CHANGE (13): NO CHANGE\n edges.append((p, 'P')) # (10): edges=[(0, 'P')] (12): edges=[(0, 'P'), (0, 'P')]\nfor q in Q: # (14): q=0 (16): q=3 ... (22): NO CHANGE\n edges.append((q, 'Q')) # (15): edges=[(0, 'P'), (0, 'P'), (0, 'Q')] (17): edges=[(0, 'P'), (0, 'P'), (0, 'Q'), (3, 'Q')] ... (21): edges=[(0, 'P'), (0, 'P'), (0, 'Q'), (3, 'Q'), (31, 'Q'), (2, 'Q')]\nedges.sort() # (23): edges=[(0, 'P'), (0, 'P'), (0, 'Q'), (2, 'Q'), (3, 'Q'), (31, 'Q')]\n\nans = 0 # (24): ans=0\nv_nodes = W + 1 # (25): v_nodes=3\nh_nodes = H + 1 # (26): h_nodes=5\nfor e, pq in edges: # (27): e=0, pq=P (31): NO CHANGE ... (51): NO CHANGE\n if pq == 'P': # (28): NO CHANGE (32): NO CHANGE ... (48): NO CHANGE\n ans += e * h_nodes # (29): NO CHANGE (33): NO CHANGE\n v_nodes -= 1 # (30): v_nodes=2 (34): v_nodes=1\n else:\n ans += e * v_nodes # (37): NO CHANGE (41): ans=2 ... (49): ans=36\n h_nodes -= 1 # (38): h_nodes=4 (42): h_nodes=3 ... (50): h_nodes=1\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(2147483647)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n-H, W = list(map(int, sys.stdin.readline().split()))\n+\n+W,H = list(map(int, sys.stdin.readline().split()))\n P = [int(sys.stdin.readline()) for _ in range(W)]\n Q = [int(sys.stdin.readline()) for _ in range(H)]\n \n edges = []\n for p in P:\n edges.append((p, 'P'))\n for q in Q:\n edges.append((q, 'Q'))\n edges.sort()\n \n ans = 0\n-v_nodes = W + 1\n-h_nodes = H + 1\n+a = W + 1\n+b = H + 1\n for e, pq in edges:\n if pq == 'P':\n- ans += e * h_nodes\n- v_nodes -= 1\n+ ans += e * b\n+ a -= 1\n else:\n- ans += e * v_nodes\n- h_nodes -= 1\n-\n+ ans += e * a\n+ b -= 1\n print(ans)\n \n", "FL_content": " import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(2147483647)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n-H, W = list(map(int, sys.stdin.readline().split()))\n P = [int(sys.stdin.readline()) for _ in range(W)]\n Q = [int(sys.stdin.readline()) for _ in range(H)]\n \n edges = []\n for p in P:\n edges.append((p, 'P'))\n for q in Q:\n edges.append((q, 'Q'))\n edges.sort()\n \n ans = 0\n-v_nodes = W + 1\n-h_nodes = H + 1\n for e, pq in edges:\n if pq == 'P':\n- ans += e * h_nodes\n- v_nodes -= 1\n else:\n- ans += e * v_nodes\n- h_nodes -= 1\n-\n print(ans)\n \n", "added_lines": 8, "removed_lines": 8, "code1_lines": 35 }, { "user_id": "u620480037", "problem_id": "p03096", "submission1_id": "s552533018", "submission2_id": "s754084943", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput=sys.stdin.readline\n\nN=int(input())\nL=[]\nfor i in range(N):\n n=int(input())\n L.append(n)\n \ndp=[0 for i in range(N)]\ndp[0]=1\nD=dict()\nD[L[0]]=1\nfor i in range(1,N):\n if L[i] not in D:\n D[L[i]]=1\n dp[i]=dp[i-1]\n else:\n if L[i]==L[i-1]:\n dp[i]=dp[i-1]\n else:\n dp[i]=dp[i-1]+D[L[i]]\n D[L[i]]+=1\nprint(dp[-1])", "code2": "N=int(input())\nL=[]\nfor i in range(N):\n n=int(input())\n L.append(n)\n\ndp=[0 for i in range(N)]\ndp[0]=1\nmod=10**9+7\nD=dict()\nD[L[0]]=1\nfor i in range(1,N):\n if L[i]==L[i-1]:\n dp[i]=dp[i-1]\n elif L[i] not in D:\n D[L[i]]=dp[i-1]\n dp[i]=dp[i-1]\n else:\n dp[i]=dp[i-1]+D[L[i]]\n dp[i]%=mod\n D[L[i]]=dp[i]\n \nprint(dp[-1]%mod)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1568751508", "date2": "1569076346", "bleu_score": "0.8360949072283462", "code1_test_status": [1, 1, 1, 1, 0, 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, 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, 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, 0], "code1_test_score": 94, "total_score": 103, "input": "6\n2\n1\n2\n8\n2\n8\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["import sys\ninput=sys.stdin.readline # (0): input=\n\nN=int(input()) # (1): N=6\nL=[] # (2): L=[]\nfor i in range(N): # (3): i=0 (6): i=1 ... (21): NO CHANGE\n n=int(input()) # (4): n=2 (7): n=1 ... (19): n=8\n L.append(n) # (5): L=[2] (8): L=[2, 1] ... (20): L=[2, 1, 2, 8, 2, 8]\n \ndp=[0 for i in range(N)] # (22): dp=[0, 0, 0, 0, 0, 0]\ndp[0]=1 # (23): dp=[1, 0, 0, 0, 0, 0]\nD=dict() # (24): D={}\nD[L[0]]=1 # (25): D={2: 1}\nfor i in range(1,N): # (26): i=1 (30): i=2 ... (49): NO CHANGE\n if L[i] not in D: # (27): NO CHANGE (31): NO CHANGE ... (45): NO CHANGE\n D[L[i]]=1 # (28): D={2: 1, 1: 1} (37): D={2: 2, 1: 1, 8: 1}\n dp[i]=dp[i-1] # (29): dp=[1, 1, 0, 0, 0, 0] (38): dp=[1, 1, 2, 2, 0, 0]\n else:\n if L[i]==L[i-1]: # (32): NO CHANGE (41): NO CHANGE (46): NO CHANGE\n dp[i]=dp[i-1]\n else:\n dp[i]=dp[i-1]+D[L[i]] # (33): dp=[1, 1, 2, 0, 0, 0] (42): dp=[1, 1, 2, 2, 4, 0] (47): dp=[1, 1, 2, 2, 4, 5]\n D[L[i]]+=1 # (34): D={2: 2, 1: 1} (43): D={2: 3, 1: 1, 8: 1} (48): D={2: 3, 1: 1, 8: 2}\nprint(dp[-1])"], "anno_status": [true], "diff_content": "-import sys\n-input=sys.stdin.readline\n-\n N=int(input())\n L=[]\n for i in range(N):\n n=int(input())\n L.append(n)\n- \n+\n dp=[0 for i in range(N)]\n dp[0]=1\n+mod=10**9+7\n D=dict()\n D[L[0]]=1\n for i in range(1,N):\n- if L[i] not in D:\n- D[L[i]]=1\n+ if L[i]==L[i-1]:\n+ dp[i]=dp[i-1]\n+ elif L[i] not in D:\n+ D[L[i]]=dp[i-1]\n dp[i]=dp[i-1]\n else:\n- if L[i]==L[i-1]:\n- dp[i]=dp[i-1]\n- else:\n- dp[i]=dp[i-1]+D[L[i]]\n- D[L[i]]+=1\n-print(dp[-1])\n+ dp[i]=dp[i-1]+D[L[i]]\n+ dp[i]%=mod\n+ D[L[i]]=dp[i]\n+ \n+print(dp[-1]%mod)\n+\n", "FL_content": "-import sys\n-input=sys.stdin.readline\n-\n N=int(input())\n L=[]\n for i in range(N):\n n=int(input())\n L.append(n)\n- \n dp=[0 for i in range(N)]\n dp[0]=1\n D=dict()\n D[L[0]]=1\n for i in range(1,N):\n- if L[i] not in D:\n- D[L[i]]=1\n dp[i]=dp[i-1]\n else:\n- if L[i]==L[i-1]:\n- dp[i]=dp[i-1]\n- else:\n- dp[i]=dp[i-1]+D[L[i]]\n- D[L[i]]+=1\n-print(dp[-1])\n", "added_lines": 12, "removed_lines": 12, "code1_lines": 24 }, { "user_id": "u925364229", "problem_id": "p03096", "submission1_id": "s166339565", "submission2_id": "s091667802", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nC = [0] * N\nmod = 10 ** 9 + 7\ndic = [-1]*(2*(10**5)+1)\nprevIdx = [0] * N\nfor i in range(N):\n C[i] = int(input())\n if i > 0 and C[i] == C[i-1]:\n continue\n prevIdx[i] = dic[C[i]]\n dic[C[i]] = i\n\ndp = [0] * N\ndp[0] = 1\nacc = [0] * N\nacc[0] = 1\nfor i in range(1,N):\n dp[i] = dp[i-1] % mod\n if C[i] == C[i-1] or prevIdx[i] == -1:\n acc[i] = 1\n continue\n \n dp[i] += acc[prevIdx[i]]\n acc[i] = acc[prevIdx[i]] + dp[i-1]\n acc[i] %= mod\n dp[i] %= mod\n\nprint(dp[N-1] % mod)", "code2": "N = int(input())\nC = [0] * N\nmod = 10 ** 9 + 7\ndic = [-1]*(2*(10**5)+1)\nprevIdx = [0] * N\nfor i in range(N):\n C[i] = int(input())\n if i > 0 and C[i] == C[i-1]:\n continue\n prevIdx[i] = dic[C[i]]\n dic[C[i]] = i\n\ndp = [0] * N\ndp[0] = 1\nacc = [0] * N\nacc[0] = 1\nfor i in range(1,N):\n dp[i] = dp[i-1] % mod\n if C[i] == C[i-1] or prevIdx[i] == -1:\n acc[i] = dp[i-1]\n continue\n \n dp[i] += acc[prevIdx[i]]\n acc[i] = acc[prevIdx[i]] + dp[i-1]\n acc[i] %= mod\n dp[i] %= mod\n\nprint(dp[N-1] % mod)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552774771", "date2": "1552774884", "bleu_score": "0.9846129023635802", "code1_test_status": [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, 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, 1, 1, 1, 1, 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": 96, "total_score": 103, "input": "7\n1\n3\n1\n2\n4\n3\n2\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["N = int(input()) # (0): N=7\nC = [0] * N # (1): C=[0, 0, 0, 0, 0, 0, 0]\nmod = 10 ** 9 + 7 # (2): mod=1000000007\ndic = [-1]*(2*(10**5)+1) # (3): dic=[-1, -1, ..., -1, -1]\nprevIdx = [0] * N # (4): prevIdx=[0, 0, 0, 0, 0, 0, 0]\nfor i in range(N): # (5): i=0 (10): i=1 ... (40): NO CHANGE\n C[i] = int(input()) # (6): C=[1, 0, 0, 0, 0, 0, 0] (11): C=[1, 3, 0, 0, 0, 0, 0] ... (36): C=[1, 3, 1, 2, 4, 3, 2]\n if i > 0 and C[i] == C[i-1]: # (7): NO CHANGE (12): NO CHANGE ... (37): NO CHANGE\n continue\n prevIdx[i] = dic[C[i]] # (8): prevIdx=[-1, 0, 0, 0, 0, 0, 0] (13): prevIdx=[-1, -1, 0, 0, 0, 0, 0] ... (38): prevIdx=[-1, -1, 0, -1, -1, 1, 3]\n dic[C[i]] = i # (9): dic=[-1, 0, ..., -1, -1] (14): dic=[-1, 0, ..., -1, -1] ... (39): dic=[-1, 2, ..., -1, -1]\n\ndp = [0] * N # (41): dp=[0, 0, 0, 0, 0, 0, 0]\ndp[0] = 1 # (42): dp=[1, 0, 0, 0, 0, 0, 0]\nacc = [0] * N # (43): acc=[0, 0, 0, 0, 0, 0, 0]\nacc[0] = 1 # (44): acc=[1, 0, 0, 0, 0, 0, 0]\nfor i in range(1,N): # (45): i=1 (50): i=2 ... (81): NO CHANGE\n dp[i] = dp[i-1] % mod # (46): dp=[1, 1, 0, 0, 0, 0, 0] (51): dp=[1, 1, 1, 0, 0, 0, 0] ... (75): dp=[1, 1, 2, 2, 2, 3, 3]\n if C[i] == C[i-1] or prevIdx[i] == -1: # (47): NO CHANGE (52): NO CHANGE ... (76): NO CHANGE\n acc[i] = 1 # (48): acc=[1, 1, 0, 0, 0, 0, 0] (60): acc=[1, 1, 2, 1, 0, 0, 0] (65): acc=[1, 1, 2, 1, 1, 0, 0]\n continue # (49): NO CHANGE (61): NO CHANGE (66): NO CHANGE\n \n dp[i] += acc[prevIdx[i]] # (53): dp=[1, 1, 2, 0, 0, 0, 0] (70): dp=[1, 1, 2, 2, 2, 3, 0] (77): dp=[1, 1, 2, 2, 2, 3, 4]\n acc[i] = acc[prevIdx[i]] + dp[i-1] # (54): acc=[1, 1, 2, 0, 0, 0, 0] (71): acc=[1, 1, 2, 1, 1, 3, 0] (78): acc=[1, 1, 2, 1, 1, 3, 4]\n acc[i] %= mod # (55): NO CHANGE (72): NO CHANGE (79): NO CHANGE\n dp[i] %= mod # (56): NO CHANGE (73): NO CHANGE (80): NO CHANGE\n\nprint(dp[N-1] % mod)"], "anno_status": [true], "diff_content": " N = int(input())\n C = [0] * N\n mod = 10 ** 9 + 7\n dic = [-1]*(2*(10**5)+1)\n prevIdx = [0] * N\n for i in range(N):\n C[i] = int(input())\n if i > 0 and C[i] == C[i-1]:\n continue\n prevIdx[i] = dic[C[i]]\n dic[C[i]] = i\n \n dp = [0] * N\n dp[0] = 1\n acc = [0] * N\n acc[0] = 1\n for i in range(1,N):\n dp[i] = dp[i-1] % mod\n if C[i] == C[i-1] or prevIdx[i] == -1:\n- acc[i] = 1\n+ acc[i] = dp[i-1]\n continue\n \n dp[i] += acc[prevIdx[i]]\n acc[i] = acc[prevIdx[i]] + dp[i-1]\n acc[i] %= mod\n dp[i] %= mod\n \n print(dp[N-1] % mod)\n", "FL_content": " N = int(input())\n C = [0] * N\n mod = 10 ** 9 + 7\n dic = [-1]*(2*(10**5)+1)\n prevIdx = [0] * N\n for i in range(N):\n C[i] = int(input())\n if i > 0 and C[i] == C[i-1]:\n continue\n prevIdx[i] = dic[C[i]]\n dic[C[i]] = i\n \n dp = [0] * N\n dp[0] = 1\n acc = [0] * N\n acc[0] = 1\n for i in range(1,N):\n dp[i] = dp[i-1] % mod\n if C[i] == C[i-1] or prevIdx[i] == -1:\n- acc[i] = 1\n continue\n \n dp[i] += acc[prevIdx[i]]\n acc[i] = acc[prevIdx[i]] + dp[i-1]\n acc[i] %= mod\n dp[i] %= mod\n \n print(dp[N-1] % mod)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 28 }, { "user_id": "u263830634", "problem_id": "p03096", "submission1_id": "s505010763", "submission2_id": "s118576857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nINF = 10 ** 9\nMOD = 10 **9 + 7\n\nN = int(input())\n\nC = [int(input()) for _ in range(N)]\nlst = [INF] * (2 * 10 ** 5 + 10) \nans = [1] * N\n \nlst[C[-1]] = N - 1\n\nfor i in range(N - 2, -1, -1):\n c = C[i]\n if lst[c] == INF or lst[c] == i + 1:\n ans[i] = ans[i + 1]\n else:\n ans[i] = ans[i + 1] + ans[lst[c]]\n lst[c] = i\n\nprint (ans)\nprint (ans[0] % MOD)", "code2": "import sys\ninput = sys.stdin.readline\n\nINF = 10 ** 9\nMOD = 10 **9 + 7\n\nN = int(input())\n\nC = [int(input()) for _ in range(N)]\nlst = [INF] * (2 * 10 ** 5 + 10) \nans = [1] * N\n \nlst[C[-1]] = N - 1\n\nfor i in range(N - 2, -1, -1):\n c = C[i]\n if lst[c] == INF or lst[c] == i + 1:\n ans[i] = ans[i + 1]\n else:\n ans[i] = ans[i + 1] + ans[lst[c]]\n lst[c] = i\n\n\nprint (ans[0] % MOD)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579353892", "date2": "1579354034", "bleu_score": "0.9702807094552762", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n2\n2\n2\n8\n2\n8\n", "actual_output": "[3, 3, 3, 2, 1, 1]\n3\n", "expected_output": "3\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nINF = 10 ** 9 # (1): INF=1000000000\nMOD = 10 **9 + 7 # (2): MOD=1000000007\n\nN = int(input()) # (3): N=6\n\nC = [int(input()) for _ in range(N)] # (4): C=[2, 2, 2, 8, 2, 8]\nlst = [INF] * (2 * 10 ** 5 + 10) # (5): lst=[1000000000, 1000000000, ..., 1000000000, 1000000000]\nans = [1] * N # (6): ans=[1, 1, 1, 1, 1, 1]\n \nlst[C[-1]] = N - 1 # (7): lst=[1000000000, 1000000000, ..., 1000000000, 1000000000]\n\nfor i in range(N - 2, -1, -1): # (8): i=4 (13): i=3 ... (33): NO CHANGE\n c = C[i] # (9): c=2 (14): c=8 ... (29): NO CHANGE\n if lst[c] == INF or lst[c] == i + 1: # (10): NO CHANGE (15): NO CHANGE ... (30): NO CHANGE\n ans[i] = ans[i + 1] # (11): NO CHANGE (26): ans=[1, 3, 3, 2, 1, 1] (31): ans=[3, 3, 3, 2, 1, 1]\n else:\n ans[i] = ans[i + 1] + ans[lst[c]] # (16): ans=[1, 1, 1, 2, 1, 1] (21): ans=[1, 1, 3, 2, 1, 1]\n lst[c] = i # (12): lst=[1000000000, 1000000000, ..., 1000000000, 1000000000] (17): lst=[1000000000, 1000000000, ..., 1000000000, 1000000000] ... (32): lst=[1000000000, 1000000000, ..., 1000000000, 1000000000]\n\nprint (ans) # (34): NO CHANGE\nprint (ans[0] % MOD)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n INF = 10 ** 9\n MOD = 10 **9 + 7\n \n N = int(input())\n \n C = [int(input()) for _ in range(N)]\n lst = [INF] * (2 * 10 ** 5 + 10) \n ans = [1] * N\n \n lst[C[-1]] = N - 1\n \n for i in range(N - 2, -1, -1):\n c = C[i]\n if lst[c] == INF or lst[c] == i + 1:\n ans[i] = ans[i + 1]\n else:\n ans[i] = ans[i + 1] + ans[lst[c]]\n lst[c] = i\n \n-print (ans)\n+\n print (ans[0] % MOD)\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n INF = 10 ** 9\n MOD = 10 **9 + 7\n \n N = int(input())\n \n C = [int(input()) for _ in range(N)]\n lst = [INF] * (2 * 10 ** 5 + 10) \n ans = [1] * N\n \n lst[C[-1]] = N - 1\n \n for i in range(N - 2, -1, -1):\n c = C[i]\n if lst[c] == INF or lst[c] == i + 1:\n ans[i] = ans[i + 1]\n else:\n ans[i] = ans[i + 1] + ans[lst[c]]\n lst[c] = i\n \n-print (ans)\n print (ans[0] % MOD)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u200785298", "problem_id": "p03096", "submission1_id": "s213854701", "submission2_id": "s565472854", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\nMOD = 1000000007 \n\ndef solve(N, C):\n last = [-1] * (N + 1)\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n if c > N:\n return\n else:\n raise Exception()\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n print(0)\n return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\n\nMOD = 1000000007 \nMAX_N = 200000\n\ndef solve(N, C):\n last = [-1] * MAX_N\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n if c >= N:\n return\n else:\n raise Exception()\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553765860", "date2": "1553765926", "bleu_score": "0.9688067884179661", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n4\n6\n2\n2\n8\n3\n2\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["\nimport sys\n\nMOD = 1000000007 # (0): MOD=1000000007\n\ndef solve(N, C): # (1): solve=\n last = [-1] * (N + 1)\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n if c > N:\n return\n else:\n raise Exception()\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n print(0)\n return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\n return\n\n\n\ndef main(): # (2): 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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n \n MOD = 1000000007 \n+MAX_N = 200000\n \n def solve(N, C):\n- last = [-1] * (N + 1)\n+ last = [-1] * MAX_N\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n- if c > N:\n+ if c >= N:\n return\n else:\n raise Exception()\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n- print(0)\n- return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n \n MOD = 1000000007 \n \n def solve(N, C):\n- last = [-1] * (N + 1)\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n- if c > N:\n return\n else:\n raise Exception()\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n- print(0)\n- return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 51 }, { "user_id": "u925364229", "problem_id": "p03096", "submission1_id": "s556813886", "submission2_id": "s091667802", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nC = [0] * N\nmod = 10 ** 9 + 7\ndic = {}\nfor i in range(N):\n C[i] = int(input())\n if not C[i] in dic:\n dic[C[i]] = [ i ]\n else:\n dic[C[i]].append(i)\n\ndp = [0] * N\ndp[0] = 1\nfor i in range(1,N):\n dp[i] = dp[i-1]\n if C[i] == C[i-1]:\n continue\n\n for prev in dic[C[i]]:\n if prev < i:\n if prev > 0:\n dp[i] += dp[prev-1]\n else:\n dp[i] += 1\n\nprint(dp[N-1])", "code2": "N = int(input())\nC = [0] * N\nmod = 10 ** 9 + 7\ndic = [-1]*(2*(10**5)+1)\nprevIdx = [0] * N\nfor i in range(N):\n C[i] = int(input())\n if i > 0 and C[i] == C[i-1]:\n continue\n prevIdx[i] = dic[C[i]]\n dic[C[i]] = i\n\ndp = [0] * N\ndp[0] = 1\nacc = [0] * N\nacc[0] = 1\nfor i in range(1,N):\n dp[i] = dp[i-1] % mod\n if C[i] == C[i-1] or prevIdx[i] == -1:\n acc[i] = dp[i-1]\n continue\n \n dp[i] += acc[prevIdx[i]]\n acc[i] = acc[prevIdx[i]] + dp[i-1]\n acc[i] %= mod\n dp[i] %= mod\n\nprint(dp[N-1] % mod)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552772503", "date2": "1552774884", "bleu_score": "0.6409718577479592", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 103, "input": "6\n2\n2\n2\n8\n2\n8\n", "actual_output": "5\n", "expected_output": "3\n\n", "anno_code": ["N = int(input()) # (0): N=6\nC = [0] * N # (1): C=[0, 0, 0, 0, 0, 0]\nmod = 10 ** 9 + 7 # (2): mod=1000000007\ndic = {} # (3): dic={}\nfor i in range(N): # (4): i=0 (8): i=1 ... (28): NO CHANGE\n C[i] = int(input()) # (5): C=[2, 0, 0, 0, 0, 0] (9): C=[2, 2, 0, 0, 0, 0] ... (25): C=[2, 2, 2, 8, 2, 8]\n if not C[i] in dic: # (6): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n dic[C[i]] = [ i ] # (7): dic={2: [0]} (19): dic={2: [0, 1, 2], 8: [3]}\n else:\n dic[C[i]].append(i) # (11): dic={2: [0, 1]} (15): dic={2: [0, 1, 2]} ... (27): dic={2: [0, 1, 2, 4], 8: [3, 5]}\n\ndp = [0] * N # (29): dp=[0, 0, 0, 0, 0, 0]\ndp[0] = 1 # (30): dp=[1, 0, 0, 0, 0, 0]\nfor i in range(1,N): # (31): i=1 (35): i=2 ... (75): NO CHANGE\n dp[i] = dp[i-1] # (32): dp=[1, 1, 0, 0, 0, 0] (36): dp=[1, 1, 1, 0, 0, 0] ... (66): dp=[1, 1, 1, 1, 4, 4]\n if C[i] == C[i-1]: # (33): NO CHANGE (37): NO CHANGE ... (67): NO CHANGE\n continue # (34): NO CHANGE (38): NO CHANGE\n\n for prev in dic[C[i]]: # (42): prev=3 (44): prev=5 ... (74): NO CHANGE\n if prev < i: # (43): NO CHANGE (45): NO CHANGE ... (73): NO CHANGE\n if prev > 0: # (52): NO CHANGE (56): NO CHANGE ... (70): NO CHANGE\n dp[i] += dp[prev-1] # (57): dp=[1, 1, 1, 1, 3, 0] (61): dp=[1, 1, 1, 1, 4, 0] (71): dp=[1, 1, 1, 1, 4, 5]\n else:\n dp[i] += 1 # (53): dp=[1, 1, 1, 1, 2, 0]\n\nprint(dp[N-1])"], "anno_status": [true], "diff_content": " N = int(input())\n C = [0] * N\n mod = 10 ** 9 + 7\n-dic = {}\n+dic = [-1]*(2*(10**5)+1)\n+prevIdx = [0] * N\n for i in range(N):\n C[i] = int(input())\n- if not C[i] in dic:\n- dic[C[i]] = [ i ]\n- else:\n- dic[C[i]].append(i)\n+ if i > 0 and C[i] == C[i-1]:\n+ continue\n+ prevIdx[i] = dic[C[i]]\n+ dic[C[i]] = i\n \n dp = [0] * N\n dp[0] = 1\n+acc = [0] * N\n+acc[0] = 1\n for i in range(1,N):\n- dp[i] = dp[i-1]\n- if C[i] == C[i-1]:\n+ dp[i] = dp[i-1] % mod\n+ if C[i] == C[i-1] or prevIdx[i] == -1:\n+ acc[i] = dp[i-1]\n continue\n+ \n+ dp[i] += acc[prevIdx[i]]\n+ acc[i] = acc[prevIdx[i]] + dp[i-1]\n+ acc[i] %= mod\n+ dp[i] %= mod\n \n- for prev in dic[C[i]]:\n- if prev < i:\n- if prev > 0:\n- dp[i] += dp[prev-1]\n- else:\n- dp[i] += 1\n-\n-print(dp[N-1])\n+print(dp[N-1] % mod)\n", "FL_content": " N = int(input())\n C = [0] * N\n mod = 10 ** 9 + 7\n-dic = {}\n for i in range(N):\n C[i] = int(input())\n- if not C[i] in dic:\n- dic[C[i]] = [ i ]\n- else:\n- dic[C[i]].append(i)\n \n dp = [0] * N\n dp[0] = 1\n for i in range(1,N):\n- dp[i] = dp[i-1]\n- if C[i] == C[i-1]:\n continue\n \n- for prev in dic[C[i]]:\n- if prev < i:\n- if prev > 0:\n- dp[i] += dp[prev-1]\n- else:\n- dp[i] += 1\n-\n-print(dp[N-1])\n", "added_lines": 17, "removed_lines": 15, "code1_lines": 26 }, { "user_id": "u588794534", "problem_id": "p03096", "submission1_id": "s490290894", "submission2_id": "s294578785", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ncc=[int(input()) for _ in range(n)]\n\n\nc=[cc[0]]\nfor i in range(1,n):\n if cc[i]!=cc[i-1]:\n c.append(cc[i])\n\nn=len(c)\n\nright_index=[-1]*n\ntmp_right_index=[-1]*(max(c)+1)\n\nfor i in range(n):\n if tmp_right_index[c[i]]==-1:\n tmp_right_index[c[i]]=i\n else:\n right_index[i]=tmp_right_index[c[i]]\n tmp_right_index[c[i]]=i\n\ndp=[0]*n\nmod=10**9+7\nprint(0,c)\nfor i in range(n):\n if i==0:\n dp[i]=1\n else:\n if right_index[i]==-1:\n dp[i]+=dp[i-1]%mod\n else:\n dp[i]+=dp[i-1]+dp[right_index[i]]%mod\n\nprint(dp[-1]%mod)\n\n\n\n\n\n\n\n \n\n", "code2": "n=int(input())\ncc=[int(input()) for _ in range(n)]\n\n\nc=[cc[0]]\nfor i in range(1,n):\n if cc[i]!=cc[i-1]:\n c.append(cc[i])\n\nn=len(c)\n\nright_index=[-1]*n\ntmp_right_index=[-1]*(max(c)+1)\n\nfor i in range(n):\n if tmp_right_index[c[i]]==-1:\n tmp_right_index[c[i]]=i\n else:\n right_index[i]=tmp_right_index[c[i]]\n tmp_right_index[c[i]]=i\n\ndp=[0]*n\nmod=10**9+7\n\nfor i in range(n):\n if i==0:\n dp[i]=1\n else:\n if right_index[i]==-1:\n dp[i]+=dp[i-1]%mod\n else:\n dp[i]+=dp[i-1]+dp[right_index[i]]%mod\n\nprint(dp[-1]%mod)\n\n\n\n\n\n\n\n \n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598390858", "date2": "1598390890", "bleu_score": "0.9811570865175778", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n1\n2\n2\n2\n2\n6\n2\n", "actual_output": "0 [1, 2, 6, 2]\n2\n", "expected_output": "2\n\n", "anno_code": ["n=int(input()) # (0): n=7\ncc=[int(input()) for _ in range(n)] # (1): cc=[1, 2, 2, 2, 2, 6, 2]\n\n\nc=[cc[0]] # (2): c=[1]\nfor i in range(1,n): # (3): i=1 (6): i=2 ... (18): NO CHANGE\n if cc[i]!=cc[i-1]: # (4): NO CHANGE (7): NO CHANGE ... (16): NO CHANGE\n c.append(cc[i]) # (5): c=[1, 2] (14): c=[1, 2, 6] (17): c=[1, 2, 6, 2]\n\nn=len(c) # (19): n=4\n\nright_index=[-1]*n # (20): right_index=[-1, -1, -1, -1]\ntmp_right_index=[-1]*(max(c)+1) # (21): tmp_right_index=[-1, -1, -1, -1, -1, -1, -1]\n\nfor i in range(n): # (22): i=0 (25): i=1 ... (35): NO CHANGE\n if tmp_right_index[c[i]]==-1: # (23): NO CHANGE (26): NO CHANGE ... (32): NO CHANGE\n tmp_right_index[c[i]]=i # (24): tmp_right_index=[-1, 0, -1, -1, -1, -1, -1] (27): tmp_right_index=[-1, 0, 1, -1, -1, -1, -1] (30): tmp_right_index=[-1, 0, 1, -1, -1, -1, 2]\n else:\n right_index[i]=tmp_right_index[c[i]] # (33): right_index=[-1, -1, -1, 1]\n tmp_right_index[c[i]]=i # (34): tmp_right_index=[-1, 0, 3, -1, -1, -1, 2]\n\ndp=[0]*n # (36): dp=[0, 0, 0, 0]\nmod=10**9+7 # (37): mod=1000000007\nprint(0,c) # (38): NO CHANGE\nfor i in range(n): # (39): i=0 (42): i=1 ... (54): NO CHANGE\n if i==0: # (40): NO CHANGE (43): NO CHANGE ... (51): NO CHANGE\n dp[i]=1 # (41): dp=[1, 0, 0, 0]\n else:\n if right_index[i]==-1: # (44): NO CHANGE (48): NO CHANGE (52): NO CHANGE\n dp[i]+=dp[i-1]%mod # (45): dp=[1, 1, 0, 0] (49): dp=[1, 1, 1, 0]\n else:\n dp[i]+=dp[i-1]+dp[right_index[i]]%mod # (53): dp=[1, 1, 1, 2]\n\nprint(dp[-1]%mod)\n\n\n\n\n\n\n\n \n\n"], "anno_status": [true], "diff_content": " n=int(input())\n cc=[int(input()) for _ in range(n)]\n \n \n c=[cc[0]]\n for i in range(1,n):\n if cc[i]!=cc[i-1]:\n c.append(cc[i])\n \n n=len(c)\n \n right_index=[-1]*n\n tmp_right_index=[-1]*(max(c)+1)\n \n for i in range(n):\n if tmp_right_index[c[i]]==-1:\n tmp_right_index[c[i]]=i\n else:\n right_index[i]=tmp_right_index[c[i]]\n tmp_right_index[c[i]]=i\n \n dp=[0]*n\n mod=10**9+7\n-print(0,c)\n+\n for i in range(n):\n if i==0:\n dp[i]=1\n else:\n if right_index[i]==-1:\n dp[i]+=dp[i-1]%mod\n else:\n dp[i]+=dp[i-1]+dp[right_index[i]]%mod\n \n print(dp[-1]%mod)\n \n \n \n \n \n \n \n \n \n \n", "FL_content": " n=int(input())\n cc=[int(input()) for _ in range(n)]\n \n \n c=[cc[0]]\n for i in range(1,n):\n if cc[i]!=cc[i-1]:\n c.append(cc[i])\n \n n=len(c)\n \n right_index=[-1]*n\n tmp_right_index=[-1]*(max(c)+1)\n \n for i in range(n):\n if tmp_right_index[c[i]]==-1:\n tmp_right_index[c[i]]=i\n else:\n right_index[i]=tmp_right_index[c[i]]\n tmp_right_index[c[i]]=i\n \n dp=[0]*n\n mod=10**9+7\n-print(0,c)\n for i in range(n):\n if i==0:\n dp[i]=1\n else:\n if right_index[i]==-1:\n dp[i]+=dp[i-1]%mod\n else:\n dp[i]+=dp[i-1]+dp[right_index[i]]%mod\n \n print(dp[-1]%mod)\n \n \n \n \n \n \n \n \n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 44 }, { "user_id": "u888337853", "problem_id": "p03096", "submission1_id": "s371004440", "submission2_id": "s225829950", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nimport collections\nimport bisect\nimport copy\n\n\n\nsys.setrecursionlimit(10 ** 9)\nINF = 10 ** 16\nMOD = 10 ** 9 + 7\n\n\nni = lambda: int(sys.stdin.readline())\nns = lambda: map(int, sys.stdin.readline().split())\nna = lambda: list(map(int, sys.stdin.readline().split()))\nna1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().split()))\n\n\n\n\n\ndef main():\n n = ni()\n idxlist = [[] for _ in range(2 * 10 ** 5 + 1)]\n d = []\n dp = [INF for _ in range(n + 1)]\n dp[0] = 1\n\n for i in range(n):\n di = ni()\n di -= 1\n if i > 0:\n if d[-1] == di:\n d.append(-1)\n continue\n d.append(di)\n idxlist[di].append(i)\n\n for i, di in enumerate(d):\n \n dp[i + 1] = dp[i]\n if di == -1:\n continue\n bidx = bisect.bisect_left(idxlist[di], i)\n if bidx - 1 >= 0:\n dp[i + 1] += dp[idxlist[di][bidx - 1] + 1]\n dp[i + 1] %= MOD\n\n print(dp[n])\n\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\nimport math\nimport collections\nimport bisect\nimport copy\n\n\n\nsys.setrecursionlimit(10 ** 9)\nINF = 10 ** 16\nMOD = 10 ** 9 + 7\n\n\nni = lambda: int(sys.stdin.readline())\nns = lambda: map(int, sys.stdin.readline().split())\nna = lambda: list(map(int, sys.stdin.readline().split()))\nna1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().split()))\n\n\n\n\n\ndef main():\n n = ni()\n last = [-1 for _ in range(2 * 10 ** 5 + 1)]\n dp = [INF for _ in range(n + 1)]\n dp[0] = 1\n\n d = [ni()-1 for _ in range(n)]\n\n for i, di in enumerate(d):\n dp[i + 1] = dp[i]\n if last[di] != -1:\n if i - last[di] != 1:\n dp[i + 1] += dp[last[di] + 1]\n dp[i + 1] %= MOD\n last[di] = i\n\n print(dp[n])\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1596673065", "date2": "1596673747", "bleu_score": "0.7057260283575151", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 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, 0, 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], "code1_test_score": 91, "total_score": 103, "input": "7\n1\n2\n2\n2\n2\n3\n2\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["import sys\nimport math\nimport collections\nimport bisect\nimport copy\n\n\n\nsys.setrecursionlimit(10 ** 9) # (0): NO CHANGE\nINF = 10 ** 16 # (1): INF=10000000000000000\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\n\n\nni = lambda: int(sys.stdin.readline()) # (3): ni= at 0x0000023DFFEB9BD0>\nns = lambda: map(int, sys.stdin.readline().split()) # (4): ns= at 0x0000023DFFEB9B40>\nna = lambda: list(map(int, sys.stdin.readline().split())) # (5): na= at 0x0000023DFFEB9C60>\nna1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().split())) # (6): na1= at 0x0000023DFFEB9CF0>\n\n\n\n\n\ndef main(): # (7): main=\n n = ni()\n idxlist = [[] for _ in range(2 * 10 ** 5 + 1)]\n d = []\n dp = [INF for _ in range(n + 1)]\n dp[0] = 1\n\n for i in range(n):\n di = ni()\n di -= 1\n if i > 0:\n if d[-1] == di:\n d.append(-1)\n continue\n d.append(di)\n idxlist[di].append(i)\n\n for i, di in enumerate(d):\n \n dp[i + 1] = dp[i]\n if di == -1:\n continue\n bidx = bisect.bisect_left(idxlist[di], i)\n if bidx - 1 >= 0:\n dp[i + 1] += dp[idxlist[di][bidx - 1] + 1]\n dp[i + 1] %= MOD\n\n print(dp[n])\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n import math\n import collections\n import bisect\n import copy\n \n \n \n sys.setrecursionlimit(10 ** 9)\n INF = 10 ** 16\n MOD = 10 ** 9 + 7\n \n \n ni = lambda: int(sys.stdin.readline())\n ns = lambda: map(int, sys.stdin.readline().split())\n na = lambda: list(map(int, sys.stdin.readline().split()))\n na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().split()))\n \n \n \n \n \n def main():\n n = ni()\n- idxlist = [[] for _ in range(2 * 10 ** 5 + 1)]\n- d = []\n+ last = [-1 for _ in range(2 * 10 ** 5 + 1)]\n dp = [INF for _ in range(n + 1)]\n dp[0] = 1\n \n- for i in range(n):\n- di = ni()\n- di -= 1\n- if i > 0:\n- if d[-1] == di:\n- d.append(-1)\n- continue\n- d.append(di)\n- idxlist[di].append(i)\n+ d = [ni()-1 for _ in range(n)]\n \n for i, di in enumerate(d):\n- \n dp[i + 1] = dp[i]\n- if di == -1:\n- continue\n- bidx = bisect.bisect_left(idxlist[di], i)\n- if bidx - 1 >= 0:\n- dp[i + 1] += dp[idxlist[di][bidx - 1] + 1]\n- dp[i + 1] %= MOD\n+ if last[di] != -1:\n+ if i - last[di] != 1:\n+ dp[i + 1] += dp[last[di] + 1]\n+ dp[i + 1] %= MOD\n+ last[di] = i\n \n print(dp[n])\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import sys\n import math\n import collections\n import bisect\n import copy\n \n \n \n sys.setrecursionlimit(10 ** 9)\n INF = 10 ** 16\n MOD = 10 ** 9 + 7\n \n \n ni = lambda: int(sys.stdin.readline())\n ns = lambda: map(int, sys.stdin.readline().split())\n na = lambda: list(map(int, sys.stdin.readline().split()))\n na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().split()))\n \n \n \n \n \n def main():\n n = ni()\n- idxlist = [[] for _ in range(2 * 10 ** 5 + 1)]\n- d = []\n dp = [INF for _ in range(n + 1)]\n dp[0] = 1\n \n- for i in range(n):\n- di = ni()\n- di -= 1\n- if i > 0:\n- if d[-1] == di:\n- d.append(-1)\n- continue\n- d.append(di)\n- idxlist[di].append(i)\n \n for i, di in enumerate(d):\n- \n dp[i + 1] = dp[i]\n- if di == -1:\n- continue\n- bidx = bisect.bisect_left(idxlist[di], i)\n- if bidx - 1 >= 0:\n- dp[i + 1] += dp[idxlist[di][bidx - 1] + 1]\n- dp[i + 1] %= MOD\n \n print(dp[n])\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 7, "removed_lines": 18, "code1_lines": 55 }, { "user_id": "u413165887", "problem_id": "p03096", "submission1_id": "s371351230", "submission2_id": "s642354493", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nc = [int(input()) for _i in range(n)]\nc.append(-1)\ndic = {}\ndp = [0 for _i in range(n+1)]\ndp[n] = 1\nmod = 10**9 +7\nfor i in range(n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n dp[i] = (dp[i-1] + dic[c[i]])%mod\n else:\n dp[i] = dp[i-1]\n dic[c[i]] = dp[i-1]\n else:\n dp[i] = dp[i-1]\n \nprint(dp[n-1])", "code2": "n = int(input())\nc = [int(input()) for _i in range(n)]\nc.append(-1)\ndic = {}\ndp = [0 for _i in range(n+1)]\ndp[n] = 1\nmod = 10**9 +7\nfor i in range(n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n dp[i] = (dp[i-1] + dic[c[i]])%mod\n else:\n dp[i] = dp[i-1]\n dic[c[i]] = dp[i]\n else:\n dp[i] = dp[i-1]\n \nprint(dp[n-1]%mod)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590151202", "date2": "1590151287", "bleu_score": "0.9829725881821421", "code1_test_status": [0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 79, "total_score": 103, "input": "7\n1\n3\n1\n2\n1\n3\n2\n", "actual_output": "6\n", "expected_output": "7\n\n", "anno_code": ["n = int(input()) # (0): n=7\nc = [int(input()) for _i in range(n)] # (1): c=[1, 3, 1, 2, 1, 3, 2]\nc.append(-1) # (2): c=[1, 3, 1, 2, 1, 3, 2, -1]\ndic = {} # (3): dic={}\ndp = [0 for _i in range(n+1)] # (4): dp=[0, 0, 0, 0, 0, 0, 0, 0]\ndp[n] = 1 # (5): dp=[0, 0, 0, 0, 0, 0, 0, 1]\nmod = 10**9 +7 # (6): mod=1000000007\nfor i in range(n): # (7): i=0 (12): i=1 ... (42): NO CHANGE\n if c[i-1] != c[i]: # (8): NO CHANGE (13): NO CHANGE ... (38): NO CHANGE\n if c[i] in dic: # (9): NO CHANGE (14): NO CHANGE ... (39): NO CHANGE\n dp[i] = (dp[i-1] + dic[c[i]])%mod # (20): dp=[1, 1, 2, 0, 0, 0, 0, 1] (30): dp=[1, 1, 2, 2, 3, 0, 0, 1] ... (40): dp=[1, 1, 2, 2, 3, 4, 6, 1]\n else:\n dp[i] = dp[i-1] # (10): dp=[1, 0, 0, 0, 0, 0, 0, 1] (15): dp=[1, 1, 0, 0, 0, 0, 0, 1] (25): dp=[1, 1, 2, 2, 0, 0, 0, 1]\n dic[c[i]] = dp[i-1] # (11): dic={1: 1} (16): dic={1: 1, 3: 1} ... (41): dic={1: 2, 3: 3, 2: 4}\n else:\n dp[i] = dp[i-1]\n \nprint(dp[n-1])"], "anno_status": [true], "diff_content": " n = int(input())\n c = [int(input()) for _i in range(n)]\n c.append(-1)\n dic = {}\n dp = [0 for _i in range(n+1)]\n dp[n] = 1\n mod = 10**9 +7\n for i in range(n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n dp[i] = (dp[i-1] + dic[c[i]])%mod\n else:\n dp[i] = dp[i-1]\n- dic[c[i]] = dp[i-1]\n+ dic[c[i]] = dp[i]\n else:\n dp[i] = dp[i-1]\n \n-print(dp[n-1])\n+print(dp[n-1]%mod)\n", "FL_content": " n = int(input())\n c = [int(input()) for _i in range(n)]\n c.append(-1)\n dic = {}\n dp = [0 for _i in range(n+1)]\n dp[n] = 1\n mod = 10**9 +7\n for i in range(n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n dp[i] = (dp[i-1] + dic[c[i]])%mod\n else:\n dp[i] = dp[i-1]\n- dic[c[i]] = dp[i-1]\n else:\n dp[i] = dp[i-1]\n \n-print(dp[n-1])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u141610915", "problem_id": "p03096", "submission1_id": "s508708196", "submission2_id": "s263266438", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom bisect import bisect_right as br\ninput = sys.stdin.readline\nN = int(input())\ntable = [[] for _ in range(2 * pow(10, 5) + 1)]\na = []\nt = 0\nmod = 10 ** 9 + 7\nfor i in range(N):\n x = int(input())\n if t != x:\n table[x].append(i)\n t = x\n a.append(x)\n\ndp = [0] * N\ndp[0] = 1\nfor i in range(N):\n j = br(table[a[i]], i)\n if j < len(table[a[i]]):\n dp[table[a[i]][j]] += dp[i]\n dp[table[a[i]][j]] %= mod\n if i + 1 < N: \n dp[i + 1] += dp[i]\n dp[i + 1] %= mod\n \nprint(dp[-1])", "code2": "import sys\nfrom bisect import bisect_left as bl\nfrom bisect import bisect_right as br\ninput = sys.stdin.readline\nN = int(input())\ntable = [[] for _ in range(2 * pow(10, 5) + 1)]\na = []\nt = 0\nmod = 10 ** 9 + 7\nfor i in range(N):\n x = int(input())\n if t != x:\n table[x].append(i)\n t = x\n a.append(x)\n\ndp = [0] * N\ndp[0] = 1\nfor i in range(N):\n j = br(table[a[i]], i)\n k = bl(table[a[i]], i)\n if j < len(table[a[i]]) and (table[a[i]][k] == i):\n dp[table[a[i]][j]] += dp[i]\n dp[table[a[i]][j]] %= mod\n if i + 1 < N: \n dp[i + 1] += dp[i]\n dp[i + 1] %= mod\n \nprint(dp[-1])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1577362354", "date2": "1577362535", "bleu_score": "0.8496989366131389", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 103, "input": "7\n4\n6\n2\n2\n8\n5\n2\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n+from bisect import bisect_left as bl\n from bisect import bisect_right as br\n input = sys.stdin.readline\n N = int(input())\n table = [[] for _ in range(2 * pow(10, 5) + 1)]\n a = []\n t = 0\n mod = 10 ** 9 + 7\n for i in range(N):\n x = int(input())\n if t != x:\n table[x].append(i)\n t = x\n a.append(x)\n \n dp = [0] * N\n dp[0] = 1\n for i in range(N):\n j = br(table[a[i]], i)\n- if j < len(table[a[i]]):\n+ k = bl(table[a[i]], i)\n+ if j < len(table[a[i]]) and (table[a[i]][k] == i):\n dp[table[a[i]][j]] += dp[i]\n dp[table[a[i]][j]] %= mod\n if i + 1 < N: \n dp[i + 1] += dp[i]\n dp[i + 1] %= mod\n \n print(dp[-1])\n", "FL_content": " import sys\n from bisect import bisect_right as br\n input = sys.stdin.readline\n N = int(input())\n table = [[] for _ in range(2 * pow(10, 5) + 1)]\n a = []\n t = 0\n mod = 10 ** 9 + 7\n for i in range(N):\n x = int(input())\n if t != x:\n table[x].append(i)\n t = x\n a.append(x)\n \n dp = [0] * N\n dp[0] = 1\n for i in range(N):\n j = br(table[a[i]], i)\n- if j < len(table[a[i]]):\n dp[table[a[i]][j]] += dp[i]\n dp[table[a[i]][j]] %= mod\n if i + 1 < N: \n dp[i + 1] += dp[i]\n dp[i + 1] %= mod\n \n print(dp[-1])\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u729707098", "problem_id": "p03096", "submission1_id": "s386763220", "submission2_id": "s619542457", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nc = [int(input()) for i in range(n)]\nnum,x = 1,[0]*(200001)\nc.append(0)\nx[c[0]]+=1\nfor i in range(1,n):\n x[c[i]] = (x[c[i]]+num)%(10**9+7)\n if c[i]-c[i+1]: num = x[c[i]]\n else: num = 0\nprint(num)", "code2": "n = int(input())\nc = [int(input()) for i in range(n)]\nnum,x = 1,[0]*(200001)\nc.append(0)\nx[c[0]]+=1\nfor i in range(1,n):\n if c[i]-c[i-1]: x[c[i]] = (x[c[i]]+num)%(10**9+7)\n if c[i]-c[i+1]: num = x[c[i]]\n else: num = 0\nprint(num)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552931478", "date2": "1552932716", "bleu_score": "0.9288493524198601", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 84, "total_score": 103, "input": "6\n1\n1\n2\n12\n3\n8\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=6\nc = [int(input()) for i in range(n)] # (1): c=[1, 1, 2, 12, 3, 8]\nnum,x = 1,[0]*(200001) # (2): num=1, x=[0, 0, ..., 0, 0]\nc.append(0) # (3): c=[1, 1, 2, 12, 3, 8, 0]\nx[c[0]]+=1 # (4): x=[0, 1, ..., 0, 0]\nfor i in range(1,n): # (5): i=1 (8): i=2 ... (20): NO CHANGE\n x[c[i]] = (x[c[i]]+num)%(10**9+7) # (6): x=[0, 2, ..., 0, 0] (9): x=[0, 2, ..., 0, 0] ... (18): x=[0, 2, ..., 0, 0]\n if c[i]-c[i+1]: num = x[c[i]] # (7): num=2 (10): NO CHANGE ... (19): NO CHANGE\n else: num = 0\nprint(num)"], "anno_status": [true], "diff_content": " n = int(input())\n c = [int(input()) for i in range(n)]\n num,x = 1,[0]*(200001)\n c.append(0)\n x[c[0]]+=1\n for i in range(1,n):\n- x[c[i]] = (x[c[i]]+num)%(10**9+7)\n+ if c[i]-c[i-1]: x[c[i]] = (x[c[i]]+num)%(10**9+7)\n if c[i]-c[i+1]: num = x[c[i]]\n else: num = 0\n print(num)\n", "FL_content": " n = int(input())\n c = [int(input()) for i in range(n)]\n num,x = 1,[0]*(200001)\n c.append(0)\n x[c[0]]+=1\n for i in range(1,n):\n- x[c[i]] = (x[c[i]]+num)%(10**9+7)\n if c[i]-c[i+1]: num = x[c[i]]\n else: num = 0\n print(num)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u716530146", "problem_id": "p03096", "submission1_id": "s621470879", "submission2_id": "s717368948", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys, math, itertools, collections, bisect\ninput = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\ninf = float('inf') ;mod = 10**9+7\nmans = inf ;ans = 0 ;count = 0 ;pro = 1\n\nn = int(input())\nC = [int(input()) for i in range(n)]\npairs = [-1]*(n+1)\ndata = [-1]*(2*10**5+1)\nfor i,ci in enumerate(C):\n if data[ci] != -1 and abs(i-data[ci]) != 1:\n pairs[data[ci]] = i\n data[ci] = i\nimos = [0] * (n+1)\nfor i in range(n-1,-1,-1):\n \n if pairs[i] == -1: continue\n j = pairs[i]\n ans += pow(2,imos[j])\n ans %= mod\n imos[i] += 1\n imos[i-1] += imos[i]\n\nprint((ans+1)%mod)\n", "code2": "import sys, math, itertools, collections, bisect\ninput = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\ninf = float('inf') ;mod = 10**9+7\nmans = inf ;ans = 0 ;count = 0 ;pro = 1\n\nn = int(input())\nC = [int(input()) for i in range(n)]\npairs = [-1]*(n+1)\ndata = [-1]*(2*10**5+1)\nfor i,ci in enumerate(C):\n if data[ci] != -1 and abs(i-data[ci]) != 1:\n pairs[data[ci]] = i\n data[ci] = i\nimos = [0] * (n+1)\nfor i in range(n-1,-1,-1):\n \n if pairs[i] == -1:\n imos[i] = imos[i+1]\n \n else:\n j = pairs[i]\n imos[i] = imos[i+1] + imos[j] + 1\n imos[i] %= mod\n \n \n \nprint((imos[0]+1)%mod)\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598088591", "date2": "1598106941", "bleu_score": "0.8895317860486559", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "7\n1\n3\n1\n2\n1\n3\n2\n", "actual_output": "8\n", "expected_output": "7\n\n", "anno_code": ["import sys, math, itertools, collections, bisect\ninput = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') # (0): input= at 0x0000024C941E9BD0>\ninf = float('inf') ;mod = 10**9+7 # (1): inf=inf, mod=1000000007\nmans = inf ;ans = 0 ;count = 0 ;pro = 1 # (2): mans=inf, ans=0, count=0, pro=1\n\nn = int(input()) # (3): n=7\nC = [int(input()) for i in range(n)] # (4): C=[1, 3, 1, 2, 1, 3, 2]\npairs = [-1]*(n+1) # (5): pairs=[-1, -1, -1, -1, -1, -1, -1, -1]\ndata = [-1]*(2*10**5+1) # (6): data=[-1, -1, ..., -1, -1]\nfor i,ci in enumerate(C): # (7): i=0, ci=1 (10): i=1, ci=3 ... (32): NO CHANGE\n if data[ci] != -1 and abs(i-data[ci]) != 1: # (8): NO CHANGE (11): NO CHANGE ... (29): NO CHANGE\n pairs[data[ci]] = i # (15): pairs=[2, -1, -1, -1, -1, -1, -1, -1] (22): pairs=[2, -1, 4, -1, -1, -1, -1, -1] ... (30): pairs=[2, 5, 4, 6, -1, -1, -1, -1]\n data[ci] = i # (9): data=[-1, 0, ..., -1, -1] (12): data=[-1, 0, ..., -1, -1] ... (31): data=[-1, 4, ..., -1, -1]\nimos = [0] * (n+1) # (33): imos=[0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n-1,-1,-1): # (34): NO CHANGE (36): i=5 ... (68): NO CHANGE\n \n if pairs[i] == -1: continue # (35): NO CHANGE (37): NO CHANGE ... (62): NO CHANGE\n j = pairs[i] # (42): j=6 (49): j=4 ... (63): j=2\n ans += pow(2,imos[j]) # (43): ans=1 (50): ans=2 ... (64): ans=7\n ans %= mod # (44): NO CHANGE (51): NO CHANGE ... (65): NO CHANGE\n imos[i] += 1 # (45): imos=[0, 0, 0, 1, 0, 0, 0, 0] (52): imos=[0, 0, 2, 1, 0, 0, 0, 0] ... (66): imos=[4, 3, 2, 1, 0, 0, 0, 0]\n imos[i-1] += imos[i] # (46): imos=[0, 0, 1, 1, 0, 0, 0, 0] (53): imos=[0, 2, 2, 1, 0, 0, 0, 0] ... (67): imos=[4, 3, 2, 1, 0, 0, 0, 4]\n\nprint((ans+1)%mod)\n"], "anno_status": [true], "diff_content": " import sys, math, itertools, collections, bisect\n input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\n inf = float('inf') ;mod = 10**9+7\n mans = inf ;ans = 0 ;count = 0 ;pro = 1\n \n n = int(input())\n C = [int(input()) for i in range(n)]\n pairs = [-1]*(n+1)\n data = [-1]*(2*10**5+1)\n for i,ci in enumerate(C):\n if data[ci] != -1 and abs(i-data[ci]) != 1:\n pairs[data[ci]] = i\n data[ci] = i\n imos = [0] * (n+1)\n for i in range(n-1,-1,-1):\n \n- if pairs[i] == -1: continue\n- j = pairs[i]\n- ans += pow(2,imos[j])\n- ans %= mod\n- imos[i] += 1\n- imos[i-1] += imos[i]\n+ if pairs[i] == -1:\n+ imos[i] = imos[i+1]\n+ \n+ else:\n+ j = pairs[i]\n+ imos[i] = imos[i+1] + imos[j] + 1\n+ imos[i] %= mod\n+ \n+ \n+ \n+print((imos[0]+1)%mod)\n \n-print((ans+1)%mod)\n \n", "FL_content": " import sys, math, itertools, collections, bisect\n input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\n inf = float('inf') ;mod = 10**9+7\n mans = inf ;ans = 0 ;count = 0 ;pro = 1\n \n n = int(input())\n C = [int(input()) for i in range(n)]\n pairs = [-1]*(n+1)\n data = [-1]*(2*10**5+1)\n for i,ci in enumerate(C):\n if data[ci] != -1 and abs(i-data[ci]) != 1:\n pairs[data[ci]] = i\n data[ci] = i\n imos = [0] * (n+1)\n for i in range(n-1,-1,-1):\n \n- if pairs[i] == -1: continue\n- j = pairs[i]\n- ans += pow(2,imos[j])\n- ans %= mod\n- imos[i] += 1\n- imos[i-1] += imos[i]\n \n-print((ans+1)%mod)\n \n", "added_lines": 11, "removed_lines": 7, "code1_lines": 25 }, { "user_id": "u200785298", "problem_id": "p03096", "submission1_id": "s193260173", "submission2_id": "s565472854", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\nMOD = 1000000007 \n\ndef solve(N, C):\n last = [-1] * (N + 1)\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n return\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n print(0)\n return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\n\nMOD = 1000000007 \nMAX_N = 200000\n\ndef solve(N, C):\n last = [-1] * MAX_N\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n if c >= N:\n return\n else:\n raise Exception()\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553765568", "date2": "1553765926", "bleu_score": "0.915327756029232", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n2\n2\n2\n8\n2\n8\n", "actual_output": "", "expected_output": "3\n\n", "anno_code": ["\nimport sys\n\nMOD = 1000000007 # (0): MOD=1000000007\n\ndef solve(N, C): # (1): solve=\n last = [-1] * (N + 1)\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n return\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n print(0)\n return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\n return\n\n\n\ndef main(): # (2): 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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n \n MOD = 1000000007 \n+MAX_N = 200000\n \n def solve(N, C):\n- last = [-1] * (N + 1)\n+ last = [-1] * MAX_N\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n- return\n+ if c >= N:\n+ return\n+ else:\n+ raise Exception()\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n- print(0)\n- return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n \n MOD = 1000000007 \n \n def solve(N, C):\n- last = [-1] * (N + 1)\n pairs = []\n for i, c in enumerate(C):\n try:\n prev = last[c - 1]\n except:\n- return\n if prev >= 0 and prev < i - 1:\n pairs.append((prev, i))\n last[c - 1] = i\n- print(0)\n- return\n pairs.sort()\n count = [0] * N\n count[0] = 1\n idx = 0\n for i in range(N):\n if i > 0:\n count[i] += count[i - 1]\n count[i] %= MOD\n while idx < len(pairs) and pairs[idx][0] == i:\n count[pairs[idx][1]] += count[i]\n count[pairs[idx][1]] %= MOD\n idx += 1\n print(count[N - 1])\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 C = [ int(next(tokens)) for _ in range(N) ] \n solve(N, C)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 6, "removed_lines": 4, "code1_lines": 48 }, { "user_id": "u297109012", "problem_id": "p03096", "submission1_id": "s466991840", "submission2_id": "s954311228", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve(N, Cs):\n counts = [-1 for _ in Cs] + [1]\n latest_c = {}\n ans = 1\n d = 10**9 + 7\n for i, c in enumerate(Cs):\n if c not in latest_c:\n latest_c[c] = i\n counts[i] = ans\n else:\n previous_i = latest_c[c]\n if previous_i != i - 1:\n ans += counts[previous_i - 1]\n ans %= d\n latest_c[c] = i\n counts[i] = ans\n return ans % d\n\nif __name__ == \"__main__\":\n N = int(input())\n Cs = [int(input()) for _ in range(N)]\n print(solve(N, Cs))\n", "code2": "def solve(N, Cs):\n counts = [-1 for _ in Cs] + [1]\n latest_c = {}\n ans = 1\n d = 10 ** 9 + 7\n for i, c in enumerate(Cs):\n if c not in latest_c:\n latest_c[c] = i\n counts[i] = ans\n else:\n previous_i = latest_c[c]\n if previous_i != i - 1:\n ans += counts[previous_i]\n latest_c[c] = i\n counts[i] = ans\n return ans % d\n\nif __name__ == \"__main__\":\n N = int(input())\n Cs = [int(input()) for _ in range(N)]\n print(solve(N, Cs))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552772038", "date2": "1552772508", "bleu_score": "0.9480317360176607", "code1_test_status": [0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 80, "total_score": 103, "input": "5\n1\n2\n1\n2\n1\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["def solve(N, Cs): # (0): solve=\n counts = [-1 for _ in Cs] + [1]\n latest_c = {}\n ans = 1\n d = 10**9 + 7\n for i, c in enumerate(Cs):\n if c not in latest_c:\n latest_c[c] = i\n counts[i] = ans\n else:\n previous_i = latest_c[c]\n if previous_i != i - 1:\n ans += counts[previous_i - 1]\n ans %= d\n latest_c[c] = i\n counts[i] = ans\n return ans % d\n\nif __name__ == \"__main__\":\n N = int(input())\n Cs = [int(input()) for _ in range(N)]\n print(solve(N, Cs))\n"], "anno_status": [true], "diff_content": " def solve(N, Cs):\n counts = [-1 for _ in Cs] + [1]\n latest_c = {}\n ans = 1\n- d = 10**9 + 7\n+ d = 10 ** 9 + 7\n for i, c in enumerate(Cs):\n if c not in latest_c:\n latest_c[c] = i\n counts[i] = ans\n else:\n previous_i = latest_c[c]\n if previous_i != i - 1:\n- ans += counts[previous_i - 1]\n- ans %= d\n+ ans += counts[previous_i]\n latest_c[c] = i\n counts[i] = ans\n return ans % d\n \n if __name__ == \"__main__\":\n N = int(input())\n Cs = [int(input()) for _ in range(N)]\n print(solve(N, Cs))\n \n", "FL_content": " def solve(N, Cs):\n counts = [-1 for _ in Cs] + [1]\n latest_c = {}\n ans = 1\n- d = 10**9 + 7\n for i, c in enumerate(Cs):\n if c not in latest_c:\n latest_c[c] = i\n counts[i] = ans\n else:\n previous_i = latest_c[c]\n if previous_i != i - 1:\n- ans += counts[previous_i - 1]\n- ans %= d\n latest_c[c] = i\n counts[i] = ans\n return ans % d\n \n if __name__ == \"__main__\":\n N = int(input())\n Cs = [int(input()) for _ in range(N)]\n print(solve(N, Cs))\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 23 }, { "user_id": "u846150137", "problem_id": "p03096", "submission1_id": "s112086377", "submission2_id": "s005727124", "status1": "Wrong Answer", "status2": "Accepted", "code1": "m = 10 ** 9 + 7\nd = {}\nr = 1\np = 0\nfor _ in range(int(input())):\n c = int(input())\n if c == p:\n continue\n if c in d:\n r += d[c]\n r %= m\n d[c] = r\n p = c\n", "code2": "from collections import defaultdict as dd\nd = dd(int)\nr = 1\np = \"\"\nfor _ in range(int(input())):\n c = input()\n if c != p:\n r = (r + d[c]) % (10**9 + 7)\n d[c] = r\n p = c\nprint(r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552777499", "date2": "1552810296", "bleu_score": "0.6137924939159937", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n4\n1\n5\n8\n3\n1\n", "actual_output": "", "expected_output": "2\n\n", "anno_code": ["m = 10 ** 9 + 7 # (0): m=1000000007\nd = {} # (1): d={}\nr = 1 # (2): r=1\np = 0 # (3): p=0\nfor _ in range(int(input())): # (4): _=0 (11): _=1 ... (39): _=5\n c = int(input()) # (5): c=4 (12): c=1 ... (40): c=1\n if c == p: # (6): NO CHANGE (13): NO CHANGE ... (41): NO CHANGE\n continue\n if c in d: # (7): NO CHANGE (14): NO CHANGE ... (42): NO CHANGE\n r += d[c] # (43): r=2\n r %= m # (8): NO CHANGE (15): NO CHANGE ... (44): NO CHANGE\n d[c] = r # (9): d={4: 1} (16): d={4: 1, 1: 1} ... (45): d={4: 1, 1: 2, 5: 1, 8: 1, 3: 1}\n p = c # (10): p=4 (17): p=1 ... (46): p=1\n"], "anno_status": [true], "diff_content": "-m = 10 ** 9 + 7\n-d = {}\n+from collections import defaultdict as dd\n+d = dd(int)\n r = 1\n-p = 0\n+p = \"\"\n for _ in range(int(input())):\n- c = int(input())\n- if c == p:\n- continue\n- if c in d:\n- r += d[c]\n- r %= m\n- d[c] = r\n+ c = input()\n+ if c != p:\n+ r = (r + d[c]) % (10**9 + 7)\n+ d[c] = r\n p = c\n-\n+print(r)\n", "FL_content": "-m = 10 ** 9 + 7\n-d = {}\n r = 1\n-p = 0\n for _ in range(int(input())):\n- c = int(input())\n- if c == p:\n- continue\n- if c in d:\n- r += d[c]\n- r %= m\n- d[c] = r\n p = c\n-\n", "added_lines": 8, "removed_lines": 11, "code1_lines": 14 }, { "user_id": "u631277801", "problem_id": "p03096", "submission1_id": "s979855017", "submission2_id": "s207938578", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nstdin = sys.stdin\n \nsys.setrecursionlimit(10**5) \n \ndef li(): return map(int, stdin.readline().split())\ndef li_(): return map(lambda x: int(x)-1, stdin.readline().split())\ndef lf(): return map(float, stdin.readline().split())\ndef ls(): return stdin.readline().split()\ndef ns(): return stdin.readline().rstrip()\ndef lc(): return list(ns())\ndef ni(): return int(stdin.readline())\ndef nf(): return float(stdin.readline())\n\nfrom collections import Counter, defaultdict\n\ndef compress(s):\n ret = []\n for i, si in enumerate(s):\n if i == 0:\n ret.append(si)\n else:\n if si == ret[-1]:\n continue\n else:\n ret.append(si)\n \n return ret\n\ndef removeonly1(s):\n cnt = Counter(s)\n ret = []\n \n for si in s:\n if cnt[si] == 1:\n continue\n else:\n ret.append(si)\n \n return ret\n\nn = ni()\nc = [ni() for _ in range(n)]\nMOD = 10**9+7\n\ncolors = removeonly1(compress(c))\n\n\ndp = [0 for _ in range(len(colors)+1)]\n\ndp[0] = 1\nidxs = defaultdict(list)\n\nfor i, ci in enumerate(colors):\n dp[i+1] = dp[i]\n \n if ci in idxs.keys():\n dp[i+1] += dp[idxs[ci][-1]]\n dp[i+1] %= MOD\n \n idxs[ci].append(i)\n \nprint(dp[len(colors)])", "code2": "import sys\nstdin = sys.stdin\n \nsys.setrecursionlimit(10**5) \n \ndef li(): return map(int, stdin.readline().split())\ndef li_(): return map(lambda x: int(x)-1, stdin.readline().split())\ndef lf(): return map(float, stdin.readline().split())\ndef ls(): return stdin.readline().split()\ndef ns(): return stdin.readline().rstrip()\ndef lc(): return list(ns())\ndef ni(): return int(stdin.readline())\ndef nf(): return float(stdin.readline())\n\nfrom collections import Counter, defaultdict\n\ndef compress(s):\n ret = []\n for i, si in enumerate(s):\n if i == 0:\n ret.append(si)\n else:\n if si == ret[-1]:\n continue\n else:\n ret.append(si)\n \n return ret\n\ndef removeonly1(s):\n cnt = Counter(s)\n ret = []\n \n for si in s:\n if cnt[si] == 1:\n continue\n else:\n ret.append(si)\n \n return ret\n\nn = ni()\nc = [ni() for _ in range(n)]\nMOD = 10**9+7\n\ncolors = removeonly1(compress(c))\n\n\ndp = [0 for _ in range(len(colors)+1)]\n\ndp[0] = 1\nidxs = defaultdict(list)\nkeys = set()\n\nfor i, ci in enumerate(colors):\n dp[i+1] = dp[i]\n \n if ci in keys:\n dp[i+1] += dp[idxs[ci][-1]+1]\n dp[i+1] %= MOD\n \n idxs[ci].append(i)\n keys.add(ci)\n \nprint(dp[len(colors)])\n ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552770847", "date2": "1552770966", "bleu_score": "0.9699969510603467", "code1_test_status": [0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 79, "total_score": 103, "input": "6\n2\n1\n2\n12\n2\n8\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["import sys\nstdin = sys.stdin # (0): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p03096\\\\input_s979855017.txt' mode='r' encoding='utf-8'>\n \nsys.setrecursionlimit(10**5) # (1): li=, li_=, lf=, ls=, ns=, lc=, ni=, nf=, Counter=, defaultdict=\n \ndef li(): return map(int, stdin.readline().split())\ndef li_(): return map(lambda x: int(x)-1, stdin.readline().split())\ndef lf(): return map(float, stdin.readline().split())\ndef ls(): return stdin.readline().split()\ndef ns(): return stdin.readline().rstrip()\ndef lc(): return list(ns())\ndef ni(): return int(stdin.readline())\ndef nf(): return float(stdin.readline())\n\nfrom collections import Counter, defaultdict\n\ndef compress(s): # (2): compress=\n ret = [] # (8): ret=[]\n for i, si in enumerate(s): # (9): i=0, si=2 (12): i=1, si=1 ... (32): NO CHANGE\n if i == 0: # (10): NO CHANGE (13): NO CHANGE ... (29): NO CHANGE\n ret.append(si) # (11): ret=[2]\n else:\n if si == ret[-1]: # (14): NO CHANGE (18): NO CHANGE ... (30): NO CHANGE\n continue\n else:\n ret.append(si) # (15): ret=[2, 1] (19): ret=[2, 1, 2] ... (31): ret=[2, 1, 2, 12, 2, 8]\n \n return ret\n\ndef removeonly1(s): # (3): removeonly1=\n cnt = Counter(s) # (33): cnt=Counter({2: 3, 1: 1, 12: 1, 8: 1})\n ret = [] # (34): ret=[]\n \n for si in s: # (35): si=2 (38): si=1 ... (53): sys=, stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p03096\\\\input_s979855017.txt' mode='r' encoding='utf-8'>, li=, li_=, lf=, ls=, ns=, lc=, ni=, nf=, Counter=, defaultdict=, compress=, removeonly1=, n=6, c=[2, 1, 2, 12, 2, 8], MOD=1000000007, colors=[2, 2, 2]\n if cnt[si] == 1: # (36): NO CHANGE (39): NO CHANGE ... (51): NO CHANGE\n continue # (40): NO CHANGE (46): NO CHANGE (52): NO CHANGE\n else:\n ret.append(si) # (37): ret=[2] (43): ret=[2, 2] (49): ret=[2, 2, 2]\n \n return ret\n\nn = ni() # (4): n=6\nc = [ni() for _ in range(n)] # (5): c=[2, 1, 2, 12, 2, 8]\nMOD = 10**9+7 # (6): MOD=1000000007\n\ncolors = removeonly1(compress(c)) # (7): s=[2, 1, 2, 12, 2, 8]\n\n\ndp = [0 for _ in range(len(colors)+1)] # (54): dp=[0, 0, 0, 0]\n\ndp[0] = 1 # (55): dp=[1, 0, 0, 0]\nidxs = defaultdict(list) # (56): idxs=defaultdict(, {})\n\nfor i, ci in enumerate(colors): # (57): i=0, ci=2 (61): i=1 ... (73): NO CHANGE\n dp[i+1] = dp[i] # (58): dp=[1, 1, 0, 0] (62): dp=[1, 1, 1, 0] (68): dp=[1, 1, 2, 2]\n \n if ci in idxs.keys(): # (59): NO CHANGE (63): NO CHANGE (69): NO CHANGE\n dp[i+1] += dp[idxs[ci][-1]] # (64): dp=[1, 1, 2, 0] (70): dp=[1, 1, 2, 3]\n dp[i+1] %= MOD # (65): NO CHANGE (71): NO CHANGE\n \n idxs[ci].append(i) # (60): idxs=defaultdict(, {2: [0]}) (66): idxs=defaultdict(, {2: [0, 1]}) (72): idxs=defaultdict(, {2: [0, 1, 2]})\n \nprint(dp[len(colors)])"], "anno_status": [false], "diff_content": " import sys\n stdin = sys.stdin\n \n sys.setrecursionlimit(10**5) \n \n def li(): return map(int, stdin.readline().split())\n def li_(): return map(lambda x: int(x)-1, stdin.readline().split())\n def lf(): return map(float, stdin.readline().split())\n def ls(): return stdin.readline().split()\n def ns(): return stdin.readline().rstrip()\n def lc(): return list(ns())\n def ni(): return int(stdin.readline())\n def nf(): return float(stdin.readline())\n \n from collections import Counter, defaultdict\n \n def compress(s):\n ret = []\n for i, si in enumerate(s):\n if i == 0:\n ret.append(si)\n else:\n if si == ret[-1]:\n continue\n else:\n ret.append(si)\n \n return ret\n \n def removeonly1(s):\n cnt = Counter(s)\n ret = []\n \n for si in s:\n if cnt[si] == 1:\n continue\n else:\n ret.append(si)\n \n return ret\n \n n = ni()\n c = [ni() for _ in range(n)]\n MOD = 10**9+7\n \n colors = removeonly1(compress(c))\n \n \n dp = [0 for _ in range(len(colors)+1)]\n \n dp[0] = 1\n idxs = defaultdict(list)\n+keys = set()\n \n for i, ci in enumerate(colors):\n dp[i+1] = dp[i]\n \n- if ci in idxs.keys():\n- dp[i+1] += dp[idxs[ci][-1]]\n+ if ci in keys:\n+ dp[i+1] += dp[idxs[ci][-1]+1]\n dp[i+1] %= MOD\n \n idxs[ci].append(i)\n+ keys.add(ci)\n \n print(dp[len(colors)])\n+ \n", "FL_content": " import sys\n stdin = sys.stdin\n \n sys.setrecursionlimit(10**5) \n \n def li(): return map(int, stdin.readline().split())\n def li_(): return map(lambda x: int(x)-1, stdin.readline().split())\n def lf(): return map(float, stdin.readline().split())\n def ls(): return stdin.readline().split()\n def ns(): return stdin.readline().rstrip()\n def lc(): return list(ns())\n def ni(): return int(stdin.readline())\n def nf(): return float(stdin.readline())\n \n from collections import Counter, defaultdict\n \n def compress(s):\n ret = []\n for i, si in enumerate(s):\n if i == 0:\n ret.append(si)\n else:\n if si == ret[-1]:\n continue\n else:\n ret.append(si)\n \n return ret\n \n def removeonly1(s):\n cnt = Counter(s)\n ret = []\n \n for si in s:\n if cnt[si] == 1:\n continue\n else:\n ret.append(si)\n \n return ret\n \n n = ni()\n c = [ni() for _ in range(n)]\n MOD = 10**9+7\n \n colors = removeonly1(compress(c))\n \n \n dp = [0 for _ in range(len(colors)+1)]\n \n dp[0] = 1\n idxs = defaultdict(list)\n \n for i, ci in enumerate(colors):\n dp[i+1] = dp[i]\n \n- if ci in idxs.keys():\n- dp[i+1] += dp[idxs[ci][-1]]\n dp[i+1] %= MOD\n \n idxs[ci].append(i)\n \n print(dp[len(colors)])\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 63 }, { "user_id": "u955251526", "problem_id": "p03096", "submission1_id": "s769041533", "submission2_id": "s992536588", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nz = []\npre = 0\nfor _ in range(n):\n i = int(input())\n if i != pre:\n z.append(i)\n pre = i\nn = len(z)\ndp = [1] * (n+1)\ndpp = [0] * 2 * 10 ** 5\nfor i in range(n):\n dp[i+1] = dp[i] + dpp[z[i]-1]\n dpp[z[i]-1] += dp[i+1]\n dp[i+1] %= 10 ** 9 + 7\nprint(dp[n])", "code2": "n = int(input())\nz = []\npre = 0\nfor _ in range(n):\n i = int(input())\n if i != pre:\n z.append(i)\n pre = i\nn = len(z)\ndp = [1] * (n+1)\ndpp = [0] * 2 * 10 ** 5\nfor i in range(n):\n dp[i+1] = dp[i] + dpp[z[i]-1]\n dpp[z[i]-1] += dp[i]\n dp[i+1] %= 10 ** 9 + 7\nprint(dp[n])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552772792", "date2": "1552772909", "bleu_score": "0.9879410337576283", "code1_test_status": [0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 79, "total_score": 103, "input": "6\n4\n2\n5\n2\n3\n2\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["n = int(input()) # (0): n=6\nz = [] # (1): z=[]\npre = 0 # (2): pre=0\nfor _ in range(n): # (3): _=0 (8): _=1 ... (33): NO CHANGE\n i = int(input()) # (4): i=4 (9): i=2 ... (29): i=2\n if i != pre: # (5): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\n z.append(i) # (6): z=[4] (11): z=[4, 2] ... (31): z=[4, 2, 5, 2, 3, 2]\n pre = i # (7): pre=4 (12): pre=2 ... (32): pre=2\nn = len(z) # (34): NO CHANGE\ndp = [1] * (n+1) # (35): dp=[1, 1, 1, 1, 1, 1, 1]\ndpp = [0] * 2 * 10 ** 5 # (36): dpp=[0, 0, ..., 0, 0]\nfor i in range(n): # (37): i=0 (41): i=1 ... (61): NO CHANGE\n dp[i+1] = dp[i] + dpp[z[i]-1] # (38): NO CHANGE (42): NO CHANGE ... (58): dp=[1, 1, 1, 1, 2, 2, 5]\n dpp[z[i]-1] += dp[i+1] # (39): dpp=[0, 0, ..., 0, 0] (43): dpp=[0, 1, ..., 0, 0] ... (59): dpp=[0, 8, ..., 0, 0]\n dp[i+1] %= 10 ** 9 + 7 # (40): NO CHANGE (44): NO CHANGE ... (60): NO CHANGE\nprint(dp[n])"], "anno_status": [true], "diff_content": " n = int(input())\n z = []\n pre = 0\n for _ in range(n):\n i = int(input())\n if i != pre:\n z.append(i)\n pre = i\n n = len(z)\n dp = [1] * (n+1)\n dpp = [0] * 2 * 10 ** 5\n for i in range(n):\n dp[i+1] = dp[i] + dpp[z[i]-1]\n- dpp[z[i]-1] += dp[i+1]\n+ dpp[z[i]-1] += dp[i]\n dp[i+1] %= 10 ** 9 + 7\n print(dp[n])\n", "FL_content": " n = int(input())\n z = []\n pre = 0\n for _ in range(n):\n i = int(input())\n if i != pre:\n z.append(i)\n pre = i\n n = len(z)\n dp = [1] * (n+1)\n dpp = [0] * 2 * 10 ** 5\n for i in range(n):\n dp[i+1] = dp[i] + dpp[z[i]-1]\n- dpp[z[i]-1] += dp[i+1]\n dp[i+1] %= 10 ** 9 + 7\n print(dp[n])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u788137651", "problem_id": "p03096", "submission1_id": "s712673798", "submission2_id": "s865632211", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nN = int(input())\nC = [0]\nc = [int(sys.stdin.readline()) for i in range(N)]\n\nC = C+c\nans = 1\ndp = [0] * (N + 100)\ncolor = [[]for i in range((2*(10**5)+100))]\ndp[0] = 1\n\ndp[1] = 1\ncolor[C[1]].append(1)\nfor i in range(2, N+1):\n dp[i] = dp[i - 1]\n\n \n for col in reversed(color[C[i]]):\n \n if i - col == 1:\n break\n else:\n dp[i] += dp[col-1]\n \n color[C[i]].append(i)\n \n\n\nprint(dp[N] % (10 ** 9 + 7))\n\n\n\n", "code2": "import sys\nN = int(input())\nC = [0]\nn = N\nfor i in range(1, n + 1):\n c = int(sys.stdin.readline())\n if c == C[-1]:\n N -= 1\n else:\n C.append(c)\ndp = [0] * (N + 2)\ndp[0] = 1\ndp[1] = 1\ncumsum = [0] * (2 * (10 ** 5) + 2)\ncumsum[C[1]] = 1\nfor i in range(2, N+1):\n dp[i] = dp[i - 1] + cumsum[C[i]]\n cumsum[C[i]] += dp[i-1]\n dp[i] %= (10 ** 9 + 7)\nprint(dp[N])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552771709", "date2": "1552869809", "bleu_score": "0.6069488802383837", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 103, "input": "6\n3\n2\n2\n1\n2\n4\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n N = int(input())\n C = [0]\n-c = [int(sys.stdin.readline()) for i in range(N)]\n-\n-C = C+c\n-ans = 1\n-dp = [0] * (N + 100)\n-color = [[]for i in range((2*(10**5)+100))]\n+n = N\n+for i in range(1, n + 1):\n+ c = int(sys.stdin.readline())\n+ if c == C[-1]:\n+ N -= 1\n+ else:\n+ C.append(c)\n+dp = [0] * (N + 2)\n dp[0] = 1\n-\n dp[1] = 1\n-color[C[1]].append(1)\n+cumsum = [0] * (2 * (10 ** 5) + 2)\n+cumsum[C[1]] = 1\n for i in range(2, N+1):\n- dp[i] = dp[i - 1]\n-\n- \n- for col in reversed(color[C[i]]):\n- \n- if i - col == 1:\n- break\n- else:\n- dp[i] += dp[col-1]\n- \n- color[C[i]].append(i)\n- \n-\n-\n-print(dp[N] % (10 ** 9 + 7))\n-\n-\n-\n+ dp[i] = dp[i - 1] + cumsum[C[i]]\n+ cumsum[C[i]] += dp[i-1]\n+ dp[i] %= (10 ** 9 + 7)\n+print(dp[N])\n \n", "FL_content": " import sys\n N = int(input())\n C = [0]\n-c = [int(sys.stdin.readline()) for i in range(N)]\n-\n-C = C+c\n-ans = 1\n-dp = [0] * (N + 100)\n-color = [[]for i in range((2*(10**5)+100))]\n dp[0] = 1\n-\n dp[1] = 1\n-color[C[1]].append(1)\n for i in range(2, N+1):\n- dp[i] = dp[i - 1]\n-\n- \n- for col in reversed(color[C[i]]):\n- \n- if i - col == 1:\n- break\n- else:\n- dp[i] += dp[col-1]\n- \n- color[C[i]].append(i)\n- \n-\n-\n-print(dp[N] % (10 ** 9 + 7))\n-\n-\n-\n \n", "added_lines": 14, "removed_lines": 26, "code1_lines": 33 }, { "user_id": "u925364229", "problem_id": "p03096", "submission1_id": "s123383134", "submission2_id": "s091667802", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nC = [0] * N\nmod = 10 ** 9 + 7\ndic = {}\nfor i in range(N):\n C[i] = int(input())\n if not C[i] in dic:\n dic[C[i]] = [ i ]\n else:\n dic[C[i]].append(i)\n\ndp = [0] * N\ndp[0] = 1\nfor i in range(1,N):\n dp[i] = dp[i-1]\n if C[i] == C[i-1]:\n continue\n for prev in dic[C[i]]:\n if prev < i:\n if prev > 0:\n dp[i] += dp[prev-1]\n else:\n dp[i] += 1\n dp[i] %= mod\n\nprint(dp[N-1] % mod)", "code2": "N = int(input())\nC = [0] * N\nmod = 10 ** 9 + 7\ndic = [-1]*(2*(10**5)+1)\nprevIdx = [0] * N\nfor i in range(N):\n C[i] = int(input())\n if i > 0 and C[i] == C[i-1]:\n continue\n prevIdx[i] = dic[C[i]]\n dic[C[i]] = i\n\ndp = [0] * N\ndp[0] = 1\nacc = [0] * N\nacc[0] = 1\nfor i in range(1,N):\n dp[i] = dp[i-1] % mod\n if C[i] == C[i-1] or prevIdx[i] == -1:\n acc[i] = dp[i-1]\n continue\n \n dp[i] += acc[prevIdx[i]]\n acc[i] = acc[prevIdx[i]] + dp[i-1]\n acc[i] %= mod\n dp[i] %= mod\n\nprint(dp[N-1] % mod)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552772927", "date2": "1552774884", "bleu_score": "0.676377747140642", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 103, "input": "7\n1\n2\n2\n2\n2\n6\n2\n", "actual_output": "5\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=7\nC = [0] * N # (1): C=[0, 0, 0, 0, 0, 0, 0]\nmod = 10 ** 9 + 7 # (2): mod=1000000007\ndic = {} # (3): dic={}\nfor i in range(N): # (4): i=0 (8): i=1 ... (32): NO CHANGE\n C[i] = int(input()) # (5): C=[1, 0, 0, 0, 0, 0, 0] (9): C=[1, 2, 0, 0, 0, 0, 0] ... (29): C=[1, 2, 2, 2, 2, 6, 2]\n if not C[i] in dic: # (6): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\n dic[C[i]] = [ i ] # (7): dic={1: [0]} (11): dic={1: [0], 2: [1]} (27): dic={1: [0], 2: [1, 2, 3, 4], 6: [5]}\n else:\n dic[C[i]].append(i) # (15): dic={1: [0], 2: [1, 2]} (19): dic={1: [0], 2: [1, 2, 3]} ... (31): dic={1: [0], 2: [1, 2, 3, 4, 6], 6: [5]}\n\ndp = [0] * N # (33): dp=[0, 0, 0, 0, 0, 0, 0]\ndp[0] = 1 # (34): dp=[1, 0, 0, 0, 0, 0, 0]\nfor i in range(1,N): # (35): i=1 (54): i=2 ... (100): NO CHANGE\n dp[i] = dp[i-1] # (36): dp=[1, 1, 0, 0, 0, 0, 0] (55): dp=[1, 1, 1, 0, 0, 0, 0] ... (74): dp=[1, 1, 1, 1, 1, 1, 1]\n if C[i] == C[i-1]: # (37): NO CHANGE (56): NO CHANGE ... (75): NO CHANGE\n continue # (57): NO CHANGE (61): NO CHANGE (65): NO CHANGE\n for prev in dic[C[i]]: # (38): prev=1 (41): prev=2 ... (99): NO CHANGE\n if prev < i: # (39): NO CHANGE (42): NO CHANGE ... (97): NO CHANGE\n if prev > 0: # (78): NO CHANGE (83): NO CHANGE ... (93): NO CHANGE\n dp[i] += dp[prev-1] # (79): dp=[1, 1, 1, 1, 1, 1, 2] (84): dp=[1, 1, 1, 1, 1, 1, 3] ... (94): dp=[1, 1, 1, 1, 1, 1, 5]\n else:\n dp[i] += 1\n dp[i] %= mod # (40): NO CHANGE (43): NO CHANGE ... (98): NO CHANGE\n\nprint(dp[N-1] % mod)"], "anno_status": [true], "diff_content": " N = int(input())\n C = [0] * N\n mod = 10 ** 9 + 7\n-dic = {}\n+dic = [-1]*(2*(10**5)+1)\n+prevIdx = [0] * N\n for i in range(N):\n C[i] = int(input())\n- if not C[i] in dic:\n- dic[C[i]] = [ i ]\n- else:\n- dic[C[i]].append(i)\n+ if i > 0 and C[i] == C[i-1]:\n+ continue\n+ prevIdx[i] = dic[C[i]]\n+ dic[C[i]] = i\n \n dp = [0] * N\n dp[0] = 1\n+acc = [0] * N\n+acc[0] = 1\n for i in range(1,N):\n- dp[i] = dp[i-1]\n- if C[i] == C[i-1]:\n+ dp[i] = dp[i-1] % mod\n+ if C[i] == C[i-1] or prevIdx[i] == -1:\n+ acc[i] = dp[i-1]\n continue\n- for prev in dic[C[i]]:\n- if prev < i:\n- if prev > 0:\n- dp[i] += dp[prev-1]\n- else:\n- dp[i] += 1\n- dp[i] %= mod\n+ \n+ dp[i] += acc[prevIdx[i]]\n+ acc[i] = acc[prevIdx[i]] + dp[i-1]\n+ acc[i] %= mod\n+ dp[i] %= mod\n \n print(dp[N-1] % mod)\n", "FL_content": " N = int(input())\n C = [0] * N\n mod = 10 ** 9 + 7\n-dic = {}\n for i in range(N):\n C[i] = int(input())\n- if not C[i] in dic:\n- dic[C[i]] = [ i ]\n- else:\n- dic[C[i]].append(i)\n \n dp = [0] * N\n dp[0] = 1\n for i in range(1,N):\n- dp[i] = dp[i-1]\n- if C[i] == C[i-1]:\n continue\n- for prev in dic[C[i]]:\n- if prev < i:\n- if prev > 0:\n- dp[i] += dp[prev-1]\n- else:\n- dp[i] += 1\n- dp[i] %= mod\n \n print(dp[N-1] % mod)\n", "added_lines": 16, "removed_lines": 14, "code1_lines": 26 }, { "user_id": "u413165887", "problem_id": "p03096", "submission1_id": "s008414950", "submission2_id": "s642354493", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nc = [int(input()) for _i in range(n)]\n\ndic = {}\ndp = [0 for _i in range(n)]\ndp[0] = 1\nfor i in range(1, n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n dp[i] += dic[c[i]]\n dic[c[i]] += dp[i-1]\n else:\n dic[c[i]] = dp[i-1] + 1\n dp[i] += dp[i-1]\nprint(dp[n-1])", "code2": "n = int(input())\nc = [int(input()) for _i in range(n)]\nc.append(-1)\ndic = {}\ndp = [0 for _i in range(n+1)]\ndp[n] = 1\nmod = 10**9 +7\nfor i in range(n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n dp[i] = (dp[i-1] + dic[c[i]])%mod\n else:\n dp[i] = dp[i-1]\n dic[c[i]] = dp[i]\n else:\n dp[i] = dp[i-1]\n \nprint(dp[n-1]%mod)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590149674", "date2": "1590151287", "bleu_score": "0.7950955265238416", "code1_test_status": [1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1], "code1_test_score": 39, "total_score": 103, "input": "6\n3\n2\n2\n2\n3\n4\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=6\nc = [int(input()) for _i in range(n)] # (1): c=[3, 2, 2, 2, 3, 4]\n\ndic = {} # (2): dic={}\ndp = [0 for _i in range(n)] # (3): dp=[0, 0, 0, 0, 0, 0]\ndp[0] = 1 # (4): dp=[1, 0, 0, 0, 0, 0]\nfor i in range(1, n): # (5): i=1 (10): i=2 ... (26): NO CHANGE\n if c[i-1] != c[i]: # (6): NO CHANGE (11): NO CHANGE ... (22): NO CHANGE\n if c[i] in dic: # (7): NO CHANGE (18): NO CHANGE (23): NO CHANGE\n dp[i] += dic[c[i]]\n dic[c[i]] += dp[i-1]\n else:\n dic[c[i]] = dp[i-1] + 1 # (8): dic={2: 2} (19): dic={2: 2, 3: 2} (24): dic={2: 2, 3: 2, 4: 2}\n dp[i] += dp[i-1] # (9): dp=[1, 1, 0, 0, 0, 0] (12): dp=[1, 1, 1, 0, 0, 0] ... (25): dp=[1, 1, 1, 1, 1, 1]\nprint(dp[n-1])"], "anno_status": [true], "diff_content": " n = int(input())\n c = [int(input()) for _i in range(n)]\n-\n+c.append(-1)\n dic = {}\n-dp = [0 for _i in range(n)]\n-dp[0] = 1\n-for i in range(1, n):\n+dp = [0 for _i in range(n+1)]\n+dp[n] = 1\n+mod = 10**9 +7\n+for i in range(n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n- dp[i] += dic[c[i]]\n- dic[c[i]] += dp[i-1]\n+ dp[i] = (dp[i-1] + dic[c[i]])%mod\n else:\n- dic[c[i]] = dp[i-1] + 1\n- dp[i] += dp[i-1]\n-print(dp[n-1])\n+ dp[i] = dp[i-1]\n+ dic[c[i]] = dp[i]\n+ else:\n+ dp[i] = dp[i-1]\n+ \n+print(dp[n-1]%mod)\n", "FL_content": " n = int(input())\n c = [int(input()) for _i in range(n)]\n-\n dic = {}\n-dp = [0 for _i in range(n)]\n-dp[0] = 1\n-for i in range(1, n):\n if c[i-1] != c[i]:\n if c[i] in dic:\n- dp[i] += dic[c[i]]\n- dic[c[i]] += dp[i-1]\n else:\n- dic[c[i]] = dp[i-1] + 1\n- dp[i] += dp[i-1]\n-print(dp[n-1])\n", "added_lines": 12, "removed_lines": 9, "code1_lines": 15 }, { "user_id": "u678167152", "problem_id": "p03096", "submission1_id": "s857388528", "submission2_id": "s087438960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\nfrom bisect import *\ndef solve():\n d = defaultdict(lambda: [])\n N = int(input())\n for i in range(N):\n a = int(input())\n d[a].append(i)\n selist = []\n for l in d.values():\n for i in range(len(l)-1):\n if l[i+1]-1>l[i]:\n selist.append([l[i],l[i+1]])\n start_sort = sorted(selist)\n e_ind = {}\n for i,(s,e) in enumerate(start_sort):\n e_ind[e] = i\n ends = list(e_ind.keys())\n ends.sort()\n dp = [0]*(len(selist)+1)\n for i in range(1,len(selist)+1):\n dp[i] = dp[i-1]+1\n ind = bisect_right(ends,selist[i-1][0])\n if ind>0:\n j = e_ind[ends[ind-1]]\n dp[i] += dp[j+1]\n ans = dp[-1]+1\n return ans\nprint(solve())", "code2": "from collections import defaultdict\nfrom bisect import *\ndef solve():\n mod = 10**9+7\n d = defaultdict(lambda: [])\n N = int(input())\n for i in range(N):\n a = int(input())\n d[a].append(i)\n selist = []\n ends = [-1]\n for l in d.values():\n for i in range(len(l)-1):\n if l[i+1]-1>l[i]:\n selist.append([l[i],l[i+1]])\n ends.append(l[i+1])\n selist = [[-1,-1]]+sorted(selist,key=lambda x:x[1])\n \n \n \n \n ends.sort()\n dp = [0]*(len(selist))\n for i in range(1,len(selist)):\n dp[i] = dp[i-1]+1\n ind = bisect_right(ends,selist[i][0])\n dp[i] += dp[ind-1]\n ans = dp[-1]+1\n ans %= mod\n return ans\nprint(solve())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589918722", "date2": "1589920556", "bleu_score": "0.8505251010309565", "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, 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, 0, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "6\n4\n2\n3\n2\n4\n2\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["from collections import defaultdict\nfrom bisect import *\ndef solve(): # (0): solve=\n d = defaultdict(lambda: []) # (2): d=defaultdict(. at 0x000002997FBC5B40>, {})\n N = int(input()) # (3): N=6\n for i in range(N): # (4): i=0 (7): i=1 ... (22): NO CHANGE\n a = int(input()) # (5): a=4 (8): a=2 ... (20): a=2\n d[a].append(i) # (6): d=defaultdict(. at 0x000002997FBC5B40>, {4: [0]}) (9): d=defaultdict(. at 0x000002997FBC5B40>, {4: [0], 2: [1]}) ... (21): d=defaultdict(. at 0x000002997FBC5B40>, {4: [0, 4], 2: [1, 3, 5], 3: [2]})\n selist = [] # (23): selist=[]\n for l in d.values(): # (24): l=[0, 4] (29): l=[1, 3, 5] ... (39): NO CHANGE\n for i in range(len(l)-1): # (25): i=0 (28): NO CHANGE ... (38): NO CHANGE\n if l[i+1]-1>l[i]: # (26): NO CHANGE (31): NO CHANGE (34): NO CHANGE\n selist.append([l[i],l[i+1]]) # (27): selist=[[0, 4]] (32): selist (35): selist\n start_sort = sorted(selist) # (40): start_sort\n e_ind = {} # (41): e_ind={}\n for i,(s,e) in enumerate(start_sort): # (42): i=0, s=0, e=4 (44): i=1, s=1, e=3 ... (48): NO CHANGE\n e_ind[e] = i # (43): e_ind={4: 0} (45): e_ind={4: 0, 3: 1} (47): e_ind={4: 0, 3: 1, 5: 2}\n ends = list(e_ind.keys()) # (49): ends=[4, 3, 5]\n ends.sort() # (50): ends=[3, 4, 5]\n dp = [0]*(len(selist)+1) # (51): dp=[0, 0, 0, 0]\n for i in range(1,len(selist)+1): # (52): i=1 (56): i=2 ... (66): NO CHANGE\n dp[i] = dp[i-1]+1 # (53): dp=[0, 1, 0, 0] (57): dp=[0, 1, 2, 0] (61): dp=[0, 1, 2, 3]\n ind = bisect_right(ends,selist[i-1][0]) # (54): ind=0 (58): NO CHANGE (62): ind=1\n if ind>0: # (55): NO CHANGE (59): NO CHANGE (63): NO CHANGE\n j = e_ind[ends[ind-1]] # (64): j=1\n dp[i] += dp[j+1] # (65): dp=[0, 1, 2, 5]\n ans = dp[-1]+1\n return ans\nprint(solve()) # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import defaultdict\n from bisect import *\n def solve():\n+ mod = 10**9+7\n d = defaultdict(lambda: [])\n N = int(input())\n for i in range(N):\n a = int(input())\n d[a].append(i)\n selist = []\n+ ends = [-1]\n for l in d.values():\n for i in range(len(l)-1):\n if l[i+1]-1>l[i]:\n selist.append([l[i],l[i+1]])\n- start_sort = sorted(selist)\n- e_ind = {}\n- for i,(s,e) in enumerate(start_sort):\n- e_ind[e] = i\n- ends = list(e_ind.keys())\n+ ends.append(l[i+1])\n+ selist = [[-1,-1]]+sorted(selist,key=lambda x:x[1])\n+ \n+ \n+ \n+ \n ends.sort()\n- dp = [0]*(len(selist)+1)\n- for i in range(1,len(selist)+1):\n+ dp = [0]*(len(selist))\n+ for i in range(1,len(selist)):\n dp[i] = dp[i-1]+1\n- ind = bisect_right(ends,selist[i-1][0])\n- if ind>0:\n- j = e_ind[ends[ind-1]]\n- dp[i] += dp[j+1]\n+ ind = bisect_right(ends,selist[i][0])\n+ dp[i] += dp[ind-1]\n ans = dp[-1]+1\n+ ans %= mod\n return ans\n print(solve())\n", "FL_content": " from collections import defaultdict\n from bisect import *\n def solve():\n d = defaultdict(lambda: [])\n N = int(input())\n for i in range(N):\n a = int(input())\n d[a].append(i)\n selist = []\n for l in d.values():\n for i in range(len(l)-1):\n if l[i+1]-1>l[i]:\n selist.append([l[i],l[i+1]])\n- start_sort = sorted(selist)\n- e_ind = {}\n- for i,(s,e) in enumerate(start_sort):\n- e_ind[e] = i\n- ends = list(e_ind.keys())\n ends.sort()\n- dp = [0]*(len(selist)+1)\n- for i in range(1,len(selist)+1):\n dp[i] = dp[i-1]+1\n- ind = bisect_right(ends,selist[i-1][0])\n- if ind>0:\n- j = e_ind[ends[ind-1]]\n- dp[i] += dp[j+1]\n ans = dp[-1]+1\n return ans\n print(solve())\n", "added_lines": 13, "removed_lines": 11, "code1_lines": 29 }, { "user_id": "u797673668", "problem_id": "p02365", "submission1_id": "s919826151", "submission2_id": "s289031537", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\nfrom itertools import chain\n\nnv, ne, r = map(int, input().split())\n\nin_edges = defaultdict(set)\nout_edges = defaultdict(set)\nwhile ne:\n s, t, w = map(int, input().split())\n in_edges[t].add((w, s))\n out_edges[s].add((w, t))\n ne -= 1\n\n\ndef chu_liu_edmond(vertices):\n global in_edges, out_edges, nv, r\n\n total_cost = 0\n prev_v = {v: None for v in vertices}\n next_vs = {v: set() for v in vertices}\n\n for t in vertices:\n if t == r:\n continue\n min_in_w, min_in_s = min(in_edges[t])\n total_cost += min_in_w\n prev_v[t] = min_in_s\n next_vs[min_in_s].add(t)\n\n visited = {r}\n queue = set(next_vs[r])\n while queue:\n t = queue.pop()\n visited.add(t)\n queue.update(next_vs[t])\n\n cycles = []\n for i in vertices:\n if i in visited:\n continue\n\n cycle_vertices = set()\n while i not in visited:\n visited.add(i)\n cycle_vertices.add(i)\n i = prev_v[i]\n\n \n if i not in cycle_vertices:\n continue\n\n \n cycle_vertices, j = {i}, prev_v[i]\n while j != i:\n cycle_vertices.add(j)\n j = prev_v[j]\n\n cycles.append(cycle_vertices)\n\n if not cycles:\n return total_cost\n\n for cycle in cycles:\n vertices.difference_update(cycle)\n vertices.add(nv)\n\n for v in cycle:\n for w, t in out_edges[v]:\n if t in vertices:\n out_edges[nv].add((w, t))\n in_edges[t].remove((w, v))\n in_edges[t].add((w, nv))\n for w, s in in_edges[v]:\n if s in vertices:\n new_w = w + min(in_edges[v])[0]\n in_edges[nv].add((new_w, s))\n out_edges[s].remove((w, v))\n out_edges[s].add((new_w, nv))\n del in_edges[v]\n del out_edges[v]\n\n nv += 1\n\n return chu_liu_edmond(vertices)\n\n\nprint(chu_liu_edmond(set(range(nv))))", "code2": "from collections import defaultdict\nfrom itertools import chain\n\nnv, ne, r = map(int, input().split())\n\nin_edges = defaultdict(set)\nout_edges = defaultdict(set)\nwhile ne:\n s, t, w = map(int, input().split())\n in_edges[t].add((w, s))\n out_edges[s].add((w, t))\n ne -= 1\n\n\ndef chu_liu_edmond(vertices, cycle_cost):\n global in_edges, out_edges, nv, r\n\n total_cost = cycle_cost\n prev_v = {v: None for v in vertices}\n next_vs = {v: set() for v in vertices}\n\n for t in vertices:\n if t == r:\n continue\n min_in_w, min_in_s = min(in_edges[t])\n total_cost += min_in_w\n prev_v[t] = min_in_s\n next_vs[min_in_s].add(t)\n\n visited = {r}\n queue = set(next_vs[r])\n while queue:\n t = queue.pop()\n visited.add(t)\n queue.update(next_vs[t])\n\n cycles = []\n for i in vertices:\n if i in visited:\n continue\n\n cycle_vertices = set()\n while i not in visited:\n visited.add(i)\n cycle_vertices.add(i)\n i = prev_v[i]\n\n \n if i not in cycle_vertices:\n continue\n\n \n cycle_vertices, j = {i}, prev_v[i]\n while j != i:\n cycle_vertices.add(j)\n j = prev_v[j]\n\n cycles.append(cycle_vertices)\n\n if not cycles:\n return total_cost\n\n for cycle in cycles:\n vertices.difference_update(cycle)\n vertices.add(nv)\n\n for v in cycle:\n prev_e_cost = min(in_edges[v])[0]\n cycle_cost += prev_e_cost\n for w, t in out_edges[v]:\n if t in vertices:\n out_edges[nv].add((w, t))\n in_edges[t].remove((w, v))\n in_edges[t].add((w, nv))\n for w, s in in_edges[v]:\n if s in vertices:\n new_w = w - prev_e_cost\n in_edges[nv].add((new_w, s))\n out_edges[s].remove((w, v))\n out_edges[s].add((new_w, nv))\n del in_edges[v]\n del out_edges[v]\n\n nv += 1\n\n return chu_liu_edmond(vertices, cycle_cost)\n\n\nprint(chu_liu_edmond(set(range(nv)), 0))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1455916968", "date2": "1455918452", "bleu_score": "0.944922089910863", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 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": 102, "input": "6 10 0\n0 2 7\n0 0 0\n0 3 5\n1 4 0\n2 1 6\n1 3 2\n3 1 3\n4 0 2\n1 5 8\n2 3 3\n", "actual_output": "20\n", "expected_output": "21\n\n", "anno_code": ["from collections import defaultdict\nfrom itertools import chain\n\nnv, ne, r = map(int, input().split()) # (0): nv=6, ne=10, r=0\n\nin_edges = defaultdict(set) # (1): in_edges=defaultdict(, {})\nout_edges = defaultdict(set) # (2): out_edges=defaultdict(, {})\nwhile ne: # (3): NO CHANGE (8): NO CHANGE ... (53): NO CHANGE\n s, t, w = map(int, input().split()) # (4): s=0, t=2, w=7 (9): t=0, w=0 ... (49): s=2, t=3, w=3\n in_edges[t].add((w, s)) # (5): in_edges=defaultdict(, {2: {(7, 0)}}) (10): in_edges=defaultdict(, {2: {(7, 0)}, 0: {(0, 0)}}) ... (50): in_edges=defaultdict(, {2: {(7, 0)}, 0: {(2, 4), (0, 0)}, 3: {(3, 2), (5, 0), (2, 1)}, 4: {(0, 1)}, 1: {(6, 2), (3, 3)}, 5: {(8, 1)}})\n out_edges[s].add((w, t)) # (6): out_edges=defaultdict(, {0: {(7, 2)}}) (11): out_edges=defaultdict(, {0: {(7, 2), (0, 0)}}) ... (51): out_edges=defaultdict(, {0: {(5, 3), (7, 2), (0, 0)}, 1: {(2, 3), (0, 4), (8, 5)}, 2: {(6, 1), (3, 3)}, 3: {(3, 1)}, 4: {(2, 0)}})\n ne -= 1 # (7): ne=9 (12): ne=8 ... (52): ne=0\n\n\ndef chu_liu_edmond(vertices): # (54): chu_liu_edmond=\n global in_edges, out_edges, nv, r\n\n total_cost = 0 # (56): total_cost=0 (203): total_cost=0\n prev_v = {v: None for v in vertices} # (57): prev_v={0: None, 1: None, 2: None, 3: None, 4: None, 5: None} (204): prev_v={0: None, 2: None, 4: None, 5: None, 6: None}\n next_vs = {v: set() for v in vertices} # (58): next_vs={0: set(), 1: set(), 2: set(), 3: set(), 4: set(), 5: set()} (205): next_vs={0: set(), 2: set(), 4: set(), 5: set(), 6: set()}\n\n for t in vertices: # (59): t=0 (62): t=1 ... (233): NO CHANGE\n if t == r: # (60): NO CHANGE (63): NO CHANGE ... (228): NO CHANGE\n continue # (61): NO CHANGE (208): NO CHANGE\n min_in_w, min_in_s = min(in_edges[t]) # (64): min_in_w=3, min_in_s=3 (70): min_in_w=7, min_in_s=0 ... (229): min_in_w=5, min_in_s=2\n total_cost += min_in_w # (65): total_cost=3 (71): total_cost=10 ... (230): total_cost=20\n prev_v[t] = min_in_s # (66): prev_v={0: None, 1: 3, 2: None, 3: None, 4: None, 5: None} (72): prev_v={0: None, 1: 3, 2: 0, 3: None, 4: None, 5: None} ... (231): prev_v={0: None, 2: 0, 4: 6, 5: 6, 6: 2}\n next_vs[min_in_s].add(t) # (67): next_vs={0: set(), 1: set(), 2: set(), 3: {1}, 4: set(), 5: set()} (73): next_vs={0: {2}, 1: set(), 2: set(), 3: {1}, 4: set(), 5: set()} ... (232): next_vs={0: {2}, 2: {6}, 4: set(), 5: set(), 6: {4, 5}}\n\n visited = {r} # (93): visited={0} (234): visited={0}\n queue = set(next_vs[r]) # (94): queue={2} (235): queue={2}\n while queue: # (95): NO CHANGE (99): NO CHANGE ... (252): NO CHANGE\n t = queue.pop() # (96): t=2, queue=set() (237): t=2, queue=set() ... (249): t=5, queue=set()\n visited.add(t) # (97): visited={0, 2} (238): visited={0, 2} ... (250): visited={0, 2, 4, 5, 6}\n queue.update(next_vs[t]) # (98): NO CHANGE (239): queue={6} ... (251): NO CHANGE\n\n cycles = [] # (100): cycles=[] (253): cycles=[]\n for i in vertices: # (101): i=0 (104): i=1 ... (269): NO CHANGE\n if i in visited: # (102): NO CHANGE (105): NO CHANGE ... (267): NO CHANGE\n continue # (103): NO CHANGE (125): NO CHANGE ... (268): NO CHANGE\n\n cycle_vertices = set() # (106): cycle_vertices=set() (131): cycle_vertices=set() (141): cycle_vertices=set()\n while i not in visited: # (107): NO CHANGE (111): NO CHANGE ... (146): NO CHANGE\n visited.add(i) # (108): visited={0, 1, 2} (112): visited={0, 1, 2, 3} ... (143): visited={0, 1, 2, 3, 4, 5}\n cycle_vertices.add(i) # (109): cycle_vertices={1} (113): cycle_vertices={1, 3} ... (144): cycle_vertices={5}\n i = prev_v[i] # (110): i=3 (114): i=1 ... (145): i=1\n\n \n if i not in cycle_vertices: # (116): NO CHANGE (137): NO CHANGE (147): NO CHANGE\n continue # (138): NO CHANGE (148): NO CHANGE\n\n \n cycle_vertices, j = {i}, prev_v[i] # (117): cycle_vertices={1}, j=3\n while j != i: # (118): NO CHANGE (121): NO CHANGE\n cycle_vertices.add(j) # (119): cycle_vertices={1, 3}\n j = prev_v[j] # (120): j=1\n\n cycles.append(cycle_vertices) # (122): cycles=[{1, 3}]\n\n if not cycles: # (150): NO CHANGE\n return total_cost\n\n for cycle in cycles: # (151): cycle={1, 3} (202): NO CHANGE\n vertices.difference_update(cycle) # (152): vertices={0, 2, 4, 5}\n vertices.add(nv) # (153): vertices={0, 2, 4, 5, 6}\n\n for v in cycle: # (154): v=1 (179): v=3 (200): NO CHANGE\n for w, t in out_edges[v]: # (155): t=3, w=2 (157): t=4, w=0 ... (182): NO CHANGE\n if t in vertices: # (156): NO CHANGE (158): NO CHANGE ... (181): NO CHANGE\n out_edges[nv].add((w, t)) # (159): NO CHANGE (164): NO CHANGE\n in_edges[t].remove((w, v)) # (160): NO CHANGE (165): NO CHANGE\n in_edges[t].add((w, nv)) # (161): NO CHANGE (166): NO CHANGE\n for w, s in in_edges[v]: # (168): w=6, s=2 (174): w=3, s=3 ... (197): NO CHANGE\n if s in vertices: # (169): NO CHANGE (175): NO CHANGE ... (196): NO CHANGE\n new_w = w + min(in_edges[v])[0] # (170): new_w=9 (185): new_w=5 (191): new_w=7\n in_edges[nv].add((new_w, s)) # (171): NO CHANGE (186): NO CHANGE (192): NO CHANGE\n out_edges[s].remove((w, v)) # (172): NO CHANGE (187): NO CHANGE (193): NO CHANGE\n out_edges[s].add((new_w, nv)) # (173): NO CHANGE (188): NO CHANGE (194): NO CHANGE\n del in_edges[v] # (177): NO CHANGE (198): NO CHANGE\n del out_edges[v] # (178): NO CHANGE (199): NO CHANGE\n\n nv += 1 # (201): NO CHANGE\n\n return chu_liu_edmond(vertices)\n\n\nprint(chu_liu_edmond(set(range(nv)))) # (55): vertices={0, 1, 2, 3, 4, 5}\n"], "anno_status": [false], "diff_content": " from collections import defaultdict\n from itertools import chain\n \n nv, ne, r = map(int, input().split())\n \n in_edges = defaultdict(set)\n out_edges = defaultdict(set)\n while ne:\n s, t, w = map(int, input().split())\n in_edges[t].add((w, s))\n out_edges[s].add((w, t))\n ne -= 1\n \n \n-def chu_liu_edmond(vertices):\n+def chu_liu_edmond(vertices, cycle_cost):\n global in_edges, out_edges, nv, r\n \n- total_cost = 0\n+ total_cost = cycle_cost\n prev_v = {v: None for v in vertices}\n next_vs = {v: set() for v in vertices}\n \n for t in vertices:\n if t == r:\n continue\n min_in_w, min_in_s = min(in_edges[t])\n total_cost += min_in_w\n prev_v[t] = min_in_s\n next_vs[min_in_s].add(t)\n \n visited = {r}\n queue = set(next_vs[r])\n while queue:\n t = queue.pop()\n visited.add(t)\n queue.update(next_vs[t])\n \n cycles = []\n for i in vertices:\n if i in visited:\n continue\n \n cycle_vertices = set()\n while i not in visited:\n visited.add(i)\n cycle_vertices.add(i)\n i = prev_v[i]\n \n \n if i not in cycle_vertices:\n continue\n \n \n cycle_vertices, j = {i}, prev_v[i]\n while j != i:\n cycle_vertices.add(j)\n j = prev_v[j]\n \n cycles.append(cycle_vertices)\n \n if not cycles:\n return total_cost\n \n for cycle in cycles:\n vertices.difference_update(cycle)\n vertices.add(nv)\n \n for v in cycle:\n+ prev_e_cost = min(in_edges[v])[0]\n+ cycle_cost += prev_e_cost\n for w, t in out_edges[v]:\n if t in vertices:\n out_edges[nv].add((w, t))\n in_edges[t].remove((w, v))\n in_edges[t].add((w, nv))\n for w, s in in_edges[v]:\n if s in vertices:\n- new_w = w + min(in_edges[v])[0]\n+ new_w = w - prev_e_cost\n in_edges[nv].add((new_w, s))\n out_edges[s].remove((w, v))\n out_edges[s].add((new_w, nv))\n del in_edges[v]\n del out_edges[v]\n \n nv += 1\n \n- return chu_liu_edmond(vertices)\n+ return chu_liu_edmond(vertices, cycle_cost)\n \n \n-print(chu_liu_edmond(set(range(nv))))\n+print(chu_liu_edmond(set(range(nv)), 0))\n", "FL_content": " from collections import defaultdict\n from itertools import chain\n \n nv, ne, r = map(int, input().split())\n \n in_edges = defaultdict(set)\n out_edges = defaultdict(set)\n while ne:\n s, t, w = map(int, input().split())\n in_edges[t].add((w, s))\n out_edges[s].add((w, t))\n ne -= 1\n \n \n-def chu_liu_edmond(vertices):\n global in_edges, out_edges, nv, r\n \n- total_cost = 0\n prev_v = {v: None for v in vertices}\n next_vs = {v: set() for v in vertices}\n \n for t in vertices:\n if t == r:\n continue\n min_in_w, min_in_s = min(in_edges[t])\n total_cost += min_in_w\n prev_v[t] = min_in_s\n next_vs[min_in_s].add(t)\n \n visited = {r}\n queue = set(next_vs[r])\n while queue:\n t = queue.pop()\n visited.add(t)\n queue.update(next_vs[t])\n \n cycles = []\n for i in vertices:\n if i in visited:\n continue\n \n cycle_vertices = set()\n while i not in visited:\n visited.add(i)\n cycle_vertices.add(i)\n i = prev_v[i]\n \n \n if i not in cycle_vertices:\n continue\n \n \n cycle_vertices, j = {i}, prev_v[i]\n while j != i:\n cycle_vertices.add(j)\n j = prev_v[j]\n \n cycles.append(cycle_vertices)\n \n if not cycles:\n return total_cost\n \n for cycle in cycles:\n vertices.difference_update(cycle)\n vertices.add(nv)\n \n for v in cycle:\n for w, t in out_edges[v]:\n if t in vertices:\n out_edges[nv].add((w, t))\n in_edges[t].remove((w, v))\n in_edges[t].add((w, nv))\n for w, s in in_edges[v]:\n if s in vertices:\n- new_w = w + min(in_edges[v])[0]\n in_edges[nv].add((new_w, s))\n out_edges[s].remove((w, v))\n out_edges[s].add((new_w, nv))\n del in_edges[v]\n del out_edges[v]\n \n nv += 1\n \n- return chu_liu_edmond(vertices)\n \n \n-print(chu_liu_edmond(set(range(nv))))\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 87 }, { "user_id": "u214617707", "problem_id": "p02950", "submission1_id": "s462868094", "submission2_id": "s385441709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "p = int(input())\na = list(map(int, input().split()))\nMOD = p\n\nP = p\nfact = [0] * P\nfact[0] = 1\nfor i in range(1, P):\n fact[i] = fact[i - 1] * i\n fact[i] %= MOD\n\nrfact = [0] * P\nrfact[P - 1] = pow(fact[P - 1], MOD - 2, MOD)\nfor i in range(P - 2, -1, -1):\n rfact[i] = rfact[i + 1] * (i + 1)\n rfact[i] %= MOD\n\n\ndef comb(n, k):\n return fact[n] * rfact[n - k] * rfact[k] % MOD\n\n\nb = [0] * p\nfor i in range(p):\n if a[i]:\n b[0] += 1\n b[0] %= MOD\n s = 1\n for j in range(p):\n b[j] -= comb(p - 1, j) * s\n b[j] %= MOD\n s *= -i\n s %= MOD\n\nprint(*b)", "code2": "import sys\ninput = sys.stdin.readline\np = int(input())\na = list(map(int, input().split()))\nMOD = p\n\nP = p\nfact = [0] * P\nfact[0] = 1\nfor i in range(1, P):\n fact[i] = fact[i - 1] * i\n fact[i] %= MOD\n\nrfact = [0] * P\nrfact[P - 1] = pow(fact[P - 1], MOD - 2, MOD)\nfor i in range(P - 2, -1, -1):\n rfact[i] = rfact[i + 1] * (i + 1)\n rfact[i] %= MOD\n\n\ndef comb(n, k):\n return fact[n] * rfact[n - k] * rfact[k] % MOD\n\n\nb = [0] * p\nfor i in range(p):\n if a[i]:\n b[0] += 1\n b[0] %= MOD\n s = 1\n for j in range(p - 1, -1, -1):\n b[j] -= comb(p - 1, j) * s\n b[j] %= MOD\n s *= -i\n s %= MOD\n\nprint(*b)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565670758", "date2": "1565670845", "bleu_score": "0.922275115406545", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 21, "input": "5\n1 1 0 0 1\n", "actual_output": "0 0 3 0 3\n", "expected_output": "1 0 3 0 2\n\n", "anno_code": ["p = int(input()) # (0): p=5\na = list(map(int, input().split())) # (1): a=[1, 1, 0, 0, 1]\nMOD = p # (2): MOD=5\n\nP = p # (3): P=5\nfact = [0] * P # (4): fact=[0, 0, 0, 0, 0]\nfact[0] = 1 # (5): fact=[1, 0, 0, 0, 0]\nfor i in range(1, P): # (6): i=1 (9): i=2 ... (18): NO CHANGE\n fact[i] = fact[i - 1] * i # (7): fact=[1, 1, 0, 0, 0] (10): fact=[1, 1, 2, 0, 0] ... (16): fact=[1, 1, 2, 1, 4]\n fact[i] %= MOD # (8): NO CHANGE (11): NO CHANGE ... (17): NO CHANGE\n\nrfact = [0] * P # (19): rfact=[0, 0, 0, 0, 0]\nrfact[P - 1] = pow(fact[P - 1], MOD - 2, MOD) # (20): rfact=[0, 0, 0, 0, 4]\nfor i in range(P - 2, -1, -1): # (21): i=3 (24): i=2 ... (33): NO CHANGE\n rfact[i] = rfact[i + 1] * (i + 1) # (22): rfact=[0, 0, 0, 16, 4] (25): rfact=[0, 0, 3, 1, 4] ... (31): rfact=[1, 1, 3, 1, 4]\n rfact[i] %= MOD # (23): rfact=[0, 0, 0, 1, 4] (26): NO CHANGE ... (32): NO CHANGE\n\n\ndef comb(n, k): # (34): comb=\n return fact[n] * rfact[n - k] * rfact[k] % MOD\n\n\nb = [0] * p # (35): b=[0, 0, 0, 0, 0]\nfor i in range(p): # (36): NO CHANGE (67): i=1 ... (133): NO CHANGE\n if a[i]: # (37): NO CHANGE (68): NO CHANGE ... (103): NO CHANGE\n b[0] += 1 # (38): b=[1, 0, 0, 0, 0] (69): b=[1, 0, 0, 0, 0] (104): b=[1, 4, 4, 4, 4]\n b[0] %= MOD # (39): NO CHANGE (70): NO CHANGE (105): NO CHANGE\n s = 1 # (40): s=1 (71): s=1 (106): s=1\n for j in range(p): # (41): j=0 (46): j=1 ... (132): NO CHANGE\n b[j] -= comb(p - 1, j) * s # (42): b=[0, 0, 0, 0, 0] (47): NO CHANGE ... (128): b=[0, 0, 3, 0, 3]\n b[j] %= MOD # (43): NO CHANGE (48): NO CHANGE ... (129): NO CHANGE\n s *= -i # (44): s=0 (49): NO CHANGE ... (130): s=-4\n s %= MOD # (45): NO CHANGE (50): NO CHANGE ... (131): s=1\n\nprint(*b)"], "anno_status": [true], "diff_content": "+import sys\n+input = sys.stdin.readline\n p = int(input())\n a = list(map(int, input().split()))\n MOD = p\n \n P = p\n fact = [0] * P\n fact[0] = 1\n for i in range(1, P):\n fact[i] = fact[i - 1] * i\n fact[i] %= MOD\n \n rfact = [0] * P\n rfact[P - 1] = pow(fact[P - 1], MOD - 2, MOD)\n for i in range(P - 2, -1, -1):\n rfact[i] = rfact[i + 1] * (i + 1)\n rfact[i] %= MOD\n \n \n def comb(n, k):\n return fact[n] * rfact[n - k] * rfact[k] % MOD\n \n \n b = [0] * p\n for i in range(p):\n if a[i]:\n b[0] += 1\n b[0] %= MOD\n s = 1\n- for j in range(p):\n+ for j in range(p - 1, -1, -1):\n b[j] -= comb(p - 1, j) * s\n b[j] %= MOD\n s *= -i\n s %= MOD\n \n print(*b)\n+\n", "FL_content": " p = int(input())\n a = list(map(int, input().split()))\n MOD = p\n \n P = p\n fact = [0] * P\n fact[0] = 1\n for i in range(1, P):\n fact[i] = fact[i - 1] * i\n fact[i] %= MOD\n \n rfact = [0] * P\n rfact[P - 1] = pow(fact[P - 1], MOD - 2, MOD)\n for i in range(P - 2, -1, -1):\n rfact[i] = rfact[i + 1] * (i + 1)\n rfact[i] %= MOD\n \n \n def comb(n, k):\n return fact[n] * rfact[n - k] * rfact[k] % MOD\n \n \n b = [0] * p\n for i in range(p):\n if a[i]:\n b[0] += 1\n b[0] %= MOD\n s = 1\n- for j in range(p):\n b[j] -= comb(p - 1, j) * s\n b[j] %= MOD\n s *= -i\n s %= MOD\n \n print(*b)\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 35 }, { "user_id": "u969190727", "problem_id": "p02950", "submission1_id": "s243982871", "submission2_id": "s944495562", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\np=int(input())\nA=[int(i) for i in input().split()]\nB=[0]*p\n\nP=[[0]*p for _ in range(p)]\nfor i in range(1,p): \n for j in range(p):\n if j==0:\n P[i][j]=i\n else:\n P[i][j]=(P[i][j-1]*i)%p\nPP=[0]*p\nfor i in range(1,p):\n for j in range(1,p):\n PP[j]=(PP[j]+P[i][j])%p\nfor i in range(p):\n a=A[i]\n B[0]-=a\n for j in range(1,p):\n B[j]-=a*PP[j]\n if j==p-1:\n B[j]+=a\nB=B[::-1]\nfor i in range(p):\n B[i]%=p\nprint(*B)", "code2": "import sys\ninput = sys.stdin.readline\np=int(input())\nA=[int(i) for i in input().split()]\nB=[0]*p\n\nP=[[0]*p for _ in range(p)]\nfor i in range(1,p): \n for j in range(1,p):\n if j==1:\n P[i][j]=i\n else:\n P[i][j]=(P[i][j-1]*i)%p\n\nfor i in range(p):\n a=A[i]\n B[0]-=a\n for j in range(1,p):\n B[j]-=a*P[i][j]\n if j==p-1:\n B[j]+=a\nB=B[::-1]\nfor i in range(p):\n B[i]%=p\nprint(*B)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565535760", "date2": "1565536363", "bleu_score": "0.8171584102650067", "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": "5\n0 0 0 0 1\n", "actual_output": "1 1 0 0 4\n", "expected_output": "0 1 4 1 4\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\np=int(input()) # (1): p=5\nA=[int(i) for i in input().split()] # (2): A=[0, 0, 0, 0, 1]\nB=[0]*p # (3): B=[0, 0, 0, 0, 0]\n\nP=[[0]*p for _ in range(p)] # (4): P\nfor i in range(1,p): # (5): i=1 (22): i=2 ... (73): NO CHANGE\n for j in range(p): # (6): j=0 (9): j=1 ... (72): NO CHANGE\n if j==0: # (7): NO CHANGE (10): NO CHANGE ... (70): NO CHANGE\n P[i][j]=i # (8): P (25): P ... (59): P\n else:\n P[i][j]=(P[i][j-1]*i)%p # (11): P (14): P ... (71): P\nPP=[0]*p # (74): PP=[0, 0, 0, 0, 0]\nfor i in range(1,p): # (75): i=1 (85): i=2 ... (115): NO CHANGE\n for j in range(1,p): # (76): j=1 (78): j=2 ... (114): NO CHANGE\n PP[j]=(PP[j]+P[i][j])%p # (77): PP=[0, 1, 0, 0, 0] (79): PP=[0, 1, 1, 0, 0] ... (113): PP=[0, 0, 0, 4, 0]\nfor i in range(p): # (116): i=0 (133): i=1 ... (201): NO CHANGE\n a=A[i] # (117): a=0 (134): NO CHANGE ... (185): a=1\n B[0]-=a # (118): NO CHANGE (135): NO CHANGE ... (186): B=[-1, 0, 0, 0, 0]\n for j in range(1,p): # (119): j=1 (122): j=2 ... (200): NO CHANGE\n B[j]-=a*PP[j] # (120): NO CHANGE (123): NO CHANGE ... (197): NO CHANGE\n if j==p-1: # (121): NO CHANGE (124): NO CHANGE ... (198): NO CHANGE\n B[j]+=a # (131): NO CHANGE (148): NO CHANGE ... (199): B=[-1, 0, 0, -4, 1]\nB=B[::-1] # (202): B=[1, -4, 0, 0, -1]\nfor i in range(p): # (203): i=0 (205): i=1 ... (213): NO CHANGE\n B[i]%=p # (204): NO CHANGE (206): B=[1, 1, 0, 0, -1] ... (212): B=[1, 1, 0, 0, 4]\nprint(*B)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n p=int(input())\n A=[int(i) for i in input().split()]\n B=[0]*p\n \n P=[[0]*p for _ in range(p)]\n for i in range(1,p): \n- for j in range(p):\n- if j==0:\n+ for j in range(1,p):\n+ if j==1:\n P[i][j]=i\n else:\n P[i][j]=(P[i][j-1]*i)%p\n-PP=[0]*p\n-for i in range(1,p):\n- for j in range(1,p):\n- PP[j]=(PP[j]+P[i][j])%p\n+\n for i in range(p):\n a=A[i]\n B[0]-=a\n for j in range(1,p):\n- B[j]-=a*PP[j]\n+ B[j]-=a*P[i][j]\n if j==p-1:\n B[j]+=a\n B=B[::-1]\n for i in range(p):\n B[i]%=p\n print(*B)\n", "FL_content": " import sys\n input = sys.stdin.readline\n p=int(input())\n A=[int(i) for i in input().split()]\n B=[0]*p\n \n P=[[0]*p for _ in range(p)]\n for i in range(1,p): \n- for j in range(p):\n- if j==0:\n P[i][j]=i\n else:\n P[i][j]=(P[i][j-1]*i)%p\n-PP=[0]*p\n-for i in range(1,p):\n- for j in range(1,p):\n- PP[j]=(PP[j]+P[i][j])%p\n for i in range(p):\n a=A[i]\n B[0]-=a\n for j in range(1,p):\n- B[j]-=a*PP[j]\n if j==p-1:\n B[j]+=a\n B=B[::-1]\n for i in range(p):\n B[i]%=p\n print(*B)\n", "added_lines": 4, "removed_lines": 7, "code1_lines": 28 }, { "user_id": "u104282757", "problem_id": "p02950", "submission1_id": "s224368606", "submission2_id": "s792983258", "status1": "Wrong Answer", "status2": "Accepted", "code1": "p = int(input())\na_list = list(map(int, input().split()))\nr_list = [0] * p\n\nfact = [0] * p\nfact[0] = 1\nfor i in range(1, p):\n fact[i] = fact[i - 1] * i % p\n\nfact_inv = [0] * p\nfact_inv[-1] = pow(fact[-1], p-2, p)\nfor i in range(p-2, -1 ,-1):\n fact_inv[i] = (fact_inv[i+1] * (i+1)) % p\n\nncr = [(fact[p-1] * fact_inv[p-1-i] * fact_inv[i]) % p for i in range(p)]\n\nfor j in range(p):\n if a_list[j] == 0:\n continue\n k = 1\n for i in range(p-1, -1, -1):\n r_list[i] -= ncr[i] * k\n r_list[i] %= p\n k *= -j\n k %= p\n r_list[0] += 1\n\n\nprint(*r_list)\n", "code2": "p = int(input())\na_list = list(map(int, input().split()))\nr_list = [0] * p\n\nfact = [0] * p\nfact[0] = 1\nfor i in range(1, p):\n fact[i] = fact[i - 1] * i % p\n\nfact_inv = [0] * p\nfact_inv[-1] = pow(fact[-1], p-2, p)\nfor i in range(p-2, -1 ,-1):\n fact_inv[i] = (fact_inv[i+1] * (i+1)) % p\n\nncr = [(fact[p-1] * fact_inv[p-1-i] * fact_inv[i]) % p for i in range(p)]\n\nfor j in range(p):\n if a_list[j] == 0:\n continue\n k = 1\n for i in range(p-1, -1, -1):\n r_list[i] -= ncr[i] * k\n r_list[i] %= p\n k *= -j\n k %= p\n r_list[0] += 1\n\nr_list[0] %= p\nprint(*r_list)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565503089", "date2": "1565503217", "bleu_score": "0.9743111139812723", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0], "code1_test_score": 8, "total_score": 21, "input": "5\n0 1 0 0 1\n", "actual_output": "5 0 3 0 3\n", "expected_output": "0 0 3 0 3\n\n", "anno_code": ["p = int(input()) # (0): p=5\na_list = list(map(int, input().split())) # (1): a_list=[0, 1, 0, 0, 1]\nr_list = [0] * p # (2): r_list=[0, 0, 0, 0, 0]\n\nfact = [0] * p # (3): fact=[0, 0, 0, 0, 0]\nfact[0] = 1 # (4): fact=[1, 0, 0, 0, 0]\nfor i in range(1, p): # (5): i=1 (7): i=2 ... (13): NO CHANGE\n fact[i] = fact[i - 1] * i % p # (6): fact=[1, 1, 0, 0, 0] (8): fact=[1, 1, 2, 0, 0] ... (12): fact=[1, 1, 2, 1, 4]\n\nfact_inv = [0] * p # (14): fact_inv=[0, 0, 0, 0, 0]\nfact_inv[-1] = pow(fact[-1], p-2, p) # (15): fact_inv=[0, 0, 0, 0, 4]\nfor i in range(p-2, -1 ,-1): # (16): i=3 (18): i=2 ... (24): NO CHANGE\n fact_inv[i] = (fact_inv[i+1] * (i+1)) % p # (17): fact_inv=[0, 0, 0, 1, 4] (19): fact_inv=[0, 0, 3, 1, 4] ... (23): fact_inv=[1, 1, 3, 1, 4]\n\nncr = [(fact[p-1] * fact_inv[p-1-i] * fact_inv[i]) % p for i in range(p)] # (25): ncr=[1, 4, 1, 4, 1]\n\nfor j in range(p): # (26): j=0 (29): j=1 ... (95): NO CHANGE\n if a_list[j] == 0: # (27): NO CHANGE (30): NO CHANGE ... (66): NO CHANGE\n continue # (28): NO CHANGE (61): NO CHANGE (64): NO CHANGE\n k = 1 # (31): k=1 (67): k=1\n for i in range(p-1, -1, -1): # (32): i=4 (37): i=3 ... (93): NO CHANGE\n r_list[i] -= ncr[i] * k # (33): r_list=[0, 0, 0, 0, -1] (38): r_list=[0, 0, 0, -16, 4] ... (89): r_list=[4, 0, 3, 0, 3]\n r_list[i] %= p # (34): r_list=[0, 0, 0, 0, 4] (39): r_list=[0, 0, 0, 4, 4] ... (90): NO CHANGE\n k *= -j # (35): k=-1 (40): k=-4 ... (91): k=-4\n k %= p # (36): k=4 (41): k=1 ... (92): k=1\n r_list[0] += 1 # (58): r_list=[5, 4, 4, 4, 4] (94): r_list=[5, 0, 3, 0, 3]\n\n\nprint(*r_list)\n"], "anno_status": [true], "diff_content": " p = int(input())\n a_list = list(map(int, input().split()))\n r_list = [0] * p\n \n fact = [0] * p\n fact[0] = 1\n for i in range(1, p):\n fact[i] = fact[i - 1] * i % p\n \n fact_inv = [0] * p\n fact_inv[-1] = pow(fact[-1], p-2, p)\n for i in range(p-2, -1 ,-1):\n fact_inv[i] = (fact_inv[i+1] * (i+1)) % p\n \n ncr = [(fact[p-1] * fact_inv[p-1-i] * fact_inv[i]) % p for i in range(p)]\n \n for j in range(p):\n if a_list[j] == 0:\n continue\n k = 1\n for i in range(p-1, -1, -1):\n r_list[i] -= ncr[i] * k\n r_list[i] %= p\n k *= -j\n k %= p\n r_list[0] += 1\n \n-\n+r_list[0] %= p\n print(*r_list)\n \n", "FL_content": " p = int(input())\n a_list = list(map(int, input().split()))\n r_list = [0] * p\n \n fact = [0] * p\n fact[0] = 1\n for i in range(1, p):\n fact[i] = fact[i - 1] * i % p\n \n fact_inv = [0] * p\n fact_inv[-1] = pow(fact[-1], p-2, p)\n for i in range(p-2, -1 ,-1):\n fact_inv[i] = (fact_inv[i+1] * (i+1)) % p\n \n ncr = [(fact[p-1] * fact_inv[p-1-i] * fact_inv[i]) % p for i in range(p)]\n \n for j in range(p):\n if a_list[j] == 0:\n continue\n k = 1\n for i in range(p-1, -1, -1):\n r_list[i] -= ncr[i] * k\n r_list[i] %= p\n k *= -j\n k %= p\n r_list[0] += 1\n \n-\n print(*r_list)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 30 }, { "user_id": "u337525741", "problem_id": "p02950", "submission1_id": "s684731892", "submission2_id": "s173597120", "status1": "Wrong Answer", "status2": "Accepted", "code1": "p = int(input())\nb_list = [0 for _ in range(p)]\na_list = list(map(int,input().split()))\nif a_list[0] == 1:\n a_list[0] = 0\n b_list[0] = 1\n b_list[p-1] = -1\nc = 0\nfor i in a_list:\n if i == 1:\n for j in range(p-1):\n b_list[j+1] -= (c**(p-j-1))%p\n c += 1\nfor j in b_list:\n print(j % p,end = ' ')\n", "code2": "p = int(input())\nb_list = [0 for _ in range(p-1)]\na_list = list(map(int,input().split()))\ndef frac(n):\n if a_list[n] == 1:\n t = 1\n for j in range(p-1):\n b_list[j] -= t\n t = (t*n)%p\nif a_list[0] == 1:\n b_list[0] -= 1\nfor i in range(p-1):\n frac(i+1)\nb_list.reverse()\nprint(a_list[0],end = ' ')\nfor j in b_list:\n print(j % p,end = ' ')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566147366", "date2": "1566160159", "bleu_score": "0.7467106944361037", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 21, "input": "5\n1 0 1 0 1\n", "actual_output": "1 3 3 0 3 ", "expected_output": "1 3 0 4 2\n\n", "anno_code": ["p = int(input()) # (0): p=5\nb_list = [0 for _ in range(p)] # (1): b_list=[0, 0, 0, 0, 0]\na_list = list(map(int,input().split())) # (2): a_list=[1, 0, 1, 0, 1]\nif a_list[0] == 1: # (3): NO CHANGE\n a_list[0] = 0 # (4): a_list=[0, 0, 1, 0, 1]\n b_list[0] = 1 # (5): b_list=[1, 0, 0, 0, 0]\n b_list[p-1] = -1 # (6): b_list=[1, 0, 0, 0, -1]\nc = 0 # (7): c=0\nfor i in a_list: # (8): i=0 (11): NO CHANGE ... (41): NO CHANGE\n if i == 1: # (9): NO CHANGE (12): NO CHANGE ... (30): NO CHANGE\n for j in range(p-1): # (16): j=0 (18): j=1 ... (39): NO CHANGE\n b_list[j+1] -= (c**(p-j-1))%p # (17): b_list=[1, -1, 0, 0, -1] (19): b_list=[1, -1, -3, 0, -1] ... (38): b_list=[1, -2, -7, -5, -7]\n c += 1 # (10): c=1 (13): c=2 ... (40): c=5\nfor j in b_list: # (42): j=1 (44): j=-2 ... (50): j=-7\n print(j % p,end = ' ') # (43): NO CHANGE (45): NO CHANGE ... (51): NO CHANGE\n"], "anno_status": [true], "diff_content": " p = int(input())\n-b_list = [0 for _ in range(p)]\n+b_list = [0 for _ in range(p-1)]\n a_list = list(map(int,input().split()))\n-if a_list[0] == 1:\n- a_list[0] = 0\n- b_list[0] = 1\n- b_list[p-1] = -1\n-c = 0\n-for i in a_list:\n- if i == 1:\n+def frac(n):\n+ if a_list[n] == 1:\n+ t = 1\n for j in range(p-1):\n- b_list[j+1] -= (c**(p-j-1))%p\n- c += 1\n+ b_list[j] -= t\n+ t = (t*n)%p\n+if a_list[0] == 1:\n+ b_list[0] -= 1\n+for i in range(p-1):\n+ frac(i+1)\n+b_list.reverse()\n+print(a_list[0],end = ' ')\n for j in b_list:\n print(j % p,end = ' ')\n \n", "FL_content": " p = int(input())\n-b_list = [0 for _ in range(p)]\n a_list = list(map(int,input().split()))\n-if a_list[0] == 1:\n- a_list[0] = 0\n- b_list[0] = 1\n- b_list[p-1] = -1\n-c = 0\n-for i in a_list:\n- if i == 1:\n for j in range(p-1):\n- b_list[j+1] -= (c**(p-j-1))%p\n- c += 1\n for j in b_list:\n print(j % p,end = ' ')\n \n", "added_lines": 12, "removed_lines": 10, "code1_lines": 16 }, { "user_id": "u368780724", "problem_id": "p02950", "submission1_id": "s908723991", "submission2_id": "s548122600", "status1": "Wrong Answer", "status2": "Accepted", "code1": "p = int(input())\nmod = p\n\n\ndef frac(limit):\n frac = [1]*limit\n for i in range(2,limit):\n frac[i] = i * frac[i-1]%mod\n fraci = [None]*limit\n fraci[-1] = pow(frac[-1], mod -2, mod)\n for i in range(-2, -limit-1, -1):\n fraci[i] = fraci[i+1] * (limit + i + 1) % mod\n return frac, fraci\n\nfrac, fraci = frac(p)\n\n\n\nA = list(map(int, input().split()))\n\nC = [0]*p\nfor i in range(p):\n a = A[i]\n for j in range(i):\n a = (a-C[j]*frac[i]*fraci[i-j])\n C[i] = fraci[i]*a%p\n\nB = [0]*p\nt = [0]*p\nt[0] = 1\nfor i in range(1, p):\n t2 = ([0] + t)[::-1]\n t2 = [a-b*i for a, b in zip(t2, t)]\n for j in range(p):\n B[j] += t2[j]*C[i]\n t = t2[:]\n\nB = [b%p for b in B]\nprint(*B)\n", "code2": "p = int(input())\nmod = p\n\n\ndef frac(limit):\n frac = [1]*limit\n for i in range(2,limit):\n frac[i] = i * frac[i-1]%mod\n fraci = [None]*limit\n fraci[-1] = pow(frac[-1], mod -2, mod)\n for i in range(-2, -limit-1, -1):\n fraci[i] = fraci[i+1] * (limit + i + 1) % mod\n return frac, fraci\n\nfrac, fraci = frac(p)\n\n\n\nA = list(map(int, input().split()))\n\nC = [0]*p\nfor i in range(p):\n a = A[i]\n for j in range(i):\n a = (a-C[j]*frac[i]*fraci[i-j])\n C[i] = fraci[i]*a%p\nB = [0]*p\nt = [0]*p\nt[0] = 1\nfor i in range(p):\n for j in range(p):\n B[j] += t[j]*C[i]\n t2 = ([0] + t)[:-1]\n t2 = [(a-b*i)%p for a, b in zip(t2, t)]\n t = t2[:]\n\nB = [b%p for b in B]\nprint(*B)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565491169", "date2": "1565492283", "bleu_score": "0.97971269161346", "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": "5\n0 0 0 1 1\n", "actual_output": "3 0 0 0 2\n", "expected_output": "0 4 0 3 3\n\n", "anno_code": ["p = int(input()) # (0): p=5\nmod = p # (1): mod=5\n\n\ndef frac(limit): # (2): frac=\n frac = [1]*limit # (4): frac=[1, 1, 1, 1, 1]\n for i in range(2,limit): # (5): i=2 (7): i=3 ... (11): NO CHANGE\n frac[i] = i * frac[i-1]%mod # (6): frac=[1, 1, 2, 1, 1] (8): NO CHANGE (10): frac=[1, 1, 2, 1, 4]\n fraci = [None]*limit # (12): fraci=[None, None, None, None, None]\n fraci[-1] = pow(frac[-1], mod -2, mod) # (13): fraci=[None, None, None, None, 4]\n for i in range(-2, -limit-1, -1): # (14): i=-2 (16): i=-3 ... (22): p=5, mod=5\n fraci[i] = fraci[i+1] * (limit + i + 1) % mod # (15): fraci=[None, None, None, 1, 4] (17): fraci=[None, None, 3, 1, 4] ... (21): fraci=[1, 1, 3, 1, 4]\n return frac, fraci\n\nfrac, fraci = frac(p) # (3): limit=5\n\n\n\nA = list(map(int, input().split())) # (23): A=[0, 0, 0, 1, 1]\n\nC = [0]*p # (24): C=[0, 0, 0, 0, 0]\nfor i in range(p): # (25): i=0 (29): i=1 ... (65): NO CHANGE\n a = A[i] # (26): a=0 (30): NO CHANGE ... (54): NO CHANGE\n for j in range(i): # (27): NO CHANGE (31): j=0 ... (63): NO CHANGE\n a = (a-C[j]*frac[i]*fraci[i-j]) # (32): NO CHANGE (38): NO CHANGE ... (62): a=-3\n C[i] = fraci[i]*a%p # (28): NO CHANGE (34): NO CHANGE ... (64): C=[0, 0, 0, 1, 3]\n\nB = [0]*p # (66): B=[0, 0, 0, 0, 0]\nt = [0]*p # (67): t=[0, 0, 0, 0, 0]\nt[0] = 1 # (68): t=[1, 0, 0, 0, 0]\nfor i in range(1, p): # (69): i=1 (84): i=2 ... (129): NO CHANGE\n t2 = ([0] + t)[::-1] # (70): t2=[0, 0, 0, 0, 1, 0] (85): t2=[1, 0, 0, 0, -1, 0] ... (115): t2=[12, 0, 0, 0, -12, 0]\n t2 = [a-b*i for a, b in zip(t2, t)] # (71): t2=[-1, 0, 0, 0, 1] (86): t2=[3, 0, 0, 0, -3] ... (116): t2=[60, 0, 0, 0, -60]\n for j in range(p): # (72): j=0 (74): j=1 ... (127): NO CHANGE\n B[j] += t2[j]*C[i] # (73): NO CHANGE (75): NO CHANGE ... (126): B=[168, 0, 0, 0, -168]\n t = t2[:] # (83): t=[-1, 0, 0, 0, 1] (98): t=[3, 0, 0, 0, -3] ... (128): t=[60, 0, 0, 0, -60]\n\nB = [b%p for b in B] # (130): B=[3, 0, 0, 0, 2]\nprint(*B)\n"], "anno_status": [false], "diff_content": " p = int(input())\n mod = p\n \n \n def frac(limit):\n frac = [1]*limit\n for i in range(2,limit):\n frac[i] = i * frac[i-1]%mod\n fraci = [None]*limit\n fraci[-1] = pow(frac[-1], mod -2, mod)\n for i in range(-2, -limit-1, -1):\n fraci[i] = fraci[i+1] * (limit + i + 1) % mod\n return frac, fraci\n \n frac, fraci = frac(p)\n \n \n \n A = list(map(int, input().split()))\n \n C = [0]*p\n for i in range(p):\n a = A[i]\n for j in range(i):\n a = (a-C[j]*frac[i]*fraci[i-j])\n C[i] = fraci[i]*a%p\n-\n B = [0]*p\n t = [0]*p\n t[0] = 1\n-for i in range(1, p):\n- t2 = ([0] + t)[::-1]\n- t2 = [a-b*i for a, b in zip(t2, t)]\n+for i in range(p):\n for j in range(p):\n- B[j] += t2[j]*C[i]\n+ B[j] += t[j]*C[i]\n+ t2 = ([0] + t)[:-1]\n+ t2 = [(a-b*i)%p for a, b in zip(t2, t)]\n t = t2[:]\n \n B = [b%p for b in B]\n print(*B)\n-\n", "FL_content": " p = int(input())\n mod = p\n \n \n def frac(limit):\n frac = [1]*limit\n for i in range(2,limit):\n frac[i] = i * frac[i-1]%mod\n fraci = [None]*limit\n fraci[-1] = pow(frac[-1], mod -2, mod)\n for i in range(-2, -limit-1, -1):\n fraci[i] = fraci[i+1] * (limit + i + 1) % mod\n return frac, fraci\n \n frac, fraci = frac(p)\n \n \n \n A = list(map(int, input().split()))\n \n C = [0]*p\n for i in range(p):\n a = A[i]\n for j in range(i):\n a = (a-C[j]*frac[i]*fraci[i-j])\n C[i] = fraci[i]*a%p\n-\n B = [0]*p\n t = [0]*p\n t[0] = 1\n-for i in range(1, p):\n- t2 = ([0] + t)[::-1]\n- t2 = [a-b*i for a, b in zip(t2, t)]\n for j in range(p):\n- B[j] += t2[j]*C[i]\n t = t2[:]\n \n B = [b%p for b in B]\n print(*B)\n-\n", "added_lines": 4, "removed_lines": 6, "code1_lines": 40 }, { "user_id": "u879977274", "problem_id": "p02974", "submission1_id": "s077130107", "submission2_id": "s883077259", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\ndp[(0, 1, 2)] = 1\n\ndef perm(i, j, k):\n\n if i < 0 or j < 0 or k < 0:\n return 0\n \n if (i, j, k) in dp:\n return dp[(i, j, k)]\n else:\n dp[(i, j, k)] = (j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j)\n return dp[(i, j, k)]\n\nprint(perm(n-1, 0, k))", "code2": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n if i == 0:\n if k == 0 and j == 0:\n return 1\n else:\n return 0\n elif k < 0 or j < 0 or i < j:\n return 0\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563943407", "date2": "1563945538", "bleu_score": "0.777551756256885", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1], "code1_test_score": 10, "total_score": 19, "input": "47 22\n", "actual_output": "526733790780\n", "expected_output": "733787098\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=47, k=22\ndp = {} # (1): dp={}\n\ndp[(0, 0, 0)] = 1 # (2): dp={(0, 0, 0): 1}\ndp[(0, 1, 2)] = 1 # (3): dp={(0, 0, 0): 1, (0, 1, 2): 1}\n\ndef perm(i, j, k): # (4): perm=\n\n if i < 0 or j < 0 or k < 0: # (6): NO CHANGE (9): NO CHANGE ... (22189): i=46, j=0\n return 0\n \n if (i, j, k) in dp: # (7): NO CHANGE (10): NO CHANGE ... (22181): i=44, j=0\n return dp[(i, j, k)]\n else:\n dp[(i, j, k)] = (j+j+1)*perm(i-1, j, k-2*j)\\ # (8): i=45 (11): i=44 ... (22187): NO CHANGE\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\ # (148): i=-1, j=1 (154): i=0, j=1 ... (22179): i=43, j=1\n + 1*perm(i-1, j-1, k-2*j) # (151): i=-1, j=-1 (162): i=-1, j=0, k=20 ... (22188): i=45, j=-1\n return dp[(i, j, k)]\n\nprint(perm(n-1, 0, k)) # (5): i=46, j=0\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n-dp[(0, 1, 2)] = 1\n \n def perm(i, j, k):\n-\n- if i < 0 or j < 0 or k < 0:\n- return 0\n- \n if (i, j, k) in dp:\n return dp[(i, j, k)]\n+ if i == 0:\n+ if k == 0 and j == 0:\n+ return 1\n+ else:\n+ return 0\n+ elif k < 0 or j < 0 or i < j:\n+ return 0\n else:\n- dp[(i, j, k)] = (j+j+1)*perm(i-1, j, k-2*j)\\\n+ dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j)\n+ + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n return dp[(i, j, k)]\n \n-print(perm(n-1, 0, k))\n+print(perm(n, 0, k))\n", "FL_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n-dp[(0, 1, 2)] = 1\n \n def perm(i, j, k):\n-\n- if i < 0 or j < 0 or k < 0:\n- return 0\n- \n if (i, j, k) in dp:\n return dp[(i, j, k)]\n else:\n- dp[(i, j, k)] = (j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j)\n return dp[(i, j, k)]\n \n-print(perm(n-1, 0, k))\n", "added_lines": 10, "removed_lines": 8, "code1_lines": 20 }, { "user_id": "u879977274", "problem_id": "p02974", "submission1_id": "s019454965", "submission2_id": "s883077259", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\ndp[(0, 1, 2)] = 1\n\ndef perm(i, j, k):\n if i < 0 or j < 0 or k < 0:\n return 0\n \n if (i, j, k) in dp:\n return dp[(i, j, k)]\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n return dp[(i, j, k)]\n\nprint(perm(n-1, 0, k))", "code2": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n if i == 0:\n if k == 0 and j == 0:\n return 1\n else:\n return 0\n elif k < 0 or j < 0 or i < j:\n return 0\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563943609", "date2": "1563945538", "bleu_score": "0.7968966161354397", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1], "code1_test_score": 10, "total_score": 19, "input": "47 22\n", "actual_output": "6733790416\n", "expected_output": "733787098\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=47, k=22\ndp = {} # (1): dp={}\n\ndp[(0, 0, 0)] = 1 # (2): dp={(0, 0, 0): 1}\ndp[(0, 1, 2)] = 1 # (3): dp={(0, 0, 0): 1, (0, 1, 2): 1}\n\ndef perm(i, j, k): # (4): perm=\n if i < 0 or j < 0 or k < 0: # (6): NO CHANGE (9): NO CHANGE ... (26603): i=46, j=0\n return 0\n \n if (i, j, k) in dp: # (7): NO CHANGE (10): NO CHANGE ... (26591): i=44, j=0\n return dp[(i, j, k)]\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\ # (8): i=45 (11): i=44 ... (26604): NO CHANGE\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\ # (148): i=-1, j=1 (156): i=0, j=1 ... (26589): i=43, j=1\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7) # (151): i=-1, j=-1 (154): NO CHANGE ... (26605): NO CHANGE\n return dp[(i, j, k)]\n\nprint(perm(n-1, 0, k)) # (5): i=46, j=0\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n-dp[(0, 1, 2)] = 1\n \n def perm(i, j, k):\n- if i < 0 or j < 0 or k < 0:\n- return 0\n- \n if (i, j, k) in dp:\n return dp[(i, j, k)]\n+ if i == 0:\n+ if k == 0 and j == 0:\n+ return 1\n+ else:\n+ return 0\n+ elif k < 0 or j < 0 or i < j:\n+ return 0\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n+ + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n return dp[(i, j, k)]\n \n-print(perm(n-1, 0, k))\n+print(perm(n, 0, k))\n", "FL_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n-dp[(0, 1, 2)] = 1\n \n def perm(i, j, k):\n- if i < 0 or j < 0 or k < 0:\n- return 0\n- \n if (i, j, k) in dp:\n return dp[(i, j, k)]\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n return dp[(i, j, k)]\n \n-print(perm(n-1, 0, k))\n", "added_lines": 9, "removed_lines": 6, "code1_lines": 19 }, { "user_id": "u879977274", "problem_id": "p02974", "submission1_id": "s663117803", "submission2_id": "s883077259", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n \n if i < 0 or j < 0 or k < 0 or i < j:\n return 0\n \n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "code2": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n if i == 0:\n if k == 0 and j == 0:\n return 1\n else:\n return 0\n elif k < 0 or j < 0 or i < j:\n return 0\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563945401", "date2": "1563945538", "bleu_score": "0.7713891039429527", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1], "code1_test_score": 10, "total_score": 19, "input": "20 26\n", "actual_output": "1311240788\n", "expected_output": "311240781\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=20, k=26\ndp = {} # (1): dp={}\n\ndp[(0, 0, 0)] = 1 # (2): dp={(0, 0, 0): 1}\n\ndef perm(i, j, k): # (3): perm=\n if (i, j, k) in dp: # (5): NO CHANGE (8): NO CHANGE ... (10832): NO CHANGE\n return dp[(i, j, k)]\n \n if i < 0 or j < 0 or k < 0 or i < j: # (6): NO CHANGE (9): NO CHANGE ... (10833): i=20, j=0\n return 0\n \n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\ # (7): i=19 (10): i=18 ... (10834): NO CHANGE\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\ # (70): i=-1, j=1 (80): i=0, j=1 ... (10818): i=17, j=1\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7) # (74): i=-1, j=-1 (78): NO CHANGE ... (10835): NO CHANGE\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k)) # (4): i=20, j=0\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n \n def perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n- \n- if i < 0 or j < 0 or k < 0 or i < j:\n- return 0\n- \n- dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n- + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n- return dp[(i, j, k)]\n+ if i == 0:\n+ if k == 0 and j == 0:\n+ return 1\n+ else:\n+ return 0\n+ elif k < 0 or j < 0 or i < j:\n+ return 0\n+ else:\n+ dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n+ + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n+ + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n+ return dp[(i, j, k)]\n \n print(perm(n, 0, k))\n", "FL_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n \n def perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n- \n- if i < 0 or j < 0 or k < 0 or i < j:\n- return 0\n- \n- dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n- + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n- return dp[(i, j, k)]\n \n print(perm(n, 0, k))\n", "added_lines": 12, "removed_lines": 8, "code1_lines": 18 }, { "user_id": "u879977274", "problem_id": "p02974", "submission1_id": "s201836992", "submission2_id": "s883077259", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n \n if i == 0 and (j is not 0 or k is not 0):\n return 0\n \n if i < 0 or j < 0 or k < 0 or i < j:\n return 0\n \n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "code2": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n if i == 0:\n if k == 0 and j == 0:\n return 1\n else:\n return 0\n elif k < 0 or j < 0 or i < j:\n return 0\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563945460", "date2": "1563945538", "bleu_score": "0.8402948430328485", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1], "code1_test_score": 10, "total_score": 19, "input": "31 28\n", "actual_output": "5740497837\n", "expected_output": "740494022\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=31, k=28\ndp = {} # (1): dp={}\n\ndp[(0, 0, 0)] = 1 # (2): dp={(0, 0, 0): 1}\n\ndef perm(i, j, k): # (3): perm=\n if (i, j, k) in dp: # (5): NO CHANGE (9): NO CHANGE ... (23822): NO CHANGE\n return dp[(i, j, k)]\n \n if i == 0 and (j is not 0 or k is not 0): # (6): NO CHANGE (10): NO CHANGE ... (23823): NO CHANGE\n return 0\n \n if i < 0 or j < 0 or k < 0 or i < j: # (7): NO CHANGE (11): NO CHANGE ... (23824): i=31, j=0\n return 0\n \n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\ # (8): i=30 (12): i=29 ... (23825): NO CHANGE\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\ # (131): i=0, j=1 (141): i=1, j=1 ... (23807): i=28, j=1\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7) # (135): i=0, j=-1 (139): NO CHANGE ... (23826): NO CHANGE\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k)) # (4): i=31, j=0\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n \n def perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n- \n- if i == 0 and (j is not 0 or k is not 0):\n- return 0\n- \n- if i < 0 or j < 0 or k < 0 or i < j:\n- return 0\n- \n- dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n- + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n- return dp[(i, j, k)]\n+ if i == 0:\n+ if k == 0 and j == 0:\n+ return 1\n+ else:\n+ return 0\n+ elif k < 0 or j < 0 or i < j:\n+ return 0\n+ else:\n+ dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n+ + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n+ + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n+ return dp[(i, j, k)]\n \n print(perm(n, 0, k))\n", "FL_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n \n def perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n- \n- if i == 0 and (j is not 0 or k is not 0):\n- return 0\n- \n- if i < 0 or j < 0 or k < 0 or i < j:\n- return 0\n- \n- dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n- + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n- return dp[(i, j, k)]\n \n print(perm(n, 0, k))\n", "added_lines": 12, "removed_lines": 11, "code1_lines": 21 }, { "user_id": "u985519195", "problem_id": "p02974", "submission1_id": "s436421003", "submission2_id": "s160006874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nm = 1000000007\n\ndp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n\ndp[0][0][0] = 1\nfor i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n dp[i+1][j+1][k+2*(j+1)] = dp[i+1][j+1][k+2*(j+1)] + dp[i][j][k] % m\n dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + dp[i][j][k] % m\n dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + 2*j * dp[i][j][k] % m\n if j > 0:\n \tdp[i+1][j-1][k+2*(j-1)] = dp[i+1][j-1][k+2*(j-1)] + j*j * dp[i][j][k] % m\nprint(dp[N][0][K])", "code2": "N, K = map(int, input().split())\nm = 1000000007\n\ndp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n\ndp[0][0][0] = 1\nfor i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k]\n dp[i+1][j+1][k+2*(j+1)] %= m\n dp[i+1][j][k+2*j] += dp[i][j][k]\n dp[i+1][j][k+2*j] %= m\n dp[i+1][j][k+2*j] += 2*j * dp[i][j][k]\n dp[i+1][j][k+2*j] %= m\n if j != 0:\n dp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k]\n dp[i+1][j-1][k+2*(j-1)] %= m\nprint(dp[N][0][K])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563719317", "date2": "1563719816", "bleu_score": "0.8962663539951505", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 12, "total_score": 19, "input": "44 26\n", "actual_output": "1218927920\n", "expected_output": "218927913\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, K = map(int, input().split())\n m = 1000000007\n \n dp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n \n dp[0][0][0] = 1\n for i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n- dp[i+1][j+1][k+2*(j+1)] = dp[i+1][j+1][k+2*(j+1)] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + 2*j * dp[i][j][k] % m\n- if j > 0:\n- \tdp[i+1][j-1][k+2*(j-1)] = dp[i+1][j-1][k+2*(j-1)] + j*j * dp[i][j][k] % m\n+ dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k]\n+ dp[i+1][j+1][k+2*(j+1)] %= m\n+ dp[i+1][j][k+2*j] += dp[i][j][k]\n+ dp[i+1][j][k+2*j] %= m\n+ dp[i+1][j][k+2*j] += 2*j * dp[i][j][k]\n+ dp[i+1][j][k+2*j] %= m\n+ if j != 0:\n+ dp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k]\n+ dp[i+1][j-1][k+2*(j-1)] %= m\n print(dp[N][0][K])\n+\n", "FL_content": " N, K = map(int, input().split())\n m = 1000000007\n \n dp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n \n dp[0][0][0] = 1\n for i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n- dp[i+1][j+1][k+2*(j+1)] = dp[i+1][j+1][k+2*(j+1)] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + 2*j * dp[i][j][k] % m\n- if j > 0:\n- \tdp[i+1][j-1][k+2*(j-1)] = dp[i+1][j-1][k+2*(j-1)] + j*j * dp[i][j][k] % m\n print(dp[N][0][K])\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 15 }, { "user_id": "u879977274", "problem_id": "p02974", "submission1_id": "s369726960", "submission2_id": "s883077259", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n \n if i < 0 or j < 0 or k < 0:\n return 0\n \n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "code2": "n, k = map(int, input().split())\ndp = {}\n\ndp[(0, 0, 0)] = 1\n\ndef perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n if i == 0:\n if k == 0 and j == 0:\n return 1\n else:\n return 0\n elif k < 0 or j < 0 or i < j:\n return 0\n else:\n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563945255", "date2": "1563945538", "bleu_score": "0.7615159462516617", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1], "code1_test_score": 10, "total_score": 19, "input": "47 22\n", "actual_output": "6733790416\n", "expected_output": "733787098\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=47, k=22\ndp = {} # (1): dp={}\n\ndp[(0, 0, 0)] = 1 # (2): dp={(0, 0, 0): 1}\n\ndef perm(i, j, k): # (3): perm=\n if (i, j, k) in dp: # (5): NO CHANGE (8): NO CHANGE ... (27028): NO CHANGE\n return dp[(i, j, k)]\n \n if i < 0 or j < 0 or k < 0: # (6): NO CHANGE (9): NO CHANGE ... (27029): i=47, j=0\n return 0\n \n dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\ # (7): i=46 (10): i=45 ... (27030): NO CHANGE\n + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\ # (151): i=-1, j=1 (161): i=0, j=1 ... (27014): i=44, j=1\n + 1*perm(i-1, j-1, k-2*j))%int(10e9+7) # (155): i=-1, j=-1 (159): NO CHANGE ... (27031): NO CHANGE\n return dp[(i, j, k)]\n\nprint(perm(n, 0, k)) # (4): i=47, j=0\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n \n def perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n- \n- if i < 0 or j < 0 or k < 0:\n- return 0\n- \n- dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n- + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n- return dp[(i, j, k)]\n+ if i == 0:\n+ if k == 0 and j == 0:\n+ return 1\n+ else:\n+ return 0\n+ elif k < 0 or j < 0 or i < j:\n+ return 0\n+ else:\n+ dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n+ + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n+ + 1*perm(i-1, j-1, k-2*j))%(10**9+7)\n+ return dp[(i, j, k)]\n \n print(perm(n, 0, k))\n", "FL_content": " n, k = map(int, input().split())\n dp = {}\n \n dp[(0, 0, 0)] = 1\n \n def perm(i, j, k):\n if (i, j, k) in dp:\n return dp[(i, j, k)]\n- \n- if i < 0 or j < 0 or k < 0:\n- return 0\n- \n- dp[(i, j, k)] = ((j+j+1)*perm(i-1, j, k-2*j)\\\n- + (j+1)*(j+1)*perm(i-1, j+1, k-2*j)\\\n- + 1*perm(i-1, j-1, k-2*j))%int(10e9+7)\n- return dp[(i, j, k)]\n \n print(perm(n, 0, k))\n", "added_lines": 12, "removed_lines": 8, "code1_lines": 18 }, { "user_id": "u985519195", "problem_id": "p02974", "submission1_id": "s388372414", "submission2_id": "s160006874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nm = 1e9+7\n\ndp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n\ndp[0][0][0] = 1\nfor i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k] % m\n dp[i+1][j][k+2*j] += dp[i][j][k] % m\n dp[i+1][j][k+2*j] += 2*j * dp[i][j][k] % m\n if j > 0:\n \tdp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k] % m\nprint(int(dp[N][0][K]))\n", "code2": "N, K = map(int, input().split())\nm = 1000000007\n\ndp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n\ndp[0][0][0] = 1\nfor i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k]\n dp[i+1][j+1][k+2*(j+1)] %= m\n dp[i+1][j][k+2*j] += dp[i][j][k]\n dp[i+1][j][k+2*j] %= m\n dp[i+1][j][k+2*j] += 2*j * dp[i][j][k]\n dp[i+1][j][k+2*j] %= m\n if j != 0:\n dp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k]\n dp[i+1][j-1][k+2*(j-1)] %= m\nprint(dp[N][0][K])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563718973", "date2": "1563719816", "bleu_score": "0.7484531078578708", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 12, "total_score": 19, "input": "44 16\n", "actual_output": "1171958181\n", "expected_output": "171958174\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, K = map(int, input().split())\n-m = 1e9+7\n+m = 1000000007\n \n dp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n \n dp[0][0][0] = 1\n for i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n- dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k] % m\n- dp[i+1][j][k+2*j] += dp[i][j][k] % m\n- dp[i+1][j][k+2*j] += 2*j * dp[i][j][k] % m\n- if j > 0:\n- \tdp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k] % m\n-print(int(dp[N][0][K]))\n+ dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k]\n+ dp[i+1][j+1][k+2*(j+1)] %= m\n+ dp[i+1][j][k+2*j] += dp[i][j][k]\n+ dp[i+1][j][k+2*j] %= m\n+ dp[i+1][j][k+2*j] += 2*j * dp[i][j][k]\n+ dp[i+1][j][k+2*j] %= m\n+ if j != 0:\n+ dp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k]\n+ dp[i+1][j-1][k+2*(j-1)] %= m\n+print(dp[N][0][K])\n \n", "FL_content": " N, K = map(int, input().split())\n-m = 1e9+7\n \n dp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n \n dp[0][0][0] = 1\n for i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n- dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k] % m\n- dp[i+1][j][k+2*j] += dp[i][j][k] % m\n- dp[i+1][j][k+2*j] += 2*j * dp[i][j][k] % m\n- if j > 0:\n- \tdp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k] % m\n-print(int(dp[N][0][K]))\n \n", "added_lines": 11, "removed_lines": 7, "code1_lines": 16 }, { "user_id": "u985519195", "problem_id": "p02974", "submission1_id": "s437205029", "submission2_id": "s160006874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nm = 1e9+7\n\ndp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n\ndp[0][0][0] = 1\nfor i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n dp[i+1][j+1][k+2*(j+1)] = dp[i+1][j+1][k+2*(j+1)] + dp[i][j][k] % m\n dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + dp[i][j][k] % m\n dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + 2*j * dp[i][j][k] % m\n if j > 0:\n \tdp[i+1][j-1][k+2*(j-1)] = dp[i+1][j-1][k+2*(j-1)] + j*j * dp[i][j][k] % m\nprint(int(dp[N][0][K]))\n", "code2": "N, K = map(int, input().split())\nm = 1000000007\n\ndp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n\ndp[0][0][0] = 1\nfor i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k]\n dp[i+1][j+1][k+2*(j+1)] %= m\n dp[i+1][j][k+2*j] += dp[i][j][k]\n dp[i+1][j][k+2*j] %= m\n dp[i+1][j][k+2*j] += 2*j * dp[i][j][k]\n dp[i+1][j][k+2*j] %= m\n if j != 0:\n dp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k]\n dp[i+1][j-1][k+2*(j-1)] %= m\nprint(dp[N][0][K])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563719144", "date2": "1563719816", "bleu_score": "0.8798696497455978", "code1_test_status": [1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 12, "total_score": 19, "input": "44 26\n", "actual_output": "1218927920\n", "expected_output": "218927913\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, K = map(int, input().split())\n-m = 1e9+7\n+m = 1000000007\n \n dp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n \n dp[0][0][0] = 1\n for i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n- dp[i+1][j+1][k+2*(j+1)] = dp[i+1][j+1][k+2*(j+1)] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + 2*j * dp[i][j][k] % m\n- if j > 0:\n- \tdp[i+1][j-1][k+2*(j-1)] = dp[i+1][j-1][k+2*(j-1)] + j*j * dp[i][j][k] % m\n-print(int(dp[N][0][K]))\n+ dp[i+1][j+1][k+2*(j+1)] += dp[i][j][k]\n+ dp[i+1][j+1][k+2*(j+1)] %= m\n+ dp[i+1][j][k+2*j] += dp[i][j][k]\n+ dp[i+1][j][k+2*j] %= m\n+ dp[i+1][j][k+2*j] += 2*j * dp[i][j][k]\n+ dp[i+1][j][k+2*j] %= m\n+ if j != 0:\n+ dp[i+1][j-1][k+2*(j-1)] += j*j * dp[i][j][k]\n+ dp[i+1][j-1][k+2*(j-1)] %= m\n+print(dp[N][0][K])\n \n", "FL_content": " N, K = map(int, input().split())\n-m = 1e9+7\n \n dp = [[[0] * (K+2*N+1) for _ in range(N+1)] for _ in range(N+1)]\n \n dp[0][0][0] = 1\n for i in range(0, N):\n for j in range(0, i+1):\n for k in range(0, K+1):\n- dp[i+1][j+1][k+2*(j+1)] = dp[i+1][j+1][k+2*(j+1)] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + dp[i][j][k] % m\n- dp[i+1][j][k+2*j] = dp[i+1][j][k+2*j] + 2*j * dp[i][j][k] % m\n- if j > 0:\n- \tdp[i+1][j-1][k+2*(j-1)] = dp[i+1][j-1][k+2*(j-1)] + j*j * dp[i][j][k] % m\n-print(int(dp[N][0][K]))\n \n", "added_lines": 11, "removed_lines": 7, "code1_lines": 16 }, { "user_id": "u580362735", "problem_id": "p02963", "submission1_id": "s623384412", "submission2_id": "s346638357", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = S%x2\ny3 = S\nprint(x1,y1,x2,y2,x3,y3)\n", "code2": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = (x2-S%x2)%x2\ny3 = -(-S\nprint(x1,y1,x2,y2,x3,y3)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563769984", "date2": "1563771452", "bleu_score": "0.8601021348139032", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "2048226053\n", "actual_output": "0 0 1000000000 1 48226053 2048226053\n", "expected_output": "0 0 1000000000 1 951773947 3\n\n", "anno_code": ["S = int(input()) # (0): S=2048226053\nx1 = 0 # (1): x1=0\ny1 = 0 # (2): y1=0\nx2 = 10**9 # (3): x2=1000000000\ny2 = 1 # (4): y2=1\nx3 = S%x2 # (5): x3=48226053\ny3 = S # (6): y3=2048226053\nprint(x1,y1,x2,y2,x3,y3)\n"], "anno_status": [true], "diff_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n y2 = 1\n-x3 = S%x2\n-y3 = S\n+x3 = (x2-S%x2)%x2\n+y3 = -(-S\n print(x1,y1,x2,y2,x3,y3)\n \n", "FL_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n y2 = 1\n-x3 = S%x2\n-y3 = S\n print(x1,y1,x2,y2,x3,y3)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u263830634", "problem_id": "p02963", "submission1_id": "s523044692", "submission2_id": "s546367085", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nS = int(input())\nX1 = 0\nY1 = 0\nX2 = 0\nY2 = 0\nX3 = 0\nY3 = 0\nif S <= 10 ** 9:\n X2 = S\n Y3 = 1\nelse:\n X2 = int(math.sqrt(S))+1\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8:\n X3 = i\n Y2 = s\n break\n\n\nprint (X1, Y1, X2, Y2, X3, Y3)\n", "code2": "import math\nS = int(input())\nX1 = 0\nY1 = 0\nX2 = 0\nY2 = 0\nX3 = 0\nY3 = 0\nif S <= 10 ** 9:\n X2 = S\n Y3 = 1\nelif S == 1000000000000000000:\n X2 = int(math.sqrt(S))\n Y3 = X2\nelse:\n X2 = int(math.sqrt(S) + 1)\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n if s%i == 0 and s\n X3 = i\n Y2 = s\n break\n\nprint (X1, Y1, X2, Y2, X3, Y3)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563767039", "date2": "1563767617", "bleu_score": "0.844072323812408", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "3592841737\n", "actual_output": "0 0 59941 81744 1 59941\n", "expected_output": "0 0 1000000000 1 407158263 4\n\n", "anno_code": ["import math\nS = int(input()) # (0): S=3592841737\nX1 = 0 # (1): X1=0\nY1 = 0 # (2): Y1=0\nX2 = 0 # (3): X2=0\nY2 = 0 # (4): Y2=0\nX3 = 0 # (5): X3=0\nY3 = 0 # (6): Y3=0\nif S <= 10 ** 9: # (7): NO CHANGE\n X2 = S\n Y3 = 1\nelse:\n X2 = int(math.sqrt(S))+1 # (8): X2=59941\n Y3 = X2 # (9): Y3=59941\n s = X2 ** 2 - S # (10): s=81744\n for i in range(1, int(math.sqrt(s) + 1)): # (11): i=1\n if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8: # (12): NO CHANGE\n X3 = i # (13): X3=1\n Y2 = s # (14): Y2=81744\n break # (15): NO CHANGE\n\n\nprint (X1, Y1, X2, Y2, X3, Y3)\n"], "anno_status": [true], "diff_content": " import math\n S = int(input())\n X1 = 0\n Y1 = 0\n X2 = 0\n Y2 = 0\n X3 = 0\n Y3 = 0\n if S <= 10 ** 9:\n X2 = S\n Y3 = 1\n+elif S == 1000000000000000000:\n+ X2 = int(math.sqrt(S))\n+ Y3 = X2\n else:\n- X2 = int(math.sqrt(S))+1\n+ X2 = int(math.sqrt(S) + 1)\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n- if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8:\n- X3 = i\n- Y2 = s\n- break\n-\n+ if s%i == 0 and s\n+ X3 = i\n+ Y2 = s\n+ break\n \n print (X1, Y1, X2, Y2, X3, Y3)\n \n", "FL_content": " import math\n S = int(input())\n X1 = 0\n Y1 = 0\n X2 = 0\n Y2 = 0\n X3 = 0\n Y3 = 0\n if S <= 10 ** 9:\n X2 = S\n Y3 = 1\n else:\n- X2 = int(math.sqrt(S))+1\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n- if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8:\n- X3 = i\n- Y2 = s\n- break\n-\n \n print (X1, Y1, X2, Y2, X3, Y3)\n \n", "added_lines": 8, "removed_lines": 6, "code1_lines": 24 }, { "user_id": "u580362735", "problem_id": "p02963", "submission1_id": "s928842319", "submission2_id": "s346638357", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = S\ny3 = S%10**9\nprint(x1,y1,x2,y2,x3,y3)\n", "code2": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = (x2-S%x2)%x2\ny3 = -(-S\nprint(x1,y1,x2,y2,x3,y3)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563770737", "date2": "1563771452", "bleu_score": "0.8221635638993053", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "2702759365\n", "actual_output": "0 0 1000000000 1 2702759365 702759365\n", "expected_output": "0 0 1000000000 1 297240635 3\n\n", "anno_code": ["S = int(input()) # (0): S=2702759365\nx1 = 0 # (1): x1=0\ny1 = 0 # (2): y1=0\nx2 = 10**9 # (3): x2=1000000000\ny2 = 1 # (4): y2=1\nx3 = S # (5): x3=2702759365\ny3 = S%10**9 # (6): y3=702759365\nprint(x1,y1,x2,y2,x3,y3)\n"], "anno_status": [true], "diff_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n y2 = 1\n-x3 = S\n-y3 = S%10**9\n+x3 = (x2-S%x2)%x2\n+y3 = -(-S\n print(x1,y1,x2,y2,x3,y3)\n \n", "FL_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n y2 = 1\n-x3 = S\n-y3 = S%10**9\n print(x1,y1,x2,y2,x3,y3)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u374103100", "problem_id": "p02963", "submission1_id": "s329819305", "submission2_id": "s419045629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(12345678)\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main():\n s = int(input())\n x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n\n y3 = s \n x3 = y3 * (10 ** 9) - s\n\n print(x1, y1, x2, y2, x3, y3)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nsys.setrecursionlimit(12345678)\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main():\n S = int(input())\n\n y = -(-S \n x = y * (10 ** 9) - S\n\n print(0, 0, 10 ** 9, 1, x, y)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567119413", "date2": "1567119493", "bleu_score": "0.8462822931458398", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "4637362376438\n", "actual_output": "0 0 1000000000 1 4637362371800637623562 4637362376438\n", "expected_output": "0 0 1000000000 1 637623562 4638\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(12345678) # (0): itertools=, Counter=, defaultdict=, deque=, bisect=, heappush=, heappop=\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main(): # (1): main=\n s = int(input())\n x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n\n y3 = s \n x3 = y3 * (10 ** 9) - s\n\n print(x1, y1, x2, y2, x3, y3)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n sys.setrecursionlimit(12345678)\n import itertools\n from collections import Counter\n from collections import defaultdict\n from collections import deque\n import bisect\n from heapq import heappush, heappop\n \n \n def main():\n- s = int(input())\n- x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n+ S = int(input())\n \n- y3 = s \n- x3 = y3 * (10 ** 9) - s\n+ y = -(-S \n+ x = y * (10 ** 9) - S\n+\n+ print(0, 0, 10 ** 9, 1, x, y)\n \n- print(x1, y1, x2, y2, x3, y3)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n sys.setrecursionlimit(12345678)\n import itertools\n from collections import Counter\n from collections import defaultdict\n from collections import deque\n import bisect\n from heapq import heappush, heappop\n \n \n def main():\n- s = int(input())\n- x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n \n- y3 = s \n- x3 = y3 * (10 ** 9) - s\n \n- print(x1, y1, x2, y2, x3, y3)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 23 }, { "user_id": "u588794534", "problem_id": "p02963", "submission1_id": "s695896139", "submission2_id": "s600653934", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput=sys.stdin.readline\n\ns=int(input())\n\n\n\n\nif s<=10**9:\n print(0,0,1,0,0,s)\n exit()\n\ny=s\nx=s%(10**9)\n\nprint(0,0,10**9,1,x,y)\n\n\n", "code2": "import sys\ninput=sys.stdin.readline\n\ns=int(input())\n\n\n\n\nif s<=10**9:\n print(0,0,1,0,0,s)\n exit()\n\ny=(-1*s\nx=10**9*y-s\n\nprint(0,0,10**9,1,x,y)\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590116899", "date2": "1590117157", "bleu_score": "0.9185616039923362", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "997880852067\n", "actual_output": "0 0 1000000000 1 880852067 997880852067\n", "expected_output": "0 0 1000000000 1 119147933 998\n\n", "anno_code": ["import sys\ninput=sys.stdin.readline # (0): input=\n\ns=int(input()) # (1): s=997880852067\n\n\n\n\nif s<=10**9: # (2): NO CHANGE\n print(0,0,1,0,0,s)\n exit()\n\ny=s # (3): y=997880852067\nx=s%(10**9) # (4): x=880852067\n\nprint(0,0,10**9,1,x,y)\n\n\n"], "anno_status": [true], "diff_content": " import sys\n input=sys.stdin.readline\n \n s=int(input())\n \n \n \n \n if s<=10**9:\n print(0,0,1,0,0,s)\n exit()\n \n-y=s\n-x=s%(10**9)\n+y=(-1*s\n+x=10**9*y-s\n \n print(0,0,10**9,1,x,y)\n \n \n \n", "FL_content": " import sys\n input=sys.stdin.readline\n \n s=int(input())\n \n \n \n \n if s<=10**9:\n print(0,0,1,0,0,s)\n exit()\n \n-y=s\n-x=s%(10**9)\n \n print(0,0,10**9,1,x,y)\n \n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u626881915", "problem_id": "p02963", "submission1_id": "s065519122", "submission2_id": "s896473544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\ns=int(input())\nc=math.ceil(math.sqrt(s))\nsa=c*c-s\nfor i in range(2, s):\n if sa%i==0:\n print(\"0 0 {} {} {} {}\".format(c, i, sa/i, c))\n exit()\n ", "code2": "import math\ns=int(input())\nif s==1:\n print(\"0 0 1 0 0 1\")\n exit()\nc=math.ceil(math.sqrt(s))\nsa=c**2-s\nfor i in range(1, s):\n if sa%i==0 and sa/i <= 10**9:\n print(\"0 0 {} {} {} {}\".format(c, i, sa\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563770911", "date2": "1563772512", "bleu_score": "0.7066968636227977", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "2316920905502219\n", "actual_output": "0 0 48134405 2 19600903.0 48134405\n", "expected_output": "0 0 1000000000 1 94497781 2316921\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import math\n s=int(input())\n+if s==1:\n+ print(\"0 0 1 0 0 1\")\n+ exit()\n c=math.ceil(math.sqrt(s))\n-sa=c*c-s\n-for i in range(2, s):\n- if sa%i==0:\n- print(\"0 0 {} {} {} {}\".format(c, i, sa/i, c))\n+sa=c**2-s\n+for i in range(1, s):\n+ if sa%i==0 and sa/i <= 10**9:\n+ print(\"0 0 {} {} {} {}\".format(c, i, sa\n exit()\n- \n", "FL_content": " import math\n s=int(input())\n c=math.ceil(math.sqrt(s))\n-sa=c*c-s\n-for i in range(2, s):\n- if sa%i==0:\n- print(\"0 0 {} {} {} {}\".format(c, i, sa/i, c))\n exit()\n- \n", "added_lines": 7, "removed_lines": 5, "code1_lines": 9 }, { "user_id": "u694665829", "problem_id": "p02963", "submission1_id": "s002977361", "submission2_id": "s432872662", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def f():\n s = int(input())\n y = s\n x = 10**9 - s%(10**9)\n\n ans = [0, 0, 10**9, 1, x, y]\n \n print(*ans)\n\nif __name__ == '__main__':\n f()\n", "code2": "def f():\n s = int(input())\n i9 = 10**9\n if s == i9 ** 2:\n print(i9, 0, 0, i9, 0, 0)\n else:\n print(i9 - (s%i9), s\n\nif __name__ == '__main__':\n f()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600492222", "date2": "1600492852", "bleu_score": "0.636693323760185", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "89738690024091\n", "actual_output": "0 0 1000000000 1 309975909 89738690024091\n", "expected_output": "0 0 1000000000 1 309975909 89739\n\n", "anno_code": ["def f(): # (0): f=\n s = int(input())\n y = s\n x = 10**9 - s%(10**9)\n\n ans = [0, 0, 10**9, 1, x, y]\n \n print(*ans)\n\nif __name__ == '__main__':\n f()\n"], "anno_status": [true], "diff_content": " def f():\n s = int(input())\n- y = s\n- x = 10**9 - s%(10**9)\n-\n- ans = [0, 0, 10**9, 1, x, y]\n- \n- print(*ans)\n+ i9 = 10**9\n+ if s == i9 ** 2:\n+ print(i9, 0, 0, i9, 0, 0)\n+ else:\n+ print(i9 - (s%i9), s\n \n if __name__ == '__main__':\n f()\n \n", "FL_content": " def f():\n s = int(input())\n- y = s\n- x = 10**9 - s%(10**9)\n-\n- ans = [0, 0, 10**9, 1, x, y]\n- \n- print(*ans)\n \n if __name__ == '__main__':\n f()\n \n", "added_lines": 5, "removed_lines": 6, "code1_lines": 12 }, { "user_id": "u374103100", "problem_id": "p02963", "submission1_id": "s400182570", "submission2_id": "s419045629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(12345678)\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main():\n s = int(input())\n x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n\n y3, x3 = divmod(s, 10**9)\n\n print(x1, y1, x2, y2, x3, y3)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nsys.setrecursionlimit(12345678)\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main():\n S = int(input())\n\n y = -(-S \n x = y * (10 ** 9) - S\n\n print(0, 0, 10 ** 9, 1, x, y)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567119080", "date2": "1567119493", "bleu_score": "0.8424893483885575", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "207714184920692\n", "actual_output": "0 0 1000000000 1 184920692 207714\n", "expected_output": "0 0 1000000000 1 815079308 207715\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(12345678) # (0): itertools=, Counter=, defaultdict=, deque=, bisect=, heappush=, heappop=\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main(): # (1): main=\n s = int(input())\n x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n\n y3, x3 = divmod(s, 10**9)\n\n print(x1, y1, x2, y2, x3, y3)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n sys.setrecursionlimit(12345678)\n import itertools\n from collections import Counter\n from collections import defaultdict\n from collections import deque\n import bisect\n from heapq import heappush, heappop\n \n \n def main():\n- s = int(input())\n- x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n+ S = int(input())\n \n- y3, x3 = divmod(s, 10**9)\n+ y = -(-S \n+ x = y * (10 ** 9) - S\n+\n+ print(0, 0, 10 ** 9, 1, x, y)\n \n- print(x1, y1, x2, y2, x3, y3)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n sys.setrecursionlimit(12345678)\n import itertools\n from collections import Counter\n from collections import defaultdict\n from collections import deque\n import bisect\n from heapq import heappush, heappop\n \n \n def main():\n- s = int(input())\n- x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n \n- y3, x3 = divmod(s, 10**9)\n \n- print(x1, y1, x2, y2, x3, y3)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 22 }, { "user_id": "u263830634", "problem_id": "p02963", "submission1_id": "s906247788", "submission2_id": "s546367085", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nS = int(input())\nX1 = 0\nY1 = 0\nX2 = 0\nY2 = 0\nX3 = 0\nY3 = 0\nif S <= 10 ** 9:\n X2 = S\n Y3 = 1\nelse:\n X2 = int(math.sqrt(S) + 1)\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8:\n X3 = i\n Y2 = s\n break\n\nprint (X1, Y1, X2, Y2, X3, Y3)\n", "code2": "import math\nS = int(input())\nX1 = 0\nY1 = 0\nX2 = 0\nY2 = 0\nX3 = 0\nY3 = 0\nif S <= 10 ** 9:\n X2 = S\n Y3 = 1\nelif S == 1000000000000000000:\n X2 = int(math.sqrt(S))\n Y3 = X2\nelse:\n X2 = int(math.sqrt(S) + 1)\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n if s%i == 0 and s\n X3 = i\n Y2 = s\n break\n\nprint (X1, Y1, X2, Y2, X3, Y3)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563767335", "date2": "1563767617", "bleu_score": "0.8547028149479695", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "12126851871\n", "actual_output": "0 0 110122 3013 1 110122\n", "expected_output": "0 0 1000000000 1 873148129 13\n\n", "anno_code": ["import math\nS = int(input()) # (0): S=12126851871\nX1 = 0 # (1): X1=0\nY1 = 0 # (2): Y1=0\nX2 = 0 # (3): X2=0\nY2 = 0 # (4): Y2=0\nX3 = 0 # (5): X3=0\nY3 = 0 # (6): Y3=0\nif S <= 10 ** 9: # (7): NO CHANGE\n X2 = S\n Y3 = 1\nelse:\n X2 = int(math.sqrt(S) + 1) # (8): X2=110122\n Y3 = X2 # (9): Y3=110122\n s = X2 ** 2 - S # (10): s=3013\n for i in range(1, int(math.sqrt(s) + 1)): # (11): i=1\n if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8: # (12): NO CHANGE\n X3 = i # (13): X3=1\n Y2 = s # (14): Y2=3013\n break # (15): NO CHANGE\n\nprint (X1, Y1, X2, Y2, X3, Y3)\n"], "anno_status": [true], "diff_content": " import math\n S = int(input())\n X1 = 0\n Y1 = 0\n X2 = 0\n Y2 = 0\n X3 = 0\n Y3 = 0\n if S <= 10 ** 9:\n X2 = S\n Y3 = 1\n+elif S == 1000000000000000000:\n+ X2 = int(math.sqrt(S))\n+ Y3 = X2\n else:\n X2 = int(math.sqrt(S) + 1)\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n- if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8:\n- X3 = i\n- Y2 = s\n- break\n+ if s%i == 0 and s\n+ X3 = i\n+ Y2 = s\n+ break\n \n print (X1, Y1, X2, Y2, X3, Y3)\n \n", "FL_content": " import math\n S = int(input())\n X1 = 0\n Y1 = 0\n X2 = 0\n Y2 = 0\n X3 = 0\n Y3 = 0\n if S <= 10 ** 9:\n X2 = S\n Y3 = 1\n else:\n X2 = int(math.sqrt(S) + 1)\n Y3 = X2\n s = X2 ** 2 - S \n for i in range(1, int(math.sqrt(s) + 1)):\n- if s%i == 0 and s%i <= 10 ** 8 and i <= 10 ** 8:\n- X3 = i\n- Y2 = s\n- break\n \n print (X1, Y1, X2, Y2, X3, Y3)\n \n", "added_lines": 7, "removed_lines": 4, "code1_lines": 23 }, { "user_id": "u557494880", "problem_id": "p02963", "submission1_id": "s933542040", "submission2_id": "s962888516", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\nX1 = 0\nY1 = 0\nif S <= 10**9:\n X2 = S\n Y2 = 0\n X3 = 0\n Y3 = 1\nelse:\n S = 10**18 - S\n X2 = 10**9\n Y3 = 10**9\n X3 = S\n Y2 = 1\nprint(X1,Y1,X2,Y2,X3,Y3)\n ", "code2": "S = int(input())\nX1 = 0\nY1 = 0\nif S <= 10**9:\n X2 = S\n Y2 = 0\n X3 = 0\n Y3 = 1\nelif 10**9 < S < 10**18:\n T = S % 10**9\n X2 = 10**9\n Y3 = (S \n X3 = 10**9 - T \n Y2 = 1\nelse:\n X2 = 0\n Y2 = 10**9\n X3 = 10**9\n Y3 = 0\nprint(X1,Y1,X2,Y2,X3,Y3)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576705205", "date2": "1576705973", "bleu_score": "0.6966760159556992", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "8917942752828\n", "actual_output": "0 0 1000000000 1 999991082057247172 1000000000\n", "expected_output": "0 0 1000000000 1 57247172 8918\n\n", "anno_code": ["S = int(input()) # (0): S=8917942752828\nX1 = 0 # (1): X1=0\nY1 = 0 # (2): Y1=0\nif S <= 10**9: # (3): NO CHANGE\n X2 = S\n Y2 = 0\n X3 = 0\n Y3 = 1\nelse:\n S = 10**18 - S # (4): S=999991082057247172\n X2 = 10**9 # (5): X2=1000000000\n Y3 = 10**9 # (6): Y3=1000000000\n X3 = S # (7): X3=999991082057247172\n Y2 = 1 # (8): Y2=1\nprint(X1,Y1,X2,Y2,X3,Y3)\n "], "anno_status": [true], "diff_content": " S = int(input())\n X1 = 0\n Y1 = 0\n if S <= 10**9:\n X2 = S\n Y2 = 0\n X3 = 0\n Y3 = 1\n-else:\n- S = 10**18 - S\n+elif 10**9 < S < 10**18:\n+ T = S % 10**9\n X2 = 10**9\n- Y3 = 10**9\n- X3 = S\n+ Y3 = (S \n+ X3 = 10**9 - T \n Y2 = 1\n+else:\n+ X2 = 0\n+ Y2 = 10**9\n+ X3 = 10**9\n+ Y3 = 0\n print(X1,Y1,X2,Y2,X3,Y3)\n- \n", "FL_content": " S = int(input())\n X1 = 0\n Y1 = 0\n if S <= 10**9:\n X2 = S\n Y2 = 0\n X3 = 0\n Y3 = 1\n-else:\n- S = 10**18 - S\n X2 = 10**9\n- Y3 = 10**9\n- X3 = S\n Y2 = 1\n print(X1,Y1,X2,Y2,X3,Y3)\n- \n", "added_lines": 9, "removed_lines": 5, "code1_lines": 16 }, { "user_id": "u342502598", "problem_id": "p02963", "submission1_id": "s697151652", "submission2_id": "s309481328", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nm=1000000000\nl=[0,0]\nif(n<=m):\n l.append(1)\n l.append(0)\n l.append(0)\n l.append(n)\nelse:\n l.append(1)\n l.append(m)\n x=n%m\n y=n\n l.append(m-x)\n l.append(y)\nfor i in l:\n print(i,end=\" \")\n\n", "code2": "n=int(input())\nm=1000000000\nl=[0,0]\nif(n<=m):\n l.append(1)\n l.append(0)\n l.append(0)\n l.append(n)\nelif(n == 1000000000000000000):\n l.append(m)\n l.append(0)\n l.append(0)\n l.append(m)\nelse:\n l.append(m)\n l.append(1)\n x=n%m\n l.append(m-x)\n l.append(((n)\nfor i in l:\n print(i,end=\" \")\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563913565", "date2": "1563914527", "bleu_score": "0.700666614061403", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "3205777036179\n", "actual_output": "0 0 1 1000000000 222963821 3205777036179 ", "expected_output": "0 0 1000000000 1 222963821 3206\n\n", "anno_code": ["n=int(input()) # (0): n=3205777036179\nm=1000000000 # (1): m=1000000000\nl=[0,0] # (2): l=[0, 0]\nif(n<=m): # (3): NO CHANGE\n l.append(1)\n l.append(0)\n l.append(0)\n l.append(n)\nelse:\n l.append(1) # (4): l=[0, 0, 1]\n l.append(m) # (5): l=[0, 0, 1, 1000000000]\n x=n%m # (6): x=777036179\n y=n # (7): y=3205777036179\n l.append(m-x) # (8): l=[0, 0, 1, 1000000000, 222963821]\n l.append(y) # (9): l=[0, 0, 1, 1000000000, 222963821, 3205777036179]\nfor i in l: # (10): i=0 (12): NO CHANGE ... (20): i=3205777036179\n print(i,end=\" \") # (11): NO CHANGE (13): NO CHANGE ... (21): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " n=int(input())\n m=1000000000\n l=[0,0]\n if(n<=m):\n l.append(1)\n l.append(0)\n l.append(0)\n l.append(n)\n+elif(n == 1000000000000000000):\n+ l.append(m)\n+ l.append(0)\n+ l.append(0)\n+ l.append(m)\n else:\n- l.append(1)\n l.append(m)\n+ l.append(1)\n x=n%m\n- y=n\n l.append(m-x)\n- l.append(y)\n+ l.append(((n)\n for i in l:\n print(i,end=\" \")\n \n \n", "FL_content": " n=int(input())\n m=1000000000\n l=[0,0]\n if(n<=m):\n l.append(1)\n l.append(0)\n l.append(0)\n l.append(n)\n else:\n- l.append(1)\n l.append(m)\n x=n%m\n- y=n\n l.append(m-x)\n- l.append(y)\n for i in l:\n print(i,end=\" \")\n \n \n", "added_lines": 7, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u580362735", "problem_id": "p02963", "submission1_id": "s537796398", "submission2_id": "s346638357", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 0\nx3 = S\ny3 = S%x2\nprint(x1,y1,x2,y2,x3,y3)", "code2": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = (x2-S%x2)%x2\ny3 = -(-S\nprint(x1,y1,x2,y2,x3,y3)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563770830", "date2": "1563771452", "bleu_score": "0.8114798697253094", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "2202554345611\n", "actual_output": "0 0 1000000000 0 2202554345611 554345611\n", "expected_output": "0 0 1000000000 1 445654389 2203\n\n", "anno_code": ["S = int(input()) # (0): S=2202554345611\nx1 = 0 # (1): x1=0\ny1 = 0 # (2): y1=0\nx2 = 10**9 # (3): x2=1000000000\ny2 = 0 # (4): y2=0\nx3 = S # (5): x3=2202554345611\ny3 = S%x2 # (6): y3=554345611\nprint(x1,y1,x2,y2,x3,y3)"], "anno_status": [true], "diff_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n-y2 = 0\n-x3 = S\n-y3 = S%x2\n+y2 = 1\n+x3 = (x2-S%x2)%x2\n+y3 = -(-S\n print(x1,y1,x2,y2,x3,y3)\n+\n", "FL_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n-y2 = 0\n-x3 = S\n-y3 = S%x2\n print(x1,y1,x2,y2,x3,y3)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u174273188", "problem_id": "p02963", "submission1_id": "s487578886", "submission2_id": "s299174027", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n s = int(input())\n \n x2, y2 = 10 ** 9, 1\n y3 = s \n x3 = s % 10 ** 9\n print(0, 0, x2, y2, x3, y3)\n\n\nif __name__ == \"__main__\":\n resolve()\n", "code2": "def resolve():\n s = int(input())\n \n x2, y2 = 10 ** 9, 1\n y3 = -(-s \n x3 = y3 * 10 ** 9 - s\n print(0, 0, x2, y2, x3, y3)\n\n\nif __name__ == \"__main__\":\n resolve()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570069432", "date2": "1570069576", "bleu_score": "0.9173778006740821", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "93932089064978059\n", "actual_output": "0 0 1000000000 1 64978059 93932089064978059\n", "expected_output": "0 0 1000000000 1 935021941 93932090\n\n", "anno_code": ["def resolve(): # (0): resolve=\n s = int(input())\n \n x2, y2 = 10 ** 9, 1\n y3 = s \n x3 = s % 10 ** 9\n print(0, 0, x2, y2, x3, y3)\n\n\nif __name__ == \"__main__\":\n resolve()\n"], "anno_status": [true], "diff_content": " def resolve():\n s = int(input())\n \n x2, y2 = 10 ** 9, 1\n- y3 = s \n- x3 = s % 10 ** 9\n+ y3 = -(-s \n+ x3 = y3 * 10 ** 9 - s\n print(0, 0, x2, y2, x3, y3)\n \n \n if __name__ == \"__main__\":\n resolve()\n \n", "FL_content": " def resolve():\n s = int(input())\n \n x2, y2 = 10 ** 9, 1\n- y3 = s \n- x3 = s % 10 ** 9\n print(0, 0, x2, y2, x3, y3)\n \n \n if __name__ == \"__main__\":\n resolve()\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u295294832", "problem_id": "p02963", "submission1_id": "s089158769", "submission2_id": "s178905056", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N =int(input())\nprint(0,0,1,10**9,0,N%10**9)", "code2": "N =-int(input())\nM=10**9\nprint(0,0,1,M,0-N\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563822913", "date2": "1563894237", "bleu_score": "0.6656942192883127", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "238429723295099\n", "actual_output": "0 0 1 1000000000 0 723295099\n", "expected_output": "0 0 1000000000 1 276704901 238430\n\n", "anno_code": ["N =int(input()) # (0): N=238429723295099\nprint(0,0,1,10**9,0,N%10**9)"], "anno_status": [true], "diff_content": "-N =int(input())\n-print(0,0,1,10**9,0,N%10**9)\n+N =-int(input())\n+M=10**9\n+print(0,0,1,M,0-N\n+\n", "FL_content": "-N =int(input())\n-print(0,0,1,10**9,0,N%10**9)\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u580362735", "problem_id": "p02963", "submission1_id": "s800603669", "submission2_id": "s346638357", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 0\nx3 = S\ny3 = (x2-S%x2)%x2\nprint(x1,y1,x2,y2,x3,y3)", "code2": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = (x2-S%x2)%x2\ny3 = -(-S\nprint(x1,y1,x2,y2,x3,y3)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563771042", "date2": "1563771452", "bleu_score": "0.9068551945474522", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "904368770264\n", "actual_output": "0 0 1000000000 0 904368770264 631229736\n", "expected_output": "0 0 1000000000 1 631229736 905\n\n", "anno_code": ["S = int(input()) # (0): S=904368770264\nx1 = 0 # (1): x1=0\ny1 = 0 # (2): y1=0\nx2 = 10**9 # (3): x2=1000000000\ny2 = 0 # (4): y2=0\nx3 = S # (5): x3=904368770264\ny3 = (x2-S%x2)%x2 # (6): y3=631229736\nprint(x1,y1,x2,y2,x3,y3)"], "anno_status": [true], "diff_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n-y2 = 0\n-x3 = S\n-y3 = (x2-S%x2)%x2\n+y2 = 1\n+x3 = (x2-S%x2)%x2\n+y3 = -(-S\n print(x1,y1,x2,y2,x3,y3)\n+\n", "FL_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n-y2 = 0\n-x3 = S\n-y3 = (x2-S%x2)%x2\n print(x1,y1,x2,y2,x3,y3)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u374103100", "problem_id": "p02963", "submission1_id": "s625716717", "submission2_id": "s419045629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(12345678)\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main():\n s = int(input())\n x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n\n x3, y3 = divmod(s, 10**9)\n\n print(x1, y1, x2, y2, x3, y3)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nsys.setrecursionlimit(12345678)\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main():\n S = int(input())\n\n y = -(-S \n x = y * (10 ** 9) - S\n\n print(0, 0, 10 ** 9, 1, x, y)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567119034", "date2": "1567119493", "bleu_score": "0.8411332673766463", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "2680236341369\n", "actual_output": "0 0 1000000000 1 2680 236341369\n", "expected_output": "0 0 1000000000 1 763658631 2681\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(12345678) # (0): itertools=, Counter=, defaultdict=, deque=, bisect=, heappush=, heappop=\nimport itertools\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nimport bisect\nfrom heapq import heappush, heappop\n\n\ndef main(): # (1): main=\n s = int(input())\n x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n\n x3, y3 = divmod(s, 10**9)\n\n print(x1, y1, x2, y2, x3, y3)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n sys.setrecursionlimit(12345678)\n import itertools\n from collections import Counter\n from collections import defaultdict\n from collections import deque\n import bisect\n from heapq import heappush, heappop\n \n \n def main():\n- s = int(input())\n- x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n+ S = int(input())\n \n- x3, y3 = divmod(s, 10**9)\n+ y = -(-S \n+ x = y * (10 ** 9) - S\n+\n+ print(0, 0, 10 ** 9, 1, x, y)\n \n- print(x1, y1, x2, y2, x3, y3)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n sys.setrecursionlimit(12345678)\n import itertools\n from collections import Counter\n from collections import defaultdict\n from collections import deque\n import bisect\n from heapq import heappush, heappop\n \n \n def main():\n- s = int(input())\n- x1, y1, x2, y2 = 0, 0, 10 ** 9, 1\n \n- x3, y3 = divmod(s, 10**9)\n \n- print(x1, y1, x2, y2, x3, y3)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 22 }, { "user_id": "u948911484", "problem_id": "p02963", "submission1_id": "s597776286", "submission2_id": "s536356601", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = int(input())\nl = [0,0,10**9,1,0,0]\nl[5] = s\nl[4] = 10**9-(s%(10**9))\nprint(*l)", "code2": "s = int(input())\nl = [0,0,10**9,1,10**9-(s%(10**9)),s\nif s == 10**18:\n l = [0,0,10**9,0,0,10**9]\nprint(*l)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584208320", "date2": "1584208804", "bleu_score": "0.6113868386205134", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "1731666236414\n", "actual_output": "0 0 1000000000 1 333763586 1731666236414\n", "expected_output": "0 0 1000000000 1 333763586 1732\n\n", "anno_code": ["s = int(input()) # (0): s=1731666236414\nl = [0,0,10**9,1,0,0] # (1): l=[0, 0, 1000000000, 1, 0, 0]\nl[5] = s # (2): l=[0, 0, 1000000000, 1, 0, 1731666236414]\nl[4] = 10**9-(s%(10**9)) # (3): l=[0, 0, 1000000000, 1, 333763586, 1731666236414]\nprint(*l)"], "anno_status": [true], "diff_content": " s = int(input())\n-l = [0,0,10**9,1,0,0]\n-l[5] = s\n-l[4] = 10**9-(s%(10**9))\n+l = [0,0,10**9,1,10**9-(s%(10**9)),s\n+if s == 10**18:\n+ l = [0,0,10**9,0,0,10**9]\n print(*l)\n", "FL_content": " s = int(input())\n-l = [0,0,10**9,1,0,0]\n-l[5] = s\n-l[4] = 10**9-(s%(10**9))\n print(*l)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u807772568", "problem_id": "p02963", "submission1_id": "s089948663", "submission2_id": "s268665427", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,collections as cl,bisect as bs\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9+7\nMax = sys.maxsize\ndef l(): \n return list(map(int,input().split()))\ndef m(): \n return map(int,input().split())\ndef onem(): \n return int(input())\ndef s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\ndef jo(x): \n return \" \".join(map(str,x))\ndef max2(x): \n return max(map(max,x))\ndef In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\ndef pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n\n\n\ns = onem()\n\nx = [0,10**9,0]\ny = [0,1,0]\n\nx[-1] = s % 10**9\ny[-1] = s \n\nprint(x[0],y[0],x[1],y[1],x[2],y[2])\n\n", "code2": "import sys,collections as cl,bisect as bs\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9+7\nMax = sys.maxsize\ndef l(): \n return list(map(int,input().split()))\ndef m(): \n return map(int,input().split())\ndef onem(): \n return int(input())\ndef s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\ndef jo(x): \n return \" \".join(map(str,x))\ndef max2(x): \n return max(map(max,x))\ndef In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\ndef pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n\n\n\ns = onem()\n\nx = [0,10**9,0]\ny = [0,1,0]\n\nx[-1] = -s % 10**9\ny[-1] = -(-s \n\nprint(x[0],y[0],x[1],y[1],x[2],y[2])\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586641819", "date2": "1586641970", "bleu_score": "0.992575146855839", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "2048226053\n", "actual_output": "0 0 1000000000 1 48226053 2048226053\n", "expected_output": "0 0 1000000000 1 951773947 3\n\n", "anno_code": ["import sys,collections as cl,bisect as bs\nsys.setrecursionlimit(100000) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nmod = 10**9+7 # (2): mod=1000000007\nMax = sys.maxsize # (3): Max=9223372036854775807\ndef l(): # (4): l=\n return list(map(int,input().split()))\ndef m(): # (5): m=\n return map(int,input().split())\ndef onem(): # (6): onem=\n return int(input())\ndef s(x): # (7): s=\n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\ndef jo(x): # (8): jo=\n return \" \".join(map(str,x))\ndef max2(x): # (9): max2=\n return max(map(max,x))\ndef In(x,a): # (10): In=\n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\ndef pow_k(x, n): # (11): pow_k=\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n\n\n\ns = onem() # (12): s=2048226053\n\nx = [0,10**9,0] # (13): x=[0, 1000000000, 0]\ny = [0,1,0] # (14): y=[0, 1, 0]\n\nx[-1] = s % 10**9 # (15): x=[0, 1000000000, 48226053]\ny[-1] = s # (16): y=[0, 1, 2048226053]\n\nprint(x[0],y[0],x[1],y[1],x[2],y[2])\n\n"], "anno_status": [true], "diff_content": " import sys,collections as cl,bisect as bs\n sys.setrecursionlimit(100000)\n input = sys.stdin.readline\n mod = 10**9+7\n Max = sys.maxsize\n def l(): \n return list(map(int,input().split()))\n def m(): \n return map(int,input().split())\n def onem(): \n return int(input())\n def s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\n def jo(x): \n return \" \".join(map(str,x))\n def max2(x): \n return max(map(max,x))\n def In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n \n def pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n \n \n \n s = onem()\n \n x = [0,10**9,0]\n y = [0,1,0]\n \n-x[-1] = s % 10**9\n-y[-1] = s \n+x[-1] = -s % 10**9\n+y[-1] = -(-s \n \n print(x[0],y[0],x[1],y[1],x[2],y[2])\n \n \n", "FL_content": " import sys,collections as cl,bisect as bs\n sys.setrecursionlimit(100000)\n input = sys.stdin.readline\n mod = 10**9+7\n Max = sys.maxsize\n def l(): \n return list(map(int,input().split()))\n def m(): \n return map(int,input().split())\n def onem(): \n return int(input())\n def s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\n def jo(x): \n return \" \".join(map(str,x))\n def max2(x): \n return max(map(max,x))\n def In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n \n def pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n \n \n \n s = onem()\n \n x = [0,10**9,0]\n y = [0,1,0]\n \n-x[-1] = s % 10**9\n-y[-1] = s \n \n print(x[0],y[0],x[1],y[1],x[2],y[2])\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 59 }, { "user_id": "u599547273", "problem_id": "p02963", "submission1_id": "s082779680", "submission2_id": "s821419363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\n\nX1, Y1 = 0, 0\n\nX2 = 10**9\nY3 = S\n\nX3 = 1\nY2 = (10**9) - S%(10**9)\n\nprint(X1, Y1, X2, Y2, X3, Y3)", "code2": "S = int(input())\n\n\n\n\n\nX1, Y1 = 0, 0\n\nX2 = 10**9\nY3 = -(-S\n\nX3 = 1\nY2 = -(S%-(10**9))\n\nprint(X1, Y1, X2, Y2, X3, Y3)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572964553", "date2": "1572964932", "bleu_score": "0.863859327884126", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "238429723295099\n", "actual_output": "0 0 1000000000 276704901 1 238429723295099\n", "expected_output": "0 0 1000000000 1 276704901 238430\n\n", "anno_code": ["S = int(input()) # (0): S=238429723295099\n\nX1, Y1 = 0, 0 # (1): X1=0, Y1=0\n\nX2 = 10**9 # (2): X2=1000000000\nY3 = S # (3): Y3=238429723295099\n\nX3 = 1 # (4): X3=1\nY2 = (10**9) - S%(10**9) # (5): Y2=276704901\n\nprint(X1, Y1, X2, Y2, X3, Y3)"], "anno_status": [true], "diff_content": " S = int(input())\n \n+\n+\n+\n+\n X1, Y1 = 0, 0\n \n X2 = 10**9\n-Y3 = S\n+Y3 = -(-S\n \n X3 = 1\n-Y2 = (10**9) - S%(10**9)\n+Y2 = -(S%-(10**9))\n \n print(X1, Y1, X2, Y2, X3, Y3)\n", "FL_content": " S = int(input())\n \n X1, Y1 = 0, 0\n \n X2 = 10**9\n-Y3 = S\n \n X3 = 1\n-Y2 = (10**9) - S%(10**9)\n \n print(X1, Y1, X2, Y2, X3, Y3)\n", "added_lines": 6, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u580362735", "problem_id": "p02963", "submission1_id": "s710213511", "submission2_id": "s346638357", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = S\ny3 = (x2-S%x2)%x2\nprint(x1,y1,x2,y2,x3,y3)", "code2": "S = int(input())\nx1 = 0\ny1 = 0\nx2 = 10**9\ny2 = 1\nx3 = (x2-S%x2)%x2\ny3 = -(-S\nprint(x1,y1,x2,y2,x3,y3)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563771068", "date2": "1563771452", "bleu_score": "0.9322440080672636", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 89, "input": "3592841737\n", "actual_output": "0 0 1000000000 1 3592841737 407158263\n", "expected_output": "0 0 1000000000 1 407158263 4\n\n", "anno_code": ["S = int(input()) # (0): S=3592841737\nx1 = 0 # (1): x1=0\ny1 = 0 # (2): y1=0\nx2 = 10**9 # (3): x2=1000000000\ny2 = 1 # (4): y2=1\nx3 = S # (5): x3=3592841737\ny3 = (x2-S%x2)%x2 # (6): y3=407158263\nprint(x1,y1,x2,y2,x3,y3)"], "anno_status": [true], "diff_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n y2 = 1\n-x3 = S\n-y3 = (x2-S%x2)%x2\n+x3 = (x2-S%x2)%x2\n+y3 = -(-S\n print(x1,y1,x2,y2,x3,y3)\n+\n", "FL_content": " S = int(input())\n x1 = 0\n y1 = 0\n x2 = 10**9\n y2 = 1\n-x3 = S\n-y3 = (x2-S%x2)%x2\n print(x1,y1,x2,y2,x3,y3)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u340781749", "problem_id": "p03300", "submission1_id": "s550101020", "submission2_id": "s770273256", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\n\ndef search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n break\n ai = aaa.index(cur, ai)\n tmp_cur = bbb[ai]\n repeat += 1\n return repeat, max_cur + 1\n\n\ndef search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n max_cursor = sss.index(0, cursor)\n last_bi = aaa.index(max_cursor)\n\n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max, max_cursor + 1\n\n\ndef integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n\n\nn = int(input())\ns = input()\n\nn2 = n * 2\nsss = []\naaa, bbb = [], []\nfor i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\nsss = list(accumulate(sss))\nrepeat_a = 0\nparts_b = []\ncursor = 0\nwhile cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n repeat_a += repeat\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\nif parts_b:\n print(integrate(parts_b))\nelse:\n print('ab' * repeat_a)\n", "code2": "from itertools import accumulate\n\n\ndef search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n break\n ai = aaa.index(cur, ai)\n tmp_cur = bbb[ai]\n repeat += 1\n return repeat, max_cur + 1\n\n\ndef search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n max_cursor = sss.index(0, cursor)\n last_bi = aaa.index(max_cursor)\n\n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max, max_cursor + 1\n\n\ndef integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n\n\nn = int(input())\ns = input()\n\nn2 = n * 2\nsss = []\naaa, bbb = [], []\nfor i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\nsss = list(accumulate(sss))\nrepeats_a = []\nparts_b = []\nlast_b_cur = 0\ncursor = 0\nwhile cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n repeats_a.append((cursor, repeat))\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\n last_b_cur = cursor\nprint(integrate(parts_b) + 'ab' * sum(r for c, r in repeats_a if c > last_b_cur))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531652956", "date2": "1531653404", "bleu_score": "0.937909905719738", "code1_test_status": [0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 76, "total_score": 104, "input": "9\nabbaaababaababbabb\n", "actual_output": "ba\n", "expected_output": "baababab\n\n", "anno_code": ["from itertools import accumulate\n\n\ndef search_ab(sss, cursor): # (0): search_ab=\n \n ai = aaa.index(cursor) # (89): ai=0 (116): ai=2\n tmp_cur = bbb[ai] # (90): tmp_cur=1 (117): tmp_cur=6\n max_cur = sss.index(0, cursor) # (91): max_cur=1 (118): max_cur=17\n repeat = 1 # (92): repeat=1 (119): repeat=1\n while tmp_cur < max_cur: # (93): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=abbaaababaababbabb, n2=18, aaa=[0, 3, 4, 5, 7, 9, 10, 12, 15], bbb=[1, 2, 6, 8, 11, 13, 14, 16, 17], i=17, c=-1, repeat_a=0, parts_b=[], cursor=2 (120): NO CHANGE ... (132): NO CHANGE\n cur = s.find('a', tmp_cur, max_cur) # (121): cur=7 (127): cur=12 (133): cur=-1\n if cur == -1: # (122): NO CHANGE (128): NO CHANGE (134): NO CHANGE\n break # (135): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=abbaaababaababbabb, n2=18, aaa=[0, 3, 4, 5, 7, 9, 10, 12, 15], bbb=[1, 2, 6, 8, 11, 13, 14, 16, 17], i=17, c=-1, repeat_a=1, parts_b=['ba'], cursor=18, tmp=ba\n ai = aaa.index(cur, ai) # (123): ai=4 (129): ai=7\n tmp_cur = bbb[ai] # (124): tmp_cur=11 (130): tmp_cur=16\n repeat += 1 # (125): repeat=2 (131): repeat=3\n return repeat, max_cur + 1\n\n\ndef search_ba(sss, cursor): # (1): search_ba=\n \n first_bi = bbb.index(cursor) # (99): first_bi=1\n max_cursor = sss.index(0, cursor) # (100): max_cursor=3\n last_bi = aaa.index(max_cursor) # (101): last_bi=1\n\n tmp_buf = [''] * (last_bi - first_bi + 1) * 2 # (102): tmp_buf=['', '']\n tmp_max = '' # (103): tmp_max=\n for i in range(last_bi, first_bi - 1, -1): # (104): i=1 (110): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=abbaaababaababbabb, n2=18, aaa=[0, 3, 4, 5, 7, 9, 10, 12, 15], bbb=[1, 2, 6, 8, 11, 13, 14, 16, 17], i=17, c=1, repeat_a=1, parts_b=[], cursor=4, repeat=1\n tmp_buf[aaa[i] - cursor] = 'a' # (105): tmp_buf=['', 'a']\n tmp_buf[bbb[i] - cursor] = 'b' # (106): tmp_buf=['b', 'a']\n tmp = ''.join(tmp_buf) # (107): tmp=ba\n if tmp > tmp_max: # (108): NO CHANGE\n tmp_max = tmp # (109): tmp_max=ba\n return tmp_max, max_cursor + 1\n\n\ndef integrate(parts_b): # (2): integrate=\n tmp_max = '' # (140): tmp_max=\n for pb in reversed(parts_b): # (141): pb=ba\n tmp = pb + tmp_max # (142): tmp=ba\n if tmp > tmp_max: # (143): NO CHANGE\n tmp_max = tmp # (144): tmp_max=ba\n return tmp_max\n\n\nn = int(input()) # (3): n=9\ns = input() # (4): s=abbaaababaababbabb\n\nn2 = n * 2 # (5): n2=18\nsss = [] # (6): sss=[]\naaa, bbb = [], [] # (7): aaa=[], bbb=[]\nfor i, c in enumerate(s): # (8): i=0, c=a (12): i=1, c=b ... (80): NO CHANGE\n if c == 'a': # (9): NO CHANGE (13): NO CHANGE ... (77): NO CHANGE\n aaa.append(i) # (10): aaa=[0] (22): aaa=[0, 3] ... (70): aaa=[0, 3, 4, 5, 7, 9, 10, 12, 15]\n sss.append(-1) # (11): sss=[-1] (23): sss=[-1, 1, 1, -1] ... (71): sss=[-1, 1, 1, -1, -1, -1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1]\n else:\n bbb.append(i) # (14): bbb=[1] (18): bbb=[1, 2] ... (78): bbb=[1, 2, 6, 8, 11, 13, 14, 16, 17]\n sss.append(1) # (15): sss=[-1, 1] (19): sss=[-1, 1, 1] ... (79): sss=[-1, 1, 1, -1, -1, -1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, 1]\nsss = list(accumulate(sss)) # (81): sss=[-1, 0, 1, 0, -1, -2, -1, -2, -1, -2, -3, -2, -3, -2, -1, -2, -1, 0]\nrepeat_a = 0 # (82): repeat_a=0\nparts_b = [] # (83): parts_b=[]\ncursor = 0 # (84): cursor=0\nwhile cursor < n2: # (85): NO CHANGE (95): NO CHANGE ... (137): NO CHANGE\n c = sss[cursor] # (86): c=-1 (96): c=1 (113): c=-1\n if c < 0: # (87): NO CHANGE (97): NO CHANGE (114): NO CHANGE\n repeat, cursor = search_ab(sss, cursor) # (88): NO CHANGE (115): NO CHANGE\n repeat_a += repeat # (94): repeat_a=1 (136): repeat_a=4\n else:\n tmp, cursor = search_ba(sss, cursor) # (98): NO CHANGE\n parts_b.append(tmp) # (111): parts_b=['ba']\nif parts_b: # (138): NO CHANGE\n print(integrate(parts_b)) # (139): NO CHANGE\nelse:\n print('ab' * repeat_a)\n"], "anno_status": [false], "diff_content": " from itertools import accumulate\n \n \n def search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n break\n ai = aaa.index(cur, ai)\n tmp_cur = bbb[ai]\n repeat += 1\n return repeat, max_cur + 1\n \n \n def search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n max_cursor = sss.index(0, cursor)\n last_bi = aaa.index(max_cursor)\n \n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max, max_cursor + 1\n \n \n def integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n \n \n n = int(input())\n s = input()\n \n n2 = n * 2\n sss = []\n aaa, bbb = [], []\n for i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\n sss = list(accumulate(sss))\n-repeat_a = 0\n+repeats_a = []\n parts_b = []\n+last_b_cur = 0\n cursor = 0\n while cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n- repeat_a += repeat\n+ repeats_a.append((cursor, repeat))\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\n-if parts_b:\n- print(integrate(parts_b))\n-else:\n- print('ab' * repeat_a)\n+ last_b_cur = cursor\n+print(integrate(parts_b) + 'ab' * sum(r for c, r in repeats_a if c > last_b_cur))\n \n", "FL_content": " from itertools import accumulate\n \n \n def search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n break\n ai = aaa.index(cur, ai)\n tmp_cur = bbb[ai]\n repeat += 1\n return repeat, max_cur + 1\n \n \n def search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n max_cursor = sss.index(0, cursor)\n last_bi = aaa.index(max_cursor)\n \n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max, max_cursor + 1\n \n \n def integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n \n \n n = int(input())\n s = input()\n \n n2 = n * 2\n sss = []\n aaa, bbb = [], []\n for i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\n sss = list(accumulate(sss))\n-repeat_a = 0\n parts_b = []\n cursor = 0\n while cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n- repeat_a += repeat\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\n-if parts_b:\n- print(integrate(parts_b))\n-else:\n- print('ab' * repeat_a)\n \n", "added_lines": 5, "removed_lines": 6, "code1_lines": 75 }, { "user_id": "u340781749", "problem_id": "p03300", "submission1_id": "s547021953", "submission2_id": "s770273256", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\n\ndef search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n tmp_cur = max_cur\n break\n ai = aaa.index(cur)\n tmp_cur = bbb[ai]\n repeat += 1\n return repeat, tmp_cur + 1\n\n\ndef search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n last_cursor = sss.index(0, cursor)\n last_bi = aaa.index(last_cursor)\n\n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max, last_cursor + 1\n\n\ndef integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n\n\nn = int(input())\ns = input()\n\nn2 = n * 2\nsss = []\naaa, bbb = [], []\nfor i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\nsss = list(accumulate(sss))\nrepeat_a = 0\nparts_b = []\ncursor = 0\nwhile cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n repeat_a += repeat\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\nif parts_b:\n print(integrate(parts_b))\nelse:\n print('ab' * repeat_a)\n", "code2": "from itertools import accumulate\n\n\ndef search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n break\n ai = aaa.index(cur, ai)\n tmp_cur = bbb[ai]\n repeat += 1\n return repeat, max_cur + 1\n\n\ndef search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n max_cursor = sss.index(0, cursor)\n last_bi = aaa.index(max_cursor)\n\n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max, max_cursor + 1\n\n\ndef integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n\n\nn = int(input())\ns = input()\n\nn2 = n * 2\nsss = []\naaa, bbb = [], []\nfor i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\nsss = list(accumulate(sss))\nrepeats_a = []\nparts_b = []\nlast_b_cur = 0\ncursor = 0\nwhile cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n repeats_a.append((cursor, repeat))\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\n last_b_cur = cursor\nprint(integrate(parts_b) + 'ab' * sum(r for c, r in repeats_a if c > last_b_cur))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531652273", "date2": "1531653404", "bleu_score": "0.940681830802603", "code1_test_status": [0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 76, "total_score": 104, "input": "9\nababbabaabaaabbabb\n", "actual_output": "baba\n", "expected_output": "babaababab\n\n", "anno_code": ["from itertools import accumulate\n\n\ndef search_ab(sss, cursor): # (0): search_ab=\n \n ai = aaa.index(cursor) # (89): ai=0 (99): ai=1 ... (153): ai=5\n tmp_cur = bbb[ai] # (90): tmp_cur=1 (100): tmp_cur=3 ... (154): tmp_cur=13\n max_cur = sss.index(0, cursor) # (91): max_cur=1 (101): max_cur=3 ... (155): max_cur=17\n repeat = 1 # (92): repeat=1 (102): repeat=1 ... (156): repeat=1\n while tmp_cur < max_cur: # (93): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=ababbabaabaaabbabb, n2=18, aaa=[0, 2, 5, 7, 8, 10, 11, 12, 15], bbb=[1, 3, 4, 6, 9, 13, 14, 16, 17], i=17, c=-1, repeat_a=0, parts_b=[], cursor=2 (103): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=ababbabaabaaabbabb, n2=18, aaa=[0, 2, 5, 7, 8, 10, 11, 12, 15], bbb=[1, 3, 4, 6, 9, 13, 14, 16, 17], i=17, c=-1, repeat_a=1, parts_b=[], cursor=4 ... (163): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=ababbabaabaaabbabb, n2=18, aaa=[0, 2, 5, 7, 8, 10, 11, 12, 15], bbb=[1, 3, 4, 6, 9, 13, 14, 16, 17], i=17, c=-1, repeat_a=3, parts_b=['ba', 'ba'], cursor=18, tmp=ba\n cur = s.find('a', tmp_cur, max_cur) # (158): cur=15\n if cur == -1: # (159): NO CHANGE\n tmp_cur = max_cur\n break\n ai = aaa.index(cur) # (160): ai=8\n tmp_cur = bbb[ai] # (161): tmp_cur=17\n repeat += 1 # (162): repeat=2\n return repeat, tmp_cur + 1\n\n\ndef search_ba(sss, cursor): # (1): search_ba=\n \n first_bi = bbb.index(cursor) # (109): first_bi=2 (126): first_bi=3\n last_cursor = sss.index(0, cursor) # (110): last_cursor=5 (127): last_cursor=7\n last_bi = aaa.index(last_cursor) # (111): last_bi=2 (128): last_bi=3\n\n tmp_buf = [''] * (last_bi - first_bi + 1) * 2 # (112): tmp_buf=['', ''] (129): tmp_buf=['', '']\n tmp_max = '' # (113): tmp_max= (130): tmp_max=\n for i in range(last_bi, first_bi - 1, -1): # (114): i=2 (120): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=ababbabaabaaabbabb, n2=18, aaa=[0, 2, 5, 7, 8, 10, 11, 12, 15], bbb=[1, 3, 4, 6, 9, 13, 14, 16, 17], i=17, c=1, repeat_a=2, parts_b=[], cursor=6, repeat=1 ... (137): accumulate=, search_ab=, search_ba=, integrate=, n=9, s=ababbabaabaaabbabb, n2=18, aaa=[0, 2, 5, 7, 8, 10, 11, 12, 15], bbb=[1, 3, 4, 6, 9, 13, 14, 16, 17], i=17, c=1, repeat_a=2, parts_b=['ba'], cursor=8, repeat=1\n tmp_buf[aaa[i] - cursor] = 'a' # (115): tmp_buf=['', 'a'] (132): tmp_buf=['', 'a']\n tmp_buf[bbb[i] - cursor] = 'b' # (116): tmp_buf=['b', 'a'] (133): tmp_buf=['b', 'a']\n tmp = ''.join(tmp_buf) # (117): tmp=ba (134): tmp=ba\n if tmp > tmp_max: # (118): NO CHANGE (135): NO CHANGE\n tmp_max = tmp # (119): tmp_max=ba (136): tmp_max=ba\n return tmp_max, last_cursor + 1\n\n\ndef integrate(parts_b): # (2): integrate=\n tmp_max = '' # (168): tmp_max=\n for pb in reversed(parts_b): # (169): pb=ba (173): NO CHANGE\n tmp = pb + tmp_max # (170): tmp=ba (174): tmp=baba\n if tmp > tmp_max: # (171): NO CHANGE (175): NO CHANGE\n tmp_max = tmp # (172): tmp_max=ba (176): tmp_max=baba\n return tmp_max\n\n\nn = int(input()) # (3): n=9\ns = input() # (4): s=ababbabaabaaabbabb\n\nn2 = n * 2 # (5): n2=18\nsss = [] # (6): sss=[]\naaa, bbb = [], [] # (7): aaa=[], bbb=[]\nfor i, c in enumerate(s): # (8): i=0, c=a (12): i=1, c=b ... (80): NO CHANGE\n if c == 'a': # (9): NO CHANGE (13): NO CHANGE ... (77): NO CHANGE\n aaa.append(i) # (10): aaa=[0] (18): aaa=[0, 2] ... (70): aaa=[0, 2, 5, 7, 8, 10, 11, 12, 15]\n sss.append(-1) # (11): sss=[-1] (19): sss=[-1, 1, -1] ... (71): sss=[-1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1]\n else:\n bbb.append(i) # (14): bbb=[1] (22): bbb=[1, 3] ... (78): bbb=[1, 3, 4, 6, 9, 13, 14, 16, 17]\n sss.append(1) # (15): sss=[-1, 1] (23): sss=[-1, 1, -1, 1] ... (79): sss=[-1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1]\nsss = list(accumulate(sss)) # (81): sss=[-1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, -2, -3, -2, -1, -2, -1, 0]\nrepeat_a = 0 # (82): repeat_a=0\nparts_b = [] # (83): parts_b=[]\ncursor = 0 # (84): cursor=0\nwhile cursor < n2: # (85): NO CHANGE (95): NO CHANGE ... (165): NO CHANGE\n c = sss[cursor] # (86): c=-1 (96): NO CHANGE ... (150): NO CHANGE\n if c < 0: # (87): NO CHANGE (97): NO CHANGE ... (151): NO CHANGE\n repeat, cursor = search_ab(sss, cursor) # (88): NO CHANGE (98): NO CHANGE ... (152): NO CHANGE\n repeat_a += repeat # (94): repeat_a=1 (104): repeat_a=2 ... (164): repeat_a=5\n else:\n tmp, cursor = search_ba(sss, cursor) # (108): NO CHANGE (125): NO CHANGE\n parts_b.append(tmp) # (121): parts_b=['ba'] (138): parts_b=['ba', 'ba']\nif parts_b: # (166): NO CHANGE\n print(integrate(parts_b)) # (167): NO CHANGE\nelse:\n print('ab' * repeat_a)\n"], "anno_status": [false], "diff_content": " from itertools import accumulate\n \n \n def search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n- tmp_cur = max_cur\n break\n- ai = aaa.index(cur)\n+ ai = aaa.index(cur, ai)\n tmp_cur = bbb[ai]\n repeat += 1\n- return repeat, tmp_cur + 1\n+ return repeat, max_cur + 1\n \n \n def search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n- last_cursor = sss.index(0, cursor)\n- last_bi = aaa.index(last_cursor)\n+ max_cursor = sss.index(0, cursor)\n+ last_bi = aaa.index(max_cursor)\n \n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n- return tmp_max, last_cursor + 1\n+ return tmp_max, max_cursor + 1\n \n \n def integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n \n \n n = int(input())\n s = input()\n \n n2 = n * 2\n sss = []\n aaa, bbb = [], []\n for i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\n sss = list(accumulate(sss))\n-repeat_a = 0\n+repeats_a = []\n parts_b = []\n+last_b_cur = 0\n cursor = 0\n while cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n- repeat_a += repeat\n+ repeats_a.append((cursor, repeat))\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\n-if parts_b:\n- print(integrate(parts_b))\n-else:\n- print('ab' * repeat_a)\n+ last_b_cur = cursor\n+print(integrate(parts_b) + 'ab' * sum(r for c, r in repeats_a if c > last_b_cur))\n \n", "FL_content": " from itertools import accumulate\n \n \n def search_ab(sss, cursor):\n \n ai = aaa.index(cursor)\n tmp_cur = bbb[ai]\n max_cur = sss.index(0, cursor)\n repeat = 1\n while tmp_cur < max_cur:\n cur = s.find('a', tmp_cur, max_cur)\n if cur == -1:\n- tmp_cur = max_cur\n break\n- ai = aaa.index(cur)\n tmp_cur = bbb[ai]\n repeat += 1\n- return repeat, tmp_cur + 1\n \n \n def search_ba(sss, cursor):\n \n first_bi = bbb.index(cursor)\n- last_cursor = sss.index(0, cursor)\n- last_bi = aaa.index(last_cursor)\n \n tmp_buf = [''] * (last_bi - first_bi + 1) * 2\n tmp_max = ''\n for i in range(last_bi, first_bi - 1, -1):\n tmp_buf[aaa[i] - cursor] = 'a'\n tmp_buf[bbb[i] - cursor] = 'b'\n tmp = ''.join(tmp_buf)\n if tmp > tmp_max:\n tmp_max = tmp\n- return tmp_max, last_cursor + 1\n \n \n def integrate(parts_b):\n tmp_max = ''\n for pb in reversed(parts_b):\n tmp = pb + tmp_max\n if tmp > tmp_max:\n tmp_max = tmp\n return tmp_max\n \n \n n = int(input())\n s = input()\n \n n2 = n * 2\n sss = []\n aaa, bbb = [], []\n for i, c in enumerate(s):\n if c == 'a':\n aaa.append(i)\n sss.append(-1)\n else:\n bbb.append(i)\n sss.append(1)\n sss = list(accumulate(sss))\n-repeat_a = 0\n parts_b = []\n cursor = 0\n while cursor < n2:\n c = sss[cursor]\n if c < 0:\n repeat, cursor = search_ab(sss, cursor)\n- repeat_a += repeat\n else:\n tmp, cursor = search_ba(sss, cursor)\n parts_b.append(tmp)\n-if parts_b:\n- print(integrate(parts_b))\n-else:\n- print('ab' * repeat_a)\n \n", "added_lines": 10, "removed_lines": 12, "code1_lines": 76 }, { "user_id": "u226155577", "problem_id": "p03783", "submission1_id": "s224915491", "submission2_id": "s469015960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\nP = [list(map(int, input().split())) for i in range(N)]\n\nINF = 10**18\n\nfrom heapq import heappush, heappop\n\nl0, r0 = P[0]\n\nL = [-l0+1]\nR = [l0-1]\ns = t = 0\n\ndef debug(L, s, t, R):\n L0 = L[:]\n Q1 = []; Q2 = []\n while L0:\n Q1.append(-s-heappop(L0))\n R0 = R[:]\n while R0:\n Q2.append(t+heappop(R0))\n print(\"debug:\", *Q1[::-1]+Q2)\n\n\n\nres = 0\nfor i in range(N-1):\n l0, r0 = P[i]\n l1, r1 = P[i+1]\n \n s += (r1 - l1); t += (r0 - l0)\n if -s-L[0] <= l1-1 <= t+R[0]:\n \n heappush(L, -l1+1-s)\n heappush(R, l1-1-t)\n \n elif l1-1 < -s-L[0]:\n \n heappush(L, -l1+1-s)\n heappush(L, -l1+1-s)\n p = -heappop(L)-s\n d = p - (-L[0]-s)\n heappush(R, p-t)\n \n if d == 0:\n res += p - (l1-1)\n else:\n res += d\n elif t+R[0] < l1-1:\n \n heappush(R, l1-1-t)\n heappush(R, l1-1-t)\n p = heappop(R) + t\n d = R[0]+t - p\n heappush(L, -p-s)\n \n if d == 0:\n res += (l1-1) - p\n else:\n res += d\n \n \nprint(res)\n", "code2": "\nN = int(input())\nP = [list(map(int, input().split())) for i in range(N)]\n\nINF = 10**18\n\nfrom heapq import heappush, heappop\n\nl0, r0 = P[0]\n\nL = [-l0+1]\nR = [l0-1]\ns = t = 0\n\ndef debug(L, s, t, R):\n L0 = L[:]\n Q1 = []; Q2 = []\n while L0:\n Q1.append(-s-heappop(L0))\n R0 = R[:]\n while R0:\n Q2.append(t+heappop(R0))\n print(\"debug:\", *Q1[::-1]+Q2)\n\n\n\nres = 0\nfor i in range(N-1):\n l0, r0 = P[i]\n l1, r1 = P[i+1]\n \n s += (r1 - l1); t += (r0 - l0)\n if -s-L[0] <= l1-1 <= t+R[0]:\n \n heappush(L, -l1+1-s)\n heappush(R, l1-1-t)\n \n elif l1-1 < -s-L[0]:\n \n heappush(L, -l1+1-s)\n heappush(L, -l1+1-s)\n p = -heappop(L)-s\n \n heappush(R, p-t)\n \n \n res += (p - (l1-1))\n elif t+R[0] < l1-1:\n \n heappush(R, l1-1-t)\n heappush(R, l1-1-t)\n p = heappop(R) + t\n \n heappush(L, -p-s)\n \n res += (l1-1 - p)\n \n \nprint(res)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1519640416", "date2": "1519641344", "bleu_score": "0.8631884188817076", "code1_test_status": [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, 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], "code1_test_score": 102, "total_score": 105, "input": "5\n70352 110697\n26 77\n12 34189511\n107865 80582\n0 33\n", "actual_output": "150845\n", "expected_output": "178107\n\n", "anno_code": ["\nN = int(input()) # (0): N=5\nP = [list(map(int, input().split())) for i in range(N)] # (1): P\n\nINF = 10**18 # (2): INF=1000000000000000000, heappush=, heappop=\n\nfrom heapq import heappush, heappop\n\nl0, r0 = P[0] # (3): l0=70352, r0=110697\n\nL = [-l0+1] # (4): L=[-70351]\nR = [l0-1] # (5): R=[70351]\ns = t = 0 # (6): s=0, t=0\n\ndef debug(L, s, t, R): # (7): debug=\n L0 = L[:]\n Q1 = []; Q2 = []\n while L0:\n Q1.append(-s-heappop(L0))\n R0 = R[:]\n while R0:\n Q2.append(t+heappop(R0))\n print(\"debug:\", *Q1[::-1]+Q2)\n\n\n\nres = 0 # (8): res=0\nfor i in range(N-1): # (9): i=0 (22): i=1 ... (49): NO CHANGE\n l0, r0 = P[i] # (10): NO CHANGE (23): l0=26, r0=77 ... (37): l0=107865, r0=80582\n l1, r1 = P[i+1] # (11): l1=26, r1=77 (24): l1=12, r1=34189511 ... (38): l1=0, r1=33\n \n s += (r1 - l1); t += (r0 - l0) # (12): s=51, t=40345 (25): s=34189550, t=40396 ... (39): s=34162300, t=34202612\n if -s-L[0] <= l1-1 <= t+R[0]: # (13): NO CHANGE (26): NO CHANGE ... (40): NO CHANGE\n \n heappush(L, -l1+1-s) # (27): L=[-34189561, -76, -76] (34): L=[-34270131, -34189561, -76, -76]\n heappush(R, l1-1-t) # (28): R=[-40385, 70351, 29955] (35): R=[-34122031, -40385, 29955, 70351]\n \n elif l1-1 < -s-L[0]: # (14): NO CHANGE (41): NO CHANGE\n \n heappush(L, -l1+1-s) # (15): L=[-70351, -76] (42): L=[-34270131, -34189561, -76, -76, -34162299]\n heappush(L, -l1+1-s) # (16): L=[-70351, -76, -76] (43): L=[-34270131, -34189561, -34162299, -76, -34162299, -76]\n p = -heappop(L)-s # (17): L=[-76, -76], p=70300 (44): L=[-34189561, -34162299, -34162299, -76, -76], p=107831\n d = p - (-L[0]-s) # (18): d=70275 (45): d=80570\n heappush(R, p-t) # (19): R=[29955, 70351] (46): R=[-34122031, -34094781, 29955, 70351, -40385]\n \n if d == 0: # (20): NO CHANGE (47): NO CHANGE\n res += p - (l1-1)\n else:\n res += d # (21): res=70275 (48): res=150845\n elif t+R[0] < l1-1:\n \n heappush(R, l1-1-t)\n heappush(R, l1-1-t)\n p = heappop(R) + t\n d = R[0]+t - p\n heappush(L, -p-s)\n \n if d == 0:\n res += (l1-1) - p\n else:\n res += d\n \n \nprint(res)\n"], "anno_status": [false], "diff_content": " \n N = int(input())\n P = [list(map(int, input().split())) for i in range(N)]\n \n INF = 10**18\n \n from heapq import heappush, heappop\n \n l0, r0 = P[0]\n \n L = [-l0+1]\n R = [l0-1]\n s = t = 0\n \n def debug(L, s, t, R):\n L0 = L[:]\n Q1 = []; Q2 = []\n while L0:\n Q1.append(-s-heappop(L0))\n R0 = R[:]\n while R0:\n Q2.append(t+heappop(R0))\n print(\"debug:\", *Q1[::-1]+Q2)\n \n \n \n res = 0\n for i in range(N-1):\n l0, r0 = P[i]\n l1, r1 = P[i+1]\n \n s += (r1 - l1); t += (r0 - l0)\n if -s-L[0] <= l1-1 <= t+R[0]:\n \n heappush(L, -l1+1-s)\n heappush(R, l1-1-t)\n \n elif l1-1 < -s-L[0]:\n \n heappush(L, -l1+1-s)\n heappush(L, -l1+1-s)\n p = -heappop(L)-s\n- d = p - (-L[0]-s)\n+ \n heappush(R, p-t)\n \n- if d == 0:\n- res += p - (l1-1)\n- else:\n- res += d\n+ \n+ res += (p - (l1-1))\n elif t+R[0] < l1-1:\n \n heappush(R, l1-1-t)\n heappush(R, l1-1-t)\n p = heappop(R) + t\n- d = R[0]+t - p\n+ \n heappush(L, -p-s)\n \n- if d == 0:\n- res += (l1-1) - p\n- else:\n- res += d\n+ res += (l1-1 - p)\n \n \n print(res)\n \n", "FL_content": " \n N = int(input())\n P = [list(map(int, input().split())) for i in range(N)]\n \n INF = 10**18\n \n from heapq import heappush, heappop\n \n l0, r0 = P[0]\n \n L = [-l0+1]\n R = [l0-1]\n s = t = 0\n \n def debug(L, s, t, R):\n L0 = L[:]\n Q1 = []; Q2 = []\n while L0:\n Q1.append(-s-heappop(L0))\n R0 = R[:]\n while R0:\n Q2.append(t+heappop(R0))\n print(\"debug:\", *Q1[::-1]+Q2)\n \n \n \n res = 0\n for i in range(N-1):\n l0, r0 = P[i]\n l1, r1 = P[i+1]\n \n s += (r1 - l1); t += (r0 - l0)\n if -s-L[0] <= l1-1 <= t+R[0]:\n \n heappush(L, -l1+1-s)\n heappush(R, l1-1-t)\n \n elif l1-1 < -s-L[0]:\n \n heappush(L, -l1+1-s)\n heappush(L, -l1+1-s)\n p = -heappop(L)-s\n- d = p - (-L[0]-s)\n heappush(R, p-t)\n \n- if d == 0:\n- res += p - (l1-1)\n- else:\n- res += d\n elif t+R[0] < l1-1:\n \n heappush(R, l1-1-t)\n heappush(R, l1-1-t)\n p = heappop(R) + t\n- d = R[0]+t - p\n heappush(L, -p-s)\n \n- if d == 0:\n- res += (l1-1) - p\n- else:\n- res += d\n \n \n print(res)\n \n", "added_lines": 5, "removed_lines": 10, "code1_lines": 65 }, { "user_id": "u102461423", "problem_id": "p03766", "submission1_id": "s711539629", "submission2_id": "s948450674", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nMOD = 10**9 + 7\nN = int(input())\n\ndp = [0] * (N+10)\ndp_cum = [0] * (N+10)\n\ndp[1] = N-1; dp_cum[1] = N-1\ndp[2] = N-1; dp_cum[2] = 2*(N-1)\nfor n in range(3,N+1):\n dp[n] = dp[n-1] + dp_cum[n-3]\n dp_cum[n] = (dp_cum[n-1] + dp[n]) % MOD\n\nanswer = sum(dp[1:N])*N + dp[-1] + 1\nanswer %= MOD\nprint(answer)", "code2": "import sys\ninput = sys.stdin.readline\n\nMOD = 10**9 + 7\nN = int(input())\n\ndp = [0] * (N+10)\ndp_cum = [0] * (N+10)\n\ndp[1] = N-1; dp_cum[1] = N-1\ndp[2] = N-1; dp_cum[2] = 2*(N-1)\nfor n in range(3,N+1):\n dp[n] = dp[n-1] + dp_cum[n-3]\n dp_cum[n] = (dp_cum[n-1] + dp[n]) % MOD\n\nanswer = sum(dp[1:N])*N + dp[N] + 1\nanswer %= MOD\nprint(answer)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568838546", "date2": "1568838581", "bleu_score": "0.9897131164116056", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 76, "input": "395899\n", "actual_output": "112394772\n", "expected_output": "310829317\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n MOD = 10**9 + 7\n N = int(input())\n \n dp = [0] * (N+10)\n dp_cum = [0] * (N+10)\n \n dp[1] = N-1; dp_cum[1] = N-1\n dp[2] = N-1; dp_cum[2] = 2*(N-1)\n for n in range(3,N+1):\n dp[n] = dp[n-1] + dp_cum[n-3]\n dp_cum[n] = (dp_cum[n-1] + dp[n]) % MOD\n \n-answer = sum(dp[1:N])*N + dp[-1] + 1\n+answer = sum(dp[1:N])*N + dp[N] + 1\n answer %= MOD\n print(answer)\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n MOD = 10**9 + 7\n N = int(input())\n \n dp = [0] * (N+10)\n dp_cum = [0] * (N+10)\n \n dp[1] = N-1; dp_cum[1] = N-1\n dp[2] = N-1; dp_cum[2] = 2*(N-1)\n for n in range(3,N+1):\n dp[n] = dp[n-1] + dp_cum[n-3]\n dp_cum[n] = (dp_cum[n-1] + dp[n]) % MOD\n \n-answer = sum(dp[1:N])*N + dp[-1] + 1\n answer %= MOD\n print(answer)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u690536347", "problem_id": "p03374", "submission1_id": "s022630174", "submission2_id": "s942521832", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,c=map(int,input().split())\nl=[list(map(int,input().split())) for i in range(n)]\n\nrev=[None]*(n+1)\nnorm=[None]*(n+1)\nrev[0]=(0,0)\nnorm[0]=(0,0)\nans=0\n\n\nfor i in range(1,n+1):\n x,v=l[i-1]\n norm[i]=(x,v+norm[i-1][1])\n\n\nfor i in range(1,n+1)[::-1]:\n x,v=l[i-1]\n if i==n:\n rev[i]=(c-x,v)\n else:\n rev[i]=(c-x,v+rev[i+1][1])\n\nfor i in range(n+1):\n for j in range(n-i):\n cost=min(norm[i][0]+2*rev[-j][0],2*norm[i][0]+rev[-j][0])\n ans=max(ans,rev[-j][1]+norm[i][1]-cost)\n\nprint(ans)", "code2": "n,c=map(int,input().split())\nl=[list(map(int,input().split())) for i in range(n)]\n\nrev=[None]*(n+1)\nnorm=[None]*(n+1)\nrevmax=[None]*(n+1)\n\nrev[0]=(0,0)\nrevmax[0]=(0,0)\nnorm[0]=(0,0)\nans=0\n\n\nfor i in range(1,n+1):\n x,v=l[i-1]\n norm[i]=(x,v+norm[i-1][1])\n\n\nfor i in range(1,n+1)[::-1]:\n x,v=l[i-1]\n if i==n:\n rev[i]=(c-x,v)\n else:\n rev[i]=(c-x,v+rev[i+1][1])\n\nfor i in range(1,n+1):\n revmax[-i]=(max(revmax[-i+1][0],rev[-i][1]-2*rev[-i][0]),max(revmax[-i+1][1],rev[-i][1]-rev[-i][0]))\n\nfor i in range(n+1):\n v1=norm[i][1]-norm[i][0]+revmax[i-n][0]\n v2=norm[i][1]-2*norm[i][0]+revmax[i-n][1]\n ans=max(ans,v1,v2)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1547759810", "date2": "1547761481", "bleu_score": "0.7237475015667575", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 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, 1, 1, 1, 1, 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": 92, "total_score": 104, "input": "3 13\n0 56\n2 85\n25 2\n", "actual_output": "139\n", "expected_output": "165\n\n", "anno_code": ["n,c=map(int,input().split()) # (0): n=3, c=13\nl=[list(map(int,input().split())) for i in range(n)] # (1): l\n\nrev=[None]*(n+1) # (2): rev=[None, None, None, None]\nnorm=[None]*(n+1) # (3): norm=[None, None, None, None]\nrev[0]=(0,0) # (4): rev=[(0, 0), None, None, None]\nnorm[0]=(0,0) # (5): rev=[(0, 0), None, None, None], norm=[(0, 0), None, None, None]\nans=0 # (6): rev=[(0, 0), None, None, None], norm=[(0, 0), None, None, None], ans=0\n\n\nfor i in range(1,n+1): # (7): rev=[(0, 0), None, None, None], norm=[(0, 0), None, None, None], i=1 (10): rev=[(0, 0), None, None, None], norm=[(0, 0), (0, 56), None, None], i=2 ... (16): rev=[(0, 0), None, None, None]\n x,v=l[i-1] # (8): rev=[(0, 0), None, None, None], norm=[(0, 0), None, None, None], x=0, v=56 (11): rev=[(0, 0), None, None, None], norm=[(0, 0), (0, 56), None, None], x=2, v=85 (14): rev=[(0, 0), None, None, None], norm=[(0, 0), (0, 56), (2, 141), None], x=25, v=2\n norm[i]=(x,v+norm[i-1][1]) # (9): rev=[(0, 0), None, None, None], norm=[(0, 0), (0, 56), None, None] (12): rev=[(0, 0), None, None, None], norm=[(0, 0), (0, 56), (2, 141), None] (15): rev=[(0, 0), None, None, None], norm=[(0, 0), (0, 56), (2, 141), (25, 143)]\n\n\nfor i in range(1,n+1)[::-1]: # (17): rev=[(0, 0), None, None, None] (21): rev=[(0, 0), None, None, (-12, 2)], i=2 ... (29): NO CHANGE\n x,v=l[i-1] # (18): rev=[(0, 0), None, None, None] (22): rev=[(0, 0), None, None, (-12, 2)], x=2, v=85 (26): rev=[(0, 0), None, (11, 87), (-12, 2)], x=0, v=56\n if i==n: # (19): rev=[(0, 0), None, None, None] (23): rev=[(0, 0), None, None, (-12, 2)] (27): rev=[(0, 0), None, (11, 87), (-12, 2)]\n rev[i]=(c-x,v) # (20): rev=[(0, 0), None, None, (-12, 2)]\n else:\n rev[i]=(c-x,v+rev[i+1][1]) # (24): rev=[(0, 0), None, (11, 87), (-12, 2)] (28): rev=[(0, 0), (13, 143), (11, 87), (-12, 2)]\n\nfor i in range(n+1): # (30): i=0 (41): i=1 ... (56): NO CHANGE\n for j in range(n-i): # (31): j=0 (34): j=1 ... (55): NO CHANGE\n cost=min(norm[i][0]+2*rev[-j][0],2*norm[i][0]+rev[-j][0]) # (32): cost=0 (35): cost=-24 ... (51): cost=2\n ans=max(ans,rev[-j][1]+norm[i][1]-cost) # (33): NO CHANGE (36): ans=26 ... (52): ans=139\n\nprint(ans)"], "anno_status": [false], "diff_content": " n,c=map(int,input().split())\n l=[list(map(int,input().split())) for i in range(n)]\n \n rev=[None]*(n+1)\n norm=[None]*(n+1)\n+revmax=[None]*(n+1)\n+\n rev[0]=(0,0)\n+revmax[0]=(0,0)\n norm[0]=(0,0)\n ans=0\n \n \n for i in range(1,n+1):\n x,v=l[i-1]\n norm[i]=(x,v+norm[i-1][1])\n \n \n for i in range(1,n+1)[::-1]:\n x,v=l[i-1]\n if i==n:\n rev[i]=(c-x,v)\n else:\n rev[i]=(c-x,v+rev[i+1][1])\n \n+for i in range(1,n+1):\n+ revmax[-i]=(max(revmax[-i+1][0],rev[-i][1]-2*rev[-i][0]),max(revmax[-i+1][1],rev[-i][1]-rev[-i][0]))\n+\n for i in range(n+1):\n- for j in range(n-i):\n- cost=min(norm[i][0]+2*rev[-j][0],2*norm[i][0]+rev[-j][0])\n- ans=max(ans,rev[-j][1]+norm[i][1]-cost)\n+ v1=norm[i][1]-norm[i][0]+revmax[i-n][0]\n+ v2=norm[i][1]-2*norm[i][0]+revmax[i-n][1]\n+ ans=max(ans,v1,v2)\n \n print(ans)\n", "FL_content": " n,c=map(int,input().split())\n l=[list(map(int,input().split())) for i in range(n)]\n \n rev=[None]*(n+1)\n norm=[None]*(n+1)\n rev[0]=(0,0)\n norm[0]=(0,0)\n ans=0\n \n \n for i in range(1,n+1):\n x,v=l[i-1]\n norm[i]=(x,v+norm[i-1][1])\n \n \n for i in range(1,n+1)[::-1]:\n x,v=l[i-1]\n if i==n:\n rev[i]=(c-x,v)\n else:\n rev[i]=(c-x,v+rev[i+1][1])\n \n for i in range(n+1):\n- for j in range(n-i):\n- cost=min(norm[i][0]+2*rev[-j][0],2*norm[i][0]+rev[-j][0])\n- ans=max(ans,rev[-j][1]+norm[i][1]-cost)\n \n print(ans)\n", "added_lines": 9, "removed_lines": 3, "code1_lines": 28 }, { "user_id": "u476199965", "problem_id": "p03374", "submission1_id": "s949459288", "submission2_id": "s080850507", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,c = list(map(int,input().split()))\n\nxv = []\ngo = [0]\ngoback = [0]\nback = [0]\nbackgo = [0]\n\nmid = 0\n\nfor i in range(n):\n xv.append(list(map(int,input().split())))\n if 2*xv[i][0]<= c: mid = i\n\ntemp = 0\nfor i in range(mid+1):\n temp += xv[i][1]\n go.append(temp-xv[i][0])\n goback.append(temp-2*xv[i][0])\ntemp = 0\nfor i in range(mid+1,n)[::-1]:\n temp += xv[i][1]\n back.append(temp-(c-xv[i][0]))\n backgo.append(temp-2*(c-xv[i][0]))\n\nprint(max(max(go)+max(backgo),max(back)+max(goback)))\n", "code2": "n,c = list(map(int,input().split()))\n\nxv = []\ngo = []\ngoback = []\nback = []\nbackgo = []\n\nmax1 = 0\nsumt = 0\n\nfor i in range(n):\n xv.append(list(map(int,input().split())))\n sumt += xv[i][1]\n max1 = max(max1,sumt - xv[i][0])\n go.append(max1)\n goback.append(sumt - 2*xv[i][0])\n\nmax1 = 0\nsumt = 0\n\nfor i in range(n)[::-1]:\n sumt += xv[i][1]\n max1 = max(max1, sumt - (c - xv[i][0]))\n back.append(max1)\n backgo.append(sumt - 2 * (c - xv[i][0]))\n\nres = 0\n\nfor i in range(n-1):\n res = max(res,backgo[i]+go[-2-i],goback[i]+back[-2-i])\n\nres = max(res,go[-1],back[-1],0)\n\nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535785616", "date2": "1535850640", "bleu_score": "0.6510614666318268", "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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 103, "total_score": 104, "input": "3 10\n2 80\n9 120\n16 0\n", "actual_output": "196\n", "expected_output": "203\n\n", "anno_code": ["n,c = list(map(int,input().split())) # (0): n=3, c=10\n\nxv = [] # (1): xv=[]\ngo = [0] # (2): go=[0]\ngoback = [0] # (3): goback=[0]\nback = [0] # (4): back=[0]\nbackgo = [0] # (5): backgo=[0]\n\nmid = 0 # (6): mid=0\n\nfor i in range(n): # (7): i=0 (10): i=1 ... (16): NO CHANGE\n xv.append(list(map(int,input().split()))) # (8): xv=[[2, 80]] (11): xv (14): xv\n if 2*xv[i][0]<= c: mid = i # (9): NO CHANGE (12): NO CHANGE (15): NO CHANGE\n\ntemp = 0 # (17): temp=0\nfor i in range(mid+1): # (18): i=0 (22): NO CHANGE\n temp += xv[i][1] # (19): temp=80\n go.append(temp-xv[i][0]) # (20): go=[0, 78]\n goback.append(temp-2*xv[i][0]) # (21): goback=[0, 76]\ntemp = 0 # (23): temp=0\nfor i in range(mid+1,n)[::-1]: # (24): i=2 (28): i=1 (32): NO CHANGE\n temp += xv[i][1] # (25): NO CHANGE (29): temp=120\n back.append(temp-(c-xv[i][0])) # (26): back=[0, 6] (30): back=[0, 6, 119]\n backgo.append(temp-2*(c-xv[i][0])) # (27): backgo=[0, 12] (31): backgo=[0, 12, 118]\n\nprint(max(max(go)+max(backgo),max(back)+max(goback)))\n"], "anno_status": [false], "diff_content": " n,c = list(map(int,input().split()))\n \n xv = []\n-go = [0]\n-goback = [0]\n-back = [0]\n-backgo = [0]\n+go = []\n+goback = []\n+back = []\n+backgo = []\n \n-mid = 0\n+max1 = 0\n+sumt = 0\n \n for i in range(n):\n xv.append(list(map(int,input().split())))\n- if 2*xv[i][0]<= c: mid = i\n+ sumt += xv[i][1]\n+ max1 = max(max1,sumt - xv[i][0])\n+ go.append(max1)\n+ goback.append(sumt - 2*xv[i][0])\n \n-temp = 0\n-for i in range(mid+1):\n- temp += xv[i][1]\n- go.append(temp-xv[i][0])\n- goback.append(temp-2*xv[i][0])\n-temp = 0\n-for i in range(mid+1,n)[::-1]:\n- temp += xv[i][1]\n- back.append(temp-(c-xv[i][0]))\n- backgo.append(temp-2*(c-xv[i][0]))\n+max1 = 0\n+sumt = 0\n \n-print(max(max(go)+max(backgo),max(back)+max(goback)))\n+for i in range(n)[::-1]:\n+ sumt += xv[i][1]\n+ max1 = max(max1, sumt - (c - xv[i][0]))\n+ back.append(max1)\n+ backgo.append(sumt - 2 * (c - xv[i][0]))\n \n+res = 0\n+\n+for i in range(n-1):\n+ res = max(res,backgo[i]+go[-2-i],goback[i]+back[-2-i])\n+\n+res = max(res,go[-1],back[-1],0)\n+\n+print(res)\n", "FL_content": " n,c = list(map(int,input().split()))\n \n xv = []\n-go = [0]\n-goback = [0]\n-back = [0]\n-backgo = [0]\n \n-mid = 0\n \n for i in range(n):\n xv.append(list(map(int,input().split())))\n- if 2*xv[i][0]<= c: mid = i\n \n-temp = 0\n-for i in range(mid+1):\n- temp += xv[i][1]\n- go.append(temp-xv[i][0])\n- goback.append(temp-2*xv[i][0])\n-temp = 0\n-for i in range(mid+1,n)[::-1]:\n- temp += xv[i][1]\n- back.append(temp-(c-xv[i][0]))\n- backgo.append(temp-2*(c-xv[i][0]))\n \n-print(max(max(go)+max(backgo),max(back)+max(goback)))\n \n", "added_lines": 25, "removed_lines": 17, "code1_lines": 27 }, { "user_id": "u198062737", "problem_id": "p03959", "submission1_id": "s049614357", "submission2_id": "s444593004", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nT = list(map(int, input().split(\" \")))\nA = list(map(int, input().split(\" \")))\nh = [-1 for i in range(N)]\nmod = 10 ** 9 + 7\n\nh[0] = T[0]\nh[N - 1] = A[N - 1]\nfor i in range(N - 1):\n if T[i] < T[i + 1]:\n h[i + 1] = T[i + 1]\n\nfor i in range(N - 1):\n if A[i + 1] < A[i] and (h[i] == -1 or h[i] == A[i]):\n h[i] = A[i]\n elif A[i + 1] < A[i]:\n h[i] = 0\n\nans = 1\nfor i in range(N):\n if h[i] == 0:\n ans *= h[i]\n break\n elif h[i] == -1:\n ans *= min(T[i], A[i])\n ans %= mod\n\nif A[N - 1] != T[0]:\n print(0)\nelse:\n print(ans % mod)", "code2": "N = int(input())\nT = list(map(int, input().split(\" \")))\nA = list(map(int, input().split(\" \")))\nh = [0 for i in range(N)]\nmod = 10 ** 9 + 7\n\nh[0] = T[0]\nfor i in range(N - 1):\n if T[i] < T[i + 1]:\n h[i + 1] = T[i + 1]\n else:\n h[i + 1] = -T[i + 1]\n\nif h[N - 1] == 0:\n h[N - 1] = A[N - 1]\nelse:\n if -h[N - 1] >= A[N - 1]:\n h[N - 1] = A[N - 1]\n elif h[N - 1] != A[N - 1]:\n h[N - 1] = 0\n\nfor i in range(1, N):\n if A[i - 1] > A[i]:\n if -h[i - 1] >= A[i - 1]:\n h[i - 1] = A[i - 1]\n elif h[i - 1] != A[i - 1]:\n h[i - 1] = 0\n else:\n if h[i - 1] < 0:\n h[i - 1] = -min(-h[i - 1], A[i - 1])\n\n\nans = 1\nfor hi in h:\n if hi <= 0:\n ans *= -hi\n ans %= mod\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586356008", "date2": "1586357057", "bleu_score": "0.6551123387351142", "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, 0], "code1_test_score": 102, "total_score": 104, "input": "10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n", "actual_output": "0\n", "expected_output": "884111967\n", "anno_code": ["N = int(input()) # (0): N=10\nT = list(map(int, input().split(\" \"))) # (1): T=[1, 3776, 3776, 8848, 8848, 8848, 8848, 8848, 8848, 8848]\nA = list(map(int, input().split(\" \"))) # (2): A=[8848, 8848, 8848, 8848, 8848, 8848, 8848, 8848, 3776, 5]\nh = [-1 for i in range(N)] # (3): h=[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]\nmod = 10 ** 9 + 7 # (4): mod=1000000007\n\nh[0] = T[0] # (5): h=[1, -1, -1, -1, -1, -1, -1, -1, -1, -1]\nh[N - 1] = A[N - 1] # (6): h=[1, -1, -1, -1, -1, -1, -1, -1, -1, 5]\nfor i in range(N - 1): # (7): i=0 (10): i=1 ... (27): NO CHANGE\n if T[i] < T[i + 1]: # (8): NO CHANGE (11): NO CHANGE ... (26): NO CHANGE\n h[i + 1] = T[i + 1] # (9): h=[1, 3776, -1, -1, -1, -1, -1, -1, -1, 5] (14): h=[1, 3776, -1, 8848, -1, -1, -1, -1, -1, 5]\n\nfor i in range(N - 1): # (28): i=0 (31): i=1 ... (55): NO CHANGE\n if A[i + 1] < A[i] and (h[i] == -1 or h[i] == A[i]): # (29): NO CHANGE (32): NO CHANGE ... (53): NO CHANGE\n h[i] = A[i] # (51): h=[1, 3776, -1, 8848, -1, -1, -1, 8848, -1, 5] (54): h=[1, 3776, -1, 8848, -1, -1, -1, 8848, 3776, 5]\n elif A[i + 1] < A[i]: # (30): NO CHANGE (33): NO CHANGE ... (48): NO CHANGE\n h[i] = 0\n\nans = 1 # (56): ans=1\nfor i in range(N): # (57): i=0 (60): i=1 ... (95): NO CHANGE\n if h[i] == 0: # (58): NO CHANGE (61): NO CHANGE ... (93): NO CHANGE\n ans *= h[i]\n break\n elif h[i] == -1: # (59): NO CHANGE (62): NO CHANGE ... (94): NO CHANGE\n ans *= min(T[i], A[i]) # (66): ans=3776 (74): ans=33410048 ... (84): ans=5415884149872\n ans %= mod # (67): NO CHANGE (75): NO CHANGE ... (85): ans=884111967\n\nif A[N - 1] != T[0]: # (96): NO CHANGE\n print(0)\nelse:\n print(ans % mod)"], "anno_status": [false], "diff_content": " N = int(input())\n T = list(map(int, input().split(\" \")))\n A = list(map(int, input().split(\" \")))\n-h = [-1 for i in range(N)]\n+h = [0 for i in range(N)]\n mod = 10 ** 9 + 7\n \n h[0] = T[0]\n-h[N - 1] = A[N - 1]\n for i in range(N - 1):\n if T[i] < T[i + 1]:\n h[i + 1] = T[i + 1]\n+ else:\n+ h[i + 1] = -T[i + 1]\n+\n+if h[N - 1] == 0:\n+ h[N - 1] = A[N - 1]\n+else:\n+ if -h[N - 1] >= A[N - 1]:\n+ h[N - 1] = A[N - 1]\n+ elif h[N - 1] != A[N - 1]:\n+ h[N - 1] = 0\n+\n+for i in range(1, N):\n+ if A[i - 1] > A[i]:\n+ if -h[i - 1] >= A[i - 1]:\n+ h[i - 1] = A[i - 1]\n+ elif h[i - 1] != A[i - 1]:\n+ h[i - 1] = 0\n+ else:\n+ if h[i - 1] < 0:\n+ h[i - 1] = -min(-h[i - 1], A[i - 1])\n \n-for i in range(N - 1):\n- if A[i + 1] < A[i] and (h[i] == -1 or h[i] == A[i]):\n- h[i] = A[i]\n- elif A[i + 1] < A[i]:\n- h[i] = 0\n \n ans = 1\n-for i in range(N):\n- if h[i] == 0:\n- ans *= h[i]\n- break\n- elif h[i] == -1:\n- ans *= min(T[i], A[i])\n+for hi in h:\n+ if hi <= 0:\n+ ans *= -hi\n ans %= mod\n \n-if A[N - 1] != T[0]:\n- print(0)\n-else:\n- print(ans % mod)\n+print(ans)\n", "FL_content": " N = int(input())\n T = list(map(int, input().split(\" \")))\n A = list(map(int, input().split(\" \")))\n-h = [-1 for i in range(N)]\n mod = 10 ** 9 + 7\n \n h[0] = T[0]\n-h[N - 1] = A[N - 1]\n for i in range(N - 1):\n if T[i] < T[i + 1]:\n h[i + 1] = T[i + 1]\n \n-for i in range(N - 1):\n- if A[i + 1] < A[i] and (h[i] == -1 or h[i] == A[i]):\n- h[i] = A[i]\n- elif A[i + 1] < A[i]:\n- h[i] = 0\n \n ans = 1\n-for i in range(N):\n- if h[i] == 0:\n- ans *= h[i]\n- break\n- elif h[i] == -1:\n- ans *= min(T[i], A[i])\n ans %= mod\n \n-if A[N - 1] != T[0]:\n- print(0)\n-else:\n- print(ans % mod)\n", "added_lines": 25, "removed_lines": 17, "code1_lines": 31 }, { "user_id": "u814986259", "problem_id": "p03959", "submission1_id": "s457703246", "submission2_id": "s148664044", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nM = [[-1, 10**9] for i in range(N)]\n\nfor i in range(N):\n if i == 0:\n M[i][0] = T[i]\n else:\n if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]\n\nfor i in range(N-1, -1, -1):\n if i == N-1:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n M[i][0] = A[i]\n\n else:\n if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n M[i][0] = A[i]\n else:\n M[i][1] = min(M[i][1], A[i])\nprint(M)\nans = 1\nmod = (10 ** 9) + 7\nfor x, y in M:\n if x == -1:\n ans *= y\n ans %= mod\n\nprint(ans)\n", "code2": "N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nM = [[-1, 10**9] for i in range(N)]\n\nfor i in range(N):\n if i == 0:\n M[i][0] = T[i]\n else:\n if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]\n\nfor i in range(N-1, -1, -1):\n if i == N-1:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if M[i][1] >= A[i]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n\n else:\n if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if A[i] <= M[i][1]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n else:\n M[i][1] = min(M[i][1], A[i])\nans = 1\nmod = (10 ** 9) + 7\nfor x, y in M:\n if x == -1:\n ans *= y\n ans %= mod\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580278167", "date2": "1580278431", "bleu_score": "0.7893348258175881", "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, 0, 0, 0], "code1_test_score": 100, "total_score": 104, "input": "10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n", "actual_output": "[[1, 8848], [3776, 8848], [-1, 3776], [8848, 8848], [-1, 8848], [-1, 8848], [-1, 8848], [8848, 8848], [3776, 8848], [5, 8848]]\n884111967\n", "expected_output": "884111967\n", "anno_code": ["N = int(input()) # (0): N=10\nT = list(map(int, input().split())) # (1): T=[1, 3776, 3776, 8848, 8848, 8848, 8848, 8848, 8848, 8848]\nA = list(map(int, input().split())) # (2): A=[8848, 8848, 8848, 8848, 8848, 8848, 8848, 8848, 3776, 5]\n\nM = [[-1, 10**9] for i in range(N)] # (3): M\n\nfor i in range(N): # (4): i=0 (7): i=1 ... (43): NO CHANGE\n if i == 0: # (5): NO CHANGE (8): NO CHANGE ... (40): NO CHANGE\n M[i][0] = T[i] # (6): M\n else:\n if T[i] != T[i-1]: # (9): NO CHANGE (13): NO CHANGE ... (41): NO CHANGE\n M[i][0] = T[i] # (10): M (18): M\n else:\n M[i][1] = T[i] # (14): M (22): M ... (42): M\n\nfor i in range(N-1, -1, -1): # (44): NO CHANGE (48): i=8 ... (86): NO CHANGE\n if i == N-1: # (45): NO CHANGE (49): NO CHANGE ... (83): NO CHANGE\n if M[i][0] != -1 and M[i][0] != A[i]: # (46): NO CHANGE\n print(0)\n exit(0)\n else:\n M[i][0] = A[i] # (47): M\n\n else:\n if A[i] != A[i+1]: # (50): NO CHANGE (55): NO CHANGE ... (84): NO CHANGE\n if M[i][0] != -1 and M[i][0] != A[i]: # (51): NO CHANGE (56): NO CHANGE\n print(0)\n exit(0)\n else:\n M[i][0] = A[i] # (52): M (57): M\n else:\n M[i][1] = min(M[i][1], A[i]) # (61): NO CHANGE (65): NO CHANGE ... (85): M\nprint(M) # (87): NO CHANGE\nans = 1 # (88): ans=1\nmod = (10 ** 9) + 7 # (89): mod=1000000007\nfor x, y in M: # (90): x=1, y=8848 (92): x=3776 ... (118): NO CHANGE\n if x == -1: # (91): NO CHANGE (93): NO CHANGE ... (117): NO CHANGE\n ans *= y # (96): ans=3776 (102): ans=33410048 ... (110): ans=5415884149872\n ans %= mod # (97): NO CHANGE (103): NO CHANGE ... (111): ans=884111967\n\nprint(ans)\n"], "anno_status": [false], "diff_content": " N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n M = [[-1, 10**9] for i in range(N)]\n \n for i in range(N):\n if i == 0:\n M[i][0] = T[i]\n else:\n if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]\n \n for i in range(N-1, -1, -1):\n if i == N-1:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n- M[i][0] = A[i]\n+ if M[i][1] >= A[i]:\n+ M[i][0] = A[i]\n+ else:\n+ print(0)\n+ exit(0)\n \n else:\n if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n- M[i][0] = A[i]\n+ if A[i] <= M[i][1]:\n+ M[i][0] = A[i]\n+ else:\n+ print(0)\n+ exit(0)\n else:\n M[i][1] = min(M[i][1], A[i])\n-print(M)\n ans = 1\n mod = (10 ** 9) + 7\n for x, y in M:\n if x == -1:\n ans *= y\n ans %= mod\n \n print(ans)\n \n", "FL_content": " N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n M = [[-1, 10**9] for i in range(N)]\n \n for i in range(N):\n if i == 0:\n M[i][0] = T[i]\n else:\n if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]\n \n for i in range(N-1, -1, -1):\n if i == N-1:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n- M[i][0] = A[i]\n \n else:\n if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n- M[i][0] = A[i]\n else:\n M[i][1] = min(M[i][1], A[i])\n-print(M)\n ans = 1\n mod = (10 ** 9) + 7\n for x, y in M:\n if x == -1:\n ans *= y\n ans %= mod\n \n print(ans)\n \n", "added_lines": 10, "removed_lines": 3, "code1_lines": 42 }, { "user_id": "u197457087", "problem_id": "p03959", "submission1_id": "s090909025", "submission2_id": "s124795289", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\nans = 1; MOD = pow(10,9)+7\nif N == 1:\n if A[0] == T[0]:\n print(1)\n else:\n print(0)\n exit()\nfor i in range(N):\n if i == 0: \n if A[i] == A[i+1]: \n fac = T[0]\n else: \n if A[i] > T[0]: \n fac = 0\n else:\n fac = 1\n elif i < N-1: \n if T[i] == T[i-1]: \n if A[i] == A[i+1]: \n fac = min(T[i],A[i])\n else: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if A[i] == A[i+1]: \n if T[i] > A[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n else: \n if T[i] == T[i-1]: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n ans = (ans*fac)%MOD\nprint(ans%MOD)\n \n \n ", "code2": "N = int(input())\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\nans = 1; MOD = pow(10,9)+7\nif N == 1:\n if A[0] == T[0]:\n print(1)\n else:\n print(0)\n exit()\nfor i in range(N):\n if i == 0: \n if A[i] == A[i+1]: \n fac = 1\n else: \n if A[i] > T[0]: \n fac = 0\n else:\n fac = 1\n elif i < N-1: \n if T[i] == T[i-1]: \n if A[i] == A[i+1]: \n fac = min(T[i],A[i])\n else: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if A[i] == A[i+1]: \n if T[i] > A[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n else: \n if T[i] == T[i-1]: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n ans = (ans*fac)%MOD\nprint(ans%MOD)\n \n \n \n \n \n \n \n \n \n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598578761", "date2": "1598579052", "bleu_score": "0.942869300673392", "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": "5\n2 3 3 3 3\n3 3 2 2 2\n", "actual_output": "8\n", "expected_output": "4\n\n", "anno_code": ["N = int(input()) # (0): N=5\nT = list(map(int,input().split())) # (1): T=[2, 3, 3, 3, 3]\nA = list(map(int,input().split())) # (2): A=[3, 3, 2, 2, 2]\nans = 1; MOD = pow(10,9)+7 # (3): ans=1, MOD=1000000007\nif N == 1: # (4): NO CHANGE\n if A[0] == T[0]:\n print(1)\n else:\n print(0)\n exit()\nfor i in range(N): # (5): i=0 (10): i=1 ... (39): NO CHANGE\n if i == 0: # (6): NO CHANGE (11): NO CHANGE ... (33): NO CHANGE\n if A[i] == A[i+1]: # (7): NO CHANGE\n fac = T[0] # (8): fac=2\n else: \n if A[i] > T[0]: \n fac = 0\n else:\n fac = 1\n elif i < N-1: # (12): NO CHANGE (20): NO CHANGE ... (34): NO CHANGE\n if T[i] == T[i-1]: # (13): NO CHANGE (21): NO CHANGE (28): NO CHANGE\n if A[i] == A[i+1]: # (22): NO CHANGE (29): NO CHANGE\n fac = min(T[i],A[i]) # (23): fac=2 (30): NO CHANGE\n else: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if A[i] == A[i+1]: # (14): NO CHANGE\n if T[i] > A[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]: # (15): NO CHANGE\n fac = 1 # (16): fac=1\n else:\n fac = 0\n else: \n if T[i] == T[i-1]: # (35): NO CHANGE\n if A[i] > T[i]: # (36): NO CHANGE\n fac = 0\n else:\n fac = 1 # (37): fac=1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n ans = (ans*fac)%MOD # (9): ans=2 (17): NO CHANGE ... (38): NO CHANGE\nprint(ans%MOD)\n \n \n "], "anno_status": [true], "diff_content": " N = int(input())\n T = list(map(int,input().split()))\n A = list(map(int,input().split()))\n ans = 1; MOD = pow(10,9)+7\n if N == 1:\n if A[0] == T[0]:\n print(1)\n else:\n print(0)\n exit()\n for i in range(N):\n if i == 0: \n if A[i] == A[i+1]: \n- fac = T[0]\n+ fac = 1\n else: \n if A[i] > T[0]: \n fac = 0\n else:\n fac = 1\n elif i < N-1: \n if T[i] == T[i-1]: \n if A[i] == A[i+1]: \n fac = min(T[i],A[i])\n else: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if A[i] == A[i+1]: \n if T[i] > A[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n else: \n if T[i] == T[i-1]: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n ans = (ans*fac)%MOD\n print(ans%MOD)\n \n \n+ \n+ \n+ \n+ \n+ \n+ \n+ \n \n", "FL_content": " N = int(input())\n T = list(map(int,input().split()))\n A = list(map(int,input().split()))\n ans = 1; MOD = pow(10,9)+7\n if N == 1:\n if A[0] == T[0]:\n print(1)\n else:\n print(0)\n exit()\n for i in range(N):\n if i == 0: \n if A[i] == A[i+1]: \n- fac = T[0]\n else: \n if A[i] > T[0]: \n fac = 0\n else:\n fac = 1\n elif i < N-1: \n if T[i] == T[i-1]: \n if A[i] == A[i+1]: \n fac = min(T[i],A[i])\n else: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if A[i] == A[i+1]: \n if T[i] > A[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n else: \n if T[i] == T[i-1]: \n if A[i] > T[i]: \n fac = 0\n else:\n fac = 1\n else: \n if T[i] == A[i]:\n fac = 1\n else:\n fac = 0\n ans = (ans*fac)%MOD\n print(ans%MOD)\n \n \n \n", "added_lines": 8, "removed_lines": 1, "code1_lines": 55 }, { "user_id": "u098968285", "problem_id": "p03959", "submission1_id": "s379070612", "submission2_id": "s127997520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\nn = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nTsa = [0]*n\nAsa = [0]*n\n\nif n == 1:\n\tif T[0] != A[0]:\n\t\tprint(0)\n\telse:\n\t\tprint(1)\nelif T[0] != A[-1]:\n\tprint(0)\nelse:\n\t\n\tdai = T[0]\n\tshou = T[0]\n\tTsa[0] = (shou, dai)\n\n\tfor i in range(1, n):\n\t\tif T[i] == dai:\n\t\t\tTsa[i] = (shou, dai)\n\t\telse:\n\t\t\tshou = dai\n\t\t\tdai = T[i]\n\t\t\tTsa[i] = (dai, dai)\n\n\t\n\tdai = A[-1]\n\tshou = A[-1]\n\tAsa[-1] = (shou, dai)\n\n\tfor i in reversed(range(-n, -1)):\n\t\tif A[i] == dai:\n\t\t\tAsa[i] = (shou, dai)\n\t\telse:\n\t\t\tshou = dai\n\t\t\tdai = A[i]\n\t\t\tAsa[i] = (dai, dai)\n\n\tans = 1\n\tfor i in range(n):\n\t\td = max(Tsa[i][0], Asa[i][0])\n\t\tu = min(Tsa[i][1], Asa[i][1])\n\n\t\tif d > u:\n\t\t\tans = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tans *= u - d + 1\n\tprint(ans)\n", "code2": "\n\n\n\n\n\n\nMOD = int(1e9) + 7\nn = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nTsa = [0]*n\nAsa = [0]*n\n\nif n == 1:\n\tif T[0] != A[0]:\n\t\tprint(0)\n\telse:\n\t\tprint(1)\nelif T[-1] != A[0]:\n\tprint(0)\nelse:\n\t\n\tdai = T[0]\n\tshou = T[0]\n\tTsa[0] = (shou, dai)\n\n\tfor i in range(1, n):\n\t\tif T[i] == dai:\n\t\t\tTsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = T[i]\n\t\t\tTsa[i] = (dai, dai)\n\n\t\n\tdai = A[-1]\n\tshou = A[-1]\n\tAsa[-1] = (shou, dai)\n\n\tfor i in reversed(range(-n, -1)):\n\t\tif A[i] == dai:\n\t\t\tAsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = A[i]\n\t\t\tAsa[i] = (dai, dai)\n\n\t\n\tans = 1\n\tfor i in range(n):\n\t\td = max(Tsa[i][0], Asa[i][0])\n\t\tu = min(Tsa[i][1], Asa[i][1])\n\n\t\tif d > u:\n\t\t\tans = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tans *= u - d + 1\n\t\t\tans %= MOD\n\tprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1477275209", "date2": "1477275565", "bleu_score": "0.9495965569612717", "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, 0, 1, 0], "code1_test_score": 101, "total_score": 104, "input": "5\n1 3 3 3 3\n3 3 2 2 2\n", "actual_output": "0\n", "expected_output": "4\n", "anno_code": ["\n\n\n\n\n\n\n\nn = int(input()) # (0): n=5\nT = list(map(int, input().split())) # (1): T=[1, 3, 3, 3, 3]\nA = list(map(int, input().split())) # (2): A=[3, 3, 2, 2, 2]\n\nTsa = [0]*n # (3): Tsa=[0, 0, 0, 0, 0]\nAsa = [0]*n # (4): Asa=[0, 0, 0, 0, 0]\n\nif n == 1: # (5): NO CHANGE\n\tif T[0] != A[0]:\n\t\tprint(0)\n\telse:\n\t\tprint(1)\nelif T[0] != A[-1]: # (6): NO CHANGE\n\tprint(0)\nelse:\n\t\n\tdai = T[0]\n\tshou = T[0]\n\tTsa[0] = (shou, dai)\n\n\tfor i in range(1, n):\n\t\tif T[i] == dai:\n\t\t\tTsa[i] = (shou, dai)\n\t\telse:\n\t\t\tshou = dai\n\t\t\tdai = T[i]\n\t\t\tTsa[i] = (dai, dai)\n\n\t\n\tdai = A[-1]\n\tshou = A[-1]\n\tAsa[-1] = (shou, dai)\n\n\tfor i in reversed(range(-n, -1)):\n\t\tif A[i] == dai:\n\t\t\tAsa[i] = (shou, dai)\n\t\telse:\n\t\t\tshou = dai\n\t\t\tdai = A[i]\n\t\t\tAsa[i] = (dai, dai)\n\n\tans = 1\n\tfor i in range(n):\n\t\td = max(Tsa[i][0], Asa[i][0])\n\t\tu = min(Tsa[i][1], Asa[i][1])\n\n\t\tif d > u:\n\t\t\tans = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tans *= u - d + 1\n\tprint(ans)\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n-\n+MOD = int(1e9) + 7\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n Tsa = [0]*n\n Asa = [0]*n\n \n if n == 1:\n \tif T[0] != A[0]:\n \t\tprint(0)\n \telse:\n \t\tprint(1)\n-elif T[0] != A[-1]:\n+elif T[-1] != A[0]:\n \tprint(0)\n else:\n \t\n \tdai = T[0]\n \tshou = T[0]\n \tTsa[0] = (shou, dai)\n \n \tfor i in range(1, n):\n \t\tif T[i] == dai:\n-\t\t\tTsa[i] = (shou, dai)\n+\t\t\tTsa[i] = (1, dai)\n \t\telse:\n-\t\t\tshou = dai\n \t\t\tdai = T[i]\n \t\t\tTsa[i] = (dai, dai)\n \n \t\n \tdai = A[-1]\n \tshou = A[-1]\n \tAsa[-1] = (shou, dai)\n \n \tfor i in reversed(range(-n, -1)):\n \t\tif A[i] == dai:\n-\t\t\tAsa[i] = (shou, dai)\n+\t\t\tAsa[i] = (1, dai)\n \t\telse:\n-\t\t\tshou = dai\n \t\t\tdai = A[i]\n \t\t\tAsa[i] = (dai, dai)\n \n+\t\n \tans = 1\n \tfor i in range(n):\n \t\td = max(Tsa[i][0], Asa[i][0])\n \t\tu = min(Tsa[i][1], Asa[i][1])\n \n \t\tif d > u:\n \t\t\tans = 0\n \t\t\tbreak\n \t\telse:\n \t\t\tans *= u - d + 1\n+\t\t\tans %= MOD\n \tprint(ans)\n \n", "FL_content": " \n \n \n \n \n \n \n-\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n Tsa = [0]*n\n Asa = [0]*n\n \n if n == 1:\n \tif T[0] != A[0]:\n \t\tprint(0)\n \telse:\n \t\tprint(1)\n-elif T[0] != A[-1]:\n \tprint(0)\n else:\n \t\n \tdai = T[0]\n \tshou = T[0]\n \tTsa[0] = (shou, dai)\n \n \tfor i in range(1, n):\n \t\tif T[i] == dai:\n-\t\t\tTsa[i] = (shou, dai)\n \t\telse:\n-\t\t\tshou = dai\n \t\t\tdai = T[i]\n \t\t\tTsa[i] = (dai, dai)\n \n \t\n \tdai = A[-1]\n \tshou = A[-1]\n \tAsa[-1] = (shou, dai)\n \n \tfor i in reversed(range(-n, -1)):\n \t\tif A[i] == dai:\n-\t\t\tAsa[i] = (shou, dai)\n \t\telse:\n-\t\t\tshou = dai\n \t\t\tdai = A[i]\n \t\t\tAsa[i] = (dai, dai)\n \n \tans = 1\n \tfor i in range(n):\n \t\td = max(Tsa[i][0], Asa[i][0])\n \t\tu = min(Tsa[i][1], Asa[i][1])\n \n \t\tif d > u:\n \t\t\tans = 0\n \t\t\tbreak\n \t\telse:\n \t\t\tans *= u - d + 1\n \tprint(ans)\n \n", "added_lines": 6, "removed_lines": 6, "code1_lines": 61 }, { "user_id": "u941753895", "problem_id": "p03959", "submission1_id": "s259616694", "submission2_id": "s095817990", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\n\ndef LI(): return list(map(int,input().split()))\ndef I(): return int(input())\ndef LS(): return input().split()\ndef S(): return input()\n\ndef main():\n n=I()\n\n a=LI()\n b=LI()\n\n if n==1 and a[0]!=b[0]:\n return 0\n\n if n==1 and a[0]==17 and b[0]==17:\n exit()\n\n l1=[]\n l2=[]\n\n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amxb[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n b.reverse()\n l1.reverse()\n\n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmxa[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n\n return ans\n\n\nprint(main())\n", "code2": "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\n\ndef LI(): return list(map(int,input().split()))\ndef I(): return int(input())\ndef LS(): return input().split()\ndef S(): return input()\n\ndef main():\n n=I()\n\n a=LI()\n b=LI()\n\n if n==1 and a[0]!=b[0]:\n return 0\n\n l1=[]\n l2=[]\n\n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amxb[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n b.reverse()\n l1.reverse()\n\n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmxa[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n\n return ans\n\nprint(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559396273", "date2": "1564635799", "bleu_score": "0.9502140726840796", "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, 1, 0, 1], "code1_test_score": 103, "total_score": 104, "input": "1\n17\n17\n", "actual_output": "", "expected_output": "1\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n \n sys.setrecursionlimit(10**7)\n inf=10**20\n mod=10**9+7\n \n def LI(): return list(map(int,input().split()))\n def I(): return int(input())\n def LS(): return input().split()\n def S(): return input()\n \n def main():\n n=I()\n \n a=LI()\n b=LI()\n \n if n==1 and a[0]!=b[0]:\n return 0\n \n- if n==1 and a[0]==17 and b[0]==17:\n- exit()\n-\n l1=[]\n l2=[]\n \n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amxb[i]:\n print(0)\n exit()\n \n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n \n b.reverse()\n l1.reverse()\n \n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmxa[n-i-1]:\n print(0)\n exit()\n \n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n \n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n \n return ans\n \n-\n print(main())\n \n", "FL_content": " import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n \n sys.setrecursionlimit(10**7)\n inf=10**20\n mod=10**9+7\n \n def LI(): return list(map(int,input().split()))\n def I(): return int(input())\n def LS(): return input().split()\n def S(): return input()\n \n def main():\n n=I()\n \n a=LI()\n b=LI()\n \n if n==1 and a[0]!=b[0]:\n return 0\n \n- if n==1 and a[0]==17 and b[0]==17:\n- exit()\n-\n l1=[]\n l2=[]\n \n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amxb[i]:\n print(0)\n exit()\n \n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n \n b.reverse()\n l1.reverse()\n \n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmxa[n-i-1]:\n print(0)\n exit()\n \n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n \n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n \n return ans\n \n-\n print(main())\n \n", "added_lines": 0, "removed_lines": 4, "code1_lines": 75 }, { "user_id": "u620480037", "problem_id": "p03959", "submission1_id": "s847033871", "submission2_id": "s851594199", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nT=list(map(int,input().split()))\nA=list(map(int,input().split()))\nif T[len(A)-1]!=A[0]:\n print(-1)\nelse:\n \n t=[1]\n for i in range(1,N):\n if T[i-1]!=T[i]:\n t.append(1)\n else:\n t.append(T[i])\n if T[i-1]>T[i]:\n print(-1)\n exit()\n A=A[::-1]\n a=[1]\n for i in range(1,N):\n if A[i-1]!=A[i]:\n a.append(1)\n else:\n a.append(A[i])\n if A[i-1]>A[i]:\n print(-1)\n exit()\n A=A[::-1]\n a=a[::-1]\n \n ans=1\n for i in range(N):\n ans*=min(t[i],a[i])\n ans%=(10**9+7)\n print(ans)", "code2": "N=int(input())\nT=list(map(int,input().split()))\nt=[1]\nfor i in range(1,N):\n if T[i]!=T[i-1]:\n t.append(1)\n else:\n t.append(T[i])\n if T[i]T[i]:\n print(-1)\n exit()\n A=A[::-1]\n a=[1]\n for i in range(1,N):\n if A[i-1]!=A[i]:\n a.append(1)\n else:\n a.append(A[i])\n if A[i-1]>A[i]:\n print(-1)\n exit()\n A=A[::-1]\n a=a[::-1]\n \n ans=1\n for i in range(N):\n ans*=min(t[i],a[i])\n ans%=(10**9+7)\n print(ans)"], "anno_status": [true], "diff_content": " N=int(input())\n T=list(map(int,input().split()))\n+t=[1]\n+for i in range(1,N):\n+ if T[i]!=T[i-1]:\n+ t.append(1)\n+ else:\n+ t.append(T[i])\n+ if T[i]T[i]:\n- print(-1)\n+ print(0)\n exit()\n- A=A[::-1]\n- a=[1]\n- for i in range(1,N):\n- if A[i-1]!=A[i]:\n- a.append(1)\n+\n+for i in range(N):\n+ if A[N-1-i]==M:\n+ if T[N-1-i]==M:\n+ break\n else:\n- a.append(A[i])\n- if A[i-1]>A[i]:\n- print(-1)\n+ print(0)\n exit()\n- A=A[::-1]\n- a=a[::-1]\n- \n- ans=1\n- for i in range(N):\n- ans*=min(t[i],a[i])\n- ans%=(10**9+7)\n- print(ans)\n+ans=1\n+mod=(10**9+7)\n+for i in range(N):\n+ ans*=min(t[i],a[i])\n+ ans%=mod\n+print(ans)\n", "FL_content": " N=int(input())\n T=list(map(int,input().split()))\n A=list(map(int,input().split()))\n-if T[len(A)-1]!=A[0]:\n- print(-1)\n-else:\n- \n- t=[1]\n- for i in range(1,N):\n- if T[i-1]!=T[i]:\n- t.append(1)\n else:\n- t.append(T[i])\n- if T[i-1]>T[i]:\n- print(-1)\n exit()\n- A=A[::-1]\n- a=[1]\n- for i in range(1,N):\n- if A[i-1]!=A[i]:\n- a.append(1)\n else:\n- a.append(A[i])\n- if A[i-1]>A[i]:\n- print(-1)\n exit()\n- A=A[::-1]\n- a=a[::-1]\n- \n- ans=1\n- for i in range(N):\n- ans*=min(t[i],a[i])\n- ans%=(10**9+7)\n- print(ans)\n", "added_lines": 42, "removed_lines": 27, "code1_lines": 34 }, { "user_id": "u422104747", "problem_id": "p03959", "submission1_id": "s335850370", "submission2_id": "s779040134", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nl= list(map(int, input().split()))\nr= list(map(int, input().split()))\nl=[0]+l\nr.append(0)\n\nres=1\nfor i in range(n):\n\tif( (l[i]r[i+1]) ):\n\t\tif( ( (l[i]r[i+1]) ) and (l[i+1]!=r[i]) ):\n\t\t\tres*=0\n\telse:\n\t\tres*=min(l[i],r[i])\n\t\tres%=1000000007\nprint(res)\n", "code2": "n=int(input())\nl= list(map(int, input().split()))\nr= list(map(int, input().split()))\nl=[0]+l\nr.append(0)\n \nres=1\nif(l[-1]!=r[0]):\n\tres=0\nfor i in range(n):\n\tif( (l[i]r[i+1]) ):\n\t\tif( ( (l[i]r[i+1]) ) and (l[i+1]!=r[i]) ):\n\t\t\tres=0\n\t\tif( ( (l[i]r[i]) ):\n\t\t\tres=0\n\t\tif( ( (l[i]==l[i+1]) and (r[i]>r[i+1]) ) and (l[i+1]r[i+1]) ): # (7): NO CHANGE (10): NO CHANGE ... (19): NO CHANGE\n\t\tif( ( (l[i]r[i+1]) ) and (l[i+1]!=r[i]) ): # (8): NO CHANGE (11): NO CHANGE ... (20): NO CHANGE\n\t\t\tres*=0\n\telse:\n\t\tres*=min(l[i],r[i])\n\t\tres%=1000000007\nprint(res)\n"], "anno_status": [true], "diff_content": " n=int(input())\n l= list(map(int, input().split()))\n r= list(map(int, input().split()))\n l=[0]+l\n r.append(0)\n-\n+ \n res=1\n+if(l[-1]!=r[0]):\n+\tres=0\n for i in range(n):\n \tif( (l[i]r[i+1]) ):\n \t\tif( ( (l[i]r[i+1]) ) and (l[i+1]!=r[i]) ):\n-\t\t\tres*=0\n+\t\t\tres=0\n+\t\tif( ( (l[i]r[i]) ):\n+\t\t\tres=0\n+\t\tif( ( (l[i]==l[i+1]) and (r[i]>r[i+1]) ) and (l[i+1]r[i+1]) ):\n \t\tif( ( (l[i]r[i+1]) ) and (l[i+1]!=r[i]) ):\n-\t\t\tres*=0\n \telse:\n \t\tres*=min(l[i],r[i])\n \t\tres%=1000000007\n print(res)\n-\n", "added_lines": 8, "removed_lines": 3, "code1_lines": 16 }, { "user_id": "u350248178", "problem_id": "p03959", "submission1_id": "s748200265", "submission2_id": "s673717173", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nt=[int(j) for j in input().split()]\na=[int(j) for j in input().split()]\ntmp=0\nl=[]\nfor i in t:\n if tmp=a[i]:\n tmp=a[i]\n else:\n if l[i]>0:\n print(0)\n exit()\n else:\n if l[i]>0:\n ans=(ans*min(a[i],l[i]))%mod\nprint(ans)", "code2": "n=int(input())\nt=[int(j) for j in input().split()]\na=[int(j) for j in input().split()]\ntmp=0\nl=[]\nfor i in t:\n if tmp0 or -l[i]!=a[i]:\n print(0)\n exit()\n else:\n if l[i]>0:\n ans=(ans*min(a[i],l[i]))%mod\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587520356", "date2": "1587520783", "bleu_score": "0.9539998372964023", "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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 52, "total_score": 104, "input": "5\n7 -1 1 -2 -2\n20 3 -8 0 -1\n", "actual_output": "999999999\n", "expected_output": "0\n\n", "anno_code": ["n=int(input()) # (0): n=5\nt=[int(j) for j in input().split()] # (1): t=[7, -1, 1, -2, -2]\na=[int(j) for j in input().split()] # (2): a=[20, 3, -8, 0, -1]\ntmp=0 # (3): tmp=0\nl=[] # (4): l=[]\nfor i in t: # (5): i=7 (9): i=-1 ... (21): NO CHANGE\n if tmp=a[i]: # (37): NO CHANGE (41): NO CHANGE\n tmp=a[i]\n else:\n if l[i]>0: # (38): NO CHANGE (42): NO CHANGE\n print(0)\n exit()\n else:\n if l[i]>0: # (27): NO CHANGE (30): NO CHANGE (33): NO CHANGE\n ans=(ans*min(a[i],l[i]))%mod # (34): ans=999999999\nprint(ans)"], "anno_status": [true], "diff_content": " n=int(input())\n t=[int(j) for j in input().split()]\n a=[int(j) for j in input().split()]\n tmp=0\n l=[]\n for i in t:\n if tmp=a[i]:\n- tmp=a[i]\n- else:\n- if l[i]>0:\n+ tmp=a[i]\n+ if l[i]0 or -l[i]!=a[i]:\n print(0)\n exit()\n else:\n if l[i]>0:\n ans=(ans*min(a[i],l[i]))%mod\n print(ans)\n", "FL_content": " n=int(input())\n t=[int(j) for j in input().split()]\n a=[int(j) for j in input().split()]\n tmp=0\n l=[]\n for i in t:\n if tmp=a[i]:\n- tmp=a[i]\n- else:\n- if l[i]>0:\n print(0)\n exit()\n else:\n if l[i]>0:\n ans=(ans*min(a[i],l[i]))%mod\n print(ans)\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 26 }, { "user_id": "u436484848", "problem_id": "p03959", "submission1_id": "s460653834", "submission2_id": "s807219254", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def read():\n\treturn [int(i) for i in input().split(\" \")]\nN = int(input())\nT = read()\nA = read()\nt = [(i != j, i) for i, j in zip(T, [None] + T)]\na = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]\nP = 1\nfor p, q in zip(t, a):\n\tif(p[0]):\n\t\tif(q[0]):\n\t\t\tif(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\telif(q[1] < p[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\telif(q[0]):\n\t\tif(p[1] < q[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\telse:\n\t\tP *= min(p[1], q[1]) % (10 ** 9 + 7)\nprint(P)\n", "code2": "def read():\n\treturn [int(i) for i in input().split(\" \")]\nN = int(input())\nT = read()\nA = read()\nt = [(i != j, i) for i, j in zip(T, [None] + T)]\na = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]\nP = 1\nfor p, q in zip(t, a):\n\tif(p[0]):\n\t\tif(q[0]):\n\t\t\tif(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\telse:\n\t\t\tif(q[1] < p[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\telif(q[0]):\n\t\tif(p[1] < q[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\telse:\n\t\tP = P * min(p[1], q[1]) % (10 ** 9 + 7)\nprint(P) \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1477283768", "date2": "1477284278", "bleu_score": "0.961951641498247", "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, 1, 1, 0], "code1_test_score": 103, "total_score": 104, "input": "10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n", "actual_output": "2615575902420992\n", "expected_output": "884111967\n", "anno_code": ["def read(): # (0): read=\n\treturn [int(i) for i in input().split(\" \")]\nN = int(input()) # (1): N=10\nT = read() # (2): T=[1, 3776, 3776, 8848, 8848, 8848, 8848, 8848, 8848, 8848]\nA = read() # (3): A=[8848, 8848, 8848, 8848, 8848, 8848, 8848, 8848, 3776, 5]\nt = [(i != j, i) for i, j in zip(T, [None] + T)] # (4): t=[(True, 1), (True, 3776), (False, 3776), (True, 8848), (False, 8848), (False, 8848), (False, 8848), (False, 8848), (False, 8848), (False, 8848)]\na = [(i != j, i) for i, j in zip(A, (A + [None])[1:])] # (5): a=[(False, 8848), (False, 8848), (False, 8848), (False, 8848), (False, 8848), (False, 8848), (False, 8848), (True, 8848), (True, 3776), (True, 5)]\nP = 1 # (6): P=1\nfor p, q in zip(t, a): # (7): p=(True, 1), q=(False, 8848) (11): p=(True, 3776) ... (47): NO CHANGE\n\tif(p[0]): # (8): NO CHANGE (12): NO CHANGE ... (44): NO CHANGE\n\t\tif(q[0]): # (9): NO CHANGE (13): NO CHANGE (21): NO CHANGE\n\t\t\tif(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\telif(q[1] < p[1]): # (10): NO CHANGE (14): NO CHANGE (22): NO CHANGE\n\t\t\tprint(0)\n\t\t\texit()\n\telif(q[0]): # (17): NO CHANGE (25): NO CHANGE ... (45): NO CHANGE\n\t\tif(p[1] < q[1]): # (38): NO CHANGE (42): NO CHANGE (46): NO CHANGE\n\t\t\tprint(0)\n\t\t\texit()\n\telse:\n\t\tP *= min(p[1], q[1]) % (10 ** 9 + 7) # (18): P=3776 (26): P=33410048 ... (34): P=2615575902420992\nprint(P)\n"], "anno_status": [true], "diff_content": " def read():\n \treturn [int(i) for i in input().split(\" \")]\n N = int(input())\n T = read()\n A = read()\n t = [(i != j, i) for i, j in zip(T, [None] + T)]\n a = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]\n P = 1\n for p, q in zip(t, a):\n \tif(p[0]):\n \t\tif(q[0]):\n \t\t\tif(p[1] != q[1]):\n \t\t\t\tprint(0)\n \t\t\t\texit()\n-\t\telif(q[1] < p[1]):\n-\t\t\tprint(0)\n-\t\t\texit()\n+\t\telse:\n+\t\t\tif(q[1] < p[1]):\n+\t\t\t\tprint(0)\n+\t\t\t\texit()\n \telif(q[0]):\n \t\tif(p[1] < q[1]):\n \t\t\tprint(0)\n \t\t\texit()\n \telse:\n-\t\tP *= min(p[1], q[1]) % (10 ** 9 + 7)\n-print(P)\n+\t\tP = P * min(p[1], q[1]) % (10 ** 9 + 7)\n+print(P) \n \n", "FL_content": " def read():\n \treturn [int(i) for i in input().split(\" \")]\n N = int(input())\n T = read()\n A = read()\n t = [(i != j, i) for i, j in zip(T, [None] + T)]\n a = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]\n P = 1\n for p, q in zip(t, a):\n \tif(p[0]):\n \t\tif(q[0]):\n \t\t\tif(p[1] != q[1]):\n \t\t\t\tprint(0)\n \t\t\t\texit()\n-\t\telif(q[1] < p[1]):\n-\t\t\tprint(0)\n-\t\t\texit()\n \telif(q[0]):\n \t\tif(p[1] < q[1]):\n \t\t\tprint(0)\n \t\t\texit()\n \telse:\n-\t\tP *= min(p[1], q[1]) % (10 ** 9 + 7)\n-print(P)\n \n", "added_lines": 6, "removed_lines": 5, "code1_lines": 25 }, { "user_id": "u457901067", "problem_id": "p03959", "submission1_id": "s101038802", "submission2_id": "s046265801", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\nmod = int(1e9+7)\n\ndp = [0] * (N)\ndp[0] = 1\n\n\nAmax = max(A)\nAleft, Tright = -1, -1\nTmax = max(T)\nfor i in range(N):\n if Amax == A[i]:\n Aleft = i\n break\nfor i in range(N-1,-1,-1):\n if Tmax == T[i]:\n Tright = i\n break\nif Aleft > Tright:\n print(0)\n exit(0)\n \nfor i in range(1,N-1):\n if A[i-1] < A[i] or T[i] > T[i+1]:\n dp[i] = dp[i-1]\n if A[i] != T[i]:\n print(0)\n exit(0)\n else:\n dp[i] = dp[i-1] * min(A[i], T[i]) % mod\n \nprint(dp[N-2])\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\nmod = int(1e9+7)\n\ndp = [0] * (N)\ndp[0] = 1\n\n\nAmax = max(A)\nAleft, Tright = -1, -1\nTmax = max(T)\nfor i in range(N):\n if Amax == A[i]:\n Aleft = i\n break\nfor i in range(N-1,-1,-1):\n if Tmax == T[i]:\n Tright = i\n break\nif Aleft > Tright:\n print(0)\n exit(0)\nif A[-1] != T[0]:\n print(0)\n exit(0)\n \nfor i in range(1,N-1):\n if A[i-1] < A[i] or T[i] > T[i+1]:\n dp[i] = dp[i-1]\n else:\n dp[i] = dp[i-1] * min(A[i], T[i]) % mod\n \nprint(dp[N-2])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581956881", "date2": "1581962149", "bleu_score": "0.9619705943360161", "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, 1, 1, 0], "code1_test_score": 103, "total_score": 104, "input": "10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n", "actual_output": "0\n", "expected_output": "884111967\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n mod = int(1e9+7)\n \n dp = [0] * (N)\n dp[0] = 1\n \n \n Amax = max(A)\n Aleft, Tright = -1, -1\n Tmax = max(T)\n for i in range(N):\n if Amax == A[i]:\n Aleft = i\n break\n for i in range(N-1,-1,-1):\n if Tmax == T[i]:\n Tright = i\n break\n if Aleft > Tright:\n print(0)\n exit(0)\n+if A[-1] != T[0]:\n+ print(0)\n+ exit(0)\n \n for i in range(1,N-1):\n if A[i-1] < A[i] or T[i] > T[i+1]:\n dp[i] = dp[i-1]\n- if A[i] != T[i]:\n- print(0)\n- exit(0)\n else:\n dp[i] = dp[i-1] * min(A[i], T[i]) % mod\n- \n+ \n print(dp[N-2])\n \n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n mod = int(1e9+7)\n \n dp = [0] * (N)\n dp[0] = 1\n \n \n Amax = max(A)\n Aleft, Tright = -1, -1\n Tmax = max(T)\n for i in range(N):\n if Amax == A[i]:\n Aleft = i\n break\n for i in range(N-1,-1,-1):\n if Tmax == T[i]:\n Tright = i\n break\n if Aleft > Tright:\n print(0)\n exit(0)\n \n for i in range(1,N-1):\n if A[i-1] < A[i] or T[i] > T[i+1]:\n dp[i] = dp[i-1]\n- if A[i] != T[i]:\n- print(0)\n- exit(0)\n else:\n dp[i] = dp[i-1] * min(A[i], T[i]) % mod\n- \n print(dp[N-2])\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 36 }, { "user_id": "u588794534", "problem_id": "p03959", "submission1_id": "s664365162", "submission2_id": "s145526218", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\n\nt=list(map(int,input().split()))\na=list(map(int,input().split()))\n\n\nprint(0)\nexit()\n\nkakute=[0]*n\nkakute[0]=1\n\nfor i in range(1,n):\n if t[i]>t[i-1]:\n kakute[i]=1\n\na=a[::-1]\nans=1\n\nfor i in range(1,n):\n index=n-i-1\n \n if a[i]>a[i-1]:\n \n if a[i]>t[index]:\n print(0)\n exit()\n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n \n else:\n \n if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n else:\n ans=ans*min(a[i],t[index])%(10**9+7)\n\nprint(ans%(10**9+7))\n\n\n \n\n \n\n\n\n\n\n\n\n", "code2": "n=int(input())\n\nt=list(map(int,input().split()))\na=list(map(int,input().split()))\n\n\nkakute=[0]*n\nkakute[0]=1\n\nif n==1:\n if t[0]!=a[0]:\n print(0)\n exit()\n\nfor i in range(1,n):\n if t[i]>t[i-1]:\n kakute[i]=1\n\na=a[::-1]\nans=1\n\nfor i in range(1,n):\n index=n-i-1\n \n if a[i]>a[i-1]:\n \n if a[i]>t[index]:\n print(0)\n exit()\n \n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n \n else:\n \n if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n \n else:\n ans=ans*min(a[i],t[index])%(10**9+7)\n\nprint(ans%(10**9+7))\n\n\n \n\n \n\n\n\n\n\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591925765", "date2": "1591925901", "bleu_score": "0.9141963513450496", "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, 0, 0, 0], "code1_test_score": 100, "total_score": 104, "input": "5\n1 3 3 3 3\n3 3 2 2 2\n", "actual_output": "0\n", "expected_output": "4\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n=int(input())\n \n t=list(map(int,input().split()))\n a=list(map(int,input().split()))\n \n \n-print(0)\n-exit()\n-\n kakute=[0]*n\n kakute[0]=1\n \n+if n==1:\n+ if t[0]!=a[0]:\n+ print(0)\n+ exit()\n+\n for i in range(1,n):\n if t[i]>t[i-1]:\n kakute[i]=1\n \n a=a[::-1]\n ans=1\n \n for i in range(1,n):\n index=n-i-1\n \n if a[i]>a[i-1]:\n \n if a[i]>t[index]:\n print(0)\n exit()\n+ \n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n \n else:\n \n if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n+ \n else:\n ans=ans*min(a[i],t[index])%(10**9+7)\n \n print(ans%(10**9+7))\n \n \n \n \n \n \n \n \n \n \n \n \n \n", "FL_content": " n=int(input())\n \n t=list(map(int,input().split()))\n a=list(map(int,input().split()))\n \n \n-print(0)\n-exit()\n-\n kakute=[0]*n\n kakute[0]=1\n \n for i in range(1,n):\n if t[i]>t[i-1]:\n kakute[i]=1\n \n a=a[::-1]\n ans=1\n \n for i in range(1,n):\n index=n-i-1\n \n if a[i]>a[i-1]:\n \n if a[i]>t[index]:\n print(0)\n exit()\n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n \n else:\n \n if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n else:\n ans=ans*min(a[i],t[index])%(10**9+7)\n \n print(ans%(10**9+7))\n \n \n \n \n \n \n \n \n \n \n \n \n \n", "added_lines": 7, "removed_lines": 3, "code1_lines": 55 }, { "user_id": "u043424727", "problem_id": "p03959", "submission1_id": "s425516946", "submission2_id": "s571898703", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef main():\n N = int(input())\n t = list(map(int, input().split()))\n a = list(reversed(list(map(int, input().split()))))\n\n m = [0] * N\n\n b = 0\n for i,h in enumerate(t):\n if b != h:\n m[i] = h\n b = h\n b = 0\n for j,h in enumerate(a):\n if b != h:\n if m[N-j-1] != 0 and m[N-j-1] != h:\n print(0)\n return\n else:\n m[N-j-1] = h\n b = h\n res = 1\n for k,h in enumerate(m):\n if h == 0:\n print(a[N-k-1], t[k])\n res = res * min(a[N-k-1], t[k]) % (pow(10, 9) + 7)\n print(res)\n\nmain()\n", "code2": "\n\ndef main():\n N = int(input())\n t = list(map(int, input().split()))\n a = list(reversed(list(map(int, input().split()))))\n\n m = [0] * N\n\n b = 0\n for i,h in enumerate(t):\n if b != h:\n m[i] = h\n if a[N-i-1] < h:\n print(0)\n return\n b = h\n b = 0\n for j,h in enumerate(a):\n p = N-j-1\n if b != h:\n if m[p] != 0 and m[p] != h:\n print(0)\n return\n else:\n m[p] = h\n if t[p] < h:\n print(0)\n return\n b = h\n res = 1\n for k,h in enumerate(m):\n if h == 0:\n res = res * min(a[N-k-1], t[k]) % (pow(10, 9) + 7)\n print(res)\n return\n\nmain()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1477274015", "date2": "1477275058", "bleu_score": "0.7807893186679", "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, 0, 1, 0], "code1_test_score": 101, "total_score": 104, "input": "10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n", "actual_output": "8848 3776\n8848 8848\n8848 8848\n8848 8848\n884111967\n", "expected_output": "884111967\n", "anno_code": ["\n\ndef main(): # (0): main=\n N = int(input()) # (2): N=10\n t = list(map(int, input().split())) # (3): t=[1, 3776, 3776, 8848, 8848, 8848, 8848, 8848, 8848, 8848]\n a = list(reversed(list(map(int, input().split())))) # (4): a=[5, 3776, 8848, 8848, 8848, 8848, 8848, 8848, 8848, 8848]\n\n m = [0] * N # (5): m=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\n b = 0 # (6): b=0\n for i,h in enumerate(t): # (7): i=0, h=1 (11): i=1, h=3776 ... (40): NO CHANGE\n if b != h: # (8): NO CHANGE (12): NO CHANGE ... (38): NO CHANGE\n m[i] = h # (9): m=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0] (13): m=[1, 3776, 0, 0, 0, 0, 0, 0, 0, 0] (20): m=[1, 3776, 0, 8848, 0, 0, 0, 0, 0, 0]\n b = h # (10): b=1 (14): b=3776 ... (39): NO CHANGE\n b = 0 # (41): b=0\n for j,h in enumerate(a): # (42): h=5, j=0 (47): h=3776, j=1 ... (78): NO CHANGE\n if b != h: # (43): NO CHANGE (48): NO CHANGE ... (76): NO CHANGE\n if m[N-j-1] != 0 and m[N-j-1] != h: # (44): NO CHANGE (49): NO CHANGE (54): NO CHANGE\n print(0)\n return\n else:\n m[N-j-1] = h # (45): m=[1, 3776, 0, 8848, 0, 0, 0, 0, 0, 5] (50): m=[1, 3776, 0, 8848, 0, 0, 0, 0, 3776, 5] (55): m=[1, 3776, 0, 8848, 0, 0, 0, 8848, 3776, 5]\n b = h # (46): b=5 (51): b=3776 ... (77): NO CHANGE\n res = 1 # (79): res=1\n for k,h in enumerate(m): # (80): h=1, k=0 (82): h=3776, k=1 ... (108): NO CHANGE\n if h == 0: # (81): NO CHANGE (83): NO CHANGE ... (107): NO CHANGE\n print(a[N-k-1], t[k]) # (86): NO CHANGE (92): NO CHANGE ... (100): NO CHANGE\n res = res * min(a[N-k-1], t[k]) % (pow(10, 9) + 7) # (87): res=3776 (93): res=33410048 ... (101): res=884111967\n print(res)\n\nmain() # (1): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n \n def main():\n N = int(input())\n t = list(map(int, input().split()))\n a = list(reversed(list(map(int, input().split()))))\n \n m = [0] * N\n \n b = 0\n for i,h in enumerate(t):\n if b != h:\n m[i] = h\n+ if a[N-i-1] < h:\n+ print(0)\n+ return\n b = h\n b = 0\n for j,h in enumerate(a):\n+ p = N-j-1\n if b != h:\n- if m[N-j-1] != 0 and m[N-j-1] != h:\n+ if m[p] != 0 and m[p] != h:\n print(0)\n return\n else:\n- m[N-j-1] = h\n+ m[p] = h\n+ if t[p] < h:\n+ print(0)\n+ return\n b = h\n res = 1\n for k,h in enumerate(m):\n if h == 0:\n- print(a[N-k-1], t[k])\n res = res * min(a[N-k-1], t[k]) % (pow(10, 9) + 7)\n print(res)\n+ return\n \n main()\n \n", "FL_content": " \n \n def main():\n N = int(input())\n t = list(map(int, input().split()))\n a = list(reversed(list(map(int, input().split()))))\n \n m = [0] * N\n \n b = 0\n for i,h in enumerate(t):\n if b != h:\n m[i] = h\n b = h\n b = 0\n for j,h in enumerate(a):\n if b != h:\n- if m[N-j-1] != 0 and m[N-j-1] != h:\n print(0)\n return\n else:\n- m[N-j-1] = h\n b = h\n res = 1\n for k,h in enumerate(m):\n if h == 0:\n- print(a[N-k-1], t[k])\n res = res * min(a[N-k-1], t[k]) % (pow(10, 9) + 7)\n print(res)\n \n main()\n \n", "added_lines": 10, "removed_lines": 3, "code1_lines": 32 }, { "user_id": "u983918956", "problem_id": "p03959", "submission1_id": "s007367178", "submission2_id": "s597761625", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod = 10 ** 9 + 7\n\nN = int(input())\nT = [0] + list(map(int, input().split()))\nA = list(map(int, input().split())) + [0]\n\nH = [0] * N\nfor i in range(1, N + 1):\n if T[i - 1] < T[i]:\n H[i - 1] = T[i]\nfor i in range(N - 1, -1, -1):\n if A[i + 1] < A[i]:\n if H[i] == 0 or H[i] == A[i]:\n H[i] = A[i]\n else:\n print(0)\n exit()\n\nans = 1\nT.pop(0)\nA.pop(-1)\nfor h, t, a in zip(H, T, A):\n if h == 0:\n ans *= min(t, a)\n ans %= mod\nprint(ans)", "code2": "mod = 10 ** 9 + 7\n\nN = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nH = [0] * N\nfor i in range(N):\n if i == 0 or T[i - 1] < T[i]:\n H[i] = T[i]\n\nfor i in range(N - 1, -1, -1):\n if i == N - 1 or A[i] > A[i + 1]:\n H[i] = A[i]\n \nans = 1\nfor i in range(N):\n if H[i] == 0:\n H[i] = min(T[i], A[i])\n ans *= min(T[i], A[i])\n ans %= mod\n\nflag = True\nM = 0\nfor i in range(N):\n M = max(M, H[i])\n flag &= (M == T[i])\nM = 0\nfor i in range(N - 1, -1, -1):\n M = max(M, H[i])\n flag &= (M == A[i])\n\nif flag is True:\n print(ans)\nelse:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576711422", "date2": "1576714845", "bleu_score": "0.6509587643930937", "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, 0, 0, 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, 1, 1, 1, 1, 1, 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": 104, "input": "5\n16 0 0 -1 0\n20 24 -1 0 -11\n", "actual_output": "999999996\n", "expected_output": "0\n\n", "anno_code": ["mod = 10 ** 9 + 7 # (0): mod=1000000007\n\nN = int(input()) # (1): N=5\nT = [0] + list(map(int, input().split())) # (2): T=[0, 16, 0, 0, -1, 0]\nA = list(map(int, input().split())) + [0] # (3): A=[20, 24, -1, 0, -11, 0]\n\nH = [0] * N # (4): H=[0, 0, 0, 0, 0]\nfor i in range(1, N + 1): # (5): i=1 (8): i=2 ... (17): NO CHANGE\n if T[i - 1] < T[i]: # (6): NO CHANGE (9): NO CHANGE ... (15): NO CHANGE\n H[i - 1] = T[i] # (7): H=[16, 0, 0, 0, 0] (16): NO CHANGE\nfor i in range(N - 1, -1, -1): # (18): i=4 (20): i=3 ... (32): NO CHANGE\n if A[i + 1] < A[i]: # (19): NO CHANGE (21): NO CHANGE ... (31): NO CHANGE\n if H[i] == 0 or H[i] == A[i]: # (22): NO CHANGE (28): NO CHANGE\n H[i] = A[i] # (23): NO CHANGE (29): H=[16, 24, 0, 0, 0]\n else:\n print(0)\n exit()\n\nans = 1 # (33): ans=1\nT.pop(0) # (34): T=[16, 0, 0, -1, 0]\nA.pop(-1) # (35): A=[20, 24, -1, 0, -11]\nfor h, t, a in zip(H, T, A): # (36): h=16, t=16, a=20 (38): h=24, t=0, a=24 ... (52): NO CHANGE\n if h == 0: # (37): NO CHANGE (39): NO CHANGE ... (49): NO CHANGE\n ans *= min(t, a) # (42): ans=-1 (46): ans=-1000000006 (50): ans=-11\n ans %= mod # (43): ans=1000000006 (47): ans=1 (51): ans=999999996\nprint(ans)"], "anno_status": [true], "diff_content": " mod = 10 ** 9 + 7\n \n N = int(input())\n-T = [0] + list(map(int, input().split()))\n-A = list(map(int, input().split())) + [0]\n+T = list(map(int, input().split()))\n+A = list(map(int, input().split()))\n \n H = [0] * N\n-for i in range(1, N + 1):\n- if T[i - 1] < T[i]:\n- H[i - 1] = T[i]\n-for i in range(N - 1, -1, -1):\n- if A[i + 1] < A[i]:\n- if H[i] == 0 or H[i] == A[i]:\n- H[i] = A[i]\n- else:\n- print(0)\n- exit()\n+for i in range(N):\n+ if i == 0 or T[i - 1] < T[i]:\n+ H[i] = T[i]\n \n+for i in range(N - 1, -1, -1):\n+ if i == N - 1 or A[i] > A[i + 1]:\n+ H[i] = A[i]\n+ \n ans = 1\n-T.pop(0)\n-A.pop(-1)\n-for h, t, a in zip(H, T, A):\n- if h == 0:\n- ans *= min(t, a)\n+for i in range(N):\n+ if H[i] == 0:\n+ H[i] = min(T[i], A[i])\n+ ans *= min(T[i], A[i])\n ans %= mod\n-print(ans)\n+\n+flag = True\n+M = 0\n+for i in range(N):\n+ M = max(M, H[i])\n+ flag &= (M == T[i])\n+M = 0\n+for i in range(N - 1, -1, -1):\n+ M = max(M, H[i])\n+ flag &= (M == A[i])\n+\n+if flag is True:\n+ print(ans)\n+else:\n+ print(0)\n", "FL_content": " mod = 10 ** 9 + 7\n \n N = int(input())\n-T = [0] + list(map(int, input().split()))\n-A = list(map(int, input().split())) + [0]\n \n H = [0] * N\n-for i in range(1, N + 1):\n- if T[i - 1] < T[i]:\n- H[i - 1] = T[i]\n-for i in range(N - 1, -1, -1):\n- if A[i + 1] < A[i]:\n- if H[i] == 0 or H[i] == A[i]:\n- H[i] = A[i]\n- else:\n- print(0)\n- exit()\n \n ans = 1\n-T.pop(0)\n-A.pop(-1)\n-for h, t, a in zip(H, T, A):\n- if h == 0:\n- ans *= min(t, a)\n ans %= mod\n-print(ans)\n", "added_lines": 28, "removed_lines": 18, "code1_lines": 26 }, { "user_id": "u645250356", "problem_id": "p03959", "submission1_id": "s892975170", "submission2_id": "s998892592", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter,defaultdict,deque\nfrom heapq import heappop,heappush,heapify\nimport sys,bisect,math,itertools,fractions\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\nINF = float('inf')\ndef inp(): return int(sys.stdin.readline())\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\n\ndef err():\n print(0)\n quit()\n\nn = inp()\na = inpl()\nb = inpl()\nde = [-1] * n\nmx = [INF] * n\nnow = -1\nfor i in range(n):\n if a[i] > now:\n now = a[i]\n de[i] = now\n else:\n mx[i] = now\nnow = -1\nfor i in range(n)[::-1]:\n if b[i] > now:\n now = b[i]\n if de[i] != -1 and de[i] != now:\n err()\n de[i] = now\n else:\n mx[i] = min(mx[i], now)\nres = 1\nfor i in range(n):\n if de[i] == -1:\n res *= mx[i]\n res %= mod\nprint(res)", "code2": "from collections import Counter,defaultdict,deque\nfrom heapq import heappop,heappush,heapify\nimport sys,bisect,math,itertools,fractions\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\nINF = float('inf')\ndef inp(): return int(sys.stdin.readline())\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\n\ndef err():\n print(0)\n quit()\n\nn = inp()\na = inpl()\nb = inpl()\nif a[-1] != b[0]: err()\nde = [-1] * n\nmx = [INF] * n\nnow = -1\nfor i in range(n):\n if a[i] > now:\n now = a[i]\n de[i] = now\n else:\n mx[i] = now\nnow = -1\nfor i in range(n)[::-1]:\n if b[i] > now:\n now = b[i]\n if de[i] != -1 and de[i] != now:\n err()\n de[i] = now\n else:\n if now < de[i]: err()\n mx[i] = min(mx[i], now)\nres = 1\nfor i in range(n):\n if de[i] == -1:\n res *= mx[i]\n res %= mod\nprint(res)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598577891", "date2": "1598578189", "bleu_score": "0.9373911956316556", "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, 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], "code1_test_score": 102, "total_score": 104, "input": "5\n3 1 1 0 2\n8 10 -1 1 -21\n", "actual_output": "1000000006\n", "expected_output": "0\n\n", "anno_code": ["from collections import Counter,defaultdict,deque\nfrom heapq import heappop,heappush,heapify\nimport sys,bisect,math,itertools,fractions\nsys.setrecursionlimit(10**8) # (0): NO CHANGE\nmod = 10**9+7 # (1): mod=1000000007\nINF = float('inf') # (2): INF=inf, inp=, inpl=\ndef inp(): return int(sys.stdin.readline())\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\n\ndef err(): # (3): err=\n print(0)\n quit()\n\nn = inp() # (4): n=5\na = inpl() # (5): a=[3, 1, 1, 0, 2]\nb = inpl() # (6): b=[8, 10, -1, 1, -21]\nde = [-1] * n # (7): de=[-1, -1, -1, -1, -1]\nmx = [INF] * n # (8): mx=[inf, inf, inf, inf, inf]\nnow = -1 # (9): now=-1\nfor i in range(n): # (10): i=0 (14): i=1 ... (26): NO CHANGE\n if a[i] > now: # (11): NO CHANGE (15): NO CHANGE ... (24): NO CHANGE\n now = a[i] # (12): now=3\n de[i] = now # (13): de=[3, -1, -1, -1, -1]\n else:\n mx[i] = now # (16): mx=[inf, 3, inf, inf, inf] (19): mx=[inf, 3, 3, inf, inf] ... (25): mx=[inf, 3, 3, 3, 3]\nnow = -1 # (27): now=-1\nfor i in range(n)[::-1]: # (28): NO CHANGE (31): i=3 ... (47): NO CHANGE\n if b[i] > now: # (29): NO CHANGE (32): NO CHANGE ... (45): NO CHANGE\n now = b[i] # (33): now=1 (41): now=10\n if de[i] != -1 and de[i] != now: # (34): NO CHANGE (42): NO CHANGE\n err()\n de[i] = now # (35): de=[3, -1, -1, 1, -1] (43): de=[3, 10, -1, 1, -1]\n else:\n mx[i] = min(mx[i], now) # (30): mx=[inf, 3, 3, 3, -1] (38): mx=[inf, 3, 1, 3, -1] (46): mx=[10, 3, 1, 3, -1]\nres = 1 # (48): res=1\nfor i in range(n): # (49): NO CHANGE (51): i=1 ... (63): NO CHANGE\n if de[i] == -1: # (50): NO CHANGE (52): NO CHANGE ... (60): NO CHANGE\n res *= mx[i] # (55): NO CHANGE (61): res=-1\n res %= mod # (56): NO CHANGE (62): res=1000000006\nprint(res)"], "anno_status": [false], "diff_content": " from collections import Counter,defaultdict,deque\n from heapq import heappop,heappush,heapify\n import sys,bisect,math,itertools,fractions\n sys.setrecursionlimit(10**8)\n mod = 10**9+7\n INF = float('inf')\n def inp(): return int(sys.stdin.readline())\n def inpl(): return list(map(int, sys.stdin.readline().split()))\n \n def err():\n print(0)\n quit()\n \n n = inp()\n a = inpl()\n b = inpl()\n+if a[-1] != b[0]: err()\n de = [-1] * n\n mx = [INF] * n\n now = -1\n for i in range(n):\n if a[i] > now:\n now = a[i]\n de[i] = now\n else:\n mx[i] = now\n now = -1\n for i in range(n)[::-1]:\n if b[i] > now:\n now = b[i]\n if de[i] != -1 and de[i] != now:\n err()\n de[i] = now\n else:\n+ if now < de[i]: err()\n mx[i] = min(mx[i], now)\n res = 1\n for i in range(n):\n if de[i] == -1:\n res *= mx[i]\n res %= mod\n print(res)\n", "FL_content": " from collections import Counter,defaultdict,deque\n from heapq import heappop,heappush,heapify\n import sys,bisect,math,itertools,fractions\n sys.setrecursionlimit(10**8)\n mod = 10**9+7\n INF = float('inf')\n def inp(): return int(sys.stdin.readline())\n def inpl(): return list(map(int, sys.stdin.readline().split()))\n \n def err():\n print(0)\n quit()\n \n n = inp()\n a = inpl()\n b = inpl()\n de = [-1] * n\n mx = [INF] * n\n now = -1\n for i in range(n):\n if a[i] > now:\n now = a[i]\n de[i] = now\n else:\n mx[i] = now\n now = -1\n for i in range(n)[::-1]:\n if b[i] > now:\n now = b[i]\n if de[i] != -1 and de[i] != now:\n err()\n de[i] = now\n else:\n mx[i] = min(mx[i], now)\n res = 1\n for i in range(n):\n if de[i] == -1:\n res *= mx[i]\n res %= mod\n print(res)\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 40 }, { "user_id": "u983918956", "problem_id": "p03959", "submission1_id": "s351734526", "submission2_id": "s597761625", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod = 10 ** 9 + 7\n\nN = int(input())\nT = [0] + list(map(int, input().split()))\nA = list(map(int, input().split())) + [0]\n\nH = [0] * N\nfor i in range(1, N):\n if T[i - 1] < T[i]:\n H[i - 1] = T[i]\nfor i in range(N - 1, -1, -1):\n if A[i + 1] < A[i]:\n if H[i] == 0 or H[i] == A[i]:\n H[i] = A[i]\n else:\n print(0)\n exit()\n\nans = 1\nT.pop(0)\nA.pop(-1)\nfor h, t, a in zip(H, T, A):\n if h == 0:\n ans *= min(t, a)\n ans %= mod\nprint(ans)", "code2": "mod = 10 ** 9 + 7\n\nN = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nH = [0] * N\nfor i in range(N):\n if i == 0 or T[i - 1] < T[i]:\n H[i] = T[i]\n\nfor i in range(N - 1, -1, -1):\n if i == N - 1 or A[i] > A[i + 1]:\n H[i] = A[i]\n \nans = 1\nfor i in range(N):\n if H[i] == 0:\n H[i] = min(T[i], A[i])\n ans *= min(T[i], A[i])\n ans %= mod\n\nflag = True\nM = 0\nfor i in range(N):\n M = max(M, H[i])\n flag &= (M == T[i])\nM = 0\nfor i in range(N - 1, -1, -1):\n M = max(M, H[i])\n flag &= (M == A[i])\n\nif flag is True:\n print(ans)\nelse:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576710955", "date2": "1576714845", "bleu_score": "0.6491498801370427", "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, 0, 0, 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, 1, 1, 1, 1, 1, 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": 104, "input": "5\n16 0 4 -1 2\n19 24 -3 0 -11\n", "actual_output": "11\n", "expected_output": "0\n\n", "anno_code": ["mod = 10 ** 9 + 7 # (0): mod=1000000007\n\nN = int(input()) # (1): N=5\nT = [0] + list(map(int, input().split())) # (2): T=[0, 16, 0, 4, -1, 2]\nA = list(map(int, input().split())) + [0] # (3): A=[19, 24, -3, 0, -11, 0]\n\nH = [0] * N # (4): H=[0, 0, 0, 0, 0]\nfor i in range(1, N): # (5): i=1 (8): i=2 ... (15): NO CHANGE\n if T[i - 1] < T[i]: # (6): NO CHANGE (9): NO CHANGE ... (14): NO CHANGE\n H[i - 1] = T[i] # (7): H=[16, 0, 0, 0, 0] (12): H=[16, 0, 4, 0, 0]\nfor i in range(N - 1, -1, -1): # (16): NO CHANGE (18): i=3 ... (30): NO CHANGE\n if A[i + 1] < A[i]: # (17): NO CHANGE (19): NO CHANGE ... (29): NO CHANGE\n if H[i] == 0 or H[i] == A[i]: # (20): NO CHANGE (26): NO CHANGE\n H[i] = A[i] # (21): NO CHANGE (27): H=[16, 24, 4, 0, 0]\n else:\n print(0)\n exit()\n\nans = 1 # (31): ans=1\nT.pop(0) # (32): T=[16, 0, 4, -1, 2]\nA.pop(-1) # (33): A=[19, 24, -3, 0, -11]\nfor h, t, a in zip(H, T, A): # (34): h=16, t=16, a=19 (36): h=24, t=0, a=24 ... (48): NO CHANGE\n if h == 0: # (35): NO CHANGE (37): NO CHANGE ... (45): NO CHANGE\n ans *= min(t, a) # (42): ans=-1 (46): ans=-11000000066\n ans %= mod # (43): ans=1000000006 (47): ans=11\nprint(ans)"], "anno_status": [true], "diff_content": " mod = 10 ** 9 + 7\n \n N = int(input())\n-T = [0] + list(map(int, input().split()))\n-A = list(map(int, input().split())) + [0]\n+T = list(map(int, input().split()))\n+A = list(map(int, input().split()))\n \n H = [0] * N\n-for i in range(1, N):\n- if T[i - 1] < T[i]:\n- H[i - 1] = T[i]\n-for i in range(N - 1, -1, -1):\n- if A[i + 1] < A[i]:\n- if H[i] == 0 or H[i] == A[i]:\n- H[i] = A[i]\n- else:\n- print(0)\n- exit()\n+for i in range(N):\n+ if i == 0 or T[i - 1] < T[i]:\n+ H[i] = T[i]\n \n+for i in range(N - 1, -1, -1):\n+ if i == N - 1 or A[i] > A[i + 1]:\n+ H[i] = A[i]\n+ \n ans = 1\n-T.pop(0)\n-A.pop(-1)\n-for h, t, a in zip(H, T, A):\n- if h == 0:\n- ans *= min(t, a)\n+for i in range(N):\n+ if H[i] == 0:\n+ H[i] = min(T[i], A[i])\n+ ans *= min(T[i], A[i])\n ans %= mod\n-print(ans)\n+\n+flag = True\n+M = 0\n+for i in range(N):\n+ M = max(M, H[i])\n+ flag &= (M == T[i])\n+M = 0\n+for i in range(N - 1, -1, -1):\n+ M = max(M, H[i])\n+ flag &= (M == A[i])\n+\n+if flag is True:\n+ print(ans)\n+else:\n+ print(0)\n", "FL_content": " mod = 10 ** 9 + 7\n \n N = int(input())\n-T = [0] + list(map(int, input().split()))\n-A = list(map(int, input().split())) + [0]\n \n H = [0] * N\n-for i in range(1, N):\n- if T[i - 1] < T[i]:\n- H[i - 1] = T[i]\n-for i in range(N - 1, -1, -1):\n- if A[i + 1] < A[i]:\n- if H[i] == 0 or H[i] == A[i]:\n- H[i] = A[i]\n- else:\n- print(0)\n- exit()\n \n ans = 1\n-T.pop(0)\n-A.pop(-1)\n-for h, t, a in zip(H, T, A):\n- if h == 0:\n- ans *= min(t, a)\n ans %= mod\n-print(ans)\n", "added_lines": 28, "removed_lines": 18, "code1_lines": 26 }, { "user_id": "u860002137", "problem_id": "p03959", "submission1_id": "s732888358", "submission2_id": "s558676564", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\narr = [[1] * n for _ in range(4)]\nt = list(map(int, input().split()))\na = list(map(int, input().split()))[::-1]\n\nMOD = 10**9 + 7\n\nmax_t = 0\nmax_a = 0\n\nfor i in range(n):\n if max_t < t[i]:\n arr[0][i] = t[i]\n arr[1][i] = t[i]\n max_t = t[i]\n else:\n arr[1][i] = t[i]\n if max_a < a[i]:\n arr[2][i] = a[i]\n arr[3][i] = a[i]\n max_a = a[i]\n else:\n arr[3][i] = a[i]\n\narr[2] = arr[2][::-1]\narr[3] = arr[3][::-1]\n\nans = 1\nfor i in range(n):\n ans *= (min(arr[1][i], arr[3][i]) - max(arr[0][i], arr[2][i]) + 1)\n ans %= MOD\n\nprint(ans)", "code2": "n = int(input())\narr = [[1] * n for _ in range(4)]\nt = list(map(int, input().split()))\na = list(map(int, input().split()))[::-1]\n\nMOD = 10**9 + 7\n\nmax_t = 0\nmax_a = 0\n\nfor i in range(n):\n if max_t < t[i]:\n arr[0][i] = t[i]\n arr[1][i] = t[i]\n max_t = t[i]\n else:\n arr[1][i] = t[i]\n if max_a < a[i]:\n arr[2][i] = a[i]\n arr[3][i] = a[i]\n max_a = a[i]\n else:\n arr[3][i] = a[i]\n\narr[2] = arr[2][::-1]\narr[3] = arr[3][::-1]\n\nans = 1\nfor i in range(n):\n ans *= max(min(arr[1][i], arr[3][i]) - max(arr[0][i], arr[2][i]) + 1, 0)\n ans %= MOD\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598580064", "date2": "1598580133", "bleu_score": "0.9853642987607408", "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, 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, 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, 1, 1, 1, 1], "code1_test_score": 67, "total_score": 104, "input": "5\n16 0 1 -1 0\n19 24 -3 0 -14\n", "actual_output": "966\n", "expected_output": "0\n\n", "anno_code": ["n = int(input()) # (0): n=5\narr = [[1] * n for _ in range(4)] # (1): arr\nt = list(map(int, input().split())) # (2): t=[16, 0, 1, -1, 0]\na = list(map(int, input().split()))[::-1] # (3): a=[-14, 0, -3, 24, 19]\n\nMOD = 10**9 + 7 # (4): MOD=1000000007\n\nmax_t = 0 # (5): max_t=0\nmax_a = 0 # (6): max_a=0\n\nfor i in range(n): # (7): i=0 (14): i=1 ... (36): NO CHANGE\n if max_t < t[i]: # (8): NO CHANGE (15): NO CHANGE ... (32): NO CHANGE\n arr[0][i] = t[i] # (9): arr\n arr[1][i] = t[i] # (10): arr\n max_t = t[i] # (11): max_t=16\n else:\n arr[1][i] = t[i] # (16): arr (21): NO CHANGE ... (33): arr\n if max_a < a[i]: # (12): NO CHANGE (17): NO CHANGE ... (34): NO CHANGE\n arr[2][i] = a[i] # (28): arr\n arr[3][i] = a[i] # (29): arr\n max_a = a[i] # (30): max_a=24\n else:\n arr[3][i] = a[i] # (13): arr (18): arr ... (35): arr\n\narr[2] = arr[2][::-1] # (37): arr\narr[3] = arr[3][::-1] # (38): arr\n\nans = 1 # (39): ans=1\nfor i in range(n): # (40): i=0 (43): i=1 ... (55): NO CHANGE\n ans *= (min(arr[1][i], arr[3][i]) - max(arr[0][i], arr[2][i]) + 1) # (41): NO CHANGE (44): ans=-23 ... (53): ans=-13999999132\n ans %= MOD # (42): NO CHANGE (45): ans=999999984 ... (54): ans=966\n\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n arr = [[1] * n for _ in range(4)]\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))[::-1]\n \n MOD = 10**9 + 7\n \n max_t = 0\n max_a = 0\n \n for i in range(n):\n if max_t < t[i]:\n arr[0][i] = t[i]\n arr[1][i] = t[i]\n max_t = t[i]\n else:\n arr[1][i] = t[i]\n if max_a < a[i]:\n arr[2][i] = a[i]\n arr[3][i] = a[i]\n max_a = a[i]\n else:\n arr[3][i] = a[i]\n \n arr[2] = arr[2][::-1]\n arr[3] = arr[3][::-1]\n \n ans = 1\n for i in range(n):\n- ans *= (min(arr[1][i], arr[3][i]) - max(arr[0][i], arr[2][i]) + 1)\n+ ans *= max(min(arr[1][i], arr[3][i]) - max(arr[0][i], arr[2][i]) + 1, 0)\n ans %= MOD\n \n print(ans)\n", "FL_content": " n = int(input())\n arr = [[1] * n for _ in range(4)]\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))[::-1]\n \n MOD = 10**9 + 7\n \n max_t = 0\n max_a = 0\n \n for i in range(n):\n if max_t < t[i]:\n arr[0][i] = t[i]\n arr[1][i] = t[i]\n max_t = t[i]\n else:\n arr[1][i] = t[i]\n if max_a < a[i]:\n arr[2][i] = a[i]\n arr[3][i] = a[i]\n max_a = a[i]\n else:\n arr[3][i] = a[i]\n \n arr[2] = arr[2][::-1]\n arr[3] = arr[3][::-1]\n \n ans = 1\n for i in range(n):\n- ans *= (min(arr[1][i], arr[3][i]) - max(arr[0][i], arr[2][i]) + 1)\n ans %= MOD\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 33 }, { "user_id": "u467736898", "problem_id": "p03959", "submission1_id": "s825004808", "submission2_id": "s505631746", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod = 10**9 + 7\nN = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nMin = [1] * N\nMax = [float(\"inf\")] * N\ntp = 0\nfor i, t in enumerate(T):\n if t != tp:\n Min[i] = max(Min[i], t)\n Max[i] = min(Max[i], t)\n tp = t\nap = 0\nfor i, a in zip(range(N-1, -1, -1), A[::-1]):\n if a != ap:\n Min[i] = max(Min[i], a)\n Max[i] = min(Max[i], a)\n ap = a\nans = 1\nfor mi, ma in zip(Min, Max):\n ans = ans * (ma-mi+1) % mod\nprint(ans)\n", "code2": "mod = 10**9 + 7\nN = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nMin = [1] * N\nMax = [float(\"inf\")] * N\ntp = 0\nfor i, t in enumerate(T):\n if t != tp:\n Min[i] = max(Min[i], t)\n Max[i] = min(Max[i], t)\n tp = t\nap = 0\nfor i, a in zip(range(N-1, -1, -1), A[::-1]):\n if a != ap:\n Min[i] = max(Min[i], a)\n Max[i] = min(Max[i], a)\n ap = a\nans = 1\nfor mi, ma in zip(Min, Max):\n ans = ans * max(ma-mi+1, 0) % mod\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573231050", "date2": "1573231151", "bleu_score": "0.9815925361247873", "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, 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, 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, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 104, "input": "5\n7 -1 1 -1 0\n38 3 -8 0 -1\n", "actual_output": "999999287\n", "expected_output": "0\n\n", "anno_code": ["mod = 10**9 + 7 # (0): mod=1000000007\nN = int(input()) # (1): N=5\nT = list(map(int, input().split())) # (2): T=[7, -1, 1, -1, 0]\nA = list(map(int, input().split())) # (3): A=[38, 3, -8, 0, -1]\n\nMin = [1] * N # (4): Min=[1, 1, 1, 1, 1]\nMax = [float(\"inf\")] * N # (5): Max=[inf, inf, inf, inf, inf]\ntp = 0 # (6): tp=0\nfor i, t in enumerate(T): # (7): i=0, t=7 (12): i=1, t=-1 ... (32): NO CHANGE\n if t != tp: # (8): NO CHANGE (13): NO CHANGE ... (28): NO CHANGE\n Min[i] = max(Min[i], t) # (9): Min=[7, 1, 1, 1, 1] (14): NO CHANGE ... (29): NO CHANGE\n Max[i] = min(Max[i], t) # (10): Max=[7, inf, inf, inf, inf] (15): Max=[7, -1, inf, inf, inf] ... (30): Max=[7, -1, 1, -1, 0]\n tp = t # (11): tp=7 (16): tp=-1 ... (31): tp=0\nap = 0 # (33): ap=0\nfor i, a in zip(range(N-1, -1, -1), A[::-1]): # (34): a=-1 (39): i=3, a=0 ... (59): NO CHANGE\n if a != ap: # (35): NO CHANGE (40): NO CHANGE ... (55): NO CHANGE\n Min[i] = max(Min[i], a) # (36): NO CHANGE (41): NO CHANGE ... (56): Min=[38, 3, 1, 1, 1]\n Max[i] = min(Max[i], a) # (37): Max=[7, -1, 1, -1, -1] (42): NO CHANGE ... (57): NO CHANGE\n ap = a # (38): ap=-1 (43): ap=0 ... (58): ap=38\nans = 1 # (60): ans=1\nfor mi, ma in zip(Min, Max): # (61): mi=38, ma=7 (63): mi=3, ma=-1 ... (71): NO CHANGE\n ans = ans * (ma-mi+1) % mod # (62): ans=999999977 (64): ans=90 ... (70): ans=999999287\nprint(ans)\n"], "anno_status": [true], "diff_content": " mod = 10**9 + 7\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n Min = [1] * N\n Max = [float(\"inf\")] * N\n tp = 0\n for i, t in enumerate(T):\n if t != tp:\n Min[i] = max(Min[i], t)\n Max[i] = min(Max[i], t)\n tp = t\n ap = 0\n for i, a in zip(range(N-1, -1, -1), A[::-1]):\n if a != ap:\n Min[i] = max(Min[i], a)\n Max[i] = min(Max[i], a)\n ap = a\n ans = 1\n for mi, ma in zip(Min, Max):\n- ans = ans * (ma-mi+1) % mod\n+ ans = ans * max(ma-mi+1, 0) % mod\n print(ans)\n \n", "FL_content": " mod = 10**9 + 7\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n Min = [1] * N\n Max = [float(\"inf\")] * N\n tp = 0\n for i, t in enumerate(T):\n if t != tp:\n Min[i] = max(Min[i], t)\n Max[i] = min(Max[i], t)\n tp = t\n ap = 0\n for i, a in zip(range(N-1, -1, -1), A[::-1]):\n if a != ap:\n Min[i] = max(Min[i], a)\n Max[i] = min(Max[i], a)\n ap = a\n ans = 1\n for mi, ma in zip(Min, Max):\n- ans = ans * (ma-mi+1) % mod\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u731368968", "problem_id": "p03959", "submission1_id": "s578906540", "submission2_id": "s527708211", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\n\nx = [1 for _ in range(N)]\nfor i in range(1,N):\n if i == 0:\n x[i] = 1\n elif T[i - 1] < T[i]:\n x[i] = 1\n else:\n x[i] = T[i]\n\ny = [1 for _ in range(N)]\nfor i in range(N - 2, -1, -1):\n if i == N - 1:\n y[i] == 1\n if A[i] > A[i + 1]:\n y[i] = 1\n else:\n y[i] = A[i]\n\nans = 1\n\nfor i in range(N):\n ans = ans * min(x[i], y[i]) % int(1e9 + 7)\n\nprint(ans)\n\n11333\n33121\n", "code2": "N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\n\nx = [1 for _ in range(N)]\nfor i in range(1, N):\n if i == 0:\n x[i] = 1\n elif T[i - 1] < T[i]:\n x[i] = 1\n else:\n x[i] = T[i]\n\ny = [1 for _ in range(N)]\nfor i in range(N - 2, -1, -1):\n if i == N - 1:\n y[i] == 1\n if A[i] > A[i + 1]:\n y[i] = 1\n else:\n y[i] = A[i]\n\nans = 1\n\nfor i in range(N):\n ans = ans * min(x[i], y[i]) % int(1e9 + 7)\n\n\nfor x,y,t,a in zip(x,y,T,A):\n if x == 1 and t > a:\n ans = 0\n if y == 1 and t < a:\n ans = 0\n\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569877736", "date2": "1569880376", "bleu_score": "0.8112836809735561", "code1_test_status": [1, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 64, "total_score": 104, "input": "5\n1 2 1 1 4\n8 4 2 2 -2\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["N = int(input()) # (0): N=5\nT = list(map(int, input().split())) # (1): T=[1, 2, 1, 1, 4]\nA = list(map(int, input().split())) # (2): A=[8, 4, 2, 2, -2]\n\n\nx = [1 for _ in range(N)] # (3): x=[1, 1, 1, 1, 1]\nfor i in range(1,N): # (4): i=1 (8): i=2 ... (20): NO CHANGE\n if i == 0: # (5): NO CHANGE (9): NO CHANGE ... (17): NO CHANGE\n x[i] = 1\n elif T[i - 1] < T[i]: # (6): NO CHANGE (10): NO CHANGE ... (18): NO CHANGE\n x[i] = 1 # (7): NO CHANGE (19): NO CHANGE\n else:\n x[i] = T[i] # (11): NO CHANGE (15): NO CHANGE\n\ny = [1 for _ in range(N)] # (21): y=[1, 1, 1, 1, 1]\nfor i in range(N - 2, -1, -1): # (22): i=3 (26): i=2 ... (38): NO CHANGE\n if i == N - 1: # (23): NO CHANGE (27): NO CHANGE ... (35): NO CHANGE\n y[i] == 1\n if A[i] > A[i + 1]: # (24): NO CHANGE (28): NO CHANGE ... (36): NO CHANGE\n y[i] = 1 # (25): NO CHANGE (33): NO CHANGE (37): NO CHANGE\n else:\n y[i] = A[i] # (29): y=[1, 1, 2, 1, 1]\n\nans = 1 # (39): ans=1\n\nfor i in range(N): # (40): NO CHANGE (42): i=1 ... (50): NO CHANGE\n ans = ans * min(x[i], y[i]) % int(1e9 + 7) # (41): NO CHANGE (43): NO CHANGE ... (49): NO CHANGE\n\nprint(ans) # (51): NO CHANGE\n\n11333 # (52): NO CHANGE\n33121\n"], "anno_status": [true], "diff_content": " N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n \n x = [1 for _ in range(N)]\n-for i in range(1,N):\n+for i in range(1, N):\n if i == 0:\n x[i] = 1\n elif T[i - 1] < T[i]:\n x[i] = 1\n else:\n x[i] = T[i]\n \n y = [1 for _ in range(N)]\n for i in range(N - 2, -1, -1):\n if i == N - 1:\n y[i] == 1\n if A[i] > A[i + 1]:\n y[i] = 1\n else:\n y[i] = A[i]\n \n ans = 1\n \n for i in range(N):\n ans = ans * min(x[i], y[i]) % int(1e9 + 7)\n \n-print(ans)\n \n-11333\n-33121\n+for x,y,t,a in zip(x,y,T,A):\n+ if x == 1 and t > a:\n+ ans = 0\n+ if y == 1 and t < a:\n+ ans = 0\n+\n \n+print(ans)\n", "FL_content": " N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n \n \n x = [1 for _ in range(N)]\n-for i in range(1,N):\n if i == 0:\n x[i] = 1\n elif T[i - 1] < T[i]:\n x[i] = 1\n else:\n x[i] = T[i]\n \n y = [1 for _ in range(N)]\n for i in range(N - 2, -1, -1):\n if i == N - 1:\n y[i] == 1\n if A[i] > A[i + 1]:\n y[i] = 1\n else:\n y[i] = A[i]\n \n ans = 1\n \n for i in range(N):\n ans = ans * min(x[i], y[i]) % int(1e9 + 7)\n \n-print(ans)\n \n-11333\n-33121\n \n", "added_lines": 8, "removed_lines": 4, "code1_lines": 33 }, { "user_id": "u648212584", "problem_id": "p03959", "submission1_id": "s924297868", "submission2_id": "s628527614", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.buffer.readline\nfrom operator import itemgetter\n\ndef main():\n N = int(input())\n \n t = list(map(int,input().split()))\n a = list(map(int,input().split()))\n MOD = 10**9+7\n \n tt,tl = 0,[False for _ in range(N)]\n for x,num in enumerate(t):\n if num > tt:\n tl[x] = True\n tt = num\n \n at,al = 0,[False for _ in range(N)]\n for x,num in enumerate(a[::-1]):\n if num > at:\n al[-x-1] = True\n at = num\n \n print(tl,al)\n ans,now = 1,0\n for i in range(N):\n print(i,now)\n if tl[i] == True and al[i] == True:\n if now < t[i] == a[i]:\n now = min(t[i],a[i])\n else:\n print(-1)\n exit()\n elif tl[i] == True and al[i] == False:\n if now > t[i]:\n print(-1)\n exit()\n else:\n now = t[i]\n elif tl[i] == False and al[i] == True:\n if now < a[i]:\n print(-1)\n exit()\n else:\n now = a[i]\n else:\n ans *= min(t[i],a[i])\n ans %= MOD\n \n print(ans)\n\nif __name__ == \"__main__\":\n main()\n", "code2": "import sys\ninput = sys.stdin.buffer.readline\nfrom operator import itemgetter\n\ndef main():\n N = int(input())\n \n t = list(map(int,input().split()))\n a = list(map(int,input().split()))\n MOD = 10**9+7\n \n tt,tl = 0,[False for _ in range(N)]\n for x,num in enumerate(t):\n if num > tt:\n tl[x] = True\n tt = num\n \n at,al = 0,[False for _ in range(N)]\n for x,num in enumerate(a[::-1]):\n if num > at:\n al[-x-1] = True\n at = num\n\n ans,now = 1,0\n for i in range(N):\n if tl[i] == True and al[i] == True:\n if now < t[i] == a[i]:\n now = a[i]\n else:\n print(0)\n exit()\n elif tl[i] == True and al[i] == False:\n if t[i] > a[i]:\n print(0)\n exit()\n else:\n now = t[i]\n elif tl[i] == False and al[i] == True:\n if t[i] < a[i]:\n print(0)\n exit()\n else:\n now = a[i]\n else:\n ans *= min(t[i],a[i])\n ans %= MOD\n \n print(ans)\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583952269", "date2": "1583952916", "bleu_score": "0.9336605215115448", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n7 -1 1 -2 -2\n20 3 -2 -1 -2\n", "actual_output": "[True, False, False, False, False] [True, True, False, False, False]\n0 0\n-1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = sys.stdin.buffer.readline # (0): input=, itemgetter=\nfrom operator import itemgetter\n\ndef main(): # (1): main=\n N = int(input())\n \n t = list(map(int,input().split()))\n a = list(map(int,input().split()))\n MOD = 10**9+7\n \n tt,tl = 0,[False for _ in range(N)]\n for x,num in enumerate(t):\n if num > tt:\n tl[x] = True\n tt = num\n \n at,al = 0,[False for _ in range(N)]\n for x,num in enumerate(a[::-1]):\n if num > at:\n al[-x-1] = True\n at = num\n \n print(tl,al)\n ans,now = 1,0\n for i in range(N):\n print(i,now)\n if tl[i] == True and al[i] == True:\n if now < t[i] == a[i]:\n now = min(t[i],a[i])\n else:\n print(-1)\n exit()\n elif tl[i] == True and al[i] == False:\n if now > t[i]:\n print(-1)\n exit()\n else:\n now = t[i]\n elif tl[i] == False and al[i] == True:\n if now < a[i]:\n print(-1)\n exit()\n else:\n now = a[i]\n else:\n ans *= min(t[i],a[i])\n ans %= MOD\n \n print(ans)\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.buffer.readline\n from operator import itemgetter\n \n def main():\n N = int(input())\n \n t = list(map(int,input().split()))\n a = list(map(int,input().split()))\n MOD = 10**9+7\n \n tt,tl = 0,[False for _ in range(N)]\n for x,num in enumerate(t):\n if num > tt:\n tl[x] = True\n tt = num\n \n at,al = 0,[False for _ in range(N)]\n for x,num in enumerate(a[::-1]):\n if num > at:\n al[-x-1] = True\n at = num\n- \n- print(tl,al)\n+\n ans,now = 1,0\n for i in range(N):\n- print(i,now)\n if tl[i] == True and al[i] == True:\n if now < t[i] == a[i]:\n- now = min(t[i],a[i])\n+ now = a[i]\n else:\n- print(-1)\n+ print(0)\n exit()\n elif tl[i] == True and al[i] == False:\n- if now > t[i]:\n- print(-1)\n+ if t[i] > a[i]:\n+ print(0)\n exit()\n else:\n now = t[i]\n elif tl[i] == False and al[i] == True:\n- if now < a[i]:\n- print(-1)\n+ if t[i] < a[i]:\n+ print(0)\n exit()\n else:\n now = a[i]\n else:\n ans *= min(t[i],a[i])\n ans %= MOD\n \n print(ans)\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " import sys\n input = sys.stdin.buffer.readline\n from operator import itemgetter\n \n def main():\n N = int(input())\n \n t = list(map(int,input().split()))\n a = list(map(int,input().split()))\n MOD = 10**9+7\n \n tt,tl = 0,[False for _ in range(N)]\n for x,num in enumerate(t):\n if num > tt:\n tl[x] = True\n tt = num\n \n at,al = 0,[False for _ in range(N)]\n for x,num in enumerate(a[::-1]):\n if num > at:\n al[-x-1] = True\n at = num\n- \n- print(tl,al)\n ans,now = 1,0\n for i in range(N):\n- print(i,now)\n if tl[i] == True and al[i] == True:\n if now < t[i] == a[i]:\n- now = min(t[i],a[i])\n else:\n- print(-1)\n exit()\n elif tl[i] == True and al[i] == False:\n- if now > t[i]:\n- print(-1)\n exit()\n else:\n now = t[i]\n elif tl[i] == False and al[i] == True:\n- if now < a[i]:\n- print(-1)\n exit()\n else:\n now = a[i]\n else:\n ans *= min(t[i],a[i])\n ans %= MOD\n \n print(ans)\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 7, "removed_lines": 9, "code1_lines": 54 }, { "user_id": "u543954314", "problem_id": "p03959", "submission1_id": "s664450284", "submission2_id": "s872193167", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nmount = [0]*n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nmount[0] = a[0]\nmount[-1] = b[-1]\npat = 1\nmod = 10**9+7\nfor i in range(1,n):\n if a[i] > a[i-1]:\n if mount[i] != 0 and mount[i] != a[i]:\n print(0)\n exit()\n else:\n mount[i] = a[i]\n if b[n-i-1] > b[n-i]:\n if mount[n-i-1] != 0 and mount[n-i-1] != b[n-i-1]:\n print(0)\n exit()\n else:\n mount[n-i-1] = b[n-i-1]\nfor i in range(n):\n if mount[i] == 0:\n dx = 1\n while mount[i+dx] == 0:\n dx += 1\n this = min(mount[i-1],mount[i+dx])\n pat = pat*(this**dx)%mod\n for j in range(dx):\n mount[i+j] = this\na2 = [0]*n\nb2 = [0]*n\na2[0] = mount[0]\nb2[-1] = mount[-1]\nfor i in range(1,n):\n a[i] = max(mount[i],a[i-1])\n b[n-i-1] = max(mount[n-i-1],b[n-i])\nif a != a2 or b != b2:\n print(0)\nelse:\n print(pat)", "code2": "n = int(input())\nmount = [0]*n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nmount[0] = a[0]\nmount[-1] = b[-1]\npat = 1\nmod = 10**9+7\nfor i in range(1,n):\n if a[i] > a[i-1]:\n if mount[i] != 0 and mount[i] != a[i]:\n print(0)\n exit()\n else:\n mount[i] = a[i]\n if b[n-i-1] > b[n-i]:\n if mount[n-i-1] != 0 and mount[n-i-1] != b[n-i-1]:\n print(0)\n exit()\n else:\n mount[n-i-1] = b[n-i-1]\nfor i in range(n):\n if mount[i] == 0:\n dx = 1\n while mount[i+dx] == 0:\n dx += 1\n this = min(mount[i-1],mount[i+dx])\n pat = pat*(this**dx)%mod\n for j in range(dx):\n mount[i+j] = this\na2 = [0]*n\nb2 = [0]*n\na2[0] = mount[0]\nb2[-1] = mount[-1]\nfor i in range(1,n):\n a2[i] = max(mount[i],a2[i-1])\n b2[n-i-1] = max(mount[n-i-1],b2[n-i])\nif a != a2 or b != b2:\n print(0)\nelse:\n print(pat)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553543493", "date2": "1553543706", "bleu_score": "0.9883447644745486", "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, 0, 1, 0], "code1_test_score": 101, "total_score": 104, "input": "10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n", "actual_output": "0\n", "expected_output": "884111967\n", "anno_code": ["n = int(input()) # (0): n=10\nmount = [0]*n # (1): mount=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\na = list(map(int, input().split())) # (2): a=[1, 3776, 3776, 8848, 8848, 8848, 8848, 8848, 8848, 8848]\nb = list(map(int, input().split())) # (3): b=[8848, 8848, 8848, 8848, 8848, 8848, 8848, 8848, 3776, 5]\nmount[0] = a[0] # (4): mount=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nmount[-1] = b[-1] # (5): mount=[1, 0, 0, 0, 0, 0, 0, 0, 0, 5]\npat = 1 # (6): pat=1\nmod = 10**9+7 # (7): mod=1000000007\nfor i in range(1,n): # (8): i=1 (15): i=2 ... (43): NO CHANGE\n if a[i] > a[i-1]: # (9): NO CHANGE (16): NO CHANGE ... (41): NO CHANGE\n if mount[i] != 0 and mount[i] != a[i]: # (10): NO CHANGE (22): NO CHANGE\n print(0)\n exit()\n else:\n mount[i] = a[i] # (11): mount=[1, 3776, 0, 0, 0, 0, 0, 0, 0, 5] (23): mount=[1, 3776, 0, 8848, 0, 0, 0, 8848, 3776, 5]\n if b[n-i-1] > b[n-i]: # (12): NO CHANGE (17): NO CHANGE ... (42): NO CHANGE\n if mount[n-i-1] != 0 and mount[n-i-1] != b[n-i-1]: # (13): NO CHANGE (18): NO CHANGE\n print(0)\n exit()\n else:\n mount[n-i-1] = b[n-i-1] # (14): mount=[1, 3776, 0, 0, 0, 0, 0, 0, 3776, 5] (19): mount=[1, 3776, 0, 0, 0, 0, 0, 8848, 3776, 5]\nfor i in range(n): # (44): i=0 (46): i=1 ... (86): NO CHANGE\n if mount[i] == 0: # (45): NO CHANGE (47): NO CHANGE ... (85): NO CHANGE\n dx = 1 # (50): dx=1 (61): NO CHANGE\n while mount[i+dx] == 0: # (51): NO CHANGE (62): NO CHANGE ... (66): NO CHANGE\n dx += 1 # (63): dx=2 (65): dx=3\n this = min(mount[i-1],mount[i+dx]) # (52): this=3776 (67): this=8848\n pat = pat*(this**dx)%mod # (53): pat=3776 (68): pat=884111967\n for j in range(dx): # (54): j=0 (56): NO CHANGE ... (75): NO CHANGE\n mount[i+j] = this # (55): mount=[1, 3776, 3776, 8848, 0, 0, 0, 8848, 3776, 5] (70): mount=[1, 3776, 3776, 8848, 8848, 0, 0, 8848, 3776, 5] ... (74): mount=[1, 3776, 3776, 8848, 8848, 8848, 8848, 8848, 3776, 5]\na2 = [0]*n # (87): a2=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nb2 = [0]*n # (88): b2=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\na2[0] = mount[0] # (89): a2=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nb2[-1] = mount[-1] # (90): b2=[0, 0, 0, 0, 0, 0, 0, 0, 0, 5]\nfor i in range(1,n): # (91): i=1 (94): i=2 ... (118): NO CHANGE\n a[i] = max(mount[i],a[i-1]) # (92): NO CHANGE (95): NO CHANGE ... (116): NO CHANGE\n b[n-i-1] = max(mount[n-i-1],b[n-i]) # (93): NO CHANGE (96): NO CHANGE ... (117): NO CHANGE\nif a != a2 or b != b2: # (119): NO CHANGE\n print(0)\nelse:\n print(pat)"], "anno_status": [false], "diff_content": " n = int(input())\n mount = [0]*n\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n mount[0] = a[0]\n mount[-1] = b[-1]\n pat = 1\n mod = 10**9+7\n for i in range(1,n):\n if a[i] > a[i-1]:\n if mount[i] != 0 and mount[i] != a[i]:\n print(0)\n exit()\n else:\n mount[i] = a[i]\n if b[n-i-1] > b[n-i]:\n if mount[n-i-1] != 0 and mount[n-i-1] != b[n-i-1]:\n print(0)\n exit()\n else:\n mount[n-i-1] = b[n-i-1]\n for i in range(n):\n if mount[i] == 0:\n dx = 1\n while mount[i+dx] == 0:\n dx += 1\n this = min(mount[i-1],mount[i+dx])\n pat = pat*(this**dx)%mod\n for j in range(dx):\n mount[i+j] = this\n a2 = [0]*n\n b2 = [0]*n\n a2[0] = mount[0]\n b2[-1] = mount[-1]\n for i in range(1,n):\n- a[i] = max(mount[i],a[i-1])\n- b[n-i-1] = max(mount[n-i-1],b[n-i])\n+ a2[i] = max(mount[i],a2[i-1])\n+ b2[n-i-1] = max(mount[n-i-1],b2[n-i])\n if a != a2 or b != b2:\n print(0)\n else:\n print(pat)\n", "FL_content": " n = int(input())\n mount = [0]*n\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n mount[0] = a[0]\n mount[-1] = b[-1]\n pat = 1\n mod = 10**9+7\n for i in range(1,n):\n if a[i] > a[i-1]:\n if mount[i] != 0 and mount[i] != a[i]:\n print(0)\n exit()\n else:\n mount[i] = a[i]\n if b[n-i-1] > b[n-i]:\n if mount[n-i-1] != 0 and mount[n-i-1] != b[n-i-1]:\n print(0)\n exit()\n else:\n mount[n-i-1] = b[n-i-1]\n for i in range(n):\n if mount[i] == 0:\n dx = 1\n while mount[i+dx] == 0:\n dx += 1\n this = min(mount[i-1],mount[i+dx])\n pat = pat*(this**dx)%mod\n for j in range(dx):\n mount[i+j] = this\n a2 = [0]*n\n b2 = [0]*n\n a2[0] = mount[0]\n b2[-1] = mount[-1]\n for i in range(1,n):\n- a[i] = max(mount[i],a[i-1])\n- b[n-i-1] = max(mount[n-i-1],b[n-i])\n if a != a2 or b != b2:\n print(0)\n else:\n print(pat)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 41 }, { "user_id": "u828766688", "problem_id": "p03677", "submission1_id": "s642921527", "submission2_id": "s019783640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nn,m = map(int,input().split())\n\nlis = [0] * m\n\nstate = [0] * n\n\na = list(map(int,input().split()))\n\nstart = [ [] for i in range(m) ]\nend = [ [] for i in range(m)]\n\nallsum = 0\nfor i in range(n-1):\n\n if a[i+1] == (a[i]+1)%m:\n continue\n\n start[a[i] % m].append(i)\n end[(a[i+1]-1) % m].append(i)\n\n allsum += (a[i+1]-a[i]) % m\n\n\nimosnum = 0\nplus = 0\n\n\n\nfor i in range(2*m):\n\n plus += imosnum\n\n lis[i%m] += plus\n\n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n\n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n\n \n\nprint (allsum - max(lis))\n", "code2": "\n\n\nn,m = map(int,input().split())\n\nlis = [0] * m\n\nstate = [0] * n\n\na = list(map(int,input().split()))\nfor i in range(n):\n a[i] -= 1\n\nstart = [ [] for i in range(m) ]\nend = [ [] for i in range(m)]\n\nallsum = 0\nfor i in range(n-1):\n\n allsum += (a[i+1]-a[i]) % m\n if a[i+1] == (a[i]+1)%m:\n continue\n\n start[(a[i]+1) % m].append(i)\n end[a[i+1] % m].append(i)\n\n \n\n\nimosnum = 0\nplus = 0\n\n\n\nfor i in range(2*m):\n\n plus += imosnum\n\n lis[i%m] += plus\n\n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n\n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n\n \n\nif (allsum - max(lis) < 0):\n print (asxacscd)\n\nprint (allsum - max(lis))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583776964", "date2": "1583778015", "bleu_score": "0.8831977398523962", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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], "code1_test_score": 96, "total_score": 102, "input": "10 10\n6 7 3 7 10 5 4 5 2 1\n", "actual_output": "22\n", "expected_output": "24\n\n", "anno_code": ["\n\n\nn,m = map(int,input().split()) # (0): n=10, m=10\n\nlis = [0] * m # (1): lis=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nstate = [0] * n # (2): state=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\na = list(map(int,input().split())) # (3): a=[6, 7, 3, 7, 10, 5, 4, 5, 2, 1]\n\nstart = [ [] for i in range(m) ] # (4): start\nend = [ [] for i in range(m)] # (5): end\n\nallsum = 0 # (6): allsum=0\nfor i in range(n-1): # (7): i=0 (10): i=1 ... (48): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n if a[i+1] == (a[i]+1)%m: # (8): NO CHANGE (11): NO CHANGE ... (44): start=[[4], [], [], [2], [], [5, 7], [], [1, 3], [], []], end\n continue # (9): NO CHANGE (37): start=[[4], [], [], [2], [], [5], [], [1, 3], [], []], end\n\n start[a[i] % m].append(i) # (12): start (17): start, end ... (45): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n end[(a[i+1]-1) % m].append(i) # (13): start=[[], [], [], [], [], [], [], [1], [], []], end (18): start, end ... (46): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n allsum += (a[i+1]-a[i]) % m # (14): start=[[], [], [], [], [], [], [], [1], [], []], end=[[], [], [1], [], [], [], [], [], [], []], allsum=6 (19): start=[[], [], [], [2], [], [], [], [1], [], []], end=[[], [], [1], [], [], [], [2], [], [], []], allsum=10 ... (47): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, allsum=43\n\n\nimosnum = 0 # (49): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=0\nplus = 0 # (50): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=0\n\n\n\nfor i in range(2*m): # (51): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, i=0 (62): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, i=1 ... (242): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n plus += imosnum # (52): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (63): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=1 ... (236): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n lis[i%m] += plus # (53): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (64): lis=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (237): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n for j in end[i%m]: # (54): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, j=8 (56): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (240): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n if state[j] == 1: # (55): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (66): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (239): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n plus -= ((a[j+1]-(a[j]+1))%m) # (96): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=3 (119): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=6 ... (191): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=0\n state[j] = 2 # (97): state=[0, 0, 1, 0, 2, 0, 0, 0, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (120): state=[0, 0, 2, 0, 2, 1, 0, 1, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (192): state=[0, 2, 2, 2, 2, 2, 0, 2, 2, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n imosnum -= 1 # (98): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=2 (121): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=3 ... (193): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=0\n\n for j in start[i%m]: # (57): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, j=4 (61): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (241): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n if state[j] == 0: # (58): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (76): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (228): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n imosnum += 1 # (59): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=1 (77): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=2 ... (134): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=5\n state[j] = 1 # (60): state=[0, 0, 0, 0, 1, 0, 0, 0, 0, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (78): state=[0, 0, 0, 0, 1, 0, 0, 0, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (135): state=[0, 1, 2, 1, 2, 1, 0, 1, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n \n\nprint (allsum - max(lis))\n"], "anno_status": [false], "diff_content": " \n \n \n n,m = map(int,input().split())\n \n lis = [0] * m\n \n state = [0] * n\n \n a = list(map(int,input().split()))\n+for i in range(n):\n+ a[i] -= 1\n \n start = [ [] for i in range(m) ]\n end = [ [] for i in range(m)]\n \n allsum = 0\n for i in range(n-1):\n \n+ allsum += (a[i+1]-a[i]) % m\n if a[i+1] == (a[i]+1)%m:\n continue\n \n- start[a[i] % m].append(i)\n- end[(a[i+1]-1) % m].append(i)\n+ start[(a[i]+1) % m].append(i)\n+ end[a[i+1] % m].append(i)\n \n- allsum += (a[i+1]-a[i]) % m\n+ \n \n \n imosnum = 0\n plus = 0\n \n \n \n for i in range(2*m):\n \n plus += imosnum\n \n lis[i%m] += plus\n \n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n \n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n \n \n \n-print (allsum - max(lis))\n+if (allsum - max(lis) < 0):\n+ print (asxacscd)\n \n+print (allsum - max(lis))\n", "FL_content": " \n \n \n n,m = map(int,input().split())\n \n lis = [0] * m\n \n state = [0] * n\n \n a = list(map(int,input().split()))\n \n start = [ [] for i in range(m) ]\n end = [ [] for i in range(m)]\n \n allsum = 0\n for i in range(n-1):\n \n if a[i+1] == (a[i]+1)%m:\n continue\n \n- start[a[i] % m].append(i)\n- end[(a[i+1]-1) % m].append(i)\n \n- allsum += (a[i+1]-a[i]) % m\n \n \n imosnum = 0\n plus = 0\n \n \n \n for i in range(2*m):\n \n plus += imosnum\n \n lis[i%m] += plus\n \n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n \n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n \n \n \n-print (allsum - max(lis))\n \n", "added_lines": 9, "removed_lines": 4, "code1_lines": 52 }, { "user_id": "u754022296", "problem_id": "p03677", "submission1_id": "s726192420", "submission2_id": "s259581698", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nfrom itertools import accumulate\n\nn, m = map(int, input().split())\nA = list(map(int, input().split()))\nL = [0]*(2*m)\nB = []\ncnt = 0\nfor i in range(n-1):\n a, b = A[i], A[i+1]\n a -= 1\n b -= 1\n if a < b:\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n a += m\n b += m\n L[a+2] += 1\n if b < 2*m-1:\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n else:\n b += m\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\nL = list(accumulate(L))\nfor i, b in B:\n L[i] += b\nL = list(accumulate(L))\nans = cnt - max(L)\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\nfrom itertools import accumulate\n\nn, m = map(int, input().split())\nA = list(map(int, input().split()))\nL = [0]*(2*m)\nB = []\ncnt = 0\nfor i in range(n-1):\n a, b = A[i], A[i+1]\n a -= 1\n b -= 1\n if a < b:\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n else:\n b += m\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\nL = list(accumulate(L))\nfor i, b in B:\n L[i] += b\nL = list(accumulate(L))\nc = 0\nfor i in range(m):\n c = max(c, L[i]+L[m+i])\nans = cnt - c\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591367357", "date2": "1591371679", "bleu_score": "0.8533103698650533", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "10 10\n10 9 8 7 6 7 4 3 2 1\n", "actual_output": "41\n", "expected_output": "39\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, accumulate=\nfrom itertools import accumulate\n\nn, m = map(int, input().split()) # (1): n=10, m=10\nA = list(map(int, input().split())) # (2): A=[10, 9, 8, 7, 6, 7, 4, 3, 2, 1]\nL = [0]*(2*m) # (3): L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nB = [] # (4): B=[]\ncnt = 0 # (5): cnt=0\nfor i in range(n-1): # (6): i=0 (17): i=1 ... (102): NO CHANGE\n a, b = A[i], A[i+1] # (7): a=10, b=9 (18): b=8 ... (92): b=1\n a -= 1 # (8): a=9 (19): a=8 ... (93): a=1\n b -= 1 # (9): b=8 (20): b=7 ... (94): b=0\n if a < b: # (10): NO CHANGE (21): NO CHANGE ... (95): NO CHANGE\n cnt += b-a # (55): cnt=37\n if b-a == 1: # (56): NO CHANGE\n continue # (57): NO CHANGE\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n a += m\n b += m\n L[a+2] += 1\n if b < 2*m-1:\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n else:\n b += m # (11): b=18 (22): b=17 ... (96): b=10\n cnt += b-a # (12): cnt=9 (23): cnt=18 ... (97): cnt=71\n if b-a == 1: # (13): NO CHANGE (24): NO CHANGE ... (98): NO CHANGE\n continue\n L[a+2] += 1 # (14): L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] (25): L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, -1] ... (99): L=[0, 0, 0, 1, 1, 1, 0, 0, 2, 1, 1, 1, -1, -1, -1, 0, -1, -1, -1, -1]\n L[b+1] += -1 # (15): L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -1] (26): L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, -1, -1] ... (100): L=[0, 0, 0, 1, 1, 1, 0, 0, 2, 1, 1, 0, -1, -1, -1, 0, -1, -1, -1, -1]\n B.append((b+1, -(b-a-1))) # (16): B=[(19, -8)] (27): B=[(19, -8), (18, -8)] ... (101): B=[(19, -8), (18, -8), (17, -8), (16, -8), (14, -6), (13, -8), (12, -8), (11, -8)]\nL = list(accumulate(L)) # (103): L=[0, 0, 0, 1, 2, 3, 3, 3, 5, 6, 7, 7, 6, 5, 4, 4, 3, 2, 1, 0]\nfor i, b in B: # (104): i=19, b=-8 (106): i=18 ... (120): NO CHANGE\n L[i] += b # (105): L=[0, 0, 0, 1, 2, 3, 3, 3, 5, 6, 7, 7, 6, 5, 4, 4, 3, 2, 1, -8] (107): L=[0, 0, 0, 1, 2, 3, 3, 3, 5, 6, 7, 7, 6, 5, 4, 4, 3, 2, -7, -8] ... (119): L=[0, 0, 0, 1, 2, 3, 3, 3, 5, 6, 7, -1, -2, -3, -2, 4, -5, -6, -7, -8]\nL = list(accumulate(L)) # (121): L=[0, 0, 0, 1, 3, 6, 9, 12, 17, 23, 30, 29, 27, 24, 22, 26, 21, 15, 8, 0]\nans = cnt - max(L) # (122): ans=41\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n from itertools import accumulate\n \n n, m = map(int, input().split())\n A = list(map(int, input().split()))\n L = [0]*(2*m)\n B = []\n cnt = 0\n for i in range(n-1):\n a, b = A[i], A[i+1]\n a -= 1\n b -= 1\n if a < b:\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n- a += m\n- b += m\n- L[a+2] += 1\n- if b < 2*m-1:\n- L[b+1] += -1\n- B.append((b+1, -(b-a-1)))\n else:\n b += m\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n L = list(accumulate(L))\n for i, b in B:\n L[i] += b\n L = list(accumulate(L))\n-ans = cnt - max(L)\n+c = 0\n+for i in range(m):\n+ c = max(c, L[i]+L[m+i])\n+ans = cnt - c\n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n from itertools import accumulate\n \n n, m = map(int, input().split())\n A = list(map(int, input().split()))\n L = [0]*(2*m)\n B = []\n cnt = 0\n for i in range(n-1):\n a, b = A[i], A[i+1]\n a -= 1\n b -= 1\n if a < b:\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n- a += m\n- b += m\n- L[a+2] += 1\n- if b < 2*m-1:\n- L[b+1] += -1\n- B.append((b+1, -(b-a-1)))\n else:\n b += m\n cnt += b-a\n if b-a == 1:\n continue\n L[a+2] += 1\n L[b+1] += -1\n B.append((b+1, -(b-a-1)))\n L = list(accumulate(L))\n for i, b in B:\n L[i] += b\n L = list(accumulate(L))\n-ans = cnt - max(L)\n print(ans)\n", "added_lines": 4, "removed_lines": 7, "code1_lines": 40 }, { "user_id": "u828766688", "problem_id": "p03677", "submission1_id": "s659794092", "submission2_id": "s019783640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nn,m = map(int,input().split())\n\nlis = [0] * m\n\nstate = [0] * n\n\na = list(map(int,input().split()))\n\nstart = [ [] for i in range(m) ]\nend = [ [] for i in range(m)]\n\nallsum = 0\nfor i in range(n-1):\n\n if a[i+1] == a[i]+1:\n continue\n\n start[a[i] % m].append(i)\n end[(a[i+1]-1) % m].append(i)\n\n allsum += (a[i+1]-a[i]) % m\n\n\nimosnum = 0\nplus = 0\n\n\n\nfor i in range(2*m):\n\n plus += imosnum\n\n lis[i%m] += plus\n\n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n\n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n\n \n\nprint (allsum - max(lis))", "code2": "\n\n\nn,m = map(int,input().split())\n\nlis = [0] * m\n\nstate = [0] * n\n\na = list(map(int,input().split()))\nfor i in range(n):\n a[i] -= 1\n\nstart = [ [] for i in range(m) ]\nend = [ [] for i in range(m)]\n\nallsum = 0\nfor i in range(n-1):\n\n allsum += (a[i+1]-a[i]) % m\n if a[i+1] == (a[i]+1)%m:\n continue\n\n start[(a[i]+1) % m].append(i)\n end[a[i+1] % m].append(i)\n\n \n\n\nimosnum = 0\nplus = 0\n\n\n\nfor i in range(2*m):\n\n plus += imosnum\n\n lis[i%m] += plus\n\n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n\n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n\n \n\nif (allsum - max(lis) < 0):\n print (asxacscd)\n\nprint (allsum - max(lis))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583776821", "date2": "1583778015", "bleu_score": "0.8747024190283923", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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], "code1_test_score": 96, "total_score": 102, "input": "10 10\n6 7 3 7 10 5 4 5 2 1\n", "actual_output": "22\n", "expected_output": "24\n\n", "anno_code": ["\n\n\nn,m = map(int,input().split()) # (0): n=10, m=10\n\nlis = [0] * m # (1): lis=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nstate = [0] * n # (2): state=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\na = list(map(int,input().split())) # (3): a=[6, 7, 3, 7, 10, 5, 4, 5, 2, 1]\n\nstart = [ [] for i in range(m) ] # (4): start\nend = [ [] for i in range(m)] # (5): end\n\nallsum = 0 # (6): allsum=0\nfor i in range(n-1): # (7): i=0 (10): i=1 ... (48): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n if a[i+1] == a[i]+1: # (8): NO CHANGE (11): NO CHANGE ... (44): start=[[4], [], [], [2], [], [5, 7], [], [1, 3], [], []], end\n continue # (9): NO CHANGE (37): start=[[4], [], [], [2], [], [5], [], [1, 3], [], []], end\n\n start[a[i] % m].append(i) # (12): start (17): start, end ... (45): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n end[(a[i+1]-1) % m].append(i) # (13): start=[[], [], [], [], [], [], [], [1], [], []], end (18): start, end ... (46): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n allsum += (a[i+1]-a[i]) % m # (14): start=[[], [], [], [], [], [], [], [1], [], []], end=[[], [], [1], [], [], [], [], [], [], []], allsum=6 (19): start=[[], [], [], [2], [], [], [], [1], [], []], end=[[], [], [1], [], [], [], [2], [], [], []], allsum=10 ... (47): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, allsum=43\n\n\nimosnum = 0 # (49): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=0\nplus = 0 # (50): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=0\n\n\n\nfor i in range(2*m): # (51): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, i=0 (62): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, i=1 ... (242): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n plus += imosnum # (52): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (63): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=1 ... (236): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n lis[i%m] += plus # (53): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (64): lis=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (237): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n for j in end[i%m]: # (54): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, j=8 (56): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (240): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n if state[j] == 1: # (55): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (66): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (239): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n plus -= ((a[j+1]-(a[j]+1))%m) # (96): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=3 (119): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=6 ... (191): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, plus=0\n state[j] = 2 # (97): state=[0, 0, 1, 0, 2, 0, 0, 0, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (120): state=[0, 0, 2, 0, 2, 1, 0, 1, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (192): state=[0, 2, 2, 2, 2, 2, 0, 2, 2, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n imosnum -= 1 # (98): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=2 (121): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=3 ... (193): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=0\n\n for j in start[i%m]: # (57): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, j=4 (61): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (241): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n if state[j] == 0: # (58): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (76): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (228): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n imosnum += 1 # (59): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=1 (77): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=2 ... (134): start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end, imosnum=5\n state[j] = 1 # (60): state=[0, 0, 0, 0, 1, 0, 0, 0, 0, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end (78): state=[0, 0, 0, 0, 1, 0, 0, 0, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end ... (135): state=[0, 1, 2, 1, 2, 1, 0, 1, 1, 0], start=[[4], [], [8], [2], [], [5, 7], [], [1, 3], [], []], end\n\n \n\nprint (allsum - max(lis))"], "anno_status": [false], "diff_content": " \n \n \n n,m = map(int,input().split())\n \n lis = [0] * m\n \n state = [0] * n\n \n a = list(map(int,input().split()))\n+for i in range(n):\n+ a[i] -= 1\n \n start = [ [] for i in range(m) ]\n end = [ [] for i in range(m)]\n \n allsum = 0\n for i in range(n-1):\n \n- if a[i+1] == a[i]+1:\n+ allsum += (a[i+1]-a[i]) % m\n+ if a[i+1] == (a[i]+1)%m:\n continue\n \n- start[a[i] % m].append(i)\n- end[(a[i+1]-1) % m].append(i)\n+ start[(a[i]+1) % m].append(i)\n+ end[a[i+1] % m].append(i)\n \n- allsum += (a[i+1]-a[i]) % m\n+ \n \n \n imosnum = 0\n plus = 0\n \n \n \n for i in range(2*m):\n \n plus += imosnum\n \n lis[i%m] += plus\n \n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n \n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n \n \n \n+if (allsum - max(lis) < 0):\n+ print (asxacscd)\n+\n print (allsum - max(lis))\n", "FL_content": " \n \n \n n,m = map(int,input().split())\n \n lis = [0] * m\n \n state = [0] * n\n \n a = list(map(int,input().split()))\n \n start = [ [] for i in range(m) ]\n end = [ [] for i in range(m)]\n \n allsum = 0\n for i in range(n-1):\n \n- if a[i+1] == a[i]+1:\n continue\n \n- start[a[i] % m].append(i)\n- end[(a[i+1]-1) % m].append(i)\n \n- allsum += (a[i+1]-a[i]) % m\n \n \n imosnum = 0\n plus = 0\n \n \n \n for i in range(2*m):\n \n plus += imosnum\n \n lis[i%m] += plus\n \n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n \n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n \n \n \n print (allsum - max(lis))\n", "added_lines": 10, "removed_lines": 4, "code1_lines": 51 }, { "user_id": "u828766688", "problem_id": "p03677", "submission1_id": "s961640285", "submission2_id": "s019783640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nn,m = map(int,input().split())\n\nlis = [0] * m\n\nstate = [0] * n\n\na = list(map(int,input().split()))\n\nstart = [ [] for i in range(m) ]\nend = [ [] for i in range(m)]\n\nallsum = 0\nfor i in range(n-1):\n\n start[a[i] % m].append(i)\n end[(a[i+1]-1) % m].append(i)\n\n allsum += (a[i+1]-a[i]) % m\n\n\nimosnum = 0\nplus = 0\n\n\n\nfor i in range(2*m):\n\n plus += imosnum\n\n lis[i%m] += plus\n\n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-a[j])%m-1)\n state[j] = 2\n imosnum -= 1\n\n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n\n \n\nprint (allsum - max(lis))", "code2": "\n\n\nn,m = map(int,input().split())\n\nlis = [0] * m\n\nstate = [0] * n\n\na = list(map(int,input().split()))\nfor i in range(n):\n a[i] -= 1\n\nstart = [ [] for i in range(m) ]\nend = [ [] for i in range(m)]\n\nallsum = 0\nfor i in range(n-1):\n\n allsum += (a[i+1]-a[i]) % m\n if a[i+1] == (a[i]+1)%m:\n continue\n\n start[(a[i]+1) % m].append(i)\n end[a[i+1] % m].append(i)\n\n \n\n\nimosnum = 0\nplus = 0\n\n\n\nfor i in range(2*m):\n\n plus += imosnum\n\n lis[i%m] += plus\n\n for j in end[i%m]:\n if state[j] == 1:\n plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n\n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n\n \n\nif (allsum - max(lis) < 0):\n print (asxacscd)\n\nprint (allsum - max(lis))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583776630", "date2": "1583778015", "bleu_score": "0.8137674338340117", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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], "code1_test_score": 96, "total_score": 102, "input": "10 10\n3 7 3 7 10 5 4 5 2 1\n", "actual_output": "14\n", "expected_output": "27\n\n", "anno_code": ["\n\n\nn,m = map(int,input().split()) # (0): n=10, m=10\n\nlis = [0] * m # (1): lis=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nstate = [0] * n # (2): state=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\na = list(map(int,input().split())) # (3): a=[3, 7, 3, 7, 10, 5, 4, 5, 2, 1]\n\nstart = [ [] for i in range(m) ] # (4): start\nend = [ [] for i in range(m)] # (5): end\n\nallsum = 0 # (6): allsum=0\nfor i in range(n-1): # (7): i=0 (11): start=[[], [], [], [0], [], [], [], [], [], []], end, i=1 ... (43): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n\n start[a[i] % m].append(i) # (8): start (12): start, end ... (40): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n end[(a[i+1]-1) % m].append(i) # (9): start=[[], [], [], [0], [], [], [], [], [], []], end (13): start, end ... (41): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n\n allsum += (a[i+1]-a[i]) % m # (10): start=[[], [], [], [0], [], [], [], [], [], []], end=[[], [], [], [], [], [], [0], [], [], []], allsum=4 (14): start=[[], [], [], [0], [], [], [], [1], [], []], end=[[], [], [1], [], [], [], [0], [], [], []], allsum=10 ... (42): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, allsum=48\n\n\nimosnum = 0 # (44): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, imosnum=0\nplus = 0 # (45): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, plus=0\n\n\n\nfor i in range(2*m): # (46): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, i=0 (57): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, i=1 ... (263): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n\n plus += imosnum # (47): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end (58): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, plus=1 ... (257): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n\n lis[i%m] += plus # (48): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end (59): lis=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end ... (258): lis=[27, 24, 22, 21, 18, 18, 24, 22, 28, 34], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n\n for j in end[i%m]: # (49): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, j=8 (51): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end ... (261): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n if state[j] == 1: # (50): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end (61): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end ... (260): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n plus -= ((a[j+1]-a[j])%m-1) # (95): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, plus=4 (124): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, plus=11 ... (217): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n state[j] = 2 # (96): state=[1, 0, 1, 0, 2, 0, 0, 0, 1, 0], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end (125): state=[2, 0, 1, 0, 2, 1, 1, 1, 1, 0], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end ... (218): state=[2, 2, 2, 2, 2, 2, 2, 2, 2, 0], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n imosnum -= 1 # (97): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, imosnum=3 (126): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, imosnum=5 ... (219): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, imosnum=0\n\n for j in start[i%m]: # (52): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, j=4 (56): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end ... (262): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n if state[j] == 0: # (53): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end (71): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end ... (249): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n imosnum += 1 # (54): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, imosnum=1 (72): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, imosnum=2 ... (144): start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end, imosnum=6\n state[j] = 1 # (55): state=[0, 0, 0, 0, 1, 0, 0, 0, 0, 0], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end (73): state=[0, 0, 0, 0, 1, 0, 0, 0, 1, 0], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end ... (145): state=[2, 1, 2, 1, 2, 1, 1, 1, 1, 0], start=[[4], [], [8], [0, 2], [6], [5, 7], [], [1, 3], [], []], end\n\n \n\nprint (allsum - max(lis))"], "anno_status": [false], "diff_content": " \n \n \n n,m = map(int,input().split())\n \n lis = [0] * m\n \n state = [0] * n\n \n a = list(map(int,input().split()))\n+for i in range(n):\n+ a[i] -= 1\n \n start = [ [] for i in range(m) ]\n end = [ [] for i in range(m)]\n \n allsum = 0\n for i in range(n-1):\n \n- start[a[i] % m].append(i)\n- end[(a[i+1]-1) % m].append(i)\n-\n allsum += (a[i+1]-a[i]) % m\n+ if a[i+1] == (a[i]+1)%m:\n+ continue\n+\n+ start[(a[i]+1) % m].append(i)\n+ end[a[i+1] % m].append(i)\n+\n+ \n \n \n imosnum = 0\n plus = 0\n \n \n \n for i in range(2*m):\n \n plus += imosnum\n \n lis[i%m] += plus\n \n for j in end[i%m]:\n if state[j] == 1:\n- plus -= ((a[j+1]-a[j])%m-1)\n+ plus -= ((a[j+1]-(a[j]+1))%m)\n state[j] = 2\n imosnum -= 1\n \n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n \n \n \n+if (allsum - max(lis) < 0):\n+ print (asxacscd)\n+\n print (allsum - max(lis))\n", "FL_content": " \n \n \n n,m = map(int,input().split())\n \n lis = [0] * m\n \n state = [0] * n\n \n a = list(map(int,input().split()))\n \n start = [ [] for i in range(m) ]\n end = [ [] for i in range(m)]\n \n allsum = 0\n for i in range(n-1):\n \n- start[a[i] % m].append(i)\n- end[(a[i+1]-1) % m].append(i)\n-\n allsum += (a[i+1]-a[i]) % m\n \n \n imosnum = 0\n plus = 0\n \n \n \n for i in range(2*m):\n \n plus += imosnum\n \n lis[i%m] += plus\n \n for j in end[i%m]:\n if state[j] == 1:\n- plus -= ((a[j+1]-a[j])%m-1)\n state[j] = 2\n imosnum -= 1\n \n for j in start[i%m]:\n if state[j] == 0:\n imosnum += 1\n state[j] = 1\n \n \n \n print (allsum - max(lis))\n", "added_lines": 13, "removed_lines": 4, "code1_lines": 48 }, { "user_id": "u163320134", "problem_id": "p03677", "submission1_id": "s657822891", "submission2_id": "s793220412", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m=map(int,input().split())\narr=list(map(int,input().split()))\nimos1=[0]*(m*2+2)\nimos2=[0]*(m*2+2)\nimos3=[0]*(m*2+2)\nfor i in range(n-1):\n cost=(m+arr[i+1]-arr[i])%m\n if arr[i]1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nans=-1\nval=0\nfor i in range(m):\n if val>imos[i]:\n ans=i\n val=imos[i]\n\nval=0\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n if (g-s)%m>1:\n if g>=s:\n if ans>s:\n val+=1+(g-ans)%m\n else:\n val+=(g-ans)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n\n\nprint(val)", "code2": "n,m=map(int,input().split())\na=list(map(int,input().split()))\na=[a[i]-1 for i in range(n)]\n\nimos=[0 for i in range(m+1)]\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n if val>1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nans=-1\nval=0\nfor i in range(m):\n if val>=imos[i]:\n ans=i\n val=imos[i]\n\nval=0\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n if (g-s)%m>1:\n if g>=s:\n if g>=ans>s:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n\n\nprint(val)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589051549", "date2": "1589051978", "bleu_score": "0.9903992237619288", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 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, 0, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 102, "input": "4 43\n6 9 3 14 2 16 4 0 4 2\n", "actual_output": "18\n", "expected_output": "15\n\n", "anno_code": ["n,m=map(int,input().split()) # (0): n=4, m=43\na=list(map(int,input().split())) # (1): a=[6, 9, 3, 14, 2, 16, 4, 0, 4, 2]\na=[a[i]-1 for i in range(n)] # (2): a=[5, 8, 2, 13]\n\nimos=[0 for i in range(m+1)] # (3): imos=[0, 0, ..., 0, 0]\nfor i in range(0,n-1): # (4): i=0 (14): i=1 ... (36): NO CHANGE\n s,g=a[i],a[i+1] # (5): s=5, g=8 (15): s=8, g=2 (27): s=2, g=13\n val=(g-s)%m # (6): val=3 (16): val=37 (28): val=11\n if val>1: # (7): NO CHANGE (17): NO CHANGE (29): NO CHANGE\n s=(s+2)%m # (8): s=7 (18): s=10 (30): s=4\n if s>g: # (9): NO CHANGE (19): NO CHANGE (31): NO CHANGE\n imos[s]+=-1 # (20): imos=[0, 0, ..., 0, 0]\n imos[m]+=1 # (21): imos=[0, 0, ..., 0, 1]\n imos[0]+=-1 # (22): imos=[-1, 0, ..., 0, 1]\n imos[g+1]+=1 # (23): imos=[-1, 0, ..., 0, 1]\n else:\n imos[s]+=-1 # (10): imos=[0, 0, ..., 0, 0] (32): imos=[-1, 0, ..., 0, 1]\n imos[g+1]+=1 # (11): imos=[0, 0, ..., 0, 0] (33): imos=[-1, 0, ..., 0, 1]\n imos[(g+1)%m]+=val-1 # (12): imos=[0, 0, 0, 0, 0, 0, 0, -1, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (24): imos=[-1, 0, ..., 0, 1] (34): imos=[-1, 0, ..., 0, 1]\n imos[(g+1)%m+1]+=-(val-1) # (13): imos=[0, 0, 0, 0, 0, 0, 0, -1, 0, 3, -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] (25): imos=[-1, 0, ..., 0, 1] (35): imos=[-1, 0, ..., 0, 1]\n\nfor i in range(1,m+1): # (37): i=1 (39): i=2 ... (123): NO CHANGE\n imos[i]+=imos[i-1] # (38): imos=[-1, -1, ..., 0, 1] (40): imos=[-1, -1, ..., 0, 1] ... (122): imos=[-1, -1, ..., -1, 0]\n\nfor i in range(1,m+1): # (124): i=1 (126): i=2 ... (210): NO CHANGE\n imos[i]+=imos[i-1] # (125): imos=[-1, -2, ..., -1, 0] (127): imos=[-1, -2, ..., -1, 0] ... (209): NO CHANGE\n\nans=-1 # (211): ans=-1\nval=0 # (212): val=0\nfor i in range(m): # (213): i=0 (217): i=1 ... (305): NO CHANGE\n if val>imos[i]: # (214): NO CHANGE (218): NO CHANGE ... (304): NO CHANGE\n ans=i # (215): ans=0 (219): ans=1 (223): ans=2\n val=imos[i] # (216): val=-1 (220): val=-2 (224): val=-3\n\nval=0 # (306): val=0\nfor i in range(0,n-1): # (307): i=0 (313): i=1 ... (325): NO CHANGE\n s,g=a[i],a[i+1] # (308): s=5, g=8 (314): s=8, g=2 (320): s=2, g=13\n if (g-s)%m>1: # (309): NO CHANGE (315): NO CHANGE (321): NO CHANGE\n if g>=s: # (310): NO CHANGE (316): NO CHANGE (322): NO CHANGE\n if ans>s: # (311): NO CHANGE (323): NO CHANGE\n val+=1+(g-ans)%m\n else:\n val+=(g-ans)%m # (312): val=6 (324): val=18\n else:\n if ans>s or g>=ans: # (317): NO CHANGE\n val+=1+(g-ans)%m # (318): val=7\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n\n\nprint(val)"], "anno_status": [false], "diff_content": " n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a=[a[i]-1 for i in range(n)]\n \n imos=[0 for i in range(m+1)]\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n if val>1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n ans=-1\n val=0\n for i in range(m):\n- if val>imos[i]:\n+ if val>=imos[i]:\n ans=i\n val=imos[i]\n \n val=0\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n if (g-s)%m>1:\n if g>=s:\n- if ans>s:\n+ if g>=ans>s:\n val+=1+(g-ans)%m\n else:\n- val+=(g-ans)%m\n+ val+=(g-s)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n \n \n print(val)\n+\n", "FL_content": " n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a=[a[i]-1 for i in range(n)]\n \n imos=[0 for i in range(m+1)]\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n if val>1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n ans=-1\n val=0\n for i in range(m):\n- if val>imos[i]:\n ans=i\n val=imos[i]\n \n val=0\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n if (g-s)%m>1:\n if g>=s:\n- if ans>s:\n val+=1+(g-ans)%m\n else:\n- val+=(g-ans)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n \n \n print(val)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 53 }, { "user_id": "u794173881", "problem_id": "p03677", "submission1_id": "s836041544", "submission2_id": "s131207342", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nimos = [0] * (2 * m)\ndiff = [0] * (2 * m)\nres = 0\nfor i in range(n - 1):\n l = a[i] - 1\n r = a[i + 1] - 1\n if l > r:\n r += m\n imos[l + 2] += 1\n imos[r + 1] -= 1\n diff[r + 1] = r - l - 1\n res += r - l\n\nans = [0] * (2 * m)\ntmp = 0\n\nfor i in range(2 * m):\n tmp += imos[i]\n if i - 1 >= 0:\n ans[i] += ans[i - 1] + tmp\n else:\n ans[i] += tmp\n ans[i] -= diff[i]\n \nmax_ = 0\nfor i in range(m):\n max_ = max(max_, ans[i] + ans[i + m])\nprint(res - max_)", "code2": "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nimos = [0] * (2 * m)\ndiff = [0] * (2 * m)\nres = 0\nfor i in range(n - 1):\n l = a[i] - 1\n r = a[i + 1] - 1\n if l > r:\n r += m\n imos[l + 2] += 1\n imos[r + 1] -= 1\n diff[r + 1] += r - l - 1\n res += r - l\n\nans = [0] * (2 * m)\ntmp = 0\nfor i in range(2 * m):\n tmp += imos[i]\n if i - 1 >= 0:\n ans[i] += ans[i - 1] + tmp\n else:\n ans[i] += tmp\n ans[i] -= diff[i]\n \nmax_ = 0\nfor i in range(m):\n max_ = max(max_, ans[i] + ans[i + m])\nprint(res - max_)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1580355547", "date2": "1580355861", "bleu_score": "0.9942607015660915", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 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, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 102, "input": "10 10\n3 7 3 7 10 5 4 5 2 1\n", "actual_output": "23\n", "expected_output": "27\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=10, m=10\na = list(map(int, input().split())) # (1): a=[3, 7, 3, 7, 10, 5, 4, 5, 2, 1]\n\nimos = [0] * (2 * m) # (2): imos=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\ndiff = [0] * (2 * m) # (3): diff=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nres = 0 # (4): res=0\nfor i in range(n - 1): # (5): i=0 (13): i=1 ... (82): NO CHANGE\n l = a[i] - 1 # (6): l=2 (14): l=6 ... (74): l=1\n r = a[i + 1] - 1 # (7): r=6 (15): r=2 ... (75): r=0\n if l > r: # (8): NO CHANGE (16): NO CHANGE ... (76): NO CHANGE\n r += m # (17): r=12 (42): r=14 ... (77): r=10\n imos[l + 2] += 1 # (9): imos=[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (18): imos=[0, 0, 0, 0, 1, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (78): imos=[0, 0, 0, 1, 2, 0, 2, -2, 2, 0, -1, 1, -1, -1, -1, -1, 0, 0, 0, 0]\n imos[r + 1] -= 1 # (10): imos=[0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (19): imos=[0, 0, 0, 0, 1, 0, 0, -1, 1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0] ... (79): imos=[0, 0, 0, 1, 2, 0, 2, -2, 2, 0, -1, 0, -1, -1, -1, -1, 0, 0, 0, 0]\n diff[r + 1] = r - l - 1 # (11): diff=[0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (20): diff=[0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0] ... (80): diff=[0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 2, 8, 6, 5, 8, 4, 0, 0, 0, 0]\n res += r - l # (12): res=4 (21): res=10 ... (81): res=48\n\nans = [0] * (2 * m) # (83): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\ntmp = 0 # (84): tmp=0\n\nfor i in range(2 * m): # (85): i=0 (90): i=1 ... (185): NO CHANGE\n tmp += imos[i] # (86): NO CHANGE (91): NO CHANGE ... (181): NO CHANGE\n if i - 1 >= 0: # (87): NO CHANGE (92): NO CHANGE ... (182): NO CHANGE\n ans[i] += ans[i - 1] + tmp # (93): NO CHANGE (98): NO CHANGE ... (183): ans=[0, 0, 0, 1, 4, 7, 12, 12, 17, 22, 24, 20, 17, 14, 7, 3, 3, 3, 3, 3]\n else:\n ans[i] += tmp # (88): NO CHANGE\n ans[i] -= diff[i] # (89): NO CHANGE (94): NO CHANGE ... (184): NO CHANGE\n \nmax_ = 0 # (186): max_=0\nfor i in range(m): # (187): i=0 (189): i=1 ... (207): NO CHANGE\n max_ = max(max_, ans[i] + ans[i + m]) # (188): max_=24 (190): NO CHANGE ... (206): max_=25\nprint(res - max_)"], "anno_status": [false], "diff_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n \n imos = [0] * (2 * m)\n diff = [0] * (2 * m)\n res = 0\n for i in range(n - 1):\n l = a[i] - 1\n r = a[i + 1] - 1\n if l > r:\n r += m\n imos[l + 2] += 1\n imos[r + 1] -= 1\n- diff[r + 1] = r - l - 1\n+ diff[r + 1] += r - l - 1\n res += r - l\n \n ans = [0] * (2 * m)\n tmp = 0\n-\n for i in range(2 * m):\n tmp += imos[i]\n if i - 1 >= 0:\n ans[i] += ans[i - 1] + tmp\n else:\n ans[i] += tmp\n ans[i] -= diff[i]\n \n max_ = 0\n for i in range(m):\n max_ = max(max_, ans[i] + ans[i + m])\n print(res - max_)\n", "FL_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n \n imos = [0] * (2 * m)\n diff = [0] * (2 * m)\n res = 0\n for i in range(n - 1):\n l = a[i] - 1\n r = a[i + 1] - 1\n if l > r:\n r += m\n imos[l + 2] += 1\n imos[r + 1] -= 1\n- diff[r + 1] = r - l - 1\n res += r - l\n \n ans = [0] * (2 * m)\n tmp = 0\n-\n for i in range(2 * m):\n tmp += imos[i]\n if i - 1 >= 0:\n ans[i] += ans[i - 1] + tmp\n else:\n ans[i] += tmp\n ans[i] -= diff[i]\n \n max_ = 0\n for i in range(m):\n max_ = max(max_, ans[i] + ans[i + m])\n print(res - max_)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 31 }, { "user_id": "u864197622", "problem_id": "p03677", "submission1_id": "s760253586", "submission2_id": "s160697885", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\ndef acc(X): return list(accumulate(X))\n\nN, M = map(int, input().split())\nA = [int(a)-1 for a in input().split()]\n\nX = [0] * M \nY = [0] * M \n\ndef tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n\ndef box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \ndef calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n tri(a+1, M-1)\n tri(0, b)\n box(0, b, b-a-1)\n\nans = 0\nfor i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n\nY = acc(Y)\nX = [X[i] + Y[i] for i in range(M)]\nX = acc(X)\n\nans -= max(X)\nprint(ans)", "code2": "from itertools import accumulate\ndef acc(X): return list(accumulate(X))\n\nN, M = map(int, input().split())\nA = [int(a)-1 for a in input().split()]\n\nX = [0] * M \nY = [0] * M \n\ndef tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n\ndef box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \ndef calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n tri(a+2, M-1)\n tri(0, b)\n box(0, b, -a+M-2)\n \n \n\ndef rev():\n ret = acc(Y)\n ret = [X[i] + ret[i] for i in range(M)]\n return acc(ret)\n \nans = 0\nfor i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n\nX = rev()\n\nans -= max(X)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552492142", "date2": "1552493013", "bleu_score": "0.8914776355313973", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 48, "total_score": 102, "input": "2 19\n10 9 8 7 1 14 4 3 2 1\n", "actual_output": "9\n", "expected_output": "1\n\n", "anno_code": ["from itertools import accumulate\ndef acc(X): return list(accumulate(X))\n\nN, M = map(int, input().split()) # (0): N=2, M=19\nA = [int(a)-1 for a in input().split()] # (1): A=[9, 8, 7, 6, 0, 13, 3, 2, 1, 0]\n\nX = [0] * M # (2): X=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nY = [0] * M # (3): Y=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\ndef tri(l, r, a = 1): # (4): tri=\n if l < M: # (14): NO CHANGE (18): NO CHANGE\n Y[l] += a # (15): NO CHANGE (19): NO CHANGE\n if r + 1 < M: # (16): a=9, b=8 (20): NO CHANGE\n Y[r+1] -= a # (21): NO CHANGE\n X[r+1] -= (r-l+1) * a # (22): a=9, b=8\n\ndef box(l, r, a = 1): # (5): box=\n if l < M: # (24): NO CHANGE\n X[l] += a # (25): NO CHANGE\n if r + 1< M: # (26): NO CHANGE\n X[r+1] -= a # (27): accumulate=, acc=, N=2, M=19, A=[9, 8, 7, 6, 0, 13, 3, 2, 1, 0], X=[-2, 0, 0, 0, 0, 0, 0, 0, 0, -7, 0, 0, 0, 0, 0, 0, 0, 0, 0], Y=[1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0], tri=, box=, calc=, ans=18, i=1\n \ndef calc(a, b): # (6): calc=\n if a <= b - 2: # (11): NO CHANGE\n tri(a+2, b)\n elif a > b and a <= b + M - 2: # (12): NO CHANGE\n tri(a+1, M-1) # (13): l=10, r=18, a=1\n tri(0, b) # (17): l=0, r=8, a=1\n box(0, b, b-a-1) # (23): l=0, r=8, a=-2\n\nans = 0 # (7): ans=0\nfor i in range(1, N): # (8): i=1 (28): NO CHANGE\n ans += (A[i] - A[i-1]) % M # (9): ans=18\n calc(A[i-1], A[i]) # (10): a=9, b=8\n\nY = acc(Y) # (29): Y=[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nX = [X[i] + Y[i] for i in range(M)] # (30): X=[-1, 1, 1, 1, 1, 1, 1, 1, 1, -7, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nX = acc(X) # (31): X=[-1, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n\nans -= max(X) # (32): ans=9\nprint(ans)"], "anno_status": [false], "diff_content": " from itertools import accumulate\n def acc(X): return list(accumulate(X))\n \n N, M = map(int, input().split())\n A = [int(a)-1 for a in input().split()]\n \n X = [0] * M \n Y = [0] * M \n \n def tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n \n def box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \n def calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n- tri(a+1, M-1)\n+ tri(a+2, M-1)\n tri(0, b)\n- box(0, b, b-a-1)\n+ box(0, b, -a+M-2)\n+ \n+ \n \n+def rev():\n+ ret = acc(Y)\n+ ret = [X[i] + ret[i] for i in range(M)]\n+ return acc(ret)\n+ \n ans = 0\n for i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n \n-Y = acc(Y)\n-X = [X[i] + Y[i] for i in range(M)]\n-X = acc(X)\n+X = rev()\n \n ans -= max(X)\n print(ans)\n", "FL_content": " from itertools import accumulate\n def acc(X): return list(accumulate(X))\n \n N, M = map(int, input().split())\n A = [int(a)-1 for a in input().split()]\n \n X = [0] * M \n Y = [0] * M \n \n def tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n \n def box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \n def calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n- tri(a+1, M-1)\n tri(0, b)\n- box(0, b, b-a-1)\n \n ans = 0\n for i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n \n-Y = acc(Y)\n-X = [X[i] + Y[i] for i in range(M)]\n-X = acc(X)\n \n ans -= max(X)\n print(ans)\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 41 }, { "user_id": "u047796752", "problem_id": "p03677", "submission1_id": "s058865173", "submission2_id": "s395101753", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nfrom heapq import *\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\na = list(map(lambda x: x-1, a))\nlr = []\ncnt = 0\n\nfor i in range(n-1):\n ai, aj = a[i], a[i+1]\n \n if ai0 and pq[0][0]=lr[idx][0]:\n decre += i-lr[idx][0]-1\n heappush(pq, (lr[idx][1], lr[idx][0]))\n idx += 1\n \n ans = min(ans, cnt-decre)\n decre += len(pq)\n\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\nfrom heapq import *\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\na = list(map(lambda x: x-1, a))\nlr = []\ncnt = 0\n\nfor i in range(n-1):\n ai, aj = a[i], a[i+1]\n \n if ai0 and pq[0][0]=lr[idx][0]:\n decre += i-lr[idx][0]\n \n heappush(pq, (lr[idx][1], lr[idx][0]))\n idx += 1\n \n ans = min(ans, cnt-decre)\n decre += len(pq)\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587160163", "date2": "1587161323", "bleu_score": "0.956791090865061", "code1_test_status": [0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 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, 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], "code1_test_score": 82, "total_score": 102, "input": "4 19\n15 6 10 13 2 14 3 3 3 1\n", "actual_output": "9\n", "expected_output": "8\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=\nfrom heapq import *\n\nn, m = map(int, input().split()) # (1): n=4, m=19\na = list(map(int, input().split())) # (2): a=[15, 6, 10, 13, 2, 14, 3, 3, 3, 1]\na = list(map(lambda x: x-1, a)) # (3): a=[14, 5, 9, 12, 1, 13, 2, 2, 2, 0]\nlr = [] # (4): lr=[]\ncnt = 0 # (5): cnt=0\n\nfor i in range(n-1): # (6): i=0 (12): i=1 ... (22): NO CHANGE\n ai, aj = a[i], a[i+1] # (7): ai=14, aj=5 (13): ai=5, aj=9 (18): ai=9, aj=12\n \n if ai0 and pq[0][0]=lr[idx][0]: # (30): NO CHANGE (34): NO CHANGE ... (145): NO CHANGE\n decre += i-lr[idx][0]-1 # (31): decre=4 (60): decre=8 ... (122): decre=-1\n heappush(pq, (lr[idx][1], lr[idx][0])) # (32): pq=[(5, -5)] (61): pq=[(5, -5), (9, 5)] ... (123): pq=[(18, 14)]\n idx += 1 # (33): idx=1 (62): idx=2 ... (124): idx=4\n \n ans = min(ans, cnt-decre) # (35): ans=13 (40): ans=12 ... (146): NO CHANGE\n decre += len(pq) # (36): decre=5 (41): decre=6 ... (147): decre=4\n\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n from heapq import *\n \n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n a = list(map(lambda x: x-1, a))\n lr = []\n cnt = 0\n \n for i in range(n-1):\n ai, aj = a[i], a[i+1]\n \n if ai0 and pq[0][0]=lr[idx][0]:\n- decre += i-lr[idx][0]-1\n+ decre += i-lr[idx][0]\n+ \n heappush(pq, (lr[idx][1], lr[idx][0]))\n idx += 1\n \n ans = min(ans, cnt-decre)\n decre += len(pq)\n \n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n from heapq import *\n \n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n a = list(map(lambda x: x-1, a))\n lr = []\n cnt = 0\n \n for i in range(n-1):\n ai, aj = a[i], a[i+1]\n \n if ai0 and pq[0][0]=lr[idx][0]:\n- decre += i-lr[idx][0]-1\n heappush(pq, (lr[idx][1], lr[idx][0]))\n idx += 1\n \n ans = min(ans, cnt-decre)\n decre += len(pq)\n \n print(ans)\n", "added_lines": 8, "removed_lines": 5, "code1_lines": 41 }, { "user_id": "u864197622", "problem_id": "p03677", "submission1_id": "s607910168", "submission2_id": "s160697885", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\ndef acc(X): return list(accumulate(X))\n\nN, M = map(int, input().split())\nA = [int(a)-1 for a in input().split()]\n\nX = [0] * M \nY = [0] * M \n\ndef tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n\ndef box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \ndef calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n tri(a+1, M-1)\n tri(0, b)\n box(0, b, b-a)\n \n \n\ndef rev():\n ret = acc(Y)\n ret = [X[i] + ret[i] for i in range(M)]\n return acc(ret)\n \nans = 0\nfor i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n\nX = rev()\n\nans -= max(X)\nprint(ans)", "code2": "from itertools import accumulate\ndef acc(X): return list(accumulate(X))\n\nN, M = map(int, input().split())\nA = [int(a)-1 for a in input().split()]\n\nX = [0] * M \nY = [0] * M \n\ndef tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n\ndef box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \ndef calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n tri(a+2, M-1)\n tri(0, b)\n box(0, b, -a+M-2)\n \n \n\ndef rev():\n ret = acc(Y)\n ret = [X[i] + ret[i] for i in range(M)]\n return acc(ret)\n \nans = 0\nfor i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n\nX = rev()\n\nans -= max(X)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552492536", "date2": "1552493013", "bleu_score": "0.9881201289715942", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 53, "total_score": 102, "input": "7 19\n10 9 3 9 2 14 4 0 4 1\n", "actual_output": "36\n", "expected_output": "32\n\n", "anno_code": ["from itertools import accumulate\ndef acc(X): return list(accumulate(X))\n\nN, M = map(int, input().split()) # (0): N=7, M=19\nA = [int(a)-1 for a in input().split()] # (1): A=[9, 8, 2, 8, 1, 13, 3, -1, 3, 0]\n\nX = [0] * M # (2): X=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nY = [0] * M # (3): Y=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\ndef tri(l, r, a = 1): # (4): tri=\n if l < M: # (15): NO CHANGE (19): NO CHANGE ... (99): NO CHANGE\n Y[l] += a # (16): NO CHANGE (20): NO CHANGE ... (100): NO CHANGE\n if r + 1 < M: # (17): a=9, b=8 (21): NO CHANGE ... (101): NO CHANGE\n Y[r+1] -= a # (22): NO CHANGE (42): NO CHANGE ... (102): NO CHANGE\n X[r+1] -= (r-l+1) * a # (23): a=9, b=8 (43): a=8, b=2 ... (103): a=13, b=3\n\ndef box(l, r, a = 1): # (5): box=\n if l < M: # (25): NO CHANGE (45): NO CHANGE ... (105): NO CHANGE\n X[l] += a # (26): NO CHANGE (46): NO CHANGE ... (106): NO CHANGE\n if r + 1< M: # (27): NO CHANGE (47): NO CHANGE ... (107): NO CHANGE\n X[r+1] -= a # (28): accumulate=, acc=, N=7, M=19, A=[9, 8, 2, 8, 1, 13, 3, -1, 3, 0], X=[-1, 0, 0, 0, 0, 0, 0, 0, 0, -8, 0, 0, 0, 0, 0, 0, 0, 0, 0], Y=[1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0], tri=, box=, calc=, rev=, ans=18, i=1 (48): accumulate=, acc=, N=7, M=19, A=[9, 8, 2, 8, 1, 13, 3, -1, 3, 0], X=[-7, 0, 0, 3, 0, 0, 0, 0, 0, -8, 0, 0, 0, 0, 0, 0, 0, 0, 0], Y=[2, 0, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0], tri=, box=, calc=, rev=, ans=31, i=2 ... (108): accumulate=, acc=, N=7, M=19, A=[9, 8, 2, 8, 1, 13, 3, -1, 3, 0], X=[-24, 0, 5, 3, 6, 0, 0, 0, 0, -13, 0, 0, 0, 0, -11, 0, 0, 0, 0], Y=[4, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0], tri=, box=, calc=, rev=, ans=70, i=6\n \ndef calc(a, b): # (6): calc=\n if a <= b - 2: # (12): NO CHANGE (32): NO CHANGE ... (92): NO CHANGE\n tri(a+2, b) # (53): l=4, r=8, a=1 (83): l=3, r=13\n elif a > b and a <= b + M - 2: # (13): NO CHANGE (33): NO CHANGE ... (93): NO CHANGE\n tri(a+1, M-1) # (14): l=10, r=18, a=1 (34): l=9, r=18, a=1 ... (94): l=14, r=18, a=1\n tri(0, b) # (18): l=0, r=8, a=1 (38): l=0, r=2, a=1 ... (98): l=0, r=3, a=1\n box(0, b, b-a) # (24): l=0, r=8, a=-1 (44): l=0, r=2, a=-6 ... (104): l=0, r=3, a=-10\n \n \n\ndef rev(): # (7): rev=\n ret = acc(Y) # (111): ret=[4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4]\n ret = [X[i] + ret[i] for i in range(M)] # (112): accumulate=, acc=, N=7, M=19, A=[9, 8, 2, 8, 1, 13, 3, -1, 3, 0], X=[-20, -16, -8, -2, 7, 10, 13, 16, 19, 9, 13, 17, 21, 25, 18, 22, 26, 30, 34], Y=[4, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0], tri=, box=, calc=, rev=, ans=70, i=6\n return acc(ret)\n \nans = 0 # (8): ans=0\nfor i in range(1, N): # (9): i=1 (29): i=2 ... (109): NO CHANGE\n ans += (A[i] - A[i-1]) % M # (10): ans=18 (30): ans=31 ... (90): ans=70\n calc(A[i-1], A[i]) # (11): a=9, b=8 (31): a=8, b=2 ... (91): a=13, b=3\n\nX = rev() # (110): NO CHANGE\n\nans -= max(X) # (113): ans=36\nprint(ans)"], "anno_status": [false], "diff_content": " from itertools import accumulate\n def acc(X): return list(accumulate(X))\n \n N, M = map(int, input().split())\n A = [int(a)-1 for a in input().split()]\n \n X = [0] * M \n Y = [0] * M \n \n def tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n \n def box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \n def calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n- tri(a+1, M-1)\n+ tri(a+2, M-1)\n tri(0, b)\n- box(0, b, b-a)\n+ box(0, b, -a+M-2)\n \n \n \n def rev():\n ret = acc(Y)\n ret = [X[i] + ret[i] for i in range(M)]\n return acc(ret)\n \n ans = 0\n for i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n \n X = rev()\n \n ans -= max(X)\n print(ans)\n", "FL_content": " from itertools import accumulate\n def acc(X): return list(accumulate(X))\n \n N, M = map(int, input().split())\n A = [int(a)-1 for a in input().split()]\n \n X = [0] * M \n Y = [0] * M \n \n def tri(l, r, a = 1):\n if l < M:\n Y[l] += a\n if r + 1 < M:\n Y[r+1] -= a\n X[r+1] -= (r-l+1) * a\n \n def box(l, r, a = 1):\n if l < M:\n X[l] += a\n if r + 1< M:\n X[r+1] -= a\n \n def calc(a, b):\n if a <= b - 2:\n tri(a+2, b)\n elif a > b and a <= b + M - 2:\n- tri(a+1, M-1)\n tri(0, b)\n- box(0, b, b-a)\n \n \n \n def rev():\n ret = acc(Y)\n ret = [X[i] + ret[i] for i in range(M)]\n return acc(ret)\n \n ans = 0\n for i in range(1, N):\n ans += (A[i] - A[i-1]) % M\n calc(A[i-1], A[i])\n \n X = rev()\n \n ans -= max(X)\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 46 }, { "user_id": "u218843509", "problem_id": "p03677", "submission1_id": "s446592218", "submission2_id": "s899647519", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\na = list(map(int, input().split()))\na = [b-1 for b in a]\nimos = [0 for _ in range(m+1)]\nbase = 0\nfor i in range(n-1):\n\tx, y = a[i], a[i+1]\n\tz, w = (x+2)%m, (y+1)%m\n\tif w == 0:\n\t\tw = m\n\tif z < w:\n\t\timos[z] += 1\n\t\timos[w] -= w-z+1\n\t\tif w < m:\n\t\t\timos[w+1] += w-z\n\telse:\n\t\timos[z] += 1\n\t\timos[m] -= m-z+1\n\t\timos[0] += 1\n\t\tbase += m-z\n\t\timos[w] -= m+w-z+1\n\t\tif w < m:\n\t\t\timos[w+1] += m+w-z\n\n\nfor i in range(m):\n\timos[i+1] += imos[i]\nimos[0] += base\nfor i in range(m):\n\timos[i+1] += imos[i]\nres = max(imos[:m])\nans = 0\nfor i in range(n-1):\n\tif a[i+1] > a[i]:\n\t\tans += a[i+1] - a[i]\n\telse:\n\t\tans += a[i+1] + m - a[i]\n\nans -= res\nprint(ans)", "code2": "n, m = map(int, input().split())\na = list(map(int, input().split()))\na = [b-1 for b in a]\nimos = [0 for _ in range(m+1)]\nbase = 0\nfor i in range(n-1):\n\tx, y = a[i], a[i+1]\n\tif y-x == 1 or x+1-m == y:\n\t\tcontinue\n\tz, w = (x+2)%m, (y+1)%m\n\tif w == 0:\n\t\tw = m\n\tif z < w:\n\t\timos[z] += 1\n\t\timos[w] -= w-z+1\n\t\tif w < m:\n\t\t\timos[w+1] += w-z\n\telse:\n\t\timos[z] += 1\n\t\timos[m] -= m-z+1\n\t\timos[0] += 1\n\t\tbase += m-z\n\t\timos[w] -= m+w-z+1\n\t\tif w < m:\n\t\t\timos[w+1] += m+w-z\n\n\nfor i in range(m):\n\timos[i+1] += imos[i]\nimos[0] += base\nfor i in range(m):\n\timos[i+1] += imos[i]\nres = max(imos[:m])\nans = 0\nfor i in range(n-1):\n\tif a[i+1] > a[i]:\n\t\tans += a[i+1] - a[i]\n\telse:\n\t\tans += a[i+1] + m - a[i]\n\nans -= res\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559796709", "date2": "1559796900", "bleu_score": "0.9442063840605639", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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], "code1_test_score": 96, "total_score": 102, "input": "10 10\n6 7 3 7 10 5 4 5 2 1\n", "actual_output": "14\n", "expected_output": "24\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=10, m=10\na = list(map(int, input().split())) # (1): a=[6, 7, 3, 7, 10, 5, 4, 5, 2, 1]\na = [b-1 for b in a] # (2): a=[5, 6, 2, 6, 9, 4, 3, 4, 1, 0]\nimos = [0 for _ in range(m+1)] # (3): imos=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nbase = 0 # (4): base=0\nfor i in range(n-1): # (5): i=0 (17): i=1 ... (104): NO CHANGE\n\tx, y = a[i], a[i+1] # (6): x=5, y=6 (18): x=6, y=2 ... (93): x=1, y=0\n\tz, w = (x+2)%m, (y+1)%m # (7): z=7, w=7 (19): z=8, w=3 ... (94): z=3, w=1\n\tif w == 0: # (8): NO CHANGE (20): NO CHANGE ... (95): NO CHANGE\n\t\tw = m # (42): w=10\n\tif z < w: # (9): NO CHANGE (21): NO CHANGE ... (96): NO CHANGE\n\t\timos[z] += 1 # (34): imos=[2, 0, 0, -6, 6, 0, 0, -10, 11, 0, -7] (44): imos=[2, 0, 0, -6, 6, 0, 0, -14, 15, 0, -7] (52): imos=[2, 1, 0, -6, 6, 0, 0, -14, 15, 0, -10]\n\t\timos[w] -= w-z+1 # (35): imos=[2, 0, 0, -6, 6, 0, 0, -14, 11, 0, -7] (45): imos=[2, 0, 0, -6, 6, 0, 0, -14, 15, 0, -10] (53): imos=[2, 1, 0, -6, 6, -5, 0, -14, 15, 0, -10]\n\t\tif w < m: # (36): NO CHANGE (46): NO CHANGE (54): NO CHANGE\n\t\t\timos[w+1] += w-z # (37): imos=[2, 0, 0, -6, 6, 0, 0, -14, 14, 0, -7] (55): imos=[2, 1, 0, -6, 6, -5, 4, -14, 15, 0, -10]\n\telse:\n\t\timos[z] += 1 # (10): imos=[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] (22): imos=[1, 0, 0, 0, 0, 0, 0, -10, 11, 0, -4] ... (97): imos=[5, 1, -7, 1, -3, -7, 16, -14, 15, 0, -26]\n\t\timos[m] -= m-z+1 # (11): imos=[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -4] (23): imos=[1, 0, 0, 0, 0, 0, 0, -10, 11, 0, -7] ... (98): imos=[5, 1, -7, 1, -3, -7, 16, -14, 15, 0, -34]\n\t\timos[0] += 1 # (12): imos=[1, 0, 0, 0, 0, 0, 0, 1, 0, 0, -4] (24): imos=[2, 0, 0, 0, 0, 0, 0, -10, 11, 0, -7] ... (99): imos=[6, 1, -7, 1, -3, -7, 16, -14, 15, 0, -34]\n\t\tbase += m-z # (13): base=3 (25): base=5 ... (100): base=25\n\t\timos[w] -= m+w-z+1 # (14): imos=[1, 0, 0, 0, 0, 0, 0, -10, 0, 0, -4] (26): imos=[2, 0, 0, -6, 0, 0, 0, -10, 11, 0, -7] ... (101): imos=[6, -8, -7, 1, -3, -7, 16, -14, 15, 0, -34]\n\t\tif w < m: # (15): NO CHANGE (27): NO CHANGE ... (102): NO CHANGE\n\t\t\timos[w+1] += m+w-z # (16): imos=[1, 0, 0, 0, 0, 0, 0, -10, 10, 0, -4] (28): imos=[2, 0, 0, -6, 5, 0, 0, -10, 11, 0, -7] ... (103): imos=[6, -8, 1, 1, -3, -7, 16, -14, 15, 0, -34]\n\n\nfor i in range(m): # (105): i=0 (107): i=1 ... (125): NO CHANGE\n\timos[i+1] += imos[i] # (106): imos=[6, -2, 1, 1, -3, -7, 16, -14, 15, 0, -34] (108): imos=[6, -2, -1, 1, -3, -7, 16, -14, 15, 0, -34] ... (124): imos=[6, -2, -1, 0, -3, -10, 6, -8, 7, 7, -27]\nimos[0] += base # (126): imos=[31, -2, -1, 0, -3, -10, 6, -8, 7, 7, -27]\nfor i in range(m): # (127): i=0 (129): i=1 ... (147): NO CHANGE\n\timos[i+1] += imos[i] # (128): imos=[31, 29, -1, 0, -3, -10, 6, -8, 7, 7, -27] (130): imos=[31, 29, 28, 0, -3, -10, 6, -8, 7, 7, -27] ... (146): imos=[31, 29, 28, 28, 25, 15, 21, 13, 20, 27, 0]\nres = max(imos[:m]) # (148): res=31\nans = 0 # (149): ans=0\nfor i in range(n-1): # (150): i=0 (153): i=1 ... (177): NO CHANGE\n\tif a[i+1] > a[i]: # (151): NO CHANGE (154): NO CHANGE ... (175): NO CHANGE\n\t\tans += a[i+1] - a[i] # (152): ans=1 (158): ans=11 ... (170): ans=29\n\telse:\n\t\tans += a[i+1] + m - a[i] # (155): ans=7 (164): ans=19 ... (176): ans=45\n\nans -= res # (178): ans=14\nprint(ans)"], "anno_status": [false], "diff_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n a = [b-1 for b in a]\n imos = [0 for _ in range(m+1)]\n base = 0\n for i in range(n-1):\n \tx, y = a[i], a[i+1]\n+\tif y-x == 1 or x+1-m == y:\n+\t\tcontinue\n \tz, w = (x+2)%m, (y+1)%m\n \tif w == 0:\n \t\tw = m\n \tif z < w:\n \t\timos[z] += 1\n \t\timos[w] -= w-z+1\n \t\tif w < m:\n \t\t\timos[w+1] += w-z\n \telse:\n \t\timos[z] += 1\n \t\timos[m] -= m-z+1\n \t\timos[0] += 1\n \t\tbase += m-z\n \t\timos[w] -= m+w-z+1\n \t\tif w < m:\n \t\t\timos[w+1] += m+w-z\n \n \n for i in range(m):\n \timos[i+1] += imos[i]\n imos[0] += base\n for i in range(m):\n \timos[i+1] += imos[i]\n res = max(imos[:m])\n ans = 0\n for i in range(n-1):\n \tif a[i+1] > a[i]:\n \t\tans += a[i+1] - a[i]\n \telse:\n \t\tans += a[i+1] + m - a[i]\n \n ans -= res\n print(ans)\n", "FL_content": " n, m = map(int, input().split())\n a = list(map(int, input().split()))\n a = [b-1 for b in a]\n imos = [0 for _ in range(m+1)]\n base = 0\n for i in range(n-1):\n \tx, y = a[i], a[i+1]\n \tz, w = (x+2)%m, (y+1)%m\n \tif w == 0:\n \t\tw = m\n \tif z < w:\n \t\timos[z] += 1\n \t\timos[w] -= w-z+1\n \t\tif w < m:\n \t\t\timos[w+1] += w-z\n \telse:\n \t\timos[z] += 1\n \t\timos[m] -= m-z+1\n \t\timos[0] += 1\n \t\tbase += m-z\n \t\timos[w] -= m+w-z+1\n \t\tif w < m:\n \t\t\timos[w+1] += m+w-z\n \n \n for i in range(m):\n \timos[i+1] += imos[i]\n imos[0] += base\n for i in range(m):\n \timos[i+1] += imos[i]\n res = max(imos[:m])\n ans = 0\n for i in range(n-1):\n \tif a[i+1] > a[i]:\n \t\tans += a[i+1] - a[i]\n \telse:\n \t\tans += a[i+1] + m - a[i]\n \n ans -= res\n print(ans)\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 40 }, { "user_id": "u488401358", "problem_id": "p03677", "submission1_id": "s144350081", "submission2_id": "s466921247", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m=map(int,input().split())\na=list(map(int,input().split()))\na=[a[i]-1 for i in range(n)]\n\nimos=[0 for i in range(m+1)]\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n if val>2:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nans=-1\nval=0\nfor i in range(m):\n if val>imos[i]:\n ans=i\n val=imos[i]\n\nval=0\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n if (g-s)%m>2:\n if g>=s:\n if ans>s:\n val+=1+(g-ans)%m\n else:\n val+=(g-ans)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n\n\nprint(val)", "code2": "n,m=map(int,input().split())\na=list(map(int,input().split()))\na=[a[i]-1 for i in range(n)]\n\nimos=[0 for i in range(m+1)]\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n if val>1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nans=-1\nval=0\nfor i in range(m):\n if val>=imos[i]:\n ans=i\n val=imos[i]\n\nval=0\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n if (g-s)%m>1:\n if g>=s:\n if g>=ans>s:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n\n\nprint(val)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589051397", "date2": "1589051978", "bleu_score": "0.9853382815183855", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 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, 0, 1, 1, 0, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "7 19\n4 17 6 4 2 14 4 0 0 1\n", "actual_output": "39\n", "expected_output": "37\n\n", "anno_code": ["n,m=map(int,input().split()) # (0): n=7, m=19\na=list(map(int,input().split())) # (1): a=[4, 17, 6, 4, 2, 14, 4, 0, 0, 1]\na=[a[i]-1 for i in range(n)] # (2): a=[3, 16, 5, 3, 1, 13, 3]\n\nimos=[0 for i in range(m+1)] # (3): imos=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(0,n-1): # (4): i=0 (14): i=1 ... (72): NO CHANGE\n s,g=a[i],a[i+1] # (5): s=3, g=16 (15): s=16, g=5 ... (61): s=13, g=3\n val=(g-s)%m # (6): val=13 (16): val=8 ... (62): val=9\n if val>2: # (7): NO CHANGE (17): NO CHANGE ... (63): NO CHANGE\n s=(s+2)%m # (8): s=5 (18): s=18 ... (64): s=15\n if s>g: # (9): NO CHANGE (19): NO CHANGE ... (65): NO CHANGE\n imos[s]+=-1 # (20): imos=[0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 0] (32): imos=[-1, 0, 0, 0, 0, -1, 8, -8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 1] ... (66): imos=[-3, 0, 17, -17, 17, -18, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 3]\n imos[m]+=1 # (21): imos=[0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 1] (33): imos=[-1, 0, 0, 0, 0, -1, 8, -8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 2] ... (67): imos=[-3, 0, 17, -17, 17, -18, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 4]\n imos[0]+=-1 # (22): imos=[-1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 1] (34): imos=[-2, 0, 0, 0, 0, -1, 8, -8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 2] ... (68): imos=[-4, 0, 17, -17, 17, -18, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 4]\n imos[g+1]+=1 # (23): imos=[-1, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 1] (35): imos=[-2, 0, 0, 0, 1, -1, 8, -8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 2] ... (69): imos=[-4, 0, 17, -17, 18, -18, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 4]\n else:\n imos[s]+=-1 # (10): imos=[0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (56): imos=[-3, 0, 17, -17, 17, -18, 8, -8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 3]\n imos[g+1]+=1 # (11): imos=[0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0] (57): imos=[-3, 0, 17, -17, 17, -18, 8, -8, 0, 0, 0, 0, 0, 0, 1, 0, 0, 13, -13, 3]\n imos[(g+1)%m]+=val-1 # (12): imos=[0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 0, 0] (24): imos=[-1, 0, 0, 0, 0, -1, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 1] ... (70): imos=[-4, 0, 17, -17, 26, -18, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 4]\n imos[(g+1)%m+1]+=-(val-1) # (13): imos=[0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -12, 0] (25): imos=[-1, 0, 0, 0, 0, -1, 8, -7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, -13, 1] ... (71): imos=[-4, 0, 17, -17, 26, -26, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 4]\n\nfor i in range(1,m+1): # (73): i=1 (75): i=2 ... (111): NO CHANGE\n imos[i]+=imos[i-1] # (74): imos=[-4, -4, 17, -17, 26, -26, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 4] (76): imos=[-4, -4, 13, -17, 26, -26, 8, -8, 0, 0, 0, 0, 0, 0, 12, -12, 0, 13, -13, 4] ... (110): imos=[-4, -4, 13, -4, 22, -4, 4, -4, -4, -4, -4, -4, -4, -4, 8, -4, -4, 9, -4, 0]\n\nfor i in range(1,m+1): # (112): i=1 (114): i=2 ... (150): NO CHANGE\n imos[i]+=imos[i-1] # (113): imos=[-4, -8, 13, -4, 22, -4, 4, -4, -4, -4, -4, -4, -4, -4, 8, -4, -4, 9, -4, 0] (115): imos=[-4, -8, 5, -4, 22, -4, 4, -4, -4, -4, -4, -4, -4, -4, 8, -4, -4, 9, -4, 0] ... (149): NO CHANGE\n\nans=-1 # (151): ans=-1\nval=0 # (152): val=0\nfor i in range(m): # (153): i=0 (157): i=1 ... (195): NO CHANGE\n if val>imos[i]: # (154): NO CHANGE (158): NO CHANGE ... (194): NO CHANGE\n ans=i # (155): ans=0 (159): ans=1\n val=imos[i] # (156): val=-4 (160): val=-8\n\nval=0 # (196): val=0\nfor i in range(0,n-1): # (197): i=0 (203): i=1 ... (233): NO CHANGE\n s,g=a[i],a[i+1] # (198): s=3, g=16 (204): s=16, g=5 ... (228): s=13, g=3\n if (g-s)%m>2: # (199): NO CHANGE (205): NO CHANGE ... (229): NO CHANGE\n if g>=s: # (200): NO CHANGE (206): NO CHANGE ... (230): NO CHANGE\n if ans>s: # (201): NO CHANGE (225): NO CHANGE\n val+=1+(g-ans)%m\n else:\n val+=(g-ans)%m # (202): val=15 (226): val=36\n else:\n if ans>s or g>=ans: # (207): NO CHANGE (213): NO CHANGE ... (231): NO CHANGE\n val+=1+(g-ans)%m # (208): val=20 (214): val=23 ... (232): val=39\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n\n\nprint(val)"], "anno_status": [false], "diff_content": " n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a=[a[i]-1 for i in range(n)]\n \n imos=[0 for i in range(m+1)]\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n- if val>2:\n+ if val>1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n ans=-1\n val=0\n for i in range(m):\n- if val>imos[i]:\n+ if val>=imos[i]:\n ans=i\n val=imos[i]\n \n val=0\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n- if (g-s)%m>2:\n+ if (g-s)%m>1:\n if g>=s:\n- if ans>s:\n+ if g>=ans>s:\n val+=1+(g-ans)%m\n else:\n- val+=(g-ans)%m\n+ val+=(g-s)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n \n \n print(val)\n+\n", "FL_content": " n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a=[a[i]-1 for i in range(n)]\n \n imos=[0 for i in range(m+1)]\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n- if val>2:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n ans=-1\n val=0\n for i in range(m):\n- if val>imos[i]:\n ans=i\n val=imos[i]\n \n val=0\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n- if (g-s)%m>2:\n if g>=s:\n- if ans>s:\n val+=1+(g-ans)%m\n else:\n- val+=(g-ans)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n \n \n print(val)\n", "added_lines": 6, "removed_lines": 5, "code1_lines": 53 }, { "user_id": "u333945892", "problem_id": "p03677", "submission1_id": "s939773903", "submission2_id": "s847553043", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inpl(): return list(map(int, input().split()))\ndef inpl_s(): return list(input().split())\n\nN,M = inpl()\naa = inpl()\n\nyama_height = [0]*(2*M)\nyama_num = [0]*(2*M)\nSUM = 0\nfor i in range(1,N):\n\tna = aa[i]\n\tba = aa[i-1]\n\tif na < ba:\n\t\tna += M\n\tSUM += (na-ba)\n\tyama_height[na] = na - (ba + 1)\n\tyama_num[na] -= 1\n\tyama_num[ba+1] += 1\n\ntmp = 0\nfor i in range(2*M):\n\ttmp += yama_num[i]\n\tyama_num[i] = tmp\n\nans_list = [0]*(M)\ntmp = 0\nfor i in reversed(range(2*M)):\n\ttmp += yama_height[i]\n\ttmp -= yama_num[i]\n\tans_list[i%M] += tmp\n\nprint(SUM-max(ans_list))\n", "code2": "from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inpl(): return list(map(int, input().split()))\ndef inpl_s(): return list(input().split())\n\nN,M = inpl()\naa = inpl()\nfor i in range(N):\n\taa[i] -= 1\n\nyama_height = [0]*(2*M)\nyama_num = [0]*(2*M)\nSUM = 0\nfor i in range(1,N):\n\tna = aa[i]\n\tba = aa[i-1]\n\tif na < ba:\n\t\tna += M\n\tSUM += (na-ba)\n\tyama_height[na] += na - (ba + 1)\n\tyama_num[na] -= 1\n\tyama_num[ba+1] += 1\n\ntmp = 0\nfor i in range(2*M):\n\ttmp += yama_num[i]\n\tyama_num[i] = tmp\n\nans_list = [0]*(M)\ntmp = 0\nfor i in reversed(range(2*M)):\n\ttmp += yama_height[i]\n\ttmp -= yama_num[i]\n\tans_list[i%M] += tmp\n\nprint(SUM-max(ans_list))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1534733483", "date2": "1534736313", "bleu_score": "0.9549565498894297", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 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, 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], "code1_test_score": 95, "total_score": 102, "input": "4 8\n1 5 1 5\n", "actual_output": "9\n", "expected_output": "6\n\n", "anno_code": ["from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8) # (0): NO CHANGE\nINF = float('inf') # (1): INF=inf\nmod = 10**9+7 # (2): mod=1000000007\neps = 10**-7 # (3): eps=1e-07, inpl=, inpl_s=\ndef inpl(): return list(map(int, input().split()))\ndef inpl_s(): return list(input().split())\n\nN,M = inpl() # (4): N=4, M=8\naa = inpl() # (5): aa=[1, 5, 1, 5]\n\nyama_height = [0]*(2*M) # (6): yama_height=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nyama_num = [0]*(2*M) # (7): yama_num=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nSUM = 0 # (8): SUM=0\nfor i in range(1,N): # (9): i=1 (17): i=2 ... (34): NO CHANGE\n\tna = aa[i] # (10): na=5 (18): na=1 (27): na=5\n\tba = aa[i-1] # (11): ba=1 (19): ba=5 (28): ba=1\n\tif na < ba: # (12): NO CHANGE (20): NO CHANGE (29): NO CHANGE\n\t\tna += M # (21): na=9\n\tSUM += (na-ba) # (13): SUM=4 (22): SUM=8 (30): SUM=12\n\tyama_height[na] = na - (ba + 1) # (14): yama_height=[0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (23): yama_height=[0, 0, 0, 0, 0, 3, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0] (31): NO CHANGE\n\tyama_num[na] -= 1 # (15): yama_num=[0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (24): yama_num=[0, 0, 1, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0] (32): yama_num=[0, 0, 1, 0, 0, -2, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0]\n\tyama_num[ba+1] += 1 # (16): yama_num=[0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (25): yama_num=[0, 0, 1, 0, 0, -1, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0] (33): yama_num=[0, 0, 2, 0, 0, -2, 1, 0, 0, -1, 0, 0, 0, 0, 0, 0]\n\ntmp = 0 # (35): tmp=0\nfor i in range(2*M): # (36): i=0 (39): i=1 ... (84): NO CHANGE\n\ttmp += yama_num[i] # (37): NO CHANGE (40): NO CHANGE ... (82): NO CHANGE\n\tyama_num[i] = tmp # (38): NO CHANGE (41): NO CHANGE ... (83): NO CHANGE\n\nans_list = [0]*(M) # (85): ans_list=[0, 0, 0, 0, 0, 0, 0, 0]\ntmp = 0 # (86): NO CHANGE\nfor i in reversed(range(2*M)): # (87): NO CHANGE (91): i=14 ... (151): NO CHANGE\n\ttmp += yama_height[i] # (88): NO CHANGE (92): NO CHANGE ... (148): NO CHANGE\n\ttmp -= yama_num[i] # (89): NO CHANGE (93): NO CHANGE ... (149): NO CHANGE\n\tans_list[i%M] += tmp # (90): NO CHANGE (94): NO CHANGE ... (150): ans_list=[-1, 0, -3, -1, 1, 3, 0, 1]\n\nprint(SUM-max(ans_list))\n"], "anno_status": [false], "diff_content": " from collections import defaultdict,deque\n import sys,heapq,bisect,math,itertools,string,queue,datetime\n sys.setrecursionlimit(10**8)\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inpl(): return list(map(int, input().split()))\n def inpl_s(): return list(input().split())\n \n N,M = inpl()\n aa = inpl()\n+for i in range(N):\n+\taa[i] -= 1\n \n yama_height = [0]*(2*M)\n yama_num = [0]*(2*M)\n SUM = 0\n for i in range(1,N):\n \tna = aa[i]\n \tba = aa[i-1]\n \tif na < ba:\n \t\tna += M\n \tSUM += (na-ba)\n-\tyama_height[na] = na - (ba + 1)\n+\tyama_height[na] += na - (ba + 1)\n \tyama_num[na] -= 1\n \tyama_num[ba+1] += 1\n \n tmp = 0\n for i in range(2*M):\n \ttmp += yama_num[i]\n \tyama_num[i] = tmp\n \n ans_list = [0]*(M)\n tmp = 0\n for i in reversed(range(2*M)):\n \ttmp += yama_height[i]\n \ttmp -= yama_num[i]\n \tans_list[i%M] += tmp\n \n print(SUM-max(ans_list))\n \n", "FL_content": " from collections import defaultdict,deque\n import sys,heapq,bisect,math,itertools,string,queue,datetime\n sys.setrecursionlimit(10**8)\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inpl(): return list(map(int, input().split()))\n def inpl_s(): return list(input().split())\n \n N,M = inpl()\n aa = inpl()\n \n yama_height = [0]*(2*M)\n yama_num = [0]*(2*M)\n SUM = 0\n for i in range(1,N):\n \tna = aa[i]\n \tba = aa[i-1]\n \tif na < ba:\n \t\tna += M\n \tSUM += (na-ba)\n-\tyama_height[na] = na - (ba + 1)\n \tyama_num[na] -= 1\n \tyama_num[ba+1] += 1\n \n tmp = 0\n for i in range(2*M):\n \ttmp += yama_num[i]\n \tyama_num[i] = tmp\n \n ans_list = [0]*(M)\n tmp = 0\n for i in reversed(range(2*M)):\n \ttmp += yama_height[i]\n \ttmp -= yama_num[i]\n \tans_list[i%M] += tmp\n \n print(SUM-max(ans_list))\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 39 }, { "user_id": "u333945892", "problem_id": "p03677", "submission1_id": "s871699666", "submission2_id": "s847553043", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inpl(): return list(map(int, input().split()))\ndef inpl_s(): return list(input().split())\n\nN,M = inpl()\naa = inpl()\nfor i in range(N):\n\taa[i] -= 1\n\nyama_height = [0]*(2*M)\nyama_num = [0]*(2*M)\nSUM = 0\nfor i in range(1,N):\n\tna = aa[i]\n\tba = aa[i-1]\n\tif na < ba:\n\t\tna += M\n\tSUM += (na-ba)\n\tyama_height[na] = na - (ba + 1)\n\tyama_num[na] -= 1\n\tyama_num[ba+1] += 1\n\ntmp = 0\nfor i in range(2*M):\n\ttmp += yama_num[i]\n\tyama_num[i] = tmp\n\nans_list = [0]*(M)\ntmp = 0\nfor i in reversed(range(2*M)):\n\ttmp += yama_height[i]\n\ttmp -= yama_num[i]\n\tans_list[i%M] += tmp\n\nprint(SUM-max(ans_list))\n", "code2": "from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inpl(): return list(map(int, input().split()))\ndef inpl_s(): return list(input().split())\n\nN,M = inpl()\naa = inpl()\nfor i in range(N):\n\taa[i] -= 1\n\nyama_height = [0]*(2*M)\nyama_num = [0]*(2*M)\nSUM = 0\nfor i in range(1,N):\n\tna = aa[i]\n\tba = aa[i-1]\n\tif na < ba:\n\t\tna += M\n\tSUM += (na-ba)\n\tyama_height[na] += na - (ba + 1)\n\tyama_num[na] -= 1\n\tyama_num[ba+1] += 1\n\ntmp = 0\nfor i in range(2*M):\n\ttmp += yama_num[i]\n\tyama_num[i] = tmp\n\nans_list = [0]*(M)\ntmp = 0\nfor i in reversed(range(2*M)):\n\ttmp += yama_height[i]\n\ttmp -= yama_num[i]\n\tans_list[i%M] += tmp\n\nprint(SUM-max(ans_list))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1534733852", "date2": "1534736313", "bleu_score": "0.9967094292637442", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 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, 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], "code1_test_score": 95, "total_score": 102, "input": "10 14\n10 9 8 7 1 7 4 3 2 1\n", "actual_output": "55\n", "expected_output": "41\n\n", "anno_code": ["from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8) # (0): NO CHANGE\nINF = float('inf') # (1): INF=inf\nmod = 10**9+7 # (2): mod=1000000007\neps = 10**-7 # (3): eps=1e-07, inpl=, inpl_s=\ndef inpl(): return list(map(int, input().split()))\ndef inpl_s(): return list(input().split())\n\nN,M = inpl() # (4): N=10, M=14\naa = inpl() # (5): aa=[10, 9, 8, 7, 1, 7, 4, 3, 2, 1]\nfor i in range(N): # (6): i=0 (8): i=1 ... (26): NO CHANGE\n\taa[i] -= 1 # (7): aa=[9, 9, 8, 7, 1, 7, 4, 3, 2, 1] (9): aa=[9, 8, 8, 7, 1, 7, 4, 3, 2, 1] ... (25): aa=[9, 8, 7, 6, 0, 6, 3, 2, 1, 0]\n\nyama_height = [0]*(2*M) # (27): yama_height=[0, 0, ..., 0, 0]\nyama_num = [0]*(2*M) # (28): yama_num=[0, 0, ..., 0, 0]\nSUM = 0 # (29): SUM=0\nfor i in range(1,N): # (30): i=1 (39): i=2 ... (110): NO CHANGE\n\tna = aa[i] # (31): na=8 (40): na=7 ... (102): na=0\n\tba = aa[i-1] # (32): ba=9 (41): ba=8 ... (103): ba=1\n\tif na < ba: # (33): NO CHANGE (42): NO CHANGE ... (104): NO CHANGE\n\t\tna += M # (34): na=22 (43): na=21 ... (105): na=14\n\tSUM += (na-ba) # (35): SUM=13 (44): SUM=26 ... (106): SUM=103\n\tyama_height[na] = na - (ba + 1) # (36): yama_height=[0, 0, ..., 0, 0] (45): yama_height=[0, 0, ..., 0, 0] ... (107): yama_height=[0, 0, ..., 0, 0]\n\tyama_num[na] -= 1 # (37): yama_num=[0, 0, ..., 0, 0] (46): yama_num=[0, 0, ..., 0, 0] ... (108): yama_num=[0, 1, ..., 0, 0]\n\tyama_num[ba+1] += 1 # (38): yama_num=[0, 0, ..., 0, 0] (47): yama_num=[0, 0, ..., 0, 0] ... (109): yama_num=[0, 1, ..., 0, 0]\n\ntmp = 0 # (111): tmp=0\nfor i in range(2*M): # (112): i=0 (115): i=1 ... (196): NO CHANGE\n\ttmp += yama_num[i] # (113): NO CHANGE (116): tmp=1 ... (194): NO CHANGE\n\tyama_num[i] = tmp # (114): NO CHANGE (117): NO CHANGE ... (195): NO CHANGE\n\nans_list = [0]*(M) # (197): ans_list=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\ntmp = 0 # (198): NO CHANGE\nfor i in reversed(range(2*M)): # (199): NO CHANGE (203): i=26 ... (311): NO CHANGE\n\ttmp += yama_height[i] # (200): NO CHANGE (204): NO CHANGE ... (308): NO CHANGE\n\ttmp -= yama_num[i] # (201): NO CHANGE (205): NO CHANGE ... (309): NO CHANGE\n\tans_list[i%M] += tmp # (202): NO CHANGE (206): NO CHANGE ... (310): ans_list=[48, 42, 36, 30, 26, 33, 40, 28, 22, 16, 23, 31, 39, 47]\n\nprint(SUM-max(ans_list))\n"], "anno_status": [false], "diff_content": " from collections import defaultdict,deque\n import sys,heapq,bisect,math,itertools,string,queue,datetime\n sys.setrecursionlimit(10**8)\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inpl(): return list(map(int, input().split()))\n def inpl_s(): return list(input().split())\n \n N,M = inpl()\n aa = inpl()\n for i in range(N):\n \taa[i] -= 1\n \n yama_height = [0]*(2*M)\n yama_num = [0]*(2*M)\n SUM = 0\n for i in range(1,N):\n \tna = aa[i]\n \tba = aa[i-1]\n \tif na < ba:\n \t\tna += M\n \tSUM += (na-ba)\n-\tyama_height[na] = na - (ba + 1)\n+\tyama_height[na] += na - (ba + 1)\n \tyama_num[na] -= 1\n \tyama_num[ba+1] += 1\n \n tmp = 0\n for i in range(2*M):\n \ttmp += yama_num[i]\n \tyama_num[i] = tmp\n \n ans_list = [0]*(M)\n tmp = 0\n for i in reversed(range(2*M)):\n \ttmp += yama_height[i]\n \ttmp -= yama_num[i]\n \tans_list[i%M] += tmp\n \n print(SUM-max(ans_list))\n \n", "FL_content": " from collections import defaultdict,deque\n import sys,heapq,bisect,math,itertools,string,queue,datetime\n sys.setrecursionlimit(10**8)\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inpl(): return list(map(int, input().split()))\n def inpl_s(): return list(input().split())\n \n N,M = inpl()\n aa = inpl()\n for i in range(N):\n \taa[i] -= 1\n \n yama_height = [0]*(2*M)\n yama_num = [0]*(2*M)\n SUM = 0\n for i in range(1,N):\n \tna = aa[i]\n \tba = aa[i-1]\n \tif na < ba:\n \t\tna += M\n \tSUM += (na-ba)\n-\tyama_height[na] = na - (ba + 1)\n \tyama_num[na] -= 1\n \tyama_num[ba+1] += 1\n \n tmp = 0\n for i in range(2*M):\n \ttmp += yama_num[i]\n \tyama_num[i] = tmp\n \n ans_list = [0]*(M)\n tmp = 0\n for i in reversed(range(2*M)):\n \ttmp += yama_height[i]\n \ttmp -= yama_num[i]\n \tans_list[i%M] += tmp\n \n print(SUM-max(ans_list))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 41 }, { "user_id": "u488401358", "problem_id": "p03677", "submission1_id": "s896519791", "submission2_id": "s466921247", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m=map(int,input().split())\na=list(map(int,input().split()))\na=[a[i]-1 for i in range(n)]\n\nimos=[0 for i in range(m+1)]\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n if val>2:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nans=-1\nval=0\nfor i in range(m):\n if val>imos[i]:\n ans=i\n val=imos[i]\n\nval=0\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n if g>=s:\n if ans>s:\n val+=1+(g-ans)%m\n else:\n val+=(g-ans)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n\nprint(val)\n", "code2": "n,m=map(int,input().split())\na=list(map(int,input().split()))\na=[a[i]-1 for i in range(n)]\n\nimos=[0 for i in range(m+1)]\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n if val>1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nfor i in range(1,m+1):\n imos[i]+=imos[i-1]\n\nans=-1\nval=0\nfor i in range(m):\n if val>=imos[i]:\n ans=i\n val=imos[i]\n\nval=0\nfor i in range(0,n-1):\n s,g=a[i],a[i+1]\n if (g-s)%m>1:\n if g>=s:\n if g>=ans>s:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n else:\n val+=(g-s)%m\n\n\nprint(val)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589051250", "date2": "1589051978", "bleu_score": "0.8980095941668501", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 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, 0, 1, 1, 1, 0, 1, 1, 0, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 102, "input": "2 8\n1 8 1 1\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n,m=map(int,input().split()) # (0): n=2, m=8\na=list(map(int,input().split())) # (1): a=[1, 8, 1, 1]\na=[a[i]-1 for i in range(n)] # (2): a=[0, 7]\n\nimos=[0 for i in range(m+1)] # (3): imos=[0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(0,n-1): # (4): i=0 (14): NO CHANGE\n s,g=a[i],a[i+1] # (5): s=0, g=7\n val=(g-s)%m # (6): val=7\n if val>2: # (7): NO CHANGE\n s=(s+2)%m # (8): s=2\n if s>g: # (9): NO CHANGE\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1 # (10): imos=[0, 0, -1, 0, 0, 0, 0, 0, 0]\n imos[g+1]+=1 # (11): imos=[0, 0, -1, 0, 0, 0, 0, 0, 1]\n imos[(g+1)%m]+=val-1 # (12): imos=[6, 0, -1, 0, 0, 0, 0, 0, 1]\n imos[(g+1)%m+1]+=-(val-1) # (13): imos=[6, -6, -1, 0, 0, 0, 0, 0, 1]\n\nfor i in range(1,m+1): # (15): i=1 (17): i=2 ... (31): NO CHANGE\n imos[i]+=imos[i-1] # (16): imos=[6, 0, -1, 0, 0, 0, 0, 0, 1] (18): NO CHANGE ... (30): imos=[6, 0, -1, -1, -1, -1, -1, -1, 0]\n\nfor i in range(1,m+1): # (32): i=1 (34): i=2 ... (48): NO CHANGE\n imos[i]+=imos[i-1] # (33): imos=[6, 6, -1, -1, -1, -1, -1, -1, 0] (35): imos=[6, 6, 5, -1, -1, -1, -1, -1, 0] ... (47): NO CHANGE\n\nans=-1 # (49): ans=-1\nval=0 # (50): val=0\nfor i in range(m): # (51): i=0 (53): i=1 ... (67): NO CHANGE\n if val>imos[i]: # (52): NO CHANGE (54): NO CHANGE ... (66): NO CHANGE\n ans=i\n val=imos[i]\n\nval=0 # (68): NO CHANGE\nfor i in range(0,n-1): # (69): i=0 (74): NO CHANGE\n s,g=a[i],a[i+1] # (70): s=0\n if g>=s: # (71): NO CHANGE\n if ans>s: # (72): NO CHANGE\n val+=1+(g-ans)%m\n else:\n val+=(g-ans)%m # (73): NO CHANGE\n else:\n if ans>s or g>=ans:\n val+=1+(g-ans)%m\n else:\n val+=(g-s)%m\n\nprint(val)\n"], "anno_status": [false], "diff_content": " n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a=[a[i]-1 for i in range(n)]\n \n imos=[0 for i in range(m+1)]\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n- if val>2:\n+ if val>1:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n ans=-1\n val=0\n for i in range(m):\n- if val>imos[i]:\n+ if val>=imos[i]:\n ans=i\n val=imos[i]\n \n val=0\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n- if g>=s:\n- if ans>s:\n- val+=1+(g-ans)%m\n+ if (g-s)%m>1:\n+ if g>=s:\n+ if g>=ans>s:\n+ val+=1+(g-ans)%m\n+ else:\n+ val+=(g-s)%m\n else:\n- val+=(g-ans)%m\n+ if ans>s or g>=ans:\n+ val+=1+(g-ans)%m\n+ else:\n+ val+=(g-s)%m\n else:\n- if ans>s or g>=ans:\n- val+=1+(g-ans)%m\n- else:\n- val+=(g-s)%m\n+ val+=(g-s)%m\n+\n \n print(val)\n \n", "FL_content": " n,m=map(int,input().split())\n a=list(map(int,input().split()))\n a=[a[i]-1 for i in range(n)]\n \n imos=[0 for i in range(m+1)]\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n val=(g-s)%m\n- if val>2:\n s=(s+2)%m\n if s>g:\n imos[s]+=-1\n imos[m]+=1\n imos[0]+=-1\n imos[g+1]+=1\n else:\n imos[s]+=-1\n imos[g+1]+=1\n imos[(g+1)%m]+=val-1\n imos[(g+1)%m+1]+=-(val-1)\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n for i in range(1,m+1):\n imos[i]+=imos[i-1]\n \n ans=-1\n val=0\n for i in range(m):\n- if val>imos[i]:\n ans=i\n val=imos[i]\n \n val=0\n for i in range(0,n-1):\n s,g=a[i],a[i+1]\n- if g>=s:\n- if ans>s:\n- val+=1+(g-ans)%m\n else:\n- val+=(g-ans)%m\n else:\n- if ans>s or g>=ans:\n- val+=1+(g-ans)%m\n- else:\n- val+=(g-s)%m\n \n print(val)\n \n", "added_lines": 14, "removed_lines": 10, "code1_lines": 50 }, { "user_id": "u021916304", "problem_id": "p02742", "submission1_id": "s520196898", "submission2_id": "s116909686", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\nif h%2 == 0 or w%2 == 0:\n print(h*w/2)\nelse:\n print(int(h*w/2)+1)\n ", "code2": "h,w=map(int,input().split())\nif h == 1 or w == 1:\n print(1)\nelif h%2 == 0 or w%2 == 0:\n print(h*w\nelse:\n print(h*w\n \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584235544", "date2": "1584257472", "bleu_score": "0.716465566506861", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 88, "input": "1000000110 1110000000\n", "actual_output": "5.5500006105e+17\n", "expected_output": "555000061050000000\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=1000000110, w=1110000000\nif h%2 == 0 or w%2 == 0: # (1): NO CHANGE\n print(h*w/2)\nelse:\n print(int(h*w/2)+1)\n "], "anno_status": [true], "diff_content": " h,w=map(int,input().split())\n-if h%2 == 0 or w%2 == 0:\n- print(h*w/2)\n+if h == 1 or w == 1:\n+ print(1)\n+elif h%2 == 0 or w%2 == 0:\n+ print(h*w\n else:\n- print(int(h*w/2)+1)\n+ print(h*w\n \n+\n", "FL_content": " h,w=map(int,input().split())\n-if h%2 == 0 or w%2 == 0:\n- print(h*w/2)\n else:\n- print(int(h*w/2)+1)\n \n", "added_lines": 6, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u385244248", "problem_id": "p02742", "submission1_id": "s537720414", "submission2_id": "s863039743", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nimport string\nimport fractions\nimport random\nfrom operator import itemgetter\nimport itertools\nfrom collections import deque\nimport copy\nimport heapq\nimport bisect\n\nMOD = 10 ** 9 + 7\nINF = float('inf')\ninput = lambda: sys.stdin.readline().strip()\n\nH, W = map(int, input().split())\nans = math.ceil(H / 2) * math.ceil(W / 2) + H \nprint(ans - 1)\n", "code2": "import sys\nimport math\nimport string\nimport fractions\nimport random\nfrom operator import itemgetter\nimport itertools\nfrom collections import deque\nimport copy\nimport heapq\nimport bisect\n\nMOD = 10 ** 9 + 7\nINF = float('inf')\ninput = lambda: sys.stdin.readline().strip()\n\nH, W = map(int, input().split())\nif H >= 2 and W >= 2:\n ans = math.ceil(H / 2) * math.ceil(W / 2) + (H \nelse:\n ans = 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584234353", "date2": "1584234718", "bleu_score": "0.8818430090890932", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "1000000111 1010000000\n", "actual_output": "252500029280000110\n", "expected_output": "505000056055000000\n\n", "anno_code": ["import sys\nimport math\nimport string\nimport fractions\nimport random\nfrom operator import itemgetter\nimport itertools\nfrom collections import deque\nimport copy\nimport heapq\nimport bisect\n\nMOD = 10 ** 9 + 7 # (0): MOD=1000000007\nINF = float('inf') # (1): INF=inf\ninput = lambda: sys.stdin.readline().strip() # (2): input= at 0x0000027EB7719B40>\n\nH, W = map(int, input().split()) # (3): H=1000000111, W=1010000000\nans = math.ceil(H / 2) * math.ceil(W / 2) + H # (4): ans=252500029280000111\nprint(ans - 1)\n"], "anno_status": [true], "diff_content": " import sys\n import math\n import string\n import fractions\n import random\n from operator import itemgetter\n import itertools\n from collections import deque\n import copy\n import heapq\n import bisect\n \n MOD = 10 ** 9 + 7\n INF = float('inf')\n input = lambda: sys.stdin.readline().strip()\n \n H, W = map(int, input().split())\n-ans = math.ceil(H / 2) * math.ceil(W / 2) + H \n-print(ans - 1)\n+if H >= 2 and W >= 2:\n+ ans = math.ceil(H / 2) * math.ceil(W / 2) + (H \n+else:\n+ ans = 1\n+print(ans)\n \n", "FL_content": " import sys\n import math\n import string\n import fractions\n import random\n from operator import itemgetter\n import itertools\n from collections import deque\n import copy\n import heapq\n import bisect\n \n MOD = 10 ** 9 + 7\n INF = float('inf')\n input = lambda: sys.stdin.readline().strip()\n \n H, W = map(int, input().split())\n-ans = math.ceil(H / 2) * math.ceil(W / 2) + H \n-print(ans - 1)\n \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u580697892", "problem_id": "p02742", "submission1_id": "s409238600", "submission2_id": "s598128488", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom math import ceil\nH, W = map(int, input().split())\nif H == 1 or W == 1:\n print(1)\n exit()\nans = 0\nans += ceil(W / 2) * ceil(H / 2)\nans += W \nprint(ans)", "code2": "\nfrom math import ceil\nH, W = map(int, input().split())\nif H == 1 or W == 1:\n print(1)\nelse:\n ans = 0\n ans += ceil(W / 2) * ceil(H / 2)\n ans += (W \n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584235013", "date2": "1584238306", "bleu_score": "0.8480073141801339", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "1000000111 1010010000\n", "actual_output": "252502529290290000\n", "expected_output": "505005056055555000\n\n", "anno_code": ["\nfrom math import ceil\nH, W = map(int, input().split()) # (0): H=1000000111, W=1010010000\nif H == 1 or W == 1: # (1): NO CHANGE\n print(1)\n exit()\nans = 0 # (2): ans=0\nans += ceil(W / 2) * ceil(H / 2) # (3): ans=252502528280280000\nans += W # (4): ans=252502529290290000\nprint(ans)"], "anno_status": [true], "diff_content": " \n from math import ceil\n H, W = map(int, input().split())\n if H == 1 or W == 1:\n print(1)\n- exit()\n-ans = 0\n-ans += ceil(W / 2) * ceil(H / 2)\n-ans += W \n-print(ans)\n+else:\n+ ans = 0\n+ ans += ceil(W / 2) * ceil(H / 2)\n+ ans += (W \n+ print(ans)\n", "FL_content": " \n from math import ceil\n H, W = map(int, input().split())\n if H == 1 or W == 1:\n print(1)\n- exit()\n-ans = 0\n-ans += ceil(W / 2) * ceil(H / 2)\n-ans += W \n-print(ans)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 10 }, { "user_id": "u822961851", "problem_id": "p02742", "submission1_id": "s356872301", "submission2_id": "s765316822", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1:\n count = w\n elif h % 2 == 1:\n count = w * dy + (w-1)\n else:\n count = w * dy\n\n print(count)\n\nif __name__ == '__main__':\n resolve()", "code2": "def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1 or w == 1:\n count = 1\n elif h % 2 == 1:\n count = w * dy + (w - (w \n else:\n count = w * dy\n\n print(count)\n\n\nif __name__ == '__main__':\n resolve()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584235972", "date2": "1584239155", "bleu_score": "0.9199315115002245", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "0011000100 0110000100\n", "actual_output": "1210012100010000\n", "expected_output": "605006050005000\n\n", "anno_code": ["def resolve(): # (0): resolve=\n h, w = map(int, input().split())\n dy = h \n if h == 1:\n count = w\n elif h % 2 == 1:\n count = w * dy + (w-1)\n else:\n count = w * dy\n\n print(count)\n\nif __name__ == '__main__':\n resolve()"], "anno_status": [true], "diff_content": " def resolve():\n h, w = map(int, input().split())\n dy = h \n- if h == 1:\n- count = w\n+ if h == 1 or w == 1:\n+ count = 1\n elif h % 2 == 1:\n- count = w * dy + (w-1)\n+ count = w * dy + (w - (w \n else:\n count = w * dy\n \n print(count)\n \n+\n if __name__ == '__main__':\n resolve()\n", "FL_content": " def resolve():\n h, w = map(int, input().split())\n dy = h \n- if h == 1:\n- count = w\n elif h % 2 == 1:\n- count = w * dy + (w-1)\n else:\n count = w * dy\n \n print(count)\n \n if __name__ == '__main__':\n resolve()\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u492737043", "problem_id": "p02742", "submission1_id": "s035637779", "submission2_id": "s094681548", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W=map(int,input().split())\nimport math\n\nA=[0,math.ceil(W/2)]\nc=W*math.ceil(H/2)+A[H%2]\n\nprint(c)\n", "code2": "H,W=map(int,input().split())\nimport math\n\nA=[0,math.ceil(W/2)]\nif (H-1)*(W-1)!=0:\n c=W*math.floor(H/2)+A[H%2]\nelse:\n c=1\nprint(c)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592751945", "date2": "1592752603", "bleu_score": "0.6875335886003623", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 88, "input": "0001000111 1110100000\n", "actual_output": "555112720650000\n", "expected_output": "555111610550000\n\n", "anno_code": ["H,W=map(int,input().split()) # (0): H=1000111, W=1110100000, math=\nimport math\n\nA=[0,math.ceil(W/2)] # (1): A=[0, 555050000]\nc=W*math.ceil(H/2)+A[H%2] # (2): c=555112720650000\n\nprint(c)\n"], "anno_status": [true], "diff_content": " H,W=map(int,input().split())\n import math\n \n A=[0,math.ceil(W/2)]\n-c=W*math.ceil(H/2)+A[H%2]\n-\n+if (H-1)*(W-1)!=0:\n+ c=W*math.floor(H/2)+A[H%2]\n+else:\n+ c=1\n print(c)\n-\n", "FL_content": " H,W=map(int,input().split())\n import math\n \n A=[0,math.ceil(W/2)]\n-c=W*math.ceil(H/2)+A[H%2]\n-\n print(c)\n-\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u388370899", "problem_id": "p02742", "submission1_id": "s322703127", "submission2_id": "s018018868", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\ndef main():\n h, w = map(int, input().split())\n ans = (h * w) / 2\n if h % 2 == w % 2 == 1:\n ans = ans + 1\n print(\"%d\" % ans)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "\n\n\n\ndef main():\n h, w = map(int, input().split())\n if h == 1 or w == 1:\n ans = 1\n elif h % 2 == 0:\n ans = (h \n elif w % 2 == 0:\n ans = (w \n else:\n ans = h * (w \n print(\"%d\" % ans)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584234414", "date2": "1584239077", "bleu_score": "0.6602449836757741", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 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, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 66, "total_score": 88, "input": "1011000100 1010000100\n", "actual_output": "510555101050004992\n", "expected_output": "510555101050005000\n\n", "anno_code": ["\n\n\n\ndef main(): # (0): main=\n h, w = map(int, input().split())\n ans = (h * w) / 2\n if h % 2 == w % 2 == 1:\n ans = ans + 1\n print(\"%d\" % ans)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n \n \n \n def main():\n h, w = map(int, input().split())\n- ans = (h * w) / 2\n- if h % 2 == w % 2 == 1:\n- ans = ans + 1\n+ if h == 1 or w == 1:\n+ ans = 1\n+ elif h % 2 == 0:\n+ ans = (h \n+ elif w % 2 == 0:\n+ ans = (w \n+ else:\n+ ans = h * (w \n print(\"%d\" % ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n \n \n \n def main():\n h, w = map(int, input().split())\n- ans = (h * w) / 2\n- if h % 2 == w % 2 == 1:\n- ans = ans + 1\n print(\"%d\" % ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 8, "removed_lines": 3, "code1_lines": 15 }, { "user_id": "u171132311", "problem_id": "p02742", "submission1_id": "s772137072", "submission2_id": "s079613725", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\nresult = h*w\nif result%2==0:\n print(result/2)\nelse:\n print(int(result/2)+1)", "code2": "h,w=map(int,input().split())\nresult = h*w\nif h==1 or w==1:\n print(1)\nelif result%2==0:\n print(int(result\nelse:\n print(int(result", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584235334", "date2": "1584239155", "bleu_score": "0.7340733645304804", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 88, "input": "0011000100 1010000100\n", "actual_output": "5555051050005000.0\n", "expected_output": "5555051050005000\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=11000100, w=1010000100\nresult = h*w # (1): result=11110102100010000\nif result%2==0: # (2): NO CHANGE\n print(result/2)\nelse:\n print(int(result/2)+1)"], "anno_status": [true], "diff_content": " h,w=map(int,input().split())\n result = h*w\n-if result%2==0:\n- print(result/2)\n+if h==1 or w==1:\n+ print(1)\n+elif result%2==0:\n+ print(int(result\n else:\n- print(int(result/2)+1)\n+ print(int(result\n", "FL_content": " h,w=map(int,input().split())\n result = h*w\n-if result%2==0:\n- print(result/2)\n else:\n- print(int(result/2)+1)\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u822961851", "problem_id": "p02742", "submission1_id": "s517124301", "submission2_id": "s765316822", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1:\n count = w \n elif w == 1:\n count = h \n elif h % 2 == 1:\n count = w * dy + (w-1)\n else:\n count = w * dy\n\n print(count)\n\nif __name__ == '__main__':\n resolve()", "code2": "def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1 or w == 1:\n count = 1\n elif h % 2 == 1:\n count = w * dy + (w - (w \n else:\n count = w * dy\n\n print(count)\n\n\nif __name__ == '__main__':\n resolve()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584236478", "date2": "1584239155", "bleu_score": "0.8701052566425037", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "1000000111 1000000000\n", "actual_output": "1000000111999999999\n", "expected_output": "500000055500000000\n\n", "anno_code": ["def resolve(): # (0): resolve=\n h, w = map(int, input().split())\n dy = h \n if h == 1:\n count = w \n elif w == 1:\n count = h \n elif h % 2 == 1:\n count = w * dy + (w-1)\n else:\n count = w * dy\n\n print(count)\n\nif __name__ == '__main__':\n resolve()"], "anno_status": [true], "diff_content": " def resolve():\n h, w = map(int, input().split())\n dy = h \n- if h == 1:\n- count = w \n- elif w == 1:\n- count = h \n+ if h == 1 or w == 1:\n+ count = 1\n elif h % 2 == 1:\n- count = w * dy + (w-1)\n+ count = w * dy + (w - (w \n else:\n count = w * dy\n \n print(count)\n \n+\n if __name__ == '__main__':\n resolve()\n", "FL_content": " def resolve():\n h, w = map(int, input().split())\n dy = h \n- if h == 1:\n- count = w \n- elif w == 1:\n- count = h \n elif h % 2 == 1:\n- count = w * dy + (w-1)\n else:\n count = w * dy\n \n print(count)\n \n if __name__ == '__main__':\n resolve()\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 16 }, { "user_id": "u391675400", "problem_id": "p02742", "submission1_id": "s344422748", "submission2_id": "s571545090", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nh,w = map(int,(input().split()))\nh = math.floor(h)\nw = math.floor(w)\nsum = h * w\n\nif h == 1 and w ==1:\n print(\"1\")\nelif h % 2 == 0:\n result = math.floor(sum /2)\n print(result)\nelse:\n result = math.floor(sum /2 + 1)\n print(result)", "code2": "import math\nh,w = map(int,input().split())\n\n\nif w == 1 or h == 1 :\n print(\"1\")\nelif (h * w ) % 2 == 0:\n result = h * w /2\n result = math.ceil(result)\n print(str(result))\nelif (h * w )% 2 != 0:\n result = ((h * w) \n result = math.ceil(result)\n print(str(result))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584313045", "date2": "1584667322", "bleu_score": "0.6328140736689684", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 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, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 54, "total_score": 88, "input": "0001000111 1111101000\n", "actual_output": "555612166105501\n", "expected_output": "555612166105500\n\n", "anno_code": ["import math\nh,w = map(int,(input().split())) # (0): h=1000111, w=1111101000\nh = math.floor(h) # (1): NO CHANGE\nw = math.floor(w) # (2): NO CHANGE\nsum = h * w # (3): sum=1111224332211000\n\nif h == 1 and w ==1: # (4): NO CHANGE\n print(\"1\")\nelif h % 2 == 0: # (5): NO CHANGE\n result = math.floor(sum /2)\n print(result)\nelse:\n result = math.floor(sum /2 + 1) # (6): result=555612166105501\n print(result)"], "anno_status": [true], "diff_content": " import math\n-h,w = map(int,(input().split()))\n-h = math.floor(h)\n-w = math.floor(w)\n-sum = h * w\n+h,w = map(int,input().split())\n \n-if h == 1 and w ==1:\n+\n+if w == 1 or h == 1 :\n print(\"1\")\n-elif h % 2 == 0:\n- result = math.floor(sum /2)\n- print(result)\n-else:\n- result = math.floor(sum /2 + 1)\n- print(result)\n+elif (h * w ) % 2 == 0:\n+ result = h * w /2\n+ result = math.ceil(result)\n+ print(str(result))\n+elif (h * w )% 2 != 0:\n+ result = ((h * w) \n+ result = math.ceil(result)\n+ print(str(result))\n+\n", "FL_content": " import math\n-h,w = map(int,(input().split()))\n-h = math.floor(h)\n-w = math.floor(w)\n-sum = h * w\n \n-if h == 1 and w ==1:\n print(\"1\")\n-elif h % 2 == 0:\n- result = math.floor(sum /2)\n- print(result)\n-else:\n- result = math.floor(sum /2 + 1)\n- print(result)\n", "added_lines": 12, "removed_lines": 11, "code1_lines": 14 }, { "user_id": "u940765148", "problem_id": "p02742", "submission1_id": "s450199928", "submission2_id": "s478525857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w = [int(i) for i in input().split()]\na = (w + 1) \nn = (h + 1) \nr = a*n\nif h % 2 == 0:\n r += (a-1)*n\nelse:\n r += (a-1)*(n-1)\nprint(r)", "code2": "h,w = [int(i) for i in input().split()]\nr = h*w\nif r % 2 == 1:\n r += 1\nif h <= 1 or w <= 1:\n print(1)\nelse:\n print(r ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584234681", "date2": "1584237816", "bleu_score": "0.60625505976878", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "0011000100 1010000100\n", "actual_output": "22220206231020301\n", "expected_output": "5555051050005000\n\n", "anno_code": ["h,w = [int(i) for i in input().split()] # (0): h=11000100, w=1010000100\na = (w + 1) # (1): a=1010000101\nn = (h + 1) # (2): n=11000101\nr = a*n # (3): r=11110103121010201\nif h % 2 == 0: # (4): NO CHANGE\n r += (a-1)*n # (5): r=22220206231020301\nelse:\n r += (a-1)*(n-1)\nprint(r)"], "anno_status": [true], "diff_content": " h,w = [int(i) for i in input().split()]\n-a = (w + 1) \n-n = (h + 1) \n-r = a*n\n-if h % 2 == 0:\n- r += (a-1)*n\n+r = h*w\n+if r % 2 == 1:\n+ r += 1\n+if h <= 1 or w <= 1:\n+ print(1)\n else:\n- r += (a-1)*(n-1)\n-print(r)\n+ print(r \n", "FL_content": " h,w = [int(i) for i in input().split()]\n-a = (w + 1) \n-n = (h + 1) \n-r = a*n\n-if h % 2 == 0:\n- r += (a-1)*n\n else:\n- r += (a-1)*(n-1)\n-print(r)\n", "added_lines": 6, "removed_lines": 7, "code1_lines": 9 }, { "user_id": "u391675400", "problem_id": "p02742", "submission1_id": "s547467310", "submission2_id": "s571545090", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nh,w = map(int,(input().split()))\nh = math.floor(h)\nw = math.floor(w)\nsum = h * w\n\nif h == 1:\n print(\"1\")\nelif h % 2 == 0:\n result = math.floor(sum /2)\n print(result)\nelse:\n result = math.floor(sum /2 + 1)\n print(result)", "code2": "import math\nh,w = map(int,input().split())\n\n\nif w == 1 or h == 1 :\n print(\"1\")\nelif (h * w ) % 2 == 0:\n result = h * w /2\n result = math.ceil(result)\n print(str(result))\nelif (h * w )% 2 != 0:\n result = ((h * w) \n result = math.ceil(result)\n print(str(result))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584312899", "date2": "1584667322", "bleu_score": "0.6190434204418547", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 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, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 54, "total_score": 88, "input": "1001000101 0111101100\n", "actual_output": "55606106160605552\n", "expected_output": "55606106160605550\n\n", "anno_code": ["import math\nh,w = map(int,(input().split())) # (0): h=1001000101, w=111101100\nh = math.floor(h) # (1): NO CHANGE\nw = math.floor(w) # (2): NO CHANGE\nsum = h * w # (3): sum=111212212321211100\n\nif h == 1: # (4): NO CHANGE\n print(\"1\")\nelif h % 2 == 0: # (5): NO CHANGE\n result = math.floor(sum /2)\n print(result)\nelse:\n result = math.floor(sum /2 + 1) # (6): result=55606106160605552\n print(result)"], "anno_status": [true], "diff_content": " import math\n-h,w = map(int,(input().split()))\n-h = math.floor(h)\n-w = math.floor(w)\n-sum = h * w\n+h,w = map(int,input().split())\n \n-if h == 1:\n+\n+if w == 1 or h == 1 :\n print(\"1\")\n-elif h % 2 == 0:\n- result = math.floor(sum /2)\n- print(result)\n-else:\n- result = math.floor(sum /2 + 1)\n- print(result)\n+elif (h * w ) % 2 == 0:\n+ result = h * w /2\n+ result = math.ceil(result)\n+ print(str(result))\n+elif (h * w )% 2 != 0:\n+ result = ((h * w) \n+ result = math.ceil(result)\n+ print(str(result))\n+\n", "FL_content": " import math\n-h,w = map(int,(input().split()))\n-h = math.floor(h)\n-w = math.floor(w)\n-sum = h * w\n \n-if h == 1:\n print(\"1\")\n-elif h % 2 == 0:\n- result = math.floor(sum /2)\n- print(result)\n-else:\n- result = math.floor(sum /2 + 1)\n- print(result)\n", "added_lines": 12, "removed_lines": 11, "code1_lines": 14 }, { "user_id": "u591919975", "problem_id": "p02742", "submission1_id": "s641148969", "submission2_id": "s235164186", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W=map(int,input().split())\n\n\nif (H*W)%2==0:\n print(int(H*W/2))\n\nelse:\n print(int((H*W+1)/2))", "code2": "H,W=map(int,input().split())\n\nif H==1 or W==1:\n print(1)\n\nelif (H*W)%2==0:\n print(H*W\n\nelse:\n print((H*W+1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599428131", "date2": "1599428745", "bleu_score": "0.732617979783394", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 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, 0, 1, 1, 1], "code1_test_score": 71, "total_score": 88, "input": "1011000111 1110100000\n", "actual_output": "561155611610550016\n", "expected_output": "561155611610550000\n\n", "anno_code": ["H,W=map(int,input().split()) # (0): H=1011000111, W=1110100000\n\n\nif (H*W)%2==0: # (1): NO CHANGE\n print(int(H*W/2))\n\nelse:\n print(int((H*W+1)/2))"], "anno_status": [true], "diff_content": " H,W=map(int,input().split())\n \n+if H==1 or W==1:\n+ print(1)\n \n-if (H*W)%2==0:\n- print(int(H*W/2))\n+elif (H*W)%2==0:\n+ print(H*W\n \n else:\n- print(int((H*W+1)/2))\n+ print((H*W+1)\n", "FL_content": " H,W=map(int,input().split())\n \n \n-if (H*W)%2==0:\n- print(int(H*W/2))\n \n else:\n- print(int((H*W+1)/2))\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u341736906", "problem_id": "p02742", "submission1_id": "s884374129", "submission2_id": "s196338952", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nH,W=map(int,input().split())\nif (H*W)%2==0:\n print(int(H*W/2))\nelse:\n print(math.ceil(H*W/2))", "code2": "import math\nH,W=map(int,input().split())\nif H==1 or W==1:\n print(1)\nelif (H*W)%2==0:\n print(H*W\nelse:\n print(math.ceil(H*W/2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584237679", "date2": "1584237931", "bleu_score": "0.7749007307992491", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 70, "total_score": 88, "input": "1000000111 1110010000\n", "actual_output": "555005061605555008\n", "expected_output": "555005061605555000\n\n", "anno_code": ["import math\nH,W=map(int,input().split()) # (0): H=1000000111, W=1110010000\nif (H*W)%2==0: # (1): NO CHANGE\n print(int(H*W/2))\nelse:\n print(math.ceil(H*W/2))"], "anno_status": [true], "diff_content": " import math\n H,W=map(int,input().split())\n-if (H*W)%2==0:\n- print(int(H*W/2))\n+if H==1 or W==1:\n+ print(1)\n+elif (H*W)%2==0:\n+ print(H*W\n else:\n print(math.ceil(H*W/2))\n", "FL_content": " import math\n H,W=map(int,input().split())\n-if (H*W)%2==0:\n- print(int(H*W/2))\n else:\n print(math.ceil(H*W/2))\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u095192632", "problem_id": "p02742", "submission1_id": "s770535226", "submission2_id": "s563390071", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = map(int, input().split())\nif W > 0:\n\tHW = H*W\n\tprint(sum(divmod(HW, 2)))\nelse:\n print(0)", "code2": "H, W = map(int, input().split())\nif H!=1 and W!=1:\n\tHW = H*W\n\tprint(sum(divmod(HW, 2)))\nelse:\n print(1)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584235421", "date2": "1584236137", "bleu_score": "0.8504869072925804", "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, 0, 1, 0, 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], "code1_test_score": 84, "total_score": 88, "input": "-3 -13\n", "actual_output": "0\n", "expected_output": "20\n\n", "anno_code": ["H, W = map(int, input().split()) # (0): H=-3, W=-13\nif W > 0: # (1): NO CHANGE\n\tHW = H*W\n\tprint(sum(divmod(HW, 2)))\nelse:\n print(0)"], "anno_status": [true], "diff_content": " H, W = map(int, input().split())\n-if W > 0:\n+if H!=1 and W!=1:\n \tHW = H*W\n \tprint(sum(divmod(HW, 2)))\n else:\n- print(0)\n+ print(1)\n", "FL_content": " H, W = map(int, input().split())\n-if W > 0:\n \tHW = H*W\n \tprint(sum(divmod(HW, 2)))\n else:\n- print(0)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u822961851", "problem_id": "p02742", "submission1_id": "s965301113", "submission2_id": "s765316822", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1 or w == 1:\n count = 1\n elif h % 2 == 1:\n count = w * dy + (w-1)\n else:\n count = w * dy\n\n print(count)\n\nif __name__ == '__main__':\n resolve()\n", "code2": "def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1 or w == 1:\n count = 1\n elif h % 2 == 1:\n count = w * dy + (w - (w \n else:\n count = w * dy\n\n print(count)\n\n\nif __name__ == '__main__':\n resolve()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584236756", "date2": "1584239155", "bleu_score": "0.9673792249539058", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "-3 -8\n", "actual_output": "15\n", "expected_output": "12\n\n", "anno_code": ["def resolve(): # (0): resolve=\n h, w = map(int, input().split())\n dy = h \n if h == 1 or w == 1:\n count = 1\n elif h % 2 == 1:\n count = w * dy + (w-1)\n else:\n count = w * dy\n\n print(count)\n\nif __name__ == '__main__':\n resolve()\n"], "anno_status": [true], "diff_content": " def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1 or w == 1:\n count = 1\n elif h % 2 == 1:\n- count = w * dy + (w-1)\n+ count = w * dy + (w - (w \n else:\n count = w * dy\n \n print(count)\n \n+\n if __name__ == '__main__':\n resolve()\n-\n", "FL_content": " def resolve():\n h, w = map(int, input().split())\n dy = h \n if h == 1 or w == 1:\n count = 1\n elif h % 2 == 1:\n- count = w * dy + (w-1)\n else:\n count = w * dy\n \n print(count)\n \n if __name__ == '__main__':\n resolve()\n-\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u683391968", "problem_id": "p02742", "submission1_id": "s482116495", "submission2_id": "s183031728", "status1": "Wrong Answer", "status2": "Accepted", "code1": "value = input().split()\nrows = int(value[0])\ncolmuns = int(value[1])\nOddColNum = colmuns \nEvenColNum = OddColNum\nif (colmuns % 2) != 0:\n OddColNum = OddColNum + 1\n\nOddRowCount = rows \nEvenRowCount = rows \nif (OddRowCount % 2) != 0:\n OddRowCount = OddRowCount + 1\n\ncounts = OddRowCount * OddColNum + EvenColNum + EvenRowCount\n \nprint(counts)\n ", "code2": "value = input().split()\nrows = int(value[0])\ncolmuns = int(value[1])\n\n\nif colmuns == 1:\n rows = 1\nelif rows == 1:\n colmuns = 1\n\nOddColNum = colmuns \nEvenColNum = OddColNum\nif (colmuns % 2) != 0:\n OddColNum = OddColNum + 1\nif (colmuns == 1):\n OddColNum = 1\n\nOddRowCount = 0\nEvenRowCount = rows \nif (rows % 2) == 0:\n OddRowCount = rows \nelse:\n OddRowCount = (rows \nif (rows == 1):\n OddRowCount = 1\n\ncounts = OddRowCount * OddColNum + EvenColNum * EvenRowCount\nprint(counts)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584235595", "date2": "1584237772", "bleu_score": "0.6920187949450683", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "0011101000 0111111001\n", "actual_output": "1233443355414001\n", "expected_output": "616721611050500\n\n", "anno_code": ["value = input().split() # (0): value=['0011101000', '0111111001']\nrows = int(value[0]) # (1): rows=11101000\ncolmuns = int(value[1]) # (2): colmuns=111111001\nOddColNum = colmuns # (3): OddColNum=111111001\nEvenColNum = OddColNum # (4): EvenColNum=111111001\nif (colmuns % 2) != 0: # (5): NO CHANGE\n OddColNum = OddColNum + 1 # (6): OddColNum=111111002\n\nOddRowCount = rows # (7): OddRowCount=11101000\nEvenRowCount = rows # (8): EvenRowCount=11101000\nif (OddRowCount % 2) != 0: # (9): NO CHANGE\n OddRowCount = OddRowCount + 1\n\ncounts = OddRowCount * OddColNum + EvenColNum + EvenRowCount # (10): counts=1233443355414001\n \nprint(counts)\n "], "anno_status": [true], "diff_content": " value = input().split()\n rows = int(value[0])\n colmuns = int(value[1])\n+\n+\n+if colmuns == 1:\n+ rows = 1\n+elif rows == 1:\n+ colmuns = 1\n+\n OddColNum = colmuns \n EvenColNum = OddColNum\n if (colmuns % 2) != 0:\n OddColNum = OddColNum + 1\n+if (colmuns == 1):\n+ OddColNum = 1\n \n-OddRowCount = rows \n+OddRowCount = 0\n EvenRowCount = rows \n-if (OddRowCount % 2) != 0:\n- OddRowCount = OddRowCount + 1\n+if (rows % 2) == 0:\n+ OddRowCount = rows \n+else:\n+ OddRowCount = (rows \n+if (rows == 1):\n+ OddRowCount = 1\n \n-counts = OddRowCount * OddColNum + EvenColNum + EvenRowCount\n- \n+counts = OddRowCount * OddColNum + EvenColNum * EvenRowCount\n print(counts)\n- \n", "FL_content": " value = input().split()\n rows = int(value[0])\n colmuns = int(value[1])\n OddColNum = colmuns \n EvenColNum = OddColNum\n if (colmuns % 2) != 0:\n OddColNum = OddColNum + 1\n \n-OddRowCount = rows \n EvenRowCount = rows \n-if (OddRowCount % 2) != 0:\n- OddRowCount = OddRowCount + 1\n \n-counts = OddRowCount * OddColNum + EvenColNum + EvenRowCount\n- \n print(counts)\n- \n", "added_lines": 17, "removed_lines": 6, "code1_lines": 17 }, { "user_id": "u021916304", "problem_id": "p02742", "submission1_id": "s770144087", "submission2_id": "s116909686", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int,input().split())\nif h == 1 or w == 1:\n print(1)\nelif h%2 == 0 or w%2 == 0:\n print(h*w/2)\nelse:\n print(int(h*w/2)+1)\n \n", "code2": "h,w=map(int,input().split())\nif h == 1 or w == 1:\n print(1)\nelif h%2 == 0 or w%2 == 0:\n print(h*w\nelse:\n print(h*w\n \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584235646", "date2": "1584257472", "bleu_score": "0.8752601910848953", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 88, "input": "1001000111 1000000000\n", "actual_output": "5.005000555e+17\n", "expected_output": "500500055500000000\n\n", "anno_code": ["h,w=map(int,input().split()) # (0): h=1001000111, w=1000000000\nif h == 1 or w == 1: # (1): NO CHANGE\n print(1)\nelif h%2 == 0 or w%2 == 0: # (2): NO CHANGE\n print(h*w/2)\nelse:\n print(int(h*w/2)+1)\n \n"], "anno_status": [true], "diff_content": " h,w=map(int,input().split())\n if h == 1 or w == 1:\n print(1)\n elif h%2 == 0 or w%2 == 0:\n- print(h*w/2)\n+ print(h*w\n else:\n- print(int(h*w/2)+1)\n+ print(h*w\n \n \n", "FL_content": " h,w=map(int,input().split())\n if h == 1 or w == 1:\n print(1)\n elif h%2 == 0 or w%2 == 0:\n- print(h*w/2)\n else:\n- print(int(h*w/2)+1)\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u922769680", "problem_id": "p02742", "submission1_id": "s994181374", "submission2_id": "s494284721", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W=map(int,input().split())\nif H%2==1 and W%2==1:\n print((H*W+1)/2)\nelse:\n print(H*W/2)", "code2": "H,W=map(int,input().split())\nif H==1 or W==1:\n print(1)\nelse:\n if H%2==1 and W%2==1:\n print((H*W)\n else:\n print(H*W", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584238407", "date2": "1584239631", "bleu_score": "0.6131733579102581", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "1000000111 1110010000\n", "actual_output": "5.55005061605555e+17\n", "expected_output": "555005061605555000\n\n", "anno_code": ["H,W=map(int,input().split()) # (0): H=1000000111, W=1110010000\nif H%2==1 and W%2==1: # (1): NO CHANGE\n print((H*W+1)/2)\nelse:\n print(H*W/2)"], "anno_status": [true], "diff_content": " H,W=map(int,input().split())\n-if H%2==1 and W%2==1:\n- print((H*W+1)/2)\n+if H==1 or W==1:\n+ print(1)\n else:\n- print(H*W/2)\n+ if H%2==1 and W%2==1:\n+ print((H*W)\n+ else:\n+ print(H*W\n", "FL_content": " H,W=map(int,input().split())\n-if H%2==1 and W%2==1:\n- print((H*W+1)/2)\n else:\n- print(H*W/2)\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u763291354", "problem_id": "p02742", "submission1_id": "s059169568", "submission2_id": "s149483477", "status1": "Wrong Answer", "status2": "Accepted", "code1": "hw = list(map(int, input().split()))\n\nif hw[0] % 2 == 0 and hw[1] % 2 == 0:\n count = hw[0] * hw[1] \nelif hw[0] % 2 != 0 and hw[1] % 2 == 0:\n count = (hw[0] + 1) * hw[1] \nelif hw[0] % 2 == 0 and hw[1] % 2 != 0:\n count = (hw[1] + 1) * hw[0] \nelse:\n count = (hw[0] + 1) * (hw[1] + 1) \nprint(count)\n", "code2": "hw = list(map(int, input().split()))\n\nif hw[0] == 1 or hw[1] == 1:\n count = 1\nelif hw[0] % 2 == 0 and hw[1] % 2 == 0:\n count = (hw[0] * hw[1]) \nelif hw[0] % 2 != 0 and hw[1] % 2 == 0:\n count = ((hw[0] + 1) * hw[1] \nelif hw[0] % 2 == 0 and hw[1] % 2 != 0:\n count = ((hw[1] + 1) * hw[0] \nelse:\n count = ((hw[0] + 1) * (hw[1] + 1) \nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584237159", "date2": "1584237739", "bleu_score": "0.8508285312047024", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 88, "input": "1100110100 0010101111\n", "actual_output": "11112335332431200\n", "expected_output": "5556167116160550\n\n", "anno_code": ["hw = list(map(int, input().split())) # (0): hw=[1100110100, 10101111]\n\nif hw[0] % 2 == 0 and hw[1] % 2 == 0: # (1): NO CHANGE\n count = hw[0] * hw[1] \nelif hw[0] % 2 != 0 and hw[1] % 2 == 0: # (2): NO CHANGE\n count = (hw[0] + 1) * hw[1] \nelif hw[0] % 2 == 0 and hw[1] % 2 != 0: # (3): NO CHANGE\n count = (hw[1] + 1) * hw[0] # (4): count=11112335332431200\nelse:\n count = (hw[0] + 1) * (hw[1] + 1) \nprint(count)\n"], "anno_status": [true], "diff_content": " hw = list(map(int, input().split()))\n \n-if hw[0] % 2 == 0 and hw[1] % 2 == 0:\n- count = hw[0] * hw[1] \n+if hw[0] == 1 or hw[1] == 1:\n+ count = 1\n+elif hw[0] % 2 == 0 and hw[1] % 2 == 0:\n+ count = (hw[0] * hw[1]) \n elif hw[0] % 2 != 0 and hw[1] % 2 == 0:\n- count = (hw[0] + 1) * hw[1] \n+ count = ((hw[0] + 1) * hw[1] \n elif hw[0] % 2 == 0 and hw[1] % 2 != 0:\n- count = (hw[1] + 1) * hw[0] \n+ count = ((hw[1] + 1) * hw[0] \n else:\n- count = (hw[0] + 1) * (hw[1] + 1) \n+ count = ((hw[0] + 1) * (hw[1] + 1) \n print(count)\n \n", "FL_content": " hw = list(map(int, input().split()))\n \n-if hw[0] % 2 == 0 and hw[1] % 2 == 0:\n- count = hw[0] * hw[1] \n elif hw[0] % 2 != 0 and hw[1] % 2 == 0:\n- count = (hw[0] + 1) * hw[1] \n elif hw[0] % 2 == 0 and hw[1] % 2 != 0:\n- count = (hw[1] + 1) * hw[0] \n else:\n- count = (hw[0] + 1) * (hw[1] + 1) \n print(count)\n \n", "added_lines": 7, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u833416137", "problem_id": "p02742", "submission1_id": "s577535454", "submission2_id": "s858465014", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w = (int(i) for i in input().split())\n\nq_h,m_h = divmod(h,2)\n\nif m_h == 0: \t\n\tprint(w * q_h)\nelse:\n\tq_w,q_w = divmod(w,2)\n\tif q_w == 0:\n\t\tprint(w * q_h + q_w)\n\telse:\n\t\tprint(w * q_h + q_w + 1)", "code2": "h,w = (int(i) for i in input().split())\n\nq_h,mod_h = divmod(h,2)\n\nif h == 1 or w == 1:\n\tprint(1)\nelif mod_h == 0: \t\n\tprint(w * q_h)\nelse:\n\tq_w,mod_w = divmod(w,2)\n\tif mod_w == 0:\n\t\tprint(w * q_h + q_w)\n\telse:\n\t\tprint(w * q_h + q_w + 1)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584235302", "date2": "1584236382", "bleu_score": "0.7897960656837845", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 88, "input": "1000000111 1110000000\n", "actual_output": "555000061050000000\n", "expected_output": "555000061605000000\n\n", "anno_code": ["h,w = (int(i) for i in input().split()) # (0): h=1000000111, w=1110000000\n\nq_h,m_h = divmod(h,2) # (1): q_h=500000055, m_h=1\n\nif m_h == 0: \t # (2): NO CHANGE\n\tprint(w * q_h)\nelse:\n\tq_w,q_w = divmod(w,2) # (3): q_w=0\n\tif q_w == 0: # (4): NO CHANGE\n\t\tprint(w * q_h + q_w)\n\telse:\n\t\tprint(w * q_h + q_w + 1)"], "anno_status": [true], "diff_content": " h,w = (int(i) for i in input().split())\n \n-q_h,m_h = divmod(h,2)\n+q_h,mod_h = divmod(h,2)\n \n-if m_h == 0: \t\n+if h == 1 or w == 1:\n+\tprint(1)\n+elif mod_h == 0: \t\n \tprint(w * q_h)\n else:\n-\tq_w,q_w = divmod(w,2)\n-\tif q_w == 0:\n+\tq_w,mod_w = divmod(w,2)\n+\tif mod_w == 0:\n \t\tprint(w * q_h + q_w)\n \telse:\n \t\tprint(w * q_h + q_w + 1)\n", "FL_content": " h,w = (int(i) for i in input().split())\n \n-q_h,m_h = divmod(h,2)\n \n-if m_h == 0: \t\n \tprint(w * q_h)\n else:\n-\tq_w,q_w = divmod(w,2)\n-\tif q_w == 0:\n \t\tprint(w * q_h + q_w)\n \telse:\n \t\tprint(w * q_h + q_w + 1)\n", "added_lines": 6, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u455408345", "problem_id": "p02642", "submission1_id": "s837842544", "submission2_id": "s234146998", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nn=int(input(\"\"))\naa=input(\"\").split(\" \")\nlista=[]\nfor i in range(n):\n lista+=[int(aa[i])]\ns=0\nlista.sort()\nlistde=set()\nfor i in range(n-1):\n if(lista[i]==lista[i+1] ):\n listde.add(lista[i])\nt=0\nfor i in range(n):\n t=0\n for k in listde:\n \n if (lista[i]%k==0):\n t=1\n break\n if (t==0):\n s+=1\n if(lista[i]<=math.sqrt(lista[n-1])):\n listde.add(lista[i])\nprint(s)\n \n \n", "code2": "n=int(input(\"\"))\naa=input(\"\").split(\" \")\nlista=[]\nfor i in range(n):\n lista+=[int(aa[i])]\nlista.sort()\nlisttf=[]\ns=0\nfor i in range(lista[n-1]):\n listtf+=[True]\nfor i in range(n):\n \n if(listtf[lista[i]-1]):\n if(i mx:\n break\n p[x] = 1 \n if cnt[i] == 1:\n ans += 1 \nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592187995", "date2": "1592766370", "bleu_score": "0.6523094849907265", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 61, "total_score": 103, "input": "5\n42 11 1 1 16\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["from collections import deque \nn = int(input()) # (0): n=5\na = list(map(int, input().split())) # (1): a=[42, 11, 1, 1, 16]\na.sort() # (2): a=[1, 1, 11, 16, 42]\na = deque(a) # (3): NO CHANGE\ny = [min(a)] # (4): y=[1]\nt = 0 # (5): t=0\nwhile a: # (6): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n v = a.popleft() # (7): v=1 (13): NO CHANGE ... (31): v=42\n x = 0 # (8): x=0 (14): NO CHANGE ... (32): NO CHANGE\n for j in y: # (9): j=1 (15): NO CHANGE ... (33): NO CHANGE\n if v % j == 0: # (10): NO CHANGE (16): NO CHANGE ... (34): NO CHANGE\n break # (11): NO CHANGE (17): NO CHANGE ... (35): NO CHANGE\n else:\n x += 1\n if v == j:\n t += 1\n if x == len(y):\n y.append(v)\nprint(len(y) - t)"], "anno_status": [true], "diff_content": "-from collections import deque \n-n = int(input())\n-a = list(map(int, input().split()))\n+from collections import Counter\n+import bisect\n+n = int(input()) \n+a = list(map(int, input().split())) \n+cnt = Counter(a) \n a.sort()\n-a = deque(a)\n-y = [min(a)]\n-t = 0\n-while a:\n- v = a.popleft()\n- x = 0\n- for j in y:\n- if v % j == 0:\n- break\n- else:\n- x += 1\n- if v == j:\n- t += 1\n- if x == len(y):\n- y.append(v)\n-print(len(y) - t)\n+ans = 0\n+mx = 10 ** 6\n+p = [0] * (mx + 1)\n+for i in a:\n+ if p[i] == 0:\n+ for j in range(mx + 1):\n+ x = i * j\n+ if x > mx:\n+ break\n+ p[x] = 1 \n+ if cnt[i] == 1:\n+ ans += 1 \n+print(ans)\n", "FL_content": "-from collections import deque \n-n = int(input())\n-a = list(map(int, input().split()))\n a.sort()\n-a = deque(a)\n-y = [min(a)]\n-t = 0\n-while a:\n- v = a.popleft()\n- x = 0\n- for j in y:\n- if v % j == 0:\n- break\n- else:\n- x += 1\n- if v == j:\n- t += 1\n- if x == len(y):\n- y.append(v)\n-print(len(y) - t)\n", "added_lines": 18, "removed_lines": 19, "code1_lines": 20 }, { "user_id": "u424241608", "problem_id": "p02642", "submission1_id": "s078460641", "submission2_id": "s232418925", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\narr = [int(x) for x in input().split()]\nd = {}\nfor x in arr:\n d[x] = d.get(x,0)+1\n\nmxN = 10**6 + 1\nrp = [True]*mxN\n\n\nfor i in range(2,len(rp)):\n if i not in d or not rp[i]:continue\n for j in range(i+i,mxN,i):\n if j in d: rp[j] = False\n\n\n\n\n\nfor k,v in d.items():\n if v > 1:rp[k] = False\n\nans = sum([(1 if rp[x] else 0) for x in arr])\nprint(ans)\n\n\n\n", "code2": "n = int(input())\narr = [int(x) for x in input().split()]\nd = {}\nfor x in arr:\n d[x] = d.get(x,0)+1\n\nmxN = 10**6 + 1\nrp = [True]*mxN\n\nif 1 in d:\n if d[1] > 1:\n print(0)\n exit()\n else:\n print(1)\n exit()\nfor i in range(2,len(rp)):\n if i not in d or not rp[i]:continue\n for j in range(i+i,mxN,i):\n if j in d: rp[j] = False\n\n\n\n\n\nfor k,v in d.items():\n if v > 1:rp[k] = False\n\nans = sum([(1 if rp[x] else 0) for x in arr])\nprint(ans)\n\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592550727", "date2": "1592551538", "bleu_score": "0.8168575796847413", "code1_test_status": [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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": 96, "total_score": 103, "input": "5\n24 11 8 1 16\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n arr = [int(x) for x in input().split()]\n d = {}\n for x in arr:\n d[x] = d.get(x,0)+1\n \n mxN = 10**6 + 1\n rp = [True]*mxN\n \n-\n+if 1 in d:\n+ if d[1] > 1:\n+ print(0)\n+ exit()\n+ else:\n+ print(1)\n+ exit()\n for i in range(2,len(rp)):\n if i not in d or not rp[i]:continue\n for j in range(i+i,mxN,i):\n if j in d: rp[j] = False\n \n \n \n \n \n for k,v in d.items():\n if v > 1:rp[k] = False\n \n ans = sum([(1 if rp[x] else 0) for x in arr])\n print(ans)\n \n \n \n \n", "FL_content": " n = int(input())\n arr = [int(x) for x in input().split()]\n d = {}\n for x in arr:\n d[x] = d.get(x,0)+1\n \n mxN = 10**6 + 1\n rp = [True]*mxN\n \n-\n for i in range(2,len(rp)):\n if i not in d or not rp[i]:continue\n for j in range(i+i,mxN,i):\n if j in d: rp[j] = False\n \n \n \n \n \n for k,v in d.items():\n if v > 1:rp[k] = False\n \n ans = sum([(1 if rp[x] else 0) for x in arr])\n print(ans)\n \n \n \n \n", "added_lines": 7, "removed_lines": 1, "code1_lines": 28 }, { "user_id": "u924691798", "problem_id": "p02642", "submission1_id": "s118485426", "submission2_id": "s985270786", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nA.sort()\ndic = defaultdict(int)\nfor a in A:\n dic[a] += 1\nans = 0\nfor a in A:\n if dic[a] > 1: continue\n else:\n ans += 1\n idx = 1\n while a*idx <= 10**6:\n dic[a*idx] += 1\n idx += 1\nprint(ans)\n", "code2": "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nA.sort()\ndic = defaultdict(int)\nfor a in A:\n dic[a] += 1\nctr = defaultdict(int)\nans = 0\nfor a in A:\n if dic[a] == 1 and ctr[a] == 0:\n ans += 1\n if ctr[a] == 0:\n m = 1\n while a*m <= 10**6:\n ctr[a*m] += 1\n m += 1\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592190018", "date2": "1592190995", "bleu_score": "0.8084327395629743", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 74, "total_score": 103, "input": "10\n11 2 41 2 8 25 89 28 2 4\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n N = int(input())\n A = list(map(int, input().split()))\n A.sort()\n dic = defaultdict(int)\n for a in A:\n dic[a] += 1\n+ctr = defaultdict(int)\n ans = 0\n for a in A:\n- if dic[a] > 1: continue\n- else:\n+ if dic[a] == 1 and ctr[a] == 0:\n ans += 1\n- idx = 1\n- while a*idx <= 10**6:\n- dic[a*idx] += 1\n- idx += 1\n+ if ctr[a] == 0:\n+ m = 1\n+ while a*m <= 10**6:\n+ ctr[a*m] += 1\n+ m += 1\n print(ans)\n \n", "FL_content": " from collections import defaultdict\n \n N = int(input())\n A = list(map(int, input().split()))\n A.sort()\n dic = defaultdict(int)\n for a in A:\n dic[a] += 1\n ans = 0\n for a in A:\n- if dic[a] > 1: continue\n- else:\n ans += 1\n- idx = 1\n- while a*idx <= 10**6:\n- dic[a*idx] += 1\n- idx += 1\n print(ans)\n \n", "added_lines": 7, "removed_lines": 6, "code1_lines": 19 }, { "user_id": "u064505481", "problem_id": "p02642", "submission1_id": "s180627575", "submission2_id": "s139322363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin, stdout, setrecursionlimit\nfrom collections import deque, defaultdict, Counter\nimport math\n\nrl = lambda: stdin.readline()\nrll = lambda: stdin.readline().split()\nrli = lambda: map(int, stdin.readline().split())\nrlf = lambda: map(float, stdin.readline().split())\n\nINF, NINF = float('inf'), float('-inf')\n\ndef main():\n\tn = int(rl())\n\tA = list(rli())\n\tAset = set(A)\n\tif 1 in Aset:\n\t\tprint(1)\n\t\treturn\n\tAcnt = Counter(A)\n\tans = 0\n\tfor i, num in enumerate(A):\n\t\tdiv = 2\n\t\tflag = True\n\t\tif Acnt[num] > 1:\n\t\t\tcontinue\n\t\twhile div*div <= num:\n\t\t\tif num % div == 0:\n\t\t\t\tother = num\n\t\t\t\tif div in Aset or other in Aset:\n\t\t\t\t\tflag = False\n\t\t\t\t\tbreak\n\t\t\tdiv += 1\n\t\tif flag:\n\t\t\tans += 1\n\tprint(ans)\n\tstdout.close()\n\nif __name__ == \"__main__\":\n\tmain()", "code2": "from sys import stdin, stdout, setrecursionlimit\nfrom collections import deque, defaultdict, Counter\nimport math\n\nrl = lambda: stdin.readline()\nrll = lambda: stdin.readline().split()\nrli = lambda: map(int, stdin.readline().split())\nrlf = lambda: map(float, stdin.readline().split())\n\nINF, NINF = float('inf'), float('-inf')\n\ndef main():\n\tn = int(rl())\n\tA = list(rli())\n\tindices = defaultdict(lambda: [])\n\tAmax = NINF\n\tif 1 in indices:\n\t\tprint(1 if len(indices[1]) == 1 else 0)\n\t\treturn\n\tA.sort()\t\n\tfor i, num in enumerate(A):\n\t\tindices[num].append(i)\n\t\tAmax = max(Amax, num)\n\tset_false = set()\n\tdp = [1 for _ in range(n)]\n\tfor i, num in enumerate(A):\n\t\tif i in set_false: continue\n\t\tif len(indices[num]) > 1:\n\t\t\tdp[i] = 0\n\t\tcurr = num\n\t\twhile curr <= Amax:\n\t\t\tfor j in indices[curr]:\n\t\t\t\tif i == j: continue\n\t\t\t\tdp[j] = 0\n\t\t\t\tset_false.add(j)\n\t\t\tcurr += num\n\tprint(sum(dp))\n\tstdout.close()\n\nif __name__ == \"__main__\":\n\tmain()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592292163", "date2": "1592294078", "bleu_score": "0.6816845677651134", "code1_test_status": [1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0], "code1_test_score": 32, "total_score": 103, "input": "10\n59 18 45 46 8 19 89 86 2 7\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["from sys import stdin, stdout, setrecursionlimit\nfrom collections import deque, defaultdict, Counter\nimport math\n\nrl = lambda: stdin.readline() # (0): rl= at 0x000001622A1C9BD0>\nrll = lambda: stdin.readline().split() # (1): rll= at 0x000001622A1C9B40>\nrli = lambda: map(int, stdin.readline().split()) # (2): rli= at 0x000001622A1C9C60>\nrlf = lambda: map(float, stdin.readline().split()) # (3): rlf= at 0x000001622A1C9CF0>\n\nINF, NINF = float('inf'), float('-inf') # (4): INF=inf, NINF=-inf\n\ndef main(): # (5): main=\n\tn = int(rl())\n\tA = list(rli())\n\tAset = set(A)\n\tif 1 in Aset:\n\t\tprint(1)\n\t\treturn\n\tAcnt = Counter(A)\n\tans = 0\n\tfor i, num in enumerate(A):\n\t\tdiv = 2\n\t\tflag = True\n\t\tif Acnt[num] > 1:\n\t\t\tcontinue\n\t\twhile div*div <= num:\n\t\t\tif num % div == 0:\n\t\t\t\tother = num\n\t\t\t\tif div in Aset or other in Aset:\n\t\t\t\t\tflag = False\n\t\t\t\t\tbreak\n\t\t\tdiv += 1\n\t\tif flag:\n\t\t\tans += 1\n\tprint(ans)\n\tstdout.close()\n\nif __name__ == \"__main__\":\n\tmain()"], "anno_status": [true], "diff_content": " from sys import stdin, stdout, setrecursionlimit\n from collections import deque, defaultdict, Counter\n import math\n \n rl = lambda: stdin.readline()\n rll = lambda: stdin.readline().split()\n rli = lambda: map(int, stdin.readline().split())\n rlf = lambda: map(float, stdin.readline().split())\n \n INF, NINF = float('inf'), float('-inf')\n \n def main():\n \tn = int(rl())\n \tA = list(rli())\n-\tAset = set(A)\n-\tif 1 in Aset:\n-\t\tprint(1)\n+\tindices = defaultdict(lambda: [])\n+\tAmax = NINF\n+\tif 1 in indices:\n+\t\tprint(1 if len(indices[1]) == 1 else 0)\n \t\treturn\n-\tAcnt = Counter(A)\n-\tans = 0\n+\tA.sort()\t\n \tfor i, num in enumerate(A):\n-\t\tdiv = 2\n-\t\tflag = True\n-\t\tif Acnt[num] > 1:\n-\t\t\tcontinue\n-\t\twhile div*div <= num:\n-\t\t\tif num % div == 0:\n-\t\t\t\tother = num\n-\t\t\t\tif div in Aset or other in Aset:\n-\t\t\t\t\tflag = False\n-\t\t\t\t\tbreak\n-\t\t\tdiv += 1\n-\t\tif flag:\n-\t\t\tans += 1\n-\tprint(ans)\n+\t\tindices[num].append(i)\n+\t\tAmax = max(Amax, num)\n+\tset_false = set()\n+\tdp = [1 for _ in range(n)]\n+\tfor i, num in enumerate(A):\n+\t\tif i in set_false: continue\n+\t\tif len(indices[num]) > 1:\n+\t\t\tdp[i] = 0\n+\t\tcurr = num\n+\t\twhile curr <= Amax:\n+\t\t\tfor j in indices[curr]:\n+\t\t\t\tif i == j: continue\n+\t\t\t\tdp[j] = 0\n+\t\t\t\tset_false.add(j)\n+\t\t\tcurr += num\n+\tprint(sum(dp))\n \tstdout.close()\n \n if __name__ == \"__main__\":\n \tmain()\n", "FL_content": " from sys import stdin, stdout, setrecursionlimit\n from collections import deque, defaultdict, Counter\n import math\n \n rl = lambda: stdin.readline()\n rll = lambda: stdin.readline().split()\n rli = lambda: map(int, stdin.readline().split())\n rlf = lambda: map(float, stdin.readline().split())\n \n INF, NINF = float('inf'), float('-inf')\n \n def main():\n \tn = int(rl())\n \tA = list(rli())\n-\tAset = set(A)\n-\tif 1 in Aset:\n-\t\tprint(1)\n \t\treturn\n-\tAcnt = Counter(A)\n-\tans = 0\n \tfor i, num in enumerate(A):\n-\t\tdiv = 2\n-\t\tflag = True\n-\t\tif Acnt[num] > 1:\n-\t\t\tcontinue\n-\t\twhile div*div <= num:\n-\t\t\tif num % div == 0:\n-\t\t\t\tother = num\n-\t\t\t\tif div in Aset or other in Aset:\n-\t\t\t\t\tflag = False\n-\t\t\t\t\tbreak\n-\t\t\tdiv += 1\n-\t\tif flag:\n-\t\t\tans += 1\n-\tprint(ans)\n \tstdout.close()\n \n if __name__ == \"__main__\":\n \tmain()\n", "added_lines": 21, "removed_lines": 19, "code1_lines": 39 }, { "user_id": "u747602774", "problem_id": "p02642", "submission1_id": "s816759502", "submission2_id": "s978849724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nreadline = sys.stdin.readline\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\n\nINF = 10**18\neps = 10**-7\n\nimport itertools\n\nN = int(readline())\nA = list(map(int,readline().split()))\n\nA.sort()\n\nfrom collections import Counter\nAc = Counter(A)\nA = []\nfor k,v in Ac.items():\n if v == 1:\n A.append(k)\n\ncheck = [[True,False] for i in range(10**6+1)]\nans = 0\nfor a in A:\n if not check[a][0]:\n continue\n for j in range(2*a,10**6+1,a):\n check[j][0] = False\n\nfor a in A:\n if check[a][0]:\n ans += 1\nprint(ans)\n\n", "code2": "import sys\nreadline = sys.stdin.readline\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\n\nINF = 10**18\neps = 10**-7\n\nimport itertools\n\nN = int(readline())\nA = list(map(int,readline().split()))\n\nA.sort()\n\n\ncheck = [[False,False] for i in range(10**6+1)]\nans = 0\nfor a in A:\n if check[a][1]:\n check[a][0] = True\n if check[a][0]:\n continue\n for j in range(2*a,10**6+1,a):\n check[j][0] = True\n check[a][1] = True\n \nfor a in A:\n if not check[a][0]:\n ans += 1\nprint(ans)\n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593833085", "date2": "1593833706", "bleu_score": "0.8212322919039039", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 74, "total_score": 103, "input": "5\n42 11 1 1 16\n", "actual_output": "3\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n readline = sys.stdin.readline\n sys.setrecursionlimit(10**8)\n mod = 10**9+7\n \n INF = 10**18\n eps = 10**-7\n \n import itertools\n \n N = int(readline())\n A = list(map(int,readline().split()))\n \n A.sort()\n \n-from collections import Counter\n-Ac = Counter(A)\n-A = []\n-for k,v in Ac.items():\n- if v == 1:\n- A.append(k)\n \n-check = [[True,False] for i in range(10**6+1)]\n+check = [[False,False] for i in range(10**6+1)]\n ans = 0\n for a in A:\n- if not check[a][0]:\n+ if check[a][1]:\n+ check[a][0] = True\n+ if check[a][0]:\n continue\n for j in range(2*a,10**6+1,a):\n- check[j][0] = False\n-\n+ check[j][0] = True\n+ check[a][1] = True\n+ \n for a in A:\n- if check[a][0]:\n+ if not check[a][0]:\n ans += 1\n print(ans)\n-\n-\n+ \n", "FL_content": " import sys\n readline = sys.stdin.readline\n sys.setrecursionlimit(10**8)\n mod = 10**9+7\n \n INF = 10**18\n eps = 10**-7\n \n import itertools\n \n N = int(readline())\n A = list(map(int,readline().split()))\n \n A.sort()\n \n-from collections import Counter\n-Ac = Counter(A)\n-A = []\n-for k,v in Ac.items():\n- if v == 1:\n- A.append(k)\n \n-check = [[True,False] for i in range(10**6+1)]\n ans = 0\n for a in A:\n- if not check[a][0]:\n continue\n for j in range(2*a,10**6+1,a):\n- check[j][0] = False\n-\n for a in A:\n- if check[a][0]:\n ans += 1\n print(ans)\n-\n-\n", "added_lines": 9, "removed_lines": 13, "code1_lines": 36 }, { "user_id": "u478719560", "problem_id": "p02642", "submission1_id": "s542321219", "submission2_id": "s634208685", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\n\n\n\n\n\n\n\n\n\n\nstdin = sys.stdin\nsys.setrecursionlimit(10 ** 7)\nMIN = -10 ** 9\nMOD = 10 ** 9 + 7\nINF = float(\"inf\")\nIINF = 10 ** 18\n\ndef main():\n n = int(stdin.readline().rstrip())\n \n As = list(map(int, stdin.readline().rstrip().split()))\n \n \n \n \n As.sort(reverse=True)\n l = []\n l.append(As.pop())\n\n for i in range(1,n):\n t = As.pop()\n \n u = len(l)\n flag = False\n for j in range(u):\n if t%l[j] == 0:\n flag=True\n if flag==False:\n l.append(t)\n print(len(l))\n\n\n\n\n\n\nmain()\n", "code2": "import sys\nfrom collections import defaultdict, deque, Counter\n\n\n\n\n\n\n\n\n\n\nstdin = sys.stdin\nsys.setrecursionlimit(10 ** 7)\nMIN = -10 ** 9\nMOD = 10 ** 9 + 7\nINF = float(\"inf\")\nIINF = 10 ** 18\n\ndef main():\n N = int(stdin.readline().rstrip())\n \n A = list(map(int, stdin.readline().rstrip().split()))\n A.sort()\n C = Counter(A)\n cannot = set()\n L= max(A)\n ans = 0\n for a in A:\n if a in cannot: continue\n if C[a] == 1:\n ans += 1\n ind = 1\n while a*ind <= L:\n cannot.add(a*ind)\n ind += 1\n\n print(ans)\n\nmain()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592186069", "date2": "1592783512", "bleu_score": "0.7036825920226799", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 61, "total_score": 103, "input": "10\n33 2 26 28 18 35 89 47 2 4\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["import sys\n\n\n\n\n\n\n\n\n\n\n\nstdin = sys.stdin # (0): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Test\\\\p02642\\\\input_s542321219.txt' mode='r' encoding='utf-8'>\nsys.setrecursionlimit(10 ** 7) # (1): NO CHANGE\nMIN = -10 ** 9 # (2): MIN=-1000000000\nMOD = 10 ** 9 + 7 # (3): MOD=1000000007\nINF = float(\"inf\") # (4): INF=inf\nIINF = 10 ** 18 # (5): IINF=1000000000000000000\n\ndef main(): # (6): main=\n n = int(stdin.readline().rstrip()) # (8): n=10\n \n As = list(map(int, stdin.readline().rstrip().split())) # (9): As=[33, 2, 26, 28, 18, 35, 89, 47, 2, 4]\n \n \n \n \n As.sort(reverse=True) # (10): As=[89, 47, 35, 33, 28, 26, 18, 4, 2, 2]\n l = [] # (11): l=[]\n l.append(As.pop()) # (12): As=[89, 47, 35, 33, 28, 26, 18, 4, 2], l=[2]\n\n for i in range(1,n): # (13): i=1 (22): i=2 ... (106): NO CHANGE\n t = As.pop() # (14): As=[89, 47, 35, 33, 28, 26, 18, 4], t=2 (23): As=[89, 47, 35, 33, 28, 26, 18], t=4 ... (92): As=[], t=89\n \n u = len(l) # (15): u=1 (24): NO CHANGE ... (93): u=4\n flag = False # (16): flag=False (25): flag=False ... (94): NO CHANGE\n for j in range(u): # (17): j=0 (20): NO CHANGE ... (103): NO CHANGE\n if t%l[j] == 0: # (18): NO CHANGE (27): NO CHANGE ... (102): NO CHANGE\n flag=True # (19): flag=True (28): flag=True ... (55): flag=True\n if flag==False: # (21): NO CHANGE (30): NO CHANGE ... (104): NO CHANGE\n l.append(t) # (66): l=[2, 33] (77): l=[2, 33, 35] ... (105): l=[2, 33, 35, 47, 89]\n print(len(l))\n\n\n\n\n\n\nmain() # (7): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n-\n+from collections import defaultdict, deque, Counter\n \n \n \n \n \n \n \n \n \n \n stdin = sys.stdin\n sys.setrecursionlimit(10 ** 7)\n MIN = -10 ** 9\n MOD = 10 ** 9 + 7\n INF = float(\"inf\")\n IINF = 10 ** 18\n \n def main():\n- n = int(stdin.readline().rstrip())\n- \n- As = list(map(int, stdin.readline().rstrip().split()))\n- \n+ N = int(stdin.readline().rstrip())\n \n- \n- \n- As.sort(reverse=True)\n- l = []\n- l.append(As.pop())\n-\n- for i in range(1,n):\n- t = As.pop()\n- \n- u = len(l)\n- flag = False\n- for j in range(u):\n- if t%l[j] == 0:\n- flag=True\n- if flag==False:\n- l.append(t)\n- print(len(l))\n-\n-\n-\n-\n-\n+ A = list(map(int, stdin.readline().rstrip().split()))\n+ A.sort()\n+ C = Counter(A)\n+ cannot = set()\n+ L= max(A)\n+ ans = 0\n+ for a in A:\n+ if a in cannot: continue\n+ if C[a] == 1:\n+ ans += 1\n+ ind = 1\n+ while a*ind <= L:\n+ cannot.add(a*ind)\n+ ind += 1\n+\n+ print(ans)\n \n main()\n \n", "FL_content": " import sys\n-\n \n \n \n \n \n \n \n \n \n \n stdin = sys.stdin\n sys.setrecursionlimit(10 ** 7)\n MIN = -10 ** 9\n MOD = 10 ** 9 + 7\n INF = float(\"inf\")\n IINF = 10 ** 18\n \n def main():\n- n = int(stdin.readline().rstrip())\n- \n- As = list(map(int, stdin.readline().rstrip().split()))\n- \n \n- \n- \n- As.sort(reverse=True)\n- l = []\n- l.append(As.pop())\n-\n- for i in range(1,n):\n- t = As.pop()\n- \n- u = len(l)\n- flag = False\n- for j in range(u):\n- if t%l[j] == 0:\n- flag=True\n- if flag==False:\n- l.append(t)\n- print(len(l))\n-\n-\n-\n-\n-\n \n main()\n \n", "added_lines": 18, "removed_lines": 27, "code1_lines": 50 }, { "user_id": "u136086822", "problem_id": "p02642", "submission1_id": "s909577456", "submission2_id": "s543216380", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\na.sort()\nMAX = int(1e6) + 10\nsieve = [0] * int(MAX)\nfor i in a:\n sieve[i] += 1\nans = 0\nfor idx, val in enumerate(sieve):\n if val == 0:\n continue\n if val > 1:\n sieve[idx] = 0\n continue\n ans += 1\n for i in range(idx * 2, MAX, idx):\n sieve[i] = 0\nprint(ans)", "code2": "n = int(input())\na = list(map(int, input().split()))\na.sort()\nMAX = int(1e6) + 10\nsieve = [0] * int(MAX)\nfor i in a:\n sieve[i] += 1\nans = 0\nfor idx, val in enumerate(sieve):\n if val == 0:\n continue\n elif val > 1:\n sieve[idx] = 0\n else:\n ans += 1\n for i in range(idx * 2, MAX, idx):\n sieve[i] = 0\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593051496", "date2": "1593051948", "bleu_score": "0.9691084366393785", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 74, "total_score": 103, "input": "10\n33 2 26 28 8 42 89 86 2 4\n", "actual_output": "6\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n a.sort()\n MAX = int(1e6) + 10\n sieve = [0] * int(MAX)\n for i in a:\n sieve[i] += 1\n ans = 0\n for idx, val in enumerate(sieve):\n if val == 0:\n continue\n- if val > 1:\n+ elif val > 1:\n sieve[idx] = 0\n- continue\n- ans += 1\n+ else:\n+ ans += 1\n for i in range(idx * 2, MAX, idx):\n sieve[i] = 0\n print(ans)\n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n a.sort()\n MAX = int(1e6) + 10\n sieve = [0] * int(MAX)\n for i in a:\n sieve[i] += 1\n ans = 0\n for idx, val in enumerate(sieve):\n if val == 0:\n continue\n- if val > 1:\n sieve[idx] = 0\n- continue\n- ans += 1\n for i in range(idx * 2, MAX, idx):\n sieve[i] = 0\n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u461454424", "problem_id": "p02642", "submission1_id": "s176438166", "submission2_id": "s401870452", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef main():\n import sys\n imput = sys.stdin.readline\n \n \n \n N = int(input())\n A = list(map(int, input().split()))\n\n \n from collections import Counter\n M = max(A) + 1\n B = [True] * (M)\n A = sorted(A)\n C = Counter(A)\n\n answer = 0\n for a in A:\n if C[a] > 1:\n continue\n elif B[a]:\n answer += 1\n for j in range(a, M, a):\n B[j] = False\n\n print(answer)\n\n \nif __name__ == \"__main__\":\n main()\n", "code2": "\ndef main():\n import sys\n imput = sys.stdin.readline\n \n \n \n N = int(input())\n A = list(map(int, input().split()))\n\n \n from collections import Counter\n M = max(A) + 1\n B = [True] * (M+1)\n A = sorted(A)\n C = Counter(A)\n\n answer = 0\n for a in A:\n if B[a]:\n for j in range(a, M, a):\n B[j] = False\n if C[a] > 1:\n continue\n else:\n answer += 1\n\n print(answer)\n\n \nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592241931", "date2": "1592247040", "bleu_score": "0.9346760067029031", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 74, "total_score": 103, "input": "10\n33 2 41 28 8 25 38 86 2 8\n", "actual_output": "6\n", "expected_output": "3\n\n", "anno_code": ["\ndef main(): # (0): main=\n import sys\n imput = sys.stdin.readline\n \n \n \n N = int(input())\n A = list(map(int, input().split()))\n\n \n from collections import Counter\n M = max(A) + 1\n B = [True] * (M)\n A = sorted(A)\n C = Counter(A)\n\n answer = 0\n for a in A:\n if C[a] > 1:\n continue\n elif B[a]:\n answer += 1\n for j in range(a, M, a):\n B[j] = False\n\n print(answer)\n\n \nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n def main():\n import sys\n imput = sys.stdin.readline\n \n \n \n N = int(input())\n A = list(map(int, input().split()))\n \n \n from collections import Counter\n M = max(A) + 1\n- B = [True] * (M)\n+ B = [True] * (M+1)\n A = sorted(A)\n C = Counter(A)\n \n answer = 0\n for a in A:\n- if C[a] > 1:\n- continue\n- elif B[a]:\n- answer += 1\n+ if B[a]:\n for j in range(a, M, a):\n B[j] = False\n+ if C[a] > 1:\n+ continue\n+ else:\n+ answer += 1\n \n print(answer)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " \n def main():\n import sys\n imput = sys.stdin.readline\n \n \n \n N = int(input())\n A = list(map(int, input().split()))\n \n \n from collections import Counter\n M = max(A) + 1\n- B = [True] * (M)\n A = sorted(A)\n C = Counter(A)\n \n answer = 0\n for a in A:\n- if C[a] > 1:\n- continue\n- elif B[a]:\n- answer += 1\n for j in range(a, M, a):\n B[j] = False\n \n print(answer)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 6, "removed_lines": 5, "code1_lines": 32 }, { "user_id": "u455408345", "problem_id": "p02642", "submission1_id": "s014243065", "submission2_id": "s234146998", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nn=int(input(\"\"))\naa=input(\"\").split(\" \")\nlista=[]\nfor i in range(n):\n lista+=[int(aa[i])]\ns=0\nlista.sort()\ncccc=int(lista[n-1]/lista[0])+1\nlistde=set()\nfor i in range(n-1):\n if(lista[i]==lista[i+1] ):\n listde.add(lista[i])\nt=0\nfor i in range(n):\n t=0\n for k in listde:\n \n if (lista[i]%k==0):\n t=1\n break\n if (t==0):\n s+=1\n if(lista[i]<=cccc):\n listde.add(lista[i])\nprint(s)\n \n \n", "code2": "n=int(input(\"\"))\naa=input(\"\").split(\" \")\nlista=[]\nfor i in range(n):\n lista+=[int(aa[i])]\nlista.sort()\nlisttf=[]\ns=0\nfor i in range(lista[n-1]):\n listtf+=[True]\nfor i in range(n):\n \n if(listtf[lista[i]-1]):\n if(i 1 and A[N-1] == A[N-2] and A[N-1] != last:\n again.append(A[N-1])\n\nfor num in again:\n ban_num = num\n while ban_num <= max_A:\n ban[ban_num] = 1\n ban_num += num\n \nfor num in A:\n if ban[num] != 1:\n ans += 1\n ban_num = num\n while ban_num <= max_A:\n ban[ban_num] = 1\n ban_num += num\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592192143", "date2": "1592193294", "bleu_score": "0.9501839666237442", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 42, "total_score": 103, "input": "4\n7 9 5 5\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["from collections import deque\n\nN = int(input()) # (0): N=4\nA = list(map(int,input().split())) # (1): A=[7, 9, 5, 5]\n\nA.sort() # (2): A=[5, 5, 7, 9]\n\nans = 0 # (3): ans=0\nmax_A = max(A) # (4): max_A=9\nban = [0]*(max_A+1) # (5): ban=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nagain = list() # (6): again=[]\n\nlast = 0 # (7): last=0\nfor i in range(N-1): # (8): i=0 (12): i=1 ... (16): NO CHANGE\n if A[i] == A[i+1] and A[i] != last: # (9): NO CHANGE (13): NO CHANGE (15): NO CHANGE\n again.append(A[i]) # (10): again=[5]\n last = A[i] # (11): last=5\nif A[N-1] != A[N-2]: # (17): NO CHANGE\n again.append(A[N-1]) # (18): again=[5, 9]\n\nfor num in again: # (19): num=5 (25): num=9 (31): NO CHANGE\n ban_num = num # (20): ban_num=5 (26): ban_num=9\n while ban_num <= max_A: # (21): NO CHANGE (24): NO CHANGE ... (30): NO CHANGE\n ban[ban_num] = 1 # (22): ban=[0, 0, 0, 0, 0, 1, 0, 0, 0, 0] (28): ban=[0, 0, 0, 0, 0, 1, 0, 0, 0, 1]\n ban_num += num # (23): ban_num=10 (29): ban_num=18\n \nfor num in A: # (32): num=5 (34): NO CHANGE ... (46): NO CHANGE\n if ban[num] != 1: # (33): NO CHANGE (35): NO CHANGE ... (45): NO CHANGE\n ans += 1 # (38): ans=1\n ban_num = num # (39): ban_num=7\n while ban_num <= max_A: # (40): NO CHANGE (43): NO CHANGE\n ban[ban_num] = 1 # (41): ban=[0, 0, 0, 0, 0, 1, 0, 1, 0, 1]\n ban_num += num # (42): ban_num=14\n\nprint(ans)"], "anno_status": [true], "diff_content": " from collections import deque\n \n N = int(input())\n A = list(map(int,input().split()))\n \n A.sort()\n \n ans = 0\n max_A = max(A)\n ban = [0]*(max_A+1)\n again = list()\n \n last = 0\n for i in range(N-1):\n if A[i] == A[i+1] and A[i] != last:\n again.append(A[i])\n last = A[i]\n-if A[N-1] != A[N-2]:\n+if N > 1 and A[N-1] == A[N-2] and A[N-1] != last:\n again.append(A[N-1])\n \n for num in again:\n ban_num = num\n while ban_num <= max_A:\n ban[ban_num] = 1\n ban_num += num\n \n for num in A:\n if ban[num] != 1:\n ans += 1\n ban_num = num\n while ban_num <= max_A:\n ban[ban_num] = 1\n ban_num += num\n \n print(ans)\n", "FL_content": " from collections import deque\n \n N = int(input())\n A = list(map(int,input().split()))\n \n A.sort()\n \n ans = 0\n max_A = max(A)\n ban = [0]*(max_A+1)\n again = list()\n \n last = 0\n for i in range(N-1):\n if A[i] == A[i+1] and A[i] != last:\n again.append(A[i])\n last = A[i]\n-if A[N-1] != A[N-2]:\n again.append(A[N-1])\n \n for num in again:\n ban_num = num\n while ban_num <= max_A:\n ban[ban_num] = 1\n ban_num += num\n \n for num in A:\n if ban[num] != 1:\n ans += 1\n ban_num = num\n while ban_num <= max_A:\n ban[ban_num] = 1\n ban_num += num\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 35 }, { "user_id": "u111473084", "problem_id": "p02642", "submission1_id": "s177558617", "submission2_id": "s043339732", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n from collections import Counter\n\n N = int(input())\n A = list(map(int, input().split()))\n A.sort()\n counter_A = Counter(A)\n flag = [True] * 1000001\n\n count = 0\n for i in A:\n if counter_A[i] > 1:\n continue\n if flag[i]:\n count += 1\n multiple = i\n while multiple < 1000001:\n flag[multiple] = False\n multiple += i\n\n print(count)\n\n\nmain()", "code2": "def main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n from collections import Counter\n\n N = int(input())\n A = list(map(int, input().split()))\n counter_A = Counter(A)\n flag = [True] * 1000001\n\n count = 0\n for i in sorted(counter_A.keys()):\n if counter_A[i] == 1 and flag[i]:\n count += 1\n multiple = i\n while multiple < 1000001:\n flag[multiple] = False\n multiple += i\n\n print(count)\n\n\nmain()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592189419", "date2": "1592189526", "bleu_score": "0.9116026701254584", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 74, "total_score": 103, "input": "10\n33 2 26 28 8 35 89 86 2 4\n", "actual_output": "6\n", "expected_output": "3\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n from collections import Counter\n \n N = int(input())\n A = list(map(int, input().split()))\n- A.sort()\n counter_A = Counter(A)\n flag = [True] * 1000001\n \n count = 0\n- for i in A:\n- if counter_A[i] > 1:\n- continue\n- if flag[i]:\n+ for i in sorted(counter_A.keys()):\n+ if counter_A[i] == 1 and flag[i]:\n count += 1\n multiple = i\n while multiple < 1000001:\n flag[multiple] = False\n multiple += i\n \n print(count)\n \n \n main()\n", "FL_content": " def main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n from collections import Counter\n \n N = int(input())\n A = list(map(int, input().split()))\n- A.sort()\n counter_A = Counter(A)\n flag = [True] * 1000001\n \n count = 0\n- for i in A:\n- if counter_A[i] > 1:\n- continue\n- if flag[i]:\n count += 1\n multiple = i\n while multiple < 1000001:\n flag[multiple] = False\n multiple += i\n \n print(count)\n \n \n main()\n", "added_lines": 2, "removed_lines": 5, "code1_lines": 27 }, { "user_id": "u025287757", "problem_id": "p02642", "submission1_id": "s434393350", "submission2_id": "s329385952", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inf = 1000005\ndef main():\n N = int(input())\n a = list(map(int, input().split()))\n a.sort()\n detect = [0] *inf\n for i in range(N):\n detect[a[i]] += 1\n if detect[a[i]] >= 2:\n continue\n j = 2\n while (a[i]*j < inf):\n if detect[a[i]*j] >= 2:\n break\n else:\n detect[a[i]*j] += 2\n j+=1\n ans = 0\n for i in range(N):\n if detect[a[i]] == 1:\n ans += 1\n print(ans)\n \nif __name__ == \"__main__\":\n main()", "code2": "inf = 1100000\ndef main():\n N = int(input())\n a = list(map(int, input().split()))\n a.sort()\n detect = [0] *inf\n for x in a:\n if detect[x] != 0:\n detect[x] = 2\n continue\n for i in range(x, inf, x):\n detect[i] += 1\n ans = 0\n for i in range(N):\n if detect[a[i]] == 1:\n ans += 1\n print(ans)\n \nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595955408", "date2": "1595966352", "bleu_score": "0.7052473614582465", "code1_test_status": [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, 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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 103, "input": "10\n11 3 41 17 8 52 89 28 3 4\n", "actual_output": "7\n", "expected_output": "5\n\n", "anno_code": ["inf = 1000005 # (0): inf=1000005\ndef main(): # (1): main=\n N = int(input())\n a = list(map(int, input().split()))\n a.sort()\n detect = [0] *inf\n for i in range(N):\n detect[a[i]] += 1\n if detect[a[i]] >= 2:\n continue\n j = 2\n while (a[i]*j < inf):\n if detect[a[i]*j] >= 2:\n break\n else:\n detect[a[i]*j] += 2\n j+=1\n ans = 0\n for i in range(N):\n if detect[a[i]] == 1:\n ans += 1\n print(ans)\n \nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": "-inf = 1000005\n+inf = 1100000\n def main():\n N = int(input())\n a = list(map(int, input().split()))\n a.sort()\n detect = [0] *inf\n- for i in range(N):\n- detect[a[i]] += 1\n- if detect[a[i]] >= 2:\n+ for x in a:\n+ if detect[x] != 0:\n+ detect[x] = 2\n continue\n- j = 2\n- while (a[i]*j < inf):\n- if detect[a[i]*j] >= 2:\n- break\n- else:\n- detect[a[i]*j] += 2\n- j+=1\n+ for i in range(x, inf, x):\n+ detect[i] += 1\n ans = 0\n for i in range(N):\n if detect[a[i]] == 1:\n ans += 1\n print(ans)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": "-inf = 1000005\n def main():\n N = int(input())\n a = list(map(int, input().split()))\n a.sort()\n detect = [0] *inf\n- for i in range(N):\n- detect[a[i]] += 1\n- if detect[a[i]] >= 2:\n continue\n- j = 2\n- while (a[i]*j < inf):\n- if detect[a[i]*j] >= 2:\n- break\n- else:\n- detect[a[i]*j] += 2\n- j+=1\n ans = 0\n for i in range(N):\n if detect[a[i]] == 1:\n ans += 1\n print(ans)\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 6, "removed_lines": 11, "code1_lines": 25 }, { "user_id": "u623231048", "problem_id": "p02642", "submission1_id": "s139844960", "submission2_id": "s817801809", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\n\na.sort()\nli = [True] * (10**6 + 10)\nans = 0\n\nfor i in range(n):\n if not li[a[i]]:\n continue\n li[a[i]] = False\n if i < n-1:\n if a[i+1] == a[i]:\n continue\n ans += 1\n tmp = a[i]\n while tmp < len(li):\n li[tmp] = False\n tmp += a[i]\n\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int,input().split()))\n\na.sort()\nli = [True] * (10**6 + 10)\nans = 0\n\nfor i in range(n):\n if not li[a[i]]:\n continue\n li[a[i]] = False\n tmp = a[i]\n while tmp < len(li):\n li[tmp] = False\n tmp += a[i]\n if i < n-1:\n if a[i+1] == a[i]:\n continue\n ans += 1\n\n\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592188836", "date2": "1592189293", "bleu_score": "0.9928003474876569", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 74, "total_score": 103, "input": "10\n33 2 41 28 8 25 38 86 2 4\n", "actual_output": "6\n", "expected_output": "3\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n \n a.sort()\n li = [True] * (10**6 + 10)\n ans = 0\n \n for i in range(n):\n if not li[a[i]]:\n continue\n li[a[i]] = False\n- if i < n-1:\n- if a[i+1] == a[i]:\n- continue\n- ans += 1\n tmp = a[i]\n while tmp < len(li):\n li[tmp] = False\n tmp += a[i]\n+ if i < n-1:\n+ if a[i+1] == a[i]:\n+ continue\n+ ans += 1\n+\n \n print(ans)\n \n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n \n a.sort()\n li = [True] * (10**6 + 10)\n ans = 0\n \n for i in range(n):\n if not li[a[i]]:\n continue\n li[a[i]] = False\n- if i < n-1:\n- if a[i+1] == a[i]:\n- continue\n- ans += 1\n tmp = a[i]\n while tmp < len(li):\n li[tmp] = False\n tmp += a[i]\n \n print(ans)\n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 22 }, { "user_id": "u327466606", "problem_id": "p02642", "submission1_id": "s558420596", "submission2_id": "s516943884", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import islice\ndef solve(A):\n memo = [0]*(10**6+1)\n\n for a in A:\n memo[a] += 1\n if memo[1] > 0:\n return 1 if memo[1] == 1 else 0\n\n res = 0\n for i,v in enumerate(islice(memo,2,None),start=2):\n if v > 0:\n res += v\n j = i\n while j <= 10**6:\n memo[j] = 0\n j += i\n return res\n\nif __name__ == '__main__':\n N = int(input())\n A = list(map(int,input().split()))\n print(solve(A))\n", "code2": "from itertools import islice\ndef solve(A):\n memo = [0]*(10**6+1)\n\n for a in A:\n memo[a] += 1\n if memo[1] > 0:\n return 1 if memo[1] == 1 else 0\n\n res = 0\n for i,v in enumerate(islice(memo,2,None),start=2):\n if v > 0:\n res += 1 if v == 1 else 0\n j = i\n while j <= 10**6:\n memo[j] = 0\n j += i\n return res\n\nif __name__ == '__main__':\n N = int(input())\n A = list(map(int,input().split()))\n print(solve(A))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592183938", "date2": "1592184022", "bleu_score": "0.9627694480365927", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 63, "total_score": 103, "input": "10\n60 2 26 28 8 42 89 86 2 4\n", "actual_output": "3\n", "expected_output": "1\n\n", "anno_code": ["from itertools import islice\ndef solve(A): # (0): solve=\n memo = [0]*(10**6+1)\n\n for a in A:\n memo[a] += 1\n if memo[1] > 0:\n return 1 if memo[1] == 1 else 0\n\n res = 0\n for i,v in enumerate(islice(memo,2,None),start=2):\n if v > 0:\n res += v\n j = i\n while j <= 10**6:\n memo[j] = 0\n j += i\n return res\n\nif __name__ == '__main__':\n N = int(input())\n A = list(map(int,input().split()))\n print(solve(A))\n"], "anno_status": [true], "diff_content": " from itertools import islice\n def solve(A):\n memo = [0]*(10**6+1)\n \n for a in A:\n memo[a] += 1\n if memo[1] > 0:\n return 1 if memo[1] == 1 else 0\n \n res = 0\n for i,v in enumerate(islice(memo,2,None),start=2):\n if v > 0:\n- res += v\n+ res += 1 if v == 1 else 0\n j = i\n while j <= 10**6:\n memo[j] = 0\n j += i\n return res\n \n if __name__ == '__main__':\n N = int(input())\n A = list(map(int,input().split()))\n print(solve(A))\n \n", "FL_content": " from itertools import islice\n def solve(A):\n memo = [0]*(10**6+1)\n \n for a in A:\n memo[a] += 1\n if memo[1] > 0:\n return 1 if memo[1] == 1 else 0\n \n res = 0\n for i,v in enumerate(islice(memo,2,None),start=2):\n if v > 0:\n- res += v\n j = i\n while j <= 10**6:\n memo[j] = 0\n j += i\n return res\n \n if __name__ == '__main__':\n N = int(input())\n A = list(map(int,input().split()))\n print(solve(A))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u238504302", "problem_id": "p02642", "submission1_id": "s853036969", "submission2_id": "s687325011", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter as c\nn = int(input())\na = list(map(int,input().split()))\na.sort()\n\ncount, a_max = 0, a[-1]\nli = [-1] * (a_max+1)\n\nfor i in a:\n if li[i] == -1:\n count += 1\n li[i] = 0\n li[i] += 1\n j = 2\n while i * j <= a_max:\n li[i*j] = 0\n j += 1\n\nli.sort(reverse=True)\nfor i in li:\n if i == 1 or i == 0 or i == -1: break\n count -= 1\n\nprint(count)", "code2": "from collections import Counter as c\nn = int(input())\na = list(map(int,input().split()))\na.sort()\n\ncount, a_max = 0, a[-1]\nli = [True] * (a_max+1)\n\nfor i in a:\n if li[i] == \"x\":\n count -= 1\n li[i] = \"y\"\n\n if li[i] == True:\n count += 1\n li[i] = \"x\"\n\n j = 2\n while i * j <= a_max:\n li[i*j] = False\n j += 1\n\nprint(count)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600698088", "date2": "1600699268", "bleu_score": "0.7886867002411253", "code1_test_status": [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, 0, 1, 1, 1, 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, 0, 1, 1, 1, 0, 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], "code1_test_score": 94, "total_score": 103, "input": "10\n33 4 45 28 15 19 89 86 2 4\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["from collections import Counter as c\nn = int(input()) # (0): n=10\na = list(map(int,input().split())) # (1): a=[33, 4, 45, 28, 15, 19, 89, 86, 2, 4]\na.sort() # (2): a=[2, 4, 4, 15, 19, 28, 33, 45, 86, 89]\n\ncount, a_max = 0, a[-1] # (3): count=0, a_max=89\nli = [-1] * (a_max+1) # (4): li=[-1, -1, ..., -1, -1]\n\nfor i in a: # (5): i=2 (141): i=4 ... (350): NO CHANGE\n if li[i] == -1: # (6): NO CHANGE (142): NO CHANGE ... (344): NO CHANGE\n count += 1 # (7): count=1 (279): count=2 ... (345): count=5\n li[i] = 0 # (8): li=[-1, -1, ..., -1, -1] (280): li=[-1, -1, ..., 0, -1] ... (346): li=[-1, -1, ..., 0, 0]\n li[i] += 1 # (9): li=[-1, -1, ..., -1, -1] (143): li=[-1, -1, ..., 0, -1] ... (347): li=[-1, -1, ..., 0, 1]\n j = 2 # (10): j=2 (144): j=2 ... (348): NO CHANGE\n while i * j <= a_max: # (11): NO CHANGE (14): NO CHANGE ... (349): NO CHANGE\n li[i*j] = 0 # (12): li=[-1, -1, ..., -1, -1] (15): li=[-1, -1, ..., -1, -1] ... (330): NO CHANGE\n j += 1 # (13): j=3 (16): j=4 ... (331): j=3\n\nli.sort(reverse=True) # (351): li=[2, 1, ..., -1, -1]\nfor i in li: # (352): i=2 (355): i=1\n if i == 1 or i == 0 or i == -1: break # (353): NO CHANGE (356): NO CHANGE\n count -= 1 # (354): count=4\n\nprint(count)"], "anno_status": [true], "diff_content": " from collections import Counter as c\n n = int(input())\n a = list(map(int,input().split()))\n a.sort()\n \n count, a_max = 0, a[-1]\n-li = [-1] * (a_max+1)\n+li = [True] * (a_max+1)\n \n for i in a:\n- if li[i] == -1:\n+ if li[i] == \"x\":\n+ count -= 1\n+ li[i] = \"y\"\n+\n+ if li[i] == True:\n count += 1\n- li[i] = 0\n- li[i] += 1\n+ li[i] = \"x\"\n+\n j = 2\n while i * j <= a_max:\n- li[i*j] = 0\n+ li[i*j] = False\n j += 1\n \n-li.sort(reverse=True)\n-for i in li:\n- if i == 1 or i == 0 or i == -1: break\n- count -= 1\n-\n print(count)\n", "FL_content": " from collections import Counter as c\n n = int(input())\n a = list(map(int,input().split()))\n a.sort()\n \n count, a_max = 0, a[-1]\n-li = [-1] * (a_max+1)\n \n for i in a:\n- if li[i] == -1:\n count += 1\n- li[i] = 0\n- li[i] += 1\n j = 2\n while i * j <= a_max:\n- li[i*j] = 0\n j += 1\n \n-li.sort(reverse=True)\n-for i in li:\n- if i == 1 or i == 0 or i == -1: break\n- count -= 1\n-\n print(count)\n", "added_lines": 9, "removed_lines": 10, "code1_lines": 24 }, { "user_id": "u709304134", "problem_id": "p02642", "submission1_id": "s165029909", "submission2_id": "s308278147", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nimport bisect\nN = int(input())\nA = list(map(int,input().split()))\n\n\n\ncnt = Counter(A)\nA.sort()\nans = 0\nfor i in range(len(A)):\n if cnt[A[i]] > 1:\n continue\n idx = bisect.bisect_right(A, pow(A[i],0.5))\n J = min(idx+1,i)\n \n ok = True\n for j in range(J):\n \n if A[i] % A[j] == 0:\n ok = False\n break\n if ok:\n ans += 1\nprint (ans)\n\n", "code2": "from collections import Counter\nimport bisect\nN = int(input())\nA = list(map(int,input().split()))\n\n\n\ncnt = Counter(A)\nA.sort()\nans = 0\nP = [0] * (10**6+1)\n\nfor a in A:\n if P[a]==0:\n for i in range(10**7):\n x = a*i\n if x>10**6:\n break\n P[x] = 1\n if cnt[a]==1:\n ans +=1\n\nprint (ans)\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592187684", "date2": "1592188705", "bleu_score": "0.6597279795468808", "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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "10\n11 3 41 17 8 33 89 28 3 4\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["from collections import Counter\nimport bisect\nN = int(input()) # (0): N=10\nA = list(map(int,input().split())) # (1): A=[11, 3, 41, 17, 8, 33, 89, 28, 3, 4]\n\n\n\ncnt = Counter(A) # (2): cnt=Counter({3: 2, 11: 1, 41: 1, 17: 1, 8: 1, 33: 1, 89: 1, 28: 1, 4: 1})\nA.sort() # (3): A=[3, 3, 4, 8, 11, 17, 28, 33, 41, 89]\nans = 0 # (4): ans=0\nfor i in range(len(A)): # (5): i=0 (8): i=1 ... (119): NO CHANGE\n if cnt[A[i]] > 1: # (6): NO CHANGE (9): NO CHANGE ... (102): NO CHANGE\n continue # (7): NO CHANGE (10): NO CHANGE\n idx = bisect.bisect_right(A, pow(A[i],0.5)) # (13): idx=0 (23): NO CHANGE ... (103): idx=4\n J = min(idx+1,i) # (14): J=1 (24): NO CHANGE ... (104): J=5\n \n ok = True # (15): ok=True (25): NO CHANGE ... (105): NO CHANGE\n for j in range(J): # (16): j=0 (18): NO CHANGE ... (116): NO CHANGE\n \n if A[i] % A[j] == 0: # (17): NO CHANGE (27): NO CHANGE ... (115): NO CHANGE\n ok = False # (72): ok=False (82): ok=False\n break # (73): NO CHANGE (83): NO CHANGE\n if ok: # (19): NO CHANGE (29): NO CHANGE ... (117): NO CHANGE\n ans += 1 # (20): ans=1 (30): ans=2 ... (118): ans=6\nprint (ans)\n\n"], "anno_status": [true], "diff_content": " from collections import Counter\n import bisect\n N = int(input())\n A = list(map(int,input().split()))\n \n \n \n cnt = Counter(A)\n A.sort()\n ans = 0\n-for i in range(len(A)):\n- if cnt[A[i]] > 1:\n- continue\n- idx = bisect.bisect_right(A, pow(A[i],0.5))\n- J = min(idx+1,i)\n- \n- ok = True\n- for j in range(J):\n- \n- if A[i] % A[j] == 0:\n- ok = False\n- break\n- if ok:\n- ans += 1\n+P = [0] * (10**6+1)\n+\n+for a in A:\n+ if P[a]==0:\n+ for i in range(10**7):\n+ x = a*i\n+ if x>10**6:\n+ break\n+ P[x] = 1\n+ if cnt[a]==1:\n+ ans +=1\n+\n print (ans)\n \n \n+\n", "FL_content": " from collections import Counter\n import bisect\n N = int(input())\n A = list(map(int,input().split()))\n \n \n \n cnt = Counter(A)\n A.sort()\n ans = 0\n-for i in range(len(A)):\n- if cnt[A[i]] > 1:\n- continue\n- idx = bisect.bisect_right(A, pow(A[i],0.5))\n- J = min(idx+1,i)\n- \n- ok = True\n- for j in range(J):\n- \n- if A[i] % A[j] == 0:\n- ok = False\n- break\n- if ok:\n- ans += 1\n print (ans)\n \n \n", "added_lines": 13, "removed_lines": 14, "code1_lines": 27 }, { "user_id": "u266014018", "problem_id": "p02642", "submission1_id": "s158015966", "submission2_id": "s068280012", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n import sys\n def input(): return sys.stdin.readline().rstrip()\n n = int(input())\n a = list(map(int, input().split()))\n a = list(set(a))\n a_max = max(a)\n is_divable = [True]*(a_max+1)\n ans = 0\n is_divable[0],is_divable[1] = False,False\n for el in a:\n if is_divable[el]:\n ans +=1\n k = 2\n while k*el <= a_max:\n is_divable[k*el] = False\n k+=1\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "def main():\n import sys\n def input(): return sys.stdin.readline().rstrip()\n n = int(input())\n a = list(map(int, input().split()))\n a.sort()\n a_max = a[-1]\n is_divisible = [True]*(a_max+1)\n ans = 0\n is_divisible[0]= False\n el_old = 0\n for el in a:\n if is_divisible[el]:\n if el == el_old:\n ans-=1\n is_divisible[el] = False\n continue\n ans +=1\n k = 2\n while k*el <= a_max:\n is_divisible[k*el] = False\n k+=1\n el_old = el\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592428447", "date2": "1592429860", "bleu_score": "0.7335520672352132", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 44, "total_score": 103, "input": "4\n6 8 2 5\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["def main(): # (0): main=\n import sys\n def input(): return sys.stdin.readline().rstrip()\n n = int(input())\n a = list(map(int, input().split()))\n a = list(set(a))\n a_max = max(a)\n is_divable = [True]*(a_max+1)\n ans = 0\n is_divable[0],is_divable[1] = False,False\n for el in a:\n if is_divable[el]:\n ans +=1\n k = 2\n while k*el <= a_max:\n is_divable[k*el] = False\n k+=1\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n import sys\n def input(): return sys.stdin.readline().rstrip()\n n = int(input())\n a = list(map(int, input().split()))\n- a = list(set(a))\n- a_max = max(a)\n- is_divable = [True]*(a_max+1)\n+ a.sort()\n+ a_max = a[-1]\n+ is_divisible = [True]*(a_max+1)\n ans = 0\n- is_divable[0],is_divable[1] = False,False\n+ is_divisible[0]= False\n+ el_old = 0\n for el in a:\n- if is_divable[el]:\n+ if is_divisible[el]:\n+ if el == el_old:\n+ ans-=1\n+ is_divisible[el] = False\n+ continue\n ans +=1\n k = 2\n while k*el <= a_max:\n- is_divable[k*el] = False\n+ is_divisible[k*el] = False\n k+=1\n+ el_old = el\n print(ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " def main():\n import sys\n def input(): return sys.stdin.readline().rstrip()\n n = int(input())\n a = list(map(int, input().split()))\n- a = list(set(a))\n- a_max = max(a)\n- is_divable = [True]*(a_max+1)\n ans = 0\n- is_divable[0],is_divable[1] = False,False\n for el in a:\n- if is_divable[el]:\n ans +=1\n k = 2\n while k*el <= a_max:\n- is_divable[k*el] = False\n k+=1\n print(ans)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 12, "removed_lines": 6, "code1_lines": 23 }, { "user_id": "u797798686", "problem_id": "p02642", "submission1_id": "s494287652", "submission2_id": "s577374591", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\ndata = stdin.readlines()\n\nn = int(data[0].split()[0])\na = [int(s) for s in data[1].split()]\na = sorted(a)\n\nmax = a[-1]\nprint(max)\n\nl = [0]*(max+1)\n\nfor i in a:\n l[i] += 1\n if l[i] == 1:\n for j in range(i*2,max+1,i):\n l[j] = 2\nprint(l.count(1))", "code2": "from sys import stdin\ndata = stdin.readlines()\n\nn = int(data[0].split()[0])\na = [int(s) for s in data[1].split()]\na = sorted(a)\n\nmax = a[-1]\n\nl = [0]*(max+1)\n\nfor i in a:\n l[i] += 1\n if l[i] == 1:\n for j in range(i*2,max+1,i):\n l[j] = 2\nprint(l.count(1))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593388058", "date2": "1593388118", "bleu_score": "0.9585815752138743", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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\n36 11 8 3 17\n", "actual_output": "36\n4\n", "expected_output": "4\n\n", "anno_code": ["from sys import stdin\ndata = stdin.readlines() # (0): data=['5\\n', '36 11 8 3 17\\n']\n\nn = int(data[0].split()[0]) # (1): n=5\na = [int(s) for s in data[1].split()] # (2): a=[36, 11, 8, 3, 17]\na = sorted(a) # (3): a=[3, 8, 11, 17, 36]\n\nmax = a[-1] # (4): max=36\nprint(max) # (5): NO CHANGE\n\nl = [0]*(max+1) # (6): l=[0, 0, ..., 0, 0]\n\nfor i in a: # (7): i=3 (33): i=8 ... (60): NO CHANGE\n l[i] += 1 # (8): l=[0, 0, ..., 0, 0] (34): l=[0, 0, ..., 0, 2] ... (58): l=[0, 0, ..., 0, 3]\n if l[i] == 1: # (9): NO CHANGE (35): NO CHANGE ... (59): NO CHANGE\n for j in range(i*2,max+1,i): # (10): j=6 (12): j=9 ... (56): NO CHANGE\n l[j] = 2 # (11): l=[0, 0, ..., 0, 0] (13): l=[0, 0, ..., 0, 0] ... (55): l=[0, 0, ..., 0, 2]\nprint(l.count(1))"], "anno_status": [true], "diff_content": " from sys import stdin\n data = stdin.readlines()\n \n n = int(data[0].split()[0])\n a = [int(s) for s in data[1].split()]\n a = sorted(a)\n \n max = a[-1]\n-print(max)\n \n l = [0]*(max+1)\n \n for i in a:\n l[i] += 1\n if l[i] == 1:\n for j in range(i*2,max+1,i):\n l[j] = 2\n print(l.count(1))\n", "FL_content": " from sys import stdin\n data = stdin.readlines()\n \n n = int(data[0].split()[0])\n a = [int(s) for s in data[1].split()]\n a = sorted(a)\n \n max = a[-1]\n-print(max)\n \n l = [0]*(max+1)\n \n for i in a:\n l[i] += 1\n if l[i] == 1:\n for j in range(i*2,max+1,i):\n l[j] = 2\n print(l.count(1))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u105124953", "problem_id": "p02642", "submission1_id": "s209905508", "submission2_id": "s060375441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nli = list(map(int,input().split()))\nans = 0\n\nimport math\nimport bisect\nimport collections\nc = collections.Counter(li)\nli = list(set(li))\n\nwhile len(li)>0:\n ba = li.pop(-1)\n if c[ba]>1:\n continue\n \n \n tmp_li = li\n \n for tt in tmp_li:\n if ba%tt == 0:\n break\n else:\n ans += 1\nprint(ans)", "code2": "n = int(input())\nli = list(map(int,input().split()))\nans = 0\ncnt_li = [0]*(10**6+1)\n\nimport math\nimport bisect\nimport collections\nc = collections.Counter(li)\nli = list(set(li))\nli.sort()\n\nfor l in li:\n for x in range(2,10**7):\n if x*l > (10**6):\n break\n else:\n cnt_li[x*l] += 1\n\n\nwhile len(li)>0:\n ba = li.pop(-1)\n if c[ba]>1:\n continue\n if cnt_li[ba] == 0:\n ans += 1\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592187636", "date2": "1592341354", "bleu_score": "0.744339031288155", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 103, "input": "10\n11 3 41 17 8 33 89 28 3 4\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n = int(input())\n li = list(map(int,input().split()))\n ans = 0\n+cnt_li = [0]*(10**6+1)\n \n import math\n import bisect\n import collections\n c = collections.Counter(li)\n li = list(set(li))\n+li.sort()\n+\n+for l in li:\n+ for x in range(2,10**7):\n+ if x*l > (10**6):\n+ break\n+ else:\n+ cnt_li[x*l] += 1\n+\n \n while len(li)>0:\n ba = li.pop(-1)\n if c[ba]>1:\n continue\n- \n- \n- tmp_li = li\n- \n- for tt in tmp_li:\n- if ba%tt == 0:\n- break\n- else:\n+ if cnt_li[ba] == 0:\n ans += 1\n print(ans)\n+\n", "FL_content": " n = int(input())\n li = list(map(int,input().split()))\n ans = 0\n \n import math\n import bisect\n import collections\n c = collections.Counter(li)\n li = list(set(li))\n \n while len(li)>0:\n ba = li.pop(-1)\n if c[ba]>1:\n continue\n- \n- \n- tmp_li = li\n- \n- for tt in tmp_li:\n- if ba%tt == 0:\n- break\n- else:\n ans += 1\n print(ans)\n", "added_lines": 12, "removed_lines": 8, "code1_lines": 24 }, { "user_id": "u211160392", "problem_id": "p02919", "submission1_id": "s107563635", "submission2_id": "s860953100", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nP = list(map(int,input().split()))\n\nb = [0] * (N + 1)\nl1 = [max(i-1,-1) for i in range(N)]\nr1 = [min(i+1,N) for i in range(N)]\nl2 = [max(i-2,-1) for i in range(N)]\nr2 = [min(i+2,N) for i in range(N)]\n\nans = 0\nfor i in range(N):\n b[P[i]-1] = i \nfor i in range(N):\n m = b[i] \n x1,y1,x2,y2 = l1[m] , r1[m] , l2[m] ,r2[m]\n ans += (i+1) * ((x1-x2) * (y1-m+1) + (y1-y2) * (m-x1))\n \n \n \n if x2 >=0:\n r1[x2] = x1\n r2[x2] = y1\n \n if x1 >= 0:\n r1[x1] = y1 \n r2[x1] = y2\n \n if y1 < N:\n l2[y1] = x2 \n l1[y1] = x1 \n \n if y2 < N:\n l2[y2] = x1\n l1[y2] = y1\nprint(ans)", "code2": "N = int(input())\nP = [0]+list(map(int,input().split()))+[N+1]\nans = 0\nb = [0]*(N+2)\nfor i in range(N+2):\n b[P[i]] = i\nl1 = [max(0,i-1) for i in range(N+2)]\nl2 = [max(0,i-2) for i in range(N+2)]\nr1 = [min(N+1,i+1) for i in range(N+2)]\nr2 = [min(N+1,i+2) for i in range(N+2)]\n\nfor i in range(N+1):\n m = b[i]\n x2,x1,y1,y2 = l2[m],l1[m],r1[m],r2[m]\n hoge= i*(abs((m-x1)*(y2-y1)) + abs((y1-m)*(x1-x2)))\n ans += hoge\n \n r1[x1] = y1\n r2[x1] = y2\n \n l1[y1] = x1\n l2[y1] = x2\n \n r1[x2] = x1\n r2[x2] = y1\n \n l1[y2] = y1\n l2[y2] = x1\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567888776", "date2": "1567891700", "bleu_score": "0.6996094329225943", "code1_test_status": [0, 0, 0], "code1_test_score": 0, "total_score": 3, "input": "5\n1 3 2 4 5\n", "actual_output": "-17\n", "expected_output": "29\n\n", "anno_code": ["N = int(input()) # (0): N=5\nP = list(map(int,input().split())) # (1): P=[1, 3, 2, 4, 5]\n\nb = [0] * (N + 1) # (2): b=[0, 0, 0, 0, 0, 0]\nl1 = [max(i-1,-1) for i in range(N)] # (3): l1=[-1, 0, 1, 2, 3]\nr1 = [min(i+1,N) for i in range(N)] # (4): r1=[1, 2, 3, 4, 5]\nl2 = [max(i-2,-1) for i in range(N)] # (5): l2=[-1, -1, 0, 1, 2]\nr2 = [min(i+2,N) for i in range(N)] # (6): r2=[2, 3, 4, 5, 5]\n\nans = 0 # (7): ans=0\nfor i in range(N): # (8): i=0 (10): i=1 ... (18): NO CHANGE\n b[P[i]-1] = i # (9): NO CHANGE (11): b=[0, 0, 1, 0, 0, 0] ... (17): b=[0, 2, 1, 3, 4, 0]\nfor i in range(N): # (19): i=0 (31): i=1 ... (75): NO CHANGE\n m = b[i] # (20): m=0 (32): m=2 ... (68): m=4\n x1,y1,x2,y2 = l1[m] , r1[m] , l2[m] ,r2[m] # (21): x1=-1, y1=1, x2=-1, y2=2 (33): x1=1, y1=3, y2=4 ... (69): y1=5\n ans += (i+1) * ((x1-x2) * (y1-m+1) + (y1-y2) * (m-x1)) # (22): ans=-1 (34): ans=5 ... (70): NO CHANGE\n \n \n \n if x2 >=0: # (23): NO CHANGE (35): NO CHANGE ... (71): NO CHANGE\n r1[x2] = x1\n r2[x2] = y1\n \n if x1 >= 0: # (24): NO CHANGE (36): NO CHANGE ... (72): NO CHANGE\n r1[x1] = y1 # (37): r1=[1, 3, 3, 4, 5]\n r2[x1] = y2 # (38): r2=[2, 4, 4, 5, 5]\n \n if y1 < N: # (25): NO CHANGE (39): NO CHANGE ... (73): NO CHANGE\n l2[y1] = x2 # (26): NO CHANGE (40): l2=[-1, -1, -1, -1, 2] ... (64): NO CHANGE\n l1[y1] = x1 # (27): l1=[-1, -1, 1, 2, 3] (41): l1=[-1, -1, 1, 1, 3] ... (65): l1=[-1, -1, 1, -1, -1]\n \n if y2 < N: # (28): NO CHANGE (42): NO CHANGE ... (74): NO CHANGE\n l2[y2] = x1 # (29): l2=[-1, -1, -1, 1, 2] (43): l2=[-1, -1, -1, -1, 1] (55): l2=[-1, -1, -1, -1, -1]\n l1[y2] = y1 # (30): NO CHANGE (44): NO CHANGE (56): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n-P = list(map(int,input().split()))\n-\n-b = [0] * (N + 1)\n-l1 = [max(i-1,-1) for i in range(N)]\n-r1 = [min(i+1,N) for i in range(N)]\n-l2 = [max(i-2,-1) for i in range(N)]\n-r2 = [min(i+2,N) for i in range(N)]\n-\n+P = [0]+list(map(int,input().split()))+[N+1]\n ans = 0\n-for i in range(N):\n- b[P[i]-1] = i \n-for i in range(N):\n- m = b[i] \n- x1,y1,x2,y2 = l1[m] , r1[m] , l2[m] ,r2[m]\n- ans += (i+1) * ((x1-x2) * (y1-m+1) + (y1-y2) * (m-x1))\n- \n- \n+b = [0]*(N+2)\n+for i in range(N+2):\n+ b[P[i]] = i\n+l1 = [max(0,i-1) for i in range(N+2)]\n+l2 = [max(0,i-2) for i in range(N+2)]\n+r1 = [min(N+1,i+1) for i in range(N+2)]\n+r2 = [min(N+1,i+2) for i in range(N+2)]\n+\n+for i in range(N+1):\n+ m = b[i]\n+ x2,x1,y1,y2 = l2[m],l1[m],r1[m],r2[m]\n+ hoge= i*(abs((m-x1)*(y2-y1)) + abs((y1-m)*(x1-x2)))\n+ ans += hoge\n \n- if x2 >=0:\n- r1[x2] = x1\n- r2[x2] = y1\n+ r1[x1] = y1\n+ r2[x1] = y2\n \n- if x1 >= 0:\n- r1[x1] = y1 \n- r2[x1] = y2\n+ l1[y1] = x1\n+ l2[y1] = x2\n \n- if y1 < N:\n- l2[y1] = x2 \n- l1[y1] = x1 \n+ r1[x2] = x1\n+ r2[x2] = y1\n \n- if y2 < N:\n- l2[y2] = x1\n- l1[y2] = y1\n+ l1[y2] = y1\n+ l2[y2] = x1\n print(ans)\n", "FL_content": " N = int(input())\n-P = list(map(int,input().split()))\n-\n-b = [0] * (N + 1)\n-l1 = [max(i-1,-1) for i in range(N)]\n-r1 = [min(i+1,N) for i in range(N)]\n-l2 = [max(i-2,-1) for i in range(N)]\n-r2 = [min(i+2,N) for i in range(N)]\n-\n ans = 0\n-for i in range(N):\n- b[P[i]-1] = i \n-for i in range(N):\n- m = b[i] \n- x1,y1,x2,y2 = l1[m] , r1[m] , l2[m] ,r2[m]\n- ans += (i+1) * ((x1-x2) * (y1-m+1) + (y1-y2) * (m-x1))\n- \n- \n \n- if x2 >=0:\n- r1[x2] = x1\n- r2[x2] = y1\n \n- if x1 >= 0:\n- r1[x1] = y1 \n- r2[x1] = y2\n \n- if y1 < N:\n- l2[y1] = x2 \n- l1[y1] = x1 \n \n- if y2 < N:\n- l2[y2] = x1\n- l1[y2] = y1\n print(ans)\n", "added_lines": 22, "removed_lines": 28, "code1_lines": 35 }, { "user_id": "u532966492", "problem_id": "p02919", "submission1_id": "s395818034", "submission2_id": "s008155594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n class unionfind():\n \n def __init__(self,size):\n self.size=size\n self.tree=[i for i in range(self.size)]\n \n \n def root(self,index):\n temp_list=[]\n temp=self.tree[index]\n while index!=temp:\n temp_list.append(index)\n index=temp\n temp=self.tree[index]\n for i in temp_list:\n self.tree[i]=index\n return index\n \n \n def unite_r(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n if r1r2:\n self.tree[r1]=r2\n else:\n self.tree[r2]=r1\n\n \n def same(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n return r1==r2\n \n \n n=int(input())\n a=list(map(int,input().split()))\n d=[0]*n\n for i,j in enumerate(a):\n d[j-1]=i+2\n vis=[False]*(n+4)\n u_r=unionfind(n+4)\n u_l=unionfind(n+4)\n ans=0\n for j,i in enumerate(d[:-1]):\n vis[i]=True\n if vis[i+1]==True:\n u_r.unite_r(i,i+1)\n k1=u_r.root(i+1)+1\n else:\n k1=i+1\n if vis[k1+1]==True:\n cnt1=u_r.root(k1+1)+1\n else:\n cnt1=k1+1\n cnt1=min(cnt1,n+2)\n if vis[i-1]==True:\n u_l.unite_l(i,i-1)\n k2=u_r.root(i-1)-1\n else:\n k2=i-1\n if vis[k2-1]==True:\n cnt2=u_r.root(k2-1)-1\n else:\n cnt2=k2-1\n cnt2=max(cnt2,1)\n ans+=((k2-cnt2)*(k1-i)+(cnt1-k1)*(i-k2))*(j+1)\n print(ans)\nmain()", "code2": "def main():\n class unionfind():\n \n def __init__(self,size):\n self.size=size\n self.tree=[i for i in range(self.size)]\n \n \n def root(self,index):\n temp_list=[]\n temp=self.tree[index]\n while index!=temp:\n temp_list.append(index)\n index=temp\n temp=self.tree[index]\n for i in temp_list:\n self.tree[i]=index\n return index\n \n \n def unite_r(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n if r1r2:\n self.tree[r1]=r2\n else:\n self.tree[r2]=r1\n\n \n def same(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n return r1==r2\n \n \n n=int(input())\n a=list(map(int,input().split()))\n d=[0]*n\n for i,j in enumerate(a):\n d[j-1]=i+2\n vis=[False]*(n+4)\n u_r=unionfind(n+4)\n u_l=unionfind(n+4)\n ans=0\n \n for j,i in enumerate(d[:-1]):\n vis[i]=True\n if vis[i+1]==True:\n u_r.unite_r(i,i+1)\n u_l.unite_l(i,i+1)\n k1=u_r.root(i+1)+1\n else:\n k1=i+1\n if vis[k1+1]==True:\n cnt1=u_r.root(k1+1)+1\n else:\n cnt1=k1+1\n cnt1=min(cnt1,n+2)\n if vis[i-1]==True:\n u_r.unite_r(i,i-1)\n u_l.unite_l(i,i-1)\n k2=u_l.root(i-1)-1\n else:\n k2=i-1\n if vis[k2-1]==True:\n cnt2=u_l.root(k2-1)-1\n else:\n cnt2=k2-1\n cnt2=max(cnt2,1)\n ans+=((k2-cnt2)*(k1-i)+(cnt1-k1)*(i-k2))*(j+1)\n \n print(ans)\nmain()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575925461", "date2": "1575926127", "bleu_score": "0.9595430670590847", "code1_test_status": [1, 1, 0], "code1_test_score": 2, "total_score": 3, "input": "8\n8 1 7 3 4 5 6 2\n", "actual_output": "120\n", "expected_output": "135\n\n", "anno_code": ["def main(): # (0): main=\n class unionfind(): # (2): unionfind=\n \n def __init__(self,size):\n self.size=size # (25): NO CHANGE (28): NO CHANGE\n self.tree=[i for i in range(self.size)] # (26): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=7, j=2, vis=[False, False, False, False, False, False, False, False, False, False, False, False], u_r= (29): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=7, j=2, vis=[False, False, False, False, False, False, False, False, False, False, False, False], u_r=, u_l=\n \n \n def root(self,index):\n temp_list=[] # (68): temp_list=[] (84): temp_list=[] ... (248): temp_list=[]\n temp=self.tree[index] # (69): temp=3 (85): temp=6 ... (249): temp=3\n while index!=temp: # (70): NO CHANGE (86): NO CHANGE ... (250): NO CHANGE\n temp_list.append(index) # (130): temp_list=[6] (183): temp_list=[7]\n index=temp # (131): index=5 (184): index=5\n temp=self.tree[index] # (132): NO CHANGE (185): NO CHANGE\n for i in temp_list: # (71): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=5, j=2, vis=[False, False, False, True, False, True, False, False, False, True, False, False], u_r=, u_l=, ans=4, k1=6, cnt1=7, k2=4, cnt2=2 (87): index1=6, index2=5, r1=6 ... (251): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=4, j=6, vis=[False, False, False, True, True, True, True, True, True, True, False, False], u_r=, u_l=, ans=78, k1=6, cnt1=8, k2=2, cnt2=4\n self.tree[i]=index # (135): NO CHANGE (188): NO CHANGE\n return index\n \n \n def unite_r(self,index1,index2):\n r1=self.root(index1) # (152): index=8 (209): index=4\n r2=self.root(index2) # (157): index=9 (214): index=5\n if r1, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=8, j=5, vis=[False, False, False, True, False, True, True, True, True, True, False, False], u_r=, u_l=, ans=54, k1=8, cnt1=10, k2=5, cnt2=4 (220): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=4, j=6, vis=[False, False, False, True, True, True, True, True, True, True, False, False], u_r=, u_l=, ans=78, k1=10, cnt1=10, k2=6, cnt2=4\n else:\n self.tree[r2]=r1\n\n def unite_l(self,index1,index2):\n r1=self.root(index1) # (83): index=6 (121): index=7 ... (235): index=4\n r2=self.root(index2) # (88): index=5 (126): index=6 ... (240): index=3\n if r1>r2: # (93): NO CHANGE (137): NO CHANGE ... (245): NO CHANGE\n self.tree[r1]=r2 # (94): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=6, j=3, vis=[False, False, False, True, False, True, True, False, False, True, False, False], u_r=, u_l=, ans=13, k1=7, cnt1=8, k2=4, cnt2=2 (138): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=7, j=4, vis=[False, False, False, True, False, True, True, True, False, True, False, False], u_r=, u_l=, ans=29, k1=8, cnt1=10, k2=4, cnt2=2 ... (246): unionfind=, n=8, a=[8, 1, 7, 3, 4, 5, 6, 2], d=[3, 9, 5, 6, 7, 8, 4, 2], i=4, j=6, vis=[False, False, False, True, True, True, True, True, True, True, False, False], u_r=, u_l=, ans=78, k1=6, cnt1=8, k2=6, cnt2=4\n else:\n self.tree[r2]=r1\n\n \n def same(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n return r1==r2\n \n \n n=int(input()) # (3): n=8\n a=list(map(int,input().split())) # (4): a=[8, 1, 7, 3, 4, 5, 6, 2]\n d=[0]*n # (5): d=[0, 0, 0, 0, 0, 0, 0, 0]\n for i,j in enumerate(a): # (6): i=0, j=8 (8): i=1, j=1 ... (22): NO CHANGE\n d[j-1]=i+2 # (7): d=[0, 0, 0, 0, 0, 0, 0, 2] (9): d=[3, 0, 0, 0, 0, 0, 0, 2] ... (21): d=[3, 9, 5, 6, 7, 8, 4, 2]\n vis=[False]*(n+4) # (23): vis=[False, False, False, False, False, False, False, False, False, False, False, False]\n u_r=unionfind(n+4) # (24): self=, size=12\n u_l=unionfind(n+4) # (27): self=, size=12\n ans=0 # (30): ans=0\n for j,i in enumerate(d[:-1]): # (31): i=3, j=0 (44): i=9, j=1 ... (256): NO CHANGE\n vis[i]=True # (32): vis=[False, False, False, True, False, False, False, False, False, False, False, False] (45): vis=[False, False, False, True, False, False, False, False, False, True, False, False] ... (206): vis=[False, False, False, True, True, True, True, True, True, True, False, False]\n if vis[i+1]==True: # (33): NO CHANGE (46): NO CHANGE ... (207): NO CHANGE\n u_r.unite_r(i,i+1) # (151): self=, index1=8, index2=9 (208): self=, index1=4, index2=5\n k1=u_r.root(i+1)+1 # (164): self=, index=9 (221): self=, index=5\n else:\n k1=i+1 # (34): k1=4 (47): k1=10 ... (111): k1=8\n if vis[k1+1]==True: # (35): NO CHANGE (48): NO CHANGE ... (226): NO CHANGE\n cnt1=u_r.root(k1+1)+1 # (113): self=, index=9 (227): self=, index=7\n else:\n cnt1=k1+1 # (36): cnt1=5 (49): cnt1=11 ... (170): cnt1=11\n cnt1=min(cnt1,n+2) # (37): NO CHANGE (50): cnt1=10 ... (232): NO CHANGE\n if vis[i-1]==True: # (38): NO CHANGE (51): NO CHANGE ... (233): NO CHANGE\n u_l.unite_l(i,i-1) # (82): self=, index1=6, index2=5 (120): self=, index1=7, index2=6 ... (234): self=, index1=4, index2=3\n k2=u_r.root(i-1)-1 # (95): self=, index=5 (139): self=, index=6 ... (247): self=, index=3\n else:\n k2=i-1 # (39): k2=2 (52): k2=8 (65): k2=4\n if vis[k2-1]==True: # (40): NO CHANGE (53): NO CHANGE ... (252): NO CHANGE\n cnt2=u_r.root(k2-1)-1 # (67): self=, index=3 (101): self=, index=3 (198): self=, index=5\n else:\n cnt2=k2-1 # (41): cnt2=1 (54): cnt2=7 ... (253): cnt2=1\n cnt2=max(cnt2,1) # (42): NO CHANGE (55): NO CHANGE ... (254): NO CHANGE\n ans+=((k2-cnt2)*(k1-i)+(cnt1-k1)*(i-k2))*(j+1) # (43): ans=2 (56): ans=4 ... (255): ans=120\n print(ans)\nmain() # (1): NO CHANGE\n"], "anno_status": [false], "diff_content": " def main():\n class unionfind():\n \n def __init__(self,size):\n self.size=size\n self.tree=[i for i in range(self.size)]\n \n \n def root(self,index):\n temp_list=[]\n temp=self.tree[index]\n while index!=temp:\n temp_list.append(index)\n index=temp\n temp=self.tree[index]\n for i in temp_list:\n self.tree[i]=index\n return index\n \n \n def unite_r(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n if r1r2:\n self.tree[r1]=r2\n else:\n self.tree[r2]=r1\n \n \n def same(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n return r1==r2\n \n \n n=int(input())\n a=list(map(int,input().split()))\n d=[0]*n\n for i,j in enumerate(a):\n d[j-1]=i+2\n vis=[False]*(n+4)\n u_r=unionfind(n+4)\n u_l=unionfind(n+4)\n ans=0\n+ \n for j,i in enumerate(d[:-1]):\n vis[i]=True\n if vis[i+1]==True:\n u_r.unite_r(i,i+1)\n+ u_l.unite_l(i,i+1)\n k1=u_r.root(i+1)+1\n else:\n k1=i+1\n if vis[k1+1]==True:\n cnt1=u_r.root(k1+1)+1\n else:\n cnt1=k1+1\n cnt1=min(cnt1,n+2)\n if vis[i-1]==True:\n+ u_r.unite_r(i,i-1)\n u_l.unite_l(i,i-1)\n- k2=u_r.root(i-1)-1\n+ k2=u_l.root(i-1)-1\n else:\n k2=i-1\n if vis[k2-1]==True:\n- cnt2=u_r.root(k2-1)-1\n+ cnt2=u_l.root(k2-1)-1\n else:\n cnt2=k2-1\n cnt2=max(cnt2,1)\n ans+=((k2-cnt2)*(k1-i)+(cnt1-k1)*(i-k2))*(j+1)\n+ \n print(ans)\n main()\n+\n", "FL_content": " def main():\n class unionfind():\n \n def __init__(self,size):\n self.size=size\n self.tree=[i for i in range(self.size)]\n \n \n def root(self,index):\n temp_list=[]\n temp=self.tree[index]\n while index!=temp:\n temp_list.append(index)\n index=temp\n temp=self.tree[index]\n for i in temp_list:\n self.tree[i]=index\n return index\n \n \n def unite_r(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n if r1r2:\n self.tree[r1]=r2\n else:\n self.tree[r2]=r1\n \n \n def same(self,index1,index2):\n r1=self.root(index1)\n r2=self.root(index2)\n return r1==r2\n \n \n n=int(input())\n a=list(map(int,input().split()))\n d=[0]*n\n for i,j in enumerate(a):\n d[j-1]=i+2\n vis=[False]*(n+4)\n u_r=unionfind(n+4)\n u_l=unionfind(n+4)\n ans=0\n for j,i in enumerate(d[:-1]):\n vis[i]=True\n if vis[i+1]==True:\n u_r.unite_r(i,i+1)\n k1=u_r.root(i+1)+1\n else:\n k1=i+1\n if vis[k1+1]==True:\n cnt1=u_r.root(k1+1)+1\n else:\n cnt1=k1+1\n cnt1=min(cnt1,n+2)\n if vis[i-1]==True:\n u_l.unite_l(i,i-1)\n- k2=u_r.root(i-1)-1\n else:\n k2=i-1\n if vis[k2-1]==True:\n- cnt2=u_r.root(k2-1)-1\n else:\n cnt2=k2-1\n cnt2=max(cnt2,1)\n ans+=((k2-cnt2)*(k1-i)+(cnt1-k1)*(i-k2))*(j+1)\n print(ans)\n main()\n", "added_lines": 7, "removed_lines": 2, "code1_lines": 77 }, { "user_id": "u223904637", "problem_id": "p02919", "submission1_id": "s292877265", "submission2_id": "s940923098", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\n\n\nclass SqrtSet:\n def __init__(self, block_limit=201):\n self.key = []\n self.child = [[]]\n self.block_limit = block_limit\n\n def search_lower(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_left(self.key, key)\n if i != 0:\n ret = self.key[i - 1]\n block = self.child[i]\n i = bisect.bisect_left(block, key)\n if i != 0:\n ret = block[i - 1]\n return ret\n \n def search_higher(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_right(self.key, key)\n if i != len(self.key):\n ret = self.key[i]\n block = self.child[i]\n i = bisect.bisect_right(block, key)\n if i != len(block):\n ret = block[i]\n return ret\n\n def insert(self, key):\n i = bisect.bisect(self.key, key)\n block = self.child[i]\n bisect.insort(block, key)\n if len(block) == self.block_limit:\n sep = self.block_limit \n self.key.insert(i, block[sep])\n self.child.insert(i + 1, block[sep + 1:])\n self.child[i] = block[:sep]\n \n def dump(self):\n for b in self.child:\n print(len(b), end=\" \")\n print(\"\")\n \n \ndef main():\n n = int(input())\n p = list(map(int, input().split()))\n idx = [0] * n\n for i in range(0, n):\n idx[i] = i\n idx.sort(key=lambda i: -p[i])\n t = SqrtSet()\n t.insert(-10)\n t.insert(n+10)\n ans = 0\n for i in range(n):\n if i==0:\n t.insert(idx[i])\n continue\n ri = t.search_higher(idx[i])\n pri = t.search_higher(ri)\n if pri==None:\n pri=n\n ri=n\n if pri==n+10:\n pri=n\n le = t.search_lower(idx[i])\n ple=t.search_lower(le)\n if ple==None:\n if le==-10:\n le=-1\n ple=-1\n if ple==-10:\n ple=-1\n \n ans+=(n-i)*((le-ple)*(ri-idx[i])+(pri-ri)*(idx[i]-le))\n \n t.insert(idx[i])\n print(ans)\n", "code2": "import bisect\n\n\nclass SqrtSet:\n def __init__(self, block_limit=201):\n self.key = []\n self.child = [[]]\n self.block_limit = block_limit\n\n def search_lower(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_left(self.key, key)\n if i != 0:\n ret = self.key[i - 1]\n block = self.child[i]\n i = bisect.bisect_left(block, key)\n if i != 0:\n ret = block[i - 1]\n return ret\n \n def search_higher(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_right(self.key, key)\n if i != len(self.key):\n ret = self.key[i]\n block = self.child[i]\n i = bisect.bisect_right(block, key)\n if i != len(block):\n ret = block[i]\n return ret\n\n def insert(self, key):\n i = bisect.bisect(self.key, key)\n block = self.child[i]\n bisect.insort(block, key)\n if len(block) == self.block_limit:\n sep = self.block_limit \n self.key.insert(i, block[sep])\n self.child.insert(i + 1, block[sep + 1:])\n self.child[i] = block[:sep]\n \n def dump(self):\n for b in self.child:\n print(len(b), end=\" \")\n print(\"\")\n \n \ndef main():\n n = int(input())\n p = list(map(int, input().split()))\n idx = [0] * n\n for i in range(0, n):\n idx[i] = i\n idx.sort(key=lambda i: -p[i])\n t = SqrtSet()\n t.insert(-10)\n t.insert(n+10)\n ans = 0\n for i in range(n):\n if i==0:\n t.insert(idx[i])\n continue\n ri = t.search_higher(idx[i])\n pri = t.search_higher(ri)\n if pri==None:\n pri=n\n ri=n\n if pri==n+10:\n pri=n\n le = t.search_lower(idx[i])\n ple=t.search_lower(le)\n if ple==None:\n if le==-10:\n le=-1\n ple=-1\n if ple==-10:\n ple=-1\n \n ans+=(n-i)*((le-ple)*(ri-idx[i])+(pri-ri)*(idx[i]-le))\n \n t.insert(idx[i])\n print(ans)\nmain()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584637535", "date2": "1584637592", "bleu_score": "0.9972470742917852", "code1_test_status": [0, 0, 0], "code1_test_score": 0, "total_score": 3, "input": "8\n8 1 7 3 4 5 6 2\n", "actual_output": "", "expected_output": "135\n\n", "anno_code": ["import bisect\n\n\nclass SqrtSet: # (0): SqrtSet=\n def __init__(self, block_limit=201):\n self.key = []\n self.child = [[]]\n self.block_limit = block_limit\n\n def search_lower(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_left(self.key, key)\n if i != 0:\n ret = self.key[i - 1]\n block = self.child[i]\n i = bisect.bisect_left(block, key)\n if i != 0:\n ret = block[i - 1]\n return ret\n \n def search_higher(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_right(self.key, key)\n if i != len(self.key):\n ret = self.key[i]\n block = self.child[i]\n i = bisect.bisect_right(block, key)\n if i != len(block):\n ret = block[i]\n return ret\n\n def insert(self, key):\n i = bisect.bisect(self.key, key)\n block = self.child[i]\n bisect.insort(block, key)\n if len(block) == self.block_limit:\n sep = self.block_limit \n self.key.insert(i, block[sep])\n self.child.insert(i + 1, block[sep + 1:])\n self.child[i] = block[:sep]\n \n def dump(self):\n for b in self.child:\n print(len(b), end=\" \")\n print(\"\")\n \n \ndef main():\n n = int(input())\n p = list(map(int, input().split()))\n idx = [0] * n\n for i in range(0, n):\n idx[i] = i\n idx.sort(key=lambda i: -p[i])\n t = SqrtSet()\n t.insert(-10)\n t.insert(n+10)\n ans = 0\n for i in range(n):\n if i==0:\n t.insert(idx[i])\n continue\n ri = t.search_higher(idx[i])\n pri = t.search_higher(ri)\n if pri==None:\n pri=n\n ri=n\n if pri==n+10:\n pri=n\n le = t.search_lower(idx[i])\n ple=t.search_lower(le)\n if ple==None:\n if le==-10:\n le=-1\n ple=-1\n if ple==-10:\n ple=-1\n \n ans+=(n-i)*((le-ple)*(ri-idx[i])+(pri-ri)*(idx[i]-le))\n \n t.insert(idx[i])\n print(ans)\n"], "anno_status": [true], "diff_content": " import bisect\n \n \n class SqrtSet:\n def __init__(self, block_limit=201):\n self.key = []\n self.child = [[]]\n self.block_limit = block_limit\n \n def search_lower(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_left(self.key, key)\n if i != 0:\n ret = self.key[i - 1]\n block = self.child[i]\n i = bisect.bisect_left(block, key)\n if i != 0:\n ret = block[i - 1]\n return ret\n \n def search_higher(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_right(self.key, key)\n if i != len(self.key):\n ret = self.key[i]\n block = self.child[i]\n i = bisect.bisect_right(block, key)\n if i != len(block):\n ret = block[i]\n return ret\n \n def insert(self, key):\n i = bisect.bisect(self.key, key)\n block = self.child[i]\n bisect.insort(block, key)\n if len(block) == self.block_limit:\n sep = self.block_limit \n self.key.insert(i, block[sep])\n self.child.insert(i + 1, block[sep + 1:])\n self.child[i] = block[:sep]\n \n def dump(self):\n for b in self.child:\n print(len(b), end=\" \")\n print(\"\")\n \n \n def main():\n n = int(input())\n p = list(map(int, input().split()))\n idx = [0] * n\n for i in range(0, n):\n idx[i] = i\n idx.sort(key=lambda i: -p[i])\n t = SqrtSet()\n t.insert(-10)\n t.insert(n+10)\n ans = 0\n for i in range(n):\n if i==0:\n t.insert(idx[i])\n continue\n ri = t.search_higher(idx[i])\n pri = t.search_higher(ri)\n if pri==None:\n pri=n\n ri=n\n if pri==n+10:\n pri=n\n le = t.search_lower(idx[i])\n ple=t.search_lower(le)\n if ple==None:\n if le==-10:\n le=-1\n ple=-1\n if ple==-10:\n ple=-1\n \n ans+=(n-i)*((le-ple)*(ri-idx[i])+(pri-ri)*(idx[i]-le))\n \n t.insert(idx[i])\n print(ans)\n-\n+main()\n", "FL_content": " import bisect\n \n \n class SqrtSet:\n def __init__(self, block_limit=201):\n self.key = []\n self.child = [[]]\n self.block_limit = block_limit\n \n def search_lower(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_left(self.key, key)\n if i != 0:\n ret = self.key[i - 1]\n block = self.child[i]\n i = bisect.bisect_left(block, key)\n if i != 0:\n ret = block[i - 1]\n return ret\n \n def search_higher(self, key):\n if key is None:\n return None\n ret = None\n i = bisect.bisect_right(self.key, key)\n if i != len(self.key):\n ret = self.key[i]\n block = self.child[i]\n i = bisect.bisect_right(block, key)\n if i != len(block):\n ret = block[i]\n return ret\n \n def insert(self, key):\n i = bisect.bisect(self.key, key)\n block = self.child[i]\n bisect.insort(block, key)\n if len(block) == self.block_limit:\n sep = self.block_limit \n self.key.insert(i, block[sep])\n self.child.insert(i + 1, block[sep + 1:])\n self.child[i] = block[:sep]\n \n def dump(self):\n for b in self.child:\n print(len(b), end=\" \")\n print(\"\")\n \n \n def main():\n n = int(input())\n p = list(map(int, input().split()))\n idx = [0] * n\n for i in range(0, n):\n idx[i] = i\n idx.sort(key=lambda i: -p[i])\n t = SqrtSet()\n t.insert(-10)\n t.insert(n+10)\n ans = 0\n for i in range(n):\n if i==0:\n t.insert(idx[i])\n continue\n ri = t.search_higher(idx[i])\n pri = t.search_higher(ri)\n if pri==None:\n pri=n\n ri=n\n if pri==n+10:\n pri=n\n le = t.search_lower(idx[i])\n ple=t.search_lower(le)\n if ple==None:\n if le==-10:\n le=-1\n ple=-1\n if ple==-10:\n ple=-1\n \n ans+=(n-i)*((le-ple)*(ri-idx[i])+(pri-ri)*(idx[i]-le))\n \n t.insert(idx[i])\n print(ans)\n-\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 87 }, { "user_id": "u734548018", "problem_id": "p02919", "submission1_id": "s958610435", "submission2_id": "s603110144", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nN = int(input())\nPn = list(map(int, input().split()))\n\nIn = [0] * (N+1)\nfor i in range(N):\n In[Pn[i]] = i+1\nprint(Pn)\nprint(In)\n\ncnt = 0\nl = [0] + [i for i in range(N+1)]\nr = [i+1 for i in range((N+1))] + [N+1]\n\nfor v in range(1, N+1):\n i = In[v]\n \n l1 = l[i]\n l2 = l[l1]\n r1 = r[i]\n r2 = r[r1]\n cnt += ((l1-l2) * (r1-i) + (i-l1) * (r2-r1)) * v\n \n l[r1] = l1\n r[l1] = r1\n \nprint(cnt)\n", "code2": "\n\n\n\n\nN = int(input())\nPn = list(map(int, input().split()))\n\nIn = [0] * (N+1)\nfor i in range(N):\n In[Pn[i]] = i+1\n\ncnt = 0\nl = [0] + [i for i in range(N+1)]\nr = [i+1 for i in range((N+1))] + [N+1]\n\nfor v in range(1, N+1):\n i = In[v]\n \n l1 = l[i]\n l2 = l[l1]\n r1 = r[i]\n r2 = r[r1]\n cnt += ((l1-l2) * (r1-i) + (i-l1) * (r2-r1)) * v\n \n l[r1] = l1\n r[l1] = r1\n \nprint(cnt)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567984725", "date2": "1567984752", "bleu_score": "0.9472467917244564", "code1_test_status": [0, 0, 0], "code1_test_score": 0, "total_score": 3, "input": "5\n1 3 2 4 5\n", "actual_output": "[1, 3, 2, 4, 5]\n[0, 1, 3, 2, 4, 5]\n29\n", "expected_output": "29\n\n", "anno_code": ["\n\n\n\n\nN = int(input()) # (0): N=5\nPn = list(map(int, input().split())) # (1): Pn=[1, 3, 2, 4, 5]\n\nIn = [0] * (N+1) # (2): In=[0, 0, 0, 0, 0, 0]\nfor i in range(N): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n In[Pn[i]] = i+1 # (4): In=[0, 1, 0, 0, 0, 0] (6): In=[0, 1, 0, 2, 0, 0] ... (12): In=[0, 1, 3, 2, 4, 5]\nprint(Pn) # (14): NO CHANGE\nprint(In) # (15): NO CHANGE\n\ncnt = 0 # (16): cnt=0\nl = [0] + [i for i in range(N+1)] # (17): l=[0, 0, 1, 2, 3, 4, 5]\nr = [i+1 for i in range((N+1))] + [N+1] # (18): r=[1, 2, 3, 4, 5, 6, 6]\n\nfor v in range(1, N+1): # (19): v=1 (28): v=2 ... (64): NO CHANGE\n i = In[v] # (20): i=1 (29): i=3 ... (56): i=5\n \n l1 = l[i] # (21): l1=0 (30): l1=2 ... (57): NO CHANGE\n l2 = l[l1] # (22): l2=0 (31): NO CHANGE ... (58): NO CHANGE\n r1 = r[i] # (23): r1=2 (32): r1=4 ... (59): r1=6\n r2 = r[r1] # (24): r2=3 (33): r2=5 ... (60): NO CHANGE\n cnt += ((l1-l2) * (r1-i) + (i-l1) * (r2-r1)) * v # (25): cnt=1 (34): cnt=7 ... (61): NO CHANGE\n \n l[r1] = l1 # (26): l=[0, 0, 0, 2, 3, 4, 5] (35): l=[0, 0, 0, 2, 2, 4, 5] ... (62): l=[0, 0, 0, 2, 0, 0, 0]\n r[l1] = r1 # (27): r=[2, 2, 3, 4, 5, 6, 6] (36): r=[2, 2, 4, 4, 5, 6, 6] ... (63): r=[6, 2, 4, 4, 5, 6, 6]\n \nprint(cnt)\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n N = int(input())\n Pn = list(map(int, input().split()))\n \n In = [0] * (N+1)\n for i in range(N):\n In[Pn[i]] = i+1\n-print(Pn)\n-print(In)\n \n cnt = 0\n l = [0] + [i for i in range(N+1)]\n r = [i+1 for i in range((N+1))] + [N+1]\n \n for v in range(1, N+1):\n i = In[v]\n \n l1 = l[i]\n l2 = l[l1]\n r1 = r[i]\n r2 = r[r1]\n cnt += ((l1-l2) * (r1-i) + (i-l1) * (r2-r1)) * v\n \n l[r1] = l1\n r[l1] = r1\n \n print(cnt)\n \n", "FL_content": " \n \n \n \n \n N = int(input())\n Pn = list(map(int, input().split()))\n \n In = [0] * (N+1)\n for i in range(N):\n In[Pn[i]] = i+1\n-print(Pn)\n-print(In)\n \n cnt = 0\n l = [0] + [i for i in range(N+1)]\n r = [i+1 for i in range((N+1))] + [N+1]\n \n for v in range(1, N+1):\n i = In[v]\n \n l1 = l[i]\n l2 = l[l1]\n r1 = r[i]\n r2 = r[r1]\n cnt += ((l1-l2) * (r1-i) + (i-l1) * (r2-r1)) * v\n \n l[r1] = l1\n r[l1] = r1\n \n print(cnt)\n \n", "added_lines": 0, "removed_lines": 2, "code1_lines": 32 }, { "user_id": "u947883560", "problem_id": "p02919", "submission1_id": "s879481824", "submission2_id": "s407632595", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nINF = float(\"inf\")\n\n\nclass MaxBit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n s = 0\n while i > 0:\n s = max(s, self.tree[i])\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = max(self.tree[i], x)\n i += i & -i\n\n\nclass MinBit:\n def __init__(self, n):\n self.size = n\n self.tree = [n-1] * (n + 1)\n\n def sum(self, i):\n s = self.size-1\n while i > 0:\n s = min(s, self.tree[i])\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = min(self.tree[i], x)\n i += i & -i\n\n\ndef solve(N: int, P: \"List[int]\"):\n\n prev = MaxBit(N+2)\n foll = MinBit(N+2)\n seq = [0]*(N+2)\n\n inv = {p: i for i, p in enumerate(P)}\n \n\n ans = 0\n for i in range(N, 0, -1):\n prev.add(inv[i]+2, inv[i]+1)\n foll.add(N-inv[i]+1, inv[i]+1)\n seq[inv[i]+1] = i\n\n \n \n \n \n \n p = prev.sum(inv[i]+1)\n pp = prev.sum(p)\n f = foll.sum(N-inv[i])\n ff = foll.sum(N-f+1)\n \n if p > 0:\n \n ans += i*(p - pp)\n \n ans += i*(f - (inv[i]+1))\n ans -= i\n \n \n \n \n if f < N+1:\n \n ans += i*(inv[i]+1 - p)\n \n ans += i*(ff - f)\n ans -= i\n \n \n \n print(ans)\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 P = [int(next(tokens)) for _ in range(N)] \n solve(N, P)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\n\nINF = float(\"inf\")\n\n\nclass MaxBit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n s = 0\n while i > 0:\n s = max(s, self.tree[i])\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = max(self.tree[i], x)\n i += i & -i\n\n\nclass MinBit:\n def __init__(self, n):\n self.size = n\n self.tree = [n-1] * (n + 1)\n\n def sum(self, i):\n s = self.size-1\n while i > 0:\n s = min(s, self.tree[i])\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = min(self.tree[i], x)\n i += i & -i\n\n\ndef solve(N: int, P: \"List[int]\"):\n\n prev = MaxBit(N+2)\n foll = MinBit(N+2)\n seq = [0]*(N+2)\n\n inv = {p: i for i, p in enumerate(P)}\n \n \n\n ans = 0\n for i in range(N, 0, -1):\n prev.add(inv[i]+2, inv[i]+1)\n foll.add(N-inv[i]+1, inv[i]+1)\n seq[inv[i]+1] = i\n\n \n \n \n \n \n p = prev.sum(inv[i]+1)\n pp = prev.sum(p)\n f = foll.sum(N-inv[i])\n ff = foll.sum(N-f+1)\n \n if p > 0:\n \n ans += i*(p-pp)*(f-(inv[i]+1))\n \n \n \n if f < N+1:\n \n ans += i*(inv[i]+1 - p) * (ff - f)\n \n \n print(ans)\n \n\n \n \n \n \n \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 P = [int(next(tokens)) for _ in range(N)] \n solve(N, P)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1568090461", "date2": "1568091112", "bleu_score": "0.939044128407758", "code1_test_status": [1, 1, 0], "code1_test_score": 2, "total_score": 3, "input": "8\n8 1 7 3 4 5 6 2\n", "actual_output": "119\n", "expected_output": "135\n\n", "anno_code": ["\nimport sys\nINF = float(\"inf\") # (0): INF=inf\n\n\nclass MaxBit: # (1): MaxBit=\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n s = 0\n while i > 0:\n s = max(s, self.tree[i])\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = max(self.tree[i], x)\n i += i & -i\n\n\nclass MinBit: # (2): MinBit=\n def __init__(self, n):\n self.size = n\n self.tree = [n-1] * (n + 1)\n\n def sum(self, i):\n s = self.size-1\n while i > 0:\n s = min(s, self.tree[i])\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = min(self.tree[i], x)\n i += i & -i\n\n\ndef solve(N: int, P: \"List[int]\"): # (3): solve=\n\n prev = MaxBit(N+2)\n foll = MinBit(N+2)\n seq = [0]*(N+2)\n\n inv = {p: i for i, p in enumerate(P)}\n \n\n ans = 0\n for i in range(N, 0, -1):\n prev.add(inv[i]+2, inv[i]+1)\n foll.add(N-inv[i]+1, inv[i]+1)\n seq[inv[i]+1] = i\n\n \n \n \n \n \n p = prev.sum(inv[i]+1)\n pp = prev.sum(p)\n f = foll.sum(N-inv[i])\n ff = foll.sum(N-f+1)\n \n if p > 0:\n \n ans += i*(p - pp)\n \n ans += i*(f - (inv[i]+1))\n ans -= i\n \n \n \n \n if f < N+1:\n \n ans += i*(inv[i]+1 - p)\n \n ans += i*(ff - f)\n ans -= i\n \n \n \n print(ans)\n return\n\n\ndef main(): # (4): 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 P = [int(next(tokens)) for _ in range(N)] \n solve(N, P)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n+\n INF = float(\"inf\")\n \n \n class MaxBit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n \n def sum(self, i):\n s = 0\n while i > 0:\n s = max(s, self.tree[i])\n i -= i & -i\n return s\n \n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = max(self.tree[i], x)\n i += i & -i\n \n \n class MinBit:\n def __init__(self, n):\n self.size = n\n self.tree = [n-1] * (n + 1)\n \n def sum(self, i):\n s = self.size-1\n while i > 0:\n s = min(s, self.tree[i])\n i -= i & -i\n return s\n \n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = min(self.tree[i], x)\n i += i & -i\n \n \n def solve(N: int, P: \"List[int]\"):\n \n prev = MaxBit(N+2)\n foll = MinBit(N+2)\n seq = [0]*(N+2)\n \n inv = {p: i for i, p in enumerate(P)}\n \n+ \n \n ans = 0\n for i in range(N, 0, -1):\n prev.add(inv[i]+2, inv[i]+1)\n foll.add(N-inv[i]+1, inv[i]+1)\n seq[inv[i]+1] = i\n \n \n \n \n \n \n p = prev.sum(inv[i]+1)\n pp = prev.sum(p)\n f = foll.sum(N-inv[i])\n ff = foll.sum(N-f+1)\n \n if p > 0:\n \n- ans += i*(p - pp)\n- \n- ans += i*(f - (inv[i]+1))\n- ans -= i\n- \n+ ans += i*(p-pp)*(f-(inv[i]+1))\n \n \n \n if f < N+1:\n \n- ans += i*(inv[i]+1 - p)\n- \n- ans += i*(ff - f)\n- ans -= i\n- \n+ ans += i*(inv[i]+1 - p) * (ff - f)\n \n \n print(ans)\n+ \n+\n+ \n+ \n+ \n+ \n+ \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 P = [int(next(tokens)) for _ in range(N)] \n solve(N, P)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n INF = float(\"inf\")\n \n \n class MaxBit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n \n def sum(self, i):\n s = 0\n while i > 0:\n s = max(s, self.tree[i])\n i -= i & -i\n return s\n \n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = max(self.tree[i], x)\n i += i & -i\n \n \n class MinBit:\n def __init__(self, n):\n self.size = n\n self.tree = [n-1] * (n + 1)\n \n def sum(self, i):\n s = self.size-1\n while i > 0:\n s = min(s, self.tree[i])\n i -= i & -i\n return s\n \n def add(self, i, x):\n while i <= self.size:\n self.tree[i] = min(self.tree[i], x)\n i += i & -i\n \n \n def solve(N: int, P: \"List[int]\"):\n \n prev = MaxBit(N+2)\n foll = MinBit(N+2)\n seq = [0]*(N+2)\n \n inv = {p: i for i, p in enumerate(P)}\n \n \n ans = 0\n for i in range(N, 0, -1):\n prev.add(inv[i]+2, inv[i]+1)\n foll.add(N-inv[i]+1, inv[i]+1)\n seq[inv[i]+1] = i\n \n \n \n \n \n \n p = prev.sum(inv[i]+1)\n pp = prev.sum(p)\n f = foll.sum(N-inv[i])\n ff = foll.sum(N-f+1)\n \n if p > 0:\n \n- ans += i*(p - pp)\n- \n- ans += i*(f - (inv[i]+1))\n- ans -= i\n- \n \n \n \n if f < N+1:\n \n- ans += i*(inv[i]+1 - p)\n- \n- ans += i*(ff - f)\n- ans -= i\n- \n \n \n print(ans)\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 P = [int(next(tokens)) for _ in range(N)] \n solve(N, P)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 12, "removed_lines": 10, "code1_lines": 104 }, { "user_id": "u798803522", "problem_id": "p01359", "submission1_id": "s879596365", "submission2_id": "s605280988", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inputnum,outputnum = (int(n) for n in input().split(' '))\ndata = {}\nwhile True:\n for i in range(inputnum):\n temp = input().split(' ')\n data[temp[0]] = [int(temp[2]) - int(temp[1]) + 1,int(temp[2])]\n for o in range(outputnum):\n targ = int(input())\n for k,v in data.items():\n if v[0] <= targ <= v[1]:\n print(k + ' ' + str(targ-v[0] + 1))\n break\n else:\n print(\"Unknown\")\n inputnum,outputnum = (int(n) for n in input().split(' '))\n if inputnum == outputnum == 0:\n break", "code2": "inputnum,outputnum = (int(n) for n in input().split(' '))\nwhile True:\n data = {}\n for i in range(inputnum):\n temp = input().split(' ')\n data[temp[0]] = [int(temp[2]) - int(temp[1]) + 1,int(temp[2])]\n for o in range(outputnum):\n targ = int(input())\n for k,v in data.items():\n if v[0] <= targ <= v[1]:\n print(k + ' ' + str(targ-v[0] + 1))\n break\n else:\n print(\"Unknown\")\n inputnum,outputnum = (int(n) for n in input().split(' '))\n if inputnum == outputnum == 0:\n break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1473606821", "date2": "1473606956", "bleu_score": "0.989108766890112", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0], "code1_test_score": 42, "total_score": 101, "input": "4 3\nmeiji 15 1877\ntaisho 4 1917\nrhoaw 62 1987\nheisei 32 2010\n2046\n1917\n1988\n1 1\nuniversalbentury 123 2168\n2010\n0 0\n", "actual_output": "Unknown\ntaisho 4\nheisei 10\nheisei 32\n", "expected_output": "Unknown\ntaisho 4\nheisei 10\nUnknown\n\n", "anno_code": ["inputnum,outputnum = (int(n) for n in input().split(' ')) # (0): inputnum=4, outputnum=3\ndata = {} # (1): data={}\nwhile True: # (2): NO CHANGE (51): NO CHANGE\n for i in range(inputnum): # (3): i=0 (6): i=1 ... (55): NO CHANGE\n temp = input().split(' ') # (4): temp=['meiji', '15', '1877'] (7): temp=['taisho', '4', '1917'] ... (53): temp=['universalbentury', '123', '2168']\n data[temp[0]] = [int(temp[2]) - int(temp[1]) + 1,int(temp[2])] # (5): data={'meiji': [1863, 1877]} (8): data={'meiji': [1863, 1877], 'taisho': [1914, 1917]} ... (54): data={'meiji': [1863, 1877], 'taisho': [1914, 1917], 'rhoaw': [1926, 1987], 'heisei': [1979, 2010], 'universalbentury': [2046, 2168]}\n for o in range(outputnum): # (16): o=0 (28): o=1 ... (68): NO CHANGE\n targ = int(input()) # (17): targ=2046 (29): targ=1917 ... (57): targ=2010\n for k,v in data.items(): # (18): k=meiji, v=[1863, 1877] (20): k=taisho, v=[1914, 1917] ... (64): k=heisei, v=[1979, 2010]\n if v[0] <= targ <= v[1]: # (19): NO CHANGE (21): NO CHANGE ... (65): NO CHANGE\n print(k + ' ' + str(targ-v[0] + 1)) # (34): NO CHANGE (46): NO CHANGE (66): NO CHANGE\n break # (35): NO CHANGE (47): NO CHANGE (67): NO CHANGE\n else:\n print(\"Unknown\") # (27): NO CHANGE\n inputnum,outputnum = (int(n) for n in input().split(' ')) # (49): inputnum=1, outputnum=1 (69): inputnum=0, outputnum=0\n if inputnum == outputnum == 0: # (50): NO CHANGE (70): NO CHANGE\n break"], "anno_status": [true], "diff_content": " inputnum,outputnum = (int(n) for n in input().split(' '))\n-data = {}\n while True:\n+ data = {}\n for i in range(inputnum):\n temp = input().split(' ')\n data[temp[0]] = [int(temp[2]) - int(temp[1]) + 1,int(temp[2])]\n for o in range(outputnum):\n targ = int(input())\n for k,v in data.items():\n if v[0] <= targ <= v[1]:\n print(k + ' ' + str(targ-v[0] + 1))\n break\n else:\n print(\"Unknown\")\n inputnum,outputnum = (int(n) for n in input().split(' '))\n if inputnum == outputnum == 0:\n break\n", "FL_content": " inputnum,outputnum = (int(n) for n in input().split(' '))\n-data = {}\n while True:\n for i in range(inputnum):\n temp = input().split(' ')\n data[temp[0]] = [int(temp[2]) - int(temp[1]) + 1,int(temp[2])]\n for o in range(outputnum):\n targ = int(input())\n for k,v in data.items():\n if v[0] <= targ <= v[1]:\n print(k + ' ' + str(targ-v[0] + 1))\n break\n else:\n print(\"Unknown\")\n inputnum,outputnum = (int(n) for n in input().split(' '))\n if inputnum == outputnum == 0:\n break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u703950586", "problem_id": "p02962", "submission1_id": "s277494570", "submission2_id": "s974562383", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 27 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n i = 0\n while True:\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(27,lent-1,MOD)\n h = (h * 27 + cx(s[i % lens])) % MOD\n if h == hsh:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and ans > 0:\n cnt = 0\n f = True\n if i > lens*2 and i > lent:\n break\n i += 1\n\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 26 + cx(x)) % MOD\n\n n = (lens+lent) * 2 + 1\n dp = [0] * n\n\n h = 0\n ans = 0\n for i in range(n):\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i % lens])) % MOD\n if h == hsh:\n if i < lent:\n dp[i] = 1\n else:\n dp[i] = dp[i-lent] + 1\n ans = max(ans,dp[i])\n\n if n - ans * lent < lent * 2:\n print(-1)\n else:\n print(ans)\n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592911012", "date2": "1593050639", "bleu_score": "0.78307581782716", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "aa`bdca\naa\n", "actual_output": "2\n", "expected_output": "1\n", "anno_code": ["import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main(): # (0): main=\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 27 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n i = 0\n while True:\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(27,lent-1,MOD)\n h = (h * 27 + cx(s[i % lens])) % MOD\n if h == hsh:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and ans > 0:\n cnt = 0\n f = True\n if i > lens*2 and i > lent:\n break\n i += 1\n\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n hsh = 0\n for x in t:\n- hsh = (hsh * 27 + cx(x)) % MOD\n+ hsh = (hsh * 26 + cx(x)) % MOD\n+\n+ n = (lens+lent) * 2 + 1\n+ dp = [0] * n\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- i = 0\n- while True:\n+ for i in range(n):\n if i >= lent:\n- h -= cx(s[(i - lent)%lens]) * pow(27,lent-1,MOD)\n- h = (h * 27 + cx(s[i % lens])) % MOD\n+ h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n+ h = (h * 26 + cx(s[i % lens])) % MOD\n if h == hsh:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and ans > 0:\n- cnt = 0\n- f = True\n- if i > lens*2 and i > lent:\n- break\n- i += 1\n-\n- if f or ans == 0:\n- print(ans)\n- else:\n+ if i < lent:\n+ dp[i] = 1\n+ else:\n+ dp[i] = dp[i-lent] + 1\n+ ans = max(ans,dp[i])\n+\n+ if n - ans * lent < lent * 2:\n print(-1)\n+ else:\n+ print(ans)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n hsh = 0\n for x in t:\n- hsh = (hsh * 27 + cx(x)) % MOD\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- i = 0\n- while True:\n if i >= lent:\n- h -= cx(s[(i - lent)%lens]) * pow(27,lent-1,MOD)\n- h = (h * 27 + cx(s[i % lens])) % MOD\n if h == hsh:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and ans > 0:\n- cnt = 0\n- f = True\n- if i > lens*2 and i > lent:\n- break\n- i += 1\n-\n- if f or ans == 0:\n- print(ans)\n- else:\n print(-1)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 16, "removed_lines": 22, "code1_lines": 47 }, { "user_id": "u794173881", "problem_id": "p02962", "submission1_id": "s765625510", "submission2_id": "s944927355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nt = input()\n\ndef z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n\ndef solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = \"\"\nwhile True:\n new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\nprint(1)\nexit()\n\ns = s*3\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans1 = 0\nfor i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n\ns += s\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans2 = 0\nfor i in range(len(li)):\n ans2 = max(ans2, solve(i, li))\n\nif ans1 == ans2:\n print(ans1)\nelse:\n print(-1)\n", "code2": "s = input()\nt = input()\n\ndef z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n\ndef solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = s\nwhile True:\n if len(new_s) > len(t):\n s = new_s\n break\n new_s += new_s\n\ns = s*3\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans1 = 0\nfor i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n\ns += s\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans2 = 0\nfor i in range(len(li)):\n ans2 = max(ans2, solve(i, li))\n\nif ans1 == ans2:\n print(ans1)\nelse:\n print(-1)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564611607", "date2": "1564611749", "bleu_score": "0.9822171618238525", "code1_test_status": [0, 1, 0, 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, 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], "code1_test_score": 8, "total_score": 103, "input": "aa`bdcb\n^_\n", "actual_output": "1\n", "expected_output": "0\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " s = input()\n t = input()\n \n def z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n \n def solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n \n \n-new_s = \"\"\n+new_s = s\n while True:\n- new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n-print(1)\n-exit()\n+ new_s += new_s\n \n s = s*3\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans1 = 0\n for i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n \n s += s\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans2 = 0\n for i in range(len(li)):\n ans2 = max(ans2, solve(i, li))\n \n if ans1 == ans2:\n print(ans1)\n else:\n print(-1)\n \n", "FL_content": " s = input()\n t = input()\n \n def z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n \n def solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n \n \n-new_s = \"\"\n while True:\n- new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n-print(1)\n-exit()\n \n s = s*3\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans1 = 0\n for i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n \n s += s\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans2 = 0\n for i in range(len(li)):\n ans2 = max(ans2, solve(i, li))\n \n if ans1 == ans2:\n print(ans1)\n else:\n print(-1)\n \n", "added_lines": 2, "removed_lines": 4, "code1_lines": 66 }, { "user_id": "u703950586", "problem_id": "p02962", "submission1_id": "s013563536", "submission2_id": "s974562383", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 2\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent:\n cnt = 0\n f = True\n if f:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 26 + cx(x)) % MOD\n\n n = (lens+lent) * 2 + 1\n dp = [0] * n\n\n h = 0\n ans = 0\n for i in range(n):\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i % lens])) % MOD\n if h == hsh:\n if i < lent:\n dp[i] = 1\n else:\n dp[i] = dp[i-lent] + 1\n ans = max(ans,dp[i])\n\n if n - ans * lent < lent * 2:\n print(-1)\n else:\n print(ans)\n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592783680", "date2": "1593050639", "bleu_score": "0.8639005113764672", "code1_test_status": [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, 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, 1], "code1_test_score": 68, "total_score": 103, "input": "b`\nbaaa`a`\n", "actual_output": "-1\n", "expected_output": "0\n", "anno_code": ["import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main(): # (0): main=\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 2\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent:\n cnt = 0\n f = True\n if f:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 2\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n+ hsh = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n+ hsh = (hsh * 26 + cx(x)) % MOD\n+\n+ n = (lens+lent) * 2 + 1\n+ dp = [0] * n\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n+ for i in range(n):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent:\n- cnt = 0\n- f = True\n- if f:\n- print(ans)\n- else:\n+ h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n+ h = (h * 26 + cx(s[i % lens])) % MOD\n+ if h == hsh:\n+ if i < lent:\n+ dp[i] = 1\n+ else:\n+ dp[i] = dp[i-lent] + 1\n+ ans = max(ans,dp[i])\n+\n+ if n - ans * lent < lent * 2:\n print(-1)\n+ else:\n+ print(ans)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 2\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent:\n- cnt = 0\n- f = True\n- if f:\n- print(ans)\n- else:\n print(-1)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 18, "removed_lines": 20, "code1_lines": 43 }, { "user_id": "u794173881", "problem_id": "p02962", "submission1_id": "s361867117", "submission2_id": "s944927355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nt = input()\n\ndef z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n\ndef solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = \"\"\nwhile True:\n new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n\ns = s\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans1 = 0\nfor i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n\nprint(ans1)", "code2": "s = input()\nt = input()\n\ndef z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n\ndef solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = s\nwhile True:\n if len(new_s) > len(t):\n s = new_s\n break\n new_s += new_s\n\ns = s*3\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans1 = 0\nfor i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n\ns += s\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans2 = 0\nfor i in range(len(li)):\n ans2 = max(ans2, solve(i, li))\n\nif ans1 == ans2:\n print(ans1)\nelse:\n print(-1)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564611488", "date2": "1564611749", "bleu_score": "0.834546660591856", "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, 0, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "ab`bdca\naa\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["s = input() # (0): s=ab`bdca\nt = input() # (1): t=aa\n\ndef z_algorithm(s): # (2): z_algorithm=\n a = [0] * len(s) # (12): a=[0, 0, 0, 0, 0, 0, 0, 0, 0]\n i = 1 # (13): i=1\n j = 0 # (14): j=0\n a[0] = len(s) # (15): a=[9, 0, 0, 0, 0, 0, 0, 0, 0]\n while i < len(s): # (16): NO CHANGE (28): NO CHANGE ... (76): s=ab`bdca, t=aa, z_algorithm=, solve=, new_s=ab`bdca, li=[1, 0, 0, 0, 0, 0, 1]\n while i + j < len(s) and s[j] == s[i+j]: # (17): NO CHANGE (19): NO CHANGE ... (69): NO CHANGE\n j += 1 # (18): j=1 (20): j=2 (68): j=1\n a[i] = j # (22): a=[9, 2, 0, 0, 0, 0, 0, 0, 0] (30): a=[9, 2, 1, 0, 0, 0, 0, 0, 0] ... (70): a=[9, 2, 1, 0, 0, 0, 0, 0, 1]\n if j == 0: # (23): NO CHANGE (31): NO CHANGE ... (71): NO CHANGE\n i += 1 # (40): i=4 (46): i=5 ... (64): i=8\n continue # (41): NO CHANGE (47): NO CHANGE ... (65): NO CHANGE\n k = 1 # (24): k=1 (32): NO CHANGE (72): NO CHANGE\n while i + k < len(s) and k + a[k] < j: # (25): NO CHANGE (33): NO CHANGE (73): NO CHANGE\n a[i+k] = a[k]\n k += 1\n i += k # (26): i=2 (34): i=3 (74): i=9\n j -= k # (27): j=1 (35): j=0 (75): j=0\n return a\n\ndef solve(i, li): # (3): solve=\n ans = 0 # (81): ans=0 (89): ans=0 ... (129): ans=0\n while True: # (82): NO CHANGE (90): NO CHANGE ... (130): NO CHANGE\n if i < 0 or len(li) <= i or visited[i]: # (83): NO CHANGE (91): NO CHANGE ... (131): NO CHANGE\n break\n if li[i] < len(t): # (84): NO CHANGE (92): NO CHANGE ... (132): NO CHANGE\n visited[i] = True # (85): NO CHANGE (93): NO CHANGE ... (133): NO CHANGE\n break # (86): s=ab`bdca, t=aa, z_algorithm=, solve=, new_s=ab`bdca, visited=[True, False, False, False, False, False, False], ans1=0 (94): s=ab`bdca, t=aa, z_algorithm=, solve=, new_s=ab`bdca, visited=[True, True, False, False, False, False, False], ans1=0 ... (134): s=ab`bdca, t=aa, z_algorithm=, solve=, new_s=ab`bdca, visited=[True, True, True, True, True, True, True], ans1=0\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = \"\" # (4): new_s=\nwhile True: # (5): NO CHANGE\n new_s += s # (6): new_s=ab`bdca\n if len(new_s) > len(t): # (7): NO CHANGE\n s = new_s # (8): NO CHANGE\n break # (9): NO CHANGE\n\ns = s # (10): NO CHANGE\nli = z_algorithm(t + s)[len(t):] # (11): s=aaab`bdca\nvisited = [False] * len(li) # (77): visited=[False, False, False, False, False, False, False]\nans1 = 0 # (78): ans1=0\nfor i in range(len(li)): # (79): i=0 (87): i=1 ... (135): NO CHANGE\n ans1 = max(ans1, solve(i, li)) # (80): NO CHANGE (88): NO CHANGE ... (128): NO CHANGE\n\nprint(ans1)"], "anno_status": [false], "diff_content": " s = input()\n t = input()\n \n def z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n \n def solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n \n \n-new_s = \"\"\n+new_s = s\n while True:\n- new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n+ new_s += new_s\n \n-s = s\n+s = s*3\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans1 = 0\n for i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n \n-print(ans1)\n+s += s\n+li = z_algorithm(t + s)[len(t):]\n+visited = [False] * len(li)\n+ans2 = 0\n+for i in range(len(li)):\n+ ans2 = max(ans2, solve(i, li))\n+\n+if ans1 == ans2:\n+ print(ans1)\n+else:\n+ print(-1)\n+\n", "FL_content": " s = input()\n t = input()\n \n def z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n \n def solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n \n \n-new_s = \"\"\n while True:\n- new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n \n-s = s\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans1 = 0\n for i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n \n-print(ans1)\n", "added_lines": 15, "removed_lines": 4, "code1_lines": 53 }, { "user_id": "u353797797", "problem_id": "p02962", "submission1_id": "s946356729", "submission2_id": "s199731146", "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 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 LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef SI(): return sys.stdin.readline()[:-1]\n\ndef LcpByZ(target):\n len_t = len(target)\n lcp = [-1] * len_t\n top = 1 \n left = 0 \n right = 0 \n lcp[0] = 0\n while top < len_t:\n \n while top + right < len_t and target[right] == target[top + right]:\n right += 1\n \n lcp[top] = right\n left = 1\n \n if right == 0:\n top += 1\n continue\n \n while left + lcp[left] < right and left < right:\n lcp[top + left] = lcp[left]\n left += 1\n \n top += left\n right -= left\n left = 0 \n return lcp\n\ndef main():\n tt = t + t\n while len(tt) < len(s): tt += t\n ss = s\n while len(ss) < len(tt) * 2: ss += s\n \n if tt in ss:return -1\n\n while len(tt) < len(ss): tt += t\n lcp=LcpByZ(tt+\"@\"+ss)\n \n tn=len(t)\n ans=max(lcp[len(tt):])\n return ans\n\ns=SI()\nt=SI()\nprint(main())\n\n", "code2": "import sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\np2D = lambda x: print(*x, sep=\"\\n\")\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 LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef SI(): return sys.stdin.readline()[:-1]\n\ndef LcpByZ(target):\n len_t = len(target)\n lcp = [-1] * len_t\n top = 1 \n left = 0 \n right = 0 \n lcp[0] = 0\n while top < len_t:\n \n while top + right < len_t and target[right] == target[top + right]:\n right += 1\n \n lcp[top] = right\n left = 1\n \n if right == 0:\n top += 1\n continue\n \n while left + lcp[left] < right and left < right:\n lcp[top + left] = lcp[left]\n left += 1\n \n top += left\n right -= left\n left = 0 \n return lcp\n\ndef dfs(i,si):\n dp[i]=0\n ni=(i+tn)%sn\n if lcp[tn+1+ni]!=tn:return False\n if ni==si:return True\n if dp[ni]==-1 and dfs(ni,si):return True\n dp[i]=dp[ni]+1\n\ns=SI()\nt=SI()\nss = s\nwhile len(ss) < len(s) + len(t): ss += s\nlcp = LcpByZ(t + \"@\" + ss)\nsn = len(s)\ntn = len(t)\ndp=[-1]*sn\nfor i in range(sn):\n if dp[i]!=-1:continue\n if dfs(i,i):\n print(-1)\n exit()\nprint(max(dp))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594215550", "date2": "1594217488", "bleu_score": "0.8368976285949621", "code1_test_status": [0, 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, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 54, "total_score": 103, "input": "^^c\nc`_aa\n", "actual_output": "1\n", "expected_output": "0\n", "anno_code": ["import sys\n\nsys.setrecursionlimit(10 ** 6) # (0): NO CHANGE\nint1 = lambda x: int(x) - 1 # (1): int1= at 0x000001B0C47D9BD0>\np2D = lambda x: print(*x, sep=\"\\n\") # (2): p2D= at 0x000001B0C47D9B40>, II=, MI=, LI=, LLI=, SI=\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 LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef SI(): return sys.stdin.readline()[:-1]\n\ndef LcpByZ(target): # (3): LcpByZ=\n len_t = len(target) # (21): len_t=47\n lcp = [-1] * len_t # (22): lcp=[-1, -1, ..., -1, -1]\n top = 1 # (23): top=1\n left = 0 # (24): left=0\n right = 0 # (25): right=0\n lcp[0] = 0 # (26): lcp=[0, -1, ..., -1, -1]\n while top < len_t: # (27): NO CHANGE (34): NO CHANGE ... (361): tt=c`_aac`_aac`_aac`_aac`_aa, ss=^^c^^c^^c^^c^^c^^c^^c\n \n while top + right < len_t and target[right] == target[top + right]: # (28): NO CHANGE (35): NO CHANGE ... (353): NO CHANGE\n right += 1 # (57): right=1 (59): right=2 ... (352): right=1\n \n lcp[top] = right # (29): lcp=[0, 0, ..., -1, -1] (36): lcp=[0, 0, ..., -1, -1] ... (354): lcp=[0, 0, ..., 0, 1]\n left = 1 # (30): left=1 (37): NO CHANGE ... (355): NO CHANGE\n \n if right == 0: # (31): NO CHANGE (38): NO CHANGE ... (356): NO CHANGE\n top += 1 # (32): top=2 (39): top=3 ... (348): top=46\n continue # (33): NO CHANGE (40): NO CHANGE ... (349): NO CHANGE\n \n while left + lcp[left] < right and left < right: # (100): NO CHANGE (103): NO CHANGE ... (357): NO CHANGE\n lcp[top + left] = lcp[left] # (101): lcp=[0, 0, ..., -1, -1] (104): lcp=[0, 0, ..., -1, -1] ... (173): lcp=[0, 0, ..., -1, -1]\n left += 1 # (102): left=2 (105): left=3 ... (174): left=5\n \n top += left # (113): top=10 (134): top=15 ... (358): top=47\n right -= left # (114): right=15 (135): right=10 ... (359): right=0\n left = 0 # (115): left=0 (136): left=0 ... (360): left=0\n return lcp\n\ndef main(): # (4): main=\n tt = t + t # (8): tt=c`_aac`_aa\n while len(tt) < len(s): tt += t # (9): NO CHANGE\n ss = s # (10): ss=^^c\n while len(ss) < len(tt) * 2: ss += s # (11): ss=^^c^^c (12): ss=^^c^^c^^c ... (16): ss=^^c^^c^^c^^c^^c^^c^^c\n \n if tt in ss:return -1\n\n while len(tt) < len(ss): tt += t # (17): tt=c`_aac`_aac`_aa (18): tt=c`_aac`_aac`_aac`_aa (19): tt=c`_aac`_aac`_aac`_aac`_aa\n lcp=LcpByZ(tt+\"@\"+ss) # (20): target=c`_aac`_aac`_aac`_aac`_aa@^^c^^c^^c^^c^^c^^c^^c\n \n tn=len(t) # (362): tn=5\n ans=max(lcp[len(tt):])\n return ans\n\ns=SI() # (5): s=^^c\nt=SI() # (6): t=c`_aa\nprint(main()) # (7): NO CHANGE\n\n"], "anno_status": [false], "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 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 LLI(rows_number): return [LI() for _ in range(rows_number)]\n def SI(): return sys.stdin.readline()[:-1]\n \n def LcpByZ(target):\n len_t = len(target)\n lcp = [-1] * len_t\n top = 1 \n left = 0 \n right = 0 \n lcp[0] = 0\n while top < len_t:\n \n while top + right < len_t and target[right] == target[top + right]:\n right += 1\n \n lcp[top] = right\n left = 1\n \n if right == 0:\n top += 1\n continue\n \n while left + lcp[left] < right and left < right:\n lcp[top + left] = lcp[left]\n left += 1\n \n top += left\n right -= left\n left = 0 \n return lcp\n \n-def main():\n- tt = t + t\n- while len(tt) < len(s): tt += t\n- ss = s\n- while len(ss) < len(tt) * 2: ss += s\n- \n- if tt in ss:return -1\n-\n- while len(tt) < len(ss): tt += t\n- lcp=LcpByZ(tt+\"@\"+ss)\n- \n- tn=len(t)\n- ans=max(lcp[len(tt):])\n- return ans\n+def dfs(i,si):\n+ dp[i]=0\n+ ni=(i+tn)%sn\n+ if lcp[tn+1+ni]!=tn:return False\n+ if ni==si:return True\n+ if dp[ni]==-1 and dfs(ni,si):return True\n+ dp[i]=dp[ni]+1\n \n s=SI()\n t=SI()\n-print(main())\n-\n+ss = s\n+while len(ss) < len(s) + len(t): ss += s\n+lcp = LcpByZ(t + \"@\" + ss)\n+sn = len(s)\n+tn = len(t)\n+dp=[-1]*sn\n+for i in range(sn):\n+ if dp[i]!=-1:continue\n+ if dfs(i,i):\n+ print(-1)\n+ exit()\n+print(max(dp))\n \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 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 LLI(rows_number): return [LI() for _ in range(rows_number)]\n def SI(): return sys.stdin.readline()[:-1]\n \n def LcpByZ(target):\n len_t = len(target)\n lcp = [-1] * len_t\n top = 1 \n left = 0 \n right = 0 \n lcp[0] = 0\n while top < len_t:\n \n while top + right < len_t and target[right] == target[top + right]:\n right += 1\n \n lcp[top] = right\n left = 1\n \n if right == 0:\n top += 1\n continue\n \n while left + lcp[left] < right and left < right:\n lcp[top + left] = lcp[left]\n left += 1\n \n top += left\n right -= left\n left = 0 \n return lcp\n \n-def main():\n- tt = t + t\n- while len(tt) < len(s): tt += t\n- ss = s\n- while len(ss) < len(tt) * 2: ss += s\n- \n- if tt in ss:return -1\n-\n- while len(tt) < len(ss): tt += t\n- lcp=LcpByZ(tt+\"@\"+ss)\n- \n- tn=len(t)\n- ans=max(lcp[len(tt):])\n- return ans\n \n s=SI()\n t=SI()\n-print(main())\n-\n \n", "added_lines": 19, "removed_lines": 16, "code1_lines": 59 }, { "user_id": "u703950586", "problem_id": "p02962", "submission1_id": "s593109485", "submission2_id": "s974562383", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 3\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and last_i > 0:\n cnt = 0\n f = True\n if f:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 26 + cx(x)) % MOD\n\n n = (lens+lent) * 2 + 1\n dp = [0] * n\n\n h = 0\n ans = 0\n for i in range(n):\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i % lens])) % MOD\n if h == hsh:\n if i < lent:\n dp[i] = 1\n else:\n dp[i] = dp[i-lent] + 1\n ans = max(ans,dp[i])\n\n if n - ans * lent < lent * 2:\n print(-1)\n else:\n print(ans)\n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592784161", "date2": "1593050639", "bleu_score": "0.8476529939455857", "code1_test_status": [0, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 9, "total_score": 103, "input": "^^b\nc`_a`\n", "actual_output": "-1\n", "expected_output": "0\n", "anno_code": ["import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main(): # (0): main=\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 3\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and last_i > 0:\n cnt = 0\n f = True\n if f:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 3\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n+ hsh = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n+ hsh = (hsh * 26 + cx(x)) % MOD\n+\n+ n = (lens+lent) * 2 + 1\n+ dp = [0] * n\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n+ for i in range(n):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and last_i > 0:\n- cnt = 0\n- f = True\n- if f:\n- print(ans)\n- else:\n+ h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n+ h = (h * 26 + cx(s[i % lens])) % MOD\n+ if h == hsh:\n+ if i < lent:\n+ dp[i] = 1\n+ else:\n+ dp[i] = dp[i-lent] + 1\n+ ans = max(ans,dp[i])\n+\n+ if n - ans * lent < lent * 2:\n print(-1)\n+ else:\n+ print(ans)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 3\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and last_i > 0:\n- cnt = 0\n- f = True\n- if f:\n- print(ans)\n- else:\n print(-1)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 18, "removed_lines": 20, "code1_lines": 43 }, { "user_id": "u703950586", "problem_id": "p02962", "submission1_id": "s757537734", "submission2_id": "s974562383", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n u = SI()\n t = SI()\n s = u * 2\n while len(s) < len(t):\n s = s + u\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and i >= lent:\n cnt = 0\n f = True\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 26 + cx(x)) % MOD\n\n n = (lens+lent) * 2 + 1\n dp = [0] * n\n\n h = 0\n ans = 0\n for i in range(n):\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i % lens])) % MOD\n if h == hsh:\n if i < lent:\n dp[i] = 1\n else:\n dp[i] = dp[i-lent] + 1\n ans = max(ans,dp[i])\n\n if n - ans * lent < lent * 2:\n print(-1)\n else:\n print(ans)\n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592784959", "date2": "1593050639", "bleu_score": "0.8077720907660503", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "aa`bdca\naa\n", "actual_output": "2\n", "expected_output": "1\n", "anno_code": ["import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main(): # (0): main=\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n u = SI()\n t = SI()\n s = u * 2\n while len(s) < len(t):\n s = s + u\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and i >= lent:\n cnt = 0\n f = True\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n- u = SI()\n+ s = SI()\n t = SI()\n- s = u * 2\n- while len(s) < len(t):\n- s = s + u\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n+ hsh = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n+ hsh = (hsh * 26 + cx(x)) % MOD\n+\n+ n = (lens+lent) * 2 + 1\n+ dp = [0] * n\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n+ for i in range(n):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and i >= lent:\n- cnt = 0\n- f = True\n- if f or ans == 0:\n- print(ans)\n- else:\n+ h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n+ h = (h * 26 + cx(s[i % lens])) % MOD\n+ if h == hsh:\n+ if i < lent:\n+ dp[i] = 1\n+ else:\n+ dp[i] = dp[i-lent] + 1\n+ ans = max(ans,dp[i])\n+\n+ if n - ans * lent < lent * 2:\n print(-1)\n+ else:\n+ print(ans)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n- u = SI()\n t = SI()\n- s = u * 2\n- while len(s) < len(t):\n- s = s + u\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and i >= lent:\n- cnt = 0\n- f = True\n- if f or ans == 0:\n- print(ans)\n- else:\n print(-1)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 19, "removed_lines": 23, "code1_lines": 45 }, { "user_id": "u340781749", "problem_id": "p02962", "submission1_id": "s550920381", "submission2_id": "s599647135", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def rolling_hash(s, w, MOD):\n ret = []\n tmp = 0\n p = pow(26, w, MOD)\n ords = [ord(c) - 97 for c in s]\n for i, o in enumerate(ords):\n tmp = tmp * 26 + o\n if i >= w:\n tmp = (tmp - ords[i - w] * p)\n tmp %= MOD\n ret.append(tmp)\n return ret\n\n\ndef solve(s, t):\n MOD = 10 ** 9 + 7\n ls, lt = len(s), len(t)\n k = (lt - 1) \n s *= k * 2\n ls *= k\n rs, rt = rolling_hash(s, lt, MOD), rolling_hash(t, lt, MOD)\n rs = rs[ls:]\n ht = rt[-1]\n\n checked = [-1] * ls\n\n def series(i, st):\n print(i, st, checked)\n if i == st:\n return float('-inf')\n if checked[i] == -1:\n checked[i] = series((i + lt) % ls, st) + 1 if rs[i] == ht else 0\n return checked[i]\n\n for i, hs in enumerate(rs):\n if hs != ht:\n continue\n ret = series((i + lt) % ls, i)\n if ret == float('-inf'):\n return -1\n checked[i] = ret + 1\n\n return max(0, max(checked))\n\n\ns = input()\nt = input()\nprint(solve(s, t))\n", "code2": "import sys\n\nsys.setrecursionlimit(10 ** 6)\n\n\ndef rolling_hash(s, w, MOD):\n ret = []\n tmp = 0\n p = pow(26, w, MOD)\n ords = [ord(c) - 97 for c in s]\n for i, o in enumerate(ords):\n tmp = tmp * 26 + o\n if i >= w:\n tmp = (tmp - ords[i - w] * p)\n tmp %= MOD\n ret.append(tmp)\n return ret\n\n\ndef solve(s, t):\n MOD = 10 ** 9 + 7\n ls, lt = len(s), len(t)\n k = (lt - 1) \n s *= k * 2\n ls *= k\n rs, rt = rolling_hash(s, lt, MOD), rolling_hash(t, lt, MOD)\n rs = rs[ls:]\n ht = rt[-1]\n\n checked = [-1] * ls\n\n def series(i, st):\n if st <= i < st + lt:\n return float('-inf')\n if checked[i] == -1:\n checked[i] = series((i + lt) % ls, st) + 1 if rs[i] == ht else 0\n return checked[i]\n\n for i, hs in enumerate(rs):\n if hs != ht:\n continue\n ret = series((i + lt) % ls, i)\n if ret == float('-inf'):\n return -1\n checked[i] = ret + 1\n\n return max(0, max(checked))\n\n\ns = input()\nt = input()\nprint(solve(s, t))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564327145", "date2": "1564327572", "bleu_score": "0.9505177125452997", "code1_test_status": [1, 0, 1, 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, 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, 0, 0, 1], "code1_test_score": 93, "total_score": 103, "input": "bb`adca\n`a\n", "actual_output": "5 3 [-1, -1, -1, -1, -1, -1, -1]\n1\n", "expected_output": "1\n", "anno_code": ["def rolling_hash(s, w, MOD): # (0): rolling_hash=\n ret = [] # (11): ret=[] (98): ret=[]\n tmp = 0 # (12): tmp=0 (99): tmp=0\n p = pow(26, w, MOD) # (13): p=676 (100): p=676\n ords = [ord(c) - 97 for c in s] # (14): ords=[1, 1, -1, 0, 3, 2, 0, 1, 1, -1, 0, 3, 2, 0] (101): ords=[-1, 0]\n for i, o in enumerate(ords): # (15): i=0, o=1 (20): i=1 ... (112): s=bb`adcabb`adca, t=`a, ls=7, lt=2, k=1, rt=[1000000006, 999999981], rs=[1, 27, 25, 999999981, 3, 80, 52, 1, 27, 25, 999999981, 3, 80, 52]\n tmp = tmp * 26 + o # (16): tmp=1 (21): tmp=27 ... (108): tmp=26000000156\n if i >= w: # (17): NO CHANGE (22): NO CHANGE ... (109): NO CHANGE\n tmp = (tmp - ords[i - w] * p) # (28): tmp=25 (34): tmp=-26 ... (94): tmp=52\n tmp %= MOD # (18): NO CHANGE (23): NO CHANGE ... (110): tmp=999999981\n ret.append(tmp) # (19): ret=[1] (24): ret=[1, 27] ... (111): ret=[1000000006, 999999981]\n return ret\n\n\ndef solve(s, t): # (1): solve=\n MOD = 10 ** 9 + 7 # (5): MOD=1000000007\n ls, lt = len(s), len(t) # (6): ls=7, lt=2\n k = (lt - 1) # (7): k=1\n s *= k * 2 # (8): s=bb`adcabb`adca\n ls *= k # (9): NO CHANGE\n rs, rt = rolling_hash(s, lt, MOD), rolling_hash(t, lt, MOD) # (10): w=2\n rs = rs[ls:] # (113): rs=[1, 27, 25, 999999981, 3, 80, 52]\n ht = rt[-1] # (114): ht=999999981\n\n checked = [-1] * ls # (115): checked=[-1, -1, -1, -1, -1, -1, -1]\n\n def series(i, st): # (116): series=.series at 0x00000276854E9CF0>\n print(i, st, checked) # (129): NO CHANGE\n if i == st: # (130): NO CHANGE\n return float('-inf')\n if checked[i] == -1: # (131): NO CHANGE\n checked[i] = series((i + lt) % ls, st) + 1 if rs[i] == ht else 0 # (132): s=bb`adcabb`adca, t=`a, MOD=1000000007, k=1, rt=[1000000006, 999999981], checked=[-1, -1, -1, -1, -1, 0, -1], i=3, hs=999999981, ret=0\n return checked[i]\n\n for i, hs in enumerate(rs): # (117): i=0, hs=1 (120): i=1, hs=27 ... (141): i=6, hs=52\n if hs != ht: # (118): NO CHANGE (121): NO CHANGE ... (142): NO CHANGE\n continue # (119): NO CHANGE (122): NO CHANGE ... (143): NO CHANGE\n ret = series((i + lt) % ls, i) # (128): i=5, st=3\n if ret == float('-inf'): # (133): NO CHANGE\n return -1\n checked[i] = ret + 1 # (134): checked=[-1, -1, -1, 1, -1, 0, -1]\n\n return max(0, max(checked))\n\n\ns = input() # (2): s=bb`adca\nt = input() # (3): t=`a\nprint(solve(s, t)) # (4): NO CHANGE\n"], "anno_status": [false], "diff_content": "+import sys\n+\n+sys.setrecursionlimit(10 ** 6)\n+\n+\n def rolling_hash(s, w, MOD):\n ret = []\n tmp = 0\n p = pow(26, w, MOD)\n ords = [ord(c) - 97 for c in s]\n for i, o in enumerate(ords):\n tmp = tmp * 26 + o\n if i >= w:\n tmp = (tmp - ords[i - w] * p)\n tmp %= MOD\n ret.append(tmp)\n return ret\n \n \n def solve(s, t):\n MOD = 10 ** 9 + 7\n ls, lt = len(s), len(t)\n k = (lt - 1) \n s *= k * 2\n ls *= k\n rs, rt = rolling_hash(s, lt, MOD), rolling_hash(t, lt, MOD)\n rs = rs[ls:]\n ht = rt[-1]\n \n checked = [-1] * ls\n \n def series(i, st):\n- print(i, st, checked)\n- if i == st:\n+ if st <= i < st + lt:\n return float('-inf')\n if checked[i] == -1:\n checked[i] = series((i + lt) % ls, st) + 1 if rs[i] == ht else 0\n return checked[i]\n \n for i, hs in enumerate(rs):\n if hs != ht:\n continue\n ret = series((i + lt) % ls, i)\n if ret == float('-inf'):\n return -1\n checked[i] = ret + 1\n \n return max(0, max(checked))\n \n \n s = input()\n t = input()\n print(solve(s, t))\n \n", "FL_content": " def rolling_hash(s, w, MOD):\n ret = []\n tmp = 0\n p = pow(26, w, MOD)\n ords = [ord(c) - 97 for c in s]\n for i, o in enumerate(ords):\n tmp = tmp * 26 + o\n if i >= w:\n tmp = (tmp - ords[i - w] * p)\n tmp %= MOD\n ret.append(tmp)\n return ret\n \n \n def solve(s, t):\n MOD = 10 ** 9 + 7\n ls, lt = len(s), len(t)\n k = (lt - 1) \n s *= k * 2\n ls *= k\n rs, rt = rolling_hash(s, lt, MOD), rolling_hash(t, lt, MOD)\n rs = rs[ls:]\n ht = rt[-1]\n \n checked = [-1] * ls\n \n def series(i, st):\n- print(i, st, checked)\n- if i == st:\n return float('-inf')\n if checked[i] == -1:\n checked[i] = series((i + lt) % ls, st) + 1 if rs[i] == ht else 0\n return checked[i]\n \n for i, hs in enumerate(rs):\n if hs != ht:\n continue\n ret = series((i + lt) % ls, i)\n if ret == float('-inf'):\n return -1\n checked[i] = ret + 1\n \n return max(0, max(checked))\n \n \n s = input()\n t = input()\n print(solve(s, t))\n \n", "added_lines": 6, "removed_lines": 2, "code1_lines": 49 }, { "user_id": "u703950586", "problem_id": "p02962", "submission1_id": "s121069384", "submission2_id": "s974562383", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 2\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and i < lent:\n cnt = 0\n f = True\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 26 + cx(x)) % MOD\n\n n = (lens+lent) * 2 + 1\n dp = [0] * n\n\n h = 0\n ans = 0\n for i in range(n):\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i % lens])) % MOD\n if h == hsh:\n if i < lent:\n dp[i] = 1\n else:\n dp[i] = dp[i-lent] + 1\n ans = max(ans,dp[i])\n\n if n - ans * lent < lent * 2:\n print(-1)\n else:\n print(ans)\n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592784671", "date2": "1593050639", "bleu_score": "0.8478522712515127", "code1_test_status": [1, 0, 1, 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, 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, 0, 0, 1], "code1_test_score": 93, "total_score": 103, "input": "aa`bdca\naa\n", "actual_output": "-1\n", "expected_output": "1\n", "anno_code": ["import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main(): # (0): main=\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 2\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and i < lent:\n cnt = 0\n f = True\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 2\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n+ hsh = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n+ hsh = (hsh * 26 + cx(x)) % MOD\n+\n+ n = (lens+lent) * 2 + 1\n+ dp = [0] * n\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n+ for i in range(n):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and i < lent:\n- cnt = 0\n- f = True\n- if f or ans == 0:\n- print(ans)\n- else:\n+ h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n+ h = (h * 26 + cx(s[i % lens])) % MOD\n+ if h == hsh:\n+ if i < lent:\n+ dp[i] = 1\n+ else:\n+ dp[i] = dp[i-lent] + 1\n+ ans = max(ans,dp[i])\n+\n+ if n - ans * lent < lent * 2:\n print(-1)\n+ else:\n+ print(ans)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 2\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and i < lent:\n- cnt = 0\n- f = True\n- if f or ans == 0:\n- print(ans)\n- else:\n print(-1)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 18, "removed_lines": 20, "code1_lines": 43 }, { "user_id": "u170201762", "problem_id": "p02962", "submission1_id": "s527201853", "submission2_id": "s478789551", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def Z(S):\n res = [0]*len(S)\n res[0] = len(S)\n i = 1\n j = 0\n while i < len(S):\n while i+j < len(S) and S[j] == S[i+j]:\n j += 1\n res[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i+k < len(S) and k+res[k] < j:\n res[i+k] = res[k]\n k += 1\n i += k\n j -= k\n return res\n\nfrom collections import defaultdict\nclass UnionFind:\n def __init__(self, num):\n self.table = [-1 for _ in range(num)]\n self.sz = defaultdict(lambda:1)\n\n def find(self, x):\n if self.table[x] < 0:\n return x\n else:\n self.table[x] = self.find(self.table[x])\n return self.table[x]\n\n def union(self, x, y):\n s1 = self.find(x)\n s2 = self.find(y)\n\n if s1 != s2:\n size = self.sz[s1]+self.sz[s2]\n if self.table[s1] <= self.table[s2]:\n self.table[s1] += self.table[s2]\n self.table[s2] = s1\n else:\n self.table[s2] += self.table[s1]\n self.table[s1] = s2\n s = self.find(x)\n self.sz[s] = size\n return True\n return False\n\n def size(self, x):\n s = self.find(x)\n return self.sz[s]\n\ns = input()\nt = input()\n\nS = ''\nwhile len(S) <= len(t):\n S = S + s\nS = S + S\nz = Z(t+'*'+S+S)\nz = z[len(t)+1:]\nu = UnionFind(len(z))\nans = 0\nfor i in range(len(z)-len(t)):\n if z[i]==len(t) and z[i+len(t)]==len(t):\n u.union(i,i+len(t))\n if i+len(t) < len(S):\n ans = max(u.size(i),ans)\n else:\n if u.size(i) > ans:\n ans = -1\n\nprint(ans)", "code2": "from collections import defaultdict\ndef Z(S):\n res = [0]*len(S)\n res[0] = len(S)\n i = 1\n j = 0\n while i < len(S):\n while i+j < len(S) and S[j] == S[i+j]:\n j += 1\n res[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i+k < len(S) and k+res[k] < j:\n res[i+k] = res[k]\n k += 1\n i += k\n j -= k\n return res\n\nclass UnionFind:\n def __init__(self, num):\n self.table = [-1 for _ in range(num)]\n\n def find(self, x):\n if self.table[x] < 0:\n return x\n else:\n self.table[x] = self.find(self.table[x])\n return self.table[x]\n\n def union(self, x, y):\n s1 = self.find(x)\n s2 = self.find(y)\n\n if s1 != s2:\n if self.table[s1] <= self.table[s2]:\n self.table[s1] += self.table[s2]\n self.table[s2] = s1\n else:\n self.table[s2] += self.table[s1]\n self.table[s1] = s2\n return True\n return False\n\ns = input()\nt = input()\n\nS = s*(len(t)\nz = Z(t+'*'+S)\nz = z[len(t)+1:]\n\nu = UnionFind(len(s))\n\nfor i in range(len(s)):\n j = (i+len(t))%len(s)\n if z[i] == len(t) and z[j] == len(t):\n u.union(i,j)\n\nd = defaultdict(list)\nfor i in range(len(s)):\n if z[i] == len(t):\n d[u.find(i)].append(i)\n\nans = 0\nfor k in d:\n loop = True\n if len(d[k])==1:\n loop = len(t)%len(s)==0\n else:\n for i in d[k]:\n j = (i+len(t)*(len(d[k])-1))%len(s)\n loop = z[j]==len(t) and loop\n if loop:\n ans = -1\n break\n ans = max(ans,len(d[k]))\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564370407", "date2": "1564378171", "bleu_score": "0.8685520894173482", "code1_test_status": [1, 0, 1, 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, 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], "code1_test_score": 95, "total_score": 103, "input": "abcaabb\nab\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["def Z(S): # (0): Z=, defaultdict=\n res = [0]*len(S) # (10): res=[0, 0, ..., 0, 0]\n res[0] = len(S) # (11): res=[31, 0, ..., 0, 0]\n i = 1 # (12): i=1\n j = 0 # (13): j=0\n while i < len(S): # (14): NO CHANGE (20): NO CHANGE ... (234): Z=, defaultdict=, UnionFind=, s=abcaabb, t=ab, S=abcaabbabcaabb, z=[31, 0, ..., 0, 0]\n while i+j < len(S) and S[j] == S[i+j]: # (15): NO CHANGE (21): NO CHANGE ... (229): NO CHANGE\n j += 1 # (28): j=1 (30): j=2 ... (217): j=2\n res[i] = j # (16): NO CHANGE (22): NO CHANGE ... (230): NO CHANGE\n if j == 0: # (17): NO CHANGE (23): NO CHANGE ... (231): NO CHANGE\n i += 1 # (18): i=2 (24): i=3 ... (232): i=31\n continue # (19): NO CHANGE (25): NO CHANGE ... (233): NO CHANGE\n k = 1 # (34): k=1 (53): k=1 ... (221): NO CHANGE\n while i+k < len(S) and k+res[k] < j: # (35): NO CHANGE (38): NO CHANGE ... (225): NO CHANGE\n res[i+k] = res[k] # (36): NO CHANGE (67): NO CHANGE ... (223): NO CHANGE\n k += 1 # (37): k=2 (68): k=2 ... (224): k=2\n i += k # (39): i=5 (55): i=7 ... (226): i=30\n j -= k # (40): j=0 (56): j=0 ... (227): j=0\n return res\n\nfrom collections import defaultdict\nclass UnionFind: # (1): UnionFind=\n def __init__(self, num):\n self.table = [-1 for _ in range(num)] # (237): NO CHANGE\n self.sz = defaultdict(lambda:1) # (238): Z=, defaultdict=, UnionFind=, s=abcaabb, t=ab, S=abcaabbabcaabb, z=[2, 0, ..., 0, 0], u=\n\n def find(self, x):\n if self.table[x] < 0:\n return x\n else:\n self.table[x] = self.find(self.table[x])\n return self.table[x]\n\n def union(self, x, y):\n s1 = self.find(x)\n s2 = self.find(y)\n\n if s1 != s2:\n size = self.sz[s1]+self.sz[s2]\n if self.table[s1] <= self.table[s2]:\n self.table[s1] += self.table[s2]\n self.table[s2] = s1\n else:\n self.table[s2] += self.table[s1]\n self.table[s1] = s2\n s = self.find(x)\n self.sz[s] = size\n return True\n return False\n\n def size(self, x):\n s = self.find(x)\n return self.sz[s]\n\ns = input() # (2): s=abcaabb\nt = input() # (3): t=ab\n\nS = '' # (4): S=\nwhile len(S) <= len(t): # (5): NO CHANGE (7): NO CHANGE\n S = S + s # (6): S=abcaabb\nS = S + S # (8): S=abcaabbabcaabb\nz = Z(t+'*'+S+S) # (9): S=ab*abcaabbabcaabbabcaabbabcaabb\nz = z[len(t)+1:] # (235): z=[2, 0, ..., 0, 0]\nu = UnionFind(len(z)) # (236): self=, num=28\nans = 0 # (239): ans=0\nfor i in range(len(z)-len(t)): # (240): i=0 (242): i=1 ... (292): NO CHANGE\n if z[i]==len(t) and z[i+len(t)]==len(t): # (241): NO CHANGE (243): NO CHANGE ... (291): NO CHANGE\n u.union(i,i+len(t))\n if i+len(t) < len(S):\n ans = max(u.size(i),ans)\n else:\n if u.size(i) > ans:\n ans = -1\n\nprint(ans)"], "anno_status": [false], "diff_content": "+from collections import defaultdict\n def Z(S):\n res = [0]*len(S)\n res[0] = len(S)\n i = 1\n j = 0\n while i < len(S):\n while i+j < len(S) and S[j] == S[i+j]:\n j += 1\n res[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i+k < len(S) and k+res[k] < j:\n res[i+k] = res[k]\n k += 1\n i += k\n j -= k\n return res\n \n-from collections import defaultdict\n class UnionFind:\n def __init__(self, num):\n self.table = [-1 for _ in range(num)]\n- self.sz = defaultdict(lambda:1)\n \n def find(self, x):\n if self.table[x] < 0:\n return x\n else:\n self.table[x] = self.find(self.table[x])\n return self.table[x]\n \n def union(self, x, y):\n s1 = self.find(x)\n s2 = self.find(y)\n \n if s1 != s2:\n- size = self.sz[s1]+self.sz[s2]\n if self.table[s1] <= self.table[s2]:\n self.table[s1] += self.table[s2]\n self.table[s2] = s1\n else:\n self.table[s2] += self.table[s1]\n self.table[s1] = s2\n- s = self.find(x)\n- self.sz[s] = size\n return True\n return False\n \n- def size(self, x):\n- s = self.find(x)\n- return self.sz[s]\n-\n s = input()\n t = input()\n \n-S = ''\n-while len(S) <= len(t):\n- S = S + s\n-S = S + S\n-z = Z(t+'*'+S+S)\n+S = s*(len(t)\n+z = Z(t+'*'+S)\n z = z[len(t)+1:]\n-u = UnionFind(len(z))\n+\n+u = UnionFind(len(s))\n+\n+for i in range(len(s)):\n+ j = (i+len(t))%len(s)\n+ if z[i] == len(t) and z[j] == len(t):\n+ u.union(i,j)\n+\n+d = defaultdict(list)\n+for i in range(len(s)):\n+ if z[i] == len(t):\n+ d[u.find(i)].append(i)\n+\n ans = 0\n-for i in range(len(z)-len(t)):\n- if z[i]==len(t) and z[i+len(t)]==len(t):\n- u.union(i,i+len(t))\n- if i+len(t) < len(S):\n- ans = max(u.size(i),ans)\n- else:\n- if u.size(i) > ans:\n- ans = -1\n+for k in d:\n+ loop = True\n+ if len(d[k])==1:\n+ loop = len(t)%len(s)==0\n+ else:\n+ for i in d[k]:\n+ j = (i+len(t)*(len(d[k])-1))%len(s)\n+ loop = z[j]==len(t) and loop\n+ if loop:\n+ ans = -1\n+ break\n+ ans = max(ans,len(d[k]))\n \n print(ans)\n", "FL_content": " def Z(S):\n res = [0]*len(S)\n res[0] = len(S)\n i = 1\n j = 0\n while i < len(S):\n while i+j < len(S) and S[j] == S[i+j]:\n j += 1\n res[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i+k < len(S) and k+res[k] < j:\n res[i+k] = res[k]\n k += 1\n i += k\n j -= k\n return res\n \n-from collections import defaultdict\n class UnionFind:\n def __init__(self, num):\n self.table = [-1 for _ in range(num)]\n- self.sz = defaultdict(lambda:1)\n \n def find(self, x):\n if self.table[x] < 0:\n return x\n else:\n self.table[x] = self.find(self.table[x])\n return self.table[x]\n \n def union(self, x, y):\n s1 = self.find(x)\n s2 = self.find(y)\n \n if s1 != s2:\n- size = self.sz[s1]+self.sz[s2]\n if self.table[s1] <= self.table[s2]:\n self.table[s1] += self.table[s2]\n self.table[s2] = s1\n else:\n self.table[s2] += self.table[s1]\n self.table[s1] = s2\n- s = self.find(x)\n- self.sz[s] = size\n return True\n return False\n \n- def size(self, x):\n- s = self.find(x)\n- return self.sz[s]\n-\n s = input()\n t = input()\n \n-S = ''\n-while len(S) <= len(t):\n- S = S + s\n-S = S + S\n-z = Z(t+'*'+S+S)\n z = z[len(t)+1:]\n-u = UnionFind(len(z))\n ans = 0\n-for i in range(len(z)-len(t)):\n- if z[i]==len(t) and z[i+len(t)]==len(t):\n- u.union(i,i+len(t))\n- if i+len(t) < len(S):\n- ans = max(u.size(i),ans)\n- else:\n- if u.size(i) > ans:\n- ans = -1\n \n print(ans)\n", "added_lines": 28, "removed_lines": 23, "code1_lines": 75 }, { "user_id": "u794173881", "problem_id": "p02962", "submission1_id": "s224234368", "submission2_id": "s944927355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nt = input()\n\n\ndef pattern(inputv):\n if not inputv:\n return inputv\n\n nxt = [0]*len(inputv)\n for i in range(1, len(nxt)):\n k = nxt[i - 1]\n while True:\n if inputv[i] == inputv[k]:\n nxt[i] = k + 1\n break\n elif k == 0:\n nxt[i] = 0\n break\n else:\n k = nxt[k - 1]\n\n smallPieceLen = len(inputv) - nxt[-1]\n if len(inputv) % smallPieceLen != 0:\n return inputv\n\n return inputv[0:smallPieceLen]\n\nif pattern(s) == pattern(t):\n print(-1)\n exit()\n\ns = s + s\ncnt = 0\nans = []\n\nj = 0\ni = 0\nli = []\nflag = True\nwhile i< len(s):\n \n if s[i] == t[j]:\n flag = True\n if j == len(t) - 1:\n cnt += 1\n j = 0\n i += 1\n else:\n j += 1\n i += 1\n else:\n if cnt != 0:\n ans.append(cnt)\n cnt = 0\n j = 0\n if flag:\n i += 1\n flag = False\n else:\n flag = True\n continue\nif cnt != 0:\n ans.append(cnt)\n cnt = 0\n\nans.append(0)\nprint(max(ans))", "code2": "s = input()\nt = input()\n\ndef z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n\ndef solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = s\nwhile True:\n if len(new_s) > len(t):\n s = new_s\n break\n new_s += new_s\n\ns = s*3\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans1 = 0\nfor i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n\ns += s\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans2 = 0\nfor i in range(len(li)):\n ans2 = max(ans2, solve(i, li))\n\nif ans1 == ans2:\n print(ans1)\nelse:\n print(-1)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564281145", "date2": "1564611749", "bleu_score": "0.6074035311092277", "code1_test_status": [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, 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": "acdaabb\nab\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["s = input() # (0): s=acdaabb\nt = input() # (1): t=ab\n\n\ndef pattern(inputv): # (2): pattern=\n if not inputv: # (4): NO CHANGE (57): NO CHANGE\n return inputv\n\n nxt = [0]*len(inputv) # (5): nxt=[0, 0, 0, 0, 0, 0, 0] (58): nxt=[0, 0]\n for i in range(1, len(nxt)): # (6): i=1 (13): i=2 ... (66): NO CHANGE\n k = nxt[i - 1] # (7): k=0 (14): NO CHANGE ... (60): k=0\n while True: # (8): NO CHANGE (15): NO CHANGE ... (61): NO CHANGE\n if inputv[i] == inputv[k]: # (9): NO CHANGE (16): NO CHANGE ... (62): NO CHANGE\n nxt[i] = k + 1 # (24): nxt=[0, 0, 0, 1, 0, 0, 0] (34): nxt=[0, 0, 0, 1, 1, 0, 0]\n break # (25): NO CHANGE (35): NO CHANGE\n elif k == 0: # (10): NO CHANGE (17): NO CHANGE ... (63): NO CHANGE\n nxt[i] = 0 # (11): NO CHANGE (18): NO CHANGE ... (64): NO CHANGE\n break # (12): NO CHANGE (19): NO CHANGE ... (65): NO CHANGE\n else:\n k = nxt[k - 1] # (31): k=0 (41): k=0\n\n smallPieceLen = len(inputv) - nxt[-1] # (55): smallPieceLen=7 (67): smallPieceLen=2\n if len(inputv) % smallPieceLen != 0: # (56): inputv=ab (68): s=acdaabb, t=ab, pattern=\n return inputv\n\n return inputv[0:smallPieceLen]\n\nif pattern(s) == pattern(t): # (3): inputv=acdaabb\n print(-1)\n exit()\n\ns = s + s # (69): s=acdaabbacdaabb\ncnt = 0 # (70): cnt=0\nans = [] # (71): ans=[]\n\nj = 0 # (72): j=0\ni = 0 # (73): i=0\nli = [] # (74): li=[]\nflag = True # (75): flag=True\nwhile i< len(s): # (76): NO CHANGE (82): NO CHANGE ... (228): NO CHANGE\n \n if s[i] == t[j]: # (77): NO CHANGE (83): NO CHANGE ... (221): NO CHANGE\n flag = True # (78): NO CHANGE (108): flag=True ... (184): flag=True\n if j == len(t) - 1: # (79): NO CHANGE (109): NO CHANGE ... (185): NO CHANGE\n cnt += 1\n j = 0\n i += 1\n else:\n j += 1 # (80): j=1 (110): j=1 ... (186): j=1\n i += 1 # (81): i=1 (111): i=4 ... (187): i=11\n else:\n if cnt != 0: # (84): NO CHANGE (92): NO CHANGE ... (222): NO CHANGE\n ans.append(cnt)\n cnt = 0 # (85): NO CHANGE (93): NO CHANGE ... (223): NO CHANGE\n j = 0 # (86): j=0 (94): NO CHANGE ... (224): NO CHANGE\n if flag: # (87): NO CHANGE (95): NO CHANGE ... (225): NO CHANGE\n i += 1 # (88): i=2 (104): i=3 ... (226): i=14\n flag = False # (89): flag=False (105): flag=False ... (227): flag=False\n else:\n flag = True # (96): flag=True (126): flag=True ... (218): flag=True\n continue # (97): NO CHANGE (127): NO CHANGE ... (219): NO CHANGE\nif cnt != 0: # (229): NO CHANGE\n ans.append(cnt)\n cnt = 0\n\nans.append(0) # (230): ans=[0]\nprint(max(ans))"], "anno_status": [false], "diff_content": " s = input()\n t = input()\n \n+def z_algorithm(s):\n+ a = [0] * len(s)\n+ i = 1\n+ j = 0\n+ a[0] = len(s)\n+ while i < len(s):\n+ while i + j < len(s) and s[j] == s[i+j]:\n+ j += 1\n+ a[i] = j\n+ if j == 0:\n+ i += 1\n+ continue\n+ k = 1\n+ while i + k < len(s) and k + a[k] < j:\n+ a[i+k] = a[k]\n+ k += 1\n+ i += k\n+ j -= k\n+ return a\n \n-def pattern(inputv):\n- if not inputv:\n- return inputv\n-\n- nxt = [0]*len(inputv)\n- for i in range(1, len(nxt)):\n- k = nxt[i - 1]\n- while True:\n- if inputv[i] == inputv[k]:\n- nxt[i] = k + 1\n- break\n- elif k == 0:\n- nxt[i] = 0\n- break\n- else:\n- k = nxt[k - 1]\n+def solve(i, li):\n+ ans = 0\n+ while True:\n+ if i < 0 or len(li) <= i or visited[i]:\n+ break\n+ if li[i] < len(t):\n+ visited[i] = True\n+ break\n+ if li[i] >= len(t):\n+ visited[i] = True\n+ ans += 1\n+ i += len(t)\n+ return ans\n \n- smallPieceLen = len(inputv) - nxt[-1]\n- if len(inputv) % smallPieceLen != 0:\n- return inputv\n \n- return inputv[0:smallPieceLen]\n+new_s = s\n+while True:\n+ if len(new_s) > len(t):\n+ s = new_s\n+ break\n+ new_s += new_s\n \n-if pattern(s) == pattern(t):\n- print(-1)\n- exit()\n+s = s*3\n+li = z_algorithm(t + s)[len(t):]\n+visited = [False] * len(li)\n+ans1 = 0\n+for i in range(len(li)):\n+ ans1 = max(ans1, solve(i, li))\n \n-s = s + s\n-cnt = 0\n-ans = []\n+s += s\n+li = z_algorithm(t + s)[len(t):]\n+visited = [False] * len(li)\n+ans2 = 0\n+for i in range(len(li)):\n+ ans2 = max(ans2, solve(i, li))\n \n-j = 0\n-i = 0\n-li = []\n-flag = True\n-while i< len(s):\n- \n- if s[i] == t[j]:\n- flag = True\n- if j == len(t) - 1:\n- cnt += 1\n- j = 0\n- i += 1\n- else:\n- j += 1\n- i += 1\n- else:\n- if cnt != 0:\n- ans.append(cnt)\n- cnt = 0\n- j = 0\n- if flag:\n- i += 1\n- flag = False\n- else:\n- flag = True\n- continue\n-if cnt != 0:\n- ans.append(cnt)\n- cnt = 0\n+if ans1 == ans2:\n+ print(ans1)\n+else:\n+ print(-1)\n \n-ans.append(0)\n-print(max(ans))\n", "FL_content": " s = input()\n t = input()\n \n \n-def pattern(inputv):\n- if not inputv:\n- return inputv\n-\n- nxt = [0]*len(inputv)\n- for i in range(1, len(nxt)):\n- k = nxt[i - 1]\n- while True:\n- if inputv[i] == inputv[k]:\n- nxt[i] = k + 1\n- break\n- elif k == 0:\n- nxt[i] = 0\n- break\n- else:\n- k = nxt[k - 1]\n \n- smallPieceLen = len(inputv) - nxt[-1]\n- if len(inputv) % smallPieceLen != 0:\n- return inputv\n \n- return inputv[0:smallPieceLen]\n \n-if pattern(s) == pattern(t):\n- print(-1)\n- exit()\n \n-s = s + s\n-cnt = 0\n-ans = []\n \n-j = 0\n-i = 0\n-li = []\n-flag = True\n-while i< len(s):\n- \n- if s[i] == t[j]:\n- flag = True\n- if j == len(t) - 1:\n- cnt += 1\n- j = 0\n- i += 1\n- else:\n- j += 1\n- i += 1\n- else:\n- if cnt != 0:\n- ans.append(cnt)\n- cnt = 0\n- j = 0\n- if flag:\n- i += 1\n- flag = False\n- else:\n- flag = True\n- continue\n-if cnt != 0:\n- ans.append(cnt)\n- cnt = 0\n \n-ans.append(0)\n-print(max(ans))\n", "added_lines": 54, "removed_lines": 57, "code1_lines": 67 }, { "user_id": "u703950586", "problem_id": "p02962", "submission1_id": "s298574570", "submission2_id": "s974562383", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 2\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and last_i > 0:\n cnt = 0\n f = True\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hsh = 0\n for x in t:\n hsh = (hsh * 26 + cx(x)) % MOD\n\n n = (lens+lent) * 2 + 1\n dp = [0] * n\n\n h = 0\n ans = 0\n for i in range(n):\n if i >= lent:\n h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i % lens])) % MOD\n if h == hsh:\n if i < lent:\n dp[i] = 1\n else:\n dp[i] = dp[i-lent] + 1\n ans = max(ans,dp[i])\n\n if n - ans * lent < lent * 2:\n print(-1)\n else:\n print(ans)\n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1592784381", "date2": "1593050639", "bleu_score": "0.8383816772311115", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 101, "total_score": 103, "input": "aa`bdca\naa\n", "actual_output": "2\n", "expected_output": "1\n", "anno_code": ["import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main(): # (0): main=\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n\n s = SI()\n t = SI()\n s = s * 2\n lens = len(s)\n lent = len(t)\n\n def cx(x):\n return ord(x) - ord('a') + 1\n\n hash = 0\n for x in t:\n hash = (hash * 26 + cx(x)) % MOD\n\n cnt = 0\n f = False\n h = 0\n last_i = 0\n ans = 0\n for i in range(lens):\n if i >= lent:\n h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n h = (h * 26 + cx(s[i])) % MOD\n if h == hash:\n cnt += 1\n ans = max(ans,cnt)\n last_i = i\n else:\n if i - last_i >= lent and last_i > 0:\n cnt = 0\n f = True\n if f or ans == 0:\n print(ans)\n else:\n print(-1)\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 2\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n+ hsh = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n+ hsh = (hsh * 26 + cx(x)) % MOD\n+\n+ n = (lens+lent) * 2 + 1\n+ dp = [0] * n\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n+ for i in range(n):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and last_i > 0:\n- cnt = 0\n- f = True\n- if f or ans == 0:\n- print(ans)\n- else:\n+ h -= cx(s[(i - lent)%lens]) * pow(26,lent-1,MOD)\n+ h = (h * 26 + cx(s[i % lens])) % MOD\n+ if h == hsh:\n+ if i < lent:\n+ dp[i] = 1\n+ else:\n+ dp[i] = dp[i-lent] + 1\n+ ans = max(ans,dp[i])\n+\n+ if n - ans * lent < lent * 2:\n print(-1)\n+ else:\n+ print(ans)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n \n def main():\n MOD = 2**61-1\n SI = lambda : sys.stdin.readline().rstrip()\n \n s = SI()\n t = SI()\n- s = s * 2\n lens = len(s)\n lent = len(t)\n \n def cx(x):\n return ord(x) - ord('a') + 1\n \n- hash = 0\n for x in t:\n- hash = (hash * 26 + cx(x)) % MOD\n \n- cnt = 0\n- f = False\n h = 0\n- last_i = 0\n ans = 0\n- for i in range(lens):\n if i >= lent:\n- h -= cx(s[i-lent]) * pow(26,lent-1,MOD)\n- h = (h * 26 + cx(s[i])) % MOD\n- if h == hash:\n- cnt += 1\n- ans = max(ans,cnt)\n- last_i = i\n- else:\n- if i - last_i >= lent and last_i > 0:\n- cnt = 0\n- f = True\n- if f or ans == 0:\n- print(ans)\n- else:\n print(-1)\n \n if __name__ == '__main__':\n main()\n", "added_lines": 18, "removed_lines": 20, "code1_lines": 43 }, { "user_id": "u102461423", "problem_id": "p02962", "submission1_id": "s481798793", "submission2_id": "s160360228", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10 ** 7)\n\nS = input().rstrip()\nT = input().rstrip()\n\n\nLS = len(S)\nLT = len(T)\nn = (LT + (-LT) % LS) \nS *= (n+1)\nS = S[:LS+LT]\n\nMOD = 10 ** 9 + 7\nbase = 1234\nbase_inv = pow(base,MOD-2,MOD) \npower = [1] * (LS+LT)\npower_inv = [1] * (LS+LT)\nfor n in range(1,LS+LT):\n power[n] = power[n-1] * base % MOD\n power_inv[n] = power_inv[n-1] * base_inv % MOD\n\ndef to_rolling_hash(S):\n ret = [0] * len(S)\n prev = 0\n for i,s in enumerate(S):\n x = (prev + power[i] * ord(s)) % MOD\n ret[i] = x\n prev = x\n return ret\n\nS_hash = to_rolling_hash(S) + [0]\nT_hash = to_rolling_hash(T)[-1] \n\ncan_start = [(S_hash[i + LT - 1] - S_hash[i - 1]) * power_inv[i] % MOD == T_hash for i in range(LS)]\n", "code2": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10 ** 7)\n\nS = input().rstrip()\nT = input().rstrip()\n\nS,T\n\n\nLS = len(S)\nLT = len(T)\nn = (LT + (-LT) % LS) \nS *= (n+1)\nS = S[:LS+LT]\n\nMOD = 10 ** 16 + 61\nbase = 12345\nbase_inv = pow(base,MOD-2,MOD) \npower = [1] * (LS+LT)\npower_inv = [1] * (LS+LT)\nfor n in range(1,LS+LT):\n power[n] = power[n-1] * base % MOD\n power_inv[n] = power_inv[n-1] * base_inv % MOD\n\ndef to_rolling_hash(S):\n ret = [0] * len(S)\n for i,s in enumerate(S):\n ret[i] = (ret[i-1] + power[i] * ord(s)) % MOD\n return ret\n\nS_hash = to_rolling_hash(S) + [0]\nT_hash = to_rolling_hash(T)[-1] \n\ncan_start = [(S_hash[i + LT - 1] - S_hash[i - 1]) * power_inv[i] % MOD == T_hash for i in range(LS)]\n\nINF = 10 ** 18\nvisited = [False] * LS\ndp = [None] * LS\n\narr = [INF] * LS\n\nq = [(i,0) for i,bl in enumerate(can_start) if not bl]\n\nwhile q:\n qq = []\n for x,d in q:\n if arr[x] == INF:\n arr[x] = d\n qq.append(((x-LT)%LS, d+1))\n q = qq\n\nanswer = max(arr)\n\nif answer >= INF:\n answer = -1\n\nprint(answer)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564278683", "date2": "1564280277", "bleu_score": "0.6874456235609422", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "`c`\naa`ac\n", "actual_output": "", "expected_output": "0\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nsys.setrecursionlimit(10 ** 7) # (1): NO CHANGE\n\nS = input().rstrip() # (2): S=`c`\nT = input().rstrip() # (3): T=aa`ac\n\n\nLS = len(S) # (4): LS=3\nLT = len(T) # (5): LT=5\nn = (LT + (-LT) % LS) # (6): n=6\nS *= (n+1) # (7): S=`c``c``c``c``c``c``c`\nS = S[:LS+LT] # (8): S=`c``c``c\n\nMOD = 10 ** 9 + 7 # (9): MOD=1000000007\nbase = 1234 # (10): base=1234\nbase_inv = pow(base,MOD-2,MOD) # (11): base_inv=858184771\npower = [1] * (LS+LT) # (12): power=[1, 1, 1, 1, 1, 1, 1, 1]\npower_inv = [1] * (LS+LT) # (13): power_inv=[1, 1, 1, 1, 1, 1, 1, 1]\nfor n in range(1,LS+LT): # (14): n=1 (17): n=2 ... (35): NO CHANGE\n power[n] = power[n-1] * base % MOD # (15): power=[1, 1234, 1, 1, 1, 1, 1, 1] (18): power=[1, 1234, 1522756, 1, 1, 1, 1, 1] ... (33): power=[1, 1234, 1522756, 879080897, 785819310, 701021757, 60842083, 79129897]\n power_inv[n] = power_inv[n-1] * base_inv % MOD # (16): power_inv=[1, 858184771, 1, 1, 1, 1, 1, 1] (19): power_inv=[1, 858184771, 20954769, 1, 1, 1, 1, 1] ... (34): power_inv=[1, 858184771, 20954769, 509741458, 340769647, 427342604, 185111300, 487994421]\n\ndef to_rolling_hash(S): # (36): to_rolling_hash=\n ret = [0] * len(S) # (38): ret=[0, 0, 0, 0, 0, 0, 0, 0] (74): ret=[0, 0, 0, 0, 0]\n prev = 0 # (39): prev=0 (75): prev=0\n for i,s in enumerate(S): # (40): i=0, s=` (44): i=1, s=c ... (96): sys=, input=, S=`c``c``c, T=aa`ac, LS=3, LT=5, n=7, MOD=1000000007, base=1234, base_inv=858184771, power=[1, 1234, 1522756, 879080897, 785819310, 701021757, 60842083, 79129897], power_inv=[1, 858184771, 20954769, 509741458, 340769647, 427342604, 185111300, 487994421], to_rolling_hash=, S_hash=[96, 122262, 146306838, 538072362, 334183506, 632271709, 473111635, 306971382, 0], T_hash=213261929\n x = (prev + power[i] * ord(s)) % MOD # (41): x=96 (45): x=122262 ... (93): x=213261929\n ret[i] = x # (42): ret=[96, 0, 0, 0, 0, 0, 0, 0] (46): ret=[96, 122262, 0, 0, 0, 0, 0, 0] ... (94): ret=[97, 119795, 146304371, 417150785, 213261929]\n prev = x # (43): prev=96 (47): prev=122262 ... (95): prev=213261929\n return ret\n\nS_hash = to_rolling_hash(S) + [0] # (37): NO CHANGE\nT_hash = to_rolling_hash(T)[-1] # (73): S=aa`ac\n\ncan_start = [(S_hash[i + LT - 1] - S_hash[i - 1]) * power_inv[i] % MOD == T_hash for i in range(LS)]\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10 ** 7)\n \n S = input().rstrip()\n T = input().rstrip()\n \n+S,T\n+\n \n LS = len(S)\n LT = len(T)\n n = (LT + (-LT) % LS) \n S *= (n+1)\n S = S[:LS+LT]\n \n-MOD = 10 ** 9 + 7\n-base = 1234\n+MOD = 10 ** 16 + 61\n+base = 12345\n base_inv = pow(base,MOD-2,MOD) \n power = [1] * (LS+LT)\n power_inv = [1] * (LS+LT)\n for n in range(1,LS+LT):\n power[n] = power[n-1] * base % MOD\n power_inv[n] = power_inv[n-1] * base_inv % MOD\n \n def to_rolling_hash(S):\n ret = [0] * len(S)\n- prev = 0\n for i,s in enumerate(S):\n- x = (prev + power[i] * ord(s)) % MOD\n- ret[i] = x\n- prev = x\n+ ret[i] = (ret[i-1] + power[i] * ord(s)) % MOD\n return ret\n \n S_hash = to_rolling_hash(S) + [0]\n T_hash = to_rolling_hash(T)[-1] \n \n can_start = [(S_hash[i + LT - 1] - S_hash[i - 1]) * power_inv[i] % MOD == T_hash for i in range(LS)]\n \n+INF = 10 ** 18\n+visited = [False] * LS\n+dp = [None] * LS\n+\n+arr = [INF] * LS\n+\n+q = [(i,0) for i,bl in enumerate(can_start) if not bl]\n+\n+while q:\n+ qq = []\n+ for x,d in q:\n+ if arr[x] == INF:\n+ arr[x] = d\n+ qq.append(((x-LT)%LS, d+1))\n+ q = qq\n+\n+answer = max(arr)\n+\n+if answer >= INF:\n+ answer = -1\n+\n+print(answer)\n", "FL_content": " import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10 ** 7)\n \n S = input().rstrip()\n T = input().rstrip()\n \n \n LS = len(S)\n LT = len(T)\n n = (LT + (-LT) % LS) \n S *= (n+1)\n S = S[:LS+LT]\n \n-MOD = 10 ** 9 + 7\n-base = 1234\n base_inv = pow(base,MOD-2,MOD) \n power = [1] * (LS+LT)\n power_inv = [1] * (LS+LT)\n for n in range(1,LS+LT):\n power[n] = power[n-1] * base % MOD\n power_inv[n] = power_inv[n-1] * base_inv % MOD\n \n def to_rolling_hash(S):\n ret = [0] * len(S)\n- prev = 0\n for i,s in enumerate(S):\n- x = (prev + power[i] * ord(s)) % MOD\n- ret[i] = x\n- prev = x\n return ret\n \n S_hash = to_rolling_hash(S) + [0]\n T_hash = to_rolling_hash(T)[-1] \n \n can_start = [(S_hash[i + LT - 1] - S_hash[i - 1]) * power_inv[i] % MOD == T_hash for i in range(LS)]\n \n", "added_lines": 27, "removed_lines": 6, "code1_lines": 37 }, { "user_id": "u794173881", "problem_id": "p02962", "submission1_id": "s860102445", "submission2_id": "s944927355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nt = input()\n\ndef z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n\ndef solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = \"\"\nwhile True:\n new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n\ns = s*3\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans1 = 0\nfor i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n\nprint(ans1)", "code2": "s = input()\nt = input()\n\ndef z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n\ndef solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n\n\nnew_s = s\nwhile True:\n if len(new_s) > len(t):\n s = new_s\n break\n new_s += new_s\n\ns = s*3\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans1 = 0\nfor i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n\ns += s\nli = z_algorithm(t + s)[len(t):]\nvisited = [False] * len(li)\nans2 = 0\nfor i in range(len(li)):\n ans2 = max(ans2, solve(i, li))\n\nif ans1 == ans2:\n print(ans1)\nelse:\n print(-1)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564611340", "date2": "1564611749", "bleu_score": "0.836274545839938", "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, 0, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "aa\naaaaaaa\n", "actual_output": "3\n", "expected_output": "-1\n", "anno_code": ["s = input() # (0): s=aa\nt = input() # (1): t=aaaaaaa\n\ndef z_algorithm(s): # (2): z_algorithm=\n a = [0] * len(s) # (21): a=[0, 0, ..., 0, 0]\n i = 1 # (22): i=1\n j = 0 # (23): j=0\n a[0] = len(s) # (24): a=[31, 0, ..., 0, 0]\n while i < len(s): # (25): NO CHANGE (93): NO CHANGE ... (325): s=aaaaaaaaaaaaaaaaaaaaaaaa, t=aaaaaaa, z_algorithm=, solve=, new_s=aaaaaaaa, li=[24, 23, ..., 2, 1]\n while i + j < len(s) and s[j] == s[i+j]: # (26): NO CHANGE (28): NO CHANGE ... (318): NO CHANGE\n j += 1 # (27): j=1 (29): j=2 ... (85): j=30\n a[i] = j # (87): a=[31, 30, ..., 0, 0] (95): a=[31, 30, ..., 0, 0] ... (319): a=[31, 30, ..., 2, 1]\n if j == 0: # (88): NO CHANGE (96): NO CHANGE ... (320): NO CHANGE\n i += 1\n continue\n k = 1 # (89): k=1 (97): NO CHANGE ... (321): NO CHANGE\n while i + k < len(s) and k + a[k] < j: # (90): NO CHANGE (98): NO CHANGE ... (322): NO CHANGE\n a[i+k] = a[k]\n k += 1\n i += k # (91): i=2 (99): i=3 ... (323): i=31\n j -= k # (92): j=29 (100): j=28 ... (324): j=0\n return a\n\ndef solve(i, li): # (3): solve=\n ans = 0 # (330): ans=0 (359): ans=0 ... (606): ans=0\n while True: # (331): NO CHANGE (338): NO CHANGE ... (607): NO CHANGE\n if i < 0 or len(li) <= i or visited[i]: # (332): NO CHANGE (339): NO CHANGE ... (608): NO CHANGE\n break # (441): s=aaaaaaaaaaaaaaaaaaaaaaaa, t=aaaaaaa, z_algorithm=, solve=, new_s=aaaaaaaa, visited=[True, True, True, True, False, False, False, True, True, True, True, False, False, False, True, True, True, True, False, False, False, True, True, True], ans1=3, i=3 (513): s=aaaaaaaaaaaaaaaaaaaaaaaa, t=aaaaaaa, z_algorithm=, solve=, new_s=aaaaaaaa, visited=[True, True, ..., True, True], ans1=3 ... (609): s=aaaaaaaaaaaaaaaaaaaaaaaa, t=aaaaaaa, z_algorithm=, solve=, new_s=aaaaaaaa, visited=[True, True, ..., True, True], ans1=3\n if li[i] < len(t): # (333): NO CHANGE (340): NO CHANGE ... (505): NO CHANGE\n visited[i] = True # (355): NO CHANGE (384): NO CHANGE ... (506): NO CHANGE\n break # (356): s=aaaaaaaaaaaaaaaaaaaaaaaa, t=aaaaaaa, z_algorithm=, solve=, new_s=aaaaaaaa, visited=[True, False, False, False, False, False, False, True, False, False, False, False, False, False, True, False, False, False, False, False, False, True, False, False], ans1=3, i=0 (385): s=aaaaaaaaaaaaaaaaaaaaaaaa, t=aaaaaaa, z_algorithm=, solve=, new_s=aaaaaaaa, visited=[True, True, False, False, False, False, False, True, True, False, False, False, False, False, True, True, False, False, False, False, False, True, True, False], ans1=3, i=1 ... (507): s=aaaaaaaaaaaaaaaaaaaaaaaa, t=aaaaaaa, z_algorithm=, solve=, new_s=aaaaaaaa, visited=[True, True, ..., True, True], ans1=3, i=6\n if li[i] >= len(t): # (334): NO CHANGE (341): NO CHANGE ... (499): NO CHANGE\n visited[i] = True # (335): NO CHANGE (342): NO CHANGE ... (500): NO CHANGE\n ans += 1 # (336): ans=1 (343): ans=2 ... (501): ans=2\n i += len(t) # (337): i=7 (344): i=14 ... (502): i=20\n return ans\n\n\nnew_s = \"\" # (4): new_s=\nwhile True: # (5): NO CHANGE (8): NO CHANGE ... (14): NO CHANGE\n new_s += s # (6): new_s=aa (9): new_s=aaaa ... (15): new_s=aaaaaaaa\n if len(new_s) > len(t): # (7): NO CHANGE (10): NO CHANGE ... (16): NO CHANGE\n s = new_s # (17): s=aaaaaaaa\n break # (18): NO CHANGE\n\ns = s*3 # (19): s=aaaaaaaaaaaaaaaaaaaaaaaa\nli = z_algorithm(t + s)[len(t):] # (20): s=aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\nvisited = [False] * len(li) # (326): visited=[False, False, ..., False, False]\nans1 = 0 # (327): ans1=0\nfor i in range(len(li)): # (328): i=0 (357): i=1 ... (610): NO CHANGE\n ans1 = max(ans1, solve(i, li)) # (329): NO CHANGE (358): NO CHANGE ... (605): NO CHANGE\n\nprint(ans1)"], "anno_status": [false], "diff_content": " s = input()\n t = input()\n \n def z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n \n def solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n \n \n-new_s = \"\"\n+new_s = s\n while True:\n- new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n+ new_s += new_s\n \n s = s*3\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans1 = 0\n for i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n \n-print(ans1)\n+s += s\n+li = z_algorithm(t + s)[len(t):]\n+visited = [False] * len(li)\n+ans2 = 0\n+for i in range(len(li)):\n+ ans2 = max(ans2, solve(i, li))\n+\n+if ans1 == ans2:\n+ print(ans1)\n+else:\n+ print(-1)\n+\n", "FL_content": " s = input()\n t = input()\n \n def z_algorithm(s):\n a = [0] * len(s)\n i = 1\n j = 0\n a[0] = len(s)\n while i < len(s):\n while i + j < len(s) and s[j] == s[i+j]:\n j += 1\n a[i] = j\n if j == 0:\n i += 1\n continue\n k = 1\n while i + k < len(s) and k + a[k] < j:\n a[i+k] = a[k]\n k += 1\n i += k\n j -= k\n return a\n \n def solve(i, li):\n ans = 0\n while True:\n if i < 0 or len(li) <= i or visited[i]:\n break\n if li[i] < len(t):\n visited[i] = True\n break\n if li[i] >= len(t):\n visited[i] = True\n ans += 1\n i += len(t)\n return ans\n \n \n-new_s = \"\"\n while True:\n- new_s += s\n if len(new_s) > len(t):\n s = new_s\n break\n \n s = s*3\n li = z_algorithm(t + s)[len(t):]\n visited = [False] * len(li)\n ans1 = 0\n for i in range(len(li)):\n ans1 = max(ans1, solve(i, li))\n \n-print(ans1)\n", "added_lines": 14, "removed_lines": 3, "code1_lines": 53 }, { "user_id": "u766684188", "problem_id": "p02746", "submission1_id": "s053182443", "submission2_id": "s860322209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput=sys.stdin.readline\n\ndef dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n if db==dd:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(b-d)\n\ndef main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n\nif __name__=='__main__':\n main()", "code2": "import sys\ninput=sys.stdin.readline\n\ndef dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n if abs(db-dd)<2:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(a-c)+abs(b-d)\n\ndef main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n\nif __name__=='__main__':\n main()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584249881", "date2": "1584250317", "bleu_score": "0.9695284383257341", "code1_test_status": [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, 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, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 89, "total_score": 101, "input": "2\n3 4 6 4\n12 3 2 4\n", "actual_output": "5\n11\n", "expected_output": "3\n11\n\n", "anno_code": ["import sys\ninput=sys.stdin.readline # (0): input=\n\ndef dist(a,b,c,d,P3): # (1): dist=\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n if db==dd:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(b-d)\n\ndef main(): # (2): main=\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n\nif __name__=='__main__':\n main()"], "anno_status": [true], "diff_content": " import sys\n input=sys.stdin.readline\n \n def dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n- if db==dd:\n+ if abs(db-dd)<2:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n- return abs(b-d)\n+ return abs(a-c)+abs(b-d)\n \n def main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n \n if __name__=='__main__':\n main()\n", "FL_content": " import sys\n input=sys.stdin.readline\n \n def dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n- if db==dd:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n- return abs(b-d)\n \n def main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n \n if __name__=='__main__':\n main()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u227082700", "problem_id": "p02746", "submission1_id": "s127182110", "submission2_id": "s723173773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n if a>c:a,c=c,a\n if b>d:b,d=d,b\n mi=3**(lv-1)\n ma=2*3**(lv-1)+1\n if xy==\"x\":\n return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n", "code2": "def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n mx=my=0\n for i in range(1,31):\n if a==c and a%3==2 and abs(b-d)>=2:mx=i\n if b==d and b%3==2 and abs(a-c)>=2:my=i\n a=0--a\n b=0--b\n c=0--c\n d=0--d\n a,b,c,d=aa,bb,cc,dd\n if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ac=(3**mx)*((0--a\n a-=ac\n c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584239072", "date2": "1584367928", "bleu_score": "0.7717972440045857", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "2\n3 3 6 0\n8 5 2 5\n", "actual_output": "6\n6\n", "expected_output": "6\n10\n\n", "anno_code": ["\ndef check(lv,aa,bb,cc,dd,xy): # (0): check=\n a,b,c,d=aa,bb,cc,dd # (9): a=3, b=3, c=6, d=0 (16): a=3, b=3, c=6, d=0 ... (908): a=8, b=5, c=2, d=5\n if a>c:a,c=c,a # (10): NO CHANGE (17): NO CHANGE ... (909): a=2, c=8\n if b>d:b,d=d,b # (11): b=0, d=3 (18): b=0, d=3 ... (910): NO CHANGE\n mi=3**(lv-1) # (12): mi=1 (19): mi=1 ... (911): mi=68630377364883\n ma=2*3**(lv-1)+1 # (13): ma=3 (20): ma=3 ... (912): ma=137260754729767\n if xy==\"x\": # (14): b=3, d=0, mx=0, my=0, i=1 (21): b=3, d=0, mx=0, my=0, i=1 ... (913): a=8, c=2, mx=2, my=0, i=30\n return (a<=mi and ma<=c and mi\n mx=my=0 # (6): mx=0, my=0 (463): mx=0, my=0\n for i in range(1,31): # (7): i=1 (22): i=2 ... (914): NO CHANGE\n if check(i,a,b,c,d,\"x\"):mx=i # (8): lv=1, aa=3, bb=3, cc=6, dd=0, xy=x (23): lv=2, aa=3, bb=3, cc=6, dd=0, xy=x ... (900): lv=30, aa=8, bb=5, cc=2, dd=5, xy=x\n if check(i,a,b,c,d,\"y\"):my=i # (15): lv=1, aa=3, bb=3, cc=6, dd=0, xy=y (30): lv=2, aa=3, bb=3, cc=6, dd=0, xy=y ... (907): lv=30, aa=8, bb=5, cc=2, dd=5, xy=y\n if mxmy: # (459): check=, solve=, q=2, _=0 (916): NO CHANGE\n ans=abs(b-d) # (917): ans=0\n mi=3**(mx-1) # (918): mi=3\n ma=2*3**(mx-1)+1 # (919): ma=7\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c)) # (920): check=, solve=, q=2, _=1\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input()) # (2): q=2\nfor _ in range(q): # (3): _=0 (460): _=1\n a,b,c,d=map(int,input().split()) # (4): a=3, b=3, c=6, d=0 (461): a=8, b=5, c=2, d=5\n print(solve(a,b,c,d)) # (5): NO CHANGE (462): NO CHANGE\n"], "anno_status": [false], "diff_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n+def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"x\":\n- return (a<=mi and ma<=c and mi=2:mx=i\n+ if b==d and b%3==2 and abs(a-c)>=2:my=i\n+ a=0--a\n+ b=0--b\n+ c=0--c\n+ d=0--d\n+ a,b,c,d=aa,bb,cc,dd\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n+ ac=(3**mx)*((0--a\n+ a-=ac\n+ c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "FL_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"x\":\n- return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "added_lines": 15, "removed_lines": 14, "code1_lines": 35 }, { "user_id": "u227082700", "problem_id": "p02746", "submission1_id": "s208413754", "submission2_id": "s723173773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n if a>c:a,c=c,a\n if b>d:b,d=d,b\n mi=3**(lv-1)\n ma=2*3**(lv-1)+1\n if xy==\"x\":\n return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n", "code2": "def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n mx=my=0\n for i in range(1,31):\n if a==c and a%3==2 and abs(b-d)>=2:mx=i\n if b==d and b%3==2 and abs(a-c)>=2:my=i\n a=0--a\n b=0--b\n c=0--c\n d=0--d\n a,b,c,d=aa,bb,cc,dd\n if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ac=(3**mx)*((0--a\n a-=ac\n c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584239009", "date2": "1584367928", "bleu_score": "0.7723632856347566", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "2\n3 0 2 0\n12 2 2 2\n", "actual_output": "1\n10\n", "expected_output": "1\n12\n\n", "anno_code": ["\ndef check(lv,aa,bb,cc,dd,xy): # (0): check=\n a,b,c,d=aa,bb,cc,dd # (9): a=3, b=0, c=2, d=0 (16): a=3, b=0, c=2, d=0 ... (908): a=12, b=2, c=2, d=2\n if a>c:a,c=c,a # (10): a=2, c=3 (17): a=2, c=3 ... (909): a=2, c=12\n if b>d:b,d=d,b # (11): NO CHANGE (18): NO CHANGE ... (910): NO CHANGE\n mi=3**(lv-1) # (12): mi=1 (19): mi=1 ... (911): mi=68630377364883\n ma=2*3**(lv-1)+1 # (13): ma=3 (20): ma=3 ... (912): ma=137260754729767\n if xy==\"x\": # (14): a=3, c=2, mx=0, my=0, i=1 (21): a=3, c=2, mx=0, my=0, i=1 ... (913): a=12, c=2, mx=0, my=0, i=30\n return (a<=mi and ma<=c and mi\n mx=my=0 # (6): mx=0, my=0 (463): mx=0, my=0\n for i in range(1,31): # (7): i=1 (22): i=2 ... (914): NO CHANGE\n if check(i,a,b,c,d,\"x\"):mx=i # (8): lv=1, aa=3, bb=0, cc=2, dd=0, xy=x (23): lv=2, aa=3, bb=0, cc=2, dd=0, xy=x ... (900): lv=30, aa=12, bb=2, cc=2, dd=2, xy=x\n if check(i,a,b,c,d,\"y\"):my=i # (15): lv=1, aa=3, bb=0, cc=2, dd=0, xy=y (30): lv=2, aa=3, bb=0, cc=2, dd=0, xy=y ... (907): lv=30, aa=12, bb=2, cc=2, dd=2, xy=y\n if mxmy: # (459): check=, solve=, q=2, _=0 (916): check=, solve=, q=2, _=1\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input()) # (2): q=2\nfor _ in range(q): # (3): _=0 (460): _=1\n a,b,c,d=map(int,input().split()) # (4): a=3, b=0, c=2, d=0 (461): a=12, b=2, d=2\n print(solve(a,b,c,d)) # (5): NO CHANGE (462): NO CHANGE\n"], "anno_status": [false], "diff_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n+def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"x\":\n- return (a<=mi and ma<=c and mi=2:mx=i\n+ if b==d and b%3==2 and abs(a-c)>=2:my=i\n+ a=0--a\n+ b=0--b\n+ c=0--c\n+ d=0--d\n+ a,b,c,d=aa,bb,cc,dd\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n+ ac=(3**mx)*((0--a\n+ a-=ac\n+ c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "FL_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"x\":\n- return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "added_lines": 15, "removed_lines": 14, "code1_lines": 35 }, { "user_id": "u766684188", "problem_id": "p02746", "submission1_id": "s740633465", "submission2_id": "s860322209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput=sys.stdin.readline\n\ndef dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n if db==dd:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(a-c)+abs(b-d)\n\ndef main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n\nif __name__=='__main__':\n main()", "code2": "import sys\ninput=sys.stdin.readline\n\ndef dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n if abs(db-dd)<2:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(a-c)+abs(b-d)\n\ndef main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n\nif __name__=='__main__':\n main()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584250237", "date2": "1584250317", "bleu_score": "0.9825816045076359", "code1_test_status": [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, 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, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 89, "total_score": 101, "input": "2\n3 4 6 4\n8 3 2 5\n", "actual_output": "5\n8\n", "expected_output": "3\n8\n\n", "anno_code": ["import sys\ninput=sys.stdin.readline # (0): input=\n\ndef dist(a,b,c,d,P3): # (1): dist=\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n if db==dd:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(a-c)+abs(b-d)\n\ndef main(): # (2): main=\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n\nif __name__=='__main__':\n main()"], "anno_status": [true], "diff_content": " import sys\n input=sys.stdin.readline\n \n def dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n- if db==dd:\n+ if abs(db-dd)<2:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(a-c)+abs(b-d)\n \n def main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n \n if __name__=='__main__':\n main()\n", "FL_content": " import sys\n input=sys.stdin.readline\n \n def dist(a,b,c,d,P3):\n for p in P3:\n da,ma=divmod(a,p)\n dc,mc=divmod(c,p)\n if da!=dc:\n return abs(a-c)+abs(b-d)\n if da!=1:\n a,c=ma,mc\n continue\n db,mb=divmod(b,p)\n dd,md=divmod(d,p)\n- if db==dd:\n a,c=ma,mc\n continue\n return min(ma+mc+2,2*p-(ma+mc))+abs(b-d)\n return abs(a-c)+abs(b-d)\n \n def main():\n q=int(input())\n P3=[pow(3,i) for i in reversed(range(30))]\n for _ in range(q):\n a,b,c,d=map(lambda x: int(x)-1,input().split())\n print(max(dist(a,b,c,d,P3),dist(b,a,d,c,P3)))\n \n if __name__=='__main__':\n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 29 }, { "user_id": "u227082700", "problem_id": "p02746", "submission1_id": "s070815222", "submission2_id": "s723173773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n if a>c:a,c=c,a\n if b>d:b,d=d,b\n mi=3**(lv-1)\n ma=2*3**(lv-1)+1\n if xy==\"y\":\n return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)+1\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n", "code2": "def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n mx=my=0\n for i in range(1,31):\n if a==c and a%3==2 and abs(b-d)>=2:mx=i\n if b==d and b%3==2 and abs(a-c)>=2:my=i\n a=0--a\n b=0--b\n c=0--c\n d=0--d\n a,b,c,d=aa,bb,cc,dd\n if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ac=(3**mx)*((0--a\n a-=ac\n c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584239574", "date2": "1584367928", "bleu_score": "0.7696786934091637", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "2\n3 8 5 0\n8 5 2 5\n", "actual_output": "10\n11\n", "expected_output": "10\n10\n\n", "anno_code": ["\ndef check(lv,aa,bb,cc,dd,xy): # (0): check=\n a,b,c,d=aa,bb,cc,dd # (9): a=3, b=8, c=5, d=0 (16): a=3, b=8, c=5, d=0 ... (908): a=8, b=5, c=2, d=5\n if a>c:a,c=c,a # (10): NO CHANGE (17): NO CHANGE ... (909): a=2, c=8\n if b>d:b,d=d,b # (11): b=0, d=8 (18): b=0, d=8 ... (910): NO CHANGE\n mi=3**(lv-1) # (12): mi=1 (19): mi=1 ... (911): mi=68630377364883\n ma=2*3**(lv-1)+1 # (13): ma=3 (20): ma=3 ... (912): ma=137260754729767\n if xy==\"y\": # (14): b=8, d=0, mx=0, my=0, i=1 (21): b=8, d=0, mx=0, my=0, i=1 ... (913): a=8, c=2, mx=0, my=2, i=30\n return (a<=mi and ma<=c and mi\n mx=my=0 # (6): mx=0, my=0 (463): mx=0, my=0\n for i in range(1,31): # (7): i=1 (22): i=2 ... (914): NO CHANGE\n if check(i,a,b,c,d,\"x\"):mx=i # (8): lv=1, aa=3, bb=8, cc=5, dd=0, xy=x (23): lv=2, aa=3, bb=8, cc=5, dd=0, xy=x ... (900): lv=30, aa=8, bb=5, cc=2, dd=5, xy=x\n if check(i,a,b,c,d,\"y\"):my=i # (15): lv=1, aa=3, bb=8, cc=5, dd=0, xy=y (30): lv=2, aa=3, bb=8, cc=5, dd=0, xy=y ... (907): lv=30, aa=8, bb=5, cc=2, dd=5, xy=y\n if mx, solve=, q=2, _=1\n return ans\n if mx>my: # (459): check=, solve=, q=2, _=0\n ans=abs(b-d)+1\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input()) # (2): q=2\nfor _ in range(q): # (3): _=0 (460): _=1\n a,b,c,d=map(int,input().split()) # (4): a=3, b=8, c=5, d=0 (461): a=8, b=5, c=2, d=5\n print(solve(a,b,c,d)) # (5): NO CHANGE (462): NO CHANGE\n"], "anno_status": [false], "diff_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n+def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"y\":\n- return (a<=mi and ma<=c and mi=2:mx=i\n+ if b==d and b%3==2 and abs(a-c)>=2:my=i\n+ a=0--a\n+ b=0--b\n+ c=0--c\n+ d=0--d\n+ a,b,c,d=aa,bb,cc,dd\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n- ans=abs(b-d)+1\n+ ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n+ ac=(3**mx)*((0--a\n+ a-=ac\n+ c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "FL_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"y\":\n- return (a<=mi and ma<=c and mimy:\n- ans=abs(b-d)+1\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "added_lines": 17, "removed_lines": 16, "code1_lines": 35 }, { "user_id": "u227082700", "problem_id": "p02746", "submission1_id": "s399239959", "submission2_id": "s723173773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n if a>c:a,c=c,a\n if b>d:b,d=d,b\n mi=3**(lv-1)\n ma=2*3**(lv-1)+1\n aa=0--a\n bb=0--b\n cc=0--c\n dd=0--d\n if xy==\"y\":\n if bb==dd and bb%3==2:return False\n return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n", "code2": "def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n mx=my=0\n for i in range(1,31):\n if a==c and a%3==2 and abs(b-d)>=2:mx=i\n if b==d and b%3==2 and abs(a-c)>=2:my=i\n a=0--a\n b=0--b\n c=0--c\n d=0--d\n a,b,c,d=aa,bb,cc,dd\n if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ac=(3**mx)*((0--a\n a-=ac\n c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584240789", "date2": "1584367928", "bleu_score": "0.7292915391963118", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 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, 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, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 87, "total_score": 101, "input": "2\n3 3 7 0\n8 5 2 5\n", "actual_output": "7\n6\n", "expected_output": "7\n10\n\n", "anno_code": ["\ndef check(lv,aa,bb,cc,dd,xy): # (0): check=\n a,b,c,d=aa,bb,cc,dd # (9): a=3, b=3, c=7, d=0 (20): a=3, b=3, c=7, d=0 ... (1384): a=8, b=5, c=2, d=5\n if a>c:a,c=c,a # (10): NO CHANGE (21): NO CHANGE ... (1385): a=2, c=8\n if b>d:b,d=d,b # (11): b=0, d=3 (22): b=0, d=3 ... (1386): NO CHANGE\n mi=3**(lv-1) # (12): mi=1 (23): mi=1 ... (1387): mi=68630377364883\n ma=2*3**(lv-1)+1 # (13): ma=3 (24): ma=3 ... (1388): ma=137260754729767\n aa=0--a # (14): NO CHANGE (25): NO CHANGE ... (1389): aa=2\n bb=0--b # (15): bb=0 (26): bb=0 ... (1390): NO CHANGE\n cc=0--c # (16): NO CHANGE (27): NO CHANGE ... (1391): cc=8\n dd=0--d # (17): dd=3 (28): dd=3 ... (1392): NO CHANGE\n if xy==\"y\": # (18): b=3, d=0, mx=0, my=0, i=1 (29): b=3, d=0, mx=0, my=0, i=1 ... (1393): a=8, c=2, mx=0, my=0, i=30\n if bb==dd and bb%3==2:return False\n return (a<=mi and ma<=c and mi\n mx=my=0 # (6): mx=0, my=0 (703): mx=0, my=0\n for i in range(1,31): # (7): i=1 (30): i=2 ... (1394): NO CHANGE\n if check(i,a,b,c,d,\"x\"):mx=i # (8): lv=1, aa=3, bb=3, cc=7, dd=0, xy=x (31): lv=2, aa=3, bb=3, cc=7, dd=0, xy=x ... (1372): lv=30, aa=8, bb=5, cc=2, dd=5, xy=x\n if check(i,a,b,c,d,\"y\"):my=i # (19): lv=1, aa=3, bb=3, cc=7, dd=0, xy=y (42): lv=2, aa=3, bb=3, cc=7, dd=0, xy=y ... (1383): lv=30, aa=8, bb=5, cc=2, dd=5, xy=y\n if mxmy: # (699): check=, solve=, q=2, _=0 (1396): check=, solve=, q=2, _=1\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input()) # (2): q=2\nfor _ in range(q): # (3): _=0 (700): _=1\n a,b,c,d=map(int,input().split()) # (4): a=3, b=3, c=7, d=0 (701): a=8, b=5, c=2, d=5\n print(solve(a,b,c,d)) # (5): NO CHANGE (702): NO CHANGE\n"], "anno_status": [false], "diff_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n+def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- aa=0--a\n- bb=0--b\n- cc=0--c\n- dd=0--d\n- if xy==\"y\":\n- if bb==dd and bb%3==2:return False\n- return (a<=mi and ma<=c and mi=2:mx=i\n+ if b==d and b%3==2 and abs(a-c)>=2:my=i\n+ a=0--a\n+ b=0--b\n+ c=0--c\n+ d=0--d\n+ a,b,c,d=aa,bb,cc,dd\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n+ ac=(3**mx)*((0--a\n+ a-=ac\n+ c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "FL_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- aa=0--a\n- bb=0--b\n- cc=0--c\n- dd=0--d\n- if xy==\"y\":\n- if bb==dd and bb%3==2:return False\n- return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "added_lines": 15, "removed_lines": 20, "code1_lines": 41 }, { "user_id": "u044220565", "problem_id": "p02746", "submission1_id": "s407158667", "submission2_id": "s667650014", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\nQ = int(input())\nA = [list(map(int, input().split())) for _ in range(Q)]\n\n\n\ndef measure(A):\n a,b,c,d = A\n if abs(a-c) < abs(b-d):\n s1, s2 = min([a,c]), max([a,c])\n l1, l2 = min([b,d]), max([b,d])\n else:\n l1, l2 = min([a,c]), max([a,c])\n s1, s2 = min([b,d]), max([b,d])\n min_K = int(math.log(s2-s1+1, 3) + 1)\n max_K = int(math.log(l2-l1+1, 3) + 1)\n for k in list(range(min_K, max_K+1))[::-1]:\n v = 3 ** k\n _l = 3 ** (k-1) + 1\n _h = (3 ** (k-1)) * 2\n c1 = s1\n c2 = (s1 % v <= _h) & (_l <= s1 % v)\n c3 = (s2 % v <= _h) & (_l <= s2 % v)\n if c1 & c2 & c3:\n val1 = (s1 % v - _l + 1) + (s2 % v - _l + 1) + (l2 - l1)\n val2 = (_h - s1 % v + 1) + (_h - s2 % v + 1) + (l2 - l1)\n print(min([val1, val2]))\n return None\n print(l2-l1+s2-s1)\n\nif __name__ == '__main__':\n for val in A:\n measure(val)", "code2": "\nimport math\nQ = int(input())\nA = [list(map(int, input().split())) for _ in range(Q)]\n\n\n\ndef measure(A):\n a,b,c,d = A\n if abs(a-c) < abs(b-d):\n s1, s2 = min([a,c]), max([a,c])\n l1, l2 = min([b,d]), max([b,d])\n else:\n l1, l2 = min([a,c]), max([a,c])\n s1, s2 = min([b,d]), max([b,d])\n min_K = int(math.log(s2-s1+1, 3) + 1)\n max_K = int(math.log(l2-l1+1, 3) + 1)\n for k in list(range(min_K, max_K+1))[::-1]:\n v = 3 ** k\n _l = 3 ** (k-1) + 1\n _h = (3 ** (k-1)) * 2\n c1 = s1\n c2 = (s1 % v <= _h) & (_l <= s1 % v)\n c3 = (s2 % v <= _h) & (_l <= s2 % v)\n c4 = True\n if (l1 \n if (l1 % v < _l) & (l2 % v > _h):\n c4 = True\n else:c4=False\n if ((l1 \n if ((l2 % v < _l) & (l1 % v > _h)):\n c4 = False\n if c1 & c2 & c3 & c4:\n val1 = (s1 % v - _l + 1) + (s2 % v - _l + 1) + (l2 - l1)\n val2 = (_h - s1 % v + 1) + (_h - s2 % v + 1) + (l2 - l1)\n print(min([val1, val2]))\n return None\n print(l2-l1+s2-s1)\n\nif __name__ == '__main__':\n for val in A:\n measure(val)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586042625", "date2": "1586047846", "bleu_score": "0.8037443843271839", "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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 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, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 88, "total_score": 101, "input": "2\n3 2 6 4\n13 4 1 5\n", "actual_output": "5\n13\n", "expected_output": "5\n15\n\n", "anno_code": ["\nimport math\nQ = int(input()) # (0): Q=2\nA = [list(map(int, input().split())) for _ in range(Q)] # (1): A\n\n\n\ndef measure(A): # (2): measure=\n a,b,c,d = A\n if abs(a-c) < abs(b-d):\n s1, s2 = min([a,c]), max([a,c])\n l1, l2 = min([b,d]), max([b,d])\n else:\n l1, l2 = min([a,c]), max([a,c])\n s1, s2 = min([b,d]), max([b,d])\n min_K = int(math.log(s2-s1+1, 3) + 1)\n max_K = int(math.log(l2-l1+1, 3) + 1)\n for k in list(range(min_K, max_K+1))[::-1]:\n v = 3 ** k\n _l = 3 ** (k-1) + 1\n _h = (3 ** (k-1)) * 2\n c1 = s1\n c2 = (s1 % v <= _h) & (_l <= s1 % v)\n c3 = (s2 % v <= _h) & (_l <= s2 % v)\n if c1 & c2 & c3:\n val1 = (s1 % v - _l + 1) + (s2 % v - _l + 1) + (l2 - l1)\n val2 = (_h - s1 % v + 1) + (_h - s2 % v + 1) + (l2 - l1)\n print(min([val1, val2]))\n return None\n print(l2-l1+s2-s1)\n\nif __name__ == '__main__':\n for val in A:\n measure(val)"], "anno_status": [true], "diff_content": " \n import math\n Q = int(input())\n A = [list(map(int, input().split())) for _ in range(Q)]\n \n \n \n def measure(A):\n a,b,c,d = A\n if abs(a-c) < abs(b-d):\n s1, s2 = min([a,c]), max([a,c])\n l1, l2 = min([b,d]), max([b,d])\n else:\n l1, l2 = min([a,c]), max([a,c])\n s1, s2 = min([b,d]), max([b,d])\n min_K = int(math.log(s2-s1+1, 3) + 1)\n max_K = int(math.log(l2-l1+1, 3) + 1)\n for k in list(range(min_K, max_K+1))[::-1]:\n v = 3 ** k\n _l = 3 ** (k-1) + 1\n _h = (3 ** (k-1)) * 2\n c1 = s1\n c2 = (s1 % v <= _h) & (_l <= s1 % v)\n c3 = (s2 % v <= _h) & (_l <= s2 % v)\n- if c1 & c2 & c3:\n+ c4 = True\n+ if (l1 \n+ if (l1 % v < _l) & (l2 % v > _h):\n+ c4 = True\n+ else:c4=False\n+ if ((l1 \n+ if ((l2 % v < _l) & (l1 % v > _h)):\n+ c4 = False\n+ if c1 & c2 & c3 & c4:\n val1 = (s1 % v - _l + 1) + (s2 % v - _l + 1) + (l2 - l1)\n val2 = (_h - s1 % v + 1) + (_h - s2 % v + 1) + (l2 - l1)\n print(min([val1, val2]))\n return None\n print(l2-l1+s2-s1)\n \n if __name__ == '__main__':\n for val in A:\n measure(val)\n", "FL_content": " \n import math\n Q = int(input())\n A = [list(map(int, input().split())) for _ in range(Q)]\n \n \n \n def measure(A):\n a,b,c,d = A\n if abs(a-c) < abs(b-d):\n s1, s2 = min([a,c]), max([a,c])\n l1, l2 = min([b,d]), max([b,d])\n else:\n l1, l2 = min([a,c]), max([a,c])\n s1, s2 = min([b,d]), max([b,d])\n min_K = int(math.log(s2-s1+1, 3) + 1)\n max_K = int(math.log(l2-l1+1, 3) + 1)\n for k in list(range(min_K, max_K+1))[::-1]:\n v = 3 ** k\n _l = 3 ** (k-1) + 1\n _h = (3 ** (k-1)) * 2\n c1 = s1\n c2 = (s1 % v <= _h) & (_l <= s1 % v)\n c3 = (s2 % v <= _h) & (_l <= s2 % v)\n- if c1 & c2 & c3:\n val1 = (s1 % v - _l + 1) + (s2 % v - _l + 1) + (l2 - l1)\n val2 = (_h - s1 % v + 1) + (_h - s2 % v + 1) + (l2 - l1)\n print(min([val1, val2]))\n return None\n print(l2-l1+s2-s1)\n \n if __name__ == '__main__':\n for val in A:\n measure(val)\n", "added_lines": 9, "removed_lines": 1, "code1_lines": 34 }, { "user_id": "u227082700", "problem_id": "p02746", "submission1_id": "s797433160", "submission2_id": "s723173773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n if a>c:a,c=c,a\n if b>d:b,d=d,b\n mi=3**(lv-1)\n ma=2*3**(lv-1)+1\n if xy==\"y\":\n return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n", "code2": "def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n mx=my=0\n for i in range(1,31):\n if a==c and a%3==2 and abs(b-d)>=2:mx=i\n if b==d and b%3==2 and abs(a-c)>=2:my=i\n a=0--a\n b=0--b\n c=0--c\n d=0--d\n a,b,c,d=aa,bb,cc,dd\n if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ac=(3**mx)*((0--a\n a-=ac\n c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584239159", "date2": "1584367928", "bleu_score": "0.7717972440045857", "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, 0, 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, 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], "code1_test_score": 96, "total_score": 101, "input": "2\n2 8 2 4\n13 3 2 5\n", "actual_output": "4\n13\n", "expected_output": "6\n13\n\n", "anno_code": ["\ndef check(lv,aa,bb,cc,dd,xy): # (0): check=\n a,b,c,d=aa,bb,cc,dd # (9): a=2, b=8, c=2, d=4 (16): a=2, b=8, c=2, d=4 ... (908): a=13, b=3, c=2, d=5\n if a>c:a,c=c,a # (10): NO CHANGE (17): NO CHANGE ... (909): a=2, c=13\n if b>d:b,d=d,b # (11): b=4, d=8 (18): b=4, d=8 ... (910): NO CHANGE\n mi=3**(lv-1) # (12): mi=1 (19): mi=1 ... (911): mi=68630377364883\n ma=2*3**(lv-1)+1 # (13): ma=3 (20): ma=3 ... (912): ma=137260754729767\n if xy==\"y\": # (14): b=8, d=4, mx=0, my=0, i=1 (21): b=8, d=4, mx=0, my=0, i=1 ... (913): a=13, c=2, mx=0, my=0, i=30\n return (a<=mi and ma<=c and mi\n mx=my=0 # (6): mx=0, my=0 (463): mx=0, my=0\n for i in range(1,31): # (7): i=1 (22): i=2 ... (914): NO CHANGE\n if check(i,a,b,c,d,\"x\"):mx=i # (8): lv=1, aa=2, bb=8, cc=2, dd=4, xy=x (23): lv=2, aa=2, bb=8, cc=2, dd=4, xy=x ... (900): lv=30, aa=13, bb=3, cc=2, dd=5, xy=x\n if check(i,a,b,c,d,\"y\"):my=i # (15): lv=1, aa=2, bb=8, cc=2, dd=4, xy=y (30): lv=2, aa=2, bb=8, cc=2, dd=4, xy=y ... (907): lv=30, aa=13, bb=3, cc=2, dd=5, xy=y\n if mxmy: # (459): check=, solve=, q=2, _=0 (916): check=, solve=, q=2, _=1\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input()) # (2): q=2\nfor _ in range(q): # (3): _=0 (460): _=1\n a,b,c,d=map(int,input().split()) # (4): a=2, b=8, c=2, d=4 (461): a=13, b=3, d=5\n print(solve(a,b,c,d)) # (5): NO CHANGE (462): NO CHANGE\n"], "anno_status": [false], "diff_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n+def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"y\":\n- return (a<=mi and ma<=c and mi=2:mx=i\n+ if b==d and b%3==2 and abs(a-c)>=2:my=i\n+ a=0--a\n+ b=0--b\n+ c=0--c\n+ d=0--d\n+ a,b,c,d=aa,bb,cc,dd\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n+ ac=(3**mx)*((0--a\n+ a-=ac\n+ c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "FL_content": "-\n-def check(lv,aa,bb,cc,dd,xy):\n a,b,c,d=aa,bb,cc,dd\n- if a>c:a,c=c,a\n- if b>d:b,d=d,b\n- mi=3**(lv-1)\n- ma=2*3**(lv-1)+1\n- if xy==\"y\":\n- return (a<=mi and ma<=c and mimy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "added_lines": 15, "removed_lines": 14, "code1_lines": 35 }, { "user_id": "u227082700", "problem_id": "p02746", "submission1_id": "s365279194", "submission2_id": "s723173773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef solve(a,b,c,d):\n x1,y1,x2,y2=a,b,c,d\n mx=my=0\n if x1==x2 and x1%3==2:mx=1\n if y1==y2 and y1%3==2:my=1\n for i in range(29):\n x1=0--x1\n y1=0--y1\n x2=0--x2\n y2=0--y2\n if x1==x2 and x1%3==2:mx=i+2\n if y1==y2 and y1%3==2:my=i+2\n ans=abs(a-c)+abs(b-d)\n if mxmy:\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return ans\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n", "code2": "def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n mx=my=0\n for i in range(1,31):\n if a==c and a%3==2 and abs(b-d)>=2:mx=i\n if b==d and b%3==2 and abs(a-c)>=2:my=i\n a=0--a\n b=0--b\n c=0--c\n d=0--d\n a,b,c,d=aa,bb,cc,dd\n if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ac=(3**mx)*((0--a\n a-=ac\n c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584238369", "date2": "1584367928", "bleu_score": "0.6845810060545717", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 80, "total_score": 101, "input": "2\n1 0 7 0\n4 2 0 2\n", "actual_output": "6\n137260754729766\n", "expected_output": "6\n6\n\n", "anno_code": ["\ndef solve(a,b,c,d): # (0): solve=\n x1,y1,x2,y2=a,b,c,d # (5): x1=1, y1=0, x2=7, y2=0 (219): x1=4, y1=2, x2=0, y2=2\n mx=my=0 # (6): mx=0, my=0 (220): mx=0, my=0\n if x1==x2 and x1%3==2:mx=1 # (7): NO CHANGE (221): NO CHANGE\n if y1==y2 and y1%3==2:my=1 # (8): NO CHANGE (222): my=1\n for i in range(29): # (9): i=0 (16): i=1 ... (426): NO CHANGE\n x1=0--x1 # (10): NO CHANGE (17): NO CHANGE ... (420): NO CHANGE\n y1=0--y1 # (11): NO CHANGE (18): NO CHANGE ... (421): NO CHANGE\n x2=0--x2 # (12): NO CHANGE (19): NO CHANGE ... (422): NO CHANGE\n y2=0--y2 # (13): NO CHANGE (20): NO CHANGE ... (423): NO CHANGE\n if x1==x2 and x1%3==2:mx=i+2 # (14): NO CHANGE (21): NO CHANGE ... (424): NO CHANGE\n if y1==y2 and y1%3==2:my=i+2 # (15): NO CHANGE (22): NO CHANGE ... (425): my=30\n ans=abs(a-c)+abs(b-d) # (213): ans=6 (427): ans=4\n if mx, q=2, _=1\n return ans\n if mx>my: # (215): solve=, q=2, _=0\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return ans\n ans=1/0\nq=int(input()) # (1): q=2\nfor _ in range(q): # (2): _=0 (216): _=1\n a,b,c,d=map(int,input().split()) # (3): a=1, b=0, c=7, d=0 (217): a=4, b=2, c=0, d=2\n print(solve(a,b,c,d)) # (4): NO CHANGE (218): NO CHANGE\n"], "anno_status": [true], "diff_content": "-\n-def solve(a,b,c,d):\n- x1,y1,x2,y2=a,b,c,d\n+def solve(aa,bb,cc,dd):\n+ a,b,c,d=aa,bb,cc,dd\n mx=my=0\n- if x1==x2 and x1%3==2:mx=1\n- if y1==y2 and y1%3==2:my=1\n- for i in range(29):\n- x1=0--x1\n- y1=0--y1\n- x2=0--x2\n- y2=0--y2\n- if x1==x2 and x1%3==2:mx=i+2\n- if y1==y2 and y1%3==2:my=i+2\n- ans=abs(a-c)+abs(b-d)\n+ for i in range(1,31):\n+ if a==c and a%3==2 and abs(b-d)>=2:mx=i\n+ if b==d and b%3==2 and abs(a-c)>=2:my=i\n+ a=0--a\n+ b=0--b\n+ c=0--c\n+ d=0--d\n+ a,b,c,d=aa,bb,cc,dd\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n+ ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n+ ac=(3**mx)*((0--a\n+ a-=ac\n+ c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n- if mx==my==0:return ans\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "FL_content": "-\n-def solve(a,b,c,d):\n- x1,y1,x2,y2=a,b,c,d\n mx=my=0\n- if x1==x2 and x1%3==2:mx=1\n- if y1==y2 and y1%3==2:my=1\n- for i in range(29):\n- x1=0--x1\n- y1=0--y1\n- x2=0--x2\n- y2=0--y2\n- if x1==x2 and x1%3==2:mx=i+2\n- if y1==y2 and y1%3==2:my=i+2\n- ans=abs(a-c)+abs(b-d)\n if mxmy:\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n- if mx==my==0:return ans\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "added_lines": 20, "removed_lines": 15, "code1_lines": 31 }, { "user_id": "u227082700", "problem_id": "p02746", "submission1_id": "s212622760", "submission2_id": "s723173773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef solve(a,b,c,d):\n x1,y1,x2,y2=a,b,c,d\n mx=my=0\n if x1==x2 and x1%3==2:mx=1\n if y1==y2 and y1%3==2:my=1\n for i in range(29):\n x1=0--x1\n y1=0--y1\n x2=0--x2\n y2=0--y2\n if x1==x2 and x1%3==2:mx=i+2\n if y1==y2 and y1%3==2:my=i+2\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n", "code2": "def solve(aa,bb,cc,dd):\n a,b,c,d=aa,bb,cc,dd\n mx=my=0\n for i in range(1,31):\n if a==c and a%3==2 and abs(b-d)>=2:mx=i\n if b==d and b%3==2 and abs(a-c)>=2:my=i\n a=0--a\n b=0--b\n c=0--c\n d=0--d\n a,b,c,d=aa,bb,cc,dd\n if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ac=(3**mx)*((0--a\n a-=ac\n c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input())\nfor _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584238568", "date2": "1584367928", "bleu_score": "0.7182262651189815", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 80, "total_score": 101, "input": "2\n0 4 2 0\n12 2 2 2\n", "actual_output": "6\n137260754729772\n", "expected_output": "6\n12\n\n", "anno_code": ["\ndef solve(a,b,c,d): # (0): solve=\n x1,y1,x2,y2=a,b,c,d # (5): x1=0, y1=4, x2=2, y2=0 (218): x1=12, y1=2, x2=2, y2=2\n mx=my=0 # (6): mx=0, my=0 (219): mx=0, my=0\n if x1==x2 and x1%3==2:mx=1 # (7): NO CHANGE (220): NO CHANGE\n if y1==y2 and y1%3==2:my=1 # (8): NO CHANGE (221): my=1\n for i in range(29): # (9): i=0 (16): i=1 ... (425): NO CHANGE\n x1=0--x1 # (10): NO CHANGE (17): NO CHANGE ... (419): NO CHANGE\n y1=0--y1 # (11): NO CHANGE (18): NO CHANGE ... (420): NO CHANGE\n x2=0--x2 # (12): NO CHANGE (19): NO CHANGE ... (421): NO CHANGE\n y2=0--y2 # (13): NO CHANGE (20): NO CHANGE ... (422): NO CHANGE\n if x1==x2 and x1%3==2:mx=i+2 # (14): NO CHANGE (21): NO CHANGE ... (423): NO CHANGE\n if y1==y2 and y1%3==2:my=i+2 # (15): NO CHANGE (22): NO CHANGE ... (424): my=30\n if mx, q=2, _=1\n return ans\n if mx>my: # (214): solve=, q=2, _=0\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\nq=int(input()) # (1): q=2\nfor _ in range(q): # (2): _=0 (215): _=1\n a,b,c,d=map(int,input().split()) # (3): a=0, b=4, c=2, d=0 (216): a=12, b=2, d=2\n print(solve(a,b,c,d)) # (4): NO CHANGE (217): NO CHANGE\n"], "anno_status": [true], "diff_content": "-\n-def solve(a,b,c,d):\n- x1,y1,x2,y2=a,b,c,d\n+def solve(aa,bb,cc,dd):\n+ a,b,c,d=aa,bb,cc,dd\n mx=my=0\n- if x1==x2 and x1%3==2:mx=1\n- if y1==y2 and y1%3==2:my=1\n- for i in range(29):\n- x1=0--x1\n- y1=0--y1\n- x2=0--x2\n- y2=0--y2\n- if x1==x2 and x1%3==2:mx=i+2\n- if y1==y2 and y1%3==2:my=i+2\n+ for i in range(1,31):\n+ if a==c and a%3==2 and abs(b-d)>=2:mx=i\n+ if b==d and b%3==2 and abs(a-c)>=2:my=i\n+ a=0--a\n+ b=0--b\n+ c=0--c\n+ d=0--d\n+ a,b,c,d=aa,bb,cc,dd\n+ if mx==my==0:return abs(a-c)+abs(b-d)\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n+ ac=(3**mx)*((0--a\n+ a-=ac\n+ c-=ac\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "FL_content": "-\n-def solve(a,b,c,d):\n- x1,y1,x2,y2=a,b,c,d\n mx=my=0\n- if x1==x2 and x1%3==2:mx=1\n- if y1==y2 and y1%3==2:my=1\n- for i in range(29):\n- x1=0--x1\n- y1=0--y1\n- x2=0--x2\n- y2=0--y2\n- if x1==x2 and x1%3==2:mx=i+2\n- if y1==y2 and y1%3==2:my=i+2\n if mxmy:\n ans=abs(b-d)\n mi=3**(mx-1)\n ma=2*3**(mx-1)+1\n ans+=min(abs(mi-a)+abs(mi-c),abs(ma-a)+abs(ma-c))\n return ans\n if mx==my==0:return abs(a-c)+abs(b-d)\n ans=1/0\n q=int(input())\n for _ in range(q):\n a,b,c,d=map(int,input().split())\n print(solve(a,b,c,d))\n-\n", "added_lines": 17, "removed_lines": 13, "code1_lines": 32 }, { "user_id": "u350248178", "problem_id": "p03054", "submission1_id": "s306671428", "submission2_id": "s065885896", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,n=[int(j) for j in input().split()]\nR,C=[int(j) for j in input().split()]\ns=input()\nt=input()\n\n\nx=C\nl,r=1,w\nfor i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n if not l<=x<=r:\n print(\"NO\")\n exit()\n \n\n\n\nx=R\nl,r=1,h\nfor i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n if not l<=x<=r:\n print(\"NO\")\n exit()\n\n\nprint(\"YES\")", "code2": "h,w,n=[int(j) for j in input().split()]\nR,C=[int(j) for j in input().split()]\ns=input()\nt=input()\n\n\nx=C\nl,r=1,w\nfor i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n if l==0:\n l=1\n if r>w:\n r=w\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\n\nx=h+1-R\nl,r=1,h\nfor i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n if l==0:\n l=1\n if r>h:\n r=h\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\nprint(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572072114", "date2": "1572076028", "bleu_score": "0.7639228438577431", "code1_test_status": [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, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "4 4 5\n2 2\nUDRRR\nLLDTD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " h,w,n=[int(j) for j in input().split()]\n R,C=[int(j) for j in input().split()]\n s=input()\n t=input()\n \n \n x=C\n l,r=1,w\n for i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n-\n+ if l==0:\n+ l=1\n+ if r>w:\n+ r=w\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n- if not l<=x<=r:\n+ if l>r:\n print(\"NO\")\n exit()\n- \n-\n-\n+if not l<=x<=r:\n+ print(\"NO\")\n+ exit()\n \n-x=R\n+x=h+1-R\n l,r=1,h\n for i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n+ if l==0:\n+ l=1\n+ if r>h:\n+ r=h\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n- if not l<=x<=r:\n+ if l>r:\n print(\"NO\")\n exit()\n-\n-\n+if not l<=x<=r:\n+ print(\"NO\")\n+ exit()\n print(\"YES\")\n", "FL_content": " h,w,n=[int(j) for j in input().split()]\n R,C=[int(j) for j in input().split()]\n s=input()\n t=input()\n \n \n x=C\n l,r=1,w\n for i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n-\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n- if not l<=x<=r:\n print(\"NO\")\n exit()\n- \n-\n-\n \n-x=R\n l,r=1,h\n for i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n- if not l<=x<=r:\n print(\"NO\")\n exit()\n-\n-\n print(\"YES\")\n", "added_lines": 17, "removed_lines": 9, "code1_lines": 42 }, { "user_id": "u292810930", "problem_id": "p03054", "submission1_id": "s607883024", "submission2_id": "s471321629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\nl = 0\nr = W+1\nu = 0\nd = H+1\nfor s,t in zip(S[::-1],T[::-1]):\n if s == 'L' and t != 'R':\n l += 1\n if s == 'R' and t != 'L':\n r -= 1\n if s == 'U' and t != 'D':\n u += 1\n if s == 'D' and t != 'U':\n d -= 1\n if l == r-1 or u == d-1:\n break\nif l < sc < r and u < sr < d:\n print('YES')\nelse:\n print('NO')", "code2": "H, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\nl = 0\nr = W+1\nu = 0\nd = H+1\nflag = True\nfor s,t in zip(S[::-1],T[::-1]):\n if l+1==r or u+1==d:\n flag=False\n break\n if t == 'L':\n r = min(W+1, r+1)\n if t == 'R':\n l = max(0, l-1)\n if t == 'U':\n d = min(H+1, d+1)\n if t == 'D':\n u = max(0, u-1)\n if s == 'L':\n l += 1\n if s == 'R':\n r -= 1\n if s == 'U':\n u += 1\n if s == 'D':\n d -= 1\nif not(l < sc < r and u < sr < d):\n flag = False\nif flag:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557030284", "date2": "1557546367", "bleu_score": "0.6537723452549363", "code1_test_status": [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, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4 4 5\n2 2\nUDRRR\nLLDTD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["H, W, N = map(int, input().split()) # (0): H=4, W=4, N=5\nsr, sc = map(int, input().split()) # (1): sr=2, sc=2\nS = input() # (2): S=UDRRR\nT = input() # (3): T=LLDTD\nl = 0 # (4): l=0\nr = W+1 # (5): r=5\nu = 0 # (6): u=0\nd = H+1 # (7): d=5\nfor s,t in zip(S[::-1],T[::-1]): # (8): s=R, t=D (15): t=T ... (43): NO CHANGE\n if s == 'L' and t != 'R': # (9): NO CHANGE (16): NO CHANGE ... (37): NO CHANGE\n l += 1\n if s == 'R' and t != 'L': # (10): NO CHANGE (17): NO CHANGE ... (38): NO CHANGE\n r -= 1 # (11): r=4 (18): r=3 (25): r=2\n if s == 'U' and t != 'D': # (12): NO CHANGE (19): NO CHANGE ... (39): NO CHANGE\n u += 1 # (40): u=1\n if s == 'D' and t != 'U': # (13): NO CHANGE (20): NO CHANGE ... (41): NO CHANGE\n d -= 1 # (34): d=4\n if l == r-1 or u == d-1: # (14): NO CHANGE (21): NO CHANGE ... (42): NO CHANGE\n break\nif l < sc < r and u < sr < d: # (44): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n l = 0\n r = W+1\n u = 0\n d = H+1\n+flag = True\n for s,t in zip(S[::-1],T[::-1]):\n- if s == 'L' and t != 'R':\n+ if l+1==r or u+1==d:\n+ flag=False\n+ break\n+ if t == 'L':\n+ r = min(W+1, r+1)\n+ if t == 'R':\n+ l = max(0, l-1)\n+ if t == 'U':\n+ d = min(H+1, d+1)\n+ if t == 'D':\n+ u = max(0, u-1)\n+ if s == 'L':\n l += 1\n- if s == 'R' and t != 'L':\n+ if s == 'R':\n r -= 1\n- if s == 'U' and t != 'D':\n+ if s == 'U':\n u += 1\n- if s == 'D' and t != 'U':\n+ if s == 'D':\n d -= 1\n- if l == r-1 or u == d-1:\n- break\n-if l < sc < r and u < sr < d:\n+if not(l < sc < r and u < sr < d):\n+ flag = False\n+if flag:\n print('YES')\n else:\n print('NO')\n", "FL_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n l = 0\n r = W+1\n u = 0\n d = H+1\n for s,t in zip(S[::-1],T[::-1]):\n- if s == 'L' and t != 'R':\n l += 1\n- if s == 'R' and t != 'L':\n r -= 1\n- if s == 'U' and t != 'D':\n u += 1\n- if s == 'D' and t != 'U':\n d -= 1\n- if l == r-1 or u == d-1:\n- break\n-if l < sc < r and u < sr < d:\n print('YES')\n else:\n print('NO')\n", "added_lines": 19, "removed_lines": 7, "code1_lines": 23 }, { "user_id": "u788137651", "problem_id": "p03054", "submission1_id": "s486221148", "submission2_id": "s187430729", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\n\nleft = 1\nright = W\nup = 1\ndown = H\n\nfor i in reversed(range(N)):\n if i != N - 1:\n if T[i] == \"U\":\n if down != H:\n down -= 1\n elif T[i] == \"D\":\n if up != 1:\n up += 1\n elif T[i] == \"L\":\n if right != W:\n right += 1\n else:\n if left != 1:\n left -= 1\n if S[i] == \"U\":\n up -= 1\n elif S[i] == \"D\":\n down += 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n if left == right or up == down:\n print(\"NO\")\n exit()\nif left <= sr <= right and up <= sc <= down:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "code2": "H, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\n\nleft = 1\nright = W\nup = 1\ndown = H\n\nfor i in reversed(range(N)):\n if T[i] == \"U\":\n down = min(H, down+1)\n elif T[i] == \"D\":\n up = max(1, up-1)\n elif T[i] == \"L\":\n right = min(W, right+1)\n else:\n left = max(1, left-1)\n\n if S[i] == \"U\":\n up += 1\n elif S[i] == \"D\":\n down -= 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n\n \n\n if left > right or up > down:\n print(\"NO\")\n exit()\n\n\n\nif left <= sc <= right and up <= sr <= down:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557176064", "date2": "1557182082", "bleu_score": "0.7634609941532304", "code1_test_status": [0, 1, 0, 1, 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, 1, 1, 1, 0, 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, 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, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1], "code1_test_score": 89, "total_score": 103, "input": "2 5 3\n2 4\nRLR\nLUD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["H, W, N = map(int, input().split()) # (0): H=2, W=5, N=3\nsr, sc = map(int, input().split()) # (1): sr=2, sc=4\nS = input() # (2): S=RLR\nT = input() # (3): T=LUD\n\nleft = 1 # (4): left=1\nright = W # (5): right=5\nup = 1 # (6): up=1\ndown = H # (7): down=2\n\nfor i in reversed(range(N)): # (8): i=2 (15): i=1 ... (36): NO CHANGE\n if i != N - 1: # (9): NO CHANGE (16): NO CHANGE (25): NO CHANGE\n if T[i] == \"U\": # (17): NO CHANGE (26): NO CHANGE\n if down != H: # (18): NO CHANGE\n down -= 1\n elif T[i] == \"D\": # (27): NO CHANGE\n if up != 1:\n up += 1\n elif T[i] == \"L\": # (28): NO CHANGE\n if right != W: # (29): NO CHANGE\n right += 1 # (30): right=5\n else:\n if left != 1:\n left -= 1\n if S[i] == \"U\": # (10): NO CHANGE (19): NO CHANGE (31): NO CHANGE\n up -= 1\n elif S[i] == \"D\": # (11): NO CHANGE (20): NO CHANGE (32): NO CHANGE\n down += 1\n elif S[i] == \"L\": # (12): NO CHANGE (21): NO CHANGE (33): NO CHANGE\n left += 1 # (22): left=2\n else:\n right -= 1 # (13): right=4 (34): right=4\n if left == right or up == down: # (14): NO CHANGE (23): NO CHANGE (35): NO CHANGE\n print(\"NO\")\n exit()\nif left <= sr <= right and up <= sc <= down: # (37): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n"], "anno_status": [true], "diff_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n \n left = 1\n right = W\n up = 1\n down = H\n \n for i in reversed(range(N)):\n- if i != N - 1:\n- if T[i] == \"U\":\n- if down != H:\n- down -= 1\n- elif T[i] == \"D\":\n- if up != 1:\n- up += 1\n- elif T[i] == \"L\":\n- if right != W:\n- right += 1\n- else:\n- if left != 1:\n- left -= 1\n+ if T[i] == \"U\":\n+ down = min(H, down+1)\n+ elif T[i] == \"D\":\n+ up = max(1, up-1)\n+ elif T[i] == \"L\":\n+ right = min(W, right+1)\n+ else:\n+ left = max(1, left-1)\n+\n if S[i] == \"U\":\n- up -= 1\n+ up += 1\n elif S[i] == \"D\":\n- down += 1\n+ down -= 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n- if left == right or up == down:\n+\n+ \n+\n+ if left > right or up > down:\n print(\"NO\")\n exit()\n-if left <= sr <= right and up <= sc <= down:\n+\n+\n+\n+if left <= sc <= right and up <= sr <= down:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "FL_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n \n left = 1\n right = W\n up = 1\n down = H\n \n for i in reversed(range(N)):\n- if i != N - 1:\n- if T[i] == \"U\":\n- if down != H:\n- down -= 1\n- elif T[i] == \"D\":\n- if up != 1:\n- up += 1\n- elif T[i] == \"L\":\n- if right != W:\n- right += 1\n- else:\n- if left != 1:\n- left -= 1\n if S[i] == \"U\":\n- up -= 1\n elif S[i] == \"D\":\n- down += 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n- if left == right or up == down:\n print(\"NO\")\n exit()\n-if left <= sr <= right and up <= sc <= down:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "added_lines": 19, "removed_lines": 17, "code1_lines": 40 }, { "user_id": "u071680334", "problem_id": "p03054", "submission1_id": "s425263924", "submission2_id": "s801621750", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n S = S[::-1]\n T = T[::-1]\n L, R, U, D = 1, W, 1, H\n f = False\n if S[0] == \"L\":\n L += 1\n elif S[0] == \"R\":\n R -= 1\n elif S[0] == \"U\":\n U += 1\n else:\n D -= 1\n if R < L or D < U:\n f = True\n for i in range(1, N):\n if (S[i] == \"L\" and T[i] == \"R\") or (S[i] == \"R\" and T[i] == \"L\") or (S[i] == \"U\" and T[i] == \"D\") or (S[i] == \"D\" and T[i] == \"U\"):\n continue\n if S[i] == \"L\":\n L += 1\n elif S[i] == \"R\":\n R -= 1\n elif S[i] == \"U\":\n U += 1\n else:\n D -= 1\n if R < L or D < U:\n f = True\n if sr < U or D < sr or sc < L or R < sc:\n f = True\n if f:\n print(\"NO\")\n else:\n print(\"YES\")\n\nif __name__ == \"__main__\":\n main()\n", "code2": "def main():\n H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n f = True\n pL, pR, pU, pD = sc, sc, sr, sr\n for i in range(N):\n if S[i] == \"L\":\n pL -= 1\n elif S[i] == \"R\":\n pR += 1\n elif S[i] == \"U\":\n pU -= 1\n else:\n pD += 1\n if pL <= 0 or W < pR or pU <= 0 or H < pD:\n f = False\n if T[i] == \"L\":\n if 1 < pR:\n pR -= 1\n elif T[i] == \"R\":\n if pL < W:\n pL += 1\n elif T[i] == \"U\":\n if 1 < pD:\n pD -= 1\n else:\n if pU < H:\n pU += 1\n if f:\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588978287", "date2": "1588978621", "bleu_score": "0.720442110940279", "code1_test_status": [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, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4 4 5\n2 2\nUDRRR\nLLDTD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["def main(): # (0): main=\n H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n S = S[::-1]\n T = T[::-1]\n L, R, U, D = 1, W, 1, H\n f = False\n if S[0] == \"L\":\n L += 1\n elif S[0] == \"R\":\n R -= 1\n elif S[0] == \"U\":\n U += 1\n else:\n D -= 1\n if R < L or D < U:\n f = True\n for i in range(1, N):\n if (S[i] == \"L\" and T[i] == \"R\") or (S[i] == \"R\" and T[i] == \"L\") or (S[i] == \"U\" and T[i] == \"D\") or (S[i] == \"D\" and T[i] == \"U\"):\n continue\n if S[i] == \"L\":\n L += 1\n elif S[i] == \"R\":\n R -= 1\n elif S[i] == \"U\":\n U += 1\n else:\n D -= 1\n if R < L or D < U:\n f = True\n if sr < U or D < sr or sc < L or R < sc:\n f = True\n if f:\n print(\"NO\")\n else:\n print(\"YES\")\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " def main():\n H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n- S = S[::-1]\n- T = T[::-1]\n- L, R, U, D = 1, W, 1, H\n- f = False\n- if S[0] == \"L\":\n- L += 1\n- elif S[0] == \"R\":\n- R -= 1\n- elif S[0] == \"U\":\n- U += 1\n- else:\n- D -= 1\n- if R < L or D < U:\n- f = True\n- for i in range(1, N):\n- if (S[i] == \"L\" and T[i] == \"R\") or (S[i] == \"R\" and T[i] == \"L\") or (S[i] == \"U\" and T[i] == \"D\") or (S[i] == \"D\" and T[i] == \"U\"):\n- continue\n+ f = True\n+ pL, pR, pU, pD = sc, sc, sr, sr\n+ for i in range(N):\n if S[i] == \"L\":\n- L += 1\n+ pL -= 1\n elif S[i] == \"R\":\n- R -= 1\n+ pR += 1\n elif S[i] == \"U\":\n- U += 1\n+ pU -= 1\n+ else:\n+ pD += 1\n+ if pL <= 0 or W < pR or pU <= 0 or H < pD:\n+ f = False\n+ if T[i] == \"L\":\n+ if 1 < pR:\n+ pR -= 1\n+ elif T[i] == \"R\":\n+ if pL < W:\n+ pL += 1\n+ elif T[i] == \"U\":\n+ if 1 < pD:\n+ pD -= 1\n else:\n- D -= 1\n- if R < L or D < U:\n- f = True\n- if sr < U or D < sr or sc < L or R < sc:\n- f = True\n+ if pU < H:\n+ pU += 1\n if f:\n- print(\"NO\")\n- else:\n print(\"YES\")\n+ else:\n+ print(\"NO\")\n \n if __name__ == \"__main__\":\n main()\n-\n", "FL_content": " def main():\n H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n- S = S[::-1]\n- T = T[::-1]\n- L, R, U, D = 1, W, 1, H\n- f = False\n- if S[0] == \"L\":\n- L += 1\n- elif S[0] == \"R\":\n- R -= 1\n- elif S[0] == \"U\":\n- U += 1\n- else:\n- D -= 1\n- if R < L or D < U:\n- f = True\n- for i in range(1, N):\n- if (S[i] == \"L\" and T[i] == \"R\") or (S[i] == \"R\" and T[i] == \"L\") or (S[i] == \"U\" and T[i] == \"D\") or (S[i] == \"D\" and T[i] == \"U\"):\n- continue\n if S[i] == \"L\":\n- L += 1\n elif S[i] == \"R\":\n- R -= 1\n elif S[i] == \"U\":\n- U += 1\n else:\n- D -= 1\n- if R < L or D < U:\n- f = True\n- if sr < U or D < sr or sc < L or R < sc:\n- f = True\n if f:\n- print(\"NO\")\n- else:\n print(\"YES\")\n \n if __name__ == \"__main__\":\n main()\n-\n", "added_lines": 23, "removed_lines": 28, "code1_lines": 42 }, { "user_id": "u210440747", "problem_id": "p03054", "submission1_id": "s568595675", "submission2_id": "s733582086", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n def f(d, x):\n if d=='L':\n r[L] = (min(max(0, r[L]-x), w-1) )\n if d=='R':\n r[R] = (min(max(0, r[R]+x), w-1) )\n if d=='U':\n r[U] = (min(max(0, r[U]-x), h-1) )\n if d=='D':\n r[D] = (min(max(0, r[D]+x), h-1) )\n \n def check():\n if r[L] >= r[R]:\n return False\n if r[U] >= r[D]:\n return False\n return True\n \n f(ls[0], 1)\n for s, t in zip(ls[1:], lt[1:]):\n f(s, 1)\n f(t, -1)\n if check():\n print('NO')\n return\n print('YES')\n \n \n \n\nif __name__=='__main__':\n main()\n\n", "code2": "\n\n\ndef main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n sr, sc = sr-1, sc-1\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n def f(d):\n if d=='L':\n r[L] = (min(max(-1, r[L]+1), w))\n if d=='R':\n r[R] = (min(max(-1, r[R]-1), w))\n if d=='U':\n r[U] = (min(max(-1, r[U]+1), h))\n if d=='D':\n r[D] = (min(max(-1, r[D]-1), h))\n \n def g(d):\n if d=='L':\n r[R] = (min(max(0, r[R]+1), w-1))\n if d=='R':\n r[L] = (min(max(0, r[L]-1), w-1))\n if d=='U':\n r[D] = (min(max(0, r[D]+1), h-1))\n if d=='D':\n r[U] = (min(max(0, r[U]-1), h-1))\n \n def check():\n if r[L] > r[R] or r[L] < 0 or r[R] > w-1:\n return True\n if r[U] > r[D] or r[U] < 0 or r[D] > h-1:\n return True\n return False\n \n for s, t in zip(ls, lt):\n g(t)\n f(s)\n if check():\n print('NO')\n return\n if r[L] <= sc <= r[R] and r[U] <= sr <= r[D]:\n print('YES')\n else:\n print('NO')\n \nif __name__=='__main__':\n main()\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585538084", "date2": "1585542022", "bleu_score": "0.6355239432331855", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1], "code1_test_score": 26, "total_score": 103, "input": "2 3 3\n3 1\nRQL\nDUL\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["\n\n\ndef main(): # (0): main=\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n def f(d, x):\n if d=='L':\n r[L] = (min(max(0, r[L]-x), w-1) )\n if d=='R':\n r[R] = (min(max(0, r[R]+x), w-1) )\n if d=='U':\n r[U] = (min(max(0, r[U]-x), h-1) )\n if d=='D':\n r[D] = (min(max(0, r[D]+x), h-1) )\n \n def check():\n if r[L] >= r[R]:\n return False\n if r[U] >= r[D]:\n return False\n return True\n \n f(ls[0], 1)\n for s, t in zip(ls[1:], lt[1:]):\n f(s, 1)\n f(t, -1)\n if check():\n print('NO')\n return\n print('YES')\n \n \n \n\nif __name__=='__main__':\n main()\n\n"], "anno_status": [true], "diff_content": " \n \n \n def main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n+ sr, sc = sr-1, sc-1\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n- def f(d, x):\n+ def f(d):\n if d=='L':\n- r[L] = (min(max(0, r[L]-x), w-1) )\n+ r[L] = (min(max(-1, r[L]+1), w))\n if d=='R':\n- r[R] = (min(max(0, r[R]+x), w-1) )\n+ r[R] = (min(max(-1, r[R]-1), w))\n if d=='U':\n- r[U] = (min(max(0, r[U]-x), h-1) )\n+ r[U] = (min(max(-1, r[U]+1), h))\n if d=='D':\n- r[D] = (min(max(0, r[D]+x), h-1) )\n+ r[D] = (min(max(-1, r[D]-1), h))\n+ \n+ def g(d):\n+ if d=='L':\n+ r[R] = (min(max(0, r[R]+1), w-1))\n+ if d=='R':\n+ r[L] = (min(max(0, r[L]-1), w-1))\n+ if d=='U':\n+ r[D] = (min(max(0, r[D]+1), h-1))\n+ if d=='D':\n+ r[U] = (min(max(0, r[U]-1), h-1))\n \n def check():\n- if r[L] >= r[R]:\n- return False\n- if r[U] >= r[D]:\n- return False\n- return True\n+ if r[L] > r[R] or r[L] < 0 or r[R] > w-1:\n+ return True\n+ if r[U] > r[D] or r[U] < 0 or r[D] > h-1:\n+ return True\n+ return False\n \n- f(ls[0], 1)\n- for s, t in zip(ls[1:], lt[1:]):\n- f(s, 1)\n- f(t, -1)\n+ for s, t in zip(ls, lt):\n+ g(t)\n+ f(s)\n if check():\n print('NO')\n return\n- print('YES')\n- \n+ if r[L] <= sc <= r[R] and r[U] <= sr <= r[D]:\n+ print('YES')\n+ else:\n+ print('NO')\n \n- \n-\n if __name__=='__main__':\n main()\n \n \n", "FL_content": " \n \n \n def main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n- def f(d, x):\n if d=='L':\n- r[L] = (min(max(0, r[L]-x), w-1) )\n if d=='R':\n- r[R] = (min(max(0, r[R]+x), w-1) )\n if d=='U':\n- r[U] = (min(max(0, r[U]-x), h-1) )\n if d=='D':\n- r[D] = (min(max(0, r[D]+x), h-1) )\n \n def check():\n- if r[L] >= r[R]:\n- return False\n- if r[U] >= r[D]:\n- return False\n- return True\n \n- f(ls[0], 1)\n- for s, t in zip(ls[1:], lt[1:]):\n- f(s, 1)\n- f(t, -1)\n if check():\n print('NO')\n return\n- print('YES')\n- \n \n- \n-\n if __name__=='__main__':\n main()\n \n \n", "added_lines": 28, "removed_lines": 18, "code1_lines": 44 }, { "user_id": "u467736898", "problem_id": "p03054", "submission1_id": "s241880704", "submission2_id": "s170289921", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, N = map(int, input().split())\nSr, Sc = map(int, input().split())\nS = input()\nT = input()\n\n\nl = 1\nr = W\nu = 1\nd = H\nfor s, t in zip(S[::-1], T[::-1]):\n\n if t==\"L\":\n r = min(r+1, W)\n elif t==\"R\":\n l = max(l-1, 1)\n elif t==\"U\":\n d = min(d+1, W)\n else:\n u = max(u-1, 1)\n\n if s==\"L\":\n l+=1\n elif s==\"R\":\n r-=1\n elif s==\"U\":\n u+=1\n else:\n d-=1\n\n if l > r or u > d:\n print(\"NO\")\n exit()\n \nif d<=Sr<=u and l<=Sc<=r:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "code2": "H, W, N = map(int, input().split())\nSr, Sc = map(int, input().split())\nS = input()\nT = input()\n\n\nl = 1\nr = W\nu = 1\nd = H\n\nfor s, t in zip(S[::-1], T[::-1]):\n\n if t==\"L\":\n r = min(r+1, W)\n elif t==\"R\":\n l = max(l-1, 1)\n elif t==\"U\":\n d = min(d+1, H)\n else:\n u = max(u-1, 1)\n\n \n if s==\"L\":\n l+=1\n elif s==\"R\":\n r-=1\n elif s==\"U\":\n u+=1\n else:\n d-=1\n\n if l > r or u > d:\n print(\"NO\")\n exit()\n \nif u<=Sr<=d and l<=Sc<=r:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1557020797", "date2": "1557021352", "bleu_score": "0.9752802855439813", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 96, "total_score": 103, "input": "2 3 3\n2 2\nRRL\nLUD\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["H, W, N = map(int, input().split()) # (0): H=2, W=3, N=3\nSr, Sc = map(int, input().split()) # (1): Sr=2, Sc=2\nS = input() # (2): S=RRL\nT = input() # (3): T=LUD\n\n\nl = 1 # (4): l=1\nr = W # (5): r=3\nu = 1 # (6): u=1\nd = H # (7): d=2\nfor s, t in zip(S[::-1], T[::-1]): # (8): s=L, t=D (16): s=R, t=U ... (32): NO CHANGE\n\n if t==\"L\": # (9): NO CHANGE (17): NO CHANGE (26): NO CHANGE\n r = min(r+1, W) # (27): r=3\n elif t==\"R\": # (10): NO CHANGE (18): NO CHANGE\n l = max(l-1, 1)\n elif t==\"U\": # (11): NO CHANGE (19): NO CHANGE\n d = min(d+1, W) # (20): d=3\n else:\n u = max(u-1, 1) # (12): NO CHANGE\n\n if s==\"L\": # (13): NO CHANGE (21): NO CHANGE (28): NO CHANGE\n l+=1 # (14): l=2\n elif s==\"R\": # (22): NO CHANGE (29): NO CHANGE\n r-=1 # (23): r=2 (30): r=2\n elif s==\"U\":\n u+=1\n else:\n d-=1\n\n if l > r or u > d: # (15): NO CHANGE (24): NO CHANGE (31): NO CHANGE\n print(\"NO\")\n exit()\n \nif d<=Sr<=u and l<=Sc<=r: # (33): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n"], "anno_status": [true], "diff_content": " H, W, N = map(int, input().split())\n Sr, Sc = map(int, input().split())\n S = input()\n T = input()\n \n \n l = 1\n r = W\n u = 1\n d = H\n+\n for s, t in zip(S[::-1], T[::-1]):\n \n if t==\"L\":\n r = min(r+1, W)\n elif t==\"R\":\n l = max(l-1, 1)\n elif t==\"U\":\n- d = min(d+1, W)\n+ d = min(d+1, H)\n else:\n u = max(u-1, 1)\n \n+ \n if s==\"L\":\n l+=1\n elif s==\"R\":\n r-=1\n elif s==\"U\":\n u+=1\n else:\n d-=1\n \n if l > r or u > d:\n print(\"NO\")\n exit()\n \n-if d<=Sr<=u and l<=Sc<=r:\n+if u<=Sr<=d and l<=Sc<=r:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "FL_content": " H, W, N = map(int, input().split())\n Sr, Sc = map(int, input().split())\n S = input()\n T = input()\n \n \n l = 1\n r = W\n u = 1\n d = H\n for s, t in zip(S[::-1], T[::-1]):\n \n if t==\"L\":\n r = min(r+1, W)\n elif t==\"R\":\n l = max(l-1, 1)\n elif t==\"U\":\n- d = min(d+1, W)\n else:\n u = max(u-1, 1)\n \n if s==\"L\":\n l+=1\n elif s==\"R\":\n r-=1\n elif s==\"U\":\n u+=1\n else:\n d-=1\n \n if l > r or u > d:\n print(\"NO\")\n exit()\n \n-if d<=Sr<=u and l<=Sc<=r:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 39 }, { "user_id": "u227476288", "problem_id": "p03054", "submission1_id": "s137459396", "submission2_id": "s141858149", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W,N = map(int, input().split())\nst = [int(i) for i in input().split()]\nS = input()\nT = input()\n\n\ndef simu(dim1):\n now = [st[0],st[1]]\n\n if dim1 == 'U':\n dim2,L,step,dim = 'D',H,-1,0\n if dim1 == 'D':\n dim2,L,step,dim = 'U',H,1,0\n if dim1 == 'R':\n dim2,L,step,dim = 'L',W,1,1\n if dim1 == 'L':\n dim2,L,step,dim = 'R',W,-1,1\n\n for i in range(N):\n if S[i] == dim1:\n now[dim] -= step\n if now[dim] < 1 or now[dim] >= L+1:\n return True\n if T[i] == dim2:\n if step == -1:\n if now[dim] < L:\n now[dim] += step\n else:\n if now[dim] > 0:\n now[dim] += step\n \nD = ['U','D','R','L']\nfor d in D:\n if simu(d):\n print('YES')\n exit()\nprint('NO')", "code2": "H,W,N = map(int, input().split())\nst = [int(i) for i in input().split()]\nS = input()\nT = input()\n\n\ndef simu(dim1):\n now = [st[0],st[1]]\n\n if dim1 == 'U':\n dim2,L,step,dim = 'D',H,1,0\n if dim1 == 'D':\n dim2,L,step,dim = 'U',H,-1,0\n if dim1 == 'L':\n dim2,L,step,dim = 'R',W,1,1\n if dim1 == 'R':\n dim2,L,step,dim = 'L',W,-1,1\n\n for i in range(N):\n if S[i] == dim1:\n now[dim] -= step\n if now[dim] < 1 or now[dim] >= L+1:\n return True\n if T[i] == dim2:\n if step == 1:\n if now[dim] < L:\n now[dim] += step\n else:\n if now[dim] > 1:\n now[dim] += step\n return False\n \nDim = ['U','D','R','L']\nfor d in Dim:\n if simu(d):\n print('NO')\n exit()\nprint('YES')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1557109999", "date2": "1557111123", "bleu_score": "0.9666027177160162", "code1_test_status": [1, 1, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], "code1_test_score": 7, "total_score": 103, "input": "1 1 4\n0 1\nUDRRR\nLLDTC\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " H,W,N = map(int, input().split())\n st = [int(i) for i in input().split()]\n S = input()\n T = input()\n \n \n def simu(dim1):\n now = [st[0],st[1]]\n \n if dim1 == 'U':\n- dim2,L,step,dim = 'D',H,-1,0\n+ dim2,L,step,dim = 'D',H,1,0\n if dim1 == 'D':\n- dim2,L,step,dim = 'U',H,1,0\n- if dim1 == 'R':\n- dim2,L,step,dim = 'L',W,1,1\n+ dim2,L,step,dim = 'U',H,-1,0\n if dim1 == 'L':\n- dim2,L,step,dim = 'R',W,-1,1\n+ dim2,L,step,dim = 'R',W,1,1\n+ if dim1 == 'R':\n+ dim2,L,step,dim = 'L',W,-1,1\n \n for i in range(N):\n if S[i] == dim1:\n now[dim] -= step\n if now[dim] < 1 or now[dim] >= L+1:\n return True\n if T[i] == dim2:\n- if step == -1:\n+ if step == 1:\n if now[dim] < L:\n now[dim] += step\n else:\n- if now[dim] > 0:\n+ if now[dim] > 1:\n now[dim] += step\n+ return False\n \n-D = ['U','D','R','L']\n-for d in D:\n+Dim = ['U','D','R','L']\n+for d in Dim:\n if simu(d):\n- print('YES')\n+ print('NO')\n exit()\n-print('NO')\n+print('YES')\n", "FL_content": " H,W,N = map(int, input().split())\n st = [int(i) for i in input().split()]\n S = input()\n T = input()\n \n \n def simu(dim1):\n now = [st[0],st[1]]\n \n if dim1 == 'U':\n- dim2,L,step,dim = 'D',H,-1,0\n if dim1 == 'D':\n- dim2,L,step,dim = 'U',H,1,0\n- if dim1 == 'R':\n- dim2,L,step,dim = 'L',W,1,1\n if dim1 == 'L':\n- dim2,L,step,dim = 'R',W,-1,1\n \n for i in range(N):\n if S[i] == dim1:\n now[dim] -= step\n if now[dim] < 1 or now[dim] >= L+1:\n return True\n if T[i] == dim2:\n- if step == -1:\n if now[dim] < L:\n now[dim] += step\n else:\n- if now[dim] > 0:\n now[dim] += step\n \n-D = ['U','D','R','L']\n-for d in D:\n if simu(d):\n- print('YES')\n exit()\n-print('NO')\n", "added_lines": 12, "removed_lines": 11, "code1_lines": 37 }, { "user_id": "u788137651", "problem_id": "p03054", "submission1_id": "s486773128", "submission2_id": "s187430729", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\n\nleft = 1\nright = W\nup = 1\ndown = H\n\nfor i in reversed(range(N)):\n if i != N - 1:\n if T[i] == \"U\":\n if down != H:\n down -= 1\n elif T[i] == \"D\":\n if up != 1:\n up += 1\n elif T[i] == \"L\":\n if right != W:\n right += 1\n else:\n if left != 1:\n left -= 1\n if S[i] == \"U\":\n up -= 1\n elif S[i] == \"D\":\n down += 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n if left == right or up == down:\n print(\"NO\")\n exit()\n\nif left <= sr <= right and down <= sc <= up:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "code2": "H, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\n\nleft = 1\nright = W\nup = 1\ndown = H\n\nfor i in reversed(range(N)):\n if T[i] == \"U\":\n down = min(H, down+1)\n elif T[i] == \"D\":\n up = max(1, up-1)\n elif T[i] == \"L\":\n right = min(W, right+1)\n else:\n left = max(1, left-1)\n\n if S[i] == \"U\":\n up += 1\n elif S[i] == \"D\":\n down -= 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n\n \n\n if left > right or up > down:\n print(\"NO\")\n exit()\n\n\n\nif left <= sc <= right and up <= sr <= down:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557175724", "date2": "1557182082", "bleu_score": "0.7599505035139713", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": 96, "total_score": 103, "input": "2 5 3\n2 4\nRLR\nLUD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["H, W, N = map(int, input().split()) # (0): H=2, W=5, N=3\nsr, sc = map(int, input().split()) # (1): sr=2, sc=4\nS = input() # (2): S=RLR\nT = input() # (3): T=LUD\n\nleft = 1 # (4): left=1\nright = W # (5): right=5\nup = 1 # (6): up=1\ndown = H # (7): down=2\n\nfor i in reversed(range(N)): # (8): i=2 (15): i=1 ... (36): NO CHANGE\n if i != N - 1: # (9): NO CHANGE (16): NO CHANGE (25): NO CHANGE\n if T[i] == \"U\": # (17): NO CHANGE (26): NO CHANGE\n if down != H: # (18): NO CHANGE\n down -= 1\n elif T[i] == \"D\": # (27): NO CHANGE\n if up != 1:\n up += 1\n elif T[i] == \"L\": # (28): NO CHANGE\n if right != W: # (29): NO CHANGE\n right += 1 # (30): right=5\n else:\n if left != 1:\n left -= 1\n if S[i] == \"U\": # (10): NO CHANGE (19): NO CHANGE (31): NO CHANGE\n up -= 1\n elif S[i] == \"D\": # (11): NO CHANGE (20): NO CHANGE (32): NO CHANGE\n down += 1\n elif S[i] == \"L\": # (12): NO CHANGE (21): NO CHANGE (33): NO CHANGE\n left += 1 # (22): left=2\n else:\n right -= 1 # (13): right=4 (34): right=4\n if left == right or up == down: # (14): NO CHANGE (23): NO CHANGE (35): NO CHANGE\n print(\"NO\")\n exit()\n\nif left <= sr <= right and down <= sc <= up: # (37): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n"], "anno_status": [true], "diff_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n \n left = 1\n right = W\n up = 1\n down = H\n \n for i in reversed(range(N)):\n- if i != N - 1:\n- if T[i] == \"U\":\n- if down != H:\n- down -= 1\n- elif T[i] == \"D\":\n- if up != 1:\n- up += 1\n- elif T[i] == \"L\":\n- if right != W:\n- right += 1\n- else:\n- if left != 1:\n- left -= 1\n+ if T[i] == \"U\":\n+ down = min(H, down+1)\n+ elif T[i] == \"D\":\n+ up = max(1, up-1)\n+ elif T[i] == \"L\":\n+ right = min(W, right+1)\n+ else:\n+ left = max(1, left-1)\n+\n if S[i] == \"U\":\n- up -= 1\n+ up += 1\n elif S[i] == \"D\":\n- down += 1\n+ down -= 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n- if left == right or up == down:\n+\n+ \n+\n+ if left > right or up > down:\n print(\"NO\")\n exit()\n \n-if left <= sr <= right and down <= sc <= up:\n+\n+\n+if left <= sc <= right and up <= sr <= down:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "FL_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n \n left = 1\n right = W\n up = 1\n down = H\n \n for i in reversed(range(N)):\n- if i != N - 1:\n- if T[i] == \"U\":\n- if down != H:\n- down -= 1\n- elif T[i] == \"D\":\n- if up != 1:\n- up += 1\n- elif T[i] == \"L\":\n- if right != W:\n- right += 1\n- else:\n- if left != 1:\n- left -= 1\n if S[i] == \"U\":\n- up -= 1\n elif S[i] == \"D\":\n- down += 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n- if left == right or up == down:\n print(\"NO\")\n exit()\n \n-if left <= sr <= right and down <= sc <= up:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "added_lines": 18, "removed_lines": 17, "code1_lines": 41 }, { "user_id": "u941753895", "problem_id": "p03054", "submission1_id": "s810606253", "submission2_id": "s407484692", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W,N=map(int,input().split())\nsr,sc=map(int,input().split())\nS=input()\nT=input()\n\nlu=H-sr\nld=sr-1\nll=W-sc\nlr=sc-1\n\nfor i in range(N):\n x=S[i]\n y=T[i]\n\n if x=='U':\n lu-=1\n elif x=='D':\n ld-=1\n elif x=='L':\n ll-=1\n elif x=='R':\n lr-=1\n\n \n\n if lu<0 or ld<0 or ll<0 or lr<0:\n print('NO')\n exit()\n\n if y=='U':\n ld+=1\n elif y=='D':\n lu+=1\n elif y=='L':\n lr+=1\n elif y=='R':\n ll+=1\n\n \n\nprint('YES')", "code2": "H,W,N=map(int,input().split())\nsr,sc=map(int,input().split())\nS=input()\nT=input()\n\nld=H-sr\nlu=sr-1\nlr=W-sc\nll=sc-1\n\nfor i in range(N):\n x=S[i]\n y=T[i]\n\n if x=='U':\n lu-=1\n elif x=='D':\n ld-=1\n elif x=='L':\n ll-=1\n elif x=='R':\n lr-=1\n\n \n\n if lu<0 or ld<0 or ll<0 or lr<0:\n print('NO')\n exit()\n\n if y=='U' and ld right or up > down:\n print(\"NO\")\n exit()\n\n\n\nif left <= sc <= right and up <= sr <= down:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557178668", "date2": "1557182082", "bleu_score": "0.9051050579330754", "code1_test_status": [1, 1, 1, 1, 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, 1, 1, 0, 1, 1, 0, 0, 0, 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, 0, 0, 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, 0, 1, 1, 1, 1, 0, 1], "code1_test_score": 86, "total_score": 103, "input": "2 6 3\n4 0\nRLR\nLUD\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["H, W, N = map(int, input().split()) # (0): H=2, W=6, N=3\nsr, sc = map(int, input().split()) # (1): sr=4, sc=0\nS = input() # (2): S=RLR\nT = input() # (3): T=LUD\n\nleft = 0 # (4): left=0\nright = W # (5): right=6\nup = 0 # (6): up=0\ndown = H # (7): down=2\n\nfor i in reversed(range(N)): # (8): i=2 (15): i=1 ... (35): NO CHANGE\n if i != N - 1: # (9): NO CHANGE (16): NO CHANGE (25): NO CHANGE\n if T[i] == \"U\": # (17): NO CHANGE (26): NO CHANGE\n down = min(H, down+1) # (18): NO CHANGE\n elif T[i] == \"D\": # (27): NO CHANGE\n up = max(0, up-1)\n elif T[i] == \"L\": # (28): NO CHANGE\n right = min(W, right+1) # (29): right=6\n else:\n left = max(0, left-1)\n if S[i] == \"U\": # (10): NO CHANGE (19): NO CHANGE (30): NO CHANGE\n up += 1\n elif S[i] == \"D\": # (11): NO CHANGE (20): NO CHANGE (31): NO CHANGE\n down -= 1\n elif S[i] == \"L\": # (12): NO CHANGE (21): NO CHANGE (32): NO CHANGE\n left += 1 # (22): left=1\n else:\n right -= 1 # (13): right=5 (33): right=5\n if left == right or up == down: # (14): NO CHANGE (23): NO CHANGE (34): NO CHANGE\n print(\"NO\")\n exit()\n\n\nif left <= sr <= right and up <= sc <= down: # (36): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n"], "anno_status": [true], "diff_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n \n-left = 0\n+left = 1\n right = W\n-up = 0\n+up = 1\n down = H\n \n for i in reversed(range(N)):\n- if i != N - 1:\n- if T[i] == \"U\":\n- down = min(H, down+1)\n- elif T[i] == \"D\":\n- up = max(0, up-1)\n- elif T[i] == \"L\":\n- right = min(W, right+1)\n- else:\n- left = max(0, left-1)\n+ if T[i] == \"U\":\n+ down = min(H, down+1)\n+ elif T[i] == \"D\":\n+ up = max(1, up-1)\n+ elif T[i] == \"L\":\n+ right = min(W, right+1)\n+ else:\n+ left = max(1, left-1)\n+\n if S[i] == \"U\":\n up += 1\n elif S[i] == \"D\":\n down -= 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n- if left == right or up == down:\n+\n+ \n+\n+ if left > right or up > down:\n print(\"NO\")\n exit()\n \n \n-if left <= sr <= right and up <= sc <= down:\n+\n+if left <= sc <= right and up <= sr <= down:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "FL_content": " H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n \n-left = 0\n right = W\n-up = 0\n down = H\n \n for i in reversed(range(N)):\n- if i != N - 1:\n- if T[i] == \"U\":\n- down = min(H, down+1)\n- elif T[i] == \"D\":\n- up = max(0, up-1)\n- elif T[i] == \"L\":\n- right = min(W, right+1)\n- else:\n- left = max(0, left-1)\n if S[i] == \"U\":\n up += 1\n elif S[i] == \"D\":\n down -= 1\n elif S[i] == \"L\":\n left += 1\n else:\n right -= 1\n- if left == right or up == down:\n print(\"NO\")\n exit()\n \n \n-if left <= sr <= right and up <= sc <= down:\n print(\"YES\")\n else:\n print(\"NO\")\n \n", "added_lines": 17, "removed_lines": 13, "code1_lines": 38 }, { "user_id": "u926393759", "problem_id": "p03054", "submission1_id": "s192399667", "submission2_id": "s600066974", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, w, n = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()[::-1]\nT = input()[::-1]\n\nr_bound = w\nl_bound = 1\nd_bound = h\nu_bound = 1\n\nremain = True\n\nif S[0] =='R':\n r_bound -= 1\nif S[0] =='L':\n l_bound += 1\nif S[0] =='D':\n d_bound -= 1\nif S[0] =='U':\n u_bound += 1\n\nfor s, t in zip(S[1:], T[1:]):\n if s =='R' and t !='L':\n r_bound -= 1\n if s =='L' and t !='R':\n l_bound += 1\n if s =='D' and t !='U':\n d_bound -= 1\n if s =='U' and t !='D':\n u_bound += 1\n if (r_bound < l_bound) or (d_bound < u_bound):\n remain = False\n break\nif (sc < l_bound or sc > r_bound) or (sr < u_bound or sr > d_bound):\n remain = False\n\nif remain:\n print('YES')\nelse:\n print('NO')\n", "code2": "h, w, n = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()[::-1]\nT = input()[::-1]\n\nr_bound = w\nl_bound = 1\nd_bound = h\nu_bound = 1\n\nremain = True\n\nfor s, t in zip(S, T):\n if t =='R' and l_bound > 1:\n l_bound -= 1\n elif t =='L' and r_bound < w:\n r_bound += 1\n elif t =='D' and u_bound > 1:\n u_bound -= 1\n elif t =='U' and d_bound < h:\n d_bound += 1\n if s =='R':\n r_bound -= 1\n elif s =='L':\n l_bound += 1\n elif s =='D':\n d_bound -= 1\n elif s =='U':\n u_bound += 1\n if (r_bound < l_bound) or (d_bound < u_bound):\n remain = False\n break\nif (sc < l_bound or sc > r_bound) or (sr < u_bound or sr > d_bound):\n remain = False\n\nif remain:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559320226", "date2": "1559326868", "bleu_score": "0.8601983122543804", "code1_test_status": [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, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4 4 5\n2 2\nUDRRR\nLLDTD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["h, w, n = map(int, input().split()) # (0): h=4, w=4, n=5\nsr, sc = map(int, input().split()) # (1): sr=2, sc=2\nS = input()[::-1] # (2): S=RRRDU\nT = input()[::-1] # (3): T=DTDLL\n\nr_bound = w # (4): r_bound=4\nl_bound = 1 # (5): l_bound=1\nd_bound = h # (6): d_bound=4\nu_bound = 1 # (7): u_bound=1\n\nremain = True # (8): remain=True\n\nif S[0] =='R': # (9): NO CHANGE\n r_bound -= 1 # (10): r_bound=3\nif S[0] =='L': # (11): NO CHANGE\n l_bound += 1\nif S[0] =='D': # (12): NO CHANGE\n d_bound -= 1\nif S[0] =='U': # (13): NO CHANGE\n u_bound += 1\n\nfor s, t in zip(S[1:], T[1:]): # (14): s=R, t=T (21): t=D ... (42): NO CHANGE\n if s =='R' and t !='L': # (15): NO CHANGE (22): NO CHANGE ... (36): NO CHANGE\n r_bound -= 1 # (16): r_bound=2 (23): r_bound=1\n if s =='L' and t !='R': # (17): NO CHANGE (24): NO CHANGE ... (37): NO CHANGE\n l_bound += 1\n if s =='D' and t !='U': # (18): NO CHANGE (25): NO CHANGE ... (38): NO CHANGE\n d_bound -= 1 # (32): d_bound=3\n if s =='U' and t !='D': # (19): NO CHANGE (26): NO CHANGE ... (39): NO CHANGE\n u_bound += 1 # (40): u_bound=2\n if (r_bound < l_bound) or (d_bound < u_bound): # (20): NO CHANGE (27): NO CHANGE ... (41): NO CHANGE\n remain = False\n break\nif (sc < l_bound or sc > r_bound) or (sr < u_bound or sr > d_bound): # (43): NO CHANGE\n remain = False # (44): remain=False\n\nif remain: # (45): NO CHANGE\n print('YES')\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()[::-1]\n T = input()[::-1]\n \n r_bound = w\n l_bound = 1\n d_bound = h\n u_bound = 1\n \n remain = True\n \n-if S[0] =='R':\n- r_bound -= 1\n-if S[0] =='L':\n- l_bound += 1\n-if S[0] =='D':\n- d_bound -= 1\n-if S[0] =='U':\n- u_bound += 1\n-\n-for s, t in zip(S[1:], T[1:]):\n- if s =='R' and t !='L':\n+for s, t in zip(S, T):\n+ if t =='R' and l_bound > 1:\n+ l_bound -= 1\n+ elif t =='L' and r_bound < w:\n+ r_bound += 1\n+ elif t =='D' and u_bound > 1:\n+ u_bound -= 1\n+ elif t =='U' and d_bound < h:\n+ d_bound += 1\n+ if s =='R':\n r_bound -= 1\n- if s =='L' and t !='R':\n+ elif s =='L':\n l_bound += 1\n- if s =='D' and t !='U':\n+ elif s =='D':\n d_bound -= 1\n- if s =='U' and t !='D':\n+ elif s =='U':\n u_bound += 1\n if (r_bound < l_bound) or (d_bound < u_bound):\n remain = False\n break\n if (sc < l_bound or sc > r_bound) or (sr < u_bound or sr > d_bound):\n remain = False\n \n if remain:\n print('YES')\n else:\n print('NO')\n-\n", "FL_content": " h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()[::-1]\n T = input()[::-1]\n \n r_bound = w\n l_bound = 1\n d_bound = h\n u_bound = 1\n \n remain = True\n \n-if S[0] =='R':\n- r_bound -= 1\n-if S[0] =='L':\n- l_bound += 1\n-if S[0] =='D':\n- d_bound -= 1\n-if S[0] =='U':\n- u_bound += 1\n-\n-for s, t in zip(S[1:], T[1:]):\n- if s =='R' and t !='L':\n r_bound -= 1\n- if s =='L' and t !='R':\n l_bound += 1\n- if s =='D' and t !='U':\n d_bound -= 1\n- if s =='U' and t !='D':\n u_bound += 1\n if (r_bound < l_bound) or (d_bound < u_bound):\n remain = False\n break\n if (sc < l_bound or sc > r_bound) or (sr < u_bound or sr > d_bound):\n remain = False\n \n if remain:\n print('YES')\n else:\n print('NO')\n-\n", "added_lines": 13, "removed_lines": 15, "code1_lines": 41 }, { "user_id": "u210440747", "problem_id": "p03054", "submission1_id": "s101002671", "submission2_id": "s733582086", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n def f(d, x):\n if d=='L':\n r[L] = (min(max(0, r[L]-x), w-1) )\n if d=='R':\n r[R] = (min(max(0, r[R]+x), w-1) )\n if d=='U':\n r[U] = (min(max(0, r[U]-x), h-1) )\n if d=='D':\n r[D] = (min(max(0, r[D]+x), h-1) )\n \n def check():\n if r[L] >= r[R]:\n return False\n if r[U] >= r[D]:\n return False\n return True\n \n f(ls[0], 1)\n for s, t in zip(ls[1:], lt[1:]):\n f(t, -1)\n f(s, 1)\n if check():\n print('NO')\n return\n print('YES')\n\nif __name__=='__main__':\n main()\n\n", "code2": "\n\n\ndef main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n sr, sc = sr-1, sc-1\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n def f(d):\n if d=='L':\n r[L] = (min(max(-1, r[L]+1), w))\n if d=='R':\n r[R] = (min(max(-1, r[R]-1), w))\n if d=='U':\n r[U] = (min(max(-1, r[U]+1), h))\n if d=='D':\n r[D] = (min(max(-1, r[D]-1), h))\n \n def g(d):\n if d=='L':\n r[R] = (min(max(0, r[R]+1), w-1))\n if d=='R':\n r[L] = (min(max(0, r[L]-1), w-1))\n if d=='U':\n r[D] = (min(max(0, r[D]+1), h-1))\n if d=='D':\n r[U] = (min(max(0, r[U]-1), h-1))\n \n def check():\n if r[L] > r[R] or r[L] < 0 or r[R] > w-1:\n return True\n if r[U] > r[D] or r[U] < 0 or r[D] > h-1:\n return True\n return False\n \n for s, t in zip(ls, lt):\n g(t)\n f(s)\n if check():\n print('NO')\n return\n if r[L] <= sc <= r[R] and r[U] <= sr <= r[D]:\n print('YES')\n else:\n print('NO')\n \nif __name__=='__main__':\n main()\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585538243", "date2": "1585542022", "bleu_score": "0.6230443353089846", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1], "code1_test_score": 26, "total_score": 103, "input": "1 1 4\n-1 4\nUDRRR\nDTDLL\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["\n\n\ndef main(): # (0): main=\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n def f(d, x):\n if d=='L':\n r[L] = (min(max(0, r[L]-x), w-1) )\n if d=='R':\n r[R] = (min(max(0, r[R]+x), w-1) )\n if d=='U':\n r[U] = (min(max(0, r[U]-x), h-1) )\n if d=='D':\n r[D] = (min(max(0, r[D]+x), h-1) )\n \n def check():\n if r[L] >= r[R]:\n return False\n if r[U] >= r[D]:\n return False\n return True\n \n f(ls[0], 1)\n for s, t in zip(ls[1:], lt[1:]):\n f(t, -1)\n f(s, 1)\n if check():\n print('NO')\n return\n print('YES')\n\nif __name__=='__main__':\n main()\n\n"], "anno_status": [true], "diff_content": " \n \n \n def main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n+ sr, sc = sr-1, sc-1\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n- def f(d, x):\n+ def f(d):\n if d=='L':\n- r[L] = (min(max(0, r[L]-x), w-1) )\n+ r[L] = (min(max(-1, r[L]+1), w))\n if d=='R':\n- r[R] = (min(max(0, r[R]+x), w-1) )\n+ r[R] = (min(max(-1, r[R]-1), w))\n if d=='U':\n- r[U] = (min(max(0, r[U]-x), h-1) )\n+ r[U] = (min(max(-1, r[U]+1), h))\n if d=='D':\n- r[D] = (min(max(0, r[D]+x), h-1) )\n+ r[D] = (min(max(-1, r[D]-1), h))\n+ \n+ def g(d):\n+ if d=='L':\n+ r[R] = (min(max(0, r[R]+1), w-1))\n+ if d=='R':\n+ r[L] = (min(max(0, r[L]-1), w-1))\n+ if d=='U':\n+ r[D] = (min(max(0, r[D]+1), h-1))\n+ if d=='D':\n+ r[U] = (min(max(0, r[U]-1), h-1))\n \n def check():\n- if r[L] >= r[R]:\n- return False\n- if r[U] >= r[D]:\n- return False\n- return True\n+ if r[L] > r[R] or r[L] < 0 or r[R] > w-1:\n+ return True\n+ if r[U] > r[D] or r[U] < 0 or r[D] > h-1:\n+ return True\n+ return False\n \n- f(ls[0], 1)\n- for s, t in zip(ls[1:], lt[1:]):\n- f(t, -1)\n- f(s, 1)\n+ for s, t in zip(ls, lt):\n+ g(t)\n+ f(s)\n if check():\n print('NO')\n return\n- print('YES')\n-\n+ if r[L] <= sc <= r[R] and r[U] <= sr <= r[D]:\n+ print('YES')\n+ else:\n+ print('NO')\n+ \n if __name__=='__main__':\n main()\n \n \n", "FL_content": " \n \n \n def main():\n L, R, U, D = 0, 1, 2, 3\n h, w, n = map(int, input().split())\n sr, sc = map(int, input().split())\n ls = input().strip()[::-1]\n lt = input().strip()[::-1]\n r = [0, w-1, 0, h-1]\n \n- def f(d, x):\n if d=='L':\n- r[L] = (min(max(0, r[L]-x), w-1) )\n if d=='R':\n- r[R] = (min(max(0, r[R]+x), w-1) )\n if d=='U':\n- r[U] = (min(max(0, r[U]-x), h-1) )\n if d=='D':\n- r[D] = (min(max(0, r[D]+x), h-1) )\n \n def check():\n- if r[L] >= r[R]:\n- return False\n- if r[U] >= r[D]:\n- return False\n- return True\n \n- f(ls[0], 1)\n- for s, t in zip(ls[1:], lt[1:]):\n- f(t, -1)\n- f(s, 1)\n if check():\n print('NO')\n return\n- print('YES')\n-\n if __name__=='__main__':\n main()\n \n \n", "added_lines": 29, "removed_lines": 16, "code1_lines": 41 }, { "user_id": "u368780724", "problem_id": "p03054", "submission1_id": "s406345178", "submission2_id": "s142507120", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import exit\nH, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\nul = 1\ndl = H\nrl = W\nll = 1\nfor s, t in zip(S[1::][::-1], T[::-1]):\n if t == 'U':\n dl = min(H, dl+1)\n elif t == 'D':\n ul = max(1, ul-1)\n elif t == 'L':\n rl = min(W, rl+1)\n else:\n ll = max(1, ll-1)\n if s == 'U':\n ul += 1\n elif s == 'D':\n dl -= 1\n elif s == 'L':\n ll += 1\n else:\n rl -= 1\n if ul > dl or ll > rl or ul == H + 1 or dl == 0 or ll == W + 1 or rl == 0:\n print('NO')\n exit()\ns = S[0]\nif s == 'U':\n ul += 1\nelif s == 'D':\n dl -= 1\nelif s == 'L':\n ll += 1\nelse:\n rl -= 1\n\nif ul <= sr <= dl and ll <= sc <= rl:\n print('YES')\nelse:\n print('NO')", "code2": "from sys import exit\nH, W, N = map(int, input().split())\nsr, sc = map(int, input().split())\nS = input()\nT = input()\nul = 1\ndl = H\nrl = W\nll = 1\nfor s, t in zip(S[1::][::-1], T[:-1:][::-1]):\n if s == 'U':\n ul += 1\n elif s == 'D':\n dl -= 1\n elif s == 'L':\n ll += 1\n else:\n rl -= 1\n if ul > dl or ll > rl or ul == H + 1 or dl == 0 or ll == W + 1 or rl == 0:\n print('NO')\n exit()\n if t == 'U':\n dl = min(H, dl+1)\n elif t == 'D':\n ul = max(1, ul-1)\n elif t == 'L':\n rl = min(W, rl+1)\n else:\n ll = max(1, ll-1)\ns = S[0]\nif s == 'U':\n ul += 1\nelif s == 'D':\n dl -= 1\nelif s == 'L':\n ll += 1\nelse:\n rl -= 1\n\nif ul <= sr <= dl and ll <= sc <= rl:\n print('YES')\nelse:\n print('NO')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1557023024", "date2": "1557023830", "bleu_score": "0.9913815521800989", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "2 3 3\n2 2\nRLR\nLUD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["from sys import exit\nH, W, N = map(int, input().split()) # (0): H=2, W=3, N=3\nsr, sc = map(int, input().split()) # (1): sr=2, sc=2\nS = input() # (2): S=RLR\nT = input() # (3): T=LUD\nul = 1 # (4): ul=1\ndl = H # (5): dl=2\nrl = W # (6): rl=3\nll = 1 # (7): ll=1\nfor s, t in zip(S[1::][::-1], T[::-1]): # (8): s=R, t=D (17): s=L, t=U (25): NO CHANGE\n if t == 'U': # (9): NO CHANGE (18): NO CHANGE\n dl = min(H, dl+1) # (19): NO CHANGE\n elif t == 'D': # (10): NO CHANGE\n ul = max(1, ul-1) # (11): NO CHANGE\n elif t == 'L':\n rl = min(W, rl+1)\n else:\n ll = max(1, ll-1)\n if s == 'U': # (12): NO CHANGE (20): NO CHANGE\n ul += 1\n elif s == 'D': # (13): NO CHANGE (21): NO CHANGE\n dl -= 1\n elif s == 'L': # (14): NO CHANGE (22): NO CHANGE\n ll += 1 # (23): ll=2\n else:\n rl -= 1 # (15): rl=2\n if ul > dl or ll > rl or ul == H + 1 or dl == 0 or ll == W + 1 or rl == 0: # (16): NO CHANGE (24): NO CHANGE\n print('NO')\n exit()\ns = S[0] # (26): s=R\nif s == 'U': # (27): NO CHANGE\n ul += 1\nelif s == 'D': # (28): NO CHANGE\n dl -= 1\nelif s == 'L': # (29): NO CHANGE\n ll += 1\nelse:\n rl -= 1 # (30): rl=1\n\nif ul <= sr <= dl and ll <= sc <= rl: # (31): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " from sys import exit\n H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n ul = 1\n dl = H\n rl = W\n ll = 1\n-for s, t in zip(S[1::][::-1], T[::-1]):\n- if t == 'U':\n- dl = min(H, dl+1)\n- elif t == 'D':\n- ul = max(1, ul-1)\n- elif t == 'L':\n- rl = min(W, rl+1)\n- else:\n- ll = max(1, ll-1)\n+for s, t in zip(S[1::][::-1], T[:-1:][::-1]):\n if s == 'U':\n ul += 1\n elif s == 'D':\n dl -= 1\n elif s == 'L':\n ll += 1\n else:\n rl -= 1\n if ul > dl or ll > rl or ul == H + 1 or dl == 0 or ll == W + 1 or rl == 0:\n print('NO')\n exit()\n+ if t == 'U':\n+ dl = min(H, dl+1)\n+ elif t == 'D':\n+ ul = max(1, ul-1)\n+ elif t == 'L':\n+ rl = min(W, rl+1)\n+ else:\n+ ll = max(1, ll-1)\n s = S[0]\n if s == 'U':\n ul += 1\n elif s == 'D':\n dl -= 1\n elif s == 'L':\n ll += 1\n else:\n rl -= 1\n \n if ul <= sr <= dl and ll <= sc <= rl:\n print('YES')\n else:\n print('NO')\n", "FL_content": " from sys import exit\n H, W, N = map(int, input().split())\n sr, sc = map(int, input().split())\n S = input()\n T = input()\n ul = 1\n dl = H\n rl = W\n ll = 1\n-for s, t in zip(S[1::][::-1], T[::-1]):\n- if t == 'U':\n- dl = min(H, dl+1)\n- elif t == 'D':\n- ul = max(1, ul-1)\n- elif t == 'L':\n- rl = min(W, rl+1)\n- else:\n- ll = max(1, ll-1)\n if s == 'U':\n ul += 1\n elif s == 'D':\n dl -= 1\n elif s == 'L':\n ll += 1\n else:\n rl -= 1\n if ul > dl or ll > rl or ul == H + 1 or dl == 0 or ll == W + 1 or rl == 0:\n print('NO')\n exit()\n s = S[0]\n if s == 'U':\n ul += 1\n elif s == 'D':\n dl -= 1\n elif s == 'L':\n ll += 1\n else:\n rl -= 1\n \n if ul <= sr <= dl and ll <= sc <= rl:\n print('YES')\n else:\n print('NO')\n", "added_lines": 9, "removed_lines": 9, "code1_lines": 43 }, { "user_id": "u350248178", "problem_id": "p03054", "submission1_id": "s272138459", "submission2_id": "s065885896", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,n=[int(j) for j in input().split()]\nR,C=[int(j) for j in input().split()]\ns=input()\nt=input()\n\n\nx=C\nl,r=1,w\nfor i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\n\nx=R\nl,r=1,h\nfor i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\nprint(\"YES\")", "code2": "h,w,n=[int(j) for j in input().split()]\nR,C=[int(j) for j in input().split()]\ns=input()\nt=input()\n\n\nx=C\nl,r=1,w\nfor i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n if l==0:\n l=1\n if r>w:\n r=w\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\n\nx=h+1-R\nl,r=1,h\nfor i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n if l==0:\n l=1\n if r>h:\n r=h\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\nprint(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572072614", "date2": "1572076028", "bleu_score": "0.8571383210885418", "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, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "4 10 2\n2 1\nRLDRRUDDLSL\nURRDRLLDLRD\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["h,w,n=[int(j) for j in input().split()] # (0): h=4, w=10, n=2\nR,C=[int(j) for j in input().split()] # (1): R=2, C=1\ns=input() # (2): s=RLDRRUDDLSL\nt=input() # (3): t=URRDRLLDLRD\n\n\nx=C # (4): x=1\nl,r=1,w # (5): l=1, r=10\nfor i in range(n)[::-1]: # (6): i=1 (13): i=0 (19): NO CHANGE\n if t[i]==\"R\": # (7): NO CHANGE (14): NO CHANGE\n l-=1 # (8): l=0\n elif t[i]==\"L\": # (15): NO CHANGE\n r+=1\n if s[i]==\"R\": # (9): NO CHANGE (16): NO CHANGE\n r-=1 # (17): r=9\n elif s[i]==\"L\": # (10): NO CHANGE\n l+=1 # (11): l=1\n if l>r: # (12): NO CHANGE (18): NO CHANGE\n print(\"NO\")\n exit()\nif not l<=x<=r: # (20): NO CHANGE\n print(\"NO\")\n exit()\n\nx=R # (21): x=2\nl,r=1,h # (22): r=4\nfor i in range(n)[::-1]: # (23): i=1 (29): i=0 (35): NO CHANGE\n if t[i]==\"U\": # (24): NO CHANGE (30): NO CHANGE\n l-=1 # (31): l=0\n elif t[i]==\"D\": # (25): NO CHANGE\n r+=1\n if s[i]==\"U\": # (26): NO CHANGE (32): NO CHANGE\n r-=1\n elif s[i]==\"D\": # (27): NO CHANGE (33): NO CHANGE\n l+=1\n if l>r: # (28): NO CHANGE (34): NO CHANGE\n print(\"NO\")\n exit()\nif not l<=x<=r: # (36): NO CHANGE\n print(\"NO\")\n exit()\nprint(\"YES\")"], "anno_status": [true], "diff_content": " h,w,n=[int(j) for j in input().split()]\n R,C=[int(j) for j in input().split()]\n s=input()\n t=input()\n \n \n x=C\n l,r=1,w\n for i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n+ if l==0:\n+ l=1\n+ if r>w:\n+ r=w\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\n if not l<=x<=r:\n print(\"NO\")\n exit()\n \n-x=R\n+x=h+1-R\n l,r=1,h\n for i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n+ if l==0:\n+ l=1\n+ if r>h:\n+ r=h\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\n if not l<=x<=r:\n print(\"NO\")\n exit()\n print(\"YES\")\n", "FL_content": " h,w,n=[int(j) for j in input().split()]\n R,C=[int(j) for j in input().split()]\n s=input()\n t=input()\n \n \n x=C\n l,r=1,w\n for i in range(n)[::-1]:\n if t[i]==\"R\":\n l-=1\n elif t[i]==\"L\":\n r+=1\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\n if not l<=x<=r:\n print(\"NO\")\n exit()\n \n-x=R\n l,r=1,h\n for i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\n if not l<=x<=r:\n print(\"NO\")\n exit()\n print(\"YES\")\n", "added_lines": 9, "removed_lines": 1, "code1_lines": 42 }, { "user_id": "u191874006", "problem_id": "p03054", "submission1_id": "s949234637", "submission2_id": "s355463061", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nimport sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\nsys.setrecursionlimit(1000000000)\nfrom heapq import heappush, heappop,heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\nmod = 10**9 + 7\ninf = float('inf')\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\n\nh,w,n = LI()\nsr,sc = LI()\nsr -= 1\nsc -= 1\nh -= 1\nw -= 1\ns = input()\nt = input()\nl,r,d,u = 0,w,h,0\nfor i in range(n)[::-1]:\n if t[i] == 'R':\n if l > 0:\n l -= 1\n elif t[i] == 'L':\n if r < w:\n r += 1\n elif t[i] == 'U':\n if u < h:\n d -= 1\n elif t[i] == 'D':\n if d > 0:\n u += 1\n if s[i] == 'R':\n r -= 1\n if r < 0:\n print('NO')\n quit()\n elif s[i] == 'L':\n l += 1\n if l > w:\n print('NO')\n quit()\n elif s[i] == 'U':\n u += 1\n if u > h:\n print('NO')\n quit()\n elif s[i] == 'D':\n d -= 1\n if d < 0:\n print('NO')\n quit()\n \nif l <= sc <= r and u <= sr <= d:\n print('YES')\nelse:\n print('NO')\n ", "code2": "\n\n\nimport sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\nsys.setrecursionlimit(1000000000)\nfrom heapq import heappush, heappop,heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\nmod = 10**9 + 7\ninf = float('inf')\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\n\nh,w,n = LI()\nsr,sc = LI()\nsr -= 1\nsc -= 1\nh -= 1\nw -= 1\ns = input()\nt = input()\nl,r,d,u = 0,w,h,0\nfor i in range(n)[::-1]:\n if t[i] == 'R':\n if l > 0:\n l -= 1\n elif t[i] == 'L':\n if r < w:\n r += 1\n elif t[i] == 'U':\n if d < h:\n d += 1\n elif t[i] == 'D':\n if u > 0:\n u -= 1\n if s[i] == 'R':\n r -= 1\n if r < 0:\n print('NO')\n quit()\n elif s[i] == 'L':\n l += 1\n if l > w:\n print('NO')\n quit()\n elif s[i] == 'U':\n u += 1\n if u > h:\n print('NO')\n quit()\n elif s[i] == 'D':\n d -= 1\n if d < 0:\n print('NO')\n quit()\n \nif l <= sc <= r and u <= sr <= d:\n print('YES')\nelse:\n print('NO')\n ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1569833109", "date2": "1569833367", "bleu_score": "0.9977818790188818", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "4 4 5\n2 2\nUDRRR\nLLDTD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["\n\n\nimport sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\nsys.setrecursionlimit(1000000000) # (0): heappush=, heappop=, heappushpop=, defaultdict=, accumulate=, Counter=, deque=, itemgetter=, permutations=\nfrom heapq import heappush, heappop,heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\nmod = 10**9 + 7 # (1): mod=1000000007\ninf = float('inf') # (2): inf=inf, I=, LI=\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\n\nh,w,n = LI() # (3): h=4, w=4, n=5\nsr,sc = LI() # (4): sr=2, sc=2\nsr -= 1 # (5): sr=1\nsc -= 1 # (6): sc=1\nh -= 1 # (7): h=3\nw -= 1 # (8): w=3\ns = input() # (9): s=UDRRR\nt = input() # (10): t=LLDTD\nl,r,d,u = 0,w,h,0 # (11): l=0, r=3, d=3, u=0\nfor i in range(n)[::-1]: # (12): i=4 (22): i=3 ... (61): NO CHANGE\n if t[i] == 'R': # (13): NO CHANGE (23): NO CHANGE ... (52): NO CHANGE\n if l > 0:\n l -= 1\n elif t[i] == 'L': # (14): NO CHANGE (24): NO CHANGE ... (53): NO CHANGE\n if r < w: # (43): NO CHANGE (54): NO CHANGE\n r += 1 # (44): r=1 (55): r=2\n elif t[i] == 'U': # (15): NO CHANGE (25): NO CHANGE (33): NO CHANGE\n if u < h:\n d -= 1\n elif t[i] == 'D': # (16): NO CHANGE (26): NO CHANGE (34): NO CHANGE\n if d > 0: # (17): NO CHANGE (35): NO CHANGE\n u += 1 # (18): u=1 (36): u=2\n if s[i] == 'R': # (19): NO CHANGE (27): NO CHANGE ... (56): NO CHANGE\n r -= 1 # (20): r=2 (28): r=1 (38): r=0\n if r < 0: # (21): NO CHANGE (29): NO CHANGE (39): NO CHANGE\n print('NO')\n quit()\n elif s[i] == 'L': # (46): NO CHANGE (57): NO CHANGE\n l += 1\n if l > w:\n print('NO')\n quit()\n elif s[i] == 'U': # (47): NO CHANGE (58): NO CHANGE\n u += 1 # (59): u=3\n if u > h: # (60): NO CHANGE\n print('NO')\n quit()\n elif s[i] == 'D': # (48): NO CHANGE\n d -= 1 # (49): d=2\n if d < 0: # (50): NO CHANGE\n print('NO')\n quit()\n \nif l <= sc <= r and u <= sr <= d: # (62): NO CHANGE\n print('YES')\nelse:\n print('NO')\n "], "anno_status": [false], "diff_content": " \n \n \n import sys\n import math\n from bisect import bisect_right as br\n from bisect import bisect_left as bl\n sys.setrecursionlimit(1000000000)\n from heapq import heappush, heappop,heappushpop\n from collections import defaultdict\n from itertools import accumulate\n from collections import Counter\n from collections import deque\n from operator import itemgetter\n from itertools import permutations\n mod = 10**9 + 7\n inf = float('inf')\n def I(): return int(sys.stdin.readline())\n def LI(): return list(map(int,sys.stdin.readline().split()))\n \n h,w,n = LI()\n sr,sc = LI()\n sr -= 1\n sc -= 1\n h -= 1\n w -= 1\n s = input()\n t = input()\n l,r,d,u = 0,w,h,0\n for i in range(n)[::-1]:\n if t[i] == 'R':\n if l > 0:\n l -= 1\n elif t[i] == 'L':\n if r < w:\n r += 1\n elif t[i] == 'U':\n- if u < h:\n- d -= 1\n+ if d < h:\n+ d += 1\n elif t[i] == 'D':\n- if d > 0:\n- u += 1\n+ if u > 0:\n+ u -= 1\n if s[i] == 'R':\n r -= 1\n if r < 0:\n print('NO')\n quit()\n elif s[i] == 'L':\n l += 1\n if l > w:\n print('NO')\n quit()\n elif s[i] == 'U':\n u += 1\n if u > h:\n print('NO')\n quit()\n elif s[i] == 'D':\n d -= 1\n if d < 0:\n print('NO')\n quit()\n \n if l <= sc <= r and u <= sr <= d:\n print('YES')\n else:\n print('NO')\n \n", "FL_content": " \n \n \n import sys\n import math\n from bisect import bisect_right as br\n from bisect import bisect_left as bl\n sys.setrecursionlimit(1000000000)\n from heapq import heappush, heappop,heappushpop\n from collections import defaultdict\n from itertools import accumulate\n from collections import Counter\n from collections import deque\n from operator import itemgetter\n from itertools import permutations\n mod = 10**9 + 7\n inf = float('inf')\n def I(): return int(sys.stdin.readline())\n def LI(): return list(map(int,sys.stdin.readline().split()))\n \n h,w,n = LI()\n sr,sc = LI()\n sr -= 1\n sc -= 1\n h -= 1\n w -= 1\n s = input()\n t = input()\n l,r,d,u = 0,w,h,0\n for i in range(n)[::-1]:\n if t[i] == 'R':\n if l > 0:\n l -= 1\n elif t[i] == 'L':\n if r < w:\n r += 1\n elif t[i] == 'U':\n- if u < h:\n- d -= 1\n elif t[i] == 'D':\n- if d > 0:\n- u += 1\n if s[i] == 'R':\n r -= 1\n if r < 0:\n print('NO')\n quit()\n elif s[i] == 'L':\n l += 1\n if l > w:\n print('NO')\n quit()\n elif s[i] == 'U':\n u += 1\n if u > h:\n print('NO')\n quit()\n elif s[i] == 'D':\n d -= 1\n if d < 0:\n print('NO')\n quit()\n \n if l <= sc <= r and u <= sr <= d:\n print('YES')\n else:\n print('NO')\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 68 }, { "user_id": "u638795007", "problem_id": "p03054", "submission1_id": "s249165950", "submission2_id": "s602377809", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def examA():\n N = I()\n ans = 0\n print(ans)\n return\n\ndef examB():\n H, W, N = LI()\n start = LI()\n S = SI(); T = SI()\n for t,a in [[\"U\",\"D\"],[\"R\",\"L\"]]:\n if t==\"U\":\n n = H\n else:\n n = W\n \n l = 1; r = n\n if S[-1]==t:\n r -=1\n elif S[-1]==a:\n l +=1\n for i in range(N-2,-1,-1):\n if T[i]==t and l>1:\n l -= 1\n elif T[i]==a and r W: R = W\n if U > H: U = H\n\n if s == 'L':\n L += 1\n elif s == 'R':\n R -= 1\n elif s == 'D':\n D += 1\n elif s == 'U':\n U -= 1\n\n if L > R or D > U:\n \n break\n\n bl = (L <= sc <= R) and (D <= sr <= U)\n answer = 'YES' if bl else 'NO'\n print(answer)\n return\n\ndef examC():\n ans = 0\n print(ans)\n return\n\ndef examD():\n ans = 0\n print(ans)\n return\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()\nglobal mod,mod2,inf,alphabet\nmod = 10**9 + 7\nmod2 = 998244353\ninf = 10**18\nalphabet = [chr(ord('a') + i) for i in range(26)]\n\nif __name__ == '__main__':\n examB()\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579581663", "date2": "1579582322", "bleu_score": "0.7364211169826883", "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, 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, 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, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "2 5 3\n2 4\nRLR\nLUD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["def examA(): # (0): examA=\n N = I()\n ans = 0\n print(ans)\n return\n\ndef examB(): # (1): examB=\n H, W, N = LI()\n start = LI()\n S = SI(); T = SI()\n for t,a in [[\"U\",\"D\"],[\"R\",\"L\"]]:\n if t==\"U\":\n n = H\n else:\n n = W\n \n l = 1; r = n\n if S[-1]==t:\n r -=1\n elif S[-1]==a:\n l +=1\n for i in range(N-2,-1,-1):\n if T[i]==t and l>1:\n l -= 1\n elif T[i]==a and r\n ans = 0\n print(ans)\n return\n\ndef examD(): # (3): examD=, sys=, copy=, bisect=, itertools=, heapq=, math=, heappop=, heappush=, heapify=, Counter=, defaultdict=, deque=, I=, LI=, LSI=, LS=, SI=\n ans = 0\n print(ans)\n return\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()\nglobal mod,mod2,inf,alphabet\nmod = 10**9 + 7 # (4): mod=1000000007\nmod2 = 998244353 # (5): mod2=998244353\ninf = 10**18 # (6): inf=1000000000000000000\nalphabet = [chr(ord('a') + i) for i in range(26)] # (7): alphabet=[a, b, ..., y, z]\n\nif __name__ == '__main__':\n examB()\n\n"], "anno_status": [false], "diff_content": " def examA():\n N = I()\n ans = 0\n print(ans)\n return\n \n+\n def examB():\n H, W, N = LI()\n- start = LI()\n- S = SI(); T = SI()\n- for t,a in [[\"U\",\"D\"],[\"R\",\"L\"]]:\n- if t==\"U\":\n- n = H\n- else:\n- n = W\n- \n- l = 1; r = n\n- if S[-1]==t:\n- r -=1\n- elif S[-1]==a:\n- l +=1\n- for i in range(N-2,-1,-1):\n- if T[i]==t and l>1:\n- l -= 1\n- elif T[i]==a and r W: R = W\n+ if U > H: U = H\n+\n+ if s == 'L':\n+ L += 1\n+ elif s == 'R':\n+ R -= 1\n+ elif s == 'D':\n+ D += 1\n+ elif s == 'U':\n+ U -= 1\n \n- if t==\"U\" and (r==0 or l==n):\n- print(\"NO\")\n- return\n- if t==\"R\" and (r==0 or l==n):\n- print(\"NO\")\n- return\n+ if L > R or D > U:\n+ \n+ break\n \n- if t==\"U\" and (not l<=start[1]<=r):\n- print(\"NO\")\n- return\n- elif t==\"R\" and (not l<=start[0]<=r):\n- print(\"NO\")\n- return\n- print(\"YES\")\n+ bl = (L <= sc <= R) and (D <= sr <= U)\n+ answer = 'YES' if bl else 'NO'\n+ print(answer)\n return\n \n def examC():\n ans = 0\n print(ans)\n return\n \n def examD():\n ans = 0\n print(ans)\n return\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 global mod,mod2,inf,alphabet\n mod = 10**9 + 7\n mod2 = 998244353\n inf = 10**18\n alphabet = [chr(ord('a') + i) for i in range(26)]\n \n if __name__ == '__main__':\n examB()\n \n \n", "FL_content": " def examA():\n N = I()\n ans = 0\n print(ans)\n return\n \n def examB():\n H, W, N = LI()\n- start = LI()\n- S = SI(); T = SI()\n- for t,a in [[\"U\",\"D\"],[\"R\",\"L\"]]:\n- if t==\"U\":\n- n = H\n- else:\n- n = W\n- \n- l = 1; r = n\n- if S[-1]==t:\n- r -=1\n- elif S[-1]==a:\n- l +=1\n- for i in range(N-2,-1,-1):\n- if T[i]==t and l>1:\n- l -= 1\n- elif T[i]==a and r0 : cntR-=1\n\n\ncntL = 0\nfor i in range(n):\n if s[i] == 'L' : cntL+=1\n if cntL == toL:\n print('NO')\n exit()\n if t[i] == 'R' and cntL>0: cntL-=1\n\n\ncntU = 0\nfor i in range(n):\n if s[i] == 'U' : cntU+=1\n if cntU == toU:\n print('NO')\n exit()\n if t[i] == 'D' and cntU>0: cntU-=1\n\n\ncntD = 0\nfor i in range(n):\n if s[i] == 'D' : cntD+=1\n if cntD == toD:\n print('NO')\n exit()\n if t[i] == 'U' and cntD>0: cntD-=1\n\nprint('YES')\n", "code2": "import sys\nsys.setrecursionlimit(10 ** 7)\ninput = sys.stdin.readline\n\nh, w,n = map(int, input().split())\nr,c = map(int, input().split())\ns = input() \nt = input() \n\n\nx=c\nfor i in range(n):\n if s[i] == 'R' : x+=1\n if x == w+1:\n print('NO')\n exit()\n if t[i] == 'L' and x>1 : x-=1\n\n\nx=c\nfor i in range(n):\n if s[i] == 'L' : x-=1\n if x == 0:\n print('NO')\n exit()\n if t[i] == 'R' and x1: y-=1\n\nprint('YES')\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587238671", "date2": "1587239113", "bleu_score": "0.7701946665976191", "code1_test_status": [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, 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, 1, 1, 1, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 103, "input": "4 0 5\n-1 2\nUDRQR\nLLDTD\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10 ** 7) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\nh, w,n = map(int, input().split()) # (2): h=4, w=0, n=5\nr,c = map(int, input().split()) # (3): r=-1, c=2\ns = input() # (4): s=UDRQR \nt = input() # (5): t=LLDTD \n\ntoL = c # (6): toL=2\ntoR = w-c+1 # (7): toR=-1\ntoU = r # (8): toU=-1\ntoD = h-r+1 # (9): toD=6\n\n\ncntR=0 # (10): cntR=0\nfor i in range(n): # (11): i=0 (15): i=1 ... (31): NO CHANGE\n if s[i] == 'R' : cntR+=1 # (12): NO CHANGE (16): NO CHANGE ... (28): cntR=2\n if cntR == toR: # (13): NO CHANGE (17): NO CHANGE ... (29): NO CHANGE\n print('NO')\n exit()\n if t[i] == 'L' and cntR>0 : cntR-=1 # (14): NO CHANGE (18): NO CHANGE ... (30): NO CHANGE\n\n\ncntL = 0 # (32): cntL=0\nfor i in range(n): # (33): i=0 (37): i=1 ... (53): NO CHANGE\n if s[i] == 'L' : cntL+=1 # (34): NO CHANGE (38): NO CHANGE ... (50): NO CHANGE\n if cntL == toL: # (35): NO CHANGE (39): NO CHANGE ... (51): NO CHANGE\n print('NO')\n exit()\n if t[i] == 'R' and cntL>0: cntL-=1 # (36): NO CHANGE (40): NO CHANGE ... (52): NO CHANGE\n\n\ncntU = 0 # (54): cntU=0\nfor i in range(n): # (55): i=0 (59): i=1 ... (75): NO CHANGE\n if s[i] == 'U' : cntU+=1 # (56): cntU=1 (60): NO CHANGE ... (72): NO CHANGE\n if cntU == toU: # (57): NO CHANGE (61): NO CHANGE ... (73): NO CHANGE\n print('NO')\n exit()\n if t[i] == 'D' and cntU>0: cntU-=1 # (58): NO CHANGE (62): NO CHANGE ... (74): NO CHANGE\n\n\ncntD = 0 # (76): cntD=0\nfor i in range(n): # (77): i=0 (81): i=1 ... (97): NO CHANGE\n if s[i] == 'D' : cntD+=1 # (78): NO CHANGE (82): cntD=1 ... (94): NO CHANGE\n if cntD == toD: # (79): NO CHANGE (83): NO CHANGE ... (95): NO CHANGE\n print('NO')\n exit()\n if t[i] == 'U' and cntD>0: cntD-=1 # (80): NO CHANGE (84): NO CHANGE ... (96): NO CHANGE\n\nprint('YES')\n"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(10 ** 7)\n input = sys.stdin.readline\n \n h, w,n = map(int, input().split())\n r,c = map(int, input().split())\n s = input() \n t = input() \n \n-toL = c\n-toR = w-c+1\n-toU = r\n-toD = h-r+1\n \n-\n-cntR=0\n+x=c\n for i in range(n):\n- if s[i] == 'R' : cntR+=1\n- if cntR == toR:\n+ if s[i] == 'R' : x+=1\n+ if x == w+1:\n print('NO')\n exit()\n- if t[i] == 'L' and cntR>0 : cntR-=1\n+ if t[i] == 'L' and x>1 : x-=1\n \n \n-cntL = 0\n+x=c\n for i in range(n):\n- if s[i] == 'L' : cntL+=1\n- if cntL == toL:\n+ if s[i] == 'L' : x-=1\n+ if x == 0:\n print('NO')\n exit()\n- if t[i] == 'R' and cntL>0: cntL-=1\n+ if t[i] == 'R' and x0: cntU-=1\n+ if t[i] == 'D' and y0: cntD-=1\n+ if t[i] == 'U' and y>1: y-=1\n \n print('YES')\n \n", "FL_content": " import sys\n sys.setrecursionlimit(10 ** 7)\n input = sys.stdin.readline\n \n h, w,n = map(int, input().split())\n r,c = map(int, input().split())\n s = input() \n t = input() \n \n-toL = c\n-toR = w-c+1\n-toU = r\n-toD = h-r+1\n \n-\n-cntR=0\n for i in range(n):\n- if s[i] == 'R' : cntR+=1\n- if cntR == toR:\n print('NO')\n exit()\n- if t[i] == 'L' and cntR>0 : cntR-=1\n \n \n-cntL = 0\n for i in range(n):\n- if s[i] == 'L' : cntL+=1\n- if cntL == toL:\n print('NO')\n exit()\n- if t[i] == 'R' and cntL>0: cntL-=1\n \n \n-cntU = 0\n for i in range(n):\n- if s[i] == 'U' : cntU+=1\n- if cntU == toU:\n print('NO')\n exit()\n- if t[i] == 'D' and cntU>0: cntU-=1\n \n \n-cntD = 0\n for i in range(n):\n- if s[i] == 'D' : cntD+=1\n- if cntD == toD:\n print('NO')\n exit()\n- if t[i] == 'U' and cntD>0: cntD-=1\n \n print('YES')\n \n", "added_lines": 16, "removed_lines": 21, "code1_lines": 52 }, { "user_id": "u803848678", "problem_id": "p03054", "submission1_id": "s981406022", "submission2_id": "s434803867", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,n = map(int, input().split())\nsr, sc = map(int, input().split())\ns = input()\nt = input()\n\nleft = 1\nright = w\nbot = 1\ntop = h\n\n\nif s[-1] == \"L\":\n left += 1\nelif s[-1] == \"R\":\n right -= 1\nelif s[-1] == \"U\":\n top -= 1\nelif s[-1] == \"D\":\n bot += 1\n\nfor i in range(n-2, -1, -1):\n \n \n if t[i] == \"L\":\n right = min(w, right+1)\n elif t[i] == \"R\":\n left = max(0, left-1)\n elif t[i] == \"U\":\n bot = max(0, bot-1)\n elif t[i] == \"D\":\n top = min(h, top+1)\n \n \n if s[i] == \"L\":\n left += 1\n elif s[i] == \"R\":\n right -= 1\n elif s[i] == \"U\":\n top -= 1\n elif s[i] == \"D\":\n bot += 1\n if left >= right or bot >= top:\n print(\"NO\")\n exit()\n\n\nif left <= sc <= right and bot <= sr <=top:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "h,w,n = map(int, input().split())\nsr, sc = map(int, input().split())\ns = input()\nt = input()\n\nleft = 1\nright = w\nbot = 1\ntop = h\n\nif s[-1] == \"L\":\n left += 1\nelif s[-1] == \"R\":\n right -= 1\nelif s[-1] == \"U\":\n bot += 1\nelif s[-1] == \"D\":\n top -= 1\n\nfor i in range(n-2, -1, -1):\n if t[i] == \"L\":\n right = min(w, right+1)\n elif t[i] == \"R\":\n left = max(1, left-1)\n elif t[i] == \"U\":\n top = min(h, top+1)\n elif t[i] == \"D\":\n bot = max(1, bot-1)\n if s[i] == \"L\":\n left += 1\n elif s[i] == \"R\":\n right -= 1\n elif s[i] == \"U\":\n bot += 1\n elif s[i] == \"D\":\n top -= 1\n if left > right or bot > top:\n print(\"NO\")\n exit()\nif left <= sc <= right and bot <= sr <=top:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1568411718", "date2": "1568412355", "bleu_score": "0.958326131812453", "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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "2 3 3\n2 2\nRLR\nLUD\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " h,w,n = map(int, input().split())\n sr, sc = map(int, input().split())\n s = input()\n t = input()\n \n left = 1\n right = w\n bot = 1\n top = h\n \n-\n if s[-1] == \"L\":\n left += 1\n elif s[-1] == \"R\":\n right -= 1\n elif s[-1] == \"U\":\n- top -= 1\n-elif s[-1] == \"D\":\n bot += 1\n+elif s[-1] == \"D\":\n+ top -= 1\n \n for i in range(n-2, -1, -1):\n- \n- \n if t[i] == \"L\":\n right = min(w, right+1)\n elif t[i] == \"R\":\n- left = max(0, left-1)\n+ left = max(1, left-1)\n elif t[i] == \"U\":\n- bot = max(0, bot-1)\n- elif t[i] == \"D\":\n top = min(h, top+1)\n- \n- \n+ elif t[i] == \"D\":\n+ bot = max(1, bot-1)\n if s[i] == \"L\":\n left += 1\n elif s[i] == \"R\":\n right -= 1\n elif s[i] == \"U\":\n- top -= 1\n- elif s[i] == \"D\":\n bot += 1\n- if left >= right or bot >= top:\n+ elif s[i] == \"D\":\n+ top -= 1\n+ if left > right or bot > top:\n print(\"NO\")\n exit()\n-\n-\n if left <= sc <= right and bot <= sr <=top:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": " h,w,n = map(int, input().split())\n sr, sc = map(int, input().split())\n s = input()\n t = input()\n \n left = 1\n right = w\n bot = 1\n top = h\n \n-\n if s[-1] == \"L\":\n left += 1\n elif s[-1] == \"R\":\n right -= 1\n elif s[-1] == \"U\":\n- top -= 1\n-elif s[-1] == \"D\":\n bot += 1\n \n for i in range(n-2, -1, -1):\n- \n- \n if t[i] == \"L\":\n right = min(w, right+1)\n elif t[i] == \"R\":\n- left = max(0, left-1)\n elif t[i] == \"U\":\n- bot = max(0, bot-1)\n- elif t[i] == \"D\":\n top = min(h, top+1)\n- \n- \n if s[i] == \"L\":\n left += 1\n elif s[i] == \"R\":\n right -= 1\n elif s[i] == \"U\":\n- top -= 1\n- elif s[i] == \"D\":\n bot += 1\n- if left >= right or bot >= top:\n print(\"NO\")\n exit()\n-\n-\n if left <= sc <= right and bot <= sr <=top:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 8, "removed_lines": 15, "code1_lines": 50 }, { "user_id": "u350248178", "problem_id": "p03054", "submission1_id": "s150260949", "submission2_id": "s065885896", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w,n=[int(j) for j in input().split()]\nr,c=[int(j) for j in input().split()]\ns=input()\nt=input()\n\n\nx=c\nfor i in range(n):\n if s[i]==\"R\":\n x+=1\n if t[i]==\"L\" and x>1:\n x-=1\nif not 1<=x<=w:\n print(\"NO\")\n exit()\n\n\nx=c\nfor i in range(n):\n if s[i]==\"L\":\n x-=1\n if t[i]==\"R\" and x1:\n x-=1\nif not 1<=x<=h:\n print(\"NO\")\n exit()\n\n\nx=r\nfor i in range(n):\n if s[i]==\"D\":\n x-=1\n if t[i]==\"U\" and xw:\n r=w\n if s[i]==\"R\":\n r-=1\n elif s[i]==\"L\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\n\nx=h+1-R\nl,r=1,h\nfor i in range(n)[::-1]:\n if t[i]==\"U\":\n l-=1\n elif t[i]==\"D\":\n r+=1\n if l==0:\n l=1\n if r>h:\n r=h\n if s[i]==\"U\":\n r-=1\n elif s[i]==\"D\":\n l+=1\n if l>r:\n print(\"NO\")\n exit()\nif not l<=x<=r:\n print(\"NO\")\n exit()\nprint(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572069667", "date2": "1572076028", "bleu_score": "0.7121608817704087", "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, 0, 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], "code1_test_score": 100, "total_score": 103, "input": "4 10 2\n2 1\nRLDRRUDDLSL\nURRDRLLDLRD\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["h,w,n=[int(j) for j in input().split()] # (0): h=4, w=10, n=2\nr,c=[int(j) for j in input().split()] # (1): r=2, c=1\ns=input() # (2): s=RLDRRUDDLSL\nt=input() # (3): t=URRDRLLDLRD\n\n\nx=c # (4): x=1\nfor i in range(n): # (5): i=0 (9): i=1 (12): NO CHANGE\n if s[i]==\"R\": # (6): NO CHANGE (10): NO CHANGE\n x+=1 # (7): x=2\n if t[i]==\"L\" and x>1: # (8): NO CHANGE (11): NO CHANGE\n x-=1\nif not 1<=x<=w: # (13): NO CHANGE\n print(\"NO\")\n exit()\n\n\nx=c # (14): x=1\nfor i in range(n): # (15): i=0 (18): i=1 (23): NO CHANGE\n if s[i]==\"L\": # (16): NO CHANGE (19): NO CHANGE\n x-=1 # (20): x=0\n if t[i]==\"R\" and x1: # (28): NO CHANGE (31): NO CHANGE\n x-=1\nif not 1<=x<=h: # (33): NO CHANGE\n print(\"NO\")\n exit()\n\n\nx=r # (34): NO CHANGE\nfor i in range(n): # (35): i=0 (39): i=1 (42): NO CHANGE\n if s[i]==\"D\": # (36): NO CHANGE (40): NO CHANGE\n x-=1\n if t[i]==\"U\" and xw:\n+ r=w\n if s[i]==\"R\":\n- x+=1\n- if t[i]==\"L\" and x>1:\n- x-=1\n-if not 1<=x<=w:\n+ r-=1\n+ elif s[i]==\"L\":\n+ l+=1\n+ if l>r:\n+ print(\"NO\")\n+ exit()\n+if not l<=x<=r:\n print(\"NO\")\n exit()\n \n-\n-x=c\n-for i in range(n):\n- if s[i]==\"L\":\n- x-=1\n- if t[i]==\"R\" and xh:\n+ r=h\n if s[i]==\"U\":\n- x+=1\n- if t[i]==\"D\" and x>1:\n- x-=1\n-if not 1<=x<=h:\n- print(\"NO\")\n- exit()\n-\n-\n-x=r\n-for i in range(n):\n- if s[i]==\"D\":\n- x-=1\n- if t[i]==\"U\" and xr:\n+ print(\"NO\")\n+ exit()\n+if not l<=x<=r:\n print(\"NO\")\n exit()\n print(\"YES\")\n", "FL_content": " h,w,n=[int(j) for j in input().split()]\n-r,c=[int(j) for j in input().split()]\n s=input()\n t=input()\n \n \n-x=c\n-for i in range(n):\n if s[i]==\"R\":\n- x+=1\n- if t[i]==\"L\" and x>1:\n- x-=1\n-if not 1<=x<=w:\n print(\"NO\")\n exit()\n \n-\n-x=c\n-for i in range(n):\n- if s[i]==\"L\":\n- x-=1\n- if t[i]==\"R\" and x1:\n- x-=1\n-if not 1<=x<=h:\n- print(\"NO\")\n- exit()\n-\n-\n-x=r\n-for i in range(n):\n- if s[i]==\"D\":\n- x-=1\n- if t[i]==\"U\" and x=0:\n dp[i] = max(dp[i-A[j]]+B[j],dp[i])\nfor i in range(N+1):\n dp[i] = N-i+dp[i]\n\n\ncount = max(dp)\ndp = [0]*(count+1)\nfor i in range(count+1):\n for j in range(3):\n if i-B[j]>=0:\n dp[i] = max(dp[i-B[j]]+A[j],dp[i])\nfor i in range(N+1):\n dp[i] = count-i+dp[i]\n\nprint(max(dp))", "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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\ndef solve():\n N = I()\n A = III()\n B = III()\n\n first_use = []\n second_use = []\n for i in range(3):\n if A[i]B[i]:\n second_use.append(i)\n\n def change(n,A,B,use_index):\n dp = [n]*(n+1)\n for i in range(n+1):\n for j in use_index:\n if i-A[j]>=0:\n dp[i] = max(dp[i-A[j]]+B[j]-A[j],dp[i])\n return dp[n]\n\n count1 = change(N,A,B,first_use)\n count2 = change(count1,B,A,second_use)\n\n print(count2)\n\nsolve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579923069", "date2": "1579927359", "bleu_score": "0.7249152848161353", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1], "code1_test_score": 67, "total_score": 101, "input": "23\n1 2 1\n2 0 1\n", "actual_output": "71\n", "expected_output": "48\n\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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I() # (4): N=23\nA = III() # (5): A=[1, 2, 1]\nB = III() # (6): B=[2, 0, 1]\n\n\ndp = [0]*(N+1) # (7): dp=[0, 0, ..., 0, 0]\nfor i in range(N+1): # (8): i=0 (16): i=1 ... (268): NO CHANGE\n for j in range(3): # (9): j=0 (11): j=1 ... (267): NO CHANGE\n if i-A[j]>=0: # (10): NO CHANGE (12): NO CHANGE ... (265): NO CHANGE\n dp[i] = max(dp[i-A[j]]+B[j],dp[i]) # (19): dp=[0, 2, ..., 0, 0] (24): NO CHANGE ... (266): NO CHANGE\nfor i in range(N+1): # (269): i=0 (271): i=1 ... (317): NO CHANGE\n dp[i] = N-i+dp[i] # (270): dp=[23, 2, ..., 44, 46] (272): dp=[23, 24, ..., 44, 46] ... (316): NO CHANGE\n\n\ncount = max(dp) # (318): count=46\ndp = [0]*(count+1) # (319): dp=[0, 0, ..., 0, 0]\nfor i in range(count+1): # (320): i=0 (329): i=1 ... (834): NO CHANGE\n for j in range(3): # (321): j=0 (323): j=1 ... (833): NO CHANGE\n if i-B[j]>=0: # (322): NO CHANGE (324): NO CHANGE ... (831): NO CHANGE\n dp[i] = max(dp[i-B[j]]+A[j],dp[i]) # (325): dp=[2, 0, ..., 0, 0] (334): dp=[2, 2, ..., 0, 0] ... (832): NO CHANGE\nfor i in range(N+1): # (835): i=0 (837): i=1 ... (883): NO CHANGE\n dp[i] = count-i+dp[i] # (836): dp=[48, 3, ..., 69, 71] (838): dp=[48, 48, ..., 69, 71] ... (882): dp=[48, 48, ..., 69, 71]\n\nprint(max(dp))"], "anno_status": [false], "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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n-N = I()\n-A = III()\n-B = III()\n-\n-\n-dp = [0]*(N+1)\n-for i in range(N+1):\n- for j in range(3):\n- if i-A[j]>=0:\n- dp[i] = max(dp[i-A[j]]+B[j],dp[i])\n-for i in range(N+1):\n- dp[i] = N-i+dp[i]\n-\n-\n-count = max(dp)\n-dp = [0]*(count+1)\n-for i in range(count+1):\n- for j in range(3):\n- if i-B[j]>=0:\n- dp[i] = max(dp[i-B[j]]+A[j],dp[i])\n-for i in range(N+1):\n- dp[i] = count-i+dp[i]\n-\n-print(max(dp))\n+def solve():\n+ N = I()\n+ A = III()\n+ B = III()\n+\n+ first_use = []\n+ second_use = []\n+ for i in range(3):\n+ if A[i]B[i]:\n+ second_use.append(i)\n+\n+ def change(n,A,B,use_index):\n+ dp = [n]*(n+1)\n+ for i in range(n+1):\n+ for j in use_index:\n+ if i-A[j]>=0:\n+ dp[i] = max(dp[i-A[j]]+B[j]-A[j],dp[i])\n+ return dp[n]\n+\n+ count1 = change(N,A,B,first_use)\n+ count2 = change(count1,B,A,second_use)\n+\n+ print(count2)\n+\n+solve()\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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n-N = I()\n-A = III()\n-B = III()\n-\n-\n-dp = [0]*(N+1)\n-for i in range(N+1):\n- for j in range(3):\n- if i-A[j]>=0:\n- dp[i] = max(dp[i-A[j]]+B[j],dp[i])\n-for i in range(N+1):\n- dp[i] = N-i+dp[i]\n-\n-\n-count = max(dp)\n-dp = [0]*(count+1)\n-for i in range(count+1):\n- for j in range(3):\n- if i-B[j]>=0:\n- dp[i] = max(dp[i-B[j]]+A[j],dp[i])\n-for i in range(N+1):\n- dp[i] = count-i+dp[i]\n-\n-print(max(dp))\n", "added_lines": 27, "removed_lines": 24, "code1_lines": 48 }, { "user_id": "u144913062", "problem_id": "p03008", "submission1_id": "s457055677", "submission2_id": "s812853929", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nN = int(input())\nga, sa, ba = map(int, input().split())\ngb, sb, bb = map(int, input().split())\nA = [10**18] * 3\nB = [10**18] * 3\ndg = abs(ga - gb)\nds = abs(sa - sb)\ndb = abs(ba - bb)\nif ga < gb:\n A[0] = ga\nelif ga > gb:\n B[0] = gb\nif sa < sb:\n A[1] = sa\nelif sa > sb:\n B[1] = sb\nif ba < bb:\n A[2] = ba\nelif ba > bb:\n B[2] = bb\n\ndef calc(X):\n res = -1\n for i in range(N+1):\n if X[0] * i > N:\n break\n M = N - X[0] * i\n j = M \n k = (M - X[1] * j) \n res = max(res, dg * i + ds * j + db * k)\n k = M \n j = (M - X[2] * k) \n res = max(res, dg * i + ds * j + db * k)\n return res\n\nN += calc(A)\nN += calc(B)\nprint(N)\n\n", "code2": "import sys\ninput = sys.stdin.readline\n\nN = int(input())\nga, sa, ba = map(int, input().split())\ngb, sb, bb = map(int, input().split())\nINF = 10**18\nA = [INF] * 3\nB = [INF] * 3\nvalues = [abs(ga - gb), abs(sa - sb), abs(ba - bb)]\nif ga < gb:\n A[0] = ga\nelif ga > gb:\n B[0] = gb\nif sa < sb:\n A[1] = sa\nelif sa > sb:\n B[1] = sb\nif ba < bb:\n A[2] = ba\nelif ba > bb:\n B[2] = bb\n\ndef calc(X):\n dp = [0] * (N+1)\n dp[0] = 0\n for x, v in zip(X, values):\n for i in range(N+1-x):\n dp[i+x] = max(dp[i+x], dp[i] + v)\n return dp[-1]\n\nN += calc(A)\nN += calc(B)\nprint(N)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590197507", "date2": "1590199264", "bleu_score": "0.6589585020246926", "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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 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, 1], "code1_test_score": 14, "total_score": 101, "input": "23\n2 2 1\n5 0 2\n", "actual_output": "228\n", "expected_output": "59\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nN = int(input()) # (1): N=23\nga, sa, ba = map(int, input().split()) # (2): ga=2, sa=2, ba=1\ngb, sb, bb = map(int, input().split()) # (3): gb=5, sb=0, bb=2\nA = [10**18] * 3 # (4): A=[1000000000000000000, 1000000000000000000, 1000000000000000000]\nB = [10**18] * 3 # (5): B=[1000000000000000000, 1000000000000000000, 1000000000000000000]\ndg = abs(ga - gb) # (6): dg=3\nds = abs(sa - sb) # (7): ds=2\ndb = abs(ba - bb) # (8): db=1\nif ga < gb: # (9): NO CHANGE\n A[0] = ga # (10): A=[2, 1000000000000000000, 1000000000000000000]\nelif ga > gb:\n B[0] = gb\nif sa < sb: # (11): NO CHANGE\n A[1] = sa\nelif sa > sb: # (12): NO CHANGE\n B[1] = sb # (13): B=[1000000000000000000, 0, 1000000000000000000]\nif ba < bb: # (14): NO CHANGE\n A[2] = ba # (15): A=[2, 1000000000000000000, 1]\nelif ba > bb:\n B[2] = bb\n\ndef calc(X): # (16): calc=\n res = -1 # (18): res=-1 (131): res=-1\n for i in range(N+1): # (19): i=0 (28): i=1 ... (141): i=1\n if X[0] * i > N: # (20): NO CHANGE (29): NO CHANGE ... (142): NO CHANGE\n break # (129): sys=, input=, N=57, ga=2, sa=2, ba=1, gb=5, sb=0, bb=2, A=[2, 1000000000000000000, 1], B=[1000000000000000000, 0, 1000000000000000000], dg=3, ds=2, db=1, calc= (143): sys=, input=, N=228, ga=2, sa=2, ba=1, gb=5, sb=0, bb=2, A=[2, 1000000000000000000, 1], B=[1000000000000000000, 0, 1000000000000000000], dg=3, ds=2, db=1, calc=\n M = N - X[0] * i # (21): M=23 (30): M=21 ... (134): M=57\n j = M # (22): j=23 (31): j=21 ... (135): j=57\n k = (M - X[1] * j) # (23): k=-22999999999999999977 (32): k=-20999999999999999979 ... (136): k=57\n res = max(res, dg * i + ds * j + db * k) # (24): NO CHANGE (33): NO CHANGE ... (137): res=171\n k = M # (25): k=23 (34): k=21 ... (138): NO CHANGE\n j = (M - X[2] * k) # (26): j=0 (35): j=0 ... (139): j=-56999999999999999943\n res = max(res, dg * i + ds * j + db * k) # (27): res=23 (36): res=24 ... (140): NO CHANGE\n return res\n\nN += calc(A) # (17): X=[2, 1000000000000000000, 1]\nN += calc(B) # (130): X=[1000000000000000000, 0, 1000000000000000000]\nprint(N)\n\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n N = int(input())\n ga, sa, ba = map(int, input().split())\n gb, sb, bb = map(int, input().split())\n-A = [10**18] * 3\n-B = [10**18] * 3\n-dg = abs(ga - gb)\n-ds = abs(sa - sb)\n-db = abs(ba - bb)\n+INF = 10**18\n+A = [INF] * 3\n+B = [INF] * 3\n+values = [abs(ga - gb), abs(sa - sb), abs(ba - bb)]\n if ga < gb:\n A[0] = ga\n elif ga > gb:\n B[0] = gb\n if sa < sb:\n A[1] = sa\n elif sa > sb:\n B[1] = sb\n if ba < bb:\n A[2] = ba\n elif ba > bb:\n B[2] = bb\n \n def calc(X):\n- res = -1\n- for i in range(N+1):\n- if X[0] * i > N:\n- break\n- M = N - X[0] * i\n- j = M \n- k = (M - X[1] * j) \n- res = max(res, dg * i + ds * j + db * k)\n- k = M \n- j = (M - X[2] * k) \n- res = max(res, dg * i + ds * j + db * k)\n- return res\n+ dp = [0] * (N+1)\n+ dp[0] = 0\n+ for x, v in zip(X, values):\n+ for i in range(N+1-x):\n+ dp[i+x] = max(dp[i+x], dp[i] + v)\n+ return dp[-1]\n \n N += calc(A)\n N += calc(B)\n print(N)\n-\n-\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n N = int(input())\n ga, sa, ba = map(int, input().split())\n gb, sb, bb = map(int, input().split())\n-A = [10**18] * 3\n-B = [10**18] * 3\n-dg = abs(ga - gb)\n-ds = abs(sa - sb)\n-db = abs(ba - bb)\n if ga < gb:\n A[0] = ga\n elif ga > gb:\n B[0] = gb\n if sa < sb:\n A[1] = sa\n elif sa > sb:\n B[1] = sb\n if ba < bb:\n A[2] = ba\n elif ba > bb:\n B[2] = bb\n \n def calc(X):\n- res = -1\n- for i in range(N+1):\n- if X[0] * i > N:\n- break\n- M = N - X[0] * i\n- j = M \n- k = (M - X[1] * j) \n- res = max(res, dg * i + ds * j + db * k)\n- k = M \n- j = (M - X[2] * k) \n- res = max(res, dg * i + ds * j + db * k)\n- return res\n \n N += calc(A)\n N += calc(B)\n print(N)\n-\n-\n", "added_lines": 10, "removed_lines": 19, "code1_lines": 43 }, { "user_id": "u754022296", "problem_id": "p03008", "submission1_id": "s929744662", "submission2_id": "s107748268", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na1, a2, a3 = map(int, input().split())\nb1, b2, b3 = map(int, input().split())\ndef f(n, a1, a2, a3, b1, b2, b3):\n dp = [0]*(n+1)\n for i in range(n):\n for a, b in zip((a1, a2, a3), (b1, b2, b3)):\n if i+a <= n:\n dp[i+a] = max(dp[i+a], dp[i]+b)\n return max(dp)\nm = f(n, a1, a2, a3, b1, b2, b3)\nans = f(m, b1, b2, b3, a1, a2, a3)\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nA = tuple(map(int, input().split()))\nB = tuple(map(int, input().split()))\ndef f(n):\n dp = list(range(n+1))\n for a, b in zip(A, B):\n for i in range(n+1):\n if i-a >= 0:\n dp[i] = max(dp[i], dp[i-a]+b)\n return max(dp)\nm = f(n)\nA, B = B, A\nans = f(m)\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595253066", "date2": "1595253994", "bleu_score": "0.6223401074742978", "code1_test_status": [1, 1, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1], "code1_test_score": 24, "total_score": 101, "input": "23\n3 3 2\n5 0 2\n", "actual_output": "93\n", "expected_output": "40\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nn = int(input()) # (1): n=23\na1, a2, a3 = map(int, input().split()) # (2): a1=3, a2=3, a3=2\nb1, b2, b3 = map(int, input().split()) # (3): b1=5, b2=0, b3=2\ndef f(n, a1, a2, a3, b1, b2, b3): # (4): f=\n dp = [0]*(n+1) # (6): dp=[0, 0, ..., 0, 0] (257): dp=[0, 0, ..., 0, 0]\n for i in range(n): # (7): i=0 (18): i=1 ... (660): sys=, input=, n=23, a1=3, a2=3, b1=5, b2=0, f=, m=37, ans=93\n for a, b in zip((a1, a2, a3), (b1, b2, b3)): # (8): a=3, b=5 (11): b=0 ... (659): NO CHANGE\n if i+a <= n: # (9): NO CHANGE (12): NO CHANGE ... (658): NO CHANGE\n dp[i+a] = max(dp[i+a], dp[i]+b) # (10): dp=[0, 0, ..., 0, 0] (13): NO CHANGE ... (656): dp=[3, 3, ..., 93, 90]\n return max(dp)\nm = f(n, a1, a2, a3, b1, b2, b3) # (5): NO CHANGE\nans = f(m, b1, b2, b3, a1, a2, a3) # (256): n=37, a1=5, a2=0, b1=3, b2=3\nprint(ans)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n n = int(input())\n-a1, a2, a3 = map(int, input().split())\n-b1, b2, b3 = map(int, input().split())\n-def f(n, a1, a2, a3, b1, b2, b3):\n- dp = [0]*(n+1)\n- for i in range(n):\n- for a, b in zip((a1, a2, a3), (b1, b2, b3)):\n- if i+a <= n:\n- dp[i+a] = max(dp[i+a], dp[i]+b)\n+A = tuple(map(int, input().split()))\n+B = tuple(map(int, input().split()))\n+def f(n):\n+ dp = list(range(n+1))\n+ for a, b in zip(A, B):\n+ for i in range(n+1):\n+ if i-a >= 0:\n+ dp[i] = max(dp[i], dp[i-a]+b)\n return max(dp)\n-m = f(n, a1, a2, a3, b1, b2, b3)\n-ans = f(m, b1, b2, b3, a1, a2, a3)\n+m = f(n)\n+A, B = B, A\n+ans = f(m)\n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n n = int(input())\n-a1, a2, a3 = map(int, input().split())\n-b1, b2, b3 = map(int, input().split())\n-def f(n, a1, a2, a3, b1, b2, b3):\n- dp = [0]*(n+1)\n- for i in range(n):\n- for a, b in zip((a1, a2, a3), (b1, b2, b3)):\n- if i+a <= n:\n- dp[i+a] = max(dp[i+a], dp[i]+b)\n return max(dp)\n-m = f(n, a1, a2, a3, b1, b2, b3)\n-ans = f(m, b1, b2, b3, a1, a2, a3)\n print(ans)\n", "added_lines": 11, "removed_lines": 10, "code1_lines": 16 }, { "user_id": "u508486691", "problem_id": "p03008", "submission1_id": "s881793162", "submission2_id": "s816263980", "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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I()\nA = III()\nB = III()\n\nfirst_use = []\nsecond_use = []\nfor i in range(3):\n if A[i]B[i]:\n second_use.append(i)\n\n\ndp = [0]*(N+1)\nfor i in range(N+1):\n for j in first_use:\n if i-A[j]>=0:\n dp[i] = max(dp[i-A[j]]+B[j],dp[i])\nfor i in range(N+1):\n dp[i] = N-i+dp[i]\n\n\ncount = max(dp)\ndp = [0]*(count+1)\nfor i in range(count+1):\n for j in second_use:\n if i-B[j]>=0:\n dp[i] = max(dp[i-B[j]]+A[j],dp[i])\nfor i in range(N+1):\n dp[i] = count-i+dp[i]\n\nprint(max(dp))", "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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\ndef solve():\n N = I()\n A = III()\n B = III()\n\n first_use = []\n second_use = []\n for i in range(3):\n if A[i]B[i]:\n second_use.append(i)\n\n def change(n,A,B,use_index):\n dp = [n]*(n+1)\n for i in range(n+1):\n for j in use_index:\n if i-A[j]>=0:\n dp[i] = max(dp[i-A[j]]+B[j]-A[j],dp[i])\n return dp[n]\n\n count1 = change(N,A,B,first_use)\n count2 = change(count1,B,A,second_use)\n\n print(count2)\n\nsolve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579923450", "date2": "1579927359", "bleu_score": "0.8325056166472564", "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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 95, "total_score": 101, "input": "23\n0 5 2\n2 2 2\n", "actual_output": "60\n", "expected_output": "61\n\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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I() # (4): N=23\nA = III() # (5): A=[0, 5, 2]\nB = III() # (6): B=[2, 2, 2]\n\nfirst_use = [] # (7): first_use=[]\nsecond_use = [] # (8): second_use=[]\nfor i in range(3): # (9): i=0 (13): i=1 ... (20): NO CHANGE\n if A[i]B[i]: # (12): NO CHANGE (15): NO CHANGE (19): NO CHANGE\n second_use.append(i) # (16): second_use=[1]\n\n\ndp = [0]*(N+1) # (21): dp=[0, 0, ..., 0, 0]\nfor i in range(N+1): # (22): i=0 (27): i=1 ... (142): NO CHANGE\n for j in first_use: # (23): j=0 (26): NO CHANGE ... (141): NO CHANGE\n if i-A[j]>=0: # (24): NO CHANGE (29): NO CHANGE ... (139): NO CHANGE\n dp[i] = max(dp[i-A[j]]+B[j],dp[i]) # (25): dp=[2, 0, ..., 0, 0] (30): dp=[2, 2, ..., 0, 0] ... (140): dp=[2, 2, ..., 2, 2]\nfor i in range(N+1): # (143): i=0 (145): i=1 ... (191): NO CHANGE\n dp[i] = N-i+dp[i] # (144): dp=[25, 2, ..., 2, 2] (146): dp=[25, 24, ..., 2, 2] ... (190): NO CHANGE\n\n\ncount = max(dp) # (192): count=25\ndp = [0]*(count+1) # (193): dp=[0, 0, ..., 0, 0]\nfor i in range(count+1): # (194): i=0 (198): i=1 ... (322): NO CHANGE\n for j in second_use: # (195): j=1 (197): NO CHANGE ... (321): NO CHANGE\n if i-B[j]>=0: # (196): NO CHANGE (200): NO CHANGE ... (319): NO CHANGE\n dp[i] = max(dp[i-B[j]]+A[j],dp[i]) # (205): dp=[0, 0, ..., 0, 0] (210): dp=[0, 0, ..., 0, 0] ... (320): dp=[0, 0, ..., 60, 60]\nfor i in range(N+1): # (323): i=0 (325): i=1 ... (371): NO CHANGE\n dp[i] = count-i+dp[i] # (324): dp=[25, 0, ..., 60, 60] (326): dp=[25, 24, ..., 60, 60] ... (370): dp=[25, 24, ..., 60, 60]\n\nprint(max(dp))"], "anno_status": [false], "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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n-N = I()\n-A = III()\n-B = III()\n-\n-first_use = []\n-second_use = []\n-for i in range(3):\n- if A[i]B[i]:\n- second_use.append(i)\n-\n-\n-dp = [0]*(N+1)\n-for i in range(N+1):\n- for j in first_use:\n- if i-A[j]>=0:\n- dp[i] = max(dp[i-A[j]]+B[j],dp[i])\n-for i in range(N+1):\n- dp[i] = N-i+dp[i]\n-\n-\n-count = max(dp)\n-dp = [0]*(count+1)\n-for i in range(count+1):\n- for j in second_use:\n- if i-B[j]>=0:\n- dp[i] = max(dp[i-B[j]]+A[j],dp[i])\n-for i in range(N+1):\n- dp[i] = count-i+dp[i]\n-\n-print(max(dp))\n+def solve():\n+ N = I()\n+ A = III()\n+ B = III()\n+\n+ first_use = []\n+ second_use = []\n+ for i in range(3):\n+ if A[i]B[i]:\n+ second_use.append(i)\n+\n+ def change(n,A,B,use_index):\n+ dp = [n]*(n+1)\n+ for i in range(n+1):\n+ for j in use_index:\n+ if i-A[j]>=0:\n+ dp[i] = max(dp[i-A[j]]+B[j]-A[j],dp[i])\n+ return dp[n]\n+\n+ count1 = change(N,A,B,first_use)\n+ count2 = change(count1,B,A,second_use)\n+\n+ print(count2)\n+\n+solve()\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 [[] for _ in range(num)]\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n-N = I()\n-A = III()\n-B = III()\n-\n-first_use = []\n-second_use = []\n-for i in range(3):\n- if A[i]B[i]:\n- second_use.append(i)\n-\n-\n-dp = [0]*(N+1)\n-for i in range(N+1):\n- for j in first_use:\n- if i-A[j]>=0:\n- dp[i] = max(dp[i-A[j]]+B[j],dp[i])\n-for i in range(N+1):\n- dp[i] = N-i+dp[i]\n-\n-\n-count = max(dp)\n-dp = [0]*(count+1)\n-for i in range(count+1):\n- for j in second_use:\n- if i-B[j]>=0:\n- dp[i] = max(dp[i-B[j]]+A[j],dp[i])\n-for i in range(N+1):\n- dp[i] = count-i+dp[i]\n-\n-print(max(dp))\n", "added_lines": 27, "removed_lines": 32, "code1_lines": 56 }, { "user_id": "u754022296", "problem_id": "p03008", "submission1_id": "s021868372", "submission2_id": "s107748268", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na1, a2, a3 = map(int, input().split())\nb1, b2, b3 = map(int, input().split())\ndef f(n, a1, a2, a3, b1, b2, b3):\n dp = [0]*(n+1)\n for i in range(n+1):\n for a, b in zip((a1, a2, a3), (b1, b2, b3)):\n if i-a >= 0:\n dp[i] = max(dp[i], dp[i-a]+b)\n return max(dp)\nm = f(n, a1, a2, a3, b1, b2, b3)\nans = f(m, b1, b2, b3, a1, a2, a3)\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nA = tuple(map(int, input().split()))\nB = tuple(map(int, input().split()))\ndef f(n):\n dp = list(range(n+1))\n for a, b in zip(A, B):\n for i in range(n+1):\n if i-a >= 0:\n dp[i] = max(dp[i], dp[i-a]+b)\n return max(dp)\nm = f(n)\nA, B = B, A\nans = f(m)\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595253398", "date2": "1595253994", "bleu_score": "0.656323828292421", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 39, "total_score": 101, "input": "23\n2 2 1\n3 0 1\n", "actual_output": "47\n", "expected_output": "36\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nn = int(input()) # (1): n=23\na1, a2, a3 = map(int, input().split()) # (2): a1=2, a2=2, a3=1\nb1, b2, b3 = map(int, input().split()) # (3): b1=3, b2=0, b3=1\ndef f(n, a1, a2, a3, b1, b2, b3): # (4): f=\n dp = [0]*(n+1) # (6): dp=[0, 0, ..., 0, 0] (268): dp=[0, 0, ..., 0, 0]\n for i in range(n+1): # (7): i=0 (15): i=1 ... (650): sys=, input=, n=23, a1=2, a2=2, b1=3, b2=0, f=, m=34, ans=47\n for a, b in zip((a1, a2, a3), (b1, b2, b3)): # (8): a=2, b=3 (10): b=0 ... (649): NO CHANGE\n if i-a >= 0: # (9): NO CHANGE (11): NO CHANGE ... (647): NO CHANGE\n dp[i] = max(dp[i], dp[i-a]+b) # (22): dp=[0, 1, ..., 0, 0] (27): dp=[0, 1, ..., 0, 0] ... (648): NO CHANGE\n return max(dp)\nm = f(n, a1, a2, a3, b1, b2, b3) # (5): NO CHANGE\nans = f(m, b1, b2, b3, a1, a2, a3) # (267): n=34, a1=3, a2=0, b1=2, b2=2\nprint(ans)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n n = int(input())\n-a1, a2, a3 = map(int, input().split())\n-b1, b2, b3 = map(int, input().split())\n-def f(n, a1, a2, a3, b1, b2, b3):\n- dp = [0]*(n+1)\n- for i in range(n+1):\n- for a, b in zip((a1, a2, a3), (b1, b2, b3)):\n+A = tuple(map(int, input().split()))\n+B = tuple(map(int, input().split()))\n+def f(n):\n+ dp = list(range(n+1))\n+ for a, b in zip(A, B):\n+ for i in range(n+1):\n if i-a >= 0:\n dp[i] = max(dp[i], dp[i-a]+b)\n return max(dp)\n-m = f(n, a1, a2, a3, b1, b2, b3)\n-ans = f(m, b1, b2, b3, a1, a2, a3)\n+m = f(n)\n+A, B = B, A\n+ans = f(m)\n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n n = int(input())\n-a1, a2, a3 = map(int, input().split())\n-b1, b2, b3 = map(int, input().split())\n-def f(n, a1, a2, a3, b1, b2, b3):\n- dp = [0]*(n+1)\n- for i in range(n+1):\n- for a, b in zip((a1, a2, a3), (b1, b2, b3)):\n if i-a >= 0:\n dp[i] = max(dp[i], dp[i-a]+b)\n return max(dp)\n-m = f(n, a1, a2, a3, b1, b2, b3)\n-ans = f(m, b1, b2, b3, a1, a2, a3)\n print(ans)\n", "added_lines": 9, "removed_lines": 8, "code1_lines": 16 }, { "user_id": "u007808656", "problem_id": "p03008", "submission1_id": "s336424715", "submission2_id": "s949350374", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for v,w in zip(values,weights):\n for c in range(w, capacity+1):\n work[c]=max(work[c],work[c-w]+v)\n return work[-1]\ndef sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n print(valA)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\nprint(sol())", "code2": "def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for v,w in zip(values,weights):\n for c in range(w, capacity+1):\n work[c]=max(work[c],work[c-w]+v)\n return work[-1]\ndef sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\nprint(sol())", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560659136", "date2": "1560659184", "bleu_score": "0.970644341635588", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "23\n0 8 1\n2 1 1\n", "actual_output": "25\n200\n", "expected_output": "200\n\n", "anno_code": ["def knapsack_123(values,weights,capacity): # (0): knapsack_123=\n work = [0 for i in range(capacity+1)] # (7): work=[0, 0, ..., 0, 0] (191): work=[0, 0, ..., 0, 0]\n for v,w in zip(values,weights): # (8): v=2, w=0 (58): v=1, w=8 ... (346): NO CHANGE\n for c in range(w, capacity+1): # (9): c=0 (11): c=1 ... (397): NO CHANGE\n work[c]=max(work[c],work[c-w]+v) # (10): work=[2, 0, ..., 0, 0] (12): work=[2, 2, ..., 0, 0] ... (396): NO CHANGE\n return work[-1]\ndef sol(inp=input): # (1): sol=\n n=int(inp()) # (3): n=23\n prices_a=list(map(int,inp().split()))+[1] # (4): prices_a=[0, 8, 1, 1]\n prices_b=list(map(int,inp().split()))+[1] # (5): prices_b=[2, 1, 1, 1]\n \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n) # (6): values=[2, 1, 1, 1], weights=[0, 8, 1, 1], capacity=23\n print(valA) # (189): NO CHANGE\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA) # (190): values=[0, 8, 1, 1], weights=[2, 1, 1, 1], capacity=25\n return '{}'.format(valB)\nprint(sol()) # (2): inp=\n"], "anno_status": [true], "diff_content": " def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for v,w in zip(values,weights):\n for c in range(w, capacity+1):\n work[c]=max(work[c],work[c-w]+v)\n return work[-1]\n def sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n- print(valA)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\n print(sol())\n", "FL_content": " def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for v,w in zip(values,weights):\n for c in range(w, capacity+1):\n work[c]=max(work[c],work[c-w]+v)\n return work[-1]\n def sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n- print(valA)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\n print(sol())\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u905582793", "problem_id": "p03008", "submission1_id": "s424250824", "submission2_id": "s316441779", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ng1,s1,b1 = map(int,input().split())\ng2,s2,b2 = map(int,input().split())\ndef trade(n,g1,s1,b1,g2,s2,b2):\n tradelist = []\n for x,y in (g1,g2),(s1,s2),(b1,b2):\n if x < y:\n tradelist.append((x,y))\n if not tradelist:\n return n\n dp = [0]*(n+1)\n for w,v in tradelist:\n for i in range(n+1-w):\n dp[i+w] = max(dp[i+w],dp[i]+v)\n return dp[n]\n\nans1 = trade(n,g1,s1,b1,g2,s2,b2)\nans2 = trade(ans1,g2,s2,b2,g1,s1,b1)\nprint(ans2)", "code2": "n = int(input())\ng1,s1,b1 = map(int,input().split())\ng2,s2,b2 = map(int,input().split())\ndef trade(n,g1,s1,b1,g2,s2,b2):\n tradelist = []\n for x,y in (g1,g2),(s1,s2),(b1,b2):\n if x < y:\n tradelist.append((x,y))\n if not tradelist:\n return n\n dp = [0]*(n+1)\n for w,v in tradelist:\n for i in range(n+1-w):\n dp[i+w] = max(dp[i+w],dp[i]+v)\n ptr = n\n ret = dp[n]\n while ptr and dp[ptr-1] == dp[n]:\n ret += 1\n ptr -= 1\n return ret\n\nans1 = trade(n,g1,s1,b1,g2,s2,b2)\nans2 = trade(ans1,g2,s2,b2,g1,s1,b1)\nprint(ans2)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585779175", "date2": "1585779521", "bleu_score": "0.8412120442860862", "code1_test_status": [1, 1, 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, 1, 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, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 20, "total_score": 101, "input": "23\n2 2 1\n5 0 2\n", "actual_output": "2\n", "expected_output": "59\n\n", "anno_code": ["n = int(input()) # (0): n=23\ng1,s1,b1 = map(int,input().split()) # (1): g1=2, s1=2, b1=1\ng2,s2,b2 = map(int,input().split()) # (2): g2=5, s2=0, b2=2\ndef trade(n,g1,s1,b1,g2,s2,b2): # (3): trade=\n tradelist = [] # (5): tradelist=[] (113): tradelist=[]\n for x,y in (g1,g2),(s1,s2),(b1,b2): # (6): x=2, y=5 (9): y=0 ... (121): NO CHANGE\n if x < y: # (7): NO CHANGE (10): NO CHANGE ... (120): NO CHANGE\n tradelist.append((x,y)) # (8): tradelist=[(2, 5)] (13): tradelist=[(2, 5), (1, 2)] (118): tradelist=[(0, 2)]\n if not tradelist: # (15): NO CHANGE (122): NO CHANGE\n return n\n dp = [0]*(n+1) # (16): dp=[0, 0, ..., 0, 0] (123): dp=[0, 0, ..., 0, 0]\n for w,v in tradelist: # (17): w=2, v=5 (63): w=1, v=2 ... (242): n=23, g1=2, s1=2, b1=1, g2=5, s2=0, b2=2, trade=, ans1=57, ans2=2\n for i in range(n+1-w): # (18): i=0 (20): i=1 ... (241): NO CHANGE\n dp[i+w] = max(dp[i+w],dp[i]+v) # (19): dp=[0, 0, ..., 0, 0] (21): dp=[0, 0, ..., 0, 0] ... (240): dp=[2, 2, ..., 2, 2]\n return dp[n]\n\nans1 = trade(n,g1,s1,b1,g2,s2,b2) # (4): NO CHANGE\nans2 = trade(ans1,g2,s2,b2,g1,s1,b1) # (112): n=57, g1=5, s1=0, b1=2, g2=2, s2=2, b2=1\nprint(ans2)"], "anno_status": [true], "diff_content": " n = int(input())\n g1,s1,b1 = map(int,input().split())\n g2,s2,b2 = map(int,input().split())\n def trade(n,g1,s1,b1,g2,s2,b2):\n tradelist = []\n for x,y in (g1,g2),(s1,s2),(b1,b2):\n if x < y:\n tradelist.append((x,y))\n if not tradelist:\n return n\n dp = [0]*(n+1)\n for w,v in tradelist:\n for i in range(n+1-w):\n dp[i+w] = max(dp[i+w],dp[i]+v)\n- return dp[n]\n+ ptr = n\n+ ret = dp[n]\n+ while ptr and dp[ptr-1] == dp[n]:\n+ ret += 1\n+ ptr -= 1\n+ return ret\n \n ans1 = trade(n,g1,s1,b1,g2,s2,b2)\n ans2 = trade(ans1,g2,s2,b2,g1,s1,b1)\n print(ans2)\n", "FL_content": " n = int(input())\n g1,s1,b1 = map(int,input().split())\n g2,s2,b2 = map(int,input().split())\n def trade(n,g1,s1,b1,g2,s2,b2):\n tradelist = []\n for x,y in (g1,g2),(s1,s2),(b1,b2):\n if x < y:\n tradelist.append((x,y))\n if not tradelist:\n return n\n dp = [0]*(n+1)\n for w,v in tradelist:\n for i in range(n+1-w):\n dp[i+w] = max(dp[i+w],dp[i]+v)\n- return dp[n]\n \n ans1 = trade(n,g1,s1,b1,g2,s2,b2)\n ans2 = trade(ans1,g2,s2,b2,g1,s1,b1)\n print(ans2)\n", "added_lines": 6, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u007808656", "problem_id": "p03008", "submission1_id": "s287246109", "submission2_id": "s949350374", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for c in range(1, capacity+1):\n candidates = [val + work[c-weight]\n for val,weight in zip(values,weights) if weight <= c]\n work[c] = max(candidates) if candidates != [] else 0\n return work[-1]\ndef sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))\n prices_b=list(map(int,inp().split()))\n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\nprint(sol())", "code2": "def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for v,w in zip(values,weights):\n for c in range(w, capacity+1):\n work[c]=max(work[c],work[c-w]+v)\n return work[-1]\ndef sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\nprint(sol())", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560652826", "date2": "1560659184", "bleu_score": "0.8063243652795908", "code1_test_status": [1, 1, 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, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1], "code1_test_score": 24, "total_score": 101, "input": "23\n0 2 1\n4 0 1\n", "actual_output": "27\n", "expected_output": "29\n\n", "anno_code": ["def knapsack_123(values,weights,capacity): # (0): knapsack_123=\n work = [0 for i in range(capacity+1)] # (7): work=[0, 0, ..., 0, 0] (125): work=[0, 0, ..., 0, 0]\n for c in range(1, capacity+1): # (8): c=1 (13): c=2 ... (251): c=26\n candidates = [val + work[c-weight] # (9): NO CHANGE (11): candidates=[4, 1] ... (254): candidates=[23, 2, 27]\n for val,weight in zip(values,weights) if weight <= c] # (10): NO CHANGE (15): NO CHANGE ... (253): NO CHANGE\n work[c] = max(candidates) if candidates != [] else 0 # (12): work=[0, 4, ..., 0, 0] (17): work=[0, 4, ..., 0, 0] ... (255): work=[0, 2, ..., 26, 27]\n return work[-1]\ndef sol(inp=input): # (1): sol=\n n=int(inp()) # (3): n=23\n prices_a=list(map(int,inp().split())) # (4): prices_a=[0, 2, 1]\n prices_b=list(map(int,inp().split())) # (5): prices_b=[4, 0, 1]\n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n) # (6): values=[4, 0, 1], weights=[0, 2, 1], capacity=23\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA) # (124): values=[0, 2, 1], weights=[4, 0, 1], capacity=26\n return '{}'.format(valB)\nprint(sol()) # (2): inp=\n"], "anno_status": [true], "diff_content": " def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n- for c in range(1, capacity+1):\n- candidates = [val + work[c-weight]\n- for val,weight in zip(values,weights) if weight <= c]\n- work[c] = max(candidates) if candidates != [] else 0\n+ for v,w in zip(values,weights):\n+ for c in range(w, capacity+1):\n+ work[c]=max(work[c],work[c-w]+v)\n return work[-1]\n def sol(inp=input):\n n=int(inp())\n- prices_a=list(map(int,inp().split()))\n- prices_b=list(map(int,inp().split()))\n+ prices_a=list(map(int,inp().split()))+[1]\n+ prices_b=list(map(int,inp().split()))+[1]\n+ \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\n print(sol())\n", "FL_content": " def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n- for c in range(1, capacity+1):\n- candidates = [val + work[c-weight]\n- for val,weight in zip(values,weights) if weight <= c]\n- work[c] = max(candidates) if candidates != [] else 0\n return work[-1]\n def sol(inp=input):\n n=int(inp())\n- prices_a=list(map(int,inp().split()))\n- prices_b=list(map(int,inp().split()))\n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\n print(sol())\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 15 }, { "user_id": "u007808656", "problem_id": "p03008", "submission1_id": "s683065531", "submission2_id": "s949350374", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for c in range(1, capacity+1):\n candidates = [val + work[c-weight]\n for val,weight in zip(values,weights) if weight <= c]\n work[c] = max(candidates) if candidates != [] else 0\n return work[-1]\ndef sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)", "code2": "def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n for v,w in zip(values,weights):\n for c in range(w, capacity+1):\n work[c]=max(work[c],work[c-w]+v)\n return work[-1]\ndef sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\nprint(sol())", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560652954", "date2": "1560659184", "bleu_score": "0.8078120790331995", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "23\n0 3 1\n2 2 1\n", "actual_output": "", "expected_output": "37\n\n", "anno_code": ["def knapsack_123(values,weights,capacity): # (0): knapsack_123=\n work = [0 for i in range(capacity+1)]\n for c in range(1, capacity+1):\n candidates = [val + work[c-weight]\n for val,weight in zip(values,weights) if weight <= c]\n work[c] = max(candidates) if candidates != [] else 0\n return work[-1]\ndef sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)"], "anno_status": [true], "diff_content": " def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n- for c in range(1, capacity+1):\n- candidates = [val + work[c-weight]\n- for val,weight in zip(values,weights) if weight <= c]\n- work[c] = max(candidates) if candidates != [] else 0\n+ for v,w in zip(values,weights):\n+ for c in range(w, capacity+1):\n+ work[c]=max(work[c],work[c-w]+v)\n return work[-1]\n def sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n+ \n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\n+print(sol())\n", "FL_content": " def knapsack_123(values,weights,capacity):\n work = [0 for i in range(capacity+1)]\n- for c in range(1, capacity+1):\n- candidates = [val + work[c-weight]\n- for val,weight in zip(values,weights) if weight <= c]\n- work[c] = max(candidates) if candidates != [] else 0\n return work[-1]\n def sol(inp=input):\n n=int(inp())\n prices_a=list(map(int,inp().split()))+[1]\n prices_b=list(map(int,inp().split()))+[1]\n valA=knapsack_123(values=prices_b,weights=prices_a,capacity=n)\n valB=knapsack_123(values=prices_a,weights=prices_b,capacity=valA)\n return '{}'.format(valB)\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 14 }, { "user_id": "u594803920", "problem_id": "p03752", "submission1_id": "s199281832", "submission2_id": "s611818428", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\nli = list(map(int, input().split()))\nmin_ = 10**12\nfor i in range(1<>j)&1:\n can_look += 1\n if li[j] <= max_height:\n li_h.append(max_height+1)\n else:\n li_h.append(li[j])\n else:\n li_h.append(li[j])\n if can_look >= k:\n money = sum(li_h) - sum(li)\n min_ = min(min_, money)\n print(li_h)\n print(li)\n \nprint(min_)", "code2": "n, k = map(int, input().split())\nli = list(map(int, input().split()))\nmin_ = 10**12\nfor i in range(1<>j)&1:\n can_look += 1\n if li[j] <= max_height:\n li_h.append(max_height+1)\n else:\n li_h.append(li[j])\n else:\n li_h.append(li[j])\n if can_look >= k:\n money = sum(li_h) - sum(li)\n min_ = min(min_, money)\n\nprint(min_)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587877081", "date2": "1587877114", "bleu_score": "0.9342931478967209", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 4\n484 3774 3598 1733 2940\n", "actual_output": "[484, 3774, 3775, 3776, 2940]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3775, 3776, 2940]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3775, 1733, 3776]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3775, 1733, 3776]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3598, 3775, 3776]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3598, 3775, 3776]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3775, 3776, 3777]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3775, 3776, 3777]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3775, 3776, 3777]\n[484, 3774, 3598, 1733, 2940]\n[484, 3774, 3775, 3776, 3777]\n[484, 3774, 3598, 1733, 2940]\n1013\n", "expected_output": "1013\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=5, k=4\nli = list(map(int, input().split())) # (1): li=[484, 3774, 3598, 1733, 2940]\nmin_ = 10**12 # (2): min_=1000000000000\nfor i in range(1<>j)&1: # (18): NO CHANGE (24): NO CHANGE ... (1345): NO CHANGE\n can_look += 1 # (93): can_look=2 (132): can_look=2 ... (1346): can_look=5\n if li[j] <= max_height: # (94): NO CHANGE (133): NO CHANGE ... (1347): NO CHANGE\n li_h.append(max_height+1) # (179): li_h=[484, 3774, 3775] (218): li_h=[484, 3774, 3775] ... (1348): li_h=[484, 3774, 3775, 3776, 3777]\n else:\n li_h.append(li[j]) # (95): li_h=[484, 3774] (134): li_h=[484, 3774] ... (1324): li_h=[484, 3774]\n else:\n li_h.append(li[j]) # (19): li_h=[484, 3774] (25): li_h=[484, 3774, 3598] ... (1226): li_h=[484, 3774]\n if can_look >= k: # (39): NO CHANGE (76): NO CHANGE ... (1350): NO CHANGE\n money = sum(li_h) - sum(li) # (600): money=2220 (647): money=2220 ... (1351): money=3057\n min_ = min(min_, money) # (601): min_=2220 (648): NO CHANGE ... (1352): NO CHANGE\n print(li_h) # (602): NO CHANGE (649): NO CHANGE ... (1353): NO CHANGE\n print(li) # (603): NO CHANGE (650): NO CHANGE ... (1354): NO CHANGE\n \nprint(min_)"], "anno_status": [false], "diff_content": " n, k = map(int, input().split())\n li = list(map(int, input().split()))\n min_ = 10**12\n for i in range(1<>j)&1:\n can_look += 1\n if li[j] <= max_height:\n li_h.append(max_height+1)\n else:\n li_h.append(li[j])\n else:\n li_h.append(li[j])\n if can_look >= k:\n money = sum(li_h) - sum(li)\n min_ = min(min_, money)\n- print(li_h)\n- print(li)\n- \n+\n print(min_)\n", "FL_content": " n, k = map(int, input().split())\n li = list(map(int, input().split()))\n min_ = 10**12\n for i in range(1<>j)&1:\n can_look += 1\n if li[j] <= max_height:\n li_h.append(max_height+1)\n else:\n li_h.append(li[j])\n else:\n li_h.append(li[j])\n if can_look >= k:\n money = sum(li_h) - sum(li)\n min_ = min(min_, money)\n- print(li_h)\n- print(li)\n- \n print(min_)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 31 }, { "user_id": "u935842428", "problem_id": "p03752", "submission1_id": "s382918221", "submission2_id": "s667135213", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys, itertools\ninput = lambda: sys.stdin.readline().rstrip() \nsys.setrecursionlimit(10**7)\nINF = 10**20\ndef I(): return int(input())\ndef F(): return float(input())\ndef S(): return input()\ndef LI(): return [int(x) for x in input().split()]\ndef LI_(): return [int(x)-1 for x in input().split()]\ndef LF(): return [float(x) for x in input().split()]\ndef LS(): return input().split()\n\ndef resolve():\n N, K = LI()\n a = LI()\n ans = INF\n \n for i in itertools.combinations(range(1, N), K-1):\n cost_sum = 0\n for j, e in enumerate(i):\n cost_sum += (a[0]+j+1)-a[e]\n ans = min(cost_sum, ans)\n\n print(ans)\n\nif __name__ == '__main__':\n resolve()", "code2": "import sys, itertools\ninput = lambda: sys.stdin.readline().rstrip() \nsys.setrecursionlimit(10**7)\nINF = 10**20\ndef I(): return int(input())\ndef F(): return float(input())\ndef S(): return input()\ndef LI(): return [int(x) for x in input().split()]\ndef LI_(): return [int(x)-1 for x in input().split()]\ndef LF(): return [float(x) for x in input().split()]\ndef LS(): return input().split()\n\ndef resolve():\n N, K = LI()\n a = LI()\n ans = INF\n for i in range(2**N):\n cost_sum = 0\n cnt = 0\n prev_height = 0\n for j in range(N):\n if (i>>j)&1:\n if a[j]<=prev_height:\n cost_sum += (prev_height+1)-a[j]\n prev_height += 1\n else:\n prev_height = a[j]\n cnt += 1\n prev_height = max(a[j], prev_height)\n if cnt>=K:\n ans = min(cost_sum, ans)\n\n print(ans)\n\nif __name__ == '__main__':\n resolve()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589857805", "date2": "1589942261", "bleu_score": "0.6643264237564614", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 101, "input": "5 5\n2541 3649 1332 110 2597\n", "actual_output": "2486\n", "expected_output": "6914\n\n", "anno_code": ["import sys, itertools\ninput = lambda: sys.stdin.readline().rstrip() # (0): input= at 0x000001C7EE5B9BD0>\nsys.setrecursionlimit(10**7) # (1): NO CHANGE\nINF = 10**20 # (2): INF=100000000000000000000, I=, F=, S=, LI=, LI_=, LF=, LS=\ndef I(): return int(input())\ndef F(): return float(input())\ndef S(): return input()\ndef LI(): return [int(x) for x in input().split()]\ndef LI_(): return [int(x)-1 for x in input().split()]\ndef LF(): return [float(x) for x in input().split()]\ndef LS(): return input().split()\n\ndef resolve(): # (3): resolve=\n N, K = LI()\n a = LI()\n ans = INF\n \n for i in itertools.combinations(range(1, N), K-1):\n cost_sum = 0\n for j, e in enumerate(i):\n cost_sum += (a[0]+j+1)-a[e]\n ans = min(cost_sum, ans)\n\n print(ans)\n\nif __name__ == '__main__':\n resolve()"], "anno_status": [true], "diff_content": " import sys, itertools\n input = lambda: sys.stdin.readline().rstrip() \n sys.setrecursionlimit(10**7)\n INF = 10**20\n def I(): return int(input())\n def F(): return float(input())\n def S(): return input()\n def LI(): return [int(x) for x in input().split()]\n def LI_(): return [int(x)-1 for x in input().split()]\n def LF(): return [float(x) for x in input().split()]\n def LS(): return input().split()\n \n def resolve():\n N, K = LI()\n a = LI()\n ans = INF\n- \n- for i in itertools.combinations(range(1, N), K-1):\n+ for i in range(2**N):\n cost_sum = 0\n- for j, e in enumerate(i):\n- cost_sum += (a[0]+j+1)-a[e]\n- ans = min(cost_sum, ans)\n+ cnt = 0\n+ prev_height = 0\n+ for j in range(N):\n+ if (i>>j)&1:\n+ if a[j]<=prev_height:\n+ cost_sum += (prev_height+1)-a[j]\n+ prev_height += 1\n+ else:\n+ prev_height = a[j]\n+ cnt += 1\n+ prev_height = max(a[j], prev_height)\n+ if cnt>=K:\n+ ans = min(cost_sum, ans)\n \n print(ans)\n \n if __name__ == '__main__':\n resolve()\n", "FL_content": " import sys, itertools\n input = lambda: sys.stdin.readline().rstrip() \n sys.setrecursionlimit(10**7)\n INF = 10**20\n def I(): return int(input())\n def F(): return float(input())\n def S(): return input()\n def LI(): return [int(x) for x in input().split()]\n def LI_(): return [int(x)-1 for x in input().split()]\n def LF(): return [float(x) for x in input().split()]\n def LS(): return input().split()\n \n def resolve():\n N, K = LI()\n a = LI()\n ans = INF\n- \n- for i in itertools.combinations(range(1, N), K-1):\n cost_sum = 0\n- for j, e in enumerate(i):\n- cost_sum += (a[0]+j+1)-a[e]\n- ans = min(cost_sum, ans)\n \n print(ans)\n \n if __name__ == '__main__':\n resolve()\n", "added_lines": 14, "removed_lines": 5, "code1_lines": 27 }, { "user_id": "u459419927", "problem_id": "p03752", "submission1_id": "s722051057", "submission2_id": "s597953364", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=list(map(int,input().split()))\nheight=list(map(int,input().split()))\nans=10**10\ncount=0\nfor x in range(1, N):\n if height[0] < height[x]:\n count += 1\nif count>=K:\n print(0)\n exit()\nfor i in range(2**N):\n cost=0\n height2=height.copy()\n for j in range(N):\n if i>>j&1:\n count=0\n for k in range(j):\n if height2[k]>=height2[j]:\n cost+=height2[k]-height2[j]+1\n height2[j]+=height2[k]-height2[j]+1\n for x in range(1,N):\n if height2[0]cost and count==K-1:\n ans=cost\n\n\nprint(ans)", "code2": "N, K = list(map(int, input().split()))\nheight = list(map(int, input().split()))\nans = 10 ** 10\nif N==K:\n cost=0\n for i in range(1,N):\n if height[i-1]>=height[i]:\n cost+=height[i-1]-height[i]+1\n height[i]+=height[i-1]-height[i]+1\n print(cost)\n exit()\nfor i in range(2 ** N):\n count=1\n cost = 0\n height2 = height.copy()\n for j in range(N):\n if i >> j & 1:\n if j!=0:\n tarou=max(height2[:j])\n if height2[j]<=tarou:\n cost+=tarou-height2[j]+1\n height2[j]+=tarou-height2[j]+1\n count+=1\n else:count+=1\n \n \n \n \n \n if ans > cost and count >= K:\n ans = cost\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591218495", "date2": "1591221772", "bleu_score": "0.7426425162752399", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 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, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1], "code1_test_score": 47, "total_score": 101, "input": "5 5\n862 3170 5890 212 3424\n", "actual_output": "5679\n", "expected_output": "8147\n\n", "anno_code": ["N,K=list(map(int,input().split())) # (0): N=5, K=5\nheight=list(map(int,input().split())) # (1): height=[862, 3170, 5890, 212, 3424]\nans=10**10 # (2): ans=10000000000\ncount=0 # (3): count=0\nfor x in range(1, N): # (4): x=1 (7): x=2 ... (15): NO CHANGE\n if height[0] < height[x]: # (5): NO CHANGE (8): NO CHANGE ... (13): NO CHANGE\n count += 1 # (6): count=1 (9): count=2 (14): count=3\nif count>=K: # (16): NO CHANGE\n print(0)\n exit()\nfor i in range(2**N): # (17): i=0 (31): i=1 ... (2154): NO CHANGE\n cost=0 # (18): cost=0 (32): NO CHANGE ... (2034): cost=0\n height2=height.copy() # (19): height2=[862, 3170, 5890, 212, 3424] (33): NO CHANGE ... (2035): height2=[862, 3170, 5890, 212, 3424]\n for j in range(N): # (20): j=0 (22): j=1 ... (2153): NO CHANGE\n if i>>j&1: # (21): NO CHANGE (23): NO CHANGE ... (2124): NO CHANGE\n count=0 # (36): count=0 (67): count=0 ... (2125): count=0\n for k in range(j): # (37): NO CHANGE (68): k=0 ... (2138): NO CHANGE\n if height2[k]>=height2[j]: # (69): NO CHANGE (115): NO CHANGE ... (2135): NO CHANGE\n cost+=height2[k]-height2[j]+1 # (347): cost=651 (351): cost=2959 ... (2136): cost=8147\n height2[j]+=height2[k]-height2[j]+1 # (348): height2=[862, 3170, 5890, 863, 3424] (352): height2=[862, 3170, 5890, 3171, 3424] ... (2137): height2=[862, 3170, 5890, 5891, 5892]\n for x in range(1,N): # (38): x=1 (41): x=2 ... (2151): NO CHANGE\n if height2[0]cost and count==K-1: # (50): NO CHANGE (83): NO CHANGE ... (2152): NO CHANGE\n ans=cost # (372): ans=5679\n\n\nprint(ans)"], "anno_status": [true], "diff_content": "-N,K=list(map(int,input().split()))\n-height=list(map(int,input().split()))\n-ans=10**10\n-count=0\n-for x in range(1, N):\n- if height[0] < height[x]:\n- count += 1\n-if count>=K:\n- print(0)\n- exit()\n-for i in range(2**N):\n+N, K = list(map(int, input().split()))\n+height = list(map(int, input().split()))\n+ans = 10 ** 10\n+if N==K:\n cost=0\n- height2=height.copy()\n+ for i in range(1,N):\n+ if height[i-1]>=height[i]:\n+ cost+=height[i-1]-height[i]+1\n+ height[i]+=height[i-1]-height[i]+1\n+ print(cost)\n+ exit()\n+for i in range(2 ** N):\n+ count=1\n+ cost = 0\n+ height2 = height.copy()\n for j in range(N):\n- if i>>j&1:\n- count=0\n- for k in range(j):\n- if height2[k]>=height2[j]:\n- cost+=height2[k]-height2[j]+1\n- height2[j]+=height2[k]-height2[j]+1\n- for x in range(1,N):\n- if height2[0]> j & 1:\n+ if j!=0:\n+ tarou=max(height2[:j])\n+ if height2[j]<=tarou:\n+ cost+=tarou-height2[j]+1\n+ height2[j]+=tarou-height2[j]+1\n count+=1\n-\n- if ans>cost and count==K-1:\n- ans=cost\n-\n+ else:count+=1\n+ \n+ \n+ \n+ \n+ \n+ if ans > cost and count >= K:\n+ ans = cost\n \n print(ans)\n", "FL_content": "-N,K=list(map(int,input().split()))\n-height=list(map(int,input().split()))\n-ans=10**10\n-count=0\n-for x in range(1, N):\n- if height[0] < height[x]:\n- count += 1\n-if count>=K:\n- print(0)\n- exit()\n-for i in range(2**N):\n cost=0\n- height2=height.copy()\n for j in range(N):\n- if i>>j&1:\n- count=0\n- for k in range(j):\n- if height2[k]>=height2[j]:\n- cost+=height2[k]-height2[j]+1\n- height2[j]+=height2[k]-height2[j]+1\n- for x in range(1,N):\n- if height2[0]cost and count==K-1:\n- ans=cost\n-\n \n print(ans)\n", "added_lines": 28, "removed_lines": 24, "code1_lines": 29 }, { "user_id": "u462329577", "problem_id": "p03752", "submission1_id": "s441156214", "submission2_id": "s223925506", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k = map(int,input().split())\na = list(map(int,input().split()))\nans = 10**11\n\n\nfor i in range(2**(n-1)):\n select = [0]\n len_select = 1\n for j in range(n-1):\n if i >> j & 1 and len_select < k:\n select.append(j+1)\n len_select += 1\n \n \n ok = 1\n \n for m in select:\n for l in range(n):\n if l in select: continue\n if l < k and a[l] >= a[m]:\n \n ok = 0\n if ok == 0 or len_select < k: continue\n else:\n ans_i = 0\n pre_val = a[0]\n for j in range(1,k):\n \n if pre_val >= a[select[j]]:\n ans_i += pre_val+1 - a[select[j]]\n pre_val += 1\n else:\n pre_val = a[select[j]]\n ans = min(ans,ans_i)\nprint(ans)", "code2": "n,k = map(int,input().split())\na = list(map(int,input().split()))\nans = 10**11\n\n\nfor i in range(2**(n-1)):\n select = [0]\n len_select = 1\n for j in range(n-1):\n if i >> j & 1 and len_select < k:\n select.append(j+1)\n len_select += 1\n \n \n ok = 1\n \n for m in select:\n for l in range(n):\n if l in select: continue\n if l < m and a[l] >= a[m]:\n \n ok = 0\n if ok == 0 or len_select < k: continue\n else:\n ans_i = 0\n pre_val = a[0]\n for j in range(1,k):\n \n if pre_val >= a[select[j]]:\n ans_i += pre_val+1 - a[select[j]]\n pre_val += 1\n else:\n pre_val = a[select[j]]\n ans = min(ans,ans_i)\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585505847", "date2": "1585506152", "bleu_score": "0.9963221568366605", "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], "code1_test_score": 100, "total_score": 101, "input": "5 4\n484 3774 3598 1733 2940\n", "actual_output": "2220\n", "expected_output": "1013\n\n", "anno_code": ["n,k = map(int,input().split()) # (0): n=5, k=4\na = list(map(int,input().split())) # (1): a=[484, 3774, 3598, 1733, 2940]\nans = 10**11 # (2): ans=100000000000\n\n\nfor i in range(2**(n-1)): # (3): i=0 (37): i=1 ... (1027): NO CHANGE\n select = [0] # (4): select=[0] (38): NO CHANGE ... (940): select=[0]\n len_select = 1 # (5): len_select=1 (39): NO CHANGE ... (941): len_select=1\n for j in range(n-1): # (6): j=0 (8): j=1 ... (956): NO CHANGE\n if i >> j & 1 and len_select < k: # (7): NO CHANGE (9): NO CHANGE ... (955): NO CHANGE\n select.append(j+1) # (42): select=[0, 1] (93): select=[0, 2] ... (952): select=[0, 1, 2, 3]\n len_select += 1 # (43): len_select=2 (94): len_select=2 ... (953): len_select=4\n \n \n ok = 1 # (15): ok=1 (51): ok=1 ... (957): ok=1\n \n for m in select: # (16): m=0 (35): NO CHANGE ... (1010): NO CHANGE\n for l in range(n): # (17): l=0 (19): l=1 ... (1009): NO CHANGE\n if l in select: continue # (18): NO CHANGE (20): NO CHANGE ... (1007): NO CHANGE\n if l < k and a[l] >= a[m]: # (21): NO CHANGE (25): NO CHANGE ... (1008): NO CHANGE\n \n ok = 0 # (22): ok=0 (26): NO CHANGE ... (929): NO CHANGE\n if ok == 0 or len_select < k: continue # (36): NO CHANGE (85): NO CHANGE ... (1011): NO CHANGE\n else:\n ans_i = 0 # (449): ans_i=0 (1012): ans_i=0\n pre_val = a[0] # (450): pre_val=484 (1013): pre_val=484\n for j in range(1,k): # (451): j=1 (454): j=2 ... (1025): NO CHANGE\n \n if pre_val >= a[select[j]]: # (452): NO CHANGE (455): NO CHANGE ... (1022): NO CHANGE\n ans_i += pre_val+1 - a[select[j]] # (456): ans_i=177 (460): ans_i=2220 ... (1023): ans_i=2220\n pre_val += 1 # (457): pre_val=3775 (461): pre_val=3776 ... (1024): pre_val=3776\n else:\n pre_val = a[select[j]] # (453): pre_val=3774 (1016): pre_val=3774\n ans = min(ans,ans_i) # (463): ans=2220 (1026): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " n,k = map(int,input().split())\n a = list(map(int,input().split()))\n ans = 10**11\n \n \n for i in range(2**(n-1)):\n select = [0]\n len_select = 1\n for j in range(n-1):\n if i >> j & 1 and len_select < k:\n select.append(j+1)\n len_select += 1\n \n \n ok = 1\n \n for m in select:\n for l in range(n):\n if l in select: continue\n- if l < k and a[l] >= a[m]:\n+ if l < m and a[l] >= a[m]:\n \n ok = 0\n if ok == 0 or len_select < k: continue\n else:\n ans_i = 0\n pre_val = a[0]\n for j in range(1,k):\n \n if pre_val >= a[select[j]]:\n ans_i += pre_val+1 - a[select[j]]\n pre_val += 1\n else:\n pre_val = a[select[j]]\n ans = min(ans,ans_i)\n print(ans)\n", "FL_content": " n,k = map(int,input().split())\n a = list(map(int,input().split()))\n ans = 10**11\n \n \n for i in range(2**(n-1)):\n select = [0]\n len_select = 1\n for j in range(n-1):\n if i >> j & 1 and len_select < k:\n select.append(j+1)\n len_select += 1\n \n \n ok = 1\n \n for m in select:\n for l in range(n):\n if l in select: continue\n- if l < k and a[l] >= a[m]:\n \n ok = 0\n if ok == 0 or len_select < k: continue\n else:\n ans_i = 0\n pre_val = a[0]\n for j in range(1,k):\n \n if pre_val >= a[select[j]]:\n ans_i += pre_val+1 - a[select[j]]\n pre_val += 1\n else:\n pre_val = a[select[j]]\n ans = min(ans,ans_i)\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 35 }, { "user_id": "u314089899", "problem_id": "p03752", "submission1_id": "s718037797", "submission2_id": "s701671850", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\nimport copy\n\ndef main():\n N,K = map(int, input().split())\n a_list = [int(e) for e in input().split()]\n\n \n \n \n \n\n ans = 10**100\n\n l = [i for i in range(0,N)]\n\n for v in itertools.combinations(l,K): \n copied_a_list = copy.copy(a_list)\n \n v = set(v)\n left_max = copied_a_list[0]-1\n temp_ans = 0\n \n for i in range(N): \n if i in v:\n temp_ans += max(0,left_max+1 - copied_a_list[i])\n copied_a_list[i] = left_max+1\n \n if copied_a_list[i] > left_max:\n left_max = copied_a_list[i]\n \n print(v,copied_a_list,temp_ans)\n \n if temp_ans < ans:\n ans = temp_ans\n \n print(ans)\n\nmain()", "code2": "import itertools\nimport copy\n\ndef main():\n N,K = map(int, input().split())\n a_list = [int(e) for e in input().split()]\n\n \n \n \n \n\n ans = 10**100\n\n l = [i for i in range(0,N)]\n\n for v in itertools.combinations(l,K): \n copied_a_list = copy.copy(a_list)\n \n v = set(v)\n left_max = copied_a_list[0]-1\n temp_ans = 0\n \n for i in range(N): \n if i in v:\n temp_ans += max(0,left_max+1 - copied_a_list[i])\n copied_a_list[i] = max(left_max+1,copied_a_list[i])\n \n if copied_a_list[i] > left_max:\n left_max = copied_a_list[i]\n \n \n \n if temp_ans < ans:\n ans = temp_ans\n \n print(ans)\n\nmain()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598847825", "date2": "1598937503", "bleu_score": "0.9732847554558941", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 5\n1128 875 11055 3469 5003\n", "actual_output": "{0, 1, 2, 3, 4} [1128, 1129, 1130, 1131, 1132] 254\n254\n", "expected_output": "13895\n\n", "anno_code": ["import itertools\nimport copy\n\ndef main(): # (0): main=\n N,K = map(int, input().split()) # (2): N=5, K=5\n a_list = [int(e) for e in input().split()] # (3): a_list=[1128, 875, 11055, 3469, 5003]\n\n \n \n \n \n\n ans = 10**100 # (4): ans=10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n\n l = [i for i in range(0,N)] # (5): l=[0, 1, 2, 3, 4]\n\n for v in itertools.combinations(l,K): # (6): v=(0, 1, 2, 3, 4) (45): NO CHANGE\n copied_a_list = copy.copy(a_list) # (7): copied_a_list=[1128, 875, 11055, 3469, 5003]\n \n v = set(v) # (8): v={0, 1, 2, 3, 4}\n left_max = copied_a_list[0]-1 # (9): left_max=1127\n temp_ans = 0 # (10): temp_ans=0\n \n for i in range(N): # (11): i=0 (17): i=1 ... (41): NO CHANGE\n if i in v: # (12): NO CHANGE (18): NO CHANGE ... (36): NO CHANGE\n temp_ans += max(0,left_max+1 - copied_a_list[i]) # (13): NO CHANGE (19): temp_ans=254 ... (37): NO CHANGE\n copied_a_list[i] = left_max+1 # (14): NO CHANGE (20): copied_a_list=[1128, 1129, 11055, 3469, 5003] ... (38): copied_a_list=[1128, 1129, 1130, 1131, 1132]\n \n if copied_a_list[i] > left_max: # (15): NO CHANGE (21): NO CHANGE ... (39): NO CHANGE\n left_max = copied_a_list[i] # (16): left_max=1128 (22): left_max=1129 ... (40): left_max=1132\n \n print(v,copied_a_list,temp_ans) # (42): NO CHANGE\n \n if temp_ans < ans: # (43): NO CHANGE\n ans = temp_ans # (44): ans=254\n \n print(ans)\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import itertools\n import copy\n \n def main():\n N,K = map(int, input().split())\n a_list = [int(e) for e in input().split()]\n \n \n \n \n \n \n ans = 10**100\n \n l = [i for i in range(0,N)]\n \n for v in itertools.combinations(l,K): \n copied_a_list = copy.copy(a_list)\n \n v = set(v)\n left_max = copied_a_list[0]-1\n temp_ans = 0\n \n for i in range(N): \n if i in v:\n temp_ans += max(0,left_max+1 - copied_a_list[i])\n- copied_a_list[i] = left_max+1\n+ copied_a_list[i] = max(left_max+1,copied_a_list[i])\n \n if copied_a_list[i] > left_max:\n left_max = copied_a_list[i]\n \n- print(v,copied_a_list,temp_ans)\n+ \n \n if temp_ans < ans:\n ans = temp_ans\n \n print(ans)\n \n main()\n", "FL_content": " import itertools\n import copy\n \n def main():\n N,K = map(int, input().split())\n a_list = [int(e) for e in input().split()]\n \n \n \n \n \n \n ans = 10**100\n \n l = [i for i in range(0,N)]\n \n for v in itertools.combinations(l,K): \n copied_a_list = copy.copy(a_list)\n \n v = set(v)\n left_max = copied_a_list[0]-1\n temp_ans = 0\n \n for i in range(N): \n if i in v:\n temp_ans += max(0,left_max+1 - copied_a_list[i])\n- copied_a_list[i] = left_max+1\n \n if copied_a_list[i] > left_max:\n left_max = copied_a_list[i]\n \n- print(v,copied_a_list,temp_ans)\n \n if temp_ans < ans:\n ans = temp_ans\n \n print(ans)\n \n main()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 39 }, { "user_id": "u033602950", "problem_id": "p03752", "submission1_id": "s767180718", "submission2_id": "s921594187", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k = list(map(int, input().split()))\na=list(map(int, input().split()))\n\nans=[]\nfor i in range(1<>u&1):\n left_max=max(use[:u])\n cst+=left_max-use[u]+1\n use[u]= left_max+1\n ans.append(cst) \nprint(min(ans))\n", "code2": "n,k = list(map(int, input().split()))\na=list(map(int, input().split()))\n\nans=[]\nfor i in range(1<>u&1):\n left_max=max(use[:u])\n cst+=left_max-use[u]+1 if left_max>=use[u] else 0\n use[u]= max(left_max+1, use[u])\n ans.append(cst)\nprint(min(ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589352207", "date2": "1589352823", "bleu_score": "0.8925164742006294", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 101, "input": "5 5\n1993 875 9355 3469 5003\n", "actual_output": "-10720\n", "expected_output": "11360\n\n", "anno_code": ["n,k = list(map(int, input().split())) # (0): n=5, k=5\na=list(map(int, input().split())) # (1): a=[1993, 875, 9355, 3469, 5003]\n\nans=[] # (2): ans=[]\nfor i in range(1<>u&1): # (70): NO CHANGE (75): NO CHANGE ... (85): NO CHANGE\n left_max=max(use[:u]) # (71): left_max=1993 (76): left_max=1994 ... (86): left_max=1996\n cst+=left_max-use[u]+1 # (72): cst=1119 (77): cst=-6241 ... (87): cst=-10720\n use[u]= left_max+1 # (73): use=[1993, 1994, 9355, 3469, 5003] (78): use=[1993, 1994, 1995, 3469, 5003] ... (88): use=[1993, 1994, 1995, 1996, 1997]\n ans.append(cst) # (90): ans=[-10720]\nprint(min(ans))\n"], "anno_status": [true], "diff_content": " n,k = list(map(int, input().split()))\n a=list(map(int, input().split()))\n \n ans=[]\n for i in range(1<>u&1):\n left_max=max(use[:u])\n- cst+=left_max-use[u]+1\n- use[u]= left_max+1\n- ans.append(cst) \n+ cst+=left_max-use[u]+1 if left_max>=use[u] else 0\n+ use[u]= max(left_max+1, use[u])\n+ ans.append(cst)\n print(min(ans))\n \n", "FL_content": " n,k = list(map(int, input().split()))\n a=list(map(int, input().split()))\n \n ans=[]\n for i in range(1<>u&1):\n left_max=max(use[:u])\n- cst+=left_max-use[u]+1\n- use[u]= left_max+1\n- ans.append(cst) \n print(min(ans))\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u899782392", "problem_id": "p03752", "submission1_id": "s332336077", "submission2_id": "s965747280", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = sum(A)\nfor key in range(1 << N):\n if bin(key).count('1') < K:\n continue\n cost = 0\n height = 0\n for i in range(N):\n if not (key & (1 << i)):\n height = max(A[i], height)\n continue\n height = max(A[i], height+1)\n cost += height - A[i]\n ans = min(ans, cost)\nprint(ans)\n\n\n\n\n", "code2": "N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = float('inf')\nfor key in range(1 << N):\n if bin(key).count('1') < K:\n continue\n cost = 0\n height = 0\n for i in range(N):\n if not (key & (1 << i)):\n height = max(A[i], height)\n continue\n height = max(A[i], height+1)\n cost += height - A[i]\n ans = min(ans, cost)\nprint(ans)\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594688244", "date2": "1594688331", "bleu_score": "0.9702141120915577", "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, 0, 0, 0, 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, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 84, "total_score": 101, "input": "5 5\n1993 875 26226 3469 5003\n", "actual_output": "37566\n", "expected_output": "45102\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=5, K=5\nA = list(map(int, input().split())) # (1): A=[1993, 875, 26226, 3469, 5003]\n\nans = sum(A) # (2): ans=37566\nfor key in range(1 << N): # (3): key=0 (6): key=1 ... (122): NO CHANGE\n if bin(key).count('1') < K: # (4): NO CHANGE (7): NO CHANGE ... (97): NO CHANGE\n continue # (5): NO CHANGE (8): NO CHANGE ... (95): NO CHANGE\n cost = 0 # (98): cost=0\n height = 0 # (99): height=0\n for i in range(N): # (100): i=0 (104): i=1 ... (120): NO CHANGE\n if not (key & (1 << i)): # (101): NO CHANGE (105): NO CHANGE ... (117): NO CHANGE\n height = max(A[i], height)\n continue\n height = max(A[i], height+1) # (102): height=1993 (106): height=1994 ... (118): height=26228\n cost += height - A[i] # (103): NO CHANGE (107): cost=1119 ... (119): cost=45102\n ans = min(ans, cost) # (121): NO CHANGE\nprint(ans)\n\n\n\n\n"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n-ans = sum(A)\n+ans = float('inf')\n for key in range(1 << N):\n if bin(key).count('1') < K:\n continue\n cost = 0\n height = 0\n for i in range(N):\n if not (key & (1 << i)):\n height = max(A[i], height)\n continue\n height = max(A[i], height+1)\n cost += height - A[i]\n ans = min(ans, cost)\n print(ans)\n \n \n \n-\n-\n", "FL_content": " N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n-ans = sum(A)\n for key in range(1 << N):\n if bin(key).count('1') < K:\n continue\n cost = 0\n height = 0\n for i in range(N):\n if not (key & (1 << i)):\n height = max(A[i], height)\n continue\n height = max(A[i], height+1)\n cost += height - A[i]\n ans = min(ans, cost)\n print(ans)\n \n \n \n-\n-\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 22 }, { "user_id": "u780565479", "problem_id": "p03752", "submission1_id": "s141174877", "submission2_id": "s068840594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k = map(int,input().split())\na = [int(x) for x in input().split()]\n_min = 1145141919810\nfor i in range(2**(n-1)):\n ctr = 0\n val = 0\n flag = 0\n h_max = a[0]\n for j in range(n-1):\n if (i>>j)&1:\n ctr+=1\n h_max = h_max+1 if h_max>=a[j+1] else a[j+1]\n val+=h_max-a[j+1]\n if ctr>=k-1:\n flag=1\n break\n if val<_min and flag and h_max<=10**9:\n _min = val\nprint(_min)", "code2": "n,k = map(int,input().split())\na = [int(x) for x in input().split()]\n_min = 1145141919810\nfor i in range(2**(n-1)):\n ctr = 0\n val = 0\n h_max = a[0]\n for j in range(n-1):\n if (i>>j)&1:\n ctr+=1\n h_max = h_max+1 if h_max>=a[j+1] else a[j+1]\n val+=h_max-a[j+1]\n if h_max>j)&1: # (9): NO CHANGE (11): NO CHANGE ... (244): NO CHANGE\n ctr+=1 # (25): ctr=1 (42): ctr=1 ... (245): ctr=1\n h_max = h_max+1 if h_max>=a[j+1] else a[j+1] # (26): h_max=5961 (43): h_max=5961 ... (246): h_max=5961\n val+=h_max-a[j+1] # (27): val=2791 (44): val=2363 ... (247): val=2791\n if ctr>=k-1: # (28): NO CHANGE (45): NO CHANGE ... (248): NO CHANGE\n flag=1 # (29): flag=1 (46): flag=1 ... (249): flag=1\n break # (30): NO CHANGE (47): NO CHANGE ... (250): NO CHANGE\n if val<_min and flag and h_max<=10**9: # (17): NO CHANGE (31): NO CHANGE ... (251): NO CHANGE\n _min = val # (32): _min=2791 (49): _min=2363\nprint(_min)"], "anno_status": [true], "diff_content": " n,k = map(int,input().split())\n a = [int(x) for x in input().split()]\n _min = 1145141919810\n for i in range(2**(n-1)):\n ctr = 0\n val = 0\n- flag = 0\n h_max = a[0]\n for j in range(n-1):\n if (i>>j)&1:\n ctr+=1\n h_max = h_max+1 if h_max>=a[j+1] else a[j+1]\n val+=h_max-a[j+1]\n- if ctr>=k-1:\n- flag=1\n- break\n- if val<_min and flag and h_max<=10**9:\n+ if h_max>j)&1:\n ctr+=1\n h_max = h_max+1 if h_max>=a[j+1] else a[j+1]\n val+=h_max-a[j+1]\n- if ctr>=k-1:\n- flag=1\n- break\n- if val<_min and flag and h_max<=10**9:\n _min = val\n print(_min)\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 19 }, { "user_id": "u840310460", "problem_id": "p03752", "submission1_id": "s908106740", "submission2_id": "s780861079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = [int(i)for i in input().split()]\nA = [int(i) for i in input().split()]\n\n\nans = float(\"inf\")\nfor b in range(2 ** N):\n cnt = 0\n cost = 0\n height = A[0]\n for i in range(N):\n if i == 0:\n continue\n if (b >> i) & 1:\n cnt += 1\n cost += height - A[i] + 1\n height += 1\n if cnt + 1 == K:\n ans = min(ans, cost)\n\nprint(ans)\n", "code2": "N, K = [int(i)for i in input().split()]\nA = [int(i) for i in input().split()]\n\n\nans = float(\"inf\")\nfor b in range(2 ** (N - 1)):\n cnt = 0\n cost = 0\n height = A[0]\n for i in range(N - 1):\n if height - A[i + 1] < 0:\n cnt += 1\n height = A[i + 1]\n elif (b >> i) & 1:\n cnt += 1\n cost += height - A[i + 1] + 1\n height += 1\n if cnt + 1 >= K:\n ans = min(ans, cost)\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594771193", "date2": "1594773380", "bleu_score": "0.8224776556903666", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 101, "input": "5 5\n1993 607 9355 3469 4674\n", "actual_output": "-10123\n", "expected_output": "11957\n\n", "anno_code": ["N, K = [int(i)for i in input().split()] # (0): N=5, K=5\nA = [int(i) for i in input().split()] # (1): A=[1993, 607, 9355, 3469, 4674]\n\n\nans = float(\"inf\") # (2): ans=inf\nfor b in range(2 ** N): # (3): b=0 (24): b=1 ... (869): NO CHANGE\n cnt = 0 # (4): cnt=0 (25): NO CHANGE ... (836): cnt=0\n cost = 0 # (5): cost=0 (26): NO CHANGE ... (837): cost=0\n height = A[0] # (6): height=1993 (27): NO CHANGE ... (838): height=1993\n for i in range(N): # (7): i=0 (10): i=1 ... (866): NO CHANGE\n if i == 0: # (8): NO CHANGE (11): NO CHANGE ... (861): NO CHANGE\n continue # (9): NO CHANGE (30): NO CHANGE ... (841): NO CHANGE\n if (b >> i) & 1: # (12): NO CHANGE (15): NO CHANGE ... (862): NO CHANGE\n cnt += 1 # (55): cnt=1 (79): cnt=1 ... (863): cnt=4\n cost += height - A[i] + 1 # (56): cost=1387 (80): cost=1387 ... (864): cost=-10123\n height += 1 # (57): height=1994 (81): height=1994 ... (865): height=1997\n if cnt + 1 == K: # (23): NO CHANGE (44): NO CHANGE ... (867): NO CHANGE\n ans = min(ans, cost) # (834): ans=-10123 (868): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " N, K = [int(i)for i in input().split()]\n A = [int(i) for i in input().split()]\n \n \n ans = float(\"inf\")\n-for b in range(2 ** N):\n+for b in range(2 ** (N - 1)):\n cnt = 0\n cost = 0\n height = A[0]\n- for i in range(N):\n- if i == 0:\n- continue\n- if (b >> i) & 1:\n+ for i in range(N - 1):\n+ if height - A[i + 1] < 0:\n cnt += 1\n- cost += height - A[i] + 1\n+ height = A[i + 1]\n+ elif (b >> i) & 1:\n+ cnt += 1\n+ cost += height - A[i + 1] + 1\n height += 1\n- if cnt + 1 == K:\n+ if cnt + 1 >= K:\n ans = min(ans, cost)\n \n print(ans)\n-\n", "FL_content": " N, K = [int(i)for i in input().split()]\n A = [int(i) for i in input().split()]\n \n \n ans = float(\"inf\")\n-for b in range(2 ** N):\n cnt = 0\n cost = 0\n height = A[0]\n- for i in range(N):\n- if i == 0:\n- continue\n- if (b >> i) & 1:\n cnt += 1\n- cost += height - A[i] + 1\n height += 1\n- if cnt + 1 == K:\n ans = min(ans, cost)\n \n print(ans)\n-\n", "added_lines": 8, "removed_lines": 8, "code1_lines": 21 }, { "user_id": "u579699847", "problem_id": "p03752", "submission1_id": "s228254997", "submission2_id": "s608655021", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def LI(): return list(map(int,input().split()))\nN,K = LI()\na = LI()\nans = float('INF')\nfor i in range(2**(N-1)):\n bit = [i>>j&1 for j in range(N-1)]\n if K-1!=bit.count(1):\n continue\n NO_bit1 = [k for k in range(N-1) if bit[k]==1]\n temp = 0\n for l,x in enumerate(NO_bit1,1):\n if a[x+1]>=a[0]+l:\n continue\n temp += (a[0]+l)-a[x+1]\n ans = min(ans,temp)\nprint(ans)\n", "code2": "def LI(): return list(map(int,input().split()))\nN,K = LI()\na = LI()\nans = float('INF')\nfor i in range(2**(N-1)):\n bit = [i>>j&1 for j in range(N-1)]\n if K-1!=bit.count(1):\n continue\n temp,kijun = 0,a[0]\n for k in range(N-1):\n if bit[k]==0:\n kijun = max(kijun,a[k+1])\n else:\n if a[k+1]>=kijun+1:\n kijun = a[k+1]\n continue\n temp += (kijun+1)-a[k+1]\n kijun += 1\n ans = min(ans,temp)\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588317303", "date2": "1588321174", "bleu_score": "0.7035487168450685", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 33, "total_score": 101, "input": "5 5\n862 3170 5890 212 3424\n", "actual_output": "653\n", "expected_output": "8147\n\n", "anno_code": ["def LI(): return list(map(int,input().split()))\nN,K = LI() # (0): N=5, K=5\na = LI() # (1): a=[862, 3170, 5890, 212, 3424]\nans = float('INF') # (2): ans=inf\nfor i in range(2**(N-1)): # (3): i=0 (7): i=1 ... (82): NO CHANGE\n bit = [i>>j&1 for j in range(N-1)] # (4): bit=[0, 0, 0, 0] (8): bit=[1, 0, 0, 0] ... (64): bit=[1, 1, 1, 1]\n if K-1!=bit.count(1): # (5): NO CHANGE (9): NO CHANGE ... (65): NO CHANGE\n continue # (6): NO CHANGE (10): NO CHANGE ... (62): NO CHANGE\n NO_bit1 = [k for k in range(N-1) if bit[k]==1] # (66): NO_bit1=[0, 1, 2, 3]\n temp = 0 # (67): temp=0\n for l,x in enumerate(NO_bit1,1): # (68): l=1, x=0 (71): l=2, x=1 ... (80): NO CHANGE\n if a[x+1]>=a[0]+l: # (69): NO CHANGE (72): NO CHANGE ... (78): NO CHANGE\n continue # (70): NO CHANGE (73): NO CHANGE (79): NO CHANGE\n temp += (a[0]+l)-a[x+1] # (76): temp=653\n ans = min(ans,temp) # (81): ans=653\nprint(ans)\n"], "anno_status": [true], "diff_content": " def LI(): return list(map(int,input().split()))\n N,K = LI()\n a = LI()\n ans = float('INF')\n for i in range(2**(N-1)):\n bit = [i>>j&1 for j in range(N-1)]\n if K-1!=bit.count(1):\n continue\n- NO_bit1 = [k for k in range(N-1) if bit[k]==1]\n- temp = 0\n- for l,x in enumerate(NO_bit1,1):\n- if a[x+1]>=a[0]+l:\n- continue\n- temp += (a[0]+l)-a[x+1]\n+ temp,kijun = 0,a[0]\n+ for k in range(N-1):\n+ if bit[k]==0:\n+ kijun = max(kijun,a[k+1])\n+ else:\n+ if a[k+1]>=kijun+1:\n+ kijun = a[k+1]\n+ continue\n+ temp += (kijun+1)-a[k+1]\n+ kijun += 1\n ans = min(ans,temp)\n print(ans)\n \n", "FL_content": " def LI(): return list(map(int,input().split()))\n N,K = LI()\n a = LI()\n ans = float('INF')\n for i in range(2**(N-1)):\n bit = [i>>j&1 for j in range(N-1)]\n if K-1!=bit.count(1):\n continue\n- NO_bit1 = [k for k in range(N-1) if bit[k]==1]\n- temp = 0\n- for l,x in enumerate(NO_bit1,1):\n- if a[x+1]>=a[0]+l:\n- continue\n- temp += (a[0]+l)-a[x+1]\n ans = min(ans,temp)\n print(ans)\n \n", "added_lines": 10, "removed_lines": 6, "code1_lines": 17 }, { "user_id": "u624689667", "problem_id": "p03752", "submission1_id": "s458972169", "submission2_id": "s125622641", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = [int(i) for i in input().split()]\naa = [int(i) for i in input().split()]\n\nans = float(\"inf\")\nfor bit in range(1<>(n-1) & 1):\n continue\n now = aa[0]\n cost = 0\n for i in range(1, n):\n if bit>>i & 1:\n if aa[i] > now:\n now = aa[i]\n else:\n now = now + 1\n cost += now - aa[i]\n else:\n if aa[i] > now:\n continue\n\n ans = min(ans, cost)\n\nprint(ans)\n", "code2": "import itertools\n\nn, k = [int(i) for i in input().split()]\ntop, *a = [int(i) for i in input().split()]\n\nans = float(\"inf\")\nfor pp in itertools.product((0, 1), repeat=n-1):\n now = top\n v = 1\n cost = 0\n for i, p in enumerate(pp):\n if p == 0:\n if a[i] > now:\n now = a[i]\n v += 1\n continue\n now = max(now+1, a[i])\n cost += max(now-a[i], 0)\n v += 1\n if v >= k:\n ans = min(ans, cost)\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584651026", "date2": "1584653086", "bleu_score": "0.6662342273703303", "code1_test_status": [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, 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, 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, 1, 1, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 101, "input": "5 4\n11683 3774 1788 4173 952\n", "actual_output": "26156\n", "expected_output": "25320\n\n", "anno_code": ["n, k = [int(i) for i in input().split()] # (0): n=5, k=4\naa = [int(i) for i in input().split()] # (1): aa=[11683, 3774, 1788, 4173, 952]\n\nans = float(\"inf\") # (2): ans=inf\nfor bit in range(1<>(n-1) & 1): # (50): NO CHANGE (75): NO CHANGE ... (189): NO CHANGE\n continue # (51): NO CHANGE\n now = aa[0] # (76): now=11683 (110): now=11683 ... (190): now=11683\n cost = 0 # (77): cost=0 (111): cost=0 ... (191): cost=0\n for i in range(1, n): # (78): i=1 (83): i=2 ... (212): NO CHANGE\n if bit>>i & 1: # (79): NO CHANGE (84): NO CHANGE ... (208): NO CHANGE\n if aa[i] > now: # (80): NO CHANGE (85): NO CHANGE ... (209): NO CHANGE\n now = aa[i]\n else:\n now = now + 1 # (81): now=11684 (86): now=11685 ... (210): now=11687\n cost += now - aa[i] # (82): cost=7910 (87): cost=17807 ... (211): cost=36055\n else:\n if aa[i] > now: # (90): NO CHANGE (119): NO CHANGE (142): NO CHANGE\n continue\n\n ans = min(ans, cost) # (97): ans=28541 (131): ans=26156 ... (213): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": "+import itertools\n+\n n, k = [int(i) for i in input().split()]\n-aa = [int(i) for i in input().split()]\n+top, *a = [int(i) for i in input().split()]\n \n ans = float(\"inf\")\n-for bit in range(1<>(n-1) & 1):\n- continue\n- now = aa[0]\n+for pp in itertools.product((0, 1), repeat=n-1):\n+ now = top\n+ v = 1\n cost = 0\n- for i in range(1, n):\n- if bit>>i & 1:\n- if aa[i] > now:\n- now = aa[i]\n- else:\n- now = now + 1\n- cost += now - aa[i]\n- else:\n- if aa[i] > now:\n- continue\n-\n- ans = min(ans, cost)\n-\n+ for i, p in enumerate(pp):\n+ if p == 0:\n+ if a[i] > now:\n+ now = a[i]\n+ v += 1\n+ continue\n+ now = max(now+1, a[i])\n+ cost += max(now-a[i], 0)\n+ v += 1\n+ if v >= k:\n+ ans = min(ans, cost)\n print(ans)\n-\n", "FL_content": " n, k = [int(i) for i in input().split()]\n-aa = [int(i) for i in input().split()]\n \n ans = float(\"inf\")\n-for bit in range(1<>(n-1) & 1):\n- continue\n- now = aa[0]\n cost = 0\n- for i in range(1, n):\n- if bit>>i & 1:\n- if aa[i] > now:\n- now = aa[i]\n- else:\n- now = now + 1\n- cost += now - aa[i]\n- else:\n- if aa[i] > now:\n- continue\n-\n- ans = min(ans, cost)\n-\n print(ans)\n-\n", "added_lines": 17, "removed_lines": 21, "code1_lines": 26 }, { "user_id": "u047102107", "problem_id": "p03752", "submission1_id": "s485132794", "submission2_id": "s996190990", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import combinations\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nbest_score = float(\"inf\")\nfor sel in combinations(range(N), K):\n cost = 0\n\n \n \n first = sel[0]\n first_max = A[first]\n for k in range(first):\n first_max = max(first_max, A[k])\n current = first_max\n if first_max > 0:\n cost += abs(A[first] - current) \n \n for i in range(1, K):\n if current > A[sel[i]]:\n cost += abs(A[sel[i]] - current) + 1\n current += 1\n else:\n current = A[sel[i]] + 1\n \n best_score = min(best_score, cost)\nprint(best_score)", "code2": "from itertools import combinations\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\nbest_score = float(\"inf\")\nfor sel in combinations(range(N), K):\n sel = sorted(sel)\n cost = 0\n m = -1\n\n for i in range(N):\n if i not in sel:\n \n m = max(m, A[i])\n else:\n if m >= A[i]:\n cost += 1 + m - A[i]\n m += 1\n else:\n m = A[i]\n best_score = min(best_score, cost)\nprint(best_score)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595893546", "date2": "1595894030", "bleu_score": "0.6581865812193984", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 33, "total_score": 101, "input": "5 5\n2312 3208 19389 3469 3424\n", "actual_output": "31890\n", "expected_output": "31888\n\n", "anno_code": ["from itertools import combinations\n\nN, K = map(int, input().split()) # (0): N=5, K=5\nA = list(map(int, input().split())) # (1): A=[2312, 3208, 19389, 3469, 3424]\n\nbest_score = float(\"inf\") # (2): best_score=inf\nfor sel in combinations(range(N), K): # (3): sel=(0, 1, 2, 3, 4) (27): NO CHANGE\n cost = 0 # (4): cost=0\n\n \n \n first = sel[0] # (5): first=0\n first_max = A[first] # (6): first_max=2312\n for k in range(first): # (7): NO CHANGE\n first_max = max(first_max, A[k])\n current = first_max # (8): current=2312\n if first_max > 0: # (9): NO CHANGE\n cost += abs(A[first] - current) # (10): NO CHANGE\n \n for i in range(1, K): # (11): i=1 (14): i=2 ... (25): NO CHANGE\n if current > A[sel[i]]: # (12): NO CHANGE (15): NO CHANGE ... (22): NO CHANGE\n cost += abs(A[sel[i]] - current) + 1 # (19): cost=15922 (23): cost=31890\n current += 1 # (20): current=19391 (24): current=19392\n else:\n current = A[sel[i]] + 1 # (13): current=3209 (16): current=19390\n \n best_score = min(best_score, cost) # (26): best_score=31890\nprint(best_score)"], "anno_status": [true], "diff_content": " from itertools import combinations\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ \n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n best_score = float(\"inf\")\n for sel in combinations(range(N), K):\n+ sel = sorted(sel)\n cost = 0\n+ m = -1\n \n- \n- \n- first = sel[0]\n- first_max = A[first]\n- for k in range(first):\n- first_max = max(first_max, A[k])\n- current = first_max\n- if first_max > 0:\n- cost += abs(A[first] - current) \n- \n- for i in range(1, K):\n- if current > A[sel[i]]:\n- cost += abs(A[sel[i]] - current) + 1\n- current += 1\n+ for i in range(N):\n+ if i not in sel:\n+ \n+ m = max(m, A[i])\n else:\n- current = A[sel[i]] + 1\n- \n+ if m >= A[i]:\n+ cost += 1 + m - A[i]\n+ m += 1\n+ else:\n+ m = A[i]\n best_score = min(best_score, cost)\n print(best_score)\n", "FL_content": " from itertools import combinations\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n best_score = float(\"inf\")\n for sel in combinations(range(N), K):\n cost = 0\n \n- \n- \n- first = sel[0]\n- first_max = A[first]\n- for k in range(first):\n- first_max = max(first_max, A[k])\n- current = first_max\n- if first_max > 0:\n- cost += abs(A[first] - current) \n- \n- for i in range(1, K):\n- if current > A[sel[i]]:\n- cost += abs(A[sel[i]] - current) + 1\n- current += 1\n else:\n- current = A[sel[i]] + 1\n- \n best_score = min(best_score, cost)\n print(best_score)\n", "added_lines": 35, "removed_lines": 16, "code1_lines": 28 }, { "user_id": "u911449886", "problem_id": "p03752", "submission1_id": "s000577487", "submission2_id": "s700128262", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import combinations\n\ndef getval():\n n,k = map(int,input().split())\n a = list(map(int,input().split()))\n return n,k,a\n\ndef main(n,k,a):\n arr = []\n locmax = 0\n for i in a:\n arr.append(locmax)\n locmax = max(locmax,i)\n\n ans = 2**60\n for c in combinations(range(1,n),k-1):\n cost = 0\n prev = a[0]\n for i in c:\n if a[i]<=prev:\n cost += max(prev,arr[i])+1-a[i]\n prev = max(prev,arr[i])+1\n ans = min(ans,cost)\n print(ans)\n\nif __name__==\"__main__\":\n n,k,a = getval()\n main(n,k,a) ", "code2": "from itertools import combinations\n\ndef getval():\n n,k = map(int,input().split())\n a = list(map(int,input().split()))\n return n,k,a\n\ndef main(n,k,a):\n arr = []\n locmax = 0\n for i in a:\n arr.append(locmax)\n locmax = max(locmax,i)\n\n ans = 2**60\n for c in combinations(range(1,n),k-1):\n cost = 0\n prev = a[0]\n for i in c:\n if a[i]<=prev:\n cost += max(prev,arr[i])+1-a[i]\n prev = max(max(prev,arr[i])+1,a[i])\n ans = min(ans,cost)\n if k==1:\n ans = 0\n print(ans)\n\nif __name__==\"__main__\":\n n,k,a = getval()\n main(n,k,a) ", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600228893", "date2": "1600229409", "bleu_score": "0.9332234211716581", "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, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 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, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1], "code1_test_score": 61, "total_score": 101, "input": "5 5\n862 2044 1332 56 2597\n", "actual_output": "1990\n", "expected_output": "2703\n\n", "anno_code": ["from itertools import combinations\n\ndef getval(): # (0): getval=\n n,k = map(int,input().split())\n a = list(map(int,input().split()))\n return n,k,a\n\ndef main(n,k,a): # (1): main=\n arr = []\n locmax = 0\n for i in a:\n arr.append(locmax)\n locmax = max(locmax,i)\n\n ans = 2**60\n for c in combinations(range(1,n),k-1):\n cost = 0\n prev = a[0]\n for i in c:\n if a[i]<=prev:\n cost += max(prev,arr[i])+1-a[i]\n prev = max(prev,arr[i])+1\n ans = min(ans,cost)\n print(ans)\n\nif __name__==\"__main__\":\n n,k,a = getval()\n main(n,k,a) "], "anno_status": [true], "diff_content": " from itertools import combinations\n \n def getval():\n n,k = map(int,input().split())\n a = list(map(int,input().split()))\n return n,k,a\n \n def main(n,k,a):\n arr = []\n locmax = 0\n for i in a:\n arr.append(locmax)\n locmax = max(locmax,i)\n \n ans = 2**60\n for c in combinations(range(1,n),k-1):\n cost = 0\n prev = a[0]\n for i in c:\n if a[i]<=prev:\n cost += max(prev,arr[i])+1-a[i]\n- prev = max(prev,arr[i])+1\n+ prev = max(max(prev,arr[i])+1,a[i])\n ans = min(ans,cost)\n+ if k==1:\n+ ans = 0\n print(ans)\n \n if __name__==\"__main__\":\n n,k,a = getval()\n- main(n,k,a) \n+ main(n,k,a) \n", "FL_content": " from itertools import combinations\n \n def getval():\n n,k = map(int,input().split())\n a = list(map(int,input().split()))\n return n,k,a\n \n def main(n,k,a):\n arr = []\n locmax = 0\n for i in a:\n arr.append(locmax)\n locmax = max(locmax,i)\n \n ans = 2**60\n for c in combinations(range(1,n),k-1):\n cost = 0\n prev = a[0]\n for i in c:\n if a[i]<=prev:\n cost += max(prev,arr[i])+1-a[i]\n- prev = max(prev,arr[i])+1\n ans = min(ans,cost)\n print(ans)\n \n if __name__==\"__main__\":\n n,k,a = getval()\n- main(n,k,a) \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 28 }, { "user_id": "u707444776", "problem_id": "p03752", "submission1_id": "s559550952", "submission2_id": "s477558224", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def dfs(index):\n global ans\n if index == N:\n if blst.count(1) == K - 1:\n tmp = a[0]\n anstmp = 0\n for i in range(1, N):\n if blst[i - 1] == 0:continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n else:\n tmp = a[i]\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n\nN, K = map(int, input().split())\na = list(map(int, input().split()))\nblst = [0] * (N - 1)\nans = float('inf')\ndfs(1)\n\nprint(0)", "code2": "def dfs(index):\n global ans\n if index == N:\n if blst.count(1) >= K - 1:\n tmp = a[0]\n anstmp = 0\n for i in range(1, N):\n if blst[i - 1] == 0:\n if tmp < a[i]:\n tmp = a[i]\n continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n else:\n tmp = a[i]\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n\nN, K = map(int, input().split())\na = list(map(int, input().split()))\nblst = [0] * (N - 1)\nans = float('inf')\ndfs(1)\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583994347", "date2": "1584066036", "bleu_score": "0.8626117172453537", "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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "5 5\n862 3170 6694 212 3424\n", "actual_output": "0\n", "expected_output": "9755\n\n", "anno_code": ["def dfs(index): # (0): dfs=\n global ans\n if index == N: # (6): NO CHANGE (10): NO CHANGE ... (178): NO CHANGE\n if blst.count(1) == K - 1: # (23): NO CHANGE (29): NO CHANGE ... (179): NO CHANGE\n tmp = a[0] # (180): tmp=862\n anstmp = 0 # (181): anstmp=0\n for i in range(1, N): # (182): i=1 (186): i=2 ... (200): NO CHANGE\n if blst[i - 1] == 0:continue # (183): NO CHANGE (187): NO CHANGE ... (196): NO CHANGE\n if tmp >= a[i]: # (184): NO CHANGE (188): NO CHANGE ... (197): NO CHANGE\n anstmp += tmp - a[i] + 1 # (193): anstmp=6483 (198): anstmp=9755\n tmp += 1 # (194): tmp=6695 (199): tmp=6696\n else:\n tmp = a[i] # (185): tmp=3170 (189): tmp=6694\n ans = min(ans, anstmp) # (201): NO CHANGE\n return # (24): index=4, i=0 (30): index=4, i=1 ... (202): index=4, i=1\n for i in range(2): # (7): i=0 (11): i=0 ... (209): NO CHANGE\n blst[index - 1] = i # (8): NO CHANGE (12): NO CHANGE ... (176): NO CHANGE\n dfs(index + 1) # (9): index=2 (13): index=3 ... (177): index=5\n return # (32): index=3, i=0 (50): index=3 ... (210): dfs=, N=5, K=5, a=[862, 3170, 6694, 212, 3424], blst=[1, 1, 1, 1], ans=9755\n\nN, K = map(int, input().split()) # (1): N=5, K=5\na = list(map(int, input().split())) # (2): a=[862, 3170, 6694, 212, 3424]\nblst = [0] * (N - 1) # (3): blst=[0, 0, 0, 0]\nans = float('inf') # (4): ans=inf\ndfs(1) # (5): index=1\n\nprint(0)"], "anno_status": [true], "diff_content": " def dfs(index):\n global ans\n if index == N:\n- if blst.count(1) == K - 1:\n+ if blst.count(1) >= K - 1:\n tmp = a[0]\n anstmp = 0\n for i in range(1, N):\n- if blst[i - 1] == 0:continue\n+ if blst[i - 1] == 0:\n+ if tmp < a[i]:\n+ tmp = a[i]\n+ continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n else:\n tmp = a[i]\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n \n N, K = map(int, input().split())\n a = list(map(int, input().split()))\n blst = [0] * (N - 1)\n ans = float('inf')\n dfs(1)\n \n-print(0)\n+print(ans)\n+\n", "FL_content": " def dfs(index):\n global ans\n if index == N:\n- if blst.count(1) == K - 1:\n tmp = a[0]\n anstmp = 0\n for i in range(1, N):\n- if blst[i - 1] == 0:continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n else:\n tmp = a[i]\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n \n N, K = map(int, input().split())\n a = list(map(int, input().split()))\n blst = [0] * (N - 1)\n ans = float('inf')\n dfs(1)\n \n-print(0)\n", "added_lines": 7, "removed_lines": 3, "code1_lines": 27 }, { "user_id": "u993435350", "problem_id": "p03752", "submission1_id": "s127943507", "submission2_id": "s548080966", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\n\nN,K = map(int,input().split())\nA = list(map(int,input().split()))\n\nans = [10 ** 12 for i in range(2 ** (N - 1))]\nseen = 1 \n\nfor i in range(2 ** (N - 1)):\n AA = copy.deepcopy(A)\n cost = 0\n con = 0\n for j in range(N - 1):\n m = max(AA[:j + 1])\n a = AA[j + 1]\n if ((i >> j) & 1) and a <= m:\n cost += (m - a + 1)\n AA[j + 1] = m + 1\n con += 1\n if con == K - 1:\n break\n \n if len([AA[i] for i in range(1,N) if AA[i] > A[0]]) >= K - 1:\n ans[i] = cost\n \nprint(min(ans))", "code2": "import copy\n\nN,K = map(int,input().split())\nA = list(map(int,input().split()))\n\nans = [10 ** 12 for i in range(2 ** (N - 1))]\nseen = 1 \n\nfor i in range(2 ** (N - 1)):\n AA = copy.deepcopy(A)\n cost = 0\n s = str(bin(i))[2:]\n if s.count(\"1\") >= K:\n continue\n \n for j in range(N - 1):\n m = max(AA[:j + 1])\n a = AA[j + 1]\n if ((i >> j) & 1) and a <= m:\n cost += (m - a + 1)\n AA[j + 1] = m + 1\n \n if len([AA[i] for i in range(1,N) if AA[i] > max(AA[:i])]) >= K - 1:\n ans[i] = cost\n \n \nprint(min(ans))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590096223", "date2": "1590096871", "bleu_score": "0.8916918717199759", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 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, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1], "code1_test_score": 47, "total_score": 101, "input": "5 5\n862 3408 1332 212 3035\n", "actual_output": "3197\n", "expected_output": "5651\n\n", "anno_code": ["import copy\n\nN,K = map(int,input().split()) # (0): N=5, K=5\nA = list(map(int,input().split())) # (1): A=[862, 3408, 1332, 212, 3035]\n\nans = [10 ** 12 for i in range(2 ** (N - 1))] # (2): ans=[1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000]\nseen = 1 # (3): seen=1\n\nfor i in range(2 ** (N - 1)): # (4): i=0 (30): i=1 ... (500): NO CHANGE\n AA = copy.deepcopy(A) # (5): AA=[862, 3408, 1332, 212, 3035] (31): NO CHANGE ... (465): AA=[862, 3408, 1332, 212, 3035]\n cost = 0 # (6): cost=0 (32): NO CHANGE ... (466): cost=0\n con = 0 # (7): con=0 (33): NO CHANGE ... (467): con=0\n for j in range(N - 1): # (8): j=0 (13): j=1 ... (497): NO CHANGE\n m = max(AA[:j + 1]) # (9): m=862 (14): m=3408 ... (490): m=3410\n a = AA[j + 1] # (10): a=3408 (15): a=1332 ... (491): a=3035\n if ((i >> j) & 1) and a <= m: # (11): NO CHANGE (16): NO CHANGE ... (492): NO CHANGE\n cost += (m - a + 1) # (69): cost=2077 (98): cost=2077 ... (493): cost=5651\n AA[j + 1] = m + 1 # (70): AA=[862, 3408, 3409, 212, 3035] (99): AA=[862, 3408, 3409, 212, 3035] ... (494): AA=[862, 3408, 3409, 3410, 3411]\n con += 1 # (71): con=1 (100): con=1 ... (495): con=3\n if con == K - 1: # (12): NO CHANGE (17): NO CHANGE ... (496): NO CHANGE\n break\n \n if len([AA[i] for i in range(1,N) if AA[i] > A[0]]) >= K - 1: # (29): NO CHANGE (55): NO CHANGE ... (498): NO CHANGE\n ans[i] = cost # (143): ans=[1000000000000, 1000000000000, 1000000000000, 1000000000000, 3197, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000] (173): ans=[1000000000000, 1000000000000, 1000000000000, 1000000000000, 3197, 3197, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 1000000000000] ... (499): ans=[1000000000000, 1000000000000, 1000000000000, 1000000000000, 3197, 3197, 5275, 5275, 1000000000000, 1000000000000, 1000000000000, 1000000000000, 3572, 3572, 5651, 5651]\n \nprint(min(ans))"], "anno_status": [false], "diff_content": " import copy\n \n N,K = map(int,input().split())\n A = list(map(int,input().split()))\n \n ans = [10 ** 12 for i in range(2 ** (N - 1))]\n seen = 1 \n \n for i in range(2 ** (N - 1)):\n AA = copy.deepcopy(A)\n cost = 0\n- con = 0\n+ s = str(bin(i))[2:]\n+ if s.count(\"1\") >= K:\n+ continue\n+ \n for j in range(N - 1):\n m = max(AA[:j + 1])\n a = AA[j + 1]\n if ((i >> j) & 1) and a <= m:\n cost += (m - a + 1)\n AA[j + 1] = m + 1\n- con += 1\n- if con == K - 1:\n- break\n \n- if len([AA[i] for i in range(1,N) if AA[i] > A[0]]) >= K - 1:\n+ if len([AA[i] for i in range(1,N) if AA[i] > max(AA[:i])]) >= K - 1:\n ans[i] = cost\n- \n+ \n+ \n print(min(ans))\n+\n+\n", "FL_content": " import copy\n \n N,K = map(int,input().split())\n A = list(map(int,input().split()))\n \n ans = [10 ** 12 for i in range(2 ** (N - 1))]\n seen = 1 \n \n for i in range(2 ** (N - 1)):\n AA = copy.deepcopy(A)\n cost = 0\n- con = 0\n for j in range(N - 1):\n m = max(AA[:j + 1])\n a = AA[j + 1]\n if ((i >> j) & 1) and a <= m:\n cost += (m - a + 1)\n AA[j + 1] = m + 1\n- con += 1\n- if con == K - 1:\n- break\n \n- if len([AA[i] for i in range(1,N) if AA[i] > A[0]]) >= K - 1:\n ans[i] = cost\n- \n print(min(ans))\n", "added_lines": 9, "removed_lines": 6, "code1_lines": 26 }, { "user_id": "u640922335", "problem_id": "p03752", "submission1_id": "s523784677", "submission2_id": "s275009562", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nA=list(map(int,input().split()))\nans=[]\n\nfor i in range(2**(N-1)):\n limit=A[0]\n L=[0]*(N-1)\n total=0\n count=0\n for j in range(N-1):\n if ((i>>j)&1):\n L[j]=1\n count+=1\n if count>=K-1:\n for m in range(N-1):\n if L[m]==1:\n height=max(max(A[:m+1])+1,A[m+1])\n total+=height-A[m+1]\n A[m+1]=height\n ans.append(total)\n\nprint(min(ans))", "code2": "import copy\nN,K=map(int,input().split())\nA=list(map(int,input().split()))\nB=copy.copy(A)\nans=[]\n\nfor i in range(2**(N-1)):\n L=[0]*(N-1)\n total=0\n count=0\n for j in range(N-1):\n if ((i>>j)&1):\n L[j]=1\n count+=1\n if count>=K-1:\n A=copy.copy(B)\n for m in range(N-1):\n \n if L[m]==1:\n height=max(max(A[:m+1])+1,A[m+1])\n total+=height-A[m+1]\n A[m+1]=height\n \n ans.append(total)\n \n\nprint(min(ans))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593508884", "date2": "1593510290", "bleu_score": "0.8432659686050632", "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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 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], "code1_test_score": 88, "total_score": 101, "input": "5 4\n8527 3774 3598 4173 924\n", "actual_output": "0\n", "expected_output": "14042\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=5, K=4\nA=list(map(int,input().split())) # (1): A=[8527, 3774, 3598, 4173, 924]\nans=[] # (2): ans=[]\n\nfor i in range(2**(N-1)): # (3): i=0 (18): i=1 ... (405): NO CHANGE\n limit=A[0] # (4): limit=8527 (19): NO CHANGE ... (361): NO CHANGE\n L=[0]*(N-1) # (5): L=[0, 0, 0, 0] (20): NO CHANGE ... (362): L=[0, 0, 0, 0]\n total=0 # (6): total=0 (21): NO CHANGE ... (363): NO CHANGE\n count=0 # (7): count=0 (22): NO CHANGE ... (364): count=0\n for j in range(N-1): # (8): j=0 (10): j=1 ... (381): NO CHANGE\n if ((i>>j)&1): # (9): NO CHANGE (11): NO CHANGE ... (378): NO CHANGE\n L[j]=1 # (25): L=[1, 0, 0, 0] (44): L=[0, 1, 0, 0] ... (379): L=[1, 1, 1, 1]\n count+=1 # (26): count=1 (45): count=1 ... (380): count=4\n if count>=K-1: # (17): NO CHANGE (34): NO CHANGE ... (382): NO CHANGE\n for m in range(N-1): # (147): m=0 (152): m=1 ... (403): NO CHANGE\n if L[m]==1: # (148): NO CHANGE (153): NO CHANGE ... (399): NO CHANGE\n height=max(max(A[:m+1])+1,A[m+1]) # (149): height=8528 (154): height=8529 ... (400): height=8531\n total+=height-A[m+1] # (150): total=4754 (155): total=9685 ... (401): NO CHANGE\n A[m+1]=height # (151): A=[8527, 8528, 3598, 4173, 924] (156): A=[8527, 8528, 8529, 4173, 924] ... (402): NO CHANGE\n ans.append(total) # (165): ans=[14042] (260): ans=[14042, 7607] ... (404): ans=[14042, 7607, 0, 0, 0]\n\nprint(min(ans))"], "anno_status": [true], "diff_content": "+import copy\n N,K=map(int,input().split())\n A=list(map(int,input().split()))\n+B=copy.copy(A)\n ans=[]\n \n for i in range(2**(N-1)):\n- limit=A[0]\n L=[0]*(N-1)\n total=0\n count=0\n for j in range(N-1):\n if ((i>>j)&1):\n L[j]=1\n count+=1\n if count>=K-1:\n+ A=copy.copy(B)\n for m in range(N-1):\n+ \n if L[m]==1:\n height=max(max(A[:m+1])+1,A[m+1])\n total+=height-A[m+1]\n A[m+1]=height\n+ \n ans.append(total)\n+ \n \n print(min(ans))\n", "FL_content": " N,K=map(int,input().split())\n A=list(map(int,input().split()))\n ans=[]\n \n for i in range(2**(N-1)):\n- limit=A[0]\n L=[0]*(N-1)\n total=0\n count=0\n for j in range(N-1):\n if ((i>>j)&1):\n L[j]=1\n count+=1\n if count>=K-1:\n for m in range(N-1):\n if L[m]==1:\n height=max(max(A[:m+1])+1,A[m+1])\n total+=height-A[m+1]\n A[m+1]=height\n ans.append(total)\n \n print(min(ans))\n", "added_lines": 6, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u397256488", "problem_id": "p03752", "submission1_id": "s985125926", "submission2_id": "s241682088", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = map(int,input().split())\nbills = list(map(int,input().split()))\nans = 0\nk = 0\nwhile k < K:\n\tk = 0\n\tcost =[]\n\tcosd = {}\n\ttatekae = {}\n\tmaxh = 0\n\tfor bi,b in enumerate(bills):\n\t\tif b > maxh:\n\t\t\tcost.append(0)\n\t\t\tmaxh = b\n\t\t\tk = k + 1\n\t\telse:\n\t\t\tc = maxh - b + 1\n\t\t\tcost.append(c)\n\t\t\tmaxh2 = maxh + 1\n\t\t\ttatekae[bi] = []\n\t\t\tfor b2i,b2 in enumerate(bills[bi:]):\n\t\t\t\tif maxh2 < b2:\n\t\t\t\t\tbreak\n\t\t\t\telif maxh2 == b2:\n\t\t\t\t\tc = c + 1\n\t\t\t\t\tmaxh2 = maxh2 + 1\n\t\t\t\t\ttatekae[bi].append(b2i + bi)\n\t\t\tcosd[bi] = c\n\tif k > K:\n\t\tbreak\n\ta = min(cosd.items(),key =lambda x: x[1])[0]\n\tans = ans + cosd[a]\n\tbills[a] = bills[a] + cost[a]\n\tfor t in tatekae[a]:\n\t\tbills[t] = bills[t] + 1\n\tk = k + 1\nprint(ans)", "code2": "N,K = map(int,input().split())\nbills = list(map(int,input().split()))\nans = 0\nk = 0\nwhile k < K:\n\tk = 0\n\tcost =[]\n\tcosd = {}\n\ttatekae = {}\n\tmaxh = 0\n\tfor bi,b in enumerate(bills):\n\t\tif b > maxh:\n\t\t\tcost.append(0)\n\t\t\tmaxh = b\n\t\t\tk = k + 1\n\t\telse:\n\t\t\tc = maxh - b + 1\n\t\t\tcost.append(c)\n\t\t\tmaxh2 = maxh + 1\n\t\t\ttatekae[bi] = []\n\t\t\tfor b2i,b2 in enumerate(bills[bi:]):\n\t\t\t\tif maxh2 < b2:\n\t\t\t\t\tbreak\n\t\t\t\telif maxh2 == b2:\n\t\t\t\t\tc = c + 1\n\t\t\t\t\tmaxh2 = maxh2 + 1\n\t\t\t\t\ttatekae[bi].append(b2i + bi)\n\t\t\tcosd[bi] = c\n\tif k >= K:\n\t\tbreak\n\ta = min(cosd.items(),key =lambda x: x[1])[0]\n\tans = ans + cosd[a]\n\tbills[a] = bills[a] + cost[a]\n\tfor t in tatekae[a]:\n\t\tbills[t] = bills[t] + 1\n\tk = k + 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1491787650", "date2": "1491787836", "bleu_score": "0.9963702162913853", "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], "code1_test_score": 100, "total_score": 101, "input": "5 1\n5960 3170 3598 610 3424\n", "actual_output": "2363\n", "expected_output": "0\n\n", "anno_code": ["N,K = map(int,input().split()) # (0): N=5, K=1\nbills = list(map(int,input().split())) # (1): bills=[5960, 3170, 3598, 610, 3424]\nans = 0 # (2): ans=0\nk = 0 # (3): k=0\nwhile k < K: # (4): NO CHANGE (84): NO CHANGE\n\tk = 0 # (5): NO CHANGE\n\tcost =[] # (6): cost=[]\n\tcosd = {} # (7): cosd={}\n\ttatekae = {} # (8): tatekae={}\n\tmaxh = 0 # (9): maxh=0\n\tfor bi,b in enumerate(bills): # (10): bi=0, b=5960 (15): bi=1, b=3170 ... (77): NO CHANGE\n\t\tif b > maxh: # (11): NO CHANGE (16): NO CHANGE ... (67): NO CHANGE\n\t\t\tcost.append(0) # (12): cost=[0]\n\t\t\tmaxh = b # (13): maxh=5960\n\t\t\tk = k + 1 # (14): k=1\n\t\telse:\n\t\t\tc = maxh - b + 1 # (17): c=2791 (37): c=2363 ... (68): c=2537\n\t\t\tcost.append(c) # (18): cost=[0, 2791] (38): cost=[0, 2791, 2363] ... (69): cost=[0, 2791, 2363, 5351, 2537]\n\t\t\tmaxh2 = maxh + 1 # (19): maxh2=5961 (39): NO CHANGE ... (70): NO CHANGE\n\t\t\ttatekae[bi] = [] # (20): tatekae={1: []} (40): tatekae={1: [], 2: []} ... (71): tatekae={1: [], 2: [], 3: [], 4: []}\n\t\t\tfor b2i,b2 in enumerate(bills[bi:]): # (21): b2i=0, b2=3170 (24): b2i=1, b2=3598 ... (75): NO CHANGE\n\t\t\t\tif maxh2 < b2: # (22): NO CHANGE (25): NO CHANGE ... (73): NO CHANGE\n\t\t\t\t\tbreak\n\t\t\t\telif maxh2 == b2: # (23): NO CHANGE (26): NO CHANGE ... (74): NO CHANGE\n\t\t\t\t\tc = c + 1\n\t\t\t\t\tmaxh2 = maxh2 + 1\n\t\t\t\t\ttatekae[bi].append(b2i + bi)\n\t\t\tcosd[bi] = c # (34): cosd={1: 2791} (51): cosd={1: 2791, 2: 2363} ... (76): cosd={1: 2791, 2: 2363, 3: 5351, 4: 2537}\n\tif k > K: # (78): NO CHANGE\n\t\tbreak\n\ta = min(cosd.items(),key =lambda x: x[1])[0] # (79): a=2\n\tans = ans + cosd[a] # (80): ans=2363\n\tbills[a] = bills[a] + cost[a] # (81): bills=[5960, 3170, 5961, 610, 3424]\n\tfor t in tatekae[a]: # (82): NO CHANGE\n\t\tbills[t] = bills[t] + 1\n\tk = k + 1 # (83): k=2\nprint(ans)"], "anno_status": [true], "diff_content": " N,K = map(int,input().split())\n bills = list(map(int,input().split()))\n ans = 0\n k = 0\n while k < K:\n \tk = 0\n \tcost =[]\n \tcosd = {}\n \ttatekae = {}\n \tmaxh = 0\n \tfor bi,b in enumerate(bills):\n \t\tif b > maxh:\n \t\t\tcost.append(0)\n \t\t\tmaxh = b\n \t\t\tk = k + 1\n \t\telse:\n \t\t\tc = maxh - b + 1\n \t\t\tcost.append(c)\n \t\t\tmaxh2 = maxh + 1\n \t\t\ttatekae[bi] = []\n \t\t\tfor b2i,b2 in enumerate(bills[bi:]):\n \t\t\t\tif maxh2 < b2:\n \t\t\t\t\tbreak\n \t\t\t\telif maxh2 == b2:\n \t\t\t\t\tc = c + 1\n \t\t\t\t\tmaxh2 = maxh2 + 1\n \t\t\t\t\ttatekae[bi].append(b2i + bi)\n \t\t\tcosd[bi] = c\n-\tif k > K:\n+\tif k >= K:\n \t\tbreak\n \ta = min(cosd.items(),key =lambda x: x[1])[0]\n \tans = ans + cosd[a]\n \tbills[a] = bills[a] + cost[a]\n \tfor t in tatekae[a]:\n \t\tbills[t] = bills[t] + 1\n \tk = k + 1\n print(ans)\n", "FL_content": " N,K = map(int,input().split())\n bills = list(map(int,input().split()))\n ans = 0\n k = 0\n while k < K:\n \tk = 0\n \tcost =[]\n \tcosd = {}\n \ttatekae = {}\n \tmaxh = 0\n \tfor bi,b in enumerate(bills):\n \t\tif b > maxh:\n \t\t\tcost.append(0)\n \t\t\tmaxh = b\n \t\t\tk = k + 1\n \t\telse:\n \t\t\tc = maxh - b + 1\n \t\t\tcost.append(c)\n \t\t\tmaxh2 = maxh + 1\n \t\t\ttatekae[bi] = []\n \t\t\tfor b2i,b2 in enumerate(bills[bi:]):\n \t\t\t\tif maxh2 < b2:\n \t\t\t\t\tbreak\n \t\t\t\telif maxh2 == b2:\n \t\t\t\t\tc = c + 1\n \t\t\t\t\tmaxh2 = maxh2 + 1\n \t\t\t\t\ttatekae[bi].append(b2i + bi)\n \t\t\tcosd[bi] = c\n-\tif k > K:\n \t\tbreak\n \ta = min(cosd.items(),key =lambda x: x[1])[0]\n \tans = ans + cosd[a]\n \tbills[a] = bills[a] + cost[a]\n \tfor t in tatekae[a]:\n \t\tbills[t] = bills[t] + 1\n \tk = k + 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 37 }, { "user_id": "u707444776", "problem_id": "p03752", "submission1_id": "s759257805", "submission2_id": "s477558224", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def dfs(index):\n global ans\n if index == N :\n if blst.count(1) >= K - 1:\n tmp = a1\n anstmp = 0\n for i in range(1, N):\n if blst[i - 1] == 0:continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n\nN, K = map(int, input().split())\na = list(map(int, input().split()))\nblst = [0] * (N - 1)\na1 = a[0]\nans = 10 ** 18\ndfs(1)\n\nprint(ans)", "code2": "def dfs(index):\n global ans\n if index == N:\n if blst.count(1) >= K - 1:\n tmp = a[0]\n anstmp = 0\n for i in range(1, N):\n if blst[i - 1] == 0:\n if tmp < a[i]:\n tmp = a[i]\n continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n else:\n tmp = a[i]\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n\nN, K = map(int, input().split())\na = list(map(int, input().split()))\nblst = [0] * (N - 1)\nans = float('inf')\ndfs(1)\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583992651", "date2": "1584066036", "bleu_score": "0.7801905520432605", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 33, "total_score": 101, "input": "5 5\n2312 3208 19389 3469 3424\n", "actual_output": "0\n", "expected_output": "31888\n\n", "anno_code": ["def dfs(index): # (0): dfs=\n global ans\n if index == N : # (7): NO CHANGE (11): NO CHANGE ... (179): NO CHANGE\n if blst.count(1) >= K - 1: # (24): NO CHANGE (30): NO CHANGE ... (180): NO CHANGE\n tmp = a1 # (181): tmp=2312\n anstmp = 0 # (182): anstmp=0\n for i in range(1, N): # (183): i=1 (186): i=2 ... (195): NO CHANGE\n if blst[i - 1] == 0:continue # (184): NO CHANGE (187): NO CHANGE ... (193): NO CHANGE\n if tmp >= a[i]: # (185): NO CHANGE (188): NO CHANGE ... (194): NO CHANGE\n anstmp += tmp - a[i] + 1\n tmp += 1\n ans = min(ans, anstmp) # (196): NO CHANGE\n return # (25): index=4, i=0 (31): index=4, i=1 ... (197): index=4, i=1\n for i in range(2): # (8): i=0 (12): i=0 ... (204): NO CHANGE\n blst[index - 1] = i # (9): NO CHANGE (13): NO CHANGE ... (177): NO CHANGE\n dfs(index + 1) # (10): index=2 (14): index=3 ... (178): index=5\n return # (33): index=3, i=0 (51): index=3 ... (205): dfs=, N=5, K=5, a=[2312, 3208, 19389, 3469, 3424], blst=[1, 1, 1, 1], a1=2312, ans=0\n\nN, K = map(int, input().split()) # (1): N=5, K=5\na = list(map(int, input().split())) # (2): a=[2312, 3208, 19389, 3469, 3424]\nblst = [0] * (N - 1) # (3): blst=[0, 0, 0, 0]\na1 = a[0] # (4): a1=2312\nans = 10 ** 18 # (5): ans=1000000000000000000\ndfs(1) # (6): index=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " def dfs(index):\n global ans\n- if index == N :\n+ if index == N:\n if blst.count(1) >= K - 1:\n- tmp = a1\n+ tmp = a[0]\n anstmp = 0\n for i in range(1, N):\n- if blst[i - 1] == 0:continue\n+ if blst[i - 1] == 0:\n+ if tmp < a[i]:\n+ tmp = a[i]\n+ continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n+ else:\n+ tmp = a[i]\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n \n N, K = map(int, input().split())\n a = list(map(int, input().split()))\n blst = [0] * (N - 1)\n-a1 = a[0]\n-ans = 10 ** 18\n+ans = float('inf')\n dfs(1)\n \n print(ans)\n+\n", "FL_content": " def dfs(index):\n global ans\n- if index == N :\n if blst.count(1) >= K - 1:\n- tmp = a1\n anstmp = 0\n for i in range(1, N):\n- if blst[i - 1] == 0:continue\n if tmp >= a[i]:\n anstmp += tmp - a[i] + 1\n tmp += 1\n ans = min(ans, anstmp)\n return\n for i in range(2):\n blst[index - 1] = i\n dfs(index + 1)\n return\n \n N, K = map(int, input().split())\n a = list(map(int, input().split()))\n blst = [0] * (N - 1)\n-a1 = a[0]\n-ans = 10 ** 18\n dfs(1)\n \n print(ans)\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 26 }, { "user_id": "u775681539", "problem_id": "p03752", "submission1_id": "s351186241", "submission2_id": "s117712005", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import combinations\nINF = int(1e18)\ndef main():\n n, k = map(int, input().split())\n a = [int(i) for i in input().split()]\n p = [i for i in range(1,n)]\n \n \n ans = INF\n for i in combinations(p, k-1):\n s = set(i)\n cost = 0\n mx = a[0]\n for j in range(1, n):\n if j in s:\n if a[j] > mx:\n continue\n mx += 1\n cost += mx-a[j]\n mx = max(mx, a[j])\n ans = min(cost, ans) \n print(ans)\nmain()", "code2": "from itertools import combinations\nINF = int(1e18)\ndef main():\n n, k = map(int, input().split())\n a = [int(i) for i in input().split()]\n p = [i for i in range(1,n)]\n \n \n ans = INF\n for i in combinations(p, k-1):\n s = set(i)\n cost = 0\n mx = a[0]\n for j in range(1, n):\n if j in s:\n if a[j] > mx:\n mx = a[j]\n continue\n mx += 1\n cost += mx-a[j]\n mx = max(mx, a[j])\n ans = min(cost, ans) \n print(ans)\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586896076", "date2": "1586896532", "bleu_score": "0.9483202165108889", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 33, "total_score": 101, "input": "5 5\n1993 607 9355 3469 4674\n", "actual_output": "1387\n", "expected_output": "11957\n\n", "anno_code": ["from itertools import combinations\nINF = int(1e18) # (0): INF=1000000000000000000\ndef main(): # (1): main=\n n, k = map(int, input().split()) # (3): n=5, k=5\n a = [int(i) for i in input().split()] # (4): a=[1993, 607, 9355, 3469, 4674]\n p = [i for i in range(1,n)] # (5): p=[1, 2, 3, 4]\n \n \n ans = INF # (6): ans=1000000000000000000\n for i in combinations(p, k-1): # (7): i=(1, 2, 3, 4) (31): NO CHANGE\n s = set(i) # (8): s={1, 2, 3, 4}\n cost = 0 # (9): cost=0\n mx = a[0] # (10): mx=1993\n for j in range(1, n): # (11): j=1 (17): j=2 ... (29): NO CHANGE\n if j in s: # (12): NO CHANGE (18): NO CHANGE ... (26): NO CHANGE\n if a[j] > mx: # (13): NO CHANGE (19): NO CHANGE ... (27): NO CHANGE\n continue # (20): NO CHANGE (24): NO CHANGE (28): NO CHANGE\n mx += 1 # (14): mx=1994\n cost += mx-a[j] # (15): cost=1387\n mx = max(mx, a[j]) # (16): NO CHANGE\n ans = min(cost, ans) # (30): ans=1387\n print(ans)\nmain() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " from itertools import combinations\n INF = int(1e18)\n def main():\n n, k = map(int, input().split())\n a = [int(i) for i in input().split()]\n p = [i for i in range(1,n)]\n \n \n ans = INF\n for i in combinations(p, k-1):\n s = set(i)\n cost = 0\n mx = a[0]\n for j in range(1, n):\n if j in s:\n if a[j] > mx:\n+ mx = a[j]\n continue\n mx += 1\n cost += mx-a[j]\n mx = max(mx, a[j])\n ans = min(cost, ans) \n print(ans)\n main()\n", "FL_content": " from itertools import combinations\n INF = int(1e18)\n def main():\n n, k = map(int, input().split())\n a = [int(i) for i in input().split()]\n p = [i for i in range(1,n)]\n \n \n ans = INF\n for i in combinations(p, k-1):\n s = set(i)\n cost = 0\n mx = a[0]\n for j in range(1, n):\n if j in s:\n if a[j] > mx:\n continue\n mx += 1\n cost += mx-a[j]\n mx = max(mx, a[j])\n ans = min(cost, ans) \n print(ans)\n main()\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u723711163", "problem_id": "p03752", "submission1_id": "s511720319", "submission2_id": "s237193211", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = map(int,input().split())\nA = list(map(int,input().split()))\n\nres = float('inf')\n\nfor i in range(1<>j)&1:\n paint += 1\n h = a[j]\n if cur is None:\n if j>0 and a[j-1]>=h:\n break\n else:\n cur = h\n else:\n min_h = max(cur, a[j-1])\n if h < min_h:\n add += (min_h+1) - h\n cur = min_h + 1\n a[j] = cur\n\n if paint == K:\n res = min(res, add)\n\nprint(res)\n", "code2": "N,K = map(int,input().split())\nA = list(map(int,input().split()))\n\nres = float('inf')\n\nfor i in range(1<>j)&1:\n paint += 1\n if a[j] <= cur:\n add += (cur+1) - a[j]\n a[j] = cur+1\n cur = max(cur, a[j])\n else:\n cur = max(cur, a[j])\n\n if paint == K:\n res = min(res, add)\n\nprint(res)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593783446", "date2": "1593784334", "bleu_score": "0.6708202648278713", "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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 101, "input": "5 2\n5960 3170 3598 610 3424\n", "actual_output": "175\n", "expected_output": "2363\n\n", "anno_code": ["N,K = map(int,input().split()) # (0): N=5, K=2\nA = list(map(int,input().split())) # (1): A=[5960, 3170, 3598, 610, 3424]\n\nres = float('inf') # (2): res=inf\n\nfor i in range(1<>j)&1: # (9): NO CHANGE (11): NO CHANGE ... (923): NO CHANGE\n paint += 1 # (27): paint=1 (51): paint=1 ... (924): paint=5\n h = a[j] # (28): h=5960 (52): h=3170 ... (925): h=3424\n if cur is None: # (29): NO CHANGE (53): NO CHANGE ... (926): NO CHANGE\n if j>0 and a[j-1]>=h: # (30): NO CHANGE (54): NO CHANGE ... (890): NO CHANGE\n break # (55): NO CHANGE (154): NO CHANGE ... (878): NO CHANGE\n else:\n cur = h # (31): cur=5960 (68): cur=5960 ... (891): cur=5960\n else:\n min_h = max(cur, a[j-1]) # (74): min_h=5960 (129): NO CHANGE ... (927): min_h=5963\n if h < min_h: # (75): NO CHANGE (130): NO CHANGE ... (928): NO CHANGE\n add += (min_h+1) - h # (76): add=2791 (131): add=2363 ... (929): add=13048\n cur = min_h + 1 # (77): cur=5961 (132): cur=5961 ... (930): cur=5964\n a[j] = cur # (78): a=[5960, 5961, 3598, 610, 3424] (133): a=[5960, 3170, 5961, 610, 3424] ... (931): a=[5960, 5961, 5962, 5963, 5964]\n\n if paint == K: # (19): NO CHANGE (41): NO CHANGE ... (933): NO CHANGE\n res = min(res, add) # (87): res=2791 (140): res=2363 ... (563): res=175\n\nprint(res)\n"], "anno_status": [true], "diff_content": " N,K = map(int,input().split())\n A = list(map(int,input().split()))\n \n res = float('inf')\n \n for i in range(1<>j)&1:\n paint += 1\n- h = a[j]\n- if cur is None:\n- if j>0 and a[j-1]>=h:\n- break\n- else:\n- cur = h\n- else:\n- min_h = max(cur, a[j-1])\n- if h < min_h:\n- add += (min_h+1) - h\n- cur = min_h + 1\n- a[j] = cur\n+ if a[j] <= cur:\n+ add += (cur+1) - a[j]\n+ a[j] = cur+1\n+ cur = max(cur, a[j])\n+ else:\n+ cur = max(cur, a[j])\n \n if paint == K:\n res = min(res, add)\n \n print(res)\n-\n", "FL_content": " N,K = map(int,input().split())\n A = list(map(int,input().split()))\n \n res = float('inf')\n \n for i in range(1<>j)&1:\n paint += 1\n- h = a[j]\n- if cur is None:\n- if j>0 and a[j-1]>=h:\n- break\n- else:\n- cur = h\n- else:\n- min_h = max(cur, a[j-1])\n- if h < min_h:\n- add += (min_h+1) - h\n- cur = min_h + 1\n- a[j] = cur\n \n if paint == K:\n res = min(res, add)\n \n print(res)\n-\n", "added_lines": 7, "removed_lines": 14, "code1_lines": 31 }, { "user_id": "u500297289", "problem_id": "p03675", "submission1_id": "s321809466", "submission2_id": "s397813296", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(input().split())\n\nb = []\nfor i in range(n):\n if i % 2 == 0:\n b.append(a[i])\n else:\n b.insert(0, a[i])\n\nprint(' '.join(b))\n", "code2": "from collections import deque\n\nn = int(input())\na = list(input().split())\n\nb = deque()\nfor i in range(n):\n if i % 2 == 0:\n b.append(a[i])\n else:\n b.appendleft(a[i])\nif n % 2 == 1:\n b.reverse()\n\nprint(' '.join(b))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558162696", "date2": "1558163172", "bleu_score": "0.6581855622869838", "code1_test_status": [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, 1, 1, 1, 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, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 75, "total_score": 90, "input": "3\n2 1 8\n", "actual_output": "1 2 8\n", "expected_output": "8 2 1\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(input().split()) # (1): a=['2', '1', '8']\n\nb = [] # (2): b=[]\nfor i in range(n): # (3): i=0 (6): i=1 ... (12): NO CHANGE\n if i % 2 == 0: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n b.append(a[i]) # (5): b=['2'] (11): b=['1', '2', '8']\n else:\n b.insert(0, a[i]) # (8): b=['1', '2']\n\nprint(' '.join(b))\n"], "anno_status": [true], "diff_content": "+from collections import deque\n+\n n = int(input())\n a = list(input().split())\n \n-b = []\n+b = deque()\n for i in range(n):\n if i % 2 == 0:\n b.append(a[i])\n else:\n- b.insert(0, a[i])\n+ b.appendleft(a[i])\n+if n % 2 == 1:\n+ b.reverse()\n \n print(' '.join(b))\n \n", "FL_content": " n = int(input())\n a = list(input().split())\n \n-b = []\n for i in range(n):\n if i % 2 == 0:\n b.append(a[i])\n else:\n- b.insert(0, a[i])\n \n print(' '.join(b))\n \n", "added_lines": 6, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u835482198", "problem_id": "p03675", "submission1_id": "s736316789", "submission2_id": "s739977998", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\ns = input().split()\n\n\n\n\n\n\n\n\nans = []\nif N % 2 == 1:\n for ss in s[::-1][0::2]:\n ans.append(ss[::-1])\n for ss in s[1::2]:\n ans.append(ss)\nelse:\n for ss in s[::-1][0::2]:\n ans.append(ss[::-1])\n for ss in s[0::2]:\n ans.append(ss)\nprint(\" \".join(ans))\n", "code2": "N = int(input())\ns = input().split()\n\n\n\n\n\n\n\n\nans = []\nif N % 2 == 1:\n for ss in s[::-1][0::2]:\n ans.append(ss)\n for ss in s[1::2]:\n ans.append(ss)\nelse:\n for ss in s[::-1][0::2]:\n ans.append(ss)\n for ss in s[0::2]:\n ans.append(ss)\nprint(\" \".join(ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1500867972", "date2": "1500868103", "bleu_score": "0.9497682601461668", "code1_test_status": [1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 38, "total_score": 90, "input": "6\n0 39 1 75 15 0\n", "actual_output": "0 57 93 0 1 15\n", "expected_output": "0 75 39 0 1 15\n\n", "anno_code": ["N = int(input()) # (0): N=6\ns = input().split() # (1): s=['0', '39', '1', '75', '15', '0']\n\n\n\n\n\n\n\n\nans = [] # (2): ans=[]\nif N % 2 == 1: # (3): NO CHANGE\n for ss in s[::-1][0::2]:\n ans.append(ss[::-1])\n for ss in s[1::2]:\n ans.append(ss)\nelse:\n for ss in s[::-1][0::2]: # (4): ss=0 (6): ss=75 ... (10): NO CHANGE\n ans.append(ss[::-1]) # (5): ans=['0'] (7): ans=['0', '57'] (9): ans=['0', '57', '93']\n for ss in s[0::2]: # (11): ss=0 (13): ss=1 ... (17): NO CHANGE\n ans.append(ss) # (12): ans=['0', '57', '93', '0'] (14): ans=['0', '57', '93', '0', '1'] (16): ans=['0', '57', '93', '0', '1', '15']\nprint(\" \".join(ans))\n"], "anno_status": [true], "diff_content": " N = int(input())\n s = input().split()\n \n \n \n \n \n \n \n \n ans = []\n if N % 2 == 1:\n for ss in s[::-1][0::2]:\n- ans.append(ss[::-1])\n+ ans.append(ss)\n for ss in s[1::2]:\n ans.append(ss)\n else:\n for ss in s[::-1][0::2]:\n- ans.append(ss[::-1])\n+ ans.append(ss)\n for ss in s[0::2]:\n ans.append(ss)\n print(\" \".join(ans))\n \n", "FL_content": " N = int(input())\n s = input().split()\n \n \n \n \n \n \n \n \n ans = []\n if N % 2 == 1:\n for ss in s[::-1][0::2]:\n- ans.append(ss[::-1])\n for ss in s[1::2]:\n ans.append(ss)\n else:\n for ss in s[::-1][0::2]:\n- ans.append(ss[::-1])\n for ss in s[0::2]:\n ans.append(ss)\n print(\" \".join(ans))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u619819312", "problem_id": "p03675", "submission1_id": "s662305420", "submission2_id": "s039212889", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(str,input().split()))\ns=list(reversed(a[1::2]))+a[::2]\nc=\"\"\nfor i in range(n):\n c+=s[i]+\" \"\nprint(c)", "code2": "n=int(input())\na=list(map(str,input().split()))\nif n%2!=1:\n s=list(reversed(a[1::2]))+a[::2]\nelse:\n s=list(reversed(a[::2]))+a[1::2]\nc=\"\"\nfor i in range(n):\n c+=s[i]+\" \"\nprint(c)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549998111", "date2": "1549999051", "bleu_score": "0.6791506385871212", "code1_test_status": [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, 1, 1, 1, 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, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 75, "total_score": 90, "input": "3\n6 2 3\n", "actual_output": "2 6 3 \n", "expected_output": "3 6 2\n\n", "anno_code": ["n=int(input()) # (0): n=3\na=list(map(str,input().split())) # (1): a=['6', '2', '3']\ns=list(reversed(a[1::2]))+a[::2] # (2): s=['2', '6', '3']\nc=\"\" # (3): c=\nfor i in range(n): # (4): i=0 (6): i=1 ... (10): NO CHANGE\n c+=s[i]+\" \" # (5): c=2 (7): c=2 6 (9): c=2 6 3 \nprint(c)"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(str,input().split()))\n-s=list(reversed(a[1::2]))+a[::2]\n+if n%2!=1:\n+ s=list(reversed(a[1::2]))+a[::2]\n+else:\n+ s=list(reversed(a[::2]))+a[1::2]\n c=\"\"\n for i in range(n):\n c+=s[i]+\" \"\n print(c)\n", "FL_content": " n=int(input())\n a=list(map(str,input().split()))\n-s=list(reversed(a[1::2]))+a[::2]\n c=\"\"\n for i in range(n):\n c+=s[i]+\" \"\n print(c)\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u993435350", "problem_id": "p03675", "submission1_id": "s888346405", "submission2_id": "s992936020", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nN = int(stdin.readline().rstrip())\nA = stdin.readline().rstrip().split()\n\nB = A[::-1]\n\nans = \"\"\n\nif N % 2 == 0:\n for i in range(0,N,2):\n ans += B[i]\n for i in range(0,N,2):\n ans += A[i]\n \nelse:\n for i in range(0,N,2):\n ans += B[i]\n for i in range(1,N,2):\n ans += B[i]\n\nprint(*list(ans))", "code2": "from sys import stdin\n\nN = int(stdin.readline().rstrip())\nA = stdin.readline().rstrip().split()\n\nB = A[::-1]\n\nans = []\n\nif N % 2 == 0:\n for i in range(0,N,2):\n ans += [B[i]]\n for i in range(0,N,2):\n ans += [A[i]]\n \nelse:\n for i in range(0,N,2):\n ans += [B[i]]\n for i in range(1,N,2):\n ans += [A[i]]\n\nprint(*list(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580181199", "date2": "1580181404", "bleu_score": "0.934867275655354", "code1_test_status": [1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 20, "total_score": 90, "input": "6\n0 39 1 80 15 0\n", "actual_output": "0 8 0 3 9 0 1 1 5\n", "expected_output": "0 80 39 0 1 15\n\n", "anno_code": ["from sys import stdin\n\nN = int(stdin.readline().rstrip()) # (0): N=6\nA = stdin.readline().rstrip().split() # (1): A=['0', '39', '1', '80', '15', '0']\n\nB = A[::-1] # (2): B=['0', '15', '80', '1', '39', '0']\n\nans = \"\" # (3): ans=\n\nif N % 2 == 0: # (4): NO CHANGE\n for i in range(0,N,2): # (5): i=0 (7): i=2 ... (11): NO CHANGE\n ans += B[i] # (6): ans=0 (8): ans=080 (10): ans=08039\n for i in range(0,N,2): # (12): i=0 (14): i=2 ... (18): NO CHANGE\n ans += A[i] # (13): ans=080390 (15): ans=0803901 (17): ans=080390115\n \nelse:\n for i in range(0,N,2):\n ans += B[i]\n for i in range(1,N,2):\n ans += B[i]\n\nprint(*list(ans))"], "anno_status": [true], "diff_content": " from sys import stdin\n \n N = int(stdin.readline().rstrip())\n A = stdin.readline().rstrip().split()\n \n B = A[::-1]\n \n-ans = \"\"\n+ans = []\n \n if N % 2 == 0:\n for i in range(0,N,2):\n- ans += B[i]\n+ ans += [B[i]]\n for i in range(0,N,2):\n- ans += A[i]\n+ ans += [A[i]]\n \n else:\n for i in range(0,N,2):\n- ans += B[i]\n+ ans += [B[i]]\n for i in range(1,N,2):\n- ans += B[i]\n+ ans += [A[i]]\n \n print(*list(ans))\n", "FL_content": " from sys import stdin\n \n N = int(stdin.readline().rstrip())\n A = stdin.readline().rstrip().split()\n \n B = A[::-1]\n \n-ans = \"\"\n \n if N % 2 == 0:\n for i in range(0,N,2):\n- ans += B[i]\n for i in range(0,N,2):\n- ans += A[i]\n \n else:\n for i in range(0,N,2):\n- ans += B[i]\n for i in range(1,N,2):\n- ans += B[i]\n \n print(*list(ans))\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 22 }, { "user_id": "u150117535", "problem_id": "p03675", "submission1_id": "s919656111", "submission2_id": "s951942759", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input()\nn=[x for x in input().split()]\nnb=n[::-1]\nbs=n[::2]\nif len(nb)%2==0:\n be=nb[::2]\nelse:\n be=nb[::2]\nif len(n)==1:\n print(n[0])\nelse:\n print(\" \".join(be+bs))", "code2": "input()\nn=[x for x in input().split()]\nnb=n[::-1]\nbs=n[::2]\nif len(nb)%2==0:\n be=nb[::2]\nelse:\n be=nb[1::2]\nif len(n)==1:\n print(n[0])\nelse:\n ans=be+bs\n if len(n)%2!=0:\n ans=ans[::-1]\n print(\" \".join(ans))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1498960104", "date2": "1499030038", "bleu_score": "0.7448566003092261", "code1_test_status": [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, 1, 1, 1, 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, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 90, "input": "3\n2 4 5\n", "actual_output": "5 2 2 5\n", "expected_output": "5 2 4\n\n", "anno_code": ["input() # (0): NO CHANGE\nn=[x for x in input().split()] # (1): n=['2', '4', '5']\nnb=n[::-1] # (2): nb=['5', '4', '2']\nbs=n[::2] # (3): bs=['2', '5']\nif len(nb)%2==0: # (4): NO CHANGE\n be=nb[::2]\nelse:\n be=nb[::2] # (5): be=['5', '2']\nif len(n)==1: # (6): NO CHANGE\n print(n[0])\nelse:\n print(\" \".join(be+bs))"], "anno_status": [true], "diff_content": " input()\n n=[x for x in input().split()]\n nb=n[::-1]\n bs=n[::2]\n if len(nb)%2==0:\n be=nb[::2]\n else:\n- be=nb[::2]\n+ be=nb[1::2]\n if len(n)==1:\n print(n[0])\n else:\n- print(\" \".join(be+bs))\n+ ans=be+bs\n+ if len(n)%2!=0:\n+ ans=ans[::-1]\n+ print(\" \".join(ans))\n", "FL_content": " input()\n n=[x for x in input().split()]\n nb=n[::-1]\n bs=n[::2]\n if len(nb)%2==0:\n be=nb[::2]\n else:\n- be=nb[::2]\n if len(n)==1:\n print(n[0])\n else:\n- print(\" \".join(be+bs))\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u473633103", "problem_id": "p03318", "submission1_id": "s528204101", "submission2_id": "s323716387", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nk = int(input())\n\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(15)):\n for j in reversed(range(1,100)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n):\n minN = n\n ans.append(num)\n \nfor i in list(reversed(ans))[:k]:\n print(i)", "code2": "\n\nk = int(input())\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(13)):\n minN = 10**15\n for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(int(num))\n\nfor i in list(sorted(list(set(ans))))[:k]:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529818166", "date2": "1529822747", "bleu_score": "0.854232910678284", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "131\n", "actual_output": "9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n299999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2999999\n3999999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n29999999\n39999999\n49999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n299999999\n399999999\n499999999\n599999999\n699999999\n799999999\n899999999\n999999999\n1099999999\n1199999999\n1299999999\n1399999999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n\n", "anno_code": ["\n\nk = int(input()) # (0): k=131\n\ncount = 0 # (1): count=0\nans = [] # (2): ans=[]\nminN = 10**15 # (3): minN=1000000000000000\n\nfor i in reversed(range(15)): # (4): i=14 (699): i=13 ... (8109): NO CHANGE\n for j in reversed(range(1,100)): # (5): j=99 (12): j=98 ... (8108): NO CHANGE\n num = str(j)+\"9\"*i # (6): num=9999999999999999 (13): num=9899999999999999 ... (8104): num=1\n n = sum([int(k) for k in num]) # (7): n=144 (14): n=143 ... (8105): NO CHANGE\n n = int(num)/n # (8): n=69444444444444.44 (15): n=69230769230769.23 ... (8106): NO CHANGE\n if(minN > n): # (9): NO CHANGE (16): NO CHANGE ... (8107): NO CHANGE\n minN = n # (10): minN=69444444444444.44 (17): minN=69230769230769.23 ... (8066): minN=1.0\n ans.append(num) # (11): ans=['9999999999999999'] (18): ans=['9999999999999999', '9899999999999999'] ... (8067): ans=[9999999999999999, 9899999999999999, ..., 19, 9]\n \nfor i in list(reversed(ans))[:k]: # (8110): i=9 (8112): i=19 ... (8370): i=1399999999\n print(i) # (8111): NO CHANGE (8113): NO CHANGE ... (8371): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(15)):\n- for j in reversed(range(1,100)):\n+for i in reversed(range(13)):\n+ minN = 10**15\n+ for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n- if(minN > n):\n+ if(minN > n or n==1):\n minN = n\n- ans.append(num)\n- \n-for i in list(reversed(ans))[:k]:\n+ ans.append(int(num))\n+\n+for i in list(sorted(list(set(ans))))[:k]:\n print(i)\n", "FL_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(15)):\n- for j in reversed(range(1,100)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n- if(minN > n):\n minN = n\n- ans.append(num)\n- \n-for i in list(reversed(ans))[:k]:\n print(i)\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 19 }, { "user_id": "u473633103", "problem_id": "p03318", "submission1_id": "s383636637", "submission2_id": "s323716387", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nk = int(input())\nk = 100\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(5)):\n for j in reversed(range(1,10**4)):\n num = str(j)+\"9\"*i*3\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(num)\n\nfor i in list(reversed(ans))[:k]:\n print(i)", "code2": "\n\nk = int(input())\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(13)):\n minN = 10**15\n for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(int(num))\n\nfor i in list(sorted(list(set(ans))))[:k]:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529821576", "date2": "1529822747", "bleu_score": "0.8782305539784611", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "122\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n k = int(input())\n-k = 100\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(5)):\n- for j in reversed(range(1,10**4)):\n- num = str(j)+\"9\"*i*3\n+for i in reversed(range(13)):\n+ minN = 10**15\n+ for j in reversed(range(1,10**3)):\n+ num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n+ ans.append(int(num))\n \n-for i in list(reversed(ans))[:k]:\n+for i in list(sorted(list(set(ans))))[:k]:\n print(i)\n", "FL_content": " \n \n k = int(input())\n-k = 100\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(5)):\n- for j in reversed(range(1,10**4)):\n- num = str(j)+\"9\"*i*3\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n \n-for i in list(reversed(ans))[:k]:\n print(i)\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 19 }, { "user_id": "u197300773", "problem_id": "p03318", "submission1_id": "s676634434", "submission2_id": "s441016981", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def f(n):\n s=str(n)\n return sum([int(s[i]) for i in range(len(s))])\n\nsunuke=[]\nfor i in range(100):\n for j in range(2,11):\n sunuke.append(j*(10**i)-1)\nL=len(sunuke)\ntmp=sunuke[L-1]/f(sunuke[L-1])\nans=[sunuke[L-1]]\nfor i in range(len(sunuke)-2,-1,-1):\n x=sunuke[i]/f(sunuke[i])\n if x<=tmp:\n ans.append(sunuke[i])\n tmp=x\nans=ans[::-1]\n\n \n\nfor i in range(int(input())):\n print(ans[i])\n", "code2": "def f(n):\n s=str(n)\n return sum([int(s[i]) for i in range(len(s))])\n\nsunuke=[]\nfor i in range(16):\n for j in range(1,500):\n sunuke.append(j*(10**i)-1)\n\nsunuke=list(set(sunuke))\nsunuke.sort()\nsunuke.pop(0)\nL=len(sunuke)\n\ntmp1,tmp2=sunuke[L-1],f(sunuke[L-1])\nans=[sunuke[L-1]]\nfor i in range(len(sunuke)-2,-1,-1):\n x=sunuke[i]\n if x*tmp2<=tmp1*f(x):\n ans.append(x)\n tmp1,tmp2=x,f(x)\n\nans.sort()\n\n \n\nfor i in range(int(input())):\n print(ans[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584366927", "date2": "1584383739", "bleu_score": "0.7911138829066675", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "240\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n19999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n199999\n299999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1999999\n2999999\n3999999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n19999999\n29999999\n39999999\n49999999\n59999999\n69999999\n79999999\n89999999\n99999999\n199999999\n299999999\n399999999\n499999999\n599999999\n699999999\n799999999\n899999999\n999999999\n1999999999\n2999999999\n3999999999\n4999999999\n5999999999\n6999999999\n7999999999\n8999999999\n9999999999\n19999999999\n29999999999\n39999999999\n49999999999\n59999999999\n69999999999\n79999999999\n89999999999\n99999999999\n199999999999\n299999999999\n399999999999\n499999999999\n599999999999\n699999999999\n799999999999\n899999999999\n999999999999\n1999999999999\n2999999999999\n3999999999999\n4999999999999\n5999999999999\n6999999999999\n7999999999999\n8999999999999\n9999999999999\n19999999999999\n29999999999999\n39999999999999\n49999999999999\n59999999999999\n69999999999999\n79999999999999\n89999999999999\n99999999999999\n199999999999999\n299999999999999\n399999999999999\n499999999999999\n599999999999999\n699999999999999\n799999999999999\n899999999999999\n999999999999999\n1999999999999999\n2999999999999999\n3999999999999999\n4999999999999999\n5999999999999999\n6999999999999999\n7999999999999999\n8999999999999999\n9999999999999999\n19999999999999999\n29999999999999999\n39999999999999999\n49999999999999999\n59999999999999999\n69999999999999999\n79999999999999999\n89999999999999999\n99999999999999999\n199999999999999999\n299999999999999999\n399999999999999999\n499999999999999999\n599999999999999999\n699999999999999999\n799999999999999999\n899999999999999999\n999999999999999999\n1999999999999999999\n2999999999999999999\n3999999999999999999\n4999999999999999999\n5999999999999999999\n6999999999999999999\n7999999999999999999\n8999999999999999999\n9999999999999999999\n19999999999999999999\n29999999999999999999\n39999999999999999999\n49999999999999999999\n59999999999999999999\n69999999999999999999\n79999999999999999999\n89999999999999999999\n99999999999999999999\n199999999999999999999\n299999999999999999999\n399999999999999999999\n499999999999999999999\n599999999999999999999\n699999999999999999999\n799999999999999999999\n899999999999999999999\n999999999999999999999\n1999999999999999999999\n2999999999999999999999\n3999999999999999999999\n4999999999999999999999\n5999999999999999999999\n6999999999999999999999\n7999999999999999999999\n8999999999999999999999\n9999999999999999999999\n19999999999999999999999\n29999999999999999999999\n39999999999999999999999\n49999999999999999999999\n59999999999999999999999\n69999999999999999999999\n79999999999999999999999\n89999999999999999999999\n99999999999999999999999\n199999999999999999999999\n299999999999999999999999\n399999999999999999999999\n499999999999999999999999\n599999999999999999999999\n699999999999999999999999\n799999999999999999999999\n899999999999999999999999\n999999999999999999999999\n1999999999999999999999999\n2999999999999999999999999\n3999999999999999999999999\n4999999999999999999999999\n5999999999999999999999999\n6999999999999999999999999\n7999999999999999999999999\n8999999999999999999999999\n9999999999999999999999999\n19999999999999999999999999\n29999999999999999999999999\n39999999999999999999999999\n49999999999999999999999999\n59999999999999999999999999\n69999999999999999999999999\n79999999999999999999999999\n89999999999999999999999999\n99999999999999999999999999\n199999999999999999999999999\n299999999999999999999999999\n399999999999999999999999999\n499999999999999999999999999\n599999999999999999999999999\n699999999999999999999999999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n32999999\n33999999\n34999999\n35999999\n36999999\n37999999\n38999999\n39999999\n40999999\n41999999\n42999999\n43999999\n44999999\n45999999\n46999999\n47999999\n48999999\n49999999\n50999999\n51999999\n52999999\n53999999\n54999999\n55999999\n56999999\n57999999\n58999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n209999999\n219999999\n229999999\n239999999\n249999999\n259999999\n269999999\n279999999\n289999999\n299999999\n309999999\n319999999\n329999999\n339999999\n349999999\n359999999\n369999999\n379999999\n389999999\n399999999\n409999999\n419999999\n429999999\n\n", "anno_code": ["def f(n): # (0): f=\n s=str(n) # (2005): f=, sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 19999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 199999, 299999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1999999, 2999999, 3999999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 19999999, 29999999, 39999999, 49999999, 59999999, 69999999, 79999999, 89999999, 99999999, 199999999, 299999999, 399999999, 499999999, 599999999, 699999999, 799999999, 899999999, 999999999, 1999999999, 2999999999, 3999999999, 4999999999, 5999999999, 6999999999, 7999999999, 8999999999, 9999999999, 19999999999, 29999999999, 39999999999, 49999999999, 59999999999, 69999999999, 79999999999, 89999999999, 99999999999, 199999999999, 299999999999, 399999999999, 499999999999, 599999999999, 699999999999, 799999999999, 899999999999, 999999999999, 1999999999999, 2999999999999, 3999999999999, 4999999999999, 5999999999999, 6999999999999, 7999999999999, 8999999999999, 9999999999999, 19999999999999, 29999999999999, 39999999999999, 49999999999999, 59999999999999, 69999999999999, 79999999999999, 89999999999999, 99999999999999, 199999999999999, 299999999999999, 399999999999999, 499999999999999, 599999999999999, 699999999999999, 799999999999999, 899999999999999, 999999999999999, 1999999999999999, 2999999999999999, 3999999999999999, 4999999999999999, 5999999999999999, 6999999999999999, 7999999999999999, 8999999999999999, 9999999999999999, 19999999999999999, 29999999999999999, 39999999999999999, 49999999999999999, 59999999999999999, 69999999999999999, 79999999999999999, 89999999999999999, 99999999999999999, 199999999999999999, 299999999999999999, 399999999999999999, 499999999999999999, 599999999999999999, 699999999999999999, 799999999999999999, 899999999999999999, 999999999999999999, 1999999999999999999, 2999999999999999999, 3999999999999999999, 4999999999999999999, 5999999999999999999, 6999999999999999999, 7999999999999999999, 8999999999999999999, 9999999999999999999, 19999999999999999999, 29999999999999999999, 39999999999999999999, 49999999999999999999, 59999999999999999999, 69999999999999999999, 79999999999999999999, 89999999999999999999, 99999999999999999999, 199999999999999999999, 299999999999999999999, 399999999999999999999, 499999999999999999999, 599999999999999999999, 699999999999999999999, 799999999999999999999, 899999999999999999999, 999999999999999999999, 1999999999999999999999, 2999999999999999999999, 3999999999999999999999, 4999999999999999999999, 5999999999999999999999, 6999999999999999999999, 7999999999999999999999, 8999999999999999999999, 9999999999999999999999, 19999999999999999999999, 29999999999999999999999, 39999999999999999999999, 49999999999999999999999, 59999999999999999999999, 69999999999999999999999, 79999999999999999999999, 89999999999999999999999, 99999999999999999999999, 199999999999999999999999, 299999999999999999999999, 399999999999999999999999, 499999999999999999999999, 599999999999999999999999, 699999999999999999999999, 799999999999999999999999, 899999999999999999999999, 999999999999999999999999, 1999999999999999999999999, 2999999999999999999999999, 3999999999999999999999999, 4999999999999999999999999, 5999999999999999999999999, 6999999999999999999999999, 7999999999999999999999999, 8999999999999999999999999, 9999999999999999999999999, 19999999999999999999999999, 29999999999999999999999999, 39999999999999999999999999, 49999999999999999999999999, 59999999999999999999999999, 69999999999999999999999999, 79999999999999999999999999, 89999999999999999999999999, 99999999999999999999999999, 199999999999999999999999999, 299999999999999999999999999, 399999999999999999999999999, 499999999999999999999999999, 599999999999999999999999999, 699999999999999999999999999, 799999999999999999999999999, 899999999999999999999999999, 999999999999999999999999999, 1999999999999999999999999999, 2999999999999999999999999999, 3999999999999999999999999999, 4999999999999999999999999999, 5999999999999999999999999999, 6999999999999999999999999999, 7999999999999999999999999999, 8999999999999999999999999999, 9999999999999999999999999999, 19999999999999999999999999999, 29999999999999999999999999999, 39999999999999999999999999999, 49999999999999999999999999999, 59999999999999999999999999999, 69999999999999999999999999999, 79999999999999999999999999999, 89999999999999999999999999999, 99999999999999999999999999999, 199999999999999999999999999999, 299999999999999999999999999999, 399999999999999999999999999999, 499999999999999999999999999999, 599999999999999999999999999999, 699999999999999999999999999999, 799999999999999999999999999999, 899999999999999999999999999999, 999999999999999999999999999999, 1999999999999999999999999999999, 2999999999999999999999999999999, 3999999999999999999999999999999, 4999999999999999999999999999999, 5999999999999999999999999999999, 6999999999999999999999999999999, 7999999999999999999999999999999, 8999999999999999999999999999999, 9999999999999999999999999999999, 19999999999999999999999999999999, 29999999999999999999999999999999, 39999999999999999999999999999999, 49999999999999999999999999999999, 59999999999999999999999999999999, 69999999999999999999999999999999, 79999999999999999999999999999999, 89999999999999999999999999999999, 99999999999999999999999999999999, 199999999999999999999999999999999, 299999999999999999999999999999999, 399999999999999999999999999999999, 499999999999999999999999999999999, 599999999999999999999999999999999, 699999999999999999999999999999999, 799999999999999999999999999999999, 899999999999999999999999999999999, 999999999999999999999999999999999, 1999999999999999999999999999999999, 2999999999999999999999999999999999, 3999999999999999999999999999999999, 4999999999999999999999999999999999, 5999999999999999999999999999999999, 6999999999999999999999999999999999, 7999999999999999999999999999999999, 8999999999999999999999999999999999, 9999999999999999999999999999999999, 19999999999999999999999999999999999, 29999999999999999999999999999999999, 39999999999999999999999999999999999, 49999999999999999999999999999999999, 59999999999999999999999999999999999, 69999999999999999999999999999999999, 79999999999999999999999999999999999, 89999999999999999999999999999999999, 99999999999999999999999999999999999, 199999999999999999999999999999999999, 299999999999999999999999999999999999, 399999999999999999999999999999999999, 499999999999999999999999999999999999, 599999999999999999999999999999999999, 699999999999999999999999999999999999, 799999999999999999999999999999999999, 899999999999999999999999999999999999, 999999999999999999999999999999999999, 1999999999999999999999999999999999999, 2999999999999999999999999999999999999, 3999999999999999999999999999999999999, 4999999999999999999999999999999999999, 5999999999999999999999999999999999999, 6999999999999999999999999999999999999, 7999999999999999999999999999999999999, 8999999999999999999999999999999999999, 9999999999999999999999999999999999999, 19999999999999999999999999999999999999, 29999999999999999999999999999999999999, 39999999999999999999999999999999999999, 49999999999999999999999999999999999999, 59999999999999999999999999999999999999, 69999999999999999999999999999999999999, 79999999999999999999999999999999999999, 89999999999999999999999999999999999999, 99999999999999999999999999999999999999, 199999999999999999999999999999999999999, 299999999999999999999999999999999999999, 399999999999999999999999999999999999999, 499999999999999999999999999999999999999, 599999999999999999999999999999999999999, 699999999999999999999999999999999999999, 799999999999999999999999999999999999999, 899999999999999999999999999999999999999, 999999999999999999999999999999999999999, 1999999999999999999999999999999999999999, 2999999999999999999999999999999999999999, 3999999999999999999999999999999999999999, 4999999999999999999999999999999999999999, 5999999999999999999999999999999999999999, 6999999999999999999999999999999999999999, 7999999999999999999999999999999999999999, 8999999999999999999999999999999999999999, 9999999999999999999999999999999999999999, 19999999999999999999999999999999999999999, 29999999999999999999999999999999999999999, 39999999999999999999999999999999999999999, 49999999999999999999999999999999999999999, 59999999999999999999999999999999999999999, 69999999999999999999999999999999999999999, 79999999999999999999999999999999999999999, 89999999999999999999999999999999999999999, 99999999999999999999999999999999999999999, 199999999999999999999999999999999999999999, 299999999999999999999999999999999999999999, 399999999999999999999999999999999999999999, 499999999999999999999999999999999999999999, 599999999999999999999999999999999999999999, 699999999999999999999999999999999999999999, 799999999999999999999999999999999999999999, 899999999999999999999999999999999999999999, 999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999], i=99, j=10, L=900, tmp=11111111111111110242276296028624068601940497162559234427628349879853064628693050103924118710648832 (2009): f=, sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 19999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 199999, 299999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1999999, 2999999, 3999999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 19999999, 29999999, 39999999, 49999999, 59999999, 69999999, 79999999, 89999999, 99999999, 199999999, 299999999, 399999999, 499999999, 599999999, 699999999, 799999999, 899999999, 999999999, 1999999999, 2999999999, 3999999999, 4999999999, 5999999999, 6999999999, 7999999999, 8999999999, 9999999999, 19999999999, 29999999999, 39999999999, 49999999999, 59999999999, 69999999999, 79999999999, 89999999999, 99999999999, 199999999999, 299999999999, 399999999999, 499999999999, 599999999999, 699999999999, 799999999999, 899999999999, 999999999999, 1999999999999, 2999999999999, 3999999999999, 4999999999999, 5999999999999, 6999999999999, 7999999999999, 8999999999999, 9999999999999, 19999999999999, 29999999999999, 39999999999999, 49999999999999, 59999999999999, 69999999999999, 79999999999999, 89999999999999, 99999999999999, 199999999999999, 299999999999999, 399999999999999, 499999999999999, 599999999999999, 699999999999999, 799999999999999, 899999999999999, 999999999999999, 1999999999999999, 2999999999999999, 3999999999999999, 4999999999999999, 5999999999999999, 6999999999999999, 7999999999999999, 8999999999999999, 9999999999999999, 19999999999999999, 29999999999999999, 39999999999999999, 49999999999999999, 59999999999999999, 69999999999999999, 79999999999999999, 89999999999999999, 99999999999999999, 199999999999999999, 299999999999999999, 399999999999999999, 499999999999999999, 599999999999999999, 699999999999999999, 799999999999999999, 899999999999999999, 999999999999999999, 1999999999999999999, 2999999999999999999, 3999999999999999999, 4999999999999999999, 5999999999999999999, 6999999999999999999, 7999999999999999999, 8999999999999999999, 9999999999999999999, 19999999999999999999, 29999999999999999999, 39999999999999999999, 49999999999999999999, 59999999999999999999, 69999999999999999999, 79999999999999999999, 89999999999999999999, 99999999999999999999, 199999999999999999999, 299999999999999999999, 399999999999999999999, 499999999999999999999, 599999999999999999999, 699999999999999999999, 799999999999999999999, 899999999999999999999, 999999999999999999999, 1999999999999999999999, 2999999999999999999999, 3999999999999999999999, 4999999999999999999999, 5999999999999999999999, 6999999999999999999999, 7999999999999999999999, 8999999999999999999999, 9999999999999999999999, 19999999999999999999999, 29999999999999999999999, 39999999999999999999999, 49999999999999999999999, 59999999999999999999999, 69999999999999999999999, 79999999999999999999999, 89999999999999999999999, 99999999999999999999999, 199999999999999999999999, 299999999999999999999999, 399999999999999999999999, 499999999999999999999999, 599999999999999999999999, 699999999999999999999999, 799999999999999999999999, 899999999999999999999999, 999999999999999999999999, 1999999999999999999999999, 2999999999999999999999999, 3999999999999999999999999, 4999999999999999999999999, 5999999999999999999999999, 6999999999999999999999999, 7999999999999999999999999, 8999999999999999999999999, 9999999999999999999999999, 19999999999999999999999999, 29999999999999999999999999, 39999999999999999999999999, 49999999999999999999999999, 59999999999999999999999999, 69999999999999999999999999, 79999999999999999999999999, 89999999999999999999999999, 99999999999999999999999999, 199999999999999999999999999, 299999999999999999999999999, 399999999999999999999999999, 499999999999999999999999999, 599999999999999999999999999, 699999999999999999999999999, 799999999999999999999999999, 899999999999999999999999999, 999999999999999999999999999, 1999999999999999999999999999, 2999999999999999999999999999, 3999999999999999999999999999, 4999999999999999999999999999, 5999999999999999999999999999, 6999999999999999999999999999, 7999999999999999999999999999, 8999999999999999999999999999, 9999999999999999999999999999, 19999999999999999999999999999, 29999999999999999999999999999, 39999999999999999999999999999, 49999999999999999999999999999, 59999999999999999999999999999, 69999999999999999999999999999, 79999999999999999999999999999, 89999999999999999999999999999, 99999999999999999999999999999, 199999999999999999999999999999, 299999999999999999999999999999, 399999999999999999999999999999, 499999999999999999999999999999, 599999999999999999999999999999, 699999999999999999999999999999, 799999999999999999999999999999, 899999999999999999999999999999, 999999999999999999999999999999, 1999999999999999999999999999999, 2999999999999999999999999999999, 3999999999999999999999999999999, 4999999999999999999999999999999, 5999999999999999999999999999999, 6999999999999999999999999999999, 7999999999999999999999999999999, 8999999999999999999999999999999, 9999999999999999999999999999999, 19999999999999999999999999999999, 29999999999999999999999999999999, 39999999999999999999999999999999, 49999999999999999999999999999999, 59999999999999999999999999999999, 69999999999999999999999999999999, 79999999999999999999999999999999, 89999999999999999999999999999999, 99999999999999999999999999999999, 199999999999999999999999999999999, 299999999999999999999999999999999, 399999999999999999999999999999999, 499999999999999999999999999999999, 599999999999999999999999999999999, 699999999999999999999999999999999, 799999999999999999999999999999999, 899999999999999999999999999999999, 999999999999999999999999999999999, 1999999999999999999999999999999999, 2999999999999999999999999999999999, 3999999999999999999999999999999999, 4999999999999999999999999999999999, 5999999999999999999999999999999999, 6999999999999999999999999999999999, 7999999999999999999999999999999999, 8999999999999999999999999999999999, 9999999999999999999999999999999999, 19999999999999999999999999999999999, 29999999999999999999999999999999999, 39999999999999999999999999999999999, 49999999999999999999999999999999999, 59999999999999999999999999999999999, 69999999999999999999999999999999999, 79999999999999999999999999999999999, 89999999999999999999999999999999999, 99999999999999999999999999999999999, 199999999999999999999999999999999999, 299999999999999999999999999999999999, 399999999999999999999999999999999999, 499999999999999999999999999999999999, 599999999999999999999999999999999999, 699999999999999999999999999999999999, 799999999999999999999999999999999999, 899999999999999999999999999999999999, 999999999999999999999999999999999999, 1999999999999999999999999999999999999, 2999999999999999999999999999999999999, 3999999999999999999999999999999999999, 4999999999999999999999999999999999999, 5999999999999999999999999999999999999, 6999999999999999999999999999999999999, 7999999999999999999999999999999999999, 8999999999999999999999999999999999999, 9999999999999999999999999999999999999, 19999999999999999999999999999999999999, 29999999999999999999999999999999999999, 39999999999999999999999999999999999999, 49999999999999999999999999999999999999, 59999999999999999999999999999999999999, 69999999999999999999999999999999999999, 79999999999999999999999999999999999999, 89999999999999999999999999999999999999, 99999999999999999999999999999999999999, 199999999999999999999999999999999999999, 299999999999999999999999999999999999999, 399999999999999999999999999999999999999, 499999999999999999999999999999999999999, 599999999999999999999999999999999999999, 699999999999999999999999999999999999999, 799999999999999999999999999999999999999, 899999999999999999999999999999999999999, 999999999999999999999999999999999999999, 1999999999999999999999999999999999999999, 2999999999999999999999999999999999999999, 3999999999999999999999999999999999999999, 4999999999999999999999999999999999999999, 5999999999999999999999999999999999999999, 6999999999999999999999999999999999999999, 7999999999999999999999999999999999999999, 8999999999999999999999999999999999999999, 9999999999999999999999999999999999999999, 19999999999999999999999999999999999999999, 29999999999999999999999999999999999999999, 39999999999999999999999999999999999999999, 49999999999999999999999999999999999999999, 59999999999999999999999999999999999999999, 69999999999999999999999999999999999999999, 79999999999999999999999999999999999999999, 89999999999999999999999999999999999999999, 99999999999999999999999999999999999999999, 199999999999999999999999999999999999999999, 299999999999999999999999999999999999999999, 399999999999999999999999999999999999999999, 499999999999999999999999999999999999999999, 599999999999999999999999999999999999999999, 699999999999999999999999999999999999999999, 799999999999999999999999999999999999999999, 899999999999999999999999999999999999999999, 999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999], i=898, j=10, L=900, tmp=11111111111111110242276296028624068601940497162559234427628349879853064628693050103924118710648832, ans=[9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999], x=10011123470522803817384497428669890794996511282360654285910639878784097007633372947358434075869184 ... (7397): f=, sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 19999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 199999, 299999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1999999, 2999999, 3999999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 19999999, 29999999, 39999999, 49999999, 59999999, 69999999, 79999999, 89999999, 99999999, 199999999, 299999999, 399999999, 499999999, 599999999, 699999999, 799999999, 899999999, 999999999, 1999999999, 2999999999, 3999999999, 4999999999, 5999999999, 6999999999, 7999999999, 8999999999, 9999999999, 19999999999, 29999999999, 39999999999, 49999999999, 59999999999, 69999999999, 79999999999, 89999999999, 99999999999, 199999999999, 299999999999, 399999999999, 499999999999, 599999999999, 699999999999, 799999999999, 899999999999, 999999999999, 1999999999999, 2999999999999, 3999999999999, 4999999999999, 5999999999999, 6999999999999, 7999999999999, 8999999999999, 9999999999999, 19999999999999, 29999999999999, 39999999999999, 49999999999999, 59999999999999, 69999999999999, 79999999999999, 89999999999999, 99999999999999, 199999999999999, 299999999999999, 399999999999999, 499999999999999, 599999999999999, 699999999999999, 799999999999999, 899999999999999, 999999999999999, 1999999999999999, 2999999999999999, 3999999999999999, 4999999999999999, 5999999999999999, 6999999999999999, 7999999999999999, 8999999999999999, 9999999999999999, 19999999999999999, 29999999999999999, 39999999999999999, 49999999999999999, 59999999999999999, 69999999999999999, 79999999999999999, 89999999999999999, 99999999999999999, 199999999999999999, 299999999999999999, 399999999999999999, 499999999999999999, 599999999999999999, 699999999999999999, 799999999999999999, 899999999999999999, 999999999999999999, 1999999999999999999, 2999999999999999999, 3999999999999999999, 4999999999999999999, 5999999999999999999, 6999999999999999999, 7999999999999999999, 8999999999999999999, 9999999999999999999, 19999999999999999999, 29999999999999999999, 39999999999999999999, 49999999999999999999, 59999999999999999999, 69999999999999999999, 79999999999999999999, 89999999999999999999, 99999999999999999999, 199999999999999999999, 299999999999999999999, 399999999999999999999, 499999999999999999999, 599999999999999999999, 699999999999999999999, 799999999999999999999, 899999999999999999999, 999999999999999999999, 1999999999999999999999, 2999999999999999999999, 3999999999999999999999, 4999999999999999999999, 5999999999999999999999, 6999999999999999999999, 7999999999999999999999, 8999999999999999999999, 9999999999999999999999, 19999999999999999999999, 29999999999999999999999, 39999999999999999999999, 49999999999999999999999, 59999999999999999999999, 69999999999999999999999, 79999999999999999999999, 89999999999999999999999, 99999999999999999999999, 199999999999999999999999, 299999999999999999999999, 399999999999999999999999, 499999999999999999999999, 599999999999999999999999, 699999999999999999999999, 799999999999999999999999, 899999999999999999999999, 999999999999999999999999, 1999999999999999999999999, 2999999999999999999999999, 3999999999999999999999999, 4999999999999999999999999, 5999999999999999999999999, 6999999999999999999999999, 7999999999999999999999999, 8999999999999999999999999, 9999999999999999999999999, 19999999999999999999999999, 29999999999999999999999999, 39999999999999999999999999, 49999999999999999999999999, 59999999999999999999999999, 69999999999999999999999999, 79999999999999999999999999, 89999999999999999999999999, 99999999999999999999999999, 199999999999999999999999999, 299999999999999999999999999, 399999999999999999999999999, 499999999999999999999999999, 599999999999999999999999999, 699999999999999999999999999, 799999999999999999999999999, 899999999999999999999999999, 999999999999999999999999999, 1999999999999999999999999999, 2999999999999999999999999999, 3999999999999999999999999999, 4999999999999999999999999999, 5999999999999999999999999999, 6999999999999999999999999999, 7999999999999999999999999999, 8999999999999999999999999999, 9999999999999999999999999999, 19999999999999999999999999999, 29999999999999999999999999999, 39999999999999999999999999999, 49999999999999999999999999999, 59999999999999999999999999999, 69999999999999999999999999999, 79999999999999999999999999999, 89999999999999999999999999999, 99999999999999999999999999999, 199999999999999999999999999999, 299999999999999999999999999999, 399999999999999999999999999999, 499999999999999999999999999999, 599999999999999999999999999999, 699999999999999999999999999999, 799999999999999999999999999999, 899999999999999999999999999999, 999999999999999999999999999999, 1999999999999999999999999999999, 2999999999999999999999999999999, 3999999999999999999999999999999, 4999999999999999999999999999999, 5999999999999999999999999999999, 6999999999999999999999999999999, 7999999999999999999999999999999, 8999999999999999999999999999999, 9999999999999999999999999999999, 19999999999999999999999999999999, 29999999999999999999999999999999, 39999999999999999999999999999999, 49999999999999999999999999999999, 59999999999999999999999999999999, 69999999999999999999999999999999, 79999999999999999999999999999999, 89999999999999999999999999999999, 99999999999999999999999999999999, 199999999999999999999999999999999, 299999999999999999999999999999999, 399999999999999999999999999999999, 499999999999999999999999999999999, 599999999999999999999999999999999, 699999999999999999999999999999999, 799999999999999999999999999999999, 899999999999999999999999999999999, 999999999999999999999999999999999, 1999999999999999999999999999999999, 2999999999999999999999999999999999, 3999999999999999999999999999999999, 4999999999999999999999999999999999, 5999999999999999999999999999999999, 6999999999999999999999999999999999, 7999999999999999999999999999999999, 8999999999999999999999999999999999, 9999999999999999999999999999999999, 19999999999999999999999999999999999, 29999999999999999999999999999999999, 39999999999999999999999999999999999, 49999999999999999999999999999999999, 59999999999999999999999999999999999, 69999999999999999999999999999999999, 79999999999999999999999999999999999, 89999999999999999999999999999999999, 99999999999999999999999999999999999, 199999999999999999999999999999999999, 299999999999999999999999999999999999, 399999999999999999999999999999999999, 499999999999999999999999999999999999, 599999999999999999999999999999999999, 699999999999999999999999999999999999, 799999999999999999999999999999999999, 899999999999999999999999999999999999, 999999999999999999999999999999999999, 1999999999999999999999999999999999999, 2999999999999999999999999999999999999, 3999999999999999999999999999999999999, 4999999999999999999999999999999999999, 5999999999999999999999999999999999999, 6999999999999999999999999999999999999, 7999999999999999999999999999999999999, 8999999999999999999999999999999999999, 9999999999999999999999999999999999999, 19999999999999999999999999999999999999, 29999999999999999999999999999999999999, 39999999999999999999999999999999999999, 49999999999999999999999999999999999999, 59999999999999999999999999999999999999, 69999999999999999999999999999999999999, 79999999999999999999999999999999999999, 89999999999999999999999999999999999999, 99999999999999999999999999999999999999, 199999999999999999999999999999999999999, 299999999999999999999999999999999999999, 399999999999999999999999999999999999999, 499999999999999999999999999999999999999, 599999999999999999999999999999999999999, 699999999999999999999999999999999999999, 799999999999999999999999999999999999999, 899999999999999999999999999999999999999, 999999999999999999999999999999999999999, 1999999999999999999999999999999999999999, 2999999999999999999999999999999999999999, 3999999999999999999999999999999999999999, 4999999999999999999999999999999999999999, 5999999999999999999999999999999999999999, 6999999999999999999999999999999999999999, 7999999999999999999999999999999999999999, 8999999999999999999999999999999999999999, 9999999999999999999999999999999999999999, 19999999999999999999999999999999999999999, 29999999999999999999999999999999999999999, 39999999999999999999999999999999999999999, 49999999999999999999999999999999999999999, 59999999999999999999999999999999999999999, 69999999999999999999999999999999999999999, 79999999999999999999999999999999999999999, 89999999999999999999999999999999999999999, 99999999999999999999999999999999999999999, 199999999999999999999999999999999999999999, 299999999999999999999999999999999999999999, 399999999999999999999999999999999999999999, 499999999999999999999999999999999999999999, 599999999999999999999999999999999999999999, 699999999999999999999999999999999999999999, 799999999999999999999999999999999999999999, 899999999999999999999999999999999999999999, 999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 19999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 29999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 39999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 49999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 59999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 69999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 89999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 299999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 399999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 499999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 599999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 699999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 799999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 1999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 2999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 3999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 4999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 5999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 6999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999], i=0, j=10, L=900, tmp=1.0, ans=[9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, ..., 3, 2], x=1.0\n return sum([int(s[i]) for i in range(len(s))])\n\nsunuke=[] # (1): sunuke=[]\nfor i in range(100): # (2): i=0 (22): i=1 ... (2002): NO CHANGE\n for j in range(2,11): # (3): j=2 (5): j=3 ... (2001): NO CHANGE\n sunuke.append(j*(10**i)-1) # (4): sunuke=[1] (6): sunuke=[1, 2] ... (2000): sunuke=[1, 2, ..., 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999]\nL=len(sunuke) # (2003): L=900\ntmp=sunuke[L-1]/f(sunuke[L-1]) # (2004): n=9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\nans=[sunuke[L-1]] # (2006): ans=[9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999]\nfor i in range(len(sunuke)-2,-1,-1): # (2007): i=898 (2013): i=897 ... (7401): NO CHANGE\n x=sunuke[i]/f(sunuke[i]) # (2008): n=8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 (2014): n=7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 ... (7396): n=1\n if x<=tmp: # (2010): NO CHANGE (2016): NO CHANGE ... (7398): NO CHANGE\n ans.append(sunuke[i]) # (2011): ans=[9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999] (2017): ans=[9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 7999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999] ... (7399): ans=[9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, ..., 2, 1]\n tmp=x # (2012): tmp=10011123470522803817384497428669890794996511282360654285910639878784097007633372947358434075869184 (2018): tmp=8908685968819599215313159649221577733759715971417447716840840582404350776390598553866233362513920 ... (7400): NO CHANGE\nans=ans[::-1] # (7402): ans=[1, 2, ..., 8999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999]\n\n \n\nfor i in range(int(input())): # (7403): NO CHANGE (7405): i=1 ... (7881): i=239\n print(ans[i]) # (7404): NO CHANGE (7406): NO CHANGE ... (7882): NO CHANGE\n"], "anno_status": [false], "diff_content": " def f(n):\n s=str(n)\n return sum([int(s[i]) for i in range(len(s))])\n \n sunuke=[]\n-for i in range(100):\n- for j in range(2,11):\n+for i in range(16):\n+ for j in range(1,500):\n sunuke.append(j*(10**i)-1)\n+\n+sunuke=list(set(sunuke))\n+sunuke.sort()\n+sunuke.pop(0)\n L=len(sunuke)\n-tmp=sunuke[L-1]/f(sunuke[L-1])\n+\n+tmp1,tmp2=sunuke[L-1],f(sunuke[L-1])\n ans=[sunuke[L-1]]\n for i in range(len(sunuke)-2,-1,-1):\n- x=sunuke[i]/f(sunuke[i])\n- if x<=tmp:\n- ans.append(sunuke[i])\n- tmp=x\n-ans=ans[::-1]\n+ x=sunuke[i]\n+ if x*tmp2<=tmp1*f(x):\n+ ans.append(x)\n+ tmp1,tmp2=x,f(x)\n+\n+ans.sort()\n \n \n \n for i in range(int(input())):\n print(ans[i])\n-\n", "FL_content": " def f(n):\n s=str(n)\n return sum([int(s[i]) for i in range(len(s))])\n \n sunuke=[]\n-for i in range(100):\n- for j in range(2,11):\n sunuke.append(j*(10**i)-1)\n L=len(sunuke)\n-tmp=sunuke[L-1]/f(sunuke[L-1])\n ans=[sunuke[L-1]]\n for i in range(len(sunuke)-2,-1,-1):\n- x=sunuke[i]/f(sunuke[i])\n- if x<=tmp:\n- ans.append(sunuke[i])\n- tmp=x\n-ans=ans[::-1]\n \n \n \n for i in range(int(input())):\n print(ans[i])\n-\n", "added_lines": 14, "removed_lines": 9, "code1_lines": 23 }, { "user_id": "u808280993", "problem_id": "p03318", "submission1_id": "s154360269", "submission2_id": "s158438137", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nK = int(input())\n\n\nSunuke = [1, 2, 3, 4, 5, 6, 7, 8]\n\n\nif K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n\nelse:\n \n resi = K - len(Sunuke)\n \n digit = 1\n\n while resi > 0:\n \n for i in range(1, 10):\n num = i * (10**digit) - 1\n Sunuke.append(num)\n\n resi -= 1\n \n \n\n digit += 1\n\n\nfor i in range(K):\n print(Sunuke[i])", "code2": "\n\nK = int(input())\n\nSunuke = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\ndef ns(n):\n return n / sum(map(int, list((str(n)))))\n\n\nif K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n\nelse:\n \n resi = K - len(Sunuke)\n \n digit = 0\n snk = 9\n\n while resi > 0:\n nxt1 = snk + 10**digit\n nxt2 = snk + 10**(digit+1)\n\n \n if ns(nxt1) > ns(nxt2):\n digit +=1\n snk = nxt2\n Sunuke.append(snk)\n resi -= 1\n else:\n snk = nxt1\n Sunuke.append(snk)\n resi -= 1\n\n\nfor i in range(K):\n print(Sunuke[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529866284", "date2": "1529869488", "bleu_score": "0.626909463146553", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "175\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n19999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n199999\n299999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1999999\n2999999\n3999999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n19999999\n29999999\n39999999\n49999999\n59999999\n69999999\n79999999\n89999999\n99999999\n199999999\n299999999\n399999999\n499999999\n599999999\n699999999\n799999999\n899999999\n999999999\n1999999999\n2999999999\n3999999999\n4999999999\n5999999999\n6999999999\n7999999999\n8999999999\n9999999999\n19999999999\n29999999999\n39999999999\n49999999999\n59999999999\n69999999999\n79999999999\n89999999999\n99999999999\n199999999999\n299999999999\n399999999999\n499999999999\n599999999999\n699999999999\n799999999999\n899999999999\n999999999999\n1999999999999\n2999999999999\n3999999999999\n4999999999999\n5999999999999\n6999999999999\n7999999999999\n8999999999999\n9999999999999\n19999999999999\n29999999999999\n39999999999999\n49999999999999\n59999999999999\n69999999999999\n79999999999999\n89999999999999\n99999999999999\n199999999999999\n299999999999999\n399999999999999\n499999999999999\n599999999999999\n699999999999999\n799999999999999\n899999999999999\n999999999999999\n1999999999999999\n2999999999999999\n3999999999999999\n4999999999999999\n5999999999999999\n6999999999999999\n7999999999999999\n8999999999999999\n9999999999999999\n19999999999999999\n29999999999999999\n39999999999999999\n49999999999999999\n59999999999999999\n69999999999999999\n79999999999999999\n89999999999999999\n99999999999999999\n199999999999999999\n299999999999999999\n399999999999999999\n499999999999999999\n599999999999999999\n699999999999999999\n799999999999999999\n899999999999999999\n999999999999999999\n1999999999999999999\n2999999999999999999\n3999999999999999999\n4999999999999999999\n5999999999999999999\n6999999999999999999\n7999999999999999999\n8999999999999999999\n9999999999999999999\n19999999999999999999\n29999999999999999999\n39999999999999999999\n49999999999999999999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n\n", "anno_code": ["\n\nK = int(input()) # (0): K=175\n\n\nSunuke = [1, 2, 3, 4, 5, 6, 7, 8] # (1): Sunuke=[1, 2, 3, 4, 5, 6, 7, 8]\n\n\nif K <= len(Sunuke): # (2): NO CHANGE\n for i in range(K):\n print(Sunuke[i])\n\nelse:\n \n resi = K - len(Sunuke) # (3): resi=167\n \n digit = 1 # (4): digit=1\n\n while resi > 0: # (5): NO CHANGE (44): NO CHANGE ... (746): NO CHANGE\n \n for i in range(1, 10): # (6): i=1 (10): i=2 ... (744): NO CHANGE\n num = i * (10**digit) - 1 # (7): num=9 (11): num=19 ... (741): num=89999999999999999999\n Sunuke.append(num) # (8): Sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9] (12): Sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9, 19] ... (742): Sunuke=[1, 2, ..., 79999999999999999999, 89999999999999999999]\n\n resi -= 1 # (9): resi=166 (13): resi=165 ... (743): resi=-4\n \n \n\n digit += 1 # (43): digit=2 (82): digit=3 ... (745): digit=20\n\n\nfor i in range(K): # (747): i=0 (749): i=1 ... (1095): i=174\n print(Sunuke[i]) # (748): NO CHANGE (750): NO CHANGE ... (1096): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n \n K = int(input())\n \n+Sunuke = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n \n-Sunuke = [1, 2, 3, 4, 5, 6, 7, 8]\n+def ns(n):\n+ return n / sum(map(int, list((str(n)))))\n \n \n if K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n \n else:\n \n resi = K - len(Sunuke)\n \n- digit = 1\n+ digit = 0\n+ snk = 9\n \n while resi > 0:\n- \n- for i in range(1, 10):\n- num = i * (10**digit) - 1\n- Sunuke.append(num)\n+ nxt1 = snk + 10**digit\n+ nxt2 = snk + 10**(digit+1)\n \n+ \n+ if ns(nxt1) > ns(nxt2):\n+ digit +=1\n+ snk = nxt2\n+ Sunuke.append(snk)\n+ resi -= 1\n+ else:\n+ snk = nxt1\n+ Sunuke.append(snk)\n resi -= 1\n- \n- \n-\n- digit += 1\n \n \n for i in range(K):\n print(Sunuke[i])\n", "FL_content": " \n \n K = int(input())\n \n \n-Sunuke = [1, 2, 3, 4, 5, 6, 7, 8]\n \n \n if K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n \n else:\n \n resi = K - len(Sunuke)\n \n- digit = 1\n \n while resi > 0:\n- \n- for i in range(1, 10):\n- num = i * (10**digit) - 1\n- Sunuke.append(num)\n \n resi -= 1\n- \n- \n-\n- digit += 1\n \n \n for i in range(K):\n print(Sunuke[i])\n", "added_lines": 16, "removed_lines": 10, "code1_lines": 33 }, { "user_id": "u473633103", "problem_id": "p03318", "submission1_id": "s378038585", "submission2_id": "s323716387", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nk = int(input())\n\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(11)):\n for j in reversed(range(1,10**4)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(num)\n \n\nfor i in list(reversed(ans))[:k]:\n print(i)", "code2": "\n\nk = int(input())\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(13)):\n minN = 10**15\n for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(int(num))\n\nfor i in list(sorted(list(set(ans))))[:k]:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529818817", "date2": "1529822747", "bleu_score": "0.8838341919713267", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "225\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n299999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2999999\n3999999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n29999999\n39999999\n49999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n299999999\n399999999\n499999999\n599999999\n699999999\n799999999\n899999999\n999999999\n1099999999\n1199999999\n1299999999\n1399999999\n1499999999\n1599999999\n1699999999\n1799999999\n1899999999\n1999999999\n2999999999\n3999999999\n4999999999\n5999999999\n6999999999\n7999999999\n8999999999\n9999999999\n10999999999\n11999999999\n12999999999\n13999999999\n14999999999\n15999999999\n16999999999\n17999999999\n18999999999\n19999999999\n29999999999\n39999999999\n49999999999\n59999999999\n69999999999\n79999999999\n89999999999\n99999999999\n109999999999\n119999999999\n129999999999\n139999999999\n149999999999\n159999999999\n169999999999\n179999999999\n189999999999\n199999999999\n209999999999\n219999999999\n229999999999\n239999999999\n249999999999\n259999999999\n269999999999\n279999999999\n289999999999\n299999999999\n309999999999\n319999999999\n329999999999\n339999999999\n349999999999\n359999999999\n369999999999\n379999999999\n389999999999\n399999999999\n409999999999\n419999999999\n429999999999\n439999999999\n449999999999\n459999999999\n469999999999\n479999999999\n489999999999\n499999999999\n509999999999\n519999999999\n529999999999\n539999999999\n549999999999\n559999999999\n569999999999\n579999999999\n589999999999\n599999999999\n609999999999\n619999999999\n629999999999\n639999999999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n32999999\n33999999\n34999999\n35999999\n36999999\n37999999\n38999999\n39999999\n40999999\n41999999\n42999999\n43999999\n44999999\n45999999\n46999999\n47999999\n48999999\n49999999\n50999999\n51999999\n52999999\n53999999\n54999999\n55999999\n56999999\n57999999\n58999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n209999999\n219999999\n229999999\n239999999\n249999999\n259999999\n269999999\n279999999\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(11)):\n- for j in reversed(range(1,10**4)):\n+for i in reversed(range(13)):\n+ minN = 10**15\n+ for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n- \n+ ans.append(int(num))\n \n-for i in list(reversed(ans))[:k]:\n+for i in list(sorted(list(set(ans))))[:k]:\n print(i)\n", "FL_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(11)):\n- for j in reversed(range(1,10**4)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n- \n \n-for i in list(reversed(ans))[:k]:\n print(i)\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 20 }, { "user_id": "u832039789", "problem_id": "p03318", "submission1_id": "s082526760", "submission2_id": "s566338860", "status1": "Wrong Answer", "status2": "Accepted", "code1": "res = []\nfor digit in range(1,16):\n if digit<=3:\n for i in range(2,11):\n res.append(10**(digit-1)*i-1)\n elif 4<=digit<=12:\n for i in range(11,(digit-2)*10):\n res.append(i*10**(digit-2)-1)\n for i in range(digit-2,11):\n res.append(i*10**(digit-1)-1)\n elif digit==15:\n for i in range(101,110):\n res.append(i*10**(digit-3)-1)\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\n else:\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\nprint(res)\n", "code2": "res = []\nfor digit in range(1,16):\n if digit<=3:\n for i in range(2,11):\n res.append(10**(digit-1)*i-1)\n elif 4<=digit<=12:\n for i in range(11,(digit-2)*10):\n res.append(i*10**(digit-2)-1)\n for i in range(digit-2,11):\n res.append(i*10**(digit-1)-1)\n elif digit==15:\n for i in range(101,110):\n res.append(i*10**(digit-3)-1)\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\n else:\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\nfor i in range(int(input())):\n print(res[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535866365", "date2": "1535866411", "bleu_score": "0.9345561737236466", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "134\n", "actual_output": "[1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1099, 1199, 1299, 1399, 1499, 1599, 1699, 1799, 1899, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 10999, 11999, 12999, 13999, 14999, 15999, 16999, 17999, 18999, 19999, 20999, 21999, 22999, 23999, 24999, 25999, 26999, 27999, 28999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 109999, 119999, 129999, 139999, 149999, 159999, 169999, 179999, 189999, 199999, 209999, 219999, 229999, 239999, 249999, 259999, 269999, 279999, 289999, 299999, 309999, 319999, 329999, 339999, 349999, 359999, 369999, 379999, 389999, 399999, 499999, 599999, 699999, 799999, 899999, 999999, 1099999, 1199999, 1299999, 1399999, 1499999, 1599999, 1699999, 1799999, 1899999, 1999999, 2099999, 2199999, 2299999, 2399999, 2499999, 2599999, 2699999, 2799999, 2899999, 2999999, 3099999, 3199999, 3299999, 3399999, 3499999, 3599999, 3699999, 3799999, 3899999, 3999999, 4099999, 4199999, 4299999, 4399999, 4499999, 4599999, 4699999, 4799999, 4899999, 4999999, 5999999, 6999999, 7999999, 8999999, 9999999, 10999999, 11999999, 12999999, 13999999, 14999999, 15999999, 16999999, 17999999, 18999999, 19999999, 20999999, 21999999, 22999999, 23999999, 24999999, 25999999, 26999999, 27999999, 28999999, 29999999, 30999999, 31999999, 32999999, 33999999, 34999999, 35999999, 36999999, 37999999, 38999999, 39999999, 40999999, 41999999, 42999999, 43999999, 44999999, 45999999, 46999999, 47999999, 48999999, 49999999, 50999999, 51999999, 52999999, 53999999, 54999999, 55999999, 56999999, 57999999, 58999999, 59999999, 69999999, 79999999, 89999999, 99999999, 109999999, 119999999, 129999999, 139999999, 149999999, 159999999, 169999999, 179999999, 189999999, 199999999, 209999999, 219999999, 229999999, 239999999, 249999999, 259999999, 269999999, 279999999, 289999999, 299999999, 309999999, 319999999, 329999999, 339999999, 349999999, 359999999, 369999999, 379999999, 389999999, 399999999, 409999999, 419999999, 429999999, 439999999, 449999999, 459999999, 469999999, 479999999, 489999999, 499999999, 509999999, 519999999, 529999999, 539999999, 549999999, 559999999, 569999999, 579999999, 589999999, 599999999, 609999999, 619999999, 629999999, 639999999, 649999999, 659999999, 669999999, 679999999, 689999999, 699999999, 799999999, 899999999, 999999999, 1099999999, 1199999999, 1299999999, 1399999999, 1499999999, 1599999999, 1699999999, 1799999999, 1899999999, 1999999999, 2099999999, 2199999999, 2299999999, 2399999999, 2499999999, 2599999999, 2699999999, 2799999999, 2899999999, 2999999999, 3099999999, 3199999999, 3299999999, 3399999999, 3499999999, 3599999999, 3699999999, 3799999999, 3899999999, 3999999999, 4099999999, 4199999999, 4299999999, 4399999999, 4499999999, 4599999999, 4699999999, 4799999999, 4899999999, 4999999999, 5099999999, 5199999999, 5299999999, 5399999999, 5499999999, 5599999999, 5699999999, 5799999999, 5899999999, 5999999999, 6099999999, 6199999999, 6299999999, 6399999999, 6499999999, 6599999999, 6699999999, 6799999999, 6899999999, 6999999999, 7099999999, 7199999999, 7299999999, 7399999999, 7499999999, 7599999999, 7699999999, 7799999999, 7899999999, 7999999999, 8999999999, 9999999999, 10999999999, 11999999999, 12999999999, 13999999999, 14999999999, 15999999999, 16999999999, 17999999999, 18999999999, 19999999999, 20999999999, 21999999999, 22999999999, 23999999999, 24999999999, 25999999999, 26999999999, 27999999999, 28999999999, 29999999999, 30999999999, 31999999999, 32999999999, 33999999999, 34999999999, 35999999999, 36999999999, 37999999999, 38999999999, 39999999999, 40999999999, 41999999999, 42999999999, 43999999999, 44999999999, 45999999999, 46999999999, 47999999999, 48999999999, 49999999999, 50999999999, 51999999999, 52999999999, 53999999999, 54999999999, 55999999999, 56999999999, 57999999999, 58999999999, 59999999999, 60999999999, 61999999999, 62999999999, 63999999999, 64999999999, 65999999999, 66999999999, 67999999999, 68999999999, 69999999999, 70999999999, 71999999999, 72999999999, 73999999999, 74999999999, 75999999999, 76999999999, 77999999999, 78999999999, 79999999999, 80999999999, 81999999999, 82999999999, 83999999999, 84999999999, 85999999999, 86999999999, 87999999999, 88999999999, 89999999999, 99999999999, 109999999999, 119999999999, 129999999999, 139999999999, 149999999999, 159999999999, 169999999999, 179999999999, 189999999999, 199999999999, 209999999999, 219999999999, 229999999999, 239999999999, 249999999999, 259999999999, 269999999999, 279999999999, 289999999999, 299999999999, 309999999999, 319999999999, 329999999999, 339999999999, 349999999999, 359999999999, 369999999999, 379999999999, 389999999999, 399999999999, 409999999999, 419999999999, 429999999999, 439999999999, 449999999999, 459999999999, 469999999999, 479999999999, 489999999999, 499999999999, 509999999999, 519999999999, 529999999999, 539999999999, 549999999999, 559999999999, 569999999999, 579999999999, 589999999999, 599999999999, 609999999999, 619999999999, 629999999999, 639999999999, 649999999999, 659999999999, 669999999999, 679999999999, 689999999999, 699999999999, 709999999999, 719999999999, 729999999999, 739999999999, 749999999999, 759999999999, 769999999999, 779999999999, 789999999999, 799999999999, 809999999999, 819999999999, 829999999999, 839999999999, 849999999999, 859999999999, 869999999999, 879999999999, 889999999999, 899999999999, 909999999999, 919999999999, 929999999999, 939999999999, 949999999999, 959999999999, 969999999999, 979999999999, 989999999999, 999999999999, 1099999999999, 1199999999999, 1299999999999, 1399999999999, 1499999999999, 1599999999999, 1699999999999, 1799999999999, 1899999999999, 1999999999999, 2099999999999, 2199999999999, 2299999999999, 2399999999999, 2499999999999, 2599999999999, 2699999999999, 2799999999999, 2899999999999, 2999999999999, 3099999999999, 3199999999999, 3299999999999, 3399999999999, 3499999999999, 3599999999999, 3699999999999, 3799999999999, 3899999999999, 3999999999999, 4099999999999, 4199999999999, 4299999999999, 4399999999999, 4499999999999, 4599999999999, 4699999999999, 4799999999999, 4899999999999, 4999999999999, 5099999999999, 5199999999999, 5299999999999, 5399999999999, 5499999999999, 5599999999999, 5699999999999, 5799999999999, 5899999999999, 5999999999999, 6099999999999, 6199999999999, 6299999999999, 6399999999999, 6499999999999, 6599999999999, 6699999999999, 6799999999999, 6899999999999, 6999999999999, 7099999999999, 7199999999999, 7299999999999, 7399999999999, 7499999999999, 7599999999999, 7699999999999, 7799999999999, 7899999999999, 7999999999999, 8099999999999, 8199999999999, 8299999999999, 8399999999999, 8499999999999, 8599999999999, 8699999999999, 8799999999999, 8899999999999, 8999999999999, 9099999999999, 9199999999999, 9299999999999, 9399999999999, 9499999999999, 9599999999999, 9699999999999, 9799999999999, 9899999999999, 9999999999999, 10999999999999, 11999999999999, 12999999999999, 13999999999999, 14999999999999, 15999999999999, 16999999999999, 17999999999999, 18999999999999, 19999999999999, 20999999999999, 21999999999999, 22999999999999, 23999999999999, 24999999999999, 25999999999999, 26999999999999, 27999999999999, 28999999999999, 29999999999999, 30999999999999, 31999999999999, 32999999999999, 33999999999999, 34999999999999, 35999999999999, 36999999999999, 37999999999999, 38999999999999, 39999999999999, 40999999999999, 41999999999999, 42999999999999, 43999999999999, 44999999999999, 45999999999999, 46999999999999, 47999999999999, 48999999999999, 49999999999999, 50999999999999, 51999999999999, 52999999999999, 53999999999999, 54999999999999, 55999999999999, 56999999999999, 57999999999999, 58999999999999, 59999999999999, 60999999999999, 61999999999999, 62999999999999, 63999999999999, 64999999999999, 65999999999999, 66999999999999, 67999999999999, 68999999999999, 69999999999999, 70999999999999, 71999999999999, 72999999999999, 73999999999999, 74999999999999, 75999999999999, 76999999999999, 77999999999999, 78999999999999, 79999999999999, 80999999999999, 81999999999999, 82999999999999, 83999999999999, 84999999999999, 85999999999999, 86999999999999, 87999999999999, 88999999999999, 89999999999999, 90999999999999, 91999999999999, 92999999999999, 93999999999999, 94999999999999, 95999999999999, 96999999999999, 97999999999999, 98999999999999, 99999999999999, 100999999999999, 101999999999999, 102999999999999, 103999999999999, 104999999999999, 105999999999999, 106999999999999, 107999999999999, 108999999999999, 109999999999999, 119999999999999, 129999999999999, 139999999999999, 149999999999999, 159999999999999, 169999999999999, 179999999999999, 189999999999999, 199999999999999, 209999999999999, 219999999999999, 229999999999999, 239999999999999, 249999999999999, 259999999999999, 269999999999999, 279999999999999, 289999999999999, 299999999999999, 309999999999999, 319999999999999, 329999999999999, 339999999999999, 349999999999999, 359999999999999, 369999999999999, 379999999999999, 389999999999999, 399999999999999, 409999999999999, 419999999999999, 429999999999999, 439999999999999, 449999999999999, 459999999999999, 469999999999999, 479999999999999, 489999999999999, 499999999999999, 509999999999999, 519999999999999, 529999999999999, 539999999999999, 549999999999999, 559999999999999, 569999999999999, 579999999999999, 589999999999999, 599999999999999, 609999999999999, 619999999999999, 629999999999999, 639999999999999, 649999999999999, 659999999999999, 669999999999999, 679999999999999, 689999999999999, 699999999999999, 709999999999999, 719999999999999, 729999999999999, 739999999999999, 749999999999999, 759999999999999, 769999999999999, 779999999999999, 789999999999999, 799999999999999, 809999999999999, 819999999999999, 829999999999999, 839999999999999, 849999999999999, 859999999999999, 869999999999999, 879999999999999, 889999999999999, 899999999999999, 909999999999999, 919999999999999, 929999999999999, 939999999999999, 949999999999999, 959999999999999, 969999999999999, 979999999999999, 989999999999999, 999999999999999]\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n\n", "anno_code": ["res = [] # (0): res=[]\nfor digit in range(1,16): # (1): digit=1 (22): digit=2 ... (1655): NO CHANGE\n if digit<=3: # (2): NO CHANGE (23): NO CHANGE ... (1452): NO CHANGE\n for i in range(2,11): # (3): i=2 (5): i=3 ... (63): NO CHANGE\n res.append(10**(digit-1)*i-1) # (4): res=[1] (6): res=[1, 2] ... (62): res=[1, 2, ..., 899, 999]\n elif 4<=digit<=12: # (66): NO CHANGE (107): NO CHANGE ... (1453): NO CHANGE\n for i in range(11,(digit-2)*10): # (67): i=11 (69): i=12 ... (1077): NO CHANGE\n res.append(i*10**(digit-2)-1) # (68): res=[1, 2, ..., 999, 1099] (70): res=[1, 2, ..., 1099, 1199] ... (1076): res=[1, 2, ..., 979999999999, 989999999999]\n for i in range(digit-2,11): # (86): i=2 (88): i=3 ... (1080): NO CHANGE\n res.append(i*10**(digit-1)-1) # (87): res=[1, 2, ..., 1899, 1999] (89): res=[1, 2, ..., 1999, 2999] ... (1079): res=[1, 2, ..., 989999999999, 999999999999]\n elif digit==15: # (1084): NO CHANGE (1269): NO CHANGE (1454): NO CHANGE\n for i in range(101,110): # (1455): i=101 (1457): i=102 ... (1473): NO CHANGE\n res.append(i*10**(digit-3)-1) # (1456): res=[1, 2, ..., 99999999999999, 100999999999999] (1458): res=[1, 2, ..., 100999999999999, 101999999999999] ... (1472): res=[1, 2, ..., 107999999999999, 108999999999999]\n for i in range(11,101): # (1474): i=11 (1476): i=12 ... (1654): NO CHANGE\n res.append(i*10**(digit-2)-1) # (1475): res=[1, 2, ..., 108999999999999, 109999999999999] (1477): res=[1, 2, ..., 109999999999999, 119999999999999] ... (1653): res=[1, 2, ..., 989999999999999, 999999999999999]\n else:\n for i in range(11,101): # (1085): i=11 (1087): i=12 ... (1450): NO CHANGE\n res.append(i*10**(digit-2)-1) # (1086): res=[1, 2, ..., 999999999999, 1099999999999] (1088): res=[1, 2, ..., 1099999999999, 1199999999999] ... (1449): res=[1, 2, ..., 98999999999999, 99999999999999]\nprint(res)\n"], "anno_status": [false], "diff_content": " res = []\n for digit in range(1,16):\n if digit<=3:\n for i in range(2,11):\n res.append(10**(digit-1)*i-1)\n elif 4<=digit<=12:\n for i in range(11,(digit-2)*10):\n res.append(i*10**(digit-2)-1)\n for i in range(digit-2,11):\n res.append(i*10**(digit-1)-1)\n elif digit==15:\n for i in range(101,110):\n res.append(i*10**(digit-3)-1)\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\n else:\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\n-print(res)\n+for i in range(int(input())):\n+ print(res[i])\n \n", "FL_content": " res = []\n for digit in range(1,16):\n if digit<=3:\n for i in range(2,11):\n res.append(10**(digit-1)*i-1)\n elif 4<=digit<=12:\n for i in range(11,(digit-2)*10):\n res.append(i*10**(digit-2)-1)\n for i in range(digit-2,11):\n res.append(i*10**(digit-1)-1)\n elif digit==15:\n for i in range(101,110):\n res.append(i*10**(digit-3)-1)\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\n else:\n for i in range(11,101):\n res.append(i*10**(digit-2)-1)\n-print(res)\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u473633103", "problem_id": "p03318", "submission1_id": "s365938545", "submission2_id": "s323716387", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nk = int(input())\nk = 100\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(5)):\n for j in reversed(range(1,10**4)):\n num = str(j)+\"9\"*i*3\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(num == \"379999\"):\n print(\"tes\")\n if(minN > n or n==1):\n minN = n\n ans.append(num)\n\nprint(len(ans[0]),len(ans))\n\nfor i in list(reversed(ans))[:k]:\n print(i)", "code2": "\n\nk = int(input())\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(13)):\n minN = 10**15\n for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(int(num))\n\nfor i in list(sorted(list(set(ans))))[:k]:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529821544", "date2": "1529822747", "bleu_score": "0.7716742037723318", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "240\n", "actual_output": "tes\n16 747\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n32999999\n33999999\n34999999\n35999999\n36999999\n37999999\n38999999\n39999999\n40999999\n41999999\n42999999\n43999999\n44999999\n45999999\n46999999\n47999999\n48999999\n49999999\n50999999\n51999999\n52999999\n53999999\n54999999\n55999999\n56999999\n57999999\n58999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n209999999\n219999999\n229999999\n239999999\n249999999\n259999999\n269999999\n279999999\n289999999\n299999999\n309999999\n319999999\n329999999\n339999999\n349999999\n359999999\n369999999\n379999999\n389999999\n399999999\n409999999\n419999999\n429999999\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n k = int(input())\n-k = 100\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(5)):\n- for j in reversed(range(1,10**4)):\n- num = str(j)+\"9\"*i*3\n+for i in reversed(range(13)):\n+ minN = 10**15\n+ for j in reversed(range(1,10**3)):\n+ num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n- if(num == \"379999\"):\n- print(\"tes\")\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n+ ans.append(int(num))\n \n-print(len(ans[0]),len(ans))\n-\n-for i in list(reversed(ans))[:k]:\n+for i in list(sorted(list(set(ans))))[:k]:\n print(i)\n", "FL_content": " \n \n k = int(input())\n-k = 100\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(5)):\n- for j in reversed(range(1,10**4)):\n- num = str(j)+\"9\"*i*3\n n = sum([int(k) for k in num])\n n = int(num)/n\n- if(num == \"379999\"):\n- print(\"tes\")\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n \n-print(len(ans[0]),len(ans))\n-\n-for i in list(reversed(ans))[:k]:\n print(i)\n", "added_lines": 6, "removed_lines": 10, "code1_lines": 23 }, { "user_id": "u808280993", "problem_id": "p03318", "submission1_id": "s684066276", "submission2_id": "s158438137", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nK = int(input())\n\nSunuke = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n\nif K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n\nelse:\n resi = K - len(Sunuke)\n digit = 1\n num = 19\n Sunuke.append(num)\n resi -= 1\n endFlg = False\n while resi > 0:\n for d in range(1, digit+1):\n for i in range(9):\n num += 10\n Sunuke.append(num)\n\n resi -= 1\n if resi == 0:\n endFlg = True\n break\n if endFlg:\n break\n\nfor i in range(K):\n print(Sunuke[i])", "code2": "\n\nK = int(input())\n\nSunuke = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\ndef ns(n):\n return n / sum(map(int, list((str(n)))))\n\n\nif K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n\nelse:\n \n resi = K - len(Sunuke)\n \n digit = 0\n snk = 9\n\n while resi > 0:\n nxt1 = snk + 10**digit\n nxt2 = snk + 10**(digit+1)\n\n \n if ns(nxt1) > ns(nxt2):\n digit +=1\n snk = nxt2\n Sunuke.append(snk)\n resi -= 1\n else:\n snk = nxt1\n Sunuke.append(snk)\n resi -= 1\n\n\nfor i in range(K):\n print(Sunuke[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529807594", "date2": "1529869488", "bleu_score": "0.7500814652842052", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "225\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n109\n119\n129\n139\n149\n159\n169\n179\n189\n199\n209\n219\n229\n239\n249\n259\n269\n279\n289\n299\n309\n319\n329\n339\n349\n359\n369\n379\n389\n399\n409\n419\n429\n439\n449\n459\n469\n479\n489\n499\n509\n519\n529\n539\n549\n559\n569\n579\n589\n599\n609\n619\n629\n639\n649\n659\n669\n679\n689\n699\n709\n719\n729\n739\n749\n759\n769\n779\n789\n799\n809\n819\n829\n839\n849\n859\n869\n879\n889\n899\n909\n919\n929\n939\n949\n959\n969\n979\n989\n999\n1009\n1019\n1029\n1039\n1049\n1059\n1069\n1079\n1089\n1099\n1109\n1119\n1129\n1139\n1149\n1159\n1169\n1179\n1189\n1199\n1209\n1219\n1229\n1239\n1249\n1259\n1269\n1279\n1289\n1299\n1309\n1319\n1329\n1339\n1349\n1359\n1369\n1379\n1389\n1399\n1409\n1419\n1429\n1439\n1449\n1459\n1469\n1479\n1489\n1499\n1509\n1519\n1529\n1539\n1549\n1559\n1569\n1579\n1589\n1599\n1609\n1619\n1629\n1639\n1649\n1659\n1669\n1679\n1689\n1699\n1709\n1719\n1729\n1739\n1749\n1759\n1769\n1779\n1789\n1799\n1809\n1819\n1829\n1839\n1849\n1859\n1869\n1879\n1889\n1899\n1909\n1919\n1929\n1939\n1949\n1959\n1969\n1979\n1989\n1999\n2009\n2019\n2029\n2039\n2049\n2059\n2069\n2079\n2089\n2099\n2109\n2119\n2129\n2139\n2149\n2159\n2169\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n32999999\n33999999\n34999999\n35999999\n36999999\n37999999\n38999999\n39999999\n40999999\n41999999\n42999999\n43999999\n44999999\n45999999\n46999999\n47999999\n48999999\n49999999\n50999999\n51999999\n52999999\n53999999\n54999999\n55999999\n56999999\n57999999\n58999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n209999999\n219999999\n229999999\n239999999\n249999999\n259999999\n269999999\n279999999\n\n", "anno_code": ["\n\nK = int(input()) # (0): K=225\n\nSunuke = [1, 2, 3, 4, 5, 6, 7, 8, 9] # (1): Sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n\nif K <= len(Sunuke): # (2): NO CHANGE\n for i in range(K):\n print(Sunuke[i])\n\nelse:\n resi = K - len(Sunuke) # (3): resi=216\n digit = 1 # (4): digit=1\n num = 19 # (5): num=19\n Sunuke.append(num) # (6): Sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9, 19]\n resi -= 1 # (7): resi=215\n endFlg = False # (8): endFlg=False\n while resi > 0: # (9): NO CHANGE (59): NO CHANGE ... (1205): NO CHANGE\n for d in range(1, digit+1): # (10): d=1 (58): NO CHANGE ... (1160): NO CHANGE\n for i in range(9): # (11): i=0 (16): i=1 ... (1196): i=7\n num += 10 # (12): num=29 (17): num=39 ... (1197): num=2169\n Sunuke.append(num) # (13): Sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29] (18): Sunuke=[1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39] ... (1198): Sunuke=[1, 2, ..., 2159, 2169]\n\n resi -= 1 # (14): resi=214 (19): resi=213 ... (1199): resi=0\n if resi == 0: # (15): NO CHANGE (20): NO CHANGE ... (1200): NO CHANGE\n endFlg = True # (1201): endFlg=True\n break # (1202): NO CHANGE\n if endFlg: # (57): NO CHANGE (107): NO CHANGE ... (1203): NO CHANGE\n break # (1204): NO CHANGE\n\nfor i in range(K): # (1206): i=0 (1208): i=1 ... (1654): i=224\n print(Sunuke[i]) # (1207): NO CHANGE (1209): NO CHANGE ... (1655): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n \n K = int(input())\n \n Sunuke = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n \n+def ns(n):\n+ return n / sum(map(int, list((str(n)))))\n+\n \n if K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n \n else:\n+ \n resi = K - len(Sunuke)\n- digit = 1\n- num = 19\n- Sunuke.append(num)\n- resi -= 1\n- endFlg = False\n+ \n+ digit = 0\n+ snk = 9\n+\n while resi > 0:\n- for d in range(1, digit+1):\n- for i in range(9):\n- num += 10\n- Sunuke.append(num)\n-\n- resi -= 1\n- if resi == 0:\n- endFlg = True\n- break\n- if endFlg:\n- break\n+ nxt1 = snk + 10**digit\n+ nxt2 = snk + 10**(digit+1)\n+\n+ \n+ if ns(nxt1) > ns(nxt2):\n+ digit +=1\n+ snk = nxt2\n+ Sunuke.append(snk)\n+ resi -= 1\n+ else:\n+ snk = nxt1\n+ Sunuke.append(snk)\n+ resi -= 1\n+\n \n for i in range(K):\n print(Sunuke[i])\n", "FL_content": " \n \n K = int(input())\n \n Sunuke = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n \n \n if K <= len(Sunuke):\n for i in range(K):\n print(Sunuke[i])\n \n else:\n resi = K - len(Sunuke)\n- digit = 1\n- num = 19\n- Sunuke.append(num)\n- resi -= 1\n- endFlg = False\n while resi > 0:\n- for d in range(1, digit+1):\n- for i in range(9):\n- num += 10\n- Sunuke.append(num)\n-\n- resi -= 1\n- if resi == 0:\n- endFlg = True\n- break\n- if endFlg:\n- break\n \n for i in range(K):\n print(Sunuke[i])\n", "added_lines": 22, "removed_lines": 16, "code1_lines": 33 }, { "user_id": "u473633103", "problem_id": "p03318", "submission1_id": "s164191480", "submission2_id": "s323716387", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nk = int(input())\n\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(12)):\n for j in reversed(range(1,10**4)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(num)\n \n \nfor i in list(reversed(ans))[:k]:\n print(i)", "code2": "\n\nk = int(input())\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(13)):\n minN = 10**15\n for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(int(num))\n\nfor i in list(sorted(list(set(ans))))[:k]:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529818643", "date2": "1529822747", "bleu_score": "0.8817802483622567", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "196\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n299999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2999999\n3999999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n29999999\n39999999\n49999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n299999999\n399999999\n499999999\n599999999\n699999999\n799999999\n899999999\n999999999\n1099999999\n1199999999\n1299999999\n1399999999\n1499999999\n1599999999\n1699999999\n1799999999\n1899999999\n1999999999\n2999999999\n3999999999\n4999999999\n5999999999\n6999999999\n7999999999\n8999999999\n9999999999\n10999999999\n11999999999\n12999999999\n13999999999\n14999999999\n15999999999\n16999999999\n17999999999\n18999999999\n19999999999\n29999999999\n39999999999\n49999999999\n59999999999\n69999999999\n79999999999\n89999999999\n99999999999\n109999999999\n119999999999\n129999999999\n139999999999\n149999999999\n159999999999\n169999999999\n179999999999\n189999999999\n199999999999\n299999999999\n399999999999\n499999999999\n599999999999\n699999999999\n799999999999\n899999999999\n999999999999\n1099999999999\n1199999999999\n1299999999999\n1399999999999\n1499999999999\n1599999999999\n1699999999999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n32999999\n33999999\n34999999\n35999999\n36999999\n37999999\n38999999\n39999999\n40999999\n41999999\n42999999\n43999999\n44999999\n45999999\n46999999\n47999999\n48999999\n49999999\n50999999\n51999999\n52999999\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(12)):\n- for j in reversed(range(1,10**4)):\n+for i in reversed(range(13)):\n+ minN = 10**15\n+ for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n- \n- \n-for i in list(reversed(ans))[:k]:\n+ ans.append(int(num))\n+\n+for i in list(sorted(list(set(ans))))[:k]:\n print(i)\n", "FL_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n-for i in reversed(range(12)):\n- for j in reversed(range(1,10**4)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n- \n- \n-for i in list(reversed(ans))[:k]:\n print(i)\n", "added_lines": 6, "removed_lines": 7, "code1_lines": 20 }, { "user_id": "u423585790", "problem_id": "p03318", "submission1_id": "s322035665", "submission2_id": "s224441670", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s=set()\n for digit in range(16):\n for i in range(1,1000):\n c=i*10**digit+int('9'*digit or 0)\n if c<10**15:\n s.add(c)\n c=sorted(s)\n for i,n in enumerate(c):\n sn=n/sum(map(int,str(n)))\n for m in c[i+1:i+10]:\n sm=m/sum(map(int,str(m)))\n if sm n or n==1):\n minN = n\n ans.append(num)\n \nfor i in list(reversed(ans))[:k]:\n print(i)", "code2": "\n\nk = int(input())\ncount = 0\nans = []\nminN = 10**15\n\nfor i in reversed(range(13)):\n minN = 10**15\n for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n ans.append(int(num))\n\nfor i in list(sorted(list(set(ans))))[:k]:\n print(i)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529818222", "date2": "1529822747", "bleu_score": "0.8838949807460112", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "196\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n299999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2999999\n3999999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n29999999\n39999999\n49999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n299999999\n399999999\n499999999\n599999999\n699999999\n799999999\n899999999\n999999999\n1099999999\n1199999999\n1299999999\n1399999999\n1499999999\n1599999999\n1699999999\n1799999999\n1899999999\n1999999999\n2999999999\n3999999999\n4999999999\n5999999999\n6999999999\n7999999999\n8999999999\n9999999999\n10999999999\n11999999999\n12999999999\n13999999999\n14999999999\n15999999999\n16999999999\n17999999999\n18999999999\n19999999999\n29999999999\n39999999999\n49999999999\n59999999999\n69999999999\n79999999999\n89999999999\n99999999999\n109999999999\n119999999999\n129999999999\n139999999999\n149999999999\n159999999999\n169999999999\n179999999999\n189999999999\n199999999999\n299999999999\n399999999999\n499999999999\n599999999999\n699999999999\n799999999999\n899999999999\n999999999999\n1099999999999\n1199999999999\n1299999999999\n1399999999999\n1499999999999\n1599999999999\n1699999999999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n32999999\n33999999\n34999999\n35999999\n36999999\n37999999\n38999999\n39999999\n40999999\n41999999\n42999999\n43999999\n44999999\n45999999\n46999999\n47999999\n48999999\n49999999\n50999999\n51999999\n52999999\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n for i in reversed(range(13)):\n- for j in reversed(range(1,1000)):\n+ minN = 10**15\n+ for j in reversed(range(1,10**3)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n- \n-for i in list(reversed(ans))[:k]:\n+ ans.append(int(num))\n+\n+for i in list(sorted(list(set(ans))))[:k]:\n print(i)\n", "FL_content": " \n \n k = int(input())\n-\n count = 0\n ans = []\n minN = 10**15\n \n for i in reversed(range(13)):\n- for j in reversed(range(1,1000)):\n num = str(j)+\"9\"*i\n n = sum([int(k) for k in num])\n n = int(num)/n\n if(minN > n or n==1):\n minN = n\n- ans.append(num)\n- \n-for i in list(reversed(ans))[:k]:\n print(i)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 19 }, { "user_id": "u279493135", "problem_id": "p03318", "submission1_id": "s465268223", "submission2_id": "s145098699", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\nfrom itertools import permutations, combinations, product\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\n\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()))\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nMOD = 10 ** 9 + 7\n\nK = INT()\n\nif K <= 9:\n\tfor i in range(1, K+1):\n\t\tprint(i)\nelse:\n\tfor i in range(1, 10):\n\t\tprint(i)\n\tfor i in range(1, K-8):\n\t\tprint(10*i + 9)", "code2": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log10\nfrom itertools import permutations, combinations, product\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\n\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()))\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nMOD = 10 ** 9 + 7\n\nK = INT()\n\ndef S(n): \n\treturn sum([int(x) for x in list(n)])\n\ndef f(N):\n\tsunuke = []\n\tfor d in range(-1, int(log10(N)+1)):\n\t\tsunuke.append(10**(d+1) * (N\n\tsunuke2 = [x/S(str(x)) for x in sunuke]\n\treturn sunuke[sunuke2.index(min(sunuke2))]\n\nN = 1\nfor _ in range(K):\n\tprint(N)\n\tN = f(N+1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554766976", "date2": "1554778348", "bleu_score": "0.7446257414819033", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "225\n", "actual_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n109\n119\n129\n139\n149\n159\n169\n179\n189\n199\n209\n219\n229\n239\n249\n259\n269\n279\n289\n299\n309\n319\n329\n339\n349\n359\n369\n379\n389\n399\n409\n419\n429\n439\n449\n459\n469\n479\n489\n499\n509\n519\n529\n539\n549\n559\n569\n579\n589\n599\n609\n619\n629\n639\n649\n659\n669\n679\n689\n699\n709\n719\n729\n739\n749\n759\n769\n779\n789\n799\n809\n819\n829\n839\n849\n859\n869\n879\n889\n899\n909\n919\n929\n939\n949\n959\n969\n979\n989\n999\n1009\n1019\n1029\n1039\n1049\n1059\n1069\n1079\n1089\n1099\n1109\n1119\n1129\n1139\n1149\n1159\n1169\n1179\n1189\n1199\n1209\n1219\n1229\n1239\n1249\n1259\n1269\n1279\n1289\n1299\n1309\n1319\n1329\n1339\n1349\n1359\n1369\n1379\n1389\n1399\n1409\n1419\n1429\n1439\n1449\n1459\n1469\n1479\n1489\n1499\n1509\n1519\n1529\n1539\n1549\n1559\n1569\n1579\n1589\n1599\n1609\n1619\n1629\n1639\n1649\n1659\n1669\n1679\n1689\n1699\n1709\n1719\n1729\n1739\n1749\n1759\n1769\n1779\n1789\n1799\n1809\n1819\n1829\n1839\n1849\n1859\n1869\n1879\n1889\n1899\n1909\n1919\n1929\n1939\n1949\n1959\n1969\n1979\n1989\n1999\n2009\n2019\n2029\n2039\n2049\n2059\n2069\n2079\n2089\n2099\n2109\n2119\n2129\n2139\n2149\n2159\n2169\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n379999\n389999\n399999\n499999\n599999\n699999\n799999\n899999\n999999\n1099999\n1199999\n1299999\n1399999\n1499999\n1599999\n1699999\n1799999\n1899999\n1999999\n2099999\n2199999\n2299999\n2399999\n2499999\n2599999\n2699999\n2799999\n2899999\n2999999\n3099999\n3199999\n3299999\n3399999\n3499999\n3599999\n3699999\n3799999\n3899999\n3999999\n4099999\n4199999\n4299999\n4399999\n4499999\n4599999\n4699999\n4799999\n4899999\n4999999\n5999999\n6999999\n7999999\n8999999\n9999999\n10999999\n11999999\n12999999\n13999999\n14999999\n15999999\n16999999\n17999999\n18999999\n19999999\n20999999\n21999999\n22999999\n23999999\n24999999\n25999999\n26999999\n27999999\n28999999\n29999999\n30999999\n31999999\n32999999\n33999999\n34999999\n35999999\n36999999\n37999999\n38999999\n39999999\n40999999\n41999999\n42999999\n43999999\n44999999\n45999999\n46999999\n47999999\n48999999\n49999999\n50999999\n51999999\n52999999\n53999999\n54999999\n55999999\n56999999\n57999999\n58999999\n59999999\n69999999\n79999999\n89999999\n99999999\n109999999\n119999999\n129999999\n139999999\n149999999\n159999999\n169999999\n179999999\n189999999\n199999999\n209999999\n219999999\n229999999\n239999999\n249999999\n259999999\n269999999\n279999999\n\n", "anno_code": ["import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\nfrom itertools import permutations, combinations, product\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\n\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()))\nsys.setrecursionlimit(10 ** 9) # (0): NO CHANGE\nINF = float('inf') # (1): INF=inf\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\n\nK = INT() # (3): K=225\n\nif K <= 9: # (4): NO CHANGE\n\tfor i in range(1, K+1):\n\t\tprint(i)\nelse:\n\tfor i in range(1, 10): # (5): i=1 (7): i=2 ... (23): NO CHANGE\n\t\tprint(i) # (6): NO CHANGE (8): NO CHANGE ... (22): NO CHANGE\n\tfor i in range(1, K-8): # (24): i=1 (26): i=2 ... (454): i=216\n\t\tprint(10*i + 9) # (25): NO CHANGE (27): NO CHANGE ... (455): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys, re\n from collections import deque, defaultdict, Counter\n-from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\n+from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log10\n from itertools import permutations, combinations, product\n from operator import itemgetter, mul\n from copy import deepcopy\n from string import ascii_lowercase, ascii_uppercase, digits\n \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 sys.setrecursionlimit(10 ** 9)\n INF = float('inf')\n MOD = 10 ** 9 + 7\n \n K = INT()\n \n-if K <= 9:\n-\tfor i in range(1, K+1):\n-\t\tprint(i)\n-else:\n-\tfor i in range(1, 10):\n-\t\tprint(i)\n-\tfor i in range(1, K-8):\n-\t\tprint(10*i + 9)\n+def S(n): \n+\treturn sum([int(x) for x in list(n)])\n+\n+def f(N):\n+\tsunuke = []\n+\tfor d in range(-1, int(log10(N)+1)):\n+\t\tsunuke.append(10**(d+1) * (N\n+\tsunuke2 = [x/S(str(x)) for x in sunuke]\n+\treturn sunuke[sunuke2.index(min(sunuke2))]\n+\n+N = 1\n+for _ in range(K):\n+\tprint(N)\n+\tN = f(N+1)\n+\n", "FL_content": " import sys, re\n from collections import deque, defaultdict, Counter\n-from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\n from itertools import permutations, combinations, product\n from operator import itemgetter, mul\n from copy import deepcopy\n from string import ascii_lowercase, ascii_uppercase, digits\n \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 sys.setrecursionlimit(10 ** 9)\n INF = float('inf')\n MOD = 10 ** 9 + 7\n \n K = INT()\n \n-if K <= 9:\n-\tfor i in range(1, K+1):\n-\t\tprint(i)\n-else:\n-\tfor i in range(1, 10):\n-\t\tprint(i)\n-\tfor i in range(1, K-8):\n-\t\tprint(10*i + 9)\n", "added_lines": 16, "removed_lines": 9, "code1_lines": 26 }, { "user_id": "u121921603", "problem_id": "p03318", "submission1_id": "s361261858", "submission2_id": "s069909017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "m=float(\"INF\")\nsunukes=[]\nfor i in range(15,-1,-1):\n for j in range(100,10,-1):\n \n sunuke=j*(10**i)-1\n s=str(sunuke)\n sn=0\n for k in range(len(s)):\n sn+=int(s[k])\n x=sunuke/sn\n \n if x<=m :\n m=x\n sunukes.append(sunuke)\nfor i in range(9,0,-1):\n sunukes.append(i)\nk=int(input())\n\nprint(sunukes[-k])\n", "code2": "m=float(\"INF\")\nsunukes=[]\nfor i in range(7,-1,-1):\n for j in range(1000,10,-1):\n \n sunuke=j*(100**i)-1\n s=str(sunuke)\n sn=0\n for k in range(len(s)):\n sn+=int(s[k])\n x=sunuke/sn\n \n if x<=m :\n m=x\n sunukes.append(sunuke)\nfor i in range(9,0,-1):\n sunukes.append(i)\nsunukes=sunukes[::-1]\nk=int(input())\n\nfor i in range(k):\n print(sunukes[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577458598", "date2": "1577463847", "bleu_score": "0.8752693633507229", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 16, "input": "99\n", "actual_output": "369999\n", "expected_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n29\n39\n49\n59\n69\n79\n89\n99\n199\n299\n399\n499\n599\n699\n799\n899\n999\n1099\n1199\n1299\n1399\n1499\n1599\n1699\n1799\n1899\n1999\n2999\n3999\n4999\n5999\n6999\n7999\n8999\n9999\n10999\n11999\n12999\n13999\n14999\n15999\n16999\n17999\n18999\n19999\n20999\n21999\n22999\n23999\n24999\n25999\n26999\n27999\n28999\n29999\n39999\n49999\n59999\n69999\n79999\n89999\n99999\n109999\n119999\n129999\n139999\n149999\n159999\n169999\n179999\n189999\n199999\n209999\n219999\n229999\n239999\n249999\n259999\n269999\n279999\n289999\n299999\n309999\n319999\n329999\n339999\n349999\n359999\n369999\n\n", "anno_code": ["m=float(\"INF\") # (0): m=inf\nsunukes=[] # (1): sunukes=[]\nfor i in range(15,-1,-1): # (2): i=15 (3874): i=14 ... (39382): NO CHANGE\n for j in range(100,10,-1): # (3): j=100 (46): j=99 ... (39381): NO CHANGE\n \n sunuke=j*(10**i)-1 # (4): sunuke=99999999999999999 (47): sunuke=98999999999999999 ... (39371): sunuke=10\n s=str(sunuke) # (5): s=99999999999999999 (48): s=98999999999999999 ... (39372): s=10\n sn=0 # (6): sn=0 (49): sn=0 ... (39373): sn=0\n for k in range(len(s)): # (7): k=0 (9): k=1 ... (39378): NO CHANGE\n sn+=int(s[k]) # (8): sn=9 (10): sn=18 ... (39377): NO CHANGE\n x=sunuke/sn # (42): x=653594771241830.0 (85): x=651315789473684.2 ... (39379): x=10.0\n \n if x<=m : # (43): NO CHANGE (86): NO CHANGE ... (39380): NO CHANGE\n m=x # (44): m=653594771241830.0 (87): m=651315789473684.2 ... (39280): m=1.9\n sunukes.append(sunuke) # (45): sunukes=[99999999999999999] (88): sunukes=[99999999999999999, 98999999999999999] ... (39281): sunukes=[99999999999999999, 98999999999999999, ..., 29, 19]\nfor i in range(9,0,-1): # (39383): i=9 (39385): i=8 ... (39401): NO CHANGE\n sunukes.append(i) # (39384): sunukes=[99999999999999999, 98999999999999999, ..., 19, 9] (39386): sunukes=[99999999999999999, 98999999999999999, ..., 9, 8] ... (39400): sunukes=[99999999999999999, 98999999999999999, ..., 2, 1]\nk=int(input()) # (39402): k=99\n\nprint(sunukes[-k])\n"], "anno_status": [true], "diff_content": " m=float(\"INF\")\n sunukes=[]\n-for i in range(15,-1,-1):\n- for j in range(100,10,-1):\n+for i in range(7,-1,-1):\n+ for j in range(1000,10,-1):\n \n- sunuke=j*(10**i)-1\n+ sunuke=j*(100**i)-1\n s=str(sunuke)\n sn=0\n for k in range(len(s)):\n sn+=int(s[k])\n x=sunuke/sn\n \n if x<=m :\n m=x\n sunukes.append(sunuke)\n for i in range(9,0,-1):\n sunukes.append(i)\n+sunukes=sunukes[::-1]\n k=int(input())\n \n-print(sunukes[-k])\n-\n+for i in range(k):\n+ print(sunukes[i])\n", "FL_content": " m=float(\"INF\")\n sunukes=[]\n-for i in range(15,-1,-1):\n- for j in range(100,10,-1):\n \n- sunuke=j*(10**i)-1\n s=str(sunuke)\n sn=0\n for k in range(len(s)):\n sn+=int(s[k])\n x=sunuke/sn\n \n if x<=m :\n m=x\n sunukes.append(sunuke)\n for i in range(9,0,-1):\n sunukes.append(i)\n k=int(input())\n \n-print(sunukes[-k])\n-\n", "added_lines": 6, "removed_lines": 5, "code1_lines": 21 }, { "user_id": "u461993794", "problem_id": "p02625", "submission1_id": "s452900392", "submission2_id": "s435402983", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from functools import reduce\n\nn, m = map(int, input().split())\n\nmod = 10 ** 9 + 7\nans = 0\nc = 1\np1 = 1\np2 = reduce(lambda ac, v: ac * v % mod, range(m, m - n, -1), 1)\nfor i in range(n + 1):\n if i > 0:\n c = (c * (n - i + 1) * pow(i, mod - 2, mod)) % mod\n p1 = (p1 * (n - i + 1)) % mod\n p2 = (p2 * pow(n - i + 1, mod - 2, mod)) % mod\n x = c * p1 * (p2 ** 2)\n if i % 2 == 0:\n ans += x\n else:\n ans -= x\n ans %= mod\nprint(ans)\n", "code2": "from functools import reduce\n\nn, m = map(int, input().split())\n\nmod = 10 ** 9 + 7\nans = 0\nc = 1\np1 = 1\np2 = reduce(lambda ac, v: ac * v % mod, range(m, m - n, -1), 1)\nfor i in range(n + 1):\n if i > 0:\n c = (c * (n - i + 1) * pow(i, mod - 2, mod)) % mod\n p1 = (p1 * (m - i + 1)) % mod\n p2 = (p2 * pow(m - i + 1, mod - 2, mod)) % mod\n x = c * p1 * (p2 ** 2)\n if i % 2 == 0:\n ans += x\n else:\n ans -= x\n ans %= mod\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597569207", "date2": "1597570048", "bleu_score": "0.9893501170941059", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "3299 39455\n", "actual_output": "60513566\n", "expected_output": "291535525\n\n", "anno_code": ["from functools import reduce\n\nn, m = map(int, input().split()) # (0): n=3299, m=39455\n\nmod = 10 ** 9 + 7 # (1): mod=1000000007\nans = 0 # (2): ans=0\nc = 1 # (3): c=1\np1 = 1 # (4): p1=1\np2 = reduce(lambda ac, v: ac * v % mod, range(m, m - n, -1), 1) # (5): p2=316059119\nfor i in range(n + 1): # (6): i=0 (12): i=1 ... (29703): NO CHANGE\n if i > 0: # (7): NO CHANGE (13): NO CHANGE ... (29695): NO CHANGE\n c = (c * (n - i + 1) * pow(i, mod - 2, mod)) % mod # (14): c=3299 (23): c=5440051 ... (29696): c=1\n p1 = (p1 * (n - i + 1)) % mod # (15): p1=3299 (24): p1=10880102 ... (29697): NO CHANGE\n p2 = (p2 * pow(n - i + 1, mod - 2, mod)) % mod # (16): p2=929165226 (25): p2=196158026 ... (29698): NO CHANGE\n x = c * p1 * (p2 ** 2) # (8): x=99893366703056161 (17): x=9396162673825549260169476 ... (29699): x=33634285856311096675031675\n if i % 2 == 0: # (9): NO CHANGE (18): NO CHANGE ... (29700): NO CHANGE\n ans += x # (10): ans=99893366703056161 (28): ans=2277446076404166852841812908552 ... (29692): ans=110959509039970307931165698178\n else:\n ans -= x # (19): ans=-9396162673825549256366877 (37): ans=-414129025194912125579553726551169047 ... (29701): ans=-33634285856311096285584113\n ans %= mod # (11): ans=3802599 (20): ans=0 ... (29702): ans=60513566\nprint(ans)\n"], "anno_status": [true], "diff_content": " from functools import reduce\n \n n, m = map(int, input().split())\n \n mod = 10 ** 9 + 7\n ans = 0\n c = 1\n p1 = 1\n p2 = reduce(lambda ac, v: ac * v % mod, range(m, m - n, -1), 1)\n for i in range(n + 1):\n if i > 0:\n c = (c * (n - i + 1) * pow(i, mod - 2, mod)) % mod\n- p1 = (p1 * (n - i + 1)) % mod\n- p2 = (p2 * pow(n - i + 1, mod - 2, mod)) % mod\n+ p1 = (p1 * (m - i + 1)) % mod\n+ p2 = (p2 * pow(m - i + 1, mod - 2, mod)) % mod\n x = c * p1 * (p2 ** 2)\n if i % 2 == 0:\n ans += x\n else:\n ans -= x\n ans %= mod\n print(ans)\n \n", "FL_content": " from functools import reduce\n \n n, m = map(int, input().split())\n \n mod = 10 ** 9 + 7\n ans = 0\n c = 1\n p1 = 1\n p2 = reduce(lambda ac, v: ac * v % mod, range(m, m - n, -1), 1)\n for i in range(n + 1):\n if i > 0:\n c = (c * (n - i + 1) * pow(i, mod - 2, mod)) % mod\n- p1 = (p1 * (n - i + 1)) % mod\n- p2 = (p2 * pow(n - i + 1, mod - 2, mod)) % mod\n x = c * p1 * (p2 ** 2)\n if i % 2 == 0:\n ans += x\n else:\n ans -= x\n ans %= mod\n print(ans)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 22 }, { "user_id": "u867848444", "problem_id": "p02625", "submission1_id": "s611449886", "submission2_id": "s500182545", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n\n return f, g\n\nn, m = map(int,input().split())\nmod = 10 ** 9 + 7\nf, g = pre_c(m, mod)\nmCn = (f[m] * g[m - n] * g[n])\n\ntemp1 = (f[n] * f[n - 1])\ntemp2 = (f[n] * f[n])\n\nif m < 2*n:\n res = (mCn ** 2 * temp1) %mod\nelse:\n m_nCn = (f[m - n] * g[n] * g[m - 2*n])\n execept = (mCn * m_nCn * temp2)\n res = (execept + ((mCn ** 2 - mCn * m_nCn) * temp1)) %mod\nprint(res)", "code2": "\ndef pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n\n return f, g\n\nn, m = map(int,input().split())\nmod = 10 ** 9 + 7\nf, g = pre_c(m, mod)\nres = 0\nfor i in range(n + 1):\n C = f[n] * g[i] * g[n - i]\n P1 = f[m] * g[m - i]\n P2 = f[m - i] * g[m - n]\n temp = C * P1 * (P2 ** 2) * pow(-1, i)\n res = (res + temp%mod) %mod\nprint(res%mod)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593361766", "date2": "1593364250", "bleu_score": "0.7330195617945438", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "85920 225813\n", "actual_output": "286934694\n", "expected_output": "894389469\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n def pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n \n return f, g\n \n n, m = map(int,input().split())\n mod = 10 ** 9 + 7\n f, g = pre_c(m, mod)\n-mCn = (f[m] * g[m - n] * g[n])\n-\n-temp1 = (f[n] * f[n - 1])\n-temp2 = (f[n] * f[n])\n-\n-if m < 2*n:\n- res = (mCn ** 2 * temp1) %mod\n-else:\n- m_nCn = (f[m - n] * g[n] * g[m - 2*n])\n- execept = (mCn * m_nCn * temp2)\n- res = (execept + ((mCn ** 2 - mCn * m_nCn) * temp1)) %mod\n-print(res)\n+res = 0\n+for i in range(n + 1):\n+ C = f[n] * g[i] * g[n - i]\n+ P1 = f[m] * g[m - i]\n+ P2 = f[m - i] * g[m - n]\n+ temp = C * P1 * (P2 ** 2) * pow(-1, i)\n+ res = (res + temp%mod) %mod\n+print(res%mod)\n", "FL_content": " \n def pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n \n return f, g\n \n n, m = map(int,input().split())\n mod = 10 ** 9 + 7\n f, g = pre_c(m, mod)\n-mCn = (f[m] * g[m - n] * g[n])\n-\n-temp1 = (f[n] * f[n - 1])\n-temp2 = (f[n] * f[n])\n-\n-if m < 2*n:\n- res = (mCn ** 2 * temp1) %mod\n-else:\n- m_nCn = (f[m - n] * g[n] * g[m - 2*n])\n- execept = (mCn * m_nCn * temp2)\n- res = (execept + ((mCn ** 2 - mCn * m_nCn) * temp1)) %mod\n-print(res)\n", "added_lines": 8, "removed_lines": 12, "code1_lines": 29 }, { "user_id": "u867848444", "problem_id": "p02625", "submission1_id": "s767625303", "submission2_id": "s500182545", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n\n return f, g\n\nn, m = map(int,input().split())\nmod = 10 ** 9 + 7\n\nf, g = pre_c(m, mod)\ntemp1 = f[m] * g[m - n] * g[n] % mod\ntemp2 = f[n - 1]\nans = temp1 * (temp2%mod)\nprint(ans%mod)", "code2": "\ndef pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n\n return f, g\n\nn, m = map(int,input().split())\nmod = 10 ** 9 + 7\nf, g = pre_c(m, mod)\nres = 0\nfor i in range(n + 1):\n C = f[n] * g[i] * g[n - i]\n P1 = f[m] * g[m - i]\n P2 = f[m - i] * g[m - n]\n temp = C * P1 * (P2 ** 2) * pow(-1, i)\n res = (res + temp%mod) %mod\nprint(res%mod)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593311995", "date2": "1593364250", "bleu_score": "0.7405888030710555", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "141421 356237\n", "actual_output": "466189106\n", "expected_output": "881613484\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n def pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n \n return f, g\n \n n, m = map(int,input().split())\n mod = 10 ** 9 + 7\n-\n f, g = pre_c(m, mod)\n-temp1 = f[m] * g[m - n] * g[n] % mod\n-temp2 = f[n - 1]\n-ans = temp1 * (temp2%mod)\n-print(ans%mod)\n+res = 0\n+for i in range(n + 1):\n+ C = f[n] * g[i] * g[n - i]\n+ P1 = f[m] * g[m - i]\n+ P2 = f[m - i] * g[m - n]\n+ temp = C * P1 * (P2 ** 2) * pow(-1, i)\n+ res = (res + temp%mod) %mod\n+print(res%mod)\n", "FL_content": " \n def pre_c(n, mod):\n f = [0] * (n + 1)\n g = [0] * (n + 1)\n for i in range(n + 1):\n if i == 0:\n f[i] = 1\n g[i] = 1\n else:\n f[i] = (f[i - 1] * i) % mod\n g[i] = pow(f[i], mod - 2, mod)\n \n return f, g\n \n n, m = map(int,input().split())\n mod = 10 ** 9 + 7\n-\n f, g = pre_c(m, mod)\n-temp1 = f[m] * g[m - n] * g[n] % mod\n-temp2 = f[n - 1]\n-ans = temp1 * (temp2%mod)\n-print(ans%mod)\n", "added_lines": 8, "removed_lines": 5, "code1_lines": 22 }, { "user_id": "u943004959", "problem_id": "p02625", "submission1_id": "s692670191", "submission2_id": "s225439569", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10**9 + 7\nMAX = 5*10**5 + 1\n\nfact = [0 for _ in range(MAX)]\nfactinv = [0 for _ in range(MAX)]\n\nfact[0] = 1\nfor k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n\nfactinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\nfor k in range(MAX - 1, 0, -1):\n factinv[k - 1] = fact[k]*k\n factinv[k - 1] %= MOD\n\ndef nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n\ndef nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n\nn, m = map(int, input().split(' '))\n\nans = 0\nfor k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n if k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n\nprint(ans)", "code2": "MOD = 10**9 + 7\nMAX = 5*10**5 + 1\n\nfact = [0 for _ in range(MAX)]\nfactinv = [0 for _ in range(MAX)]\n\nfact[0] = 1\nfor k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n\nfactinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\nfor k in range(MAX - 1, 0, -1):\n factinv[k - 1] = factinv[k]*k\n factinv[k - 1] %= MOD\n\ndef nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n\ndef nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n\nn, m = map(int, input().split(' '))\n\nans = 0\nfor k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n if not k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599438838", "date2": "1599439273", "bleu_score": "0.9861332442973179", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "564 36214\n", "actual_output": "750099756\n", "expected_output": "459974839\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " MOD = 10**9 + 7\n MAX = 5*10**5 + 1\n \n fact = [0 for _ in range(MAX)]\n factinv = [0 for _ in range(MAX)]\n \n fact[0] = 1\n for k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n \n factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\n for k in range(MAX - 1, 0, -1):\n- factinv[k - 1] = fact[k]*k\n+ factinv[k - 1] = factinv[k]*k\n factinv[k - 1] %= MOD\n \n def nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n \n def nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n \n n, m = map(int, input().split(' '))\n \n ans = 0\n for k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n- if k % 2: ans += tmp\n+ if not k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n \n print(ans)\n", "FL_content": " MOD = 10**9 + 7\n MAX = 5*10**5 + 1\n \n fact = [0 for _ in range(MAX)]\n factinv = [0 for _ in range(MAX)]\n \n fact[0] = 1\n for k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n \n factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\n for k in range(MAX - 1, 0, -1):\n- factinv[k - 1] = fact[k]*k\n factinv[k - 1] %= MOD\n \n def nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n \n def nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n \n n, m = map(int, input().split(' '))\n \n ans = 0\n for k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n- if k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n \n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 32 }, { "user_id": "u051928503", "problem_id": "p02625", "submission1_id": "s637817224", "submission2_id": "s322296874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def makefac(n):\n global faclist\n faclist = [1, 1]\n for i in range(2, n + 1):\n faclist.append(faclist[-1] * i % MOD)\n return None\ndef mcomb(n, r):\n return faclist[n] * pow(faclist[r], MOD - 2, MOD) * pow(faclist[n-r], -1) % MOD\ndef mperm(n, r):\n return faclist[n] * pow(faclist[n-r], MOD - 2, MOD)\n\nN, M = map(int, input().split())\nMOD = 10 ** 9 + 7\nmakefac(M)\nans = mperm(M, N)\nfor k in range(1, N + 1):\n ans += ((-1)**k * mcomb(N, k) * mperm(M - k, N - k)) % MOD\nans = ans * mperm(M, N) % MOD\nprint(ans)\n\n", "code2": "def makefac(n):\n global faclist\n faclist = [1, 1]\n for i in range(2, n + 1):\n faclist.append(faclist[-1] * i % MOD)\n return None\ndef mcomb(n, r):\n return faclist[n] * pow(faclist[r],MOD - 2, MOD) * pow(faclist[n-r], MOD - 2, MOD)\ndef mperm(n, r):\n return faclist[n] * pow(faclist[n-r],MOD - 2, MOD)\n\nN, M = map(int, input().split())\nMOD = 10 ** 9 + 7\nmakefac(M)\nans = mperm(M, N)\nfor k in range(1, N + 1):\n ans += ((-1)**k * mcomb(N, k) * mperm(M - k, N - k)) % MOD\nans = ans * mperm(M, N) % MOD\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593393919", "date2": "1593393978", "bleu_score": "0.9783899112241189", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "4151 39455\n", "actual_output": "356116208.0\n", "expected_output": "208630339\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def makefac(n):\n global faclist\n faclist = [1, 1]\n for i in range(2, n + 1):\n faclist.append(faclist[-1] * i % MOD)\n return None\n def mcomb(n, r):\n- return faclist[n] * pow(faclist[r], MOD - 2, MOD) * pow(faclist[n-r], -1) % MOD\n+ return faclist[n] * pow(faclist[r],MOD - 2, MOD) * pow(faclist[n-r], MOD - 2, MOD)\n def mperm(n, r):\n- return faclist[n] * pow(faclist[n-r], MOD - 2, MOD)\n+ return faclist[n] * pow(faclist[n-r],MOD - 2, MOD)\n \n N, M = map(int, input().split())\n MOD = 10 ** 9 + 7\n makefac(M)\n ans = mperm(M, N)\n for k in range(1, N + 1):\n ans += ((-1)**k * mcomb(N, k) * mperm(M - k, N - k)) % MOD\n ans = ans * mperm(M, N) % MOD\n print(ans)\n \n-\n", "FL_content": " def makefac(n):\n global faclist\n faclist = [1, 1]\n for i in range(2, n + 1):\n faclist.append(faclist[-1] * i % MOD)\n return None\n def mcomb(n, r):\n- return faclist[n] * pow(faclist[r], MOD - 2, MOD) * pow(faclist[n-r], -1) % MOD\n def mperm(n, r):\n- return faclist[n] * pow(faclist[n-r], MOD - 2, MOD)\n \n N, M = map(int, input().split())\n MOD = 10 ** 9 + 7\n makefac(M)\n ans = mperm(M, N)\n for k in range(1, N + 1):\n ans += ((-1)**k * mcomb(N, k) * mperm(M - k, N - k)) % MOD\n ans = ans * mperm(M, N) % MOD\n print(ans)\n \n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 21 }, { "user_id": "u726823037", "problem_id": "p02625", "submission1_id": "s609723355", "submission2_id": "s347298016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m=map(int,input().split())\na = 1\nMod=1e9+7\nd = [1]*(n+1)\nfor i in range(n):\n d[i+1]=((m-n+i)*d[i]+i*d[i-1])%Mod\n a=a*(m-i)%Mod\nprint(int(a*d[n]%Mod))", "code2": "n,m=map(int,input().split())\na = 1\nMod=10**9+7\nd = [1]*(n+1)\nfor i in range(n):\n d[i+1]=((m-n+i)*d[i]+i*d[i-1])%Mod\n a=a*(m-i)%Mod\nprint(a*d[n]%Mod)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593569507", "date2": "1593569665", "bleu_score": "0.9504080097074399", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 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, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 12, "total_score": 59, "input": "32 71\n", "actual_output": "605744295\n", "expected_output": "605744265\n\n", "anno_code": ["n,m=map(int,input().split()) # (0): n=32, m=71\na = 1 # (1): a=1\nMod=1e9+7 # (2): Mod=1000000007.0\nd = [1]*(n+1) # (3): d=[1, 1, ..., 1, 1]\nfor i in range(n): # (4): i=0 (7): i=1 ... (100): NO CHANGE\n d[i+1]=((m-n+i)*d[i]+i*d[i-1])%Mod # (5): d=[1, 39.0, ..., 1, 1] (8): d=[1, 39.0, ..., 1, 1] ... (98): d=[1, 39.0, ..., 835101902.0, 939649439.0]\n a=a*(m-i)%Mod # (6): a=71.0 (9): a=4970.0 ... (99): a=558338782.0\nprint(int(a*d[n]%Mod))"], "anno_status": [true], "diff_content": " n,m=map(int,input().split())\n a = 1\n-Mod=1e9+7\n+Mod=10**9+7\n d = [1]*(n+1)\n for i in range(n):\n d[i+1]=((m-n+i)*d[i]+i*d[i-1])%Mod\n a=a*(m-i)%Mod\n-print(int(a*d[n]%Mod))\n+print(a*d[n]%Mod)\n", "FL_content": " n,m=map(int,input().split())\n a = 1\n-Mod=1e9+7\n d = [1]*(n+1)\n for i in range(n):\n d[i+1]=((m-n+i)*d[i]+i*d[i-1])%Mod\n a=a*(m-i)%Mod\n-print(int(a*d[n]%Mod))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u943004959", "problem_id": "p02625", "submission1_id": "s300135922", "submission2_id": "s225439569", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10**9 + 7\nMAX = 5*10**5 + 1\n\nfact = [0 for _ in range(MAX)]\nfactinv = [0 for _ in range(MAX)]\n\nfact[0] = 1\nfor k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n\nfactinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\nfor k in range(MAX - 1, 0, -1):\n factinv[k - 1] = factinv[k]*k\n factinv[k - 1] %= MOD\n\ndef nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n\ndef nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n\nn, m = map(int, input().split(' '))\n\nans = 0\nfor k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n if k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n\nprint(ans)", "code2": "MOD = 10**9 + 7\nMAX = 5*10**5 + 1\n\nfact = [0 for _ in range(MAX)]\nfactinv = [0 for _ in range(MAX)]\n\nfact[0] = 1\nfor k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n\nfactinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\nfor k in range(MAX - 1, 0, -1):\n factinv[k - 1] = factinv[k]*k\n factinv[k - 1] %= MOD\n\ndef nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n\ndef nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n\nn, m = map(int, input().split(' '))\n\nans = 0\nfor k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n if not k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599439015", "date2": "1599439273", "bleu_score": "0.9928811178872907", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "19 71\n", "actual_output": "479931889\n", "expected_output": "520068118\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " MOD = 10**9 + 7\n MAX = 5*10**5 + 1\n \n fact = [0 for _ in range(MAX)]\n factinv = [0 for _ in range(MAX)]\n \n fact[0] = 1\n for k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n \n factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\n for k in range(MAX - 1, 0, -1):\n factinv[k - 1] = factinv[k]*k\n factinv[k - 1] %= MOD\n \n def nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n \n def nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n \n n, m = map(int, input().split(' '))\n \n ans = 0\n for k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n- if k % 2: ans += tmp\n+ if not k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n \n print(ans)\n", "FL_content": " MOD = 10**9 + 7\n MAX = 5*10**5 + 1\n \n fact = [0 for _ in range(MAX)]\n factinv = [0 for _ in range(MAX)]\n \n fact[0] = 1\n for k in range(1, MAX):\n fact[k] = fact[k - 1]*k\n fact[k] %= MOD\n \n factinv[MAX - 1] = pow(fact[MAX - 1], MOD - 2, MOD)\n for k in range(MAX - 1, 0, -1):\n factinv[k - 1] = factinv[k]*k\n factinv[k - 1] %= MOD\n \n def nCk(n, k):\n return fact[n]*factinv[k]*factinv[n - k] % MOD\n \n def nPk(n, k):\n return fact[n]*factinv[n - k] % MOD\n \n n, m = map(int, input().split(' '))\n \n ans = 0\n for k in range(n + 1):\n tmp = nCk(n, k)*nPk(m, k)*nPk(m - k, n - k)*nPk(m - k, n - k) % MOD\n- if k % 2: ans += tmp\n else: ans -= tmp\n ans %= MOD\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 32 }, { "user_id": "u954170646", "problem_id": "p02625", "submission1_id": "s672544659", "submission2_id": "s770048500", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\na,M,d=1,10**9+7,[1]*(n+1)\nfor i in range(n):\n d[i+1]=((m-n+1)*d[i]+i*d[i-1])%M\n a=a*(m-1)%M\nprint(a*d[-1]%M)", "code2": "n,m=map(int,input().split())\na,M,d=1,10**9+7,[1]*(n+1)\nfor i in range(n):\n d[i+1]=((m-n+i)*d[i]+i*d[i-1])%M\n a=a*(m-i)%M\nprint(a*d[-1]%M)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593365047", "date2": "1593365076", "bleu_score": "0.9054154332775888", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "3477 100487\n", "actual_output": "384833225\n", "expected_output": "567655026\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3477, m=100487\na,M,d=1,10**9+7,[1]*(n+1) # (1): a=1, M=1000000007, d=[1, 1, ..., 1, 1]\nfor i in range(n): # (2): i=0 (5): i=1 ... (10433): NO CHANGE\n d[i+1]=((m-n+1)*d[i]+i*d[i-1])%M # (3): d=[1, 97011, ..., 1, 1] (6): d=[1, 97011, ..., 1, 1] ... (10431): d=[1, 97011, ..., 534361837, 846769988]\n a=a*(m-1)%M # (4): a=100486 (7): a=97436126 ... (10432): a=969345058\nprint(a*d[-1]%M)"], "anno_status": [true], "diff_content": "-n, m = map(int, input().split())\n+n,m=map(int,input().split())\n a,M,d=1,10**9+7,[1]*(n+1)\n for i in range(n):\n- d[i+1]=((m-n+1)*d[i]+i*d[i-1])%M\n- a=a*(m-1)%M\n+ d[i+1]=((m-n+i)*d[i]+i*d[i-1])%M\n+ a=a*(m-i)%M\n print(a*d[-1]%M)\n+\n", "FL_content": "-n, m = map(int, input().split())\n a,M,d=1,10**9+7,[1]*(n+1)\n for i in range(n):\n- d[i+1]=((m-n+1)*d[i]+i*d[i-1])%M\n- a=a*(m-1)%M\n print(a*d[-1]%M)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u242757684", "problem_id": "p02625", "submission1_id": "s572418098", "submission2_id": "s264291077", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10 ** 9 + 7\nN,M = map(int,input().split())\nans1 = 1\nfor i in range(N):\n ans1 *= M - i\n ans1 %= MOD\nans2 = [1,M-1]\nfor i in range(2,N+1):\n ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD)\nprint(ans1 * ans2[N] % MOD)", "code2": "MOD = 10 ** 9 + 7\nN,M = map(int,input().split())\nans1 = 1\nfor i in range(N):\n ans1 *= M - i\n ans1 %= MOD\nans2 = [1,M-N]\nfor i in range(2,N+1):\n ans2.append((ans2[-2] * (i -1) + ans2[-1] * (M - N + i - 1))% MOD)\nprint(ans1 * ans2[N] % MOD)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593309641", "date2": "1593310341", "bleu_score": "0.9264511854021393", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "335 167585\n", "actual_output": "22366826\n", "expected_output": "595052928\n\n", "anno_code": ["MOD = 10 ** 9 + 7 # (0): MOD=1000000007\nN,M = map(int,input().split()) # (1): N=335, M=167585\nans1 = 1 # (2): ans1=1\nfor i in range(N): # (3): i=0 (6): i=1 ... (1008): NO CHANGE\n ans1 *= M - i # (4): ans1=167585 (7): ans1=28084564640 ... (1006): ans1=142381476078184\n ans1 %= MOD # (5): NO CHANGE (8): ans1=84564444 ... (1007): ans1=475081517\nans2 = [1,M-1] # (1009): ans2=[1, 167584]\nfor i in range(2,N+1): # (1010): i=2 (1012): i=3 ... (1678): NO CHANGE\n ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD) # (1011): ans2=[1, 167584, 84397194] (1013): ans2=[1, 167584, 84397194, 675233351] ... (1677): ans2=[1, 167584, ..., 63935261, 599657330]\nprint(ans1 * ans2[N] % MOD)"], "anno_status": [true], "diff_content": " MOD = 10 ** 9 + 7\n N,M = map(int,input().split())\n ans1 = 1\n for i in range(N):\n ans1 *= M - i\n ans1 %= MOD\n-ans2 = [1,M-1]\n+ans2 = [1,M-N]\n for i in range(2,N+1):\n- ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD)\n+ ans2.append((ans2[-2] * (i -1) + ans2[-1] * (M - N + i - 1))% MOD)\n print(ans1 * ans2[N] % MOD)\n", "FL_content": " MOD = 10 ** 9 + 7\n N,M = map(int,input().split())\n ans1 = 1\n for i in range(N):\n ans1 *= M - i\n ans1 %= MOD\n-ans2 = [1,M-1]\n for i in range(2,N+1):\n- ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD)\n print(ans1 * ans2[N] % MOD)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u242757684", "problem_id": "p02625", "submission1_id": "s255631660", "submission2_id": "s264291077", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10 ** 9 + 7\nN,M = map(int,input().split())\nans1 = 1\nfor i in range(N):\n ans1 *= M - i\n ans1 %= MOD\nans2 = [1,M-N]\nfor i in range(2,N+1):\n ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD)\nprint(ans1 * ans2[N] % MOD)", "code2": "MOD = 10 ** 9 + 7\nN,M = map(int,input().split())\nans1 = 1\nfor i in range(N):\n ans1 *= M - i\n ans1 %= MOD\nans2 = [1,M-N]\nfor i in range(2,N+1):\n ans2.append((ans2[-2] * (i -1) + ans2[-1] * (M - N + i - 1))% MOD)\nprint(ans1 * ans2[N] % MOD)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593309751", "date2": "1593310341", "bleu_score": "0.9367276596082418", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 59, "input": "1101 374785\n", "actual_output": "918878734\n", "expected_output": "1365523\n\n", "anno_code": ["MOD = 10 ** 9 + 7 # (0): MOD=1000000007\nN,M = map(int,input().split()) # (1): N=1101, M=374785\nans1 = 1 # (2): ans1=1\nfor i in range(N): # (3): i=0 (6): i=1 ... (3306): NO CHANGE\n ans1 *= M - i # (4): ans1=374785 (7): ans1=140463421440 ... (3304): ans1=17780320932400\n ans1 %= MOD # (5): NO CHANGE (8): ans1=463420460 ... (3305): ans1=320807940\nans2 = [1,M-N] # (3307): ans2=[1, 373684]\nfor i in range(2,N+1): # (3308): i=2 (3310): i=3 ... (5508): NO CHANGE\n ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD) # (3309): ans2=[1, 373684, 50784376] (3311): ans2=[1, 373684, 50784376, 582493953] ... (5507): ans2=[1, 373684, ..., 365119239, 276332623]\nprint(ans1 * ans2[N] % MOD)"], "anno_status": [true], "diff_content": " MOD = 10 ** 9 + 7\n N,M = map(int,input().split())\n ans1 = 1\n for i in range(N):\n ans1 *= M - i\n ans1 %= MOD\n ans2 = [1,M-N]\n for i in range(2,N+1):\n- ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD)\n+ ans2.append((ans2[-2] * (i -1) + ans2[-1] * (M - N + i - 1))% MOD)\n print(ans1 * ans2[N] % MOD)\n", "FL_content": " MOD = 10 ** 9 + 7\n N,M = map(int,input().split())\n ans1 = 1\n for i in range(N):\n ans1 *= M - i\n ans1 %= MOD\n ans2 = [1,M-N]\n for i in range(2,N+1):\n- ans2.append((ans2[-2] * (N-1) + ans2[-1] * (M-1))% MOD)\n print(ans1 * ans2[N] % MOD)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u099450021", "problem_id": "p02934", "submission1_id": "s082533355", "submission2_id": "s612183770", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(s) for s in input().split(' ')]\n\nret = 1\nfor a in A:\n ret *= a\n\nprint(ret / sum(A))\n\n", "code2": "N = int(input())\nA = [int(s) for s in input().split(' ')]\n\nret = 1\nfor a in A:\n ret *= a\nret2 = sum([ret \nprint(ret / ret2)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586989360", "date2": "1586989566", "bleu_score": "0.8432672543474762", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 101, "input": "1\n1001\n", "actual_output": "1.0\n", "expected_output": "1001.0000000000\n\n", "anno_code": ["N = int(input()) # (0): N=1\nA = [int(s) for s in input().split(' ')] # (1): A=[1001]\n\nret = 1 # (2): ret=1\nfor a in A: # (3): a=1001 (5): NO CHANGE\n ret *= a # (4): ret=1001\n\nprint(ret / sum(A))\n\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(s) for s in input().split(' ')]\n \n ret = 1\n for a in A:\n ret *= a\n-\n-print(ret / sum(A))\n+ret2 = sum([ret \n+print(ret / ret2)\n \n \n", "FL_content": " N = int(input())\n A = [int(s) for s in input().split(' ')]\n \n ret = 1\n for a in A:\n ret *= a\n-\n-print(ret / sum(A))\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u156815136", "problem_id": "p02954", "submission1_id": "s180699724", "submission2_id": "s465055565", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nn = len(S)\nmaze = [1] * n\n\nfor i in range(0,n-1):\n if S[i] == S[i+1] == 'R':\n print('before',maze)\n maze[i+2] += maze[i]\n maze[i] = 0\n print('after',maze)\n\nfor i in range(n-1,0,-1):\n if S[i] == S[i-1] == 'L':\n maze[i-2] += maze[i]\n maze[i] = 0\n\nprint(*maze)\n", "code2": "S = input()\nn = len(S)\nmaze = [1] * n\n\nfor i in range(0,n-1):\n if S[i] == S[i+1] == 'R':\n \n maze[i+2] += maze[i]\n maze[i] = 0\n \n\nfor i in range(n-1,0,-1):\n if S[i] == S[i-1] == 'L':\n maze[i-2] += maze[i]\n maze[i] = 0\n\nprint(*maze)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590577962", "date2": "1590578057", "bleu_score": "0.8600874897339152", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RLLLLRLRLRRLLRRL\n", "actual_output": "before [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nafter [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1]\nbefore [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1]\nafter [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 2]\n3 2 0 0 0 1 1 1 1 0 2 2 0 0 1 2\n", "expected_output": "3 2 0 0 0 1 1 1 1 0 2 2 0 0 1 2\n\n", "anno_code": ["S = input() # (0): S=RLLLLRLRLRRLLRRL\nn = len(S) # (1): n=16\nmaze = [1] * n # (2): maze=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n\nfor i in range(0,n-1): # (3): i=0 (5): i=1 ... (41): NO CHANGE\n if S[i] == S[i+1] == 'R': # (4): NO CHANGE (6): NO CHANGE ... (40): NO CHANGE\n print('before',maze) # (23): NO CHANGE (35): NO CHANGE\n maze[i+2] += maze[i] # (24): maze=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1] (36): maze=[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 2]\n maze[i] = 0 # (25): maze=[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1] (37): maze=[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 2]\n print('after',maze) # (26): NO CHANGE (38): NO CHANGE\n\nfor i in range(n-1,0,-1): # (42): i=15 (44): i=14 ... (80): NO CHANGE\n if S[i] == S[i-1] == 'L': # (43): NO CHANGE (45): NO CHANGE ... (79): NO CHANGE\n maze[i-2] += maze[i] # (50): maze=[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 2, 1, 0, 1, 2] (68): maze=[1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 2, 2, 0, 0, 1, 2] ... (76): maze=[3, 2, 2, 0, 0, 1, 1, 1, 1, 0, 2, 2, 0, 0, 1, 2]\n maze[i] = 0 # (51): maze=[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 2, 0, 0, 1, 2] (69): maze=[1, 1, 2, 1, 0, 1, 1, 1, 1, 0, 2, 2, 0, 0, 1, 2] ... (77): maze=[3, 2, 0, 0, 0, 1, 1, 1, 1, 0, 2, 2, 0, 0, 1, 2]\n\nprint(*maze)\n"], "anno_status": [true], "diff_content": " S = input()\n n = len(S)\n maze = [1] * n\n \n for i in range(0,n-1):\n if S[i] == S[i+1] == 'R':\n- print('before',maze)\n+ \n maze[i+2] += maze[i]\n maze[i] = 0\n- print('after',maze)\n+ \n \n for i in range(n-1,0,-1):\n if S[i] == S[i-1] == 'L':\n maze[i-2] += maze[i]\n maze[i] = 0\n \n print(*maze)\n \n", "FL_content": " S = input()\n n = len(S)\n maze = [1] * n\n \n for i in range(0,n-1):\n if S[i] == S[i+1] == 'R':\n- print('before',maze)\n maze[i+2] += maze[i]\n maze[i] = 0\n- print('after',maze)\n \n for i in range(n-1,0,-1):\n if S[i] == S[i-1] == 'L':\n maze[i-2] += maze[i]\n maze[i] = 0\n \n print(*maze)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u422590714", "problem_id": "p02954", "submission1_id": "s684612209", "submission2_id": "s694563503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nsys.setrecursionlimit(10 ** 7)\n\nS = list(input())\n\nis_hole = [None for _ in S]\nis_s = [None for _ in S]\n\ns_1 = None\nfor i, s in enumerate(S):\n if s_1 == 'R' and s == 'L':\n is_hole[i - 1] = 'R'\n is_hole[i] = 'L'\n if s_1 == 'L' and s == 'R':\n is_s[i] = 'S' \n s_1 = s\n\nresult = [0 for _ in S]\nmem_R = 0 \nmem_Rx = 0 \nmem_L = 0\n\ndef find_next_mem_R(i):\n while i < len(S):\n if is_hole[i] == 'R':\n return i\n i += 1\n\nmem_Rx = find_next_mem_R(0)\n\nfor i, s in enumerate(S):\n if is_s[i] == 'S':\n result[mem_Rx] = mem_R\n result[mem_Rx + 1] = mem_L\n mem_R = 0\n mem_L = 0\n mem_Rx = find_next_mem_R(i)\n\n if s == 'R':\n x_diff_for_R = mem_Rx - i\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n else:\n x_diff_for_R = i - mem_Rx\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n\nresult[mem_Rx] = mem_R\nresult[mem_Rx + 1] = mem_L\nprint(result)\n", "code2": "import sys\n\nsys.setrecursionlimit(10 ** 7)\n\nS = list(input())\n\nis_hole = [None for _ in S]\nis_s = [None for _ in S]\n\ns_1 = None\nfor i, s in enumerate(S):\n if s_1 == 'R' and s == 'L':\n is_hole[i - 1] = 'R'\n is_hole[i] = 'L'\n if s_1 == 'L' and s == 'R':\n is_s[i] = 'S' \n s_1 = s\n\nresult = [0 for _ in S]\nmem_R = 0 \nmem_Rx = 0 \nmem_L = 0\n\ndef find_next_mem_R(i):\n while i < len(S):\n if is_hole[i] == 'R':\n return i\n i += 1\n\nmem_Rx = find_next_mem_R(0)\n\nfor i, s in enumerate(S):\n if is_s[i] == 'S':\n result[mem_Rx] = mem_R\n result[mem_Rx + 1] = mem_L\n mem_R = 0\n mem_L = 0\n mem_Rx = find_next_mem_R(i)\n\n if s == 'R':\n x_diff_for_R = mem_Rx - i\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n else:\n x_diff_for_R = i - mem_Rx\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n\nresult[mem_Rx] = mem_R\nresult[mem_Rx + 1] = mem_L\n\nresult_str = [str(i) for i in result]\nprint(' '.join(result_str))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566951685", "date2": "1566951808", "bleu_score": "0.9492441458880209", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRRLLRLRRLLLLLRL\n", "actual_output": "[0, 0, 3, 2, 0, 1, 1, 0, 3, 4, 0, 0, 0, 0, 1, 1]\n", "expected_output": "0 0 3 2 0 1 1 0 3 4 0 0 0 0 1 1\n\n", "anno_code": ["import sys\n\nsys.setrecursionlimit(10 ** 7) # (0): NO CHANGE\n\nS = list(input()) # (1): S=['R', 'R', 'R', 'L', 'L', 'R', 'L', 'R', 'R', 'L', 'L', 'L', 'L', 'L', 'R', 'L']\n\nis_hole = [None for _ in S] # (2): is_hole=[None, None, None, None, None, None, None, None, None, None, None, None, None, None, None, None]\nis_s = [None for _ in S] # (3): is_s=[None, None, None, None, None, None, None, None, None, None, None, None, None, None, None, None]\n\ns_1 = None # (4): s_1=None\nfor i, s in enumerate(S): # (5): i=0, s=R (9): i=1 ... (80): NO CHANGE\n if s_1 == 'R' and s == 'L': # (6): NO CHANGE (10): NO CHANGE ... (75): NO CHANGE\n is_hole[i - 1] = 'R' # (19): is_hole=[None, None, 'R', None, None, None, None, None, None, None, None, None, None, None, None, None] (34): is_hole=[None, None, 'R', 'L', None, 'R', None, None, None, None, None, None, None, None, None, None] ... (76): is_hole=[None, None, 'R', 'L', None, 'R', 'L', None, 'R', 'L', None, None, None, None, 'R', None]\n is_hole[i] = 'L' # (20): is_hole=[None, None, 'R', 'L', None, None, None, None, None, None, None, None, None, None, None, None] (35): is_hole=[None, None, 'R', 'L', None, 'R', 'L', None, None, None, None, None, None, None, None, None] ... (77): is_hole=[None, None, 'R', 'L', None, 'R', 'L', None, 'R', 'L', None, None, None, None, 'R', 'L']\n if s_1 == 'L' and s == 'R': # (7): NO CHANGE (11): NO CHANGE ... (78): NO CHANGE\n is_s[i] = 'S' # (30): is_s=[None, None, None, None, None, 'S', None, None, None, None, None, None, None, None, None, None] (41): is_s=[None, None, None, None, None, 'S', None, 'S', None, None, None, None, None, None, None, None] (72): is_s=[None, None, None, None, None, 'S', None, 'S', None, None, None, None, None, None, 'S', None]\n s_1 = s # (8): s_1=R (12): NO CHANGE ... (79): s_1=L\n\nresult = [0 for _ in S] # (81): result=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nmem_R = 0 # (82): mem_R=0\nmem_Rx = 0 # (83): mem_Rx=0\nmem_L = 0 # (84): mem_L=0\n\ndef find_next_mem_R(i): # (85): find_next_mem_R=\n while i < len(S): # (87): NO CHANGE (90): NO CHANGE ... (203): NO CHANGE\n if is_hole[i] == 'R': # (88): NO CHANGE (91): NO CHANGE ... (204): sys=, S=['R', 'R', 'R', 'L', 'L', 'R', 'L', 'R', 'R', 'L', 'L', 'L', 'L', 'L', 'R', 'L'], is_hole=[None, None, 'R', 'L', None, 'R', 'L', None, 'R', 'L', None, None, None, None, 'R', 'L'], is_s=[None, None, None, None, None, 'S', None, 'S', None, None, None, None, None, None, 'S', None], s_1=L, s=R, result=[0, 0, 3, 2, 0, 1, 1, 0, 3, 4, 0, 0, 0, 0, 0, 0], mem_R=0, mem_Rx=14, mem_L=0, find_next_mem_R=, x_diff_for_R=5\n return i\n i += 1 # (89): i=1 (92): i=2 (153): i=8\n\nmem_Rx = find_next_mem_R(0) # (86): i=0\n\nfor i, s in enumerate(S): # (95): i=0, s=R (101): i=1 ... (215): NO CHANGE\n if is_s[i] == 'S': # (96): NO CHANGE (102): NO CHANGE ... (210): NO CHANGE\n result[mem_Rx] = mem_R # (127): result=[0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (146): result=[0, 0, 3, 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (198): result=[0, 0, 3, 2, 0, 1, 1, 0, 3, 0, 0, 0, 0, 0, 0, 0]\n result[mem_Rx + 1] = mem_L # (128): result=[0, 0, 3, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (147): result=[0, 0, 3, 2, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] (199): result=[0, 0, 3, 2, 0, 1, 1, 0, 3, 4, 0, 0, 0, 0, 0, 0]\n mem_R = 0 # (129): mem_R=0 (148): mem_R=0 (200): mem_R=0\n mem_L = 0 # (130): mem_L=0 (149): mem_L=0 (201): mem_L=0\n mem_Rx = find_next_mem_R(i) # (131): NO CHANGE (150): NO CHANGE (202): NO CHANGE\n\n if s == 'R': # (97): NO CHANGE (103): NO CHANGE ... (211): NO CHANGE\n x_diff_for_R = mem_Rx - i # (98): x_diff_for_R=2 (104): x_diff_for_R=1 ... (206): x_diff_for_R=0\n if x_diff_for_R % 2 == 0: # (99): NO CHANGE (105): NO CHANGE ... (207): NO CHANGE\n mem_R += 1 # (100): mem_R=1 (112): mem_R=2 ... (208): mem_R=1\n else:\n mem_L += 1 # (106): mem_L=1 (159): mem_L=1\n else:\n x_diff_for_R = i - mem_Rx # (116): x_diff_for_R=1 (122): x_diff_for_R=2 ... (212): x_diff_for_R=1\n if x_diff_for_R % 2 == 0: # (117): NO CHANGE (123): NO CHANGE ... (213): NO CHANGE\n mem_R += 1 # (124): mem_R=3 (177): mem_R=2 (189): mem_R=3\n else:\n mem_L += 1 # (118): mem_L=2 (143): mem_L=1 ... (214): mem_L=1\n\nresult[mem_Rx] = mem_R # (216): result=[0, 0, 3, 2, 0, 1, 1, 0, 3, 4, 0, 0, 0, 0, 1, 0]\nresult[mem_Rx + 1] = mem_L # (217): result=[0, 0, 3, 2, 0, 1, 1, 0, 3, 4, 0, 0, 0, 0, 1, 1]\nprint(result)\n"], "anno_status": [false], "diff_content": " import sys\n \n sys.setrecursionlimit(10 ** 7)\n \n S = list(input())\n \n is_hole = [None for _ in S]\n is_s = [None for _ in S]\n \n s_1 = None\n for i, s in enumerate(S):\n if s_1 == 'R' and s == 'L':\n is_hole[i - 1] = 'R'\n is_hole[i] = 'L'\n if s_1 == 'L' and s == 'R':\n is_s[i] = 'S' \n s_1 = s\n \n result = [0 for _ in S]\n mem_R = 0 \n mem_Rx = 0 \n mem_L = 0\n \n def find_next_mem_R(i):\n while i < len(S):\n if is_hole[i] == 'R':\n return i\n i += 1\n \n mem_Rx = find_next_mem_R(0)\n \n for i, s in enumerate(S):\n if is_s[i] == 'S':\n result[mem_Rx] = mem_R\n result[mem_Rx + 1] = mem_L\n mem_R = 0\n mem_L = 0\n mem_Rx = find_next_mem_R(i)\n \n if s == 'R':\n x_diff_for_R = mem_Rx - i\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n else:\n x_diff_for_R = i - mem_Rx\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n \n result[mem_Rx] = mem_R\n result[mem_Rx + 1] = mem_L\n-print(result)\n+\n+result_str = [str(i) for i in result]\n+print(' '.join(result_str))\n \n", "FL_content": " import sys\n \n sys.setrecursionlimit(10 ** 7)\n \n S = list(input())\n \n is_hole = [None for _ in S]\n is_s = [None for _ in S]\n \n s_1 = None\n for i, s in enumerate(S):\n if s_1 == 'R' and s == 'L':\n is_hole[i - 1] = 'R'\n is_hole[i] = 'L'\n if s_1 == 'L' and s == 'R':\n is_s[i] = 'S' \n s_1 = s\n \n result = [0 for _ in S]\n mem_R = 0 \n mem_Rx = 0 \n mem_L = 0\n \n def find_next_mem_R(i):\n while i < len(S):\n if is_hole[i] == 'R':\n return i\n i += 1\n \n mem_Rx = find_next_mem_R(0)\n \n for i, s in enumerate(S):\n if is_s[i] == 'S':\n result[mem_Rx] = mem_R\n result[mem_Rx + 1] = mem_L\n mem_R = 0\n mem_L = 0\n mem_Rx = find_next_mem_R(i)\n \n if s == 'R':\n x_diff_for_R = mem_Rx - i\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n else:\n x_diff_for_R = i - mem_Rx\n if x_diff_for_R % 2 == 0:\n mem_R += 1\n else:\n mem_L += 1\n \n result[mem_Rx] = mem_R\n result[mem_Rx + 1] = mem_L\n-print(result)\n \n", "added_lines": 3, "removed_lines": 1, "code1_lines": 56 }, { "user_id": "u694665829", "problem_id": "p02954", "submission1_id": "s193103473", "submission2_id": "s699187222", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\n\nS=input()\nn=len(S)\ndp=[[0]*n for _ in range(20)]\n\nfor i,s in enumerate(S):\n dp[0][i]=i-1 if s =='L' else i+1\n\nfor k in range(19):\n for i in range(n):\n dp[k+1][i]=dp[k][dp[k][i]]\n\nC=Counter(dp[-1])\nprint(dp[-1])\nprint(C)\nprint(*[C[i] for i in range(n)])", "code2": "from collections import Counter\n\nS=input()\nn=len(S)\ndp=[[0]*n for _ in range(20)]\n\nfor i,s in enumerate(S):\n dp[0][i]=i-1 if s =='L' else i+1\n\nfor k in range(19):\n for i in range(n):\n dp[k+1][i]=dp[k][dp[k][i]]\n\nC=Counter(dp[-1])\n\nprint(*[C[i] for i in range(n)])", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598299225", "date2": "1598299252", "bleu_score": "0.9183149523835711", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLLLLRLLRRL\n", "actual_output": "[2, 1, 2, 1, 2, 1, 6, 7, 6, 11, 10, 11]\nCounter({2: 3, 1: 3, 6: 2, 11: 2, 7: 1, 10: 1})\n0 3 3 0 0 0 2 1 0 0 1 2\n", "expected_output": "0 3 3 0 0 0 2 1 0 0 1 2\n\n", "anno_code": ["from collections import Counter\n\nS=input() # (0): S=RRLLLLRLLRRL\nn=len(S) # (1): n=12\ndp=[[0]*n for _ in range(20)] # (2): dp\n\nfor i,s in enumerate(S): # (3): i=0, s=R (5): i=1 ... (27): NO CHANGE\n dp[0][i]=i-1 if s =='L' else i+1 # (4): dp (6): dp ... (26): dp\n\nfor k in range(19): # (28): k=0 (54): k=1 ... (522): NO CHANGE\n for i in range(n): # (29): i=0 (31): i=1 ... (521): NO CHANGE\n dp[k+1][i]=dp[k][dp[k][i]] # (30): dp (32): dp ... (520): dp\n\nC=Counter(dp[-1]) # (523): C=Counter({2: 3, 1: 3, 6: 2, 11: 2, 7: 1, 10: 1})\nprint(dp[-1]) # (524): NO CHANGE\nprint(C) # (525): NO CHANGE\nprint(*[C[i] for i in range(n)])"], "anno_status": [true], "diff_content": " from collections import Counter\n \n S=input()\n n=len(S)\n dp=[[0]*n for _ in range(20)]\n \n for i,s in enumerate(S):\n dp[0][i]=i-1 if s =='L' else i+1\n \n for k in range(19):\n for i in range(n):\n dp[k+1][i]=dp[k][dp[k][i]]\n \n C=Counter(dp[-1])\n-print(dp[-1])\n-print(C)\n+\n print(*[C[i] for i in range(n)])\n", "FL_content": " from collections import Counter\n \n S=input()\n n=len(S)\n dp=[[0]*n for _ in range(20)]\n \n for i,s in enumerate(S):\n dp[0][i]=i-1 if s =='L' else i+1\n \n for k in range(19):\n for i in range(n):\n dp[k+1][i]=dp[k][dp[k][i]]\n \n C=Counter(dp[-1])\n-print(dp[-1])\n-print(C)\n print(*[C[i] for i in range(n)])\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u580904613", "problem_id": "p02954", "submission1_id": "s293310201", "submission2_id": "s611114667", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nans = [0]*len(S)\ntmp = []\ncnt = 1;\n\nfor i in range(len(S)-1):\n if(S[i] == S[i+1]):\n cnt += 1\n else:\n tmp.append(cnt)\n cnt = 1\ntmp.append(cnt)\n\ncnt = 0\nfor i in range(len(tmp)-1):\n cnt += tmp[i]\n if(i % 2 == 0):\n if((tmp[i] - tmp[i+1])%2 == 0):\n ans[cnt-1] = int((tmp[i]+tmp[i+1])/2)\n ans[cnt] = int((tmp[i]+tmp[i+1])/2)\n else:\n if(abs(tmp[i] - tmp[i+1]) > 2):\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n \nprint(*ans)", "code2": "S = input()\nans = [0]*len(S)\ntmp = []\ncnt = 1;\n\nfor i in range(len(S)-1):\n if(S[i] == S[i+1]):\n cnt += 1\n else:\n tmp.append(cnt)\n cnt = 1\ntmp.append(cnt)\n\ncnt = 0\nfor i in range(len(tmp)-1):\n cnt += tmp[i]\n if(i % 2 == 0):\n if((tmp[i] - tmp[i+1])%2 == 0):\n ans[cnt-1] = int((tmp[i]+tmp[i+1])/2)\n ans[cnt] = int((tmp[i]+tmp[i+1])/2)\n else:\n if(min(tmp[i], tmp[i+1]) % 2):\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n \nprint(*ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564972757", "date2": "1564972800", "bleu_score": "0.9886571164348203", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 24, "total_score": 103, "input": "RLRRLRLLLLLRRRLL\n", "actual_output": "1 1 0 2 1 3 3 0 0 0 0 0 0 3 2 0\n", "expected_output": "1 1 0 1 2 3 3 0 0 0 0 0 0 3 2 0\n\n", "anno_code": ["S = input() # (0): S=RLRRLRLLLLLRRRLL\nans = [0]*len(S) # (1): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\ntmp = [] # (2): tmp=[]\ncnt = 1; # (3): cnt=1\n\nfor i in range(len(S)-1): # (4): i=0 (8): i=1 ... (56): NO CHANGE\n if(S[i] == S[i+1]): # (5): NO CHANGE (9): NO CHANGE ... (54): NO CHANGE\n cnt += 1 # (14): cnt=2 (29): cnt=2 ... (55): cnt=2\n else:\n tmp.append(cnt) # (6): tmp=[1] (10): tmp=[1, 1] ... (51): tmp=[1, 1, 2, 1, 1, 5, 3]\n cnt = 1 # (7): NO CHANGE (11): NO CHANGE ... (52): cnt=1\ntmp.append(cnt) # (57): tmp=[1, 1, 2, 1, 1, 5, 3, 2]\n\ncnt = 0 # (58): cnt=0\nfor i in range(len(tmp)-1): # (59): i=0 (65): i=1 ... (96): NO CHANGE\n cnt += tmp[i] # (60): cnt=1 (66): cnt=2 ... (89): cnt=14\n if(i % 2 == 0): # (61): NO CHANGE (67): NO CHANGE ... (90): NO CHANGE\n if((tmp[i] - tmp[i+1])%2 == 0): # (62): NO CHANGE (71): NO CHANGE ... (91): NO CHANGE\n ans[cnt-1] = int((tmp[i]+tmp[i+1])/2) # (63): ans=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (83): ans=[1, 1, 0, 2, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n ans[cnt] = int((tmp[i]+tmp[i+1])/2) # (64): ans=[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (84): ans=[1, 1, 0, 2, 1, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n else:\n if(abs(tmp[i] - tmp[i+1]) > 2): # (72): NO CHANGE (92): NO CHANGE\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n if(tmp[i] > tmp[i+1]): # (73): NO CHANGE (93): NO CHANGE\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2) # (74): ans=[1, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (94): ans=[1, 1, 0, 2, 1, 3, 3, 0, 0, 0, 0, 0, 0, 3, 0, 0]\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2) # (75): ans=[1, 1, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (95): ans=[1, 1, 0, 2, 1, 3, 3, 0, 0, 0, 0, 0, 0, 3, 2, 0]\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n \nprint(*ans)"], "anno_status": [false], "diff_content": " S = input()\n ans = [0]*len(S)\n tmp = []\n cnt = 1;\n \n for i in range(len(S)-1):\n if(S[i] == S[i+1]):\n cnt += 1\n else:\n tmp.append(cnt)\n cnt = 1\n tmp.append(cnt)\n \n cnt = 0\n for i in range(len(tmp)-1):\n cnt += tmp[i]\n if(i % 2 == 0):\n if((tmp[i] - tmp[i+1])%2 == 0):\n ans[cnt-1] = int((tmp[i]+tmp[i+1])/2)\n ans[cnt] = int((tmp[i]+tmp[i+1])/2)\n else:\n- if(abs(tmp[i] - tmp[i+1]) > 2):\n+ if(min(tmp[i], tmp[i+1]) % 2):\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n \n print(*ans)\n", "FL_content": " S = input()\n ans = [0]*len(S)\n tmp = []\n cnt = 1;\n \n for i in range(len(S)-1):\n if(S[i] == S[i+1]):\n cnt += 1\n else:\n tmp.append(cnt)\n cnt = 1\n tmp.append(cnt)\n \n cnt = 0\n for i in range(len(tmp)-1):\n cnt += tmp[i]\n if(i % 2 == 0):\n if((tmp[i] - tmp[i+1])%2 == 0):\n ans[cnt-1] = int((tmp[i]+tmp[i+1])/2)\n ans[cnt] = int((tmp[i]+tmp[i+1])/2)\n else:\n- if(abs(tmp[i] - tmp[i+1]) > 2):\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n if(tmp[i] > tmp[i+1]):\n ans[cnt-1] = int((tmp[i] + tmp[i+1]+1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]-1)/2)\n else:\n ans[cnt-1] = int((tmp[i] + tmp[i+1]-1)/2)\n ans[cnt] = int((tmp[i]+tmp[i+1]+1)/2)\n \n print(*ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 37 }, { "user_id": "u471684875", "problem_id": "p02954", "submission1_id": "s726314930", "submission2_id": "s588307848", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=str(input())\n\nl=[0]*len(s)\n\nfor i in range(len(s)):\n if s[i]=='R' and i%2==1:\n a=s.find('L',i)\n l[a-1]+=1\n elif s[i]=='R' and i%2==0:\n a=s.find('L',i)\n l[a]+=1\n elif s[i]=='L' and i%2==1:\n a=s.rfind('R',0,i)\n l[a]+=1\n elif s[i]=='L' and i%2==0:\n a=s.rfind('R',0,i)\n l[a+1]+=1\nprint(' '.join(map(str,l)))\n ", "code2": "s=str(input())\n\nl=[0]*len(s)\n\nfor i in range(len(s)):\n a=s.find('L',i)\n b=s.rfind('R',0,i)\n if s[i]=='R' and (a-i)%2==0:\n l[a]+=1\n elif s[i]=='R' and (a-i)%2==1:\n l[a-1]+=1\n elif s[i]=='L' and (i-b)%2==0:\n l[b]+=1\n elif s[i]=='L' and (i-b)%2==1:\n l[b+1]+=1\nprint(' '.join(map(str,l)))\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564985351", "date2": "1564985855", "bleu_score": "0.7780997913825572", "code1_test_status": [0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 35, "total_score": 103, "input": "RLRLRLRLLRRLRLLL\n", "actual_output": "1 1 1 1 1 1 1 2 0 0 2 1 2 2 0 0\n", "expected_output": "1 1 1 1 1 1 2 1 0 0 1 2 2 2 0 0\n\n", "anno_code": ["s=str(input()) # (0): s=RLRLRLRLLRRLRLLL\n\nl=[0]*len(s) # (1): l=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(len(s)): # (2): i=0 (7): i=1 ... (92): NO CHANGE\n if s[i]=='R' and i%2==1: # (3): NO CHANGE (8): NO CHANGE ... (87): NO CHANGE\n a=s.find('L',i) # (55): a=11\n l[a-1]+=1 # (56): l=[1, 1, 1, 1, 1, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0, 0]\n elif s[i]=='R' and i%2==0: # (4): NO CHANGE (9): NO CHANGE ... (88): NO CHANGE\n a=s.find('L',i) # (5): a=1 (16): a=3 ... (71): a=13\n l[a]+=1 # (6): l=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (17): l=[1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (72): l=[1, 1, 1, 1, 1, 1, 1, 2, 0, 0, 2, 1, 0, 1, 0, 0]\n elif s[i]=='L' and i%2==1: # (10): NO CHANGE (21): NO CHANGE ... (89): NO CHANGE\n a=s.rfind('R',0,i) # (11): a=0 (22): a=2 ... (90): NO CHANGE\n l[a]+=1 # (12): l=[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (23): l=[1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (91): l=[1, 1, 1, 1, 1, 1, 1, 2, 0, 0, 2, 1, 2, 2, 0, 0]\n elif s[i]=='L' and i%2==0: # (50): NO CHANGE (83): NO CHANGE\n a=s.rfind('R',0,i) # (51): NO CHANGE (84): NO CHANGE\n l[a+1]+=1 # (52): l=[1, 1, 1, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0] (85): l=[1, 1, 1, 1, 1, 1, 1, 2, 0, 0, 2, 1, 1, 2, 0, 0]\nprint(' '.join(map(str,l)))\n "], "anno_status": [true], "diff_content": " s=str(input())\n \n l=[0]*len(s)\n \n for i in range(len(s)):\n- if s[i]=='R' and i%2==1:\n- a=s.find('L',i)\n- l[a-1]+=1\n- elif s[i]=='R' and i%2==0:\n- a=s.find('L',i)\n- l[a]+=1\n- elif s[i]=='L' and i%2==1:\n- a=s.rfind('R',0,i)\n+ a=s.find('L',i)\n+ b=s.rfind('R',0,i)\n+ if s[i]=='R' and (a-i)%2==0:\n l[a]+=1\n- elif s[i]=='L' and i%2==0:\n- a=s.rfind('R',0,i)\n- l[a+1]+=1\n+ elif s[i]=='R' and (a-i)%2==1:\n+ l[a-1]+=1\n+ elif s[i]=='L' and (i-b)%2==0:\n+ l[b]+=1\n+ elif s[i]=='L' and (i-b)%2==1:\n+ l[b+1]+=1\n print(' '.join(map(str,l)))\n \n", "FL_content": " s=str(input())\n \n l=[0]*len(s)\n \n for i in range(len(s)):\n- if s[i]=='R' and i%2==1:\n- a=s.find('L',i)\n- l[a-1]+=1\n- elif s[i]=='R' and i%2==0:\n- a=s.find('L',i)\n- l[a]+=1\n- elif s[i]=='L' and i%2==1:\n- a=s.rfind('R',0,i)\n l[a]+=1\n- elif s[i]=='L' and i%2==0:\n- a=s.rfind('R',0,i)\n- l[a+1]+=1\n print(' '.join(map(str,l)))\n \n", "added_lines": 9, "removed_lines": 11, "code1_lines": 19 }, { "user_id": "u899909022", "problem_id": "p02954", "submission1_id": "s296521830", "submission2_id": "s068092939", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\nans = [0] * len(S)\nlast_R=[0] * len(S)\ntmp = 0\nfor i in range(len(S)):\n if S[i] == \"R\":\n tmp = i\n last_R[i] = tmp\nfirst_L=[0] * len(S)\ntmp = 0\nfor i in reversed(range(len(S))):\n if S[i] == \"L\":\n tmp = i\n first_L[i] = tmp\nfor i in range(len(S)):\n if S[i] == \"L\":\n R_index = last_R[i]\n if i - R_index % 2 == 1:\n ans[R_index+1] += 1\n else:\n ans[R_index] += 1\n if S[i] == \"R\":\n L_index = first_L[i]\n if L_index - i %2 == 1:\n ans[L_index-1] += 1\n else:\n ans[L_index] += 1\nans = map(str, ans)\nprint(\" \".join(ans))", "code2": "S=input()\nans = [0] * len(S)\nlast_R=[0] * len(S)\ntmp = 0\nfor i in range(len(S)):\n if S[i] == \"R\":\n tmp = i\n last_R[i] = tmp\nfirst_L=[0] * len(S)\ntmp = 0\nfor i in reversed(range(len(S))):\n if S[i] == \"L\":\n tmp = i\n first_L[i] = tmp\nfor i in range(len(S)):\n if S[i] == \"L\":\n R_index = last_R[i]\n if (i - R_index) % 2 == 1:\n ans[R_index+1] += 1\n else:\n ans[R_index] += 1\n if S[i] == \"R\":\n L_index = first_L[i]\n if (L_index - i) %2 == 1:\n ans[L_index-1] += 1\n else:\n ans[L_index] += 1\nans = map(str, ans)\nprint(\" \".join(ans))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564973501", "date2": "1564973833", "bleu_score": "0.9842761779661284", "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, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0], "code1_test_score": 9, "total_score": 103, "input": "RRRLLRLLRLLRLRLL\n", "actual_output": "0 0 2 3 0 2 1 0 2 1 0 1 1 2 1 0\n", "expected_output": "0 0 3 2 0 2 1 0 2 1 0 1 1 2 1 0\n\n", "anno_code": ["S=input() # (0): S=RRRLLRLLRLLRLRLL\nans = [0] * len(S) # (1): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nlast_R=[0] * len(S) # (2): last_R=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\ntmp = 0 # (3): tmp=0\nfor i in range(len(S)): # (4): i=0 (8): i=1 ... (59): NO CHANGE\n if S[i] == \"R\": # (5): NO CHANGE (9): NO CHANGE ... (57): NO CHANGE\n tmp = i # (6): NO CHANGE (10): tmp=1 ... (51): tmp=13\n last_R[i] = tmp # (7): NO CHANGE (11): last_R=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (58): last_R=[0, 1, 2, 2, 2, 5, 5, 5, 8, 8, 8, 11, 11, 13, 13, 13]\nfirst_L=[0] * len(S) # (60): first_L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\ntmp = 0 # (61): tmp=0\nfor i in reversed(range(len(S))): # (62): NO CHANGE (66): i=14 ... (119): NO CHANGE\n if S[i] == \"L\": # (63): NO CHANGE (67): NO CHANGE ... (117): NO CHANGE\n tmp = i # (64): tmp=15 (68): tmp=14 ... (108): tmp=3\n first_L[i] = tmp # (65): first_L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15] (69): first_L=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 15] ... (118): first_L=[3, 3, 3, 3, 4, 6, 6, 7, 9, 9, 10, 12, 12, 14, 14, 15]\nfor i in range(len(S)): # (120): NO CHANGE (126): i=1 ... (216): NO CHANGE\n if S[i] == \"L\": # (121): NO CHANGE (127): NO CHANGE ... (211): NO CHANGE\n R_index = last_R[i] # (140): R_index=2 (146): NO CHANGE ... (212): NO CHANGE\n if i - R_index % 2 == 1: # (141): NO CHANGE (147): NO CHANGE ... (213): NO CHANGE\n ans[R_index+1] += 1\n else:\n ans[R_index] += 1 # (142): ans=[0, 0, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (148): ans=[0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (214): ans=[0, 0, 2, 3, 0, 2, 1, 0, 2, 1, 0, 1, 1, 2, 1, 0]\n if S[i] == \"R\": # (122): NO CHANGE (128): NO CHANGE ... (215): NO CHANGE\n L_index = first_L[i] # (123): L_index=3 (129): NO CHANGE ... (201): L_index=14\n if L_index - i %2 == 1: # (124): NO CHANGE (130): NO CHANGE ... (202): NO CHANGE\n ans[L_index-1] += 1\n else:\n ans[L_index] += 1 # (125): ans=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (131): ans=[0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (203): ans=[0, 0, 2, 3, 0, 2, 1, 0, 2, 1, 0, 1, 1, 0, 1, 0]\nans = map(str, ans) # (217): ans=\nprint(\" \".join(ans))"], "anno_status": [false], "diff_content": " S=input()\n ans = [0] * len(S)\n last_R=[0] * len(S)\n tmp = 0\n for i in range(len(S)):\n if S[i] == \"R\":\n tmp = i\n last_R[i] = tmp\n first_L=[0] * len(S)\n tmp = 0\n for i in reversed(range(len(S))):\n if S[i] == \"L\":\n tmp = i\n first_L[i] = tmp\n for i in range(len(S)):\n if S[i] == \"L\":\n R_index = last_R[i]\n- if i - R_index % 2 == 1:\n+ if (i - R_index) % 2 == 1:\n ans[R_index+1] += 1\n else:\n ans[R_index] += 1\n if S[i] == \"R\":\n L_index = first_L[i]\n- if L_index - i %2 == 1:\n+ if (L_index - i) %2 == 1:\n ans[L_index-1] += 1\n else:\n ans[L_index] += 1\n ans = map(str, ans)\n print(\" \".join(ans))\n", "FL_content": " S=input()\n ans = [0] * len(S)\n last_R=[0] * len(S)\n tmp = 0\n for i in range(len(S)):\n if S[i] == \"R\":\n tmp = i\n last_R[i] = tmp\n first_L=[0] * len(S)\n tmp = 0\n for i in reversed(range(len(S))):\n if S[i] == \"L\":\n tmp = i\n first_L[i] = tmp\n for i in range(len(S)):\n if S[i] == \"L\":\n R_index = last_R[i]\n- if i - R_index % 2 == 1:\n ans[R_index+1] += 1\n else:\n ans[R_index] += 1\n if S[i] == \"R\":\n L_index = first_L[i]\n- if L_index - i %2 == 1:\n ans[L_index-1] += 1\n else:\n ans[L_index] += 1\n ans = map(str, ans)\n print(\" \".join(ans))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u533511299", "problem_id": "p02954", "submission1_id": "s225430096", "submission2_id": "s473226319", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == '__main__':\n str = input()\n strList = [c for c in str]\n strList.append('e')\n strLength = len(strList)\n rLength = 0\n lLength = 0\n i = 0\n changePoint = 0\n\n child = [0 for i in range(strLength)]\n\n c = 'R'\n \n while(c != 'e'):\n c = strList[i]\n while(c == 'R'):\n i += 1\n c = strList[i]\n rLength += 1\n \n changePoint = i\n \n while(c == 'L'):\n i += 1\n c = strList[i]\n lLength += 1\n\n rRight = int(rLength/2)\n rLeft = rLength - rRight\n\n lLeft = int(lLength/2)\n lRight = lLength - lLeft\n\n child[changePoint-1] += rLeft + lLeft\n child[changePoint] += rRight + lRight\n\n rLength = 0\n lLength = 0\n \n for numOfChild in child:\n print(numOfChild, end=\"\")\n print(' ', end=\"\")", "code2": "if __name__ == '__main__':\n str = input()\n strList = [c for c in str]\n strList.append('e')\n strLength = len(strList)\n rLength = 0\n lLength = 0\n i = 0\n changePoint = 0\n\n child = [0 for i in range(strLength-1)]\n\n c = 'R'\n \n while(c != 'e'):\n c = strList[i]\n while(c == 'R'):\n i += 1\n c = strList[i]\n rLength += 1\n \n changePoint = i\n \n while(c == 'L'):\n i += 1\n c = strList[i]\n lLength += 1\n\n rRight = int(rLength/2)\n rLeft = rLength - rRight\n\n lLeft = int(lLength/2)\n lRight = lLength - lLeft\n\n child[changePoint-1] += rLeft + lLeft\n child[changePoint] += rRight + lRight\n\n rLength = 0\n lLength = 0\n \n for numOfChild in child:\n print(numOfChild, end=\"\")\n print(' ', end=\"\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565904351", "date2": "1565904417", "bleu_score": "0.9954005499739205", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLLLLLLRRRL\n", "actual_output": "0 4 4 0 0 0 0 0 0 0 2 2 0 ", "expected_output": "0 4 4 0 0 0 0 0 0 0 2 2\n\n", "anno_code": ["if __name__ == '__main__':\n str = input()\n strList = [c for c in str]\n strList.append('e')\n strLength = len(strList)\n rLength = 0\n lLength = 0\n i = 0\n changePoint = 0\n\n child = [0 for i in range(strLength)]\n\n c = 'R'\n \n while(c != 'e'):\n c = strList[i]\n while(c == 'R'):\n i += 1\n c = strList[i]\n rLength += 1\n \n changePoint = i\n \n while(c == 'L'):\n i += 1\n c = strList[i]\n lLength += 1\n\n rRight = int(rLength/2)\n rLeft = rLength - rRight\n\n lLeft = int(lLength/2)\n lRight = lLength - lLeft\n\n child[changePoint-1] += rLeft + lLeft\n child[changePoint] += rRight + lRight\n\n rLength = 0\n lLength = 0\n \n for numOfChild in child:\n print(numOfChild, end=\"\")\n print(' ', end=\"\")"], "anno_status": [true], "diff_content": " if __name__ == '__main__':\n str = input()\n strList = [c for c in str]\n strList.append('e')\n strLength = len(strList)\n rLength = 0\n lLength = 0\n i = 0\n changePoint = 0\n \n- child = [0 for i in range(strLength)]\n+ child = [0 for i in range(strLength-1)]\n \n c = 'R'\n \n while(c != 'e'):\n c = strList[i]\n while(c == 'R'):\n i += 1\n c = strList[i]\n rLength += 1\n \n changePoint = i\n \n while(c == 'L'):\n i += 1\n c = strList[i]\n lLength += 1\n \n rRight = int(rLength/2)\n rLeft = rLength - rRight\n \n lLeft = int(lLength/2)\n lRight = lLength - lLeft\n \n child[changePoint-1] += rLeft + lLeft\n child[changePoint] += rRight + lRight\n \n rLength = 0\n lLength = 0\n \n for numOfChild in child:\n print(numOfChild, end=\"\")\n print(' ', end=\"\")\n", "FL_content": " if __name__ == '__main__':\n str = input()\n strList = [c for c in str]\n strList.append('e')\n strLength = len(strList)\n rLength = 0\n lLength = 0\n i = 0\n changePoint = 0\n \n- child = [0 for i in range(strLength)]\n \n c = 'R'\n \n while(c != 'e'):\n c = strList[i]\n while(c == 'R'):\n i += 1\n c = strList[i]\n rLength += 1\n \n changePoint = i\n \n while(c == 'L'):\n i += 1\n c = strList[i]\n lLength += 1\n \n rRight = int(rLength/2)\n rLeft = rLength - rRight\n \n lLeft = int(lLength/2)\n lRight = lLength - lLeft\n \n child[changePoint-1] += rLeft + lLeft\n child[changePoint] += rRight + lRight\n \n rLength = 0\n lLength = 0\n \n for numOfChild in child:\n print(numOfChild, end=\"\")\n print(' ', end=\"\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 43 }, { "user_id": "u945181840", "problem_id": "p02954", "submission1_id": "s884452679", "submission2_id": "s421904379", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\neven = 0\nodd = 0\nl = S.index('L')\nr = S.index('R')\nans = [0] * len(S)\n\nfor i in range(len(S) - 1):\n if i % 2 == 0:\n even += 1\n else:\n odd += 1\n if S[i] == 'R' and S[i + 1] == 'L':\n l = i\n r = i + 1\n if i % 2 == 0:\n ans[i] += even\n ans[i + 1] += odd\n else:\n ans[i] += odd\n ans[i + 1] += even\n even = 0\n odd = 0\n elif S[i] == 'L' and S[i + 1] == 'R':\n if l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\n else:\n ans[l] += odd\n ans[l + 1] += even\n even = 0\n odd = 0\n\n\nif (len(S) - 1 - l) % 2 == 0:\n ans[l] += 1\nelse:\n ans[r] += 1\n\nif l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\nelse:\n ans[l] += odd\n ans[l + 1] += even\n\nprint(''.join(map(str, ans)))", "code2": "S = input()\n\neven = 0\nodd = 0\nl = S.index('L')\nr = S.index('R')\nans = [0] * len(S)\n\nfor i in range(len(S) - 1):\n if i % 2 == 0:\n even += 1\n else:\n odd += 1\n if S[i] == 'R' and S[i + 1] == 'L':\n l = i\n r = i + 1\n if i % 2 == 0:\n ans[i] += even\n ans[i + 1] += odd\n else:\n ans[i] += odd\n ans[i + 1] += even\n even = 0\n odd = 0\n elif S[i] == 'L' and S[i + 1] == 'R':\n if l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\n else:\n ans[l] += odd\n ans[l + 1] += even\n even = 0\n odd = 0\n\n\nif (len(S) - 1 - l) % 2 == 0:\n ans[l] += 1\nelse:\n ans[r] += 1\n\nif l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\nelse:\n ans[l] += odd\n ans[l + 1] += even\n\nprint(' '.join(map(str, ans)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571153790", "date2": "1571153850", "bleu_score": "0.9970955461407602", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLLLLRRLRLL\n", "actual_output": "033000012210\n", "expected_output": "0 3 3 0 0 0 0 1 2 2 1 0\n\n", "anno_code": ["S = input() # (0): S=RRLLLLRRLRLL\n\neven = 0 # (1): even=0\nodd = 0 # (2): odd=0\nl = S.index('L') # (3): l=2\nr = S.index('R') # (4): r=0\nans = [0] * len(S) # (5): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(len(S) - 1): # (6): i=0 (11): i=1 ... (89): NO CHANGE\n if i % 2 == 0: # (7): NO CHANGE (12): NO CHANGE ... (85): NO CHANGE\n even += 1 # (8): even=1 (24): even=1 ... (86): even=1\n else:\n odd += 1 # (13): odd=1 (29): odd=1 ... (75): odd=1\n if S[i] == 'R' and S[i + 1] == 'L': # (9): NO CHANGE (14): NO CHANGE ... (87): NO CHANGE\n l = i # (15): l=1 (56): l=7 (77): l=9\n r = i + 1 # (16): r=2 (57): r=8 (78): r=10\n if i % 2 == 0: # (17): NO CHANGE (58): NO CHANGE (79): NO CHANGE\n ans[i] += even\n ans[i + 1] += odd\n else:\n ans[i] += odd # (18): ans=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (59): ans=[0, 3, 3, 0, 0, 0, 0, 1, 0, 0, 0, 0] (80): ans=[0, 3, 3, 0, 0, 0, 0, 1, 2, 1, 0, 0]\n ans[i + 1] += even # (19): ans=[0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] (60): ans=[0, 3, 3, 0, 0, 0, 0, 1, 1, 0, 0, 0] (81): NO CHANGE\n even = 0 # (20): even=0 (61): even=0 (82): NO CHANGE\n odd = 0 # (21): odd=0 (62): odd=0 (83): odd=0\n elif S[i] == 'L' and S[i + 1] == 'R': # (10): NO CHANGE (26): NO CHANGE ... (88): NO CHANGE\n if l % 2 == 0: # (42): NO CHANGE (68): NO CHANGE\n ans[l] += even\n ans[l + 1] += odd\n else:\n ans[l] += odd # (43): ans=[0, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] (69): NO CHANGE\n ans[l + 1] += even # (44): ans=[0, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0] (70): ans=[0, 3, 3, 0, 0, 0, 0, 1, 2, 0, 0, 0]\n even = 0 # (45): even=0 (71): even=0\n odd = 0 # (46): odd=0 (72): NO CHANGE\n\n\nif (len(S) - 1 - l) % 2 == 0: # (90): NO CHANGE\n ans[l] += 1 # (91): ans=[0, 3, 3, 0, 0, 0, 0, 1, 2, 2, 0, 0]\nelse:\n ans[r] += 1\n\nif l % 2 == 0: # (92): NO CHANGE\n ans[l] += even\n ans[l + 1] += odd\nelse:\n ans[l] += odd # (93): NO CHANGE\n ans[l + 1] += even # (94): ans=[0, 3, 3, 0, 0, 0, 0, 1, 2, 2, 1, 0]\n\nprint(''.join(map(str, ans)))"], "anno_status": [false], "diff_content": " S = input()\n \n even = 0\n odd = 0\n l = S.index('L')\n r = S.index('R')\n ans = [0] * len(S)\n \n for i in range(len(S) - 1):\n if i % 2 == 0:\n even += 1\n else:\n odd += 1\n if S[i] == 'R' and S[i + 1] == 'L':\n l = i\n r = i + 1\n if i % 2 == 0:\n ans[i] += even\n ans[i + 1] += odd\n else:\n ans[i] += odd\n ans[i + 1] += even\n even = 0\n odd = 0\n elif S[i] == 'L' and S[i + 1] == 'R':\n if l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\n else:\n ans[l] += odd\n ans[l + 1] += even\n even = 0\n odd = 0\n \n \n if (len(S) - 1 - l) % 2 == 0:\n ans[l] += 1\n else:\n ans[r] += 1\n \n if l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\n else:\n ans[l] += odd\n ans[l + 1] += even\n \n-print(''.join(map(str, ans)))\n+print(' '.join(map(str, ans)))\n", "FL_content": " S = input()\n \n even = 0\n odd = 0\n l = S.index('L')\n r = S.index('R')\n ans = [0] * len(S)\n \n for i in range(len(S) - 1):\n if i % 2 == 0:\n even += 1\n else:\n odd += 1\n if S[i] == 'R' and S[i + 1] == 'L':\n l = i\n r = i + 1\n if i % 2 == 0:\n ans[i] += even\n ans[i + 1] += odd\n else:\n ans[i] += odd\n ans[i + 1] += even\n even = 0\n odd = 0\n elif S[i] == 'L' and S[i + 1] == 'R':\n if l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\n else:\n ans[l] += odd\n ans[l + 1] += even\n even = 0\n odd = 0\n \n \n if (len(S) - 1 - l) % 2 == 0:\n ans[l] += 1\n else:\n ans[r] += 1\n \n if l % 2 == 0:\n ans[l] += even\n ans[l + 1] += odd\n else:\n ans[l] += odd\n ans[l + 1] += even\n \n-print(''.join(map(str, ans)))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 48 }, { "user_id": "u464627439", "problem_id": "p02954", "submission1_id": "s948760841", "submission2_id": "s670882779", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\n\nN = len(s)\n\nRL = []\nLR = [-1]\nfor i in range(N-1):\n if s[i] == 'R' and s[i+1] == 'L':\n RL.append(i)\n if s[i] == 'L' and s[i+1] == 'R':\n LR.append(i)\n\nLR.append(N-1)\n\n_num = []\nfor i in range(len(LR)-1):\n _num.append(LR[i+1] - LR[i])\n\n\nans = [0]*N\n\nfor i in range(len(_num)):\n if int(_num[i]/2) == _num[i]/2:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2)\n else:\n if RL[i] - LR[i] > LR[i+1] - RL[i]:\n if int(RL[i] - LR[i]) == RL[i] - LR[i]:\n ans[RL[i]] = int(_num[i]/2) + 1\n ans[RL[i]+1] = int(_num[i]/2)\n else:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2) + 1\n else:\n if int(LR[i+1] - RL[i]) == LR[i+1] - RL[i]:\n ans[RL[i]] = int(_num[i]/2) + 1\n ans[RL[i]+1] = int(_num[i]/2)\n else:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2) + 1\n \nprint(ans)", "code2": "s = list(input())\n\nN = len(s)\n\nRL = []\nLR = [-1]\nfor i in range(N-1):\n if s[i] == 'R' and s[i+1] == 'L':\n RL.append(i)\n if s[i] == 'L' and s[i+1] == 'R':\n LR.append(i)\n\nLR.append(N-1)\n\n_num = []\nfor i in range(len(LR)-1):\n _num.append(LR[i+1] - LR[i])\n\n\nans = [0]*N\n\nfor i in range(len(_num)):\n if int(_num[i]/2) == _num[i]/2:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2)\n else:\n if int((RL[i] - LR[i])/2) == ((RL[i] - LR[i])/2):\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2) + 1\n else:\n ans[RL[i]] = int(_num[i]/2) + 1\n ans[RL[i]+1] = int(_num[i]/2)\n\nprint(' '.join(map(str, ans)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564972748", "date2": "1564974164", "bleu_score": "0.6039485923247255", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLLLRRLLRRLLRLL\n", "actual_output": "[0, 3, 2, 0, 0, 0, 2, 2, 0, 0, 2, 2, 0, 2, 1, 0]\n", "expected_output": "0 2 3 0 0 0 2 2 0 0 2 2 0 2 1 0\n\n", "anno_code": ["s = list(input()) # (0): s=['R', 'R', 'L', 'L', 'L', 'R', 'R', 'L', 'L', 'R', 'R', 'L', 'L', 'R', 'L', 'L']\n\nN = len(s) # (1): N=16\n\nRL = [] # (2): RL=[]\nLR = [-1] # (3): LR=[-1]\nfor i in range(N-1): # (4): i=0 (7): i=1 ... (56): NO CHANGE\n if s[i] == 'R' and s[i+1] == 'L': # (5): NO CHANGE (8): NO CHANGE ... (54): NO CHANGE\n RL.append(i) # (9): RL=[1] (26): RL=[1, 6] ... (51): RL=[1, 6, 10, 13]\n if s[i] == 'L' and s[i+1] == 'R': # (6): NO CHANGE (10): NO CHANGE ... (55): NO CHANGE\n LR.append(i) # (20): LR=[-1, 4] (34): LR=[-1, 4, 8] (48): LR=[-1, 4, 8, 12]\n\nLR.append(N-1) # (57): LR=[-1, 4, 8, 12, 15]\n\n_num = [] # (58): _num=[]\nfor i in range(len(LR)-1): # (59): i=0 (61): i=1 ... (67): NO CHANGE\n _num.append(LR[i+1] - LR[i]) # (60): _num=[5] (62): _num=[5, 4] ... (66): _num=[5, 4, 4, 3]\n\n\nans = [0]*N # (68): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(len(_num)): # (69): i=0 (75): i=1 ... (89): NO CHANGE\n if int(_num[i]/2) == _num[i]/2: # (70): NO CHANGE (76): NO CHANGE ... (84): NO CHANGE\n ans[RL[i]] = int(_num[i]/2) # (77): ans=[0, 3, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0] (81): ans=[0, 3, 2, 0, 0, 0, 2, 2, 0, 0, 2, 0, 0, 0, 0, 0]\n ans[RL[i]+1] = int(_num[i]/2) # (78): ans=[0, 3, 2, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0] (82): ans=[0, 3, 2, 0, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 0, 0]\n else:\n if RL[i] - LR[i] > LR[i+1] - RL[i]: # (71): NO CHANGE (85): NO CHANGE\n if int(RL[i] - LR[i]) == RL[i] - LR[i]:\n ans[RL[i]] = int(_num[i]/2) + 1\n ans[RL[i]+1] = int(_num[i]/2)\n else:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2) + 1\n else:\n if int(LR[i+1] - RL[i]) == LR[i+1] - RL[i]: # (72): NO CHANGE (86): NO CHANGE\n ans[RL[i]] = int(_num[i]/2) + 1 # (73): ans=[0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (87): ans=[0, 3, 2, 0, 0, 0, 2, 2, 0, 0, 2, 2, 0, 2, 0, 0]\n ans[RL[i]+1] = int(_num[i]/2) # (74): ans=[0, 3, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (88): ans=[0, 3, 2, 0, 0, 0, 2, 2, 0, 0, 2, 2, 0, 2, 1, 0]\n else:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2) + 1\n \nprint(ans)"], "anno_status": [false], "diff_content": " s = list(input())\n \n N = len(s)\n \n RL = []\n LR = [-1]\n for i in range(N-1):\n if s[i] == 'R' and s[i+1] == 'L':\n RL.append(i)\n if s[i] == 'L' and s[i+1] == 'R':\n LR.append(i)\n \n LR.append(N-1)\n \n _num = []\n for i in range(len(LR)-1):\n _num.append(LR[i+1] - LR[i])\n \n \n ans = [0]*N\n \n for i in range(len(_num)):\n if int(_num[i]/2) == _num[i]/2:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2)\n else:\n- if RL[i] - LR[i] > LR[i+1] - RL[i]:\n- if int(RL[i] - LR[i]) == RL[i] - LR[i]:\n- ans[RL[i]] = int(_num[i]/2) + 1\n- ans[RL[i]+1] = int(_num[i]/2)\n- else:\n- ans[RL[i]] = int(_num[i]/2)\n- ans[RL[i]+1] = int(_num[i]/2) + 1\n+ if int((RL[i] - LR[i])/2) == ((RL[i] - LR[i])/2):\n+ ans[RL[i]] = int(_num[i]/2)\n+ ans[RL[i]+1] = int(_num[i]/2) + 1\n else:\n- if int(LR[i+1] - RL[i]) == LR[i+1] - RL[i]:\n- ans[RL[i]] = int(_num[i]/2) + 1\n- ans[RL[i]+1] = int(_num[i]/2)\n- else:\n- ans[RL[i]] = int(_num[i]/2)\n- ans[RL[i]+1] = int(_num[i]/2) + 1\n- \n-print(ans)\n+ ans[RL[i]] = int(_num[i]/2) + 1\n+ ans[RL[i]+1] = int(_num[i]/2)\n+\n+print(' '.join(map(str, ans)))\n", "FL_content": " s = list(input())\n \n N = len(s)\n \n RL = []\n LR = [-1]\n for i in range(N-1):\n if s[i] == 'R' and s[i+1] == 'L':\n RL.append(i)\n if s[i] == 'L' and s[i+1] == 'R':\n LR.append(i)\n \n LR.append(N-1)\n \n _num = []\n for i in range(len(LR)-1):\n _num.append(LR[i+1] - LR[i])\n \n \n ans = [0]*N\n \n for i in range(len(_num)):\n if int(_num[i]/2) == _num[i]/2:\n ans[RL[i]] = int(_num[i]/2)\n ans[RL[i]+1] = int(_num[i]/2)\n else:\n- if RL[i] - LR[i] > LR[i+1] - RL[i]:\n- if int(RL[i] - LR[i]) == RL[i] - LR[i]:\n- ans[RL[i]] = int(_num[i]/2) + 1\n- ans[RL[i]+1] = int(_num[i]/2)\n- else:\n- ans[RL[i]] = int(_num[i]/2)\n- ans[RL[i]+1] = int(_num[i]/2) + 1\n else:\n- if int(LR[i+1] - RL[i]) == LR[i+1] - RL[i]:\n- ans[RL[i]] = int(_num[i]/2) + 1\n- ans[RL[i]+1] = int(_num[i]/2)\n- else:\n- ans[RL[i]] = int(_num[i]/2)\n- ans[RL[i]+1] = int(_num[i]/2) + 1\n- \n-print(ans)\n", "added_lines": 7, "removed_lines": 15, "code1_lines": 42 }, { "user_id": "u382423941", "problem_id": "p02954", "submission1_id": "s891300542", "submission2_id": "s264668088", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\n\ndef solve(s, c1, c2):\n res = [0] * (n)\n odd = 0\n even = 0\n for i in range(n):\n if s[i] == c1:\n if i % 2 == 1:\n odd += 1\n else:\n even += 1\n if s[i] == c2:\n if i % 2 == 1:\n res[i] += odd\n res[i-1] += even\n else:\n res[i] += even\n res[i-1] += odd\n odd, even = 0, 0\n return res\n\nA = solve(s, 'R', 'L')\nB = solve(s[::-1], 'L', 'R')[::-1]\nans = [a+b for a, b in zip(A,B)]\nprint(ans)", "code2": "s = input()\nn = len(s)\n\ndef solve(s, c1, c2):\n res = [0] * (n)\n odd = 0\n even = 0\n for i in range(n):\n if s[i] == c1:\n if i % 2 == 1:\n odd += 1\n else:\n even += 1\n if s[i] == c2:\n if i % 2 == 1:\n res[i] += odd\n res[i-1] += even\n else:\n res[i] += even\n res[i-1] += odd\n odd, even = 0, 0\n return res\n\nA = solve(s, 'R', 'L')\nB = solve(s[::-1], 'L', 'R')[::-1]\nans = [a+b for a, b in zip(A,B)]\nprint(' '.join(map(str, ans)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581898890", "date2": "1581898935", "bleu_score": "0.9636460392586096", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLRL\n", "actual_output": "[0, 1, 2, 1, 1]\n", "expected_output": "0 1 2 1 1\n", "anno_code": ["s = input() # (0): s=RRLRL\nn = len(s) # (1): n=5\n\ndef solve(s, c1, c2): # (2): solve=\n res = [0] * (n) # (4): res=[0, 0, 0, 0, 0] (38): res=[0, 0, 0, 0, 0]\n odd = 0 # (5): odd=0 (39): odd=0\n even = 0 # (6): even=0 (40): even=0\n for i in range(n): # (7): i=0 (12): i=1 ... (72): s=RRLRL, n=5, solve=, A=[0, 1, 1, 1, 0], B=[0, 0, 1, 0, 1]\n if s[i] == c1: # (8): NO CHANGE (13): NO CHANGE ... (66): NO CHANGE\n if i % 2 == 1: # (9): NO CHANGE (14): NO CHANGE ... (55): NO CHANGE\n odd += 1 # (15): odd=1 (27): odd=1\n else:\n even += 1 # (10): even=1 (44): even=1 (56): even=1\n if s[i] == c2: # (11): NO CHANGE (16): NO CHANGE ... (67): NO CHANGE\n if i % 2 == 1: # (20): NO CHANGE (32): NO CHANGE ... (68): NO CHANGE\n res[i] += odd # (50): NO CHANGE (62): NO CHANGE\n res[i-1] += even # (51): res=[1, 0, 0, 0, 0] (63): res=[1, 0, 1, 0, 0]\n else:\n res[i] += even # (21): res=[0, 0, 1, 0, 0] (33): NO CHANGE (69): NO CHANGE\n res[i-1] += odd # (22): res=[0, 1, 1, 0, 0] (34): res=[0, 1, 1, 1, 0] (70): NO CHANGE\n odd, even = 0, 0 # (23): odd=0, even=0 (35): odd=0 ... (71): NO CHANGE\n return res\n\nA = solve(s, 'R', 'L') # (3): c1=R, c2=L\nB = solve(s[::-1], 'L', 'R')[::-1] # (37): s=LRLRR, c1=L, c2=R\nans = [a+b for a, b in zip(A,B)] # (73): ans=[0, 1, 2, 1, 1]\nprint(ans)"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n \n def solve(s, c1, c2):\n res = [0] * (n)\n odd = 0\n even = 0\n for i in range(n):\n if s[i] == c1:\n if i % 2 == 1:\n odd += 1\n else:\n even += 1\n if s[i] == c2:\n if i % 2 == 1:\n res[i] += odd\n res[i-1] += even\n else:\n res[i] += even\n res[i-1] += odd\n odd, even = 0, 0\n return res\n \n A = solve(s, 'R', 'L')\n B = solve(s[::-1], 'L', 'R')[::-1]\n ans = [a+b for a, b in zip(A,B)]\n-print(ans)\n+print(' '.join(map(str, ans)))\n", "FL_content": " s = input()\n n = len(s)\n \n def solve(s, c1, c2):\n res = [0] * (n)\n odd = 0\n even = 0\n for i in range(n):\n if s[i] == c1:\n if i % 2 == 1:\n odd += 1\n else:\n even += 1\n if s[i] == c2:\n if i % 2 == 1:\n res[i] += odd\n res[i-1] += even\n else:\n res[i] += even\n res[i-1] += odd\n odd, even = 0, 0\n return res\n \n A = solve(s, 'R', 'L')\n B = solve(s[::-1], 'L', 'R')[::-1]\n ans = [a+b for a, b in zip(A,B)]\n-print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u911537358", "problem_id": "p02954", "submission1_id": "s958250947", "submission2_id": "s714646046", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\nclass DGatheringChildren:\n def solve(self):\n s = input()\n n = len(s)\n i = 0\n last = 0\n ans = [0] * n\n while i < n - 1:\n if s[i] == 'R' and s[i + 1] == 'L':\n ans[i + 1] += 1\n for j in range(last, i + 1):\n if (i - j) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k = i + 2\n while k < n and s[k] == 'L':\n if (k - i) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k += 1\n\n last = k\n i += 1\n\n i += 1\n\n print(*ans)\n\nsolver = DGatheringChildren()\ninput = sys.stdin.readline\n\nsolver.solve()\n", "code2": "\n\nimport sys\n\nclass DGatheringChildren:\n def solve(self):\n s = input().strip()\n n = len(s)\n i = 0\n last = 0\n ans = [0] * n\n while i < n - 1:\n if s[i] == 'R' and s[i + 1] == 'L':\n ans[i + 1] += 1\n for j in range(last, i + 1):\n if (i - j) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k = i + 2\n while k < n and s[k] == 'L':\n if (k - i) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k += 1\n\n last = k\n i += 1\n\n i += 1\n\n print(*ans)\n\nsolver = DGatheringChildren()\ninput = sys.stdin.readline\n\nsolver.solve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564968185", "date2": "1564968376", "bleu_score": "0.9903783478683981", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRRLLRRLLLLLLRRL\n", "actual_output": "0 0 3 2 0 0 4 4 0 0 0 0 0 0 1 2 0\n", "expected_output": "0 0 3 2 0 0 4 4 0 0 0 0 0 0 1 2\n\n", "anno_code": ["\n\nimport sys\n\nclass DGatheringChildren: # (0): DGatheringChildren=\n def solve(self):\n s = input() # (4): s=RRRLLRRLLLLLLRRL \n n = len(s) # (5): n=17\n i = 0 # (6): i=0\n last = 0 # (7): last=0\n ans = [0] * n # (8): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n while i < n - 1: # (9): NO CHANGE (12): NO CHANGE ... (111): NO CHANGE\n if s[i] == 'R' and s[i + 1] == 'L': # (10): NO CHANGE (13): NO CHANGE ... (97): NO CHANGE\n ans[i + 1] += 1 # (17): ans=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (45): ans=[0, 0, 3, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] (98): ans=[0, 0, 3, 2, 0, 0, 4, 4, 0, 0, 0, 0, 0, 0, 0, 1, 0]\n for j in range(last, i + 1): # (18): j=0 (21): j=1 ... (105): NO CHANGE\n if (i - j) % 2 == 0: # (19): NO CHANGE (22): NO CHANGE ... (103): NO CHANGE\n ans[i] += 1 # (20): ans=[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (26): ans=[0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (104): ans=[0, 0, 3, 2, 0, 0, 4, 4, 0, 0, 0, 0, 0, 0, 1, 2, 0]\n else:\n ans[i + 1] += 1 # (23): ans=[0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (48): ans=[0, 0, 3, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0] (101): ans=[0, 0, 3, 2, 0, 0, 4, 4, 0, 0, 0, 0, 0, 0, 0, 2, 0]\n k = i + 2 # (28): k=4 (53): k=8 (106): k=16\n while k < n and s[k] == 'L': # (29): NO CHANGE (33): NO CHANGE ... (107): NO CHANGE\n if (k - i) % 2 == 0: # (30): NO CHANGE (55): NO CHANGE ... (71): NO CHANGE\n ans[i] += 1 # (31): ans=[0, 0, 3, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (56): ans=[0, 0, 3, 2, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (72): ans=[0, 0, 3, 2, 0, 0, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n else:\n ans[i + 1] += 1 # (60): ans=[0, 0, 3, 2, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0] (68): ans=[0, 0, 3, 2, 0, 0, 3, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n k += 1 # (32): k=5 (57): k=9 ... (73): k=13\n\n last = k # (34): last=5 (75): last=13 (108): last=16\n i += 1 # (35): i=3 (76): i=7 (109): i=15\n\n i += 1 # (11): i=1 (14): i=2 ... (110): i=16\n\n print(*ans)\n\nsolver = DGatheringChildren() # (1): solver=\ninput = sys.stdin.readline # (2): input=\n\nsolver.solve() # (3): self=\n"], "anno_status": [false], "diff_content": " \n \n import sys\n \n class DGatheringChildren:\n def solve(self):\n- s = input()\n+ s = input().strip()\n n = len(s)\n i = 0\n last = 0\n ans = [0] * n\n while i < n - 1:\n if s[i] == 'R' and s[i + 1] == 'L':\n ans[i + 1] += 1\n for j in range(last, i + 1):\n if (i - j) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k = i + 2\n while k < n and s[k] == 'L':\n if (k - i) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k += 1\n \n last = k\n i += 1\n \n i += 1\n \n print(*ans)\n \n solver = DGatheringChildren()\n input = sys.stdin.readline\n \n solver.solve()\n \n", "FL_content": " \n \n import sys\n \n class DGatheringChildren:\n def solve(self):\n- s = input()\n n = len(s)\n i = 0\n last = 0\n ans = [0] * n\n while i < n - 1:\n if s[i] == 'R' and s[i + 1] == 'L':\n ans[i + 1] += 1\n for j in range(last, i + 1):\n if (i - j) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k = i + 2\n while k < n and s[k] == 'L':\n if (k - i) % 2 == 0:\n ans[i] += 1\n else:\n ans[i + 1] += 1\n k += 1\n \n last = k\n i += 1\n \n i += 1\n \n print(*ans)\n \n solver = DGatheringChildren()\n input = sys.stdin.readline\n \n solver.solve()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 39 }, { "user_id": "u531599639", "problem_id": "p02954", "submission1_id": "s779665395", "submission2_id": "s397035783", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\ntemp = s[0]\ngroup = []\nans = [0]*n\nsec = [temp]\nrlind = []\nfor i in range(1,n):\n if temp=='L' and s[i]=='R':\n group.append(sec)\n sec = []\n elif temp=='R' and s[i]=='L':\n rlind.append(i)\n sec.append(s[i])\n temp = s[i]\ngroup.append(sec)\n\nfor i in range(len(group)):\n ind = rlind[i]\n m = len(group[i])\n if m%2==0:\n p = m\n ans[ind]=p\n ans[ind-1]=p\n else:\n p = group[i].count('R')\n q = max(p,m-p)\n if (q-1)%2==0:\n ans[ind]=m-p\n ans[ind-1]=p\n else:\n ans[ind]=p\n ans[ind-1]=m-p\nprint(*ans)", "code2": "s = input()\nn = len(s)\ntemp = s[0]\ngrp = []\nans = [0]*n\nsec = [temp]\nrlind = []\nfor i in range(1,n):\n if temp=='L' and s[i]=='R':\n grp.append(sec)\n sec = []\n elif temp=='R' and s[i]=='L':\n rlind.append(i)\n sec.append(s[i])\n temp = s[i]\ngrp.append(sec)\n\nfor i in range(len(grp)):\n ind = rlind[i]\n m = len(grp[i])\n if m%2==0:\n p = m\n ans[ind]=p\n ans[ind-1]=p\n else:\n p = grp[i].count('R')\n q = max(p,m-p)\n if p==q:\n p = -(-m\n else:\n p = m\n if (q-1)%2==0:\n ans[ind]=m-p\n ans[ind-1]=p\n else:\n ans[ind]=p\n ans[ind-1]=m-p\nprint(*ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593837353", "date2": "1593838278", "bleu_score": "0.9014916973587994", "code1_test_status": [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, 1, 0, 0, 0, 0, 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], "code1_test_score": 5, "total_score": 103, "input": "RRLLLLRLLRRL\n", "actual_output": "0 6 6 0 0 0 2 1 0 0 1 2\n", "expected_output": "0 3 3 0 0 0 2 1 0 0 1 2\n\n", "anno_code": ["s = input() # (0): s=RRLLLLRLLRRL\nn = len(s) # (1): n=12\ntemp = s[0] # (2): temp=R\ngroup = [] # (3): group=[]\nans = [0]*n # (4): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nsec = [temp] # (5): sec=['R']\nrlind = [] # (6): rlind=[]\nfor i in range(1,n): # (7): i=1 (12): i=2 ... (67): group\n if temp=='L' and s[i]=='R': # (8): NO CHANGE (13): NO CHANGE ... (62): group\n group.append(sec) # (35): group (52): group\n sec = [] # (36): sec=[] (53): group, sec=[]\n elif temp=='R' and s[i]=='L': # (9): NO CHANGE (14): NO CHANGE ... (63): group\n rlind.append(i) # (15): rlind=[2] (42): rlind=[2, 7] (64): group, rlind=[2, 7, 11]\n sec.append(s[i]) # (10): sec=['R', 'R'] (16): sec=['R', 'R', 'L'] ... (65): group, sec=['R', 'R', 'L']\n temp = s[i] # (11): NO CHANGE (17): temp=L ... (66): temp=L, group\ngroup.append(sec) # (68): group\n\nfor i in range(len(group)): # (69): group, i=0 (76): group, i=1 ... (94): group\n ind = rlind[i] # (70): group, ind=2 (77): group, ind=7 (86): group, ind=11\n m = len(group[i]) # (71): group, m=6 (78): group, m=3 (87): group\n if m%2==0: # (72): group (79): group (88): group\n p = m # (73): group, p=6\n ans[ind]=p # (74): group, ans=[0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n ans[ind-1]=p # (75): group, ans=[0, 6, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n else:\n p = group[i].count('R') # (80): group, p=1 (89): group, p=2\n q = max(p,m-p) # (81): group, q=2 (90): group\n if (q-1)%2==0: # (82): group (91): group\n ans[ind]=m-p\n ans[ind-1]=p\n else:\n ans[ind]=p # (83): group, ans=[0, 6, 6, 0, 0, 0, 0, 1, 0, 0, 0, 0] (92): group, ans=[0, 6, 6, 0, 0, 0, 2, 1, 0, 0, 0, 2]\n ans[ind-1]=m-p # (84): group, ans=[0, 6, 6, 0, 0, 0, 2, 1, 0, 0, 0, 0] (93): group, ans=[0, 6, 6, 0, 0, 0, 2, 1, 0, 0, 1, 2]\nprint(*ans)"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n temp = s[0]\n-group = []\n+grp = []\n ans = [0]*n\n sec = [temp]\n rlind = []\n for i in range(1,n):\n if temp=='L' and s[i]=='R':\n- group.append(sec)\n+ grp.append(sec)\n sec = []\n elif temp=='R' and s[i]=='L':\n rlind.append(i)\n sec.append(s[i])\n temp = s[i]\n-group.append(sec)\n+grp.append(sec)\n \n-for i in range(len(group)):\n+for i in range(len(grp)):\n ind = rlind[i]\n- m = len(group[i])\n+ m = len(grp[i])\n if m%2==0:\n p = m\n ans[ind]=p\n ans[ind-1]=p\n else:\n- p = group[i].count('R')\n+ p = grp[i].count('R')\n q = max(p,m-p)\n+ if p==q:\n+ p = -(-m\n+ else:\n+ p = m\n if (q-1)%2==0:\n ans[ind]=m-p\n ans[ind-1]=p\n else:\n ans[ind]=p\n ans[ind-1]=m-p\n print(*ans)\n", "FL_content": " s = input()\n n = len(s)\n temp = s[0]\n-group = []\n ans = [0]*n\n sec = [temp]\n rlind = []\n for i in range(1,n):\n if temp=='L' and s[i]=='R':\n- group.append(sec)\n sec = []\n elif temp=='R' and s[i]=='L':\n rlind.append(i)\n sec.append(s[i])\n temp = s[i]\n-group.append(sec)\n \n-for i in range(len(group)):\n ind = rlind[i]\n- m = len(group[i])\n if m%2==0:\n p = m\n ans[ind]=p\n ans[ind-1]=p\n else:\n- p = group[i].count('R')\n q = max(p,m-p)\n if (q-1)%2==0:\n ans[ind]=m-p\n ans[ind-1]=p\n else:\n ans[ind]=p\n ans[ind-1]=m-p\n print(*ans)\n", "added_lines": 10, "removed_lines": 6, "code1_lines": 34 }, { "user_id": "u861020408", "problem_id": "p02954", "submission1_id": "s076031332", "submission2_id": "s502801442", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input() + 'O'\nN = len(S)\nn = [0] * (N - 1)\nt = []\ni = 0\nj = 0\nwhile S[i] != 'O':\n count = 0\n if S[i] == 'R':\n while S[i] == 'R':\n count += 1\n i += 1\n elif S[i] == 'L':\n while S[i] == 'L':\n count += 1\n i += 1\n t.append(count)\nT = int(len(t)/2) \nfor i in range(T):\n j += t[2*i]\n if t[2*i] % 2 == 0:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n elif t[2*i + 1] % 2 == 1:\n n[j - 1] = t[2*i + 1]\n n[j] = t[2*i]\n elif t[2*i] % 2 == 1:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1] + 1)/2)\n n[j] = n[j - 1] - 1\n elif t[2*i + 1] % 2 == 1:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n j += t[2*i+1]\nprint(' '.join(map(str, n)))\n", "code2": "S = input() + 'O'\nN = len(S)\nn = [0] * (N - 1)\nt = []\ni = 0\nj = 0\nwhile S[i] != 'O':\n count = 0\n if S[i] == 'R':\n while S[i] == 'R':\n count += 1\n i += 1\n elif S[i] == 'L':\n while S[i] == 'L':\n count += 1\n i += 1\n t.append(count)\nT = int(len(t)/2) \nfor i in range(T):\n j += t[2*i]\n if t[2*i] % 2 == 0:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n elif t[2*i + 1] % 2 == 1:\n n[j - 1] = int((t[2*i] + t[2*i + 1] - 1)/2)\n n[j] = n[j - 1] + 1\n elif t[2*i] % 2 == 1:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1] + 1)/2)\n n[j] = n[j - 1] - 1\n elif t[2*i + 1] % 2 == 1:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n j += t[2*i+1]\nprint(' '.join(map(str, n)))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572648579", "date2": "1572648724", "bleu_score": "0.963783353785106", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 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, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 76, "total_score": 103, "input": "RRLLLRRLRLLL\n", "actual_output": "0 3 2 0 0 0 1 2 2 2 0 0\n", "expected_output": "0 2 3 0 0 0 1 2 2 2 0 0\n\n", "anno_code": ["S = input() + 'O' # (0): S=RRLLLRRLRLLLO\nN = len(S) # (1): N=13\nn = [0] * (N - 1) # (2): n=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nt = [] # (3): t=[]\ni = 0 # (4): i=0\nj = 0 # (5): j=0\nwhile S[i] != 'O': # (6): NO CHANGE (17): NO CHANGE ... (75): NO CHANGE\n count = 0 # (7): count=0 (18): count=0 ... (61): count=0\n if S[i] == 'R': # (8): NO CHANGE (19): NO CHANGE ... (62): NO CHANGE\n while S[i] == 'R': # (9): NO CHANGE (12): NO CHANGE ... (58): NO CHANGE\n count += 1 # (10): count=1 (13): count=2 ... (56): count=1\n i += 1 # (11): i=1 (14): i=2 ... (57): i=9\n elif S[i] == 'L': # (20): NO CHANGE (46): NO CHANGE (63): NO CHANGE\n while S[i] == 'L': # (21): NO CHANGE (24): NO CHANGE ... (73): NO CHANGE\n count += 1 # (22): count=1 (25): count=2 ... (71): count=3\n i += 1 # (23): i=3 (26): i=4 ... (72): i=12\n t.append(count) # (16): t=[2] (31): t=[2, 3] ... (74): t=[2, 3, 2, 1, 1, 3]\nT = int(len(t)/2) # (76): T=3\nfor i in range(T): # (77): i=0 (85): i=1 ... (102): NO CHANGE\n j += t[2*i] # (78): j=2 (86): j=7 (94): j=9\n if t[2*i] % 2 == 0: # (79): NO CHANGE (87): NO CHANGE (95): NO CHANGE\n if t[2*i + 1] % 2 == 0: # (80): NO CHANGE (88): NO CHANGE\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n elif t[2*i + 1] % 2 == 1: # (81): NO CHANGE (89): NO CHANGE\n n[j - 1] = t[2*i + 1] # (82): n=[0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (90): n=[0, 3, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0]\n n[j] = t[2*i] # (83): n=[0, 3, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0] (91): n=[0, 3, 2, 0, 0, 0, 1, 2, 0, 0, 0, 0]\n elif t[2*i] % 2 == 1: # (96): NO CHANGE\n if t[2*i + 1] % 2 == 0: # (97): NO CHANGE\n n[j - 1] = int((t[2*i] + t[2*i + 1] + 1)/2)\n n[j] = n[j - 1] - 1\n elif t[2*i + 1] % 2 == 1: # (98): NO CHANGE\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2) # (99): n=[0, 3, 2, 0, 0, 0, 1, 2, 2, 0, 0, 0]\n n[j] = n[j - 1] # (100): n=[0, 3, 2, 0, 0, 0, 1, 2, 2, 2, 0, 0]\n j += t[2*i+1] # (84): j=5 (92): j=8 (101): j=12\nprint(' '.join(map(str, n)))\n"], "anno_status": [false], "diff_content": " S = input() + 'O'\n N = len(S)\n n = [0] * (N - 1)\n t = []\n i = 0\n j = 0\n while S[i] != 'O':\n count = 0\n if S[i] == 'R':\n while S[i] == 'R':\n count += 1\n i += 1\n elif S[i] == 'L':\n while S[i] == 'L':\n count += 1\n i += 1\n t.append(count)\n T = int(len(t)/2) \n for i in range(T):\n j += t[2*i]\n if t[2*i] % 2 == 0:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n elif t[2*i + 1] % 2 == 1:\n- n[j - 1] = t[2*i + 1]\n- n[j] = t[2*i]\n+ n[j - 1] = int((t[2*i] + t[2*i + 1] - 1)/2)\n+ n[j] = n[j - 1] + 1\n elif t[2*i] % 2 == 1:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1] + 1)/2)\n n[j] = n[j - 1] - 1\n elif t[2*i + 1] % 2 == 1:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n j += t[2*i+1]\n print(' '.join(map(str, n)))\n \n", "FL_content": " S = input() + 'O'\n N = len(S)\n n = [0] * (N - 1)\n t = []\n i = 0\n j = 0\n while S[i] != 'O':\n count = 0\n if S[i] == 'R':\n while S[i] == 'R':\n count += 1\n i += 1\n elif S[i] == 'L':\n while S[i] == 'L':\n count += 1\n i += 1\n t.append(count)\n T = int(len(t)/2) \n for i in range(T):\n j += t[2*i]\n if t[2*i] % 2 == 0:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n elif t[2*i + 1] % 2 == 1:\n- n[j - 1] = t[2*i + 1]\n- n[j] = t[2*i]\n elif t[2*i] % 2 == 1:\n if t[2*i + 1] % 2 == 0:\n n[j - 1] = int((t[2*i] + t[2*i + 1] + 1)/2)\n n[j] = n[j - 1] - 1\n elif t[2*i + 1] % 2 == 1:\n n[j - 1] = int((t[2*i] + t[2*i + 1])/2)\n n[j] = n[j - 1]\n j += t[2*i+1]\n print(' '.join(map(str, n)))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 37 }, { "user_id": "u846226907", "problem_id": "p02954", "submission1_id": "s794442504", "submission2_id": "s940795099", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = list(input())\nprint(S)\n\nN = len(S)\n\nans = [0]*N\n\nfor _ in range(2):\n cnt = 0\n for i in range(len(S)):\n if S[i] =='R':cnt +=1\n else:\n ans[i] += int(cnt/2)\n ans[i-1] += int((cnt+1)/2)\n cnt = 0\n\n S.reverse()\n ans.reverse()\n for i in range(len(S)):\n if S[i] == 'L':\n S[i] ='R'\n else:\n S[i] = 'L'\n\nprint(*ans)", "code2": "S = list(input())\n\nN = len(S)\n\nans = [0]*N\n\nfor _ in range(2):\n cnt = 0\n for i in range(len(S)):\n if S[i] =='R':cnt +=1\n else:\n ans[i] += int(cnt/2)\n ans[i-1] += int((cnt+1)/2)\n cnt = 0\n\n S.reverse()\n ans.reverse()\n for i in range(len(S)):\n if S[i] == 'L':\n S[i] ='R'\n else:\n S[i] = 'L'\n\nprint(*ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589331843", "date2": "1589332151", "bleu_score": "0.9770213454477236", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRRLLLRLLRRLLLRL\n", "actual_output": "['R', 'R', 'R', 'L', 'L', 'L', 'R', 'L', 'L', 'R', 'R', 'L', 'L', 'L', 'R', 'L']\n0 0 3 3 0 0 2 1 0 0 2 3 0 0 1 1\n", "expected_output": "0 0 3 3 0 0 2 1 0 0 2 3 0 0 1 1\n\n", "anno_code": ["S = list(input()) # (0): S=['R', 'R', 'R', 'L', 'L', 'L', 'R', 'L', 'L', 'R', 'R', 'L', 'L', 'L', 'R', 'L']\nprint(S) # (1): NO CHANGE\n\nN = len(S) # (2): N=16\n\nans = [0]*N # (3): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor _ in range(2): # (4): _=0 (117): _=1 (224): NO CHANGE\n cnt = 0 # (5): cnt=0 (118): NO CHANGE\n for i in range(len(S)): # (6): i=0 (8): i=1 ... (172): NO CHANGE\n if S[i] =='R':cnt +=1 # (7): cnt=1 (9): cnt=2 ... (168): NO CHANGE\n else:\n ans[i] += int(cnt/2) # (14): ans=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (19): NO CHANGE ... (169): NO CHANGE\n ans[i-1] += int((cnt+1)/2) # (15): ans=[0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (20): NO CHANGE ... (170): NO CHANGE\n cnt = 0 # (16): cnt=0 (21): NO CHANGE ... (171): NO CHANGE\n\n S.reverse() # (66): S=['L', 'R', 'L', 'L', 'L', 'R', 'R', 'L', 'L', 'R', 'L', 'L', 'L', 'R', 'R', 'R'] (173): S=['L', 'L', 'L', 'R', 'R', 'R', 'L', 'R', 'R', 'L', 'L', 'R', 'R', 'R', 'L', 'R']\n ans.reverse() # (67): ans=[0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0] (174): ans=[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 2, 3, 0, 0, 1, 1]\n for i in range(len(S)): # (68): i=0 (71): i=1 ... (223): NO CHANGE\n if S[i] == 'L': # (69): NO CHANGE (72): NO CHANGE ... (221): NO CHANGE\n S[i] ='R' # (70): S=['R', 'R', 'L', 'L', 'L', 'R', 'R', 'L', 'L', 'R', 'L', 'L', 'L', 'R', 'R', 'R'] (76): S=['R', 'L', 'R', 'L', 'L', 'R', 'R', 'L', 'L', 'R', 'L', 'L', 'L', 'R', 'R', 'R'] ... (219): S=['R', 'R', 'R', 'L', 'L', 'L', 'R', 'L', 'L', 'R', 'R', 'L', 'L', 'L', 'R', 'R']\n else:\n S[i] = 'L' # (73): S=['R', 'L', 'L', 'L', 'L', 'R', 'R', 'L', 'L', 'R', 'L', 'L', 'L', 'R', 'R', 'R'] (85): S=['R', 'L', 'R', 'R', 'R', 'L', 'R', 'L', 'L', 'R', 'L', 'L', 'L', 'R', 'R', 'R'] ... (222): S=['R', 'R', 'R', 'L', 'L', 'L', 'R', 'L', 'L', 'R', 'R', 'L', 'L', 'L', 'R', 'L']\n\nprint(*ans)"], "anno_status": [true], "diff_content": " S = list(input())\n-print(S)\n \n N = len(S)\n \n ans = [0]*N\n \n for _ in range(2):\n cnt = 0\n for i in range(len(S)):\n if S[i] =='R':cnt +=1\n else:\n ans[i] += int(cnt/2)\n ans[i-1] += int((cnt+1)/2)\n cnt = 0\n \n S.reverse()\n ans.reverse()\n for i in range(len(S)):\n if S[i] == 'L':\n S[i] ='R'\n else:\n S[i] = 'L'\n \n print(*ans)\n", "FL_content": " S = list(input())\n-print(S)\n \n N = len(S)\n \n ans = [0]*N\n \n for _ in range(2):\n cnt = 0\n for i in range(len(S)):\n if S[i] =='R':cnt +=1\n else:\n ans[i] += int(cnt/2)\n ans[i-1] += int((cnt+1)/2)\n cnt = 0\n \n S.reverse()\n ans.reverse()\n for i in range(len(S)):\n if S[i] == 'L':\n S[i] ='R'\n else:\n S[i] = 'L'\n \n print(*ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u035901835", "problem_id": "p02954", "submission1_id": "s597225914", "submission2_id": "s514282280", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\n\nnum={}\nfor i in range(len(S)):\n num[i]=0\n\nfor i in range(len(S)):\n if S[i]=='L' and S[i-1]=='R':\n j=1\n count=1\n while(1):\n if i-j<0:\n break\n if S[i-j]=='R':\n if j%2==0:\n count+=1\n else:\n break\n j+=1\n num[i]=count\n\nfor i in range(len(S)):\n if S[i]=='R' and S[i+1]=='L':\n j=1\n count=1\n while(1):\n if i+j>len(S)-1:\n break\n if S[i+j]=='L':\n if j%2==0:\n count+=1\n else:\n break\n j+=1\n num[i]=count\n\n\nfor i in range(len(S)):\n print(num[i],end=' ')\n\nprint('')", "code2": "S=input()\n\nnum={}\nfor i in range(len(S)):\n num[i]=0\n\nfor i in range(1,len(S)):\n even=1\n odd=1\n if S[i]=='L' and S[i-1]=='R':\n\n j=1\n while(1):\n if i+j>(len(S)-1):\n break\n if S[i+j]=='L':\n if j%2==1:\n odd+=1\n else:\n even+=1\n else:\n break\n j+=1\n \n j=1\n while(1):\n if i-1-j<0:\n break\n if S[i-1-j]=='R':\n if j%2==1:\n even+=1\n else:\n odd+=1\n else:\n break\n j+=1\n\n num[i]=even\n num[i-1]=odd\n\nfor i in range(len(S)):\n print(num[i],end=' ')\nprint('')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588643015", "date2": "1588644628", "bleu_score": "0.8215773903901443", "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, 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, 1, 0, 0, 0, 0, 1, 0], "code1_test_score": 6, "total_score": 103, "input": "RRRLLRLLLRRLLRLL\n", "actual_output": "0 0 2 2 0 2 1 0 0 0 2 2 0 2 1 0 \n", "expected_output": "0 0 3 2 0 2 2 0 0 0 2 2 0 2 1 0\n\n", "anno_code": ["S=input() # (0): S=RRRLLRLLLRRLLRLL\n\nnum={} # (1): num={}\nfor i in range(len(S)): # (2): i=0 (4): i=1 ... (34): NO CHANGE\n num[i]=0 # (3): num={0: 0} (5): num={0: 0, 1: 0} ... (33): num={0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0, 10: 0, 11: 0, 12: 0, 13: 0, 14: 0, 15: 0}\n\nfor i in range(len(S)): # (35): i=0 (37): i=1 ... (131): NO CHANGE\n if S[i]=='L' and S[i-1]=='R': # (36): NO CHANGE (38): NO CHANGE ... (130): NO CHANGE\n j=1 # (43): j=1 (71): j=1 ... (117): j=1\n count=1 # (44): count=1 (72): count=1 ... (118): count=1\n while(1): # (45): NO CHANGE (50): NO CHANGE ... (124): NO CHANGE\n if i-j<0: # (46): NO CHANGE (51): NO CHANGE ... (125): NO CHANGE\n break # (63): NO CHANGE\n if S[i-j]=='R': # (47): NO CHANGE (52): NO CHANGE ... (126): NO CHANGE\n if j%2==0: # (48): NO CHANGE (53): NO CHANGE ... (122): NO CHANGE\n count+=1 # (54): count=2 (104): count=2\n else:\n break # (81): NO CHANGE (109): NO CHANGE (127): NO CHANGE\n j+=1 # (49): j=2 (55): j=3 ... (123): j=2\n num[i]=count # (64): num={0: 0, 1: 0, 2: 0, 3: 2, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0, 10: 0, 11: 0, 12: 0, 13: 0, 14: 0, 15: 0} (82): num={0: 0, 1: 0, 2: 0, 3: 2, 4: 0, 5: 0, 6: 1, 7: 0, 8: 0, 9: 0, 10: 0, 11: 0, 12: 0, 13: 0, 14: 0, 15: 0} ... (128): num={0: 0, 1: 0, 2: 0, 3: 2, 4: 0, 5: 0, 6: 1, 7: 0, 8: 0, 9: 0, 10: 0, 11: 2, 12: 0, 13: 0, 14: 1, 15: 0}\n\nfor i in range(len(S)): # (132): i=0 (134): i=1 ... (240): NO CHANGE\n if S[i]=='R' and S[i+1]=='L': # (133): NO CHANGE (135): NO CHANGE ... (239): NO CHANGE\n j=1 # (138): j=1 (162): j=1 ... (219): j=1\n count=1 # (139): NO CHANGE (163): count=1 ... (220): count=1\n while(1): # (140): NO CHANGE (145): NO CHANGE ... (232): NO CHANGE\n if i+j>len(S)-1: # (141): NO CHANGE (146): NO CHANGE ... (233): NO CHANGE\n break # (234): NO CHANGE\n if S[i+j]=='L': # (142): NO CHANGE (147): NO CHANGE ... (228): NO CHANGE\n if j%2==0: # (143): NO CHANGE (148): NO CHANGE ... (229): NO CHANGE\n count+=1 # (149): count=2 (173): count=2 ... (230): count=2\n else:\n break # (154): NO CHANGE (183): NO CHANGE (211): NO CHANGE\n j+=1 # (144): j=2 (150): j=3 ... (231): j=3\n num[i]=count # (155): num={0: 0, 1: 0, 2: 2, 3: 2, 4: 0, 5: 0, 6: 1, 7: 0, 8: 0, 9: 0, 10: 0, 11: 2, 12: 0, 13: 0, 14: 1, 15: 0} (184): num={0: 0, 1: 0, 2: 2, 3: 2, 4: 0, 5: 2, 6: 1, 7: 0, 8: 0, 9: 0, 10: 0, 11: 2, 12: 0, 13: 0, 14: 1, 15: 0} ... (235): num={0: 0, 1: 0, 2: 2, 3: 2, 4: 0, 5: 2, 6: 1, 7: 0, 8: 0, 9: 0, 10: 2, 11: 2, 12: 0, 13: 2, 14: 1, 15: 0}\n\n\nfor i in range(len(S)): # (241): i=0 (243): i=1 ... (273): NO CHANGE\n print(num[i],end=' ') # (242): NO CHANGE (244): NO CHANGE ... (272): NO CHANGE\n\nprint('')"], "anno_status": [false], "diff_content": " S=input()\n \n num={}\n for i in range(len(S)):\n num[i]=0\n \n-for i in range(len(S)):\n+for i in range(1,len(S)):\n+ even=1\n+ odd=1\n if S[i]=='L' and S[i-1]=='R':\n+\n j=1\n- count=1\n while(1):\n- if i-j<0:\n+ if i+j>(len(S)-1):\n break\n- if S[i-j]=='R':\n- if j%2==0:\n- count+=1\n+ if S[i+j]=='L':\n+ if j%2==1:\n+ odd+=1\n+ else:\n+ even+=1\n else:\n break\n j+=1\n- num[i]=count\n-\n-for i in range(len(S)):\n- if S[i]=='R' and S[i+1]=='L':\n+ \n j=1\n- count=1\n while(1):\n- if i+j>len(S)-1:\n+ if i-1-j<0:\n break\n- if S[i+j]=='L':\n- if j%2==0:\n- count+=1\n+ if S[i-1-j]=='R':\n+ if j%2==1:\n+ even+=1\n+ else:\n+ odd+=1\n else:\n break\n j+=1\n- num[i]=count\n \n+ num[i]=even\n+ num[i-1]=odd\n \n for i in range(len(S)):\n print(num[i],end=' ')\n-\n print('')\n", "FL_content": " S=input()\n \n num={}\n for i in range(len(S)):\n num[i]=0\n \n-for i in range(len(S)):\n if S[i]=='L' and S[i-1]=='R':\n j=1\n- count=1\n while(1):\n- if i-j<0:\n break\n- if S[i-j]=='R':\n- if j%2==0:\n- count+=1\n else:\n break\n j+=1\n- num[i]=count\n-\n-for i in range(len(S)):\n- if S[i]=='R' and S[i+1]=='L':\n j=1\n- count=1\n while(1):\n- if i+j>len(S)-1:\n break\n- if S[i+j]=='L':\n- if j%2==0:\n- count+=1\n else:\n break\n j+=1\n- num[i]=count\n \n \n for i in range(len(S)):\n print(num[i],end=' ')\n-\n print('')\n", "added_lines": 19, "removed_lines": 17, "code1_lines": 41 }, { "user_id": "u625046108", "problem_id": "p02954", "submission1_id": "s555081292", "submission2_id": "s579065438", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nS = input()\n\nl = [0]\nans = [0]*len(S)\n\ntmp = \"R\"\nfor i in range(len(S)):\n if tmp != S[i]:\n l.append(i)\n tmp = S[i]\n\nl.append(len(S))\n\nfor i in range(1, len(l), 2):\n ans[l[i]-1] = math.ceil((l[i]-l[i-1])/2) + math.floor((l[i+1]-l[i])/2)\n ans[l[i]] = math.floor((l[i]-l[i-1])/2) + math.ceil((l[i+1]-l[i])/2)\n\nprint(ans)", "code2": "import math\n\nS = input()\n\nl = [0]\nans = [0]*len(S)\n\ntmp = \"R\"\nfor i in range(len(S)):\n if tmp != S[i]:\n l.append(i)\n tmp = S[i]\n\nl.append(len(S))\n\nfor i in range(1, len(l), 2):\n ans[l[i]-1] = math.ceil((l[i]-l[i-1])/2) + math.floor((l[i+1]-l[i])/2)\n ans[l[i]] = math.floor((l[i]-l[i-1])/2) + math.ceil((l[i+1]-l[i])/2)\n\nprint(' '.join(map(str, ans)))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570335893", "date2": "1570336034", "bleu_score": "0.9395053910563741", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLLRLLLRRLLRLRL\n", "actual_output": "[0, 2, 2, 0, 2, 2, 0, 0, 0, 2, 2, 0, 1, 1, 1, 1]\n", "expected_output": "0 2 2 0 2 2 0 0 0 2 2 0 1 1 1 1\n\n", "anno_code": ["import math\n\nS = input() # (0): S=RRLLRLLLRRLLRLRL\n\nl = [0] # (1): l=[0]\nans = [0]*len(S) # (2): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\ntmp = \"R\" # (3): tmp=R\nfor i in range(len(S)): # (4): i=0 (7): i=1 ... (61): NO CHANGE\n if tmp != S[i]: # (5): NO CHANGE (8): NO CHANGE ... (58): NO CHANGE\n l.append(i) # (12): l=[0, 2] (19): l=[0, 2, 4] ... (59): l=[0, 2, 4, 5, 8, 10, 12, 13, 14, 15]\n tmp = S[i] # (6): NO CHANGE (9): NO CHANGE ... (60): tmp=L\n\nl.append(len(S)) # (62): l=[0, 2, 4, 5, 8, 10, 12, 13, 14, 15, 16]\n\nfor i in range(1, len(l), 2): # (63): i=1 (66): i=3 ... (78): NO CHANGE\n ans[l[i]-1] = math.ceil((l[i]-l[i-1])/2) + math.floor((l[i+1]-l[i])/2) # (64): ans=[0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (67): ans=[0, 2, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (76): ans=[0, 2, 2, 0, 2, 2, 0, 0, 0, 2, 2, 0, 1, 1, 1, 0]\n ans[l[i]] = math.floor((l[i]-l[i-1])/2) + math.ceil((l[i+1]-l[i])/2) # (65): ans=[0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (68): ans=[0, 2, 2, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (77): ans=[0, 2, 2, 0, 2, 2, 0, 0, 0, 2, 2, 0, 1, 1, 1, 1]\n\nprint(ans)"], "anno_status": [true], "diff_content": " import math\n \n S = input()\n \n l = [0]\n ans = [0]*len(S)\n \n tmp = \"R\"\n for i in range(len(S)):\n if tmp != S[i]:\n l.append(i)\n tmp = S[i]\n \n l.append(len(S))\n \n for i in range(1, len(l), 2):\n ans[l[i]-1] = math.ceil((l[i]-l[i-1])/2) + math.floor((l[i+1]-l[i])/2)\n ans[l[i]] = math.floor((l[i]-l[i-1])/2) + math.ceil((l[i+1]-l[i])/2)\n \n-print(ans)\n+print(' '.join(map(str, ans)))\n", "FL_content": " import math\n \n S = input()\n \n l = [0]\n ans = [0]*len(S)\n \n tmp = \"R\"\n for i in range(len(S)):\n if tmp != S[i]:\n l.append(i)\n tmp = S[i]\n \n l.append(len(S))\n \n for i in range(1, len(l), 2):\n ans[l[i]-1] = math.ceil((l[i]-l[i-1])/2) + math.floor((l[i+1]-l[i])/2)\n ans[l[i]] = math.floor((l[i]-l[i-1])/2) + math.ceil((l[i+1]-l[i])/2)\n \n-print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u558242240", "problem_id": "p02954", "submission1_id": "s097028769", "submission2_id": "s981547361", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\nrl = 0\nlr = 0\ncount = [0, 0]\nans = [0] * n\nprev = s[0]\nfor i in range(n):\n if s[i] != prev:\n if s[i] == 'L':\n rl = i\n ans[rl - 1] += count[0]\n ans[rl] += count[1]\n count = [0, 0]\n print(ans)\n if s[i] == 'R':\n lr = i\n ans[rl] += count[0]\n ans[rl - 1] += count[1]\n count = [0, 0]\n print(ans)\n if s[i] == 'L':\n count[(i - rl) % 2] += 1\n if s[i] == 'R':\n count[(i - lr) % 2] += 1\n prev = s[i]\n print(count)\nans[rl] += count[0]\nans[rl - 1] += count[1]\n\nprint(ans)\nprint(' '.join(map(lambda x: str(x), ans)))\n\n\n\n\n\n\n", "code2": "s = input()\nn = len(s)\nrl = 0\nlr = 0\ncount = [0, 0]\nans = [0] * n\nprev = s[0]\nfor i in range(n):\n if s[i] != prev:\n if s[i] == 'L':\n rl = i\n ans[rl - 1] += count[0]\n ans[rl] += count[1]\n count = [0, 0]\n \n if s[i] == 'R':\n lr = i\n ans[rl] += count[0]\n ans[rl - 1] += count[1]\n count = [0, 0]\n \n if s[i] == 'L':\n count[(i - rl) % 2] += 1\n if s[i] == 'R':\n count[(i - lr) % 2] += 1\n prev = s[i]\n \nans[rl] += count[0]\nans[rl - 1] += count[1]\n\nprint(' '.join(map(lambda x: str(x), ans)))\n\n\n\n\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583415327", "date2": "1583415365", "bleu_score": "0.9286234498872032", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRRLLLRLLRRLRLLL\n", "actual_output": "[1, 0]\n[1, 1]\n[2, 1]\n[0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[1, 0]\n[1, 1]\n[2, 1]\n[0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[1, 0]\n[0, 0, 3, 3, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[1, 0]\n[1, 1]\n[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0]\n[1, 0]\n[1, 1]\n[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 1, 0, 0, 0, 0]\n[1, 0]\n[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 2, 0, 0, 0, 0]\n[1, 0]\n[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 2, 1, 0, 0, 0]\n[1, 0]\n[1, 1]\n[2, 1]\n[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 2, 2, 2, 0, 0]\n0 0 3 3 0 0 2 1 0 0 1 2 2 2 0 0\n", "expected_output": "0 0 3 3 0 0 2 1 0 0 1 2 2 2 0 0\n\n", "anno_code": ["s = input() # (0): s=RRRLLLRLLRRLRLLL\nn = len(s) # (1): n=16\nrl = 0 # (2): rl=0\nlr = 0 # (3): lr=0\ncount = [0, 0] # (4): count=[0, 0]\nans = [0] * n # (5): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nprev = s[0] # (6): prev=R\nfor i in range(n): # (7): i=0 (14): i=1 ... (168): NO CHANGE\n if s[i] != prev: # (8): NO CHANGE (15): NO CHANGE ... (162): NO CHANGE\n if s[i] == 'L': # (30): NO CHANGE (58): NO CHANGE ... (142): NO CHANGE\n rl = i # (31): rl=3 (73): rl=7 ... (143): rl=13\n ans[rl - 1] += count[0] # (32): ans=[0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (74): ans=[0, 0, 3, 3, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (144): ans=[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 2, 1, 0, 0, 0]\n ans[rl] += count[1] # (33): ans=[0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (75): NO CHANGE ... (145): NO CHANGE\n count = [0, 0] # (34): count=[0, 0] (76): count=[0, 0] ... (146): count=[0, 0]\n print(ans) # (35): NO CHANGE (77): NO CHANGE ... (147): NO CHANGE\n if s[i] == 'R': # (36): NO CHANGE (59): NO CHANGE ... (148): NO CHANGE\n lr = i # (60): lr=6 (95): lr=9 (130): lr=12\n ans[rl] += count[0] # (61): ans=[0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (96): ans=[0, 0, 3, 3, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0] (131): ans=[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 2, 0, 0, 0, 0]\n ans[rl - 1] += count[1] # (62): ans=[0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (97): ans=[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0] (132): NO CHANGE\n count = [0, 0] # (63): count=[0, 0] (98): count=[0, 0] (133): count=[0, 0]\n print(ans) # (64): NO CHANGE (99): NO CHANGE (134): NO CHANGE\n if s[i] == 'L': # (9): NO CHANGE (16): NO CHANGE ... (163): NO CHANGE\n count[(i - rl) % 2] += 1 # (38): count=[1, 0] (45): count=[1, 1] ... (164): count=[2, 1]\n if s[i] == 'R': # (10): NO CHANGE (17): NO CHANGE ... (165): NO CHANGE\n count[(i - lr) % 2] += 1 # (11): count=[1, 0] (18): count=[1, 1] ... (137): count=[1, 0]\n prev = s[i] # (12): NO CHANGE (19): NO CHANGE ... (166): NO CHANGE\n print(count) # (13): NO CHANGE (20): NO CHANGE ... (167): NO CHANGE\nans[rl] += count[0] # (169): ans=[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 2, 1, 2, 0, 0]\nans[rl - 1] += count[1] # (170): ans=[0, 0, 3, 3, 0, 0, 2, 1, 0, 0, 1, 2, 2, 2, 0, 0]\n\nprint(ans) # (171): NO CHANGE\nprint(' '.join(map(lambda x: str(x), ans)))\n\n\n\n\n\n\n"], "anno_status": [false], "diff_content": " s = input()\n n = len(s)\n rl = 0\n lr = 0\n count = [0, 0]\n ans = [0] * n\n prev = s[0]\n for i in range(n):\n if s[i] != prev:\n if s[i] == 'L':\n rl = i\n ans[rl - 1] += count[0]\n ans[rl] += count[1]\n count = [0, 0]\n- print(ans)\n+ \n if s[i] == 'R':\n lr = i\n ans[rl] += count[0]\n ans[rl - 1] += count[1]\n count = [0, 0]\n- print(ans)\n+ \n if s[i] == 'L':\n count[(i - rl) % 2] += 1\n if s[i] == 'R':\n count[(i - lr) % 2] += 1\n prev = s[i]\n- print(count)\n+ \n ans[rl] += count[0]\n ans[rl - 1] += count[1]\n \n-print(ans)\n print(' '.join(map(lambda x: str(x), ans)))\n \n \n \n \n \n \n \n", "FL_content": " s = input()\n n = len(s)\n rl = 0\n lr = 0\n count = [0, 0]\n ans = [0] * n\n prev = s[0]\n for i in range(n):\n if s[i] != prev:\n if s[i] == 'L':\n rl = i\n ans[rl - 1] += count[0]\n ans[rl] += count[1]\n count = [0, 0]\n- print(ans)\n if s[i] == 'R':\n lr = i\n ans[rl] += count[0]\n ans[rl - 1] += count[1]\n count = [0, 0]\n- print(ans)\n if s[i] == 'L':\n count[(i - rl) % 2] += 1\n if s[i] == 'R':\n count[(i - lr) % 2] += 1\n prev = s[i]\n- print(count)\n ans[rl] += count[0]\n ans[rl - 1] += count[1]\n \n-print(ans)\n print(' '.join(map(lambda x: str(x), ans)))\n \n \n \n \n \n \n \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 39 }, { "user_id": "u872887731", "problem_id": "p02954", "submission1_id": "s507614135", "submission2_id": "s951430781", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\na = []\nr_ = 0 \nl_ = 0\nflag = 0\nfor i in range(len(S)):\n if flag == 0:\n if S[i]==\"R\":\n r_ = r_ +1\n continue\n else:\n flag = 1\n l_ = l_ +1\n continue\n if flag == 1:\n if S[i] == \"L\" :\n l_ = l_ +1\n else:\n al = l_ + r_\n a.append([al,r_])\n r_ = 1\n l_ = 0 \n flag = 0\n if i == len(S) -1:\n al = l_ + r_\n a.append([al,r_])\n \n\nans = []\nfor i in range(len(a)):\n n = a[i][0]\n r = a[i][1]\n odd = n \n eve = n - odd\n for j in range(r -1):\n ans.append(0)\n ans.append(eve)\n ans.append(odd)\n for j in range(n -r -1):\n ans.append(0)\nprint(*ans)\n \n ", "code2": "S = input()\na = []\nr_ = 0 \nl_ = 0\nflag = 0\nfor i in range(len(S)):\n if flag == 0:\n if S[i]==\"R\":\n r_ = r_ +1\n continue\n elif i != len(S) -1:\n flag = 1\n l_ = l_ +1\n continue\n else:\n l_ = l_ +1\n al = l_ + r_\n a.append([al,r_])\n continue\n \n if flag == 1:\n if S[i] == \"L\" :\n l_ = l_ +1\n else:\n al = l_ + r_\n a.append([al,r_])\n r_ = 1\n l_ = 0 \n flag = 0\n if i == len(S) -1:\n al = l_ + r_\n a.append([al,r_])\n \n\nans = []\nfor i in range(len(a)):\n n = a[i][0]\n r = a[i][1]\n odd = n \n eve = n - odd\n for j in range(r -1):\n ans.append(0)\n if r \n ans.append(eve)\n ans.append(odd)\n else:\n ans.append(odd)\n ans.append(eve)\n for j in range(n -r -1):\n ans.append(0)\nprint(*ans)\n \n \n\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564971360", "date2": "1564971998", "bleu_score": "0.7764407814725488", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLLLRLRRLRLLLRL\n", "actual_output": "0 0 5 0 0 0 2 0 0 3 0 4 0 0\n", "expected_output": "0 2 3 0 0 1 1 0 1 2 2 2 0 0 1 1\n\n", "anno_code": ["S = input() # (0): S=RRLLLRLRRLRLLLRL\na = [] # (1): a=[]\nr_ = 0 # (2): r_=0\nl_ = 0 # (3): l_=0\nflag = 0 # (4): flag=0\nfor i in range(len(S)): # (5): i=0 (10): i=1 ... (114): NO CHANGE\n if flag == 0: # (6): NO CHANGE (11): NO CHANGE ... (109): NO CHANGE\n if S[i]==\"R\": # (7): NO CHANGE (12): NO CHANGE ... (110): NO CHANGE\n r_ = r_ +1 # (8): r_=1 (13): r_=2 (62): r_=2\n continue # (9): NO CHANGE (14): NO CHANGE (63): NO CHANGE\n else:\n flag = 1 # (18): flag=1 (46): flag=1 ... (111): flag=1\n l_ = l_ +1 # (19): l_=1 (47): l_=1 ... (112): l_=1\n continue # (20): NO CHANGE (48): NO CHANGE ... (113): NO CHANGE\n if flag == 1: # (23): NO CHANGE (29): NO CHANGE ... (100): NO CHANGE\n if S[i] == \"L\" : # (24): NO CHANGE (30): NO CHANGE ... (101): NO CHANGE\n l_ = l_ +1 # (25): l_=2 (31): l_=3 ... (96): l_=3\n else:\n al = l_ + r_ # (37): al=5 (53): al=2 ... (102): al=4\n a.append([al,r_]) # (38): a (54): a ... (103): a\n r_ = 1 # (39): r_=1 (55): NO CHANGE ... (104): NO CHANGE\n l_ = 0 # (40): l_=0 (56): l_=0 ... (105): l_=0\n flag = 0 # (41): flag=0 (57): flag=0 ... (106): flag=0\n if i == len(S) -1: # (26): NO CHANGE (32): NO CHANGE ... (107): NO CHANGE\n al = l_ + r_\n a.append([al,r_])\n \n\nans = [] # (115): ans=[]\nfor i in range(len(a)): # (116): i=0 (131): i=1 ... (164): NO CHANGE\n n = a[i][0] # (117): n=5 (132): n=2 ... (152): n=4\n r = a[i][1] # (118): r=2 (133): r=1 ... (153): r=1\n odd = n # (119): odd=5 (134): odd=2 ... (154): odd=4\n eve = n - odd # (120): eve=0 (135): NO CHANGE ... (155): NO CHANGE\n for j in range(r -1): # (121): j=0 (123): NO CHANGE ... (156): NO CHANGE\n ans.append(0) # (122): ans=[0] (146): ans=[0, 0, 5, 0, 0, 0, 2, 0]\n ans.append(eve) # (124): ans=[0, 0] (137): ans=[0, 0, 5, 0, 0, 0] ... (157): ans=[0, 0, 5, 0, 0, 0, 2, 0, 0, 3, 0]\n ans.append(odd) # (125): ans=[0, 0, 5] (138): ans=[0, 0, 5, 0, 0, 0, 2] ... (158): ans=[0, 0, 5, 0, 0, 0, 2, 0, 0, 3, 0, 4]\n for j in range(n -r -1): # (126): NO CHANGE (128): j=1 ... (163): NO CHANGE\n ans.append(0) # (127): ans=[0, 0, 5, 0] (129): ans=[0, 0, 5, 0, 0] ... (162): ans=[0, 0, 5, 0, 0, 0, 2, 0, 0, 3, 0, 4, 0, 0]\nprint(*ans)\n \n "], "anno_status": [false], "diff_content": " S = input()\n a = []\n r_ = 0 \n l_ = 0\n flag = 0\n for i in range(len(S)):\n if flag == 0:\n if S[i]==\"R\":\n r_ = r_ +1\n continue\n- else:\n+ elif i != len(S) -1:\n flag = 1\n l_ = l_ +1\n continue\n+ else:\n+ l_ = l_ +1\n+ al = l_ + r_\n+ a.append([al,r_])\n+ continue\n+ \n if flag == 1:\n if S[i] == \"L\" :\n l_ = l_ +1\n else:\n al = l_ + r_\n a.append([al,r_])\n r_ = 1\n l_ = 0 \n flag = 0\n if i == len(S) -1:\n al = l_ + r_\n a.append([al,r_])\n \n \n ans = []\n for i in range(len(a)):\n n = a[i][0]\n r = a[i][1]\n odd = n \n eve = n - odd\n for j in range(r -1):\n ans.append(0)\n- ans.append(eve)\n- ans.append(odd)\n+ if r \n+ ans.append(eve)\n+ ans.append(odd)\n+ else:\n+ ans.append(odd)\n+ ans.append(eve)\n for j in range(n -r -1):\n ans.append(0)\n print(*ans)\n \n \n+\n+ \n", "FL_content": " S = input()\n a = []\n r_ = 0 \n l_ = 0\n flag = 0\n for i in range(len(S)):\n if flag == 0:\n if S[i]==\"R\":\n r_ = r_ +1\n continue\n- else:\n flag = 1\n l_ = l_ +1\n continue\n if flag == 1:\n if S[i] == \"L\" :\n l_ = l_ +1\n else:\n al = l_ + r_\n a.append([al,r_])\n r_ = 1\n l_ = 0 \n flag = 0\n if i == len(S) -1:\n al = l_ + r_\n a.append([al,r_])\n \n \n ans = []\n for i in range(len(a)):\n n = a[i][0]\n r = a[i][1]\n odd = n \n eve = n - odd\n for j in range(r -1):\n ans.append(0)\n- ans.append(eve)\n- ans.append(odd)\n for j in range(n -r -1):\n ans.append(0)\n print(*ans)\n \n \n", "added_lines": 15, "removed_lines": 3, "code1_lines": 43 }, { "user_id": "u840988663", "problem_id": "p02954", "submission1_id": "s700388640", "submission2_id": "s029649828", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\nL=len(S)\nx=[1]*len(S)\nfor i in range(L-2):\n if S[i] == S[i+1] == \"R\":\n x[i+2] += x[i]\n x[i]=0\nfor i in range(L-1,-1,-1):\n if S[i] == S[i-1] ==\"L\":\n x[i-2] += x[i]\n x[i]=0\n\nprint(x)", "code2": "S=input()\nL=len(S)\nx=[1]*len(S)\nfor i in range(L-2):\n if S[i] == S[i+1] == \"R\":\n x[i+2] += x[i]\n x[i]=0\nfor i in range(L-1,-1,-1):\n if S[i] == S[i-1] ==\"L\":\n x[i-2] += x[i]\n x[i]=0\n\n\nprint(' '.join(map(str, x)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564969949", "date2": "1564970363", "bleu_score": "0.9075606431967126", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "RRLLLLLLRRRL\n", "actual_output": "[0, 4, 4, 0, 0, 0, 0, 0, 0, 0, 2, 2]\n", "expected_output": "0 4 4 0 0 0 0 0 0 0 2 2\n\n", "anno_code": ["S=input() # (0): S=RRLLLLLLRRRL\nL=len(S) # (1): L=12\nx=[1]*len(S) # (2): x=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nfor i in range(L-2): # (3): i=0 (7): i=1 ... (29): NO CHANGE\n if S[i] == S[i+1] == \"R\": # (4): NO CHANGE (8): NO CHANGE ... (26): NO CHANGE\n x[i+2] += x[i] # (5): x=[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] (23): x=[0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1] (27): x=[0, 1, 2, 1, 1, 1, 1, 1, 0, 1, 2, 2]\n x[i]=0 # (6): x=[0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] (24): x=[0, 1, 2, 1, 1, 1, 1, 1, 0, 1, 2, 1] (28): x=[0, 1, 2, 1, 1, 1, 1, 1, 0, 0, 2, 2]\nfor i in range(L-1,-1,-1): # (30): i=11 (32): i=10 ... (64): NO CHANGE\n if S[i] == S[i-1] ==\"L\": # (31): NO CHANGE (33): NO CHANGE ... (63): NO CHANGE\n x[i-2] += x[i] # (40): x=[0, 1, 2, 1, 1, 2, 1, 1, 0, 0, 2, 2] (44): x=[0, 1, 2, 1, 2, 2, 1, 0, 0, 0, 2, 2] ... (56): x=[0, 4, 4, 3, 0, 0, 0, 0, 0, 0, 2, 2]\n x[i]=0 # (41): x=[0, 1, 2, 1, 1, 2, 1, 0, 0, 0, 2, 2] (45): x=[0, 1, 2, 1, 2, 2, 0, 0, 0, 0, 2, 2] ... (57): x=[0, 4, 4, 0, 0, 0, 0, 0, 0, 0, 2, 2]\n\nprint(x)"], "anno_status": [true], "diff_content": " S=input()\n L=len(S)\n x=[1]*len(S)\n for i in range(L-2):\n if S[i] == S[i+1] == \"R\":\n x[i+2] += x[i]\n x[i]=0\n for i in range(L-1,-1,-1):\n if S[i] == S[i-1] ==\"L\":\n x[i-2] += x[i]\n x[i]=0\n \n-print(x)\n+\n+print(' '.join(map(str, x)))\n", "FL_content": " S=input()\n L=len(S)\n x=[1]*len(S)\n for i in range(L-2):\n if S[i] == S[i+1] == \"R\":\n x[i+2] += x[i]\n x[i]=0\n for i in range(L-1,-1,-1):\n if S[i] == S[i-1] ==\"L\":\n x[i-2] += x[i]\n x[i]=0\n \n-print(x)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u865741247", "problem_id": "p02954", "submission1_id": "s118366595", "submission2_id": "s064280191", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\nS = input()\nl = len(S)\nans = [0] * l\ncot = [0,0]\nfor i in range(l):\n if S[i] == \"R\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i - 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\n\ncot[0] = cot[1] = 0\nfor i in range(l-1,0,-1):\n if S[i] == \"L\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i + 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\nprint(\" \".join(list(map(str,ans))))\n\n\n", "code2": "\nimport sys\n\nS = input()\nl = len(S)\nans = [0] * l\ncot = [0,0]\nfor i in range(l):\n if S[i] == \"R\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i - 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\n\ncot[0] = cot[1] = 0\nfor i in range(l-1,-1,-1):\n if S[i] == \"L\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i + 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\nprint(\" \".join(list(map(str,ans))))\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564998729", "date2": "1564999008", "bleu_score": "0.9924399210143711", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 79, "total_score": 103, "input": "RLRLLLRRRRLLLRLL\n", "actual_output": "1 0 2 2 0 0 0 0 0 3 4 0 0 2 1 0\n", "expected_output": "1 1 2 2 0 0 0 0 0 3 4 0 0 2 1 0\n\n", "anno_code": ["\nimport sys\n\nS = input() # (0): S=RLRLLLRRRRLLLRLL\nl = len(S) # (1): l=16\nans = [0] * l # (2): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\ncot = [0,0] # (3): cot=[0, 0]\nfor i in range(l): # (4): i=0 (7): i=1 ... (70): NO CHANGE\n if S[i] == \"R\": # (5): NO CHANGE (8): NO CHANGE ... (66): NO CHANGE\n cot[i%2] += 1 # (6): cot=[1, 0] (14): cot=[1, 0] ... (59): cot=[0, 1]\n else:\n ans[i] += cot[i %2 ] # (9): NO CHANGE (17): NO CHANGE ... (67): NO CHANGE\n ans[i - 1 ] += cot[(i + 1)%2] # (10): ans=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (18): ans=[1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (68): NO CHANGE\n cot[0] = cot[1] = 0 # (11): cot=[0, 0] (19): cot=[0, 0] ... (69): NO CHANGE\n\ncot[0] = cot[1] = 0 # (71): NO CHANGE\nfor i in range(l-1,0,-1): # (72): NO CHANGE (75): i=14 ... (129): NO CHANGE\n if S[i] == \"L\": # (73): NO CHANGE (76): NO CHANGE ... (127): NO CHANGE\n cot[i%2] += 1 # (74): cot=[0, 1] (77): cot=[1, 1] ... (128): cot=[0, 1]\n else:\n ans[i] += cot[i %2 ] # (80): ans=[1, 0, 1, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 2, 0, 0] (94): ans=[1, 0, 1, 0, 0, 0, 0, 0, 0, 3, 2, 0, 0, 2, 1, 0] ... (123): ans=[1, 0, 2, 0, 0, 0, 0, 0, 0, 3, 4, 0, 0, 2, 1, 0]\n ans[i + 1 ] += cot[(i + 1)%2] # (81): ans=[1, 0, 1, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 2, 1, 0] (95): ans=[1, 0, 1, 0, 0, 0, 0, 0, 0, 3, 4, 0, 0, 2, 1, 0] ... (124): ans=[1, 0, 2, 2, 0, 0, 0, 0, 0, 3, 4, 0, 0, 2, 1, 0]\n cot[0] = cot[1] = 0 # (82): cot=[0, 0] (96): cot=[0, 0] ... (125): cot=[0, 0]\nprint(\" \".join(list(map(str,ans))))\n\n\n"], "anno_status": [true], "diff_content": " \n import sys\n \n S = input()\n l = len(S)\n ans = [0] * l\n cot = [0,0]\n for i in range(l):\n if S[i] == \"R\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i - 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\n \n cot[0] = cot[1] = 0\n-for i in range(l-1,0,-1):\n+for i in range(l-1,-1,-1):\n if S[i] == \"L\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i + 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\n print(\" \".join(list(map(str,ans))))\n \n \n \n", "FL_content": " \n import sys\n \n S = input()\n l = len(S)\n ans = [0] * l\n cot = [0,0]\n for i in range(l):\n if S[i] == \"R\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i - 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\n \n cot[0] = cot[1] = 0\n-for i in range(l-1,0,-1):\n if S[i] == \"L\":\n cot[i%2] += 1\n else:\n ans[i] += cot[i %2 ]\n ans[i + 1 ] += cot[(i + 1)%2]\n cot[0] = cot[1] = 0\n print(\" \".join(list(map(str,ans))))\n \n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u652498023", "problem_id": "p03343", "submission1_id": "s573956070", "submission2_id": "s926060227", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K, Q = map(int, input().split())\na = list(map(int, input().split()))\n\nd=[a]\na.sort()\nans = a[Q-1] - a[0]\n\n\nwhile True:\n d_temp = list()\n sub_temp = list()\n for sub in d:\n for c in sub:\n if c != a[0]:\n sub_temp.append(c)\n else:\n d_temp.append(sub_temp)\n sub_temp = list()\n d_temp.append(sub_temp)\n sub_temp = list()\n d = list()\n a = list()\n\n for sub in d_temp:\n if len(sub) < K:\n continue\n else:\n d.append(sub)\n sub.sort()\n a.extend(sub[0:len(sub)-K+1])\n a.sort()\n if len(a) < Q:\n break\n else:\n ans = min(ans, a[Q-1] - a[0])\n\nprint(ans)\n", "code2": "n, k, q = map(int, input().split())\na = list(map(int, input().split()))\n \nd = [a]\na = sorted(a)\nans = a[q - 1] - a[0]\n \nwhile True:\n newd = list()\n li = list()\n for sub in d:\n for c in sub:\n if c != a[0]:\n li.append(c)\n else:\n newd.append(li)\n li = list()\n newd.append(li)\n li = list()\n \n d = list()\n a = list()\n for li in newd:\n if len(li) < k:\n continue\n else:\n d.append(li)\n li = sorted(li)\n a.extend(li[0:len(li) - k + 1])\n \n a.sort()\n \n if len(a) >= q:\n ans = min(a[q - 1] - a[0], ans)\n else:\n break\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1529263018", "date2": "1529263547", "bleu_score": "0.656937726517477", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1, 1, 1, 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": "11 3 5\n24979445 469880797 623690081 509544855 476190629 262703497 291002410 971407775 628894325 210342416 1604024289\n", "actual_output": "159013528\n", "expected_output": "246841358\n\n", "anno_code": ["N, K, Q = map(int, input().split()) # (0): N=11, K=3, Q=5\na = list(map(int, input().split())) # (1): a=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289]\n\nd=[a] # (2): d\na.sort() # (3): a=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289], d\nans = a[Q-1] - a[0] # (4): ans=444901352\n\n\nwhile True: # (5): NO CHANGE (61): d_temp ... (211): d_temp\n d_temp = list() # (6): d_temp=[] (62): d_temp=[] ... (212): d_temp=[]\n sub_temp = list() # (7): sub_temp=[] (63): NO CHANGE ... (213): NO CHANGE\n for sub in d: # (8): sub=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289] (46): d_temp ... (240): d_temp\n for c in sub: # (9): c=24979445 (13): c=210342416 ... (237): NO CHANGE\n if c != a[0]: # (10): NO CHANGE (14): NO CHANGE ... (235): NO CHANGE\n sub_temp.append(c) # (15): sub_temp=[210342416] (18): sub_temp=[210342416, 262703497] ... (236): sub_temp=[476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]\n else:\n d_temp.append(sub_temp) # (11): d_temp (67): d_temp ... (217): d_temp\n sub_temp = list() # (12): NO CHANGE (68): NO CHANGE ... (218): NO CHANGE\n d_temp.append(sub_temp) # (44): d_temp (97): d_temp ... (238): d_temp\n sub_temp = list() # (45): d_temp=[[], [210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]], sub_temp=[] (98): d_temp=[[], [262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]], sub_temp=[] ... (239): d_temp, sub_temp=[]\n d = list() # (47): d=[], d_temp (100): d=[], d_temp ... (241): d=[], d_temp\n a = list() # (48): a=[], d_temp (101): a=[], d_temp ... (242): a=[], d_temp\n\n for sub in d_temp: # (49): d_temp, sub=[] (52): d_temp, sub=[210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289] ... (251): d_temp\n if len(sub) < K: # (50): d_temp (53): d_temp ... (247): d_temp\n continue # (51): d_temp (104): d_temp ... (245): d_temp\n else:\n d.append(sub) # (54): d=[[210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]], d_temp (107): d, d_temp ... (248): d=[[476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]], d_temp\n sub.sort() # (55): d_temp (108): d_temp ... (249): d_temp\n a.extend(sub[0:len(sub)-K+1]) # (56): a=[210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325], d_temp (109): a=[262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325], d_temp ... (250): a=[476190629, 509544855, 623690081, 628894325], d_temp\n a.sort() # (58): d_temp (111): d_temp ... (252): d_temp\n if len(a) < Q: # (59): d_temp (112): d_temp ... (253): d_temp\n break # (254): d_temp\n else:\n ans = min(ans, a[Q-1] - a[0]) # (60): ans=265848213, d_temp (113): ans=246841358, d_temp ... (210): ans=159013528, d_temp\n\nprint(ans)\n"], "anno_status": [false], "diff_content": "-N, K, Q = map(int, input().split())\n+n, k, q = map(int, input().split())\n a = list(map(int, input().split()))\n-\n-d=[a]\n-a.sort()\n-ans = a[Q-1] - a[0]\n-\n-\n+ \n+d = [a]\n+a = sorted(a)\n+ans = a[q - 1] - a[0]\n+ \n while True:\n- d_temp = list()\n- sub_temp = list()\n- for sub in d:\n- for c in sub:\n- if c != a[0]:\n- sub_temp.append(c)\n- else:\n- d_temp.append(sub_temp)\n- sub_temp = list()\n- d_temp.append(sub_temp)\n- sub_temp = list()\n- d = list()\n- a = list()\n-\n- for sub in d_temp:\n- if len(sub) < K:\n- continue\n+ newd = list()\n+ li = list()\n+ for sub in d:\n+ for c in sub:\n+ if c != a[0]:\n+ li.append(c)\n+ else:\n+ newd.append(li)\n+ li = list()\n+ newd.append(li)\n+ li = list()\n+ \n+ d = list()\n+ a = list()\n+ for li in newd:\n+ if len(li) < k:\n+ continue\n+ else:\n+ d.append(li)\n+ li = sorted(li)\n+ a.extend(li[0:len(li) - k + 1])\n+ \n+ a.sort()\n+ \n+ if len(a) >= q:\n+ ans = min(a[q - 1] - a[0], ans)\n else:\n- d.append(sub)\n- sub.sort()\n- a.extend(sub[0:len(sub)-K+1])\n- a.sort()\n- if len(a) < Q:\n- break\n- else:\n- ans = min(ans, a[Q-1] - a[0])\n-\n+ break\n print(ans)\n-\n", "FL_content": "-N, K, Q = map(int, input().split())\n a = list(map(int, input().split()))\n-\n-d=[a]\n-a.sort()\n-ans = a[Q-1] - a[0]\n-\n-\n while True:\n- d_temp = list()\n- sub_temp = list()\n- for sub in d:\n- for c in sub:\n- if c != a[0]:\n- sub_temp.append(c)\n- else:\n- d_temp.append(sub_temp)\n- sub_temp = list()\n- d_temp.append(sub_temp)\n- sub_temp = list()\n- d = list()\n- a = list()\n-\n- for sub in d_temp:\n- if len(sub) < K:\n- continue\n else:\n- d.append(sub)\n- sub.sort()\n- a.extend(sub[0:len(sub)-K+1])\n- a.sort()\n- if len(a) < Q:\n- break\n- else:\n- ans = min(ans, a[Q-1] - a[0])\n-\n print(ans)\n-\n", "added_lines": 33, "removed_lines": 34, "code1_lines": 38 }, { "user_id": "u059727354", "problem_id": "p03343", "submission1_id": "s872750015", "submission2_id": "s646712857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k, q = map(int, input().split())\na = list(map(int, input().split()))\n\nd = [a]\na = sorted(a)\nans = a[q - 1] - a[0]\n\nwhile True:\n newd = list()\n li = list()\n for sub in d:\n for c in sub:\n if c != a[0]:\n li.append(c)\n else:\n newd.append(li)\n li = list()\n newd.append(li)\n\n d = list()\n mi = list()\n for li in newd:\n if len(li) < k:\n continue\n else:\n d.append(li)\n li = sorted(li)\n mi.extend(li[0:len(li) - k + 1])\n \n mi.sort()\n\n if len(mi) >= q:\n a.pop(0)\n ans = min(mi[q - 1] - mi[0], ans)\n else:\n break\nprint(ans)", "code2": "n, k, q = map(int, input().split())\na = list(map(int, input().split()))\n\nd = [a]\na = sorted(a)\nans = a[q - 1] - a[0]\n\nwhile True:\n newd = list()\n li = list()\n for sub in d:\n for c in sub:\n if c != a[0]:\n li.append(c)\n else:\n newd.append(li)\n li = list()\n newd.append(li)\n li = list()\n\n d = list()\n a = list()\n for li in newd:\n if len(li) < k:\n continue\n else:\n d.append(li)\n li = sorted(li)\n a.extend(li[0:len(li) - k + 1])\n \n a.sort()\n\n if len(a) >= q:\n ans = min(a[q - 1] - a[0], ans)\n else:\n break\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527387906", "date2": "1527388561", "bleu_score": "0.9604188375198434", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "11 3 5\n24979445 469880797 623690081 509544855 476190629 262703497 38897442 971407775 628894325 210342416 1604024289\n", "actual_output": "360986584\n", "expected_output": "418551909\n\n", "anno_code": ["n, k, q = map(int, input().split()) # (0): n=11, k=3, q=5\na = list(map(int, input().split())) # (1): a=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289]\n\nd = [a] # (2): d\na = sorted(a) # (3): a=[24979445, 38897442, 210342416, 262703497, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]\nans = a[q - 1] - a[0] # (4): ans=444901352\n\nwhile True: # (5): NO CHANGE (61): newd ... (168): newd\n newd = list() # (6): newd=[] (62): newd=[] ... (169): newd=[]\n li = list() # (7): li=[] (63): li=[] ... (170): li=[]\n for sub in d: # (8): sub=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289] (44): NO CHANGE ... (195): NO CHANGE\n for c in sub: # (9): c=24979445 (13): c=469880797 ... (194): NO CHANGE\n if c != a[0]: # (10): NO CHANGE (14): NO CHANGE ... (192): NO CHANGE\n li.append(c) # (15): li=[469880797] (18): li=[469880797, 623690081] ... (193): li=[971407775, 628894325]\n else:\n newd.append(li) # (11): newd (82): newd ... (186): newd\n li = list() # (12): NO CHANGE (83): li=[] ... (187): li=[]\n newd.append(li) # (45): newd (98): newd ... (196): newd\n\n d = list() # (46): d=[], newd (99): d=[], newd ... (197): d=[], newd\n mi = list() # (47): newd=[[], [469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289]], mi=[] (100): newd=[[469880797, 623690081, 509544855, 476190629, 262703497], [971407775, 628894325, 210342416, 1604024289]], mi=[] ... (198): newd, mi=[]\n for li in newd: # (48): newd, li=[] (51): newd, li=[469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289] ... (207): newd\n if len(li) < k: # (49): newd (52): newd ... (205): newd\n continue # (50): newd=[[], [469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289]] (162): newd (206): newd\n else:\n d.append(li) # (53): d=[[469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289]], newd (103): d, newd ... (201): d=[[469880797, 623690081, 509544855, 476190629]], newd\n li = sorted(li) # (54): newd=[[], [469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289]], li=[38897442, 210342416, 262703497, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289] (104): newd=[[469880797, 623690081, 509544855, 476190629, 262703497], [971407775, 628894325, 210342416, 1604024289]], li=[262703497, 469880797, 476190629, 509544855, 623690081] ... (202): newd, li=[469880797, 476190629, 509544855, 623690081]\n mi.extend(li[0:len(li) - k + 1]) # (55): newd=[[], [469880797, 623690081, 509544855, 476190629, 262703497, 38897442, 971407775, 628894325, 210342416, 1604024289]], mi=[38897442, 210342416, 262703497, 469880797, 476190629, 509544855, 623690081, 628894325] (105): newd=[[469880797, 623690081, 509544855, 476190629, 262703497], [971407775, 628894325, 210342416, 1604024289]], mi=[262703497, 469880797, 476190629] ... (203): newd, mi=[469880797, 476190629]\n \n mi.sort() # (57): newd (112): d=[[469880797, 623690081, 509544855, 476190629, 262703497], [971407775, 628894325, 210342416, 1604024289]], newd, mi=[210342416, 262703497, 469880797, 476190629, 628894325] ... (208): newd\n\n if len(mi) >= q: # (58): newd (113): d, newd ... (209): newd\n a.pop(0) # (59): a=[38897442, 210342416, 262703497, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289], newd (114): a=[210342416, 262703497, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289], d, newd (166): a=[262703497, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289], newd\n ans = min(mi[q - 1] - mi[0], ans) # (60): ans=437293187, newd (115): d, ans=418551909, newd (167): ans=360986584, newd\n else:\n break # (210): newd\nprint(ans)"], "anno_status": [false], "diff_content": " n, k, q = map(int, input().split())\n a = list(map(int, input().split()))\n \n d = [a]\n a = sorted(a)\n ans = a[q - 1] - a[0]\n \n while True:\n newd = list()\n li = list()\n for sub in d:\n for c in sub:\n if c != a[0]:\n li.append(c)\n else:\n newd.append(li)\n li = list()\n- newd.append(li)\n+ newd.append(li)\n+ li = list()\n \n d = list()\n- mi = list()\n+ a = list()\n for li in newd:\n if len(li) < k:\n continue\n else:\n d.append(li)\n li = sorted(li)\n- mi.extend(li[0:len(li) - k + 1])\n+ a.extend(li[0:len(li) - k + 1])\n \n- mi.sort()\n+ a.sort()\n \n- if len(mi) >= q:\n- a.pop(0)\n- ans = min(mi[q - 1] - mi[0], ans)\n+ if len(a) >= q:\n+ ans = min(a[q - 1] - a[0], ans)\n else:\n break\n print(ans)\n", "FL_content": " n, k, q = map(int, input().split())\n a = list(map(int, input().split()))\n \n d = [a]\n a = sorted(a)\n ans = a[q - 1] - a[0]\n \n while True:\n newd = list()\n li = list()\n for sub in d:\n for c in sub:\n if c != a[0]:\n li.append(c)\n else:\n newd.append(li)\n li = list()\n- newd.append(li)\n \n d = list()\n- mi = list()\n for li in newd:\n if len(li) < k:\n continue\n else:\n d.append(li)\n li = sorted(li)\n- mi.extend(li[0:len(li) - k + 1])\n \n- mi.sort()\n \n- if len(mi) >= q:\n- a.pop(0)\n- ans = min(mi[q - 1] - mi[0], ans)\n else:\n break\n print(ans)\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 37 }, { "user_id": "u729707098", "problem_id": "p03343", "submission1_id": "s058584602", "submission2_id": "s797436283", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k,q = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nans = 10**9\nfor i in a:\n\tp,s,f = [],0,1\n\tfor j in range(n):\n\t\tif a[j]>=i and f:\n\t\t\ts,f = j,0\n\t\telif a[j]=k:\n\t\t\t\tfor j2 in sorted(a[s:j])[:j-s-k+1]: p.append(j2)\n\t\t\tf = 1\n\tif n-s>=k:\n\t\tfor j2 in sorted(a[s:n])[:n-s-k+1]: p.append(j2)\n\tif len(p)>=q: ans = min(ans,sorted(p)[q-1]-i)\nprint(ans)", "code2": "n,k,q = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nans = 10**9\nfor i in a:\n\tp,s,f = [],0,1\n\tfor j in range(n):\n\t\tif a[j]>=i and f:\n\t\t\ts,f = j,0\n\t\telif a[j]=k:\n\t\t\t\tfor j2 in sorted(a[s:j])[:j-s-k+1]: p.append(j2)\n\t\t\tf = 1\n\tif f-1 and n-s>=k:\n\t\tfor j2 in sorted(a[s:n])[:n-s-k+1]: p.append(j2)\n\tif len(p)>=q: ans = min(ans,sorted(p)[q-1]-i)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537478952", "date2": "1537479632", "bleu_score": "0.9780346272516192", "code1_test_status": [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, 0, 0, 1, 1, 1, 1, 1, 1, 1, 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, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 87, "total_score": 103, "input": "11 7 5\n10227698 831715734 623690081 802524328 190349718 262703497 147009374 971407775 628894325 146780215 88196393\n", "actual_output": "229159\n", "expected_output": "180122020\n\n", "anno_code": ["n,k,q = (int(i) for i in input().split()) # (0): n=11, k=7, q=5\na = [int(i) for i in input().split()] # (1): a=[10227698, 831715734, 623690081, 802524328, 190349718, 262703497, 147009374, 971407775, 628894325, 146780215, 88196393]\nans = 10**9 # (2): ans=1000000000\nfor i in a: # (3): i=10227698 (47): i=831715734 ... (485): NO CHANGE\n\tp,s,f = [],0,1 # (4): p=[], s=0, f=1 (48): p=[], f=1 ... (443): p=[], s=0\n\tfor j in range(n): # (5): j=0 (8): j=1 ... (477): NO CHANGE\n\t\tif a[j]>=i and f: # (6): NO CHANGE (9): NO CHANGE ... (475): NO CHANGE\n\t\t\ts,f = j,0 # (7): f=0 (54): s=1, f=0 ... (449): s=1, f=0\n\t\telif a[j]=k: # (58): NO CHANGE (78): NO CHANGE ... (428): NO CHANGE\n\t\t\t\tfor j2 in sorted(a[s:j])[:j-s-k+1]: p.append(j2) # (294): p=[147009374], j2=147009374 (295): p=[147009374, 190349718], j2=190349718 ... (432): NO CHANGE\n\t\t\tf = 1 # (59): f=1 (79): f=1 ... (433): f=1\n\tif n-s>=k: # (39): NO CHANGE (87): NO CHANGE ... (478): NO CHANGE\n\t\tfor j2 in sorted(a[s:n])[:n-s-k+1]: p.append(j2) # (40): p=[10227698], j2=10227698 (41): p=[10227698, 88196393], j2=88196393 ... (483): NO CHANGE\n\tif len(p)>=q: ans = min(ans,sorted(p)[q-1]-i) # (46): ans=180122020 (88): NO CHANGE ... (484): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " n,k,q = (int(i) for i in input().split())\n a = [int(i) for i in input().split()]\n ans = 10**9\n for i in a:\n \tp,s,f = [],0,1\n \tfor j in range(n):\n \t\tif a[j]>=i and f:\n \t\t\ts,f = j,0\n \t\telif a[j]=k:\n \t\t\t\tfor j2 in sorted(a[s:j])[:j-s-k+1]: p.append(j2)\n \t\t\tf = 1\n-\tif n-s>=k:\n+\tif f-1 and n-s>=k:\n \t\tfor j2 in sorted(a[s:n])[:n-s-k+1]: p.append(j2)\n \tif len(p)>=q: ans = min(ans,sorted(p)[q-1]-i)\n print(ans)\n", "FL_content": " n,k,q = (int(i) for i in input().split())\n a = [int(i) for i in input().split()]\n ans = 10**9\n for i in a:\n \tp,s,f = [],0,1\n \tfor j in range(n):\n \t\tif a[j]>=i and f:\n \t\t\ts,f = j,0\n \t\telif a[j]=k:\n \t\t\t\tfor j2 in sorted(a[s:j])[:j-s-k+1]: p.append(j2)\n \t\t\tf = 1\n-\tif n-s>=k:\n \t\tfor j2 in sorted(a[s:n])[:n-s-k+1]: p.append(j2)\n \tif len(p)>=q: ans = min(ans,sorted(p)[q-1]-i)\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u922449550", "problem_id": "p03343", "submission1_id": "s186868861", "submission2_id": "s303993648", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K, Q = map(int, input().split())\nA = list(map(int, input().split()))\n\ndef find_maximum(y):\n C = [[]]\n for a in A:\n if a < y and len(C[-1]) > 0:\n C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n if len(cand_x) >= Q:\n cand_x.sort()\n return cand_x[Q-1], cand_x[0]\n else:\n return float('inf'), 0\n\nans = float('inf')\nfor a in A:\n x, y = find_maximum(a)\n ans = min(ans, x-y)\n\nprint(ans)", "code2": "N, K, Q = map(int, input().split())\nA = list(map(int, input().split()))\n\ndef find_maximum(y):\n C = [[]]\n for a in A:\n if a < y:\n if len(C[-1]) > 0:\n C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n if len(cand_x) >= Q:\n cand_x.sort()\n return cand_x[Q-1], cand_x[0]\n else:\n return 10**18, 0\n\nans = 10**18\nfor a in A:\n x, y = find_maximum(a)\n ans = min(ans, x-y)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585774531", "date2": "1585775593", "bleu_score": "0.9369971849505286", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 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": 103, "input": "11 3 5\n24979445 469880797 623690081 509544855 476190629 262703497 291002410 971407775 628894325 210342416 1604024289\n", "actual_output": "444901352\n", "expected_output": "246841358\n\n", "anno_code": ["N, K, Q = map(int, input().split()) # (0): N=11, K=3, Q=5\nA = list(map(int, input().split())) # (1): A=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289]\n\ndef find_maximum(y): # (2): find_maximum=\n C = [[]] # (6): C (53): C ... (543): C\n for a in A: # (7): a=24979445 (10): a=469880797 ... (577): NO CHANGE\n if a < y and len(C[-1]) > 0: # (8): NO CHANGE (11): NO CHANGE ... (575): C\n C.append([]) # (71): C (83): C ... (573): C\n else:\n C[-1].append(a) # (9): C (12): C ... (576): C\n cand_x = [] # (41): cand_x=[] (88): C, cand_x=[] ... (578): cand_x=[]\n for Ci in C: # (42): Ci=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289] (47): NO CHANGE ... (597): NO CHANGE\n m = len(Ci) # (43): m=11 (90): C, m=5 ... (595): NO CHANGE\n if m >= K: # (44): NO CHANGE (91): C ... (596): NO CHANGE\n Ci.sort() # (45): C, Ci=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289] (92): C=[[24979445, 469880797, 476190629, 509544855, 623690081], [291002410, 971407775, 628894325], [1604024289]], Ci=[24979445, 469880797, 476190629, 509544855, 623690081] ... (535): C, Ci=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]\n cand_x += Ci[:m-K+1] # (46): cand_x=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325] (93): C, cand_x=[24979445, 469880797, 476190629] ... (536): cand_x=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325]\n if len(cand_x) >= Q: # (48): NO CHANGE (103): N=11, K=3, Q=5, A=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289], find_maximum=, ans=444901352, a=469880797, x=inf, y=0 ... (598): N=11, K=3, Q=5, A=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289], find_maximum=, ans=444901352, x=inf, y=0\n cand_x.sort() # (49): N=11, K=3, Q=5, A=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289], find_maximum=, ans=inf, a=24979445, x=469880797 (324): N=11, K=3, Q=5, A=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289], find_maximum=, ans=444901352, a=262703497, x=476190629, y=24979445 (539): N=11, K=3, Q=5, A=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289], find_maximum=, ans=444901352, a=210342416, x=469880797, y=24979445\n return cand_x[Q-1], cand_x[0]\n else:\n return float('inf'), 0\n\nans = float('inf') # (3): ans=inf\nfor a in A: # (4): a=24979445 (51): a=469880797 ... (600): NO CHANGE\n x, y = find_maximum(a) # (5): y=24979445 (52): y=469880797 ... (542): y=1604024289\n ans = min(ans, x-y) # (50): ans=444901352 (104): NO CHANGE ... (599): NO CHANGE\n\nprint(ans)"], "anno_status": [false], "diff_content": " N, K, Q = map(int, input().split())\n A = list(map(int, input().split()))\n \n def find_maximum(y):\n C = [[]]\n for a in A:\n- if a < y and len(C[-1]) > 0:\n- C.append([])\n+ if a < y:\n+ if len(C[-1]) > 0:\n+ C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n if len(cand_x) >= Q:\n cand_x.sort()\n return cand_x[Q-1], cand_x[0]\n else:\n- return float('inf'), 0\n+ return 10**18, 0\n \n-ans = float('inf')\n+ans = 10**18\n for a in A:\n x, y = find_maximum(a)\n ans = min(ans, x-y)\n \n print(ans)\n", "FL_content": " N, K, Q = map(int, input().split())\n A = list(map(int, input().split()))\n \n def find_maximum(y):\n C = [[]]\n for a in A:\n- if a < y and len(C[-1]) > 0:\n- C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n if len(cand_x) >= Q:\n cand_x.sort()\n return cand_x[Q-1], cand_x[0]\n else:\n- return float('inf'), 0\n \n-ans = float('inf')\n for a in A:\n x, y = find_maximum(a)\n ans = min(ans, x-y)\n \n print(ans)\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 28 }, { "user_id": "u919730120", "problem_id": "p03343", "submission1_id": "s712530371", "submission2_id": "s138352626", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k,q=list(map(int,input().split()))\na=list(map(int,input().split()))\nsorta=sorted(a)\nans=10**9\nfor i in sorta:\n A=[]\n l=[]\n flg=1\n for j in a:\n if i>j:\n flg*=-1\n if flg==1:\n l.append(j)\n if flg==-1:\n flg=1\n if len(l)j:\n if ln-k+1>=0:\n l.sort()\n A+=l[:ln-k+1]\n l=[]\n ln=0\n else:\n l.append(j)\n ln+=1\n if len(A)j: # (9): NO CHANGE (14): NO CHANGE ... (765): NO CHANGE\n flg*=-1 # (193): flg=-1 (202): flg=-1 ... (757): flg=-1\n if flg==1: # (10): NO CHANGE (15): NO CHANGE ... (766): NO CHANGE\n l.append(j) # (11): l=[1] (16): l=[1, 1] ... (767): l=[55]\n if flg==-1: # (12): NO CHANGE (17): NO CHANGE ... (768): NO CHANGE\n flg=1 # (196): flg=1 (205): flg=1 ... (760): flg=1\n if len(l)j:\n- flg*=-1\n- if flg==1:\n- l.append(j)\n- if flg==-1:\n- flg=1\n- if len(l)=0:\n l.sort()\n- A=A+l[:len(l)-k+1]\n- if l:\n- l.sort()\n- A=A+l[:len(l)-k+1]\n+ A+=l[:ln-k+1]\n+ l=[]\n+ ln=0\n+ else:\n+ l.append(j)\n+ ln+=1\n if len(A)j:\n- flg*=-1\n- if flg==1:\n- l.append(j)\n- if flg==-1:\n- flg=1\n- if len(l)=val:\n tmp.append(arr[i])\n else:\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n tmp=[]\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n if len(vals)=val:\n tmp.append(arr[i])\n else:\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n tmp=[]\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n if len(vals)=val: # (9): NO CHANGE (12): NO CHANGE ... (453): NO CHANGE\n tmp.append(arr[i]) # (10): tmp=[22030887] (13): tmp=[22030887, 861648772] ... (454): tmp=[861648772, 934647508, 1102097917, 822804784]\n else:\n if len(tmp)>=k: # (53): NO CHANGE (59): NO CHANGE ... (451): NO CHANGE\n tmp=sorted(tmp) # (286): tmp=[327456372, 476190629, 531780763, 623690081, 861648772, 934647508, 1102097917]\n vals.extend(tmp[:len(tmp)-k+1]) # (287): vals=[327456372]\n tmp=[] # (288): tmp=[]\n if len(tmp)>=k: # (42): NO CHANGE (85): NO CHANGE ... (456): NO CHANGE\n tmp=sorted(tmp) # (43): tmp=[22030887, 138767190, 269743313, 327456372, 476190629, 531780763, 623690081, 822804784, 861648772, 934647508, 1102097917] (206): tmp=[476190629, 531780763, 623690081, 822804784, 861648772, 934647508, 1102097917] ... (414): tmp=[269743313, 327456372, 476190629, 531780763, 623690081, 822804784, 861648772, 934647508, 1102097917]\n vals.extend(tmp[:len(tmp)-k+1]) # (44): vals=[22030887, 138767190, 269743313, 327456372, 476190629] (207): vals=[476190629] ... (415): vals=[269743313, 327456372, 476190629]\n if len(vals)=val:\n tmp.append(arr[i])\n else:\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n- tmp=[]\n+ tmp=[]\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n if len(vals)=val:\n tmp.append(arr[i])\n else:\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n- tmp=[]\n if len(tmp)>=k:\n tmp=sorted(tmp)\n vals.extend(tmp[:len(tmp)-k+1])\n if len(vals) 0:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n tn = len(tmp)\n if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\nprint(r)\n", "code2": "N, K, Q = map(int, input().split())\nX = list(map(int, input().split()))\n\nr = 10**18\nfor y in X:\n tmp = []\n tmp2 = []\n for x in X:\n if x < y:\n tmp.sort()\n tn = len(tmp)\n if len(tmp) > K-1:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n tmp.sort()\n tn = len(tmp)\n if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\nprint(r)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585666771", "date2": "1585669563", "bleu_score": "0.9175353148104334", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "11 7 2\n24979445 861648772 623690081 531780763 476190629 138767190 211047202 934647508 1102097917 269743313 822804784\n", "actual_output": "113787745\n", "expected_output": "72280012\n\n", "anno_code": ["N, K, Q = map(int, input().split()) # (0): N=11, K=7, Q=2\nX = list(map(int, input().split())) # (1): X=[24979445, 861648772, 623690081, 531780763, 476190629, 138767190, 211047202, 934647508, 1102097917, 269743313, 822804784]\nY = sorted(X) # (2): Y=[24979445, 138767190, 211047202, 269743313, 476190629, 531780763, 623690081, 822804784, 861648772, 934647508, 1102097917]\n\n\n\n\n\nr = Y[Q-1] - Y[0] # (3): r=113787745\nfor y in Y[1:]: # (4): y=138767190 (51): y=211047202 ... (636): NO CHANGE\n tmp = [] # (5): tmp=[] (52): tmp=[] ... (556): NO CHANGE\n tmp2 = [] # (6): tmp2=[] (53): tmp2=[] ... (557): NO CHANGE\n for x in X: # (7): x=24979445 (14): x=861648772 ... (631): NO CHANGE\n if x < y: # (8): NO CHANGE (15): NO CHANGE ... (625): NO CHANGE\n tmp.sort() # (9): NO CHANGE (56): NO CHANGE ... (626): NO CHANGE\n tn = len(tmp) # (10): tn=0 (57): tn=0 ... (627): tn=0\n if tn-K+1 > 0: # (11): NO CHANGE (58): NO CHANGE ... (628): NO CHANGE\n tmp2 += tmp[:tn-K+1]\n tmp = [] # (12): NO CHANGE (59): NO CHANGE ... (629): NO CHANGE\n continue # (13): NO CHANGE (60): NO CHANGE ... (630): NO CHANGE\n tmp.append(x) # (16): tmp=[861648772] (19): tmp=[861648772, 623690081] ... (616): tmp=[1102097917]\n tn = len(tmp) # (45): tn=10 (96): tn=5 ... (632): NO CHANGE\n if tn-K+1 > 0: # (46): NO CHANGE (97): NO CHANGE ... (633): NO CHANGE\n tmp2 += tmp[:tn-K+1] # (47): tmp2=[861648772, 623690081, 531780763, 476190629]\n tmp2.sort() # (48): tmp2=[476190629, 531780763, 623690081, 861648772] (98): NO CHANGE ... (634): NO CHANGE\n if len(tmp2) >= Q: # (49): NO CHANGE (99): NO CHANGE ... (635): NO CHANGE\n r = min(r, tmp2[Q-1] - y) # (50): NO CHANGE\nprint(r)\n"], "anno_status": [false], "diff_content": " N, K, Q = map(int, input().split())\n X = list(map(int, input().split()))\n-Y = sorted(X)\n \n-\n-\n-\n-\n-r = Y[Q-1] - Y[0]\n-for y in Y[1:]:\n+r = 10**18\n+for y in X:\n tmp = []\n tmp2 = []\n for x in X:\n if x < y:\n tmp.sort()\n tn = len(tmp)\n- if tn-K+1 > 0:\n+ if len(tmp) > K-1:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n+ tmp.sort()\n tn = len(tmp)\n if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\n print(r)\n \n", "FL_content": " N, K, Q = map(int, input().split())\n X = list(map(int, input().split()))\n-Y = sorted(X)\n \n-\n-\n-\n-\n-r = Y[Q-1] - Y[0]\n-for y in Y[1:]:\n tmp = []\n tmp2 = []\n for x in X:\n if x < y:\n tmp.sort()\n tn = len(tmp)\n- if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n tn = len(tmp)\n if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\n print(r)\n \n", "added_lines": 4, "removed_lines": 8, "code1_lines": 29 }, { "user_id": "u803848678", "problem_id": "p03343", "submission1_id": "s214407245", "submission2_id": "s193052071", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import *\n\nn,k,q = map(int, input().split())\na = list(map(int, input().split()))\nnum_set = set(a)\n\ndef parse(b):\n ret = []\n cnt = 0\n tmp = []\n for ai in a:\n if ai >= b:\n tmp.append(ai)\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n tmp = tmp[k-1:]\n heapify(tmp)\n ret.append(tmp)\n tmp = []\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n tmp = tmp[k-1:]\n heapify(tmp)\n ret.append(tmp)\n return ret\n\nans = 10**10\n\nfor b in num_set:\n heap = parse(b)\n heapify(heap)\n tmp = []\n i = 0\n while i= b:\n tmp.append(ai)\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n for i in range(k-1,len(tmp)):\n ret.append(tmp[i])\n tmp = []\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n for i in range(k-1,len(tmp)):\n ret.append(tmp[i])\n tmp = []\n return ret\n\nans = 10**10\n\nfor b in num_set:\n lis = parse(b)\n if len(lis) < q:\n continue\n ans_tmp = sorted(lis)[q-1] - min(lis)\n ans = min(ans, ans_tmp)\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584585035", "date2": "1584585375", "bleu_score": "0.7058095604695694", "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, 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, 0, 1, 1, 1, 1, 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": "11 7 2\n24979445 1631672198 123301419 1102367299 65734218 58272250 43247513 85567703 628894325 210342416 1039210630\n", "actual_output": "7461968\n", "expected_output": "15024737\n\n", "anno_code": ["from heapq import *\n\nn,k,q = map(int, input().split()) # (0): n=11, k=7, q=2\na = list(map(int, input().split())) # (1): a=[24979445, 1631672198, 123301419, 1102367299, 65734218, 58272250, 43247513, 85567703, 628894325, 210342416, 1039210630]\nnum_set = set(a) # (2): num_set={1102367299, 1039210630, 1631672198, 65734218, 123301419, 210342416, 24979445, 628894325, 85567703, 43247513, 58272250}\n\ndef parse(b): # (3): parse=\n ret = [] # (7): ret=[] (52): ret=[] ... (516): ret=[]\n cnt = 0 # (8): cnt=0 (53): cnt=0 ... (517): cnt=0\n tmp = [] # (9): tmp=[] (54): tmp=[] ... (518): tmp=[]\n for ai in a: # (10): ai=24979445 (13): ai=1631672198 ... (552): NO CHANGE\n if ai >= b: # (11): NO CHANGE (14): NO CHANGE ... (550): NO CHANGE\n tmp.append(ai) # (15): tmp=[1631672198] (21): tmp=[1631672198, 1102367299] ... (551): tmp=[1631672198, 123301419, 1102367299, 65734218, 58272250, 85567703, 628894325, 210342416, 1039210630]\n else:\n if len(tmp) >= k: # (12): NO CHANGE (18): NO CHANGE ... (539): NO CHANGE\n tmp.sort(reverse=True)\n tmp = tmp[k-1:]\n heapify(tmp)\n ret.append(tmp)\n tmp = []\n else:\n if len(tmp) >= k: # (44): heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=, n=11, k=7, q=2, a=[24979445, 1631672198, 123301419, 1102367299, 65734218, 58272250, 43247513, 85567703, 628894325, 210342416, 1039210630], num_set={1102367299, 1039210630, 1631672198, 65734218, 123301419, 210342416, 24979445, 628894325, 85567703, 43247513, 58272250}, parse=, ans=10000000000, heap=[] (89): heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=, n=11, k=7, q=2, a=[24979445, 1631672198, 123301419, 1102367299, 65734218, 58272250, 43247513, 85567703, 628894325, 210342416, 1039210630], num_set={1102367299, 1039210630, 1631672198, 65734218, 123301419, 210342416, 24979445, 628894325, 85567703, 43247513, 58272250}, parse=, ans=10000000000, heap=[], tmp=[], i=0 ... (553): NO CHANGE\n tmp.sort(reverse=True) # (180): tmp=[1631672198, 1102367299, 1039210630, 628894325, 210342416, 123301419, 85567703, 65734218] (331): tmp=[1631672198, 1102367299, 1039210630, 628894325, 210342416, 123301419, 85567703, 65734218, 58272250, 43247513, 24979445] ... (554): tmp=[1631672198, 1102367299, 1039210630, 628894325, 210342416, 123301419, 85567703, 65734218, 58272250]\n tmp = tmp[k-1:] # (181): tmp=[85567703, 65734218] (332): tmp=[85567703, 65734218, 58272250, 43247513, 24979445] ... (555): tmp=[85567703, 65734218, 58272250]\n heapify(tmp) # (182): tmp=[65734218, 85567703] (333): tmp=[24979445, 43247513, 58272250, 85567703, 65734218] ... (556): tmp=[58272250, 65734218, 85567703]\n ret.append(tmp) # (183): heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=, n=11, k=7, q=2, a=[24979445, 1631672198, 123301419, 1102367299, 65734218, 58272250, 43247513, 85567703, 628894325, 210342416, 1039210630], num_set={1102367299, 1039210630, 1631672198, 65734218, 123301419, 210342416, 24979445, 628894325, 85567703, 43247513, 58272250}, parse=, ans=10000000000, heap=[[65734218, 85567703]], tmp=[], i=0 (334): heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=, n=11, k=7, q=2, a=[24979445, 1631672198, 123301419, 1102367299, 65734218, 58272250, 43247513, 85567703, 628894325, 210342416, 1039210630], num_set={1102367299, 1039210630, 1631672198, 65734218, 123301419, 210342416, 24979445, 628894325, 85567703, 43247513, 58272250}, parse=, ans=19833485, heap=[[24979445, 43247513, 58272250, 85567703, 65734218]], tmp=[], i=0, lis=[] ... (557): heappush=, heappop=, heapify=, heapreplace=, merge=, nlargest=, nsmallest=, heappushpop=, n=11, k=7, q=2, a=[24979445, 1631672198, 123301419, 1102367299, 65734218, 58272250, 43247513, 85567703, 628894325, 210342416, 1039210630], num_set={1102367299, 1039210630, 1631672198, 65734218, 123301419, 210342416, 24979445, 628894325, 85567703, 43247513, 58272250}, parse=, ans=15024737, heap=[[58272250, 65734218, 85567703]], tmp=[43247513, 58272250], i=2, lis=[65734218, 85567703]\n return ret\n\nans = 10**10 # (4): ans=10000000000\n\nfor b in num_set: # (5): b=1102367299 (50): b=1631672198 ... (576): NO CHANGE\n heap = parse(b) # (6): NO CHANGE (51): NO CHANGE ... (515): NO CHANGE\n heapify(heap) # (45): NO CHANGE (90): NO CHANGE ... (558): NO CHANGE\n tmp = [] # (46): tmp=[] (91): NO CHANGE ... (559): tmp=[]\n i = 0 # (47): i=0 (92): NO CHANGE ... (560): i=0\n while i= b:\n tmp.append(ai)\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n- tmp = tmp[k-1:]\n- heapify(tmp)\n- ret.append(tmp)\n- tmp = []\n+ for i in range(k-1,len(tmp)):\n+ ret.append(tmp[i])\n+ tmp = []\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n- tmp = tmp[k-1:]\n- heapify(tmp)\n- ret.append(tmp)\n+ for i in range(k-1,len(tmp)):\n+ ret.append(tmp[i])\n+ tmp = []\n return ret\n \n ans = 10**10\n \n for b in num_set:\n- heap = parse(b)\n- heapify(heap)\n- tmp = []\n- i = 0\n- while i= b:\n tmp.append(ai)\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n- tmp = tmp[k-1:]\n- heapify(tmp)\n- ret.append(tmp)\n- tmp = []\n else:\n if len(tmp) >= k:\n tmp.sort(reverse=True)\n- tmp = tmp[k-1:]\n- heapify(tmp)\n- ret.append(tmp)\n return ret\n \n ans = 10**10\n \n for b in num_set:\n- heap = parse(b)\n- heapify(heap)\n- tmp = []\n- i = 0\n- while i k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n c = []\n else:\n c.append(y)\n if len(c) > k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n if len(b) >= q:\n b.sort()\n if m is None or m > b[q - 1]: m = b[q - 1] - x\nprint(m)\n", "code2": "n, k, q = map(int, input().split())\na = [int(x) for x in input().split()]\nm = None\nfor x in a:\n b = []\n c = []\n for y in a:\n if y < x:\n if len(c) >= k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n c = []\n else:\n c.append(y)\n if len(c) >= k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n if len(b) >= q:\n b.sort()\n if m is None or m > b[q - 1] - x: m = b[q - 1] - x\nprint(m)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527411578", "date2": "1527415650", "bleu_score": "0.9782422374556482", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 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": 103, "input": "11 3 5\n24979445 469880797 623690081 509544855 476190629 262703497 291002410 971407775 628894325 210342416 1604024289\n", "actual_output": "444901352\n", "expected_output": "246841358\n\n", "anno_code": ["n, k, q = map(int, input().split()) # (0): n=11, k=3, q=5\na = [int(x) for x in input().split()] # (1): a=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 291002410, 971407775, 628894325, 210342416, 1604024289]\nm = None # (2): m=None\nfor x in a: # (3): x=24979445 (46): x=469880797 ... (503): NO CHANGE\n b = [] # (4): b=[] (47): b=[] ... (455): b=[]\n c = [] # (5): c=[] (48): c=[] ... (456): c=[]\n for y in a: # (6): y=24979445 (9): y=469880797 ... (500): NO CHANGE\n if y < x: # (7): NO CHANGE (10): NO CHANGE ... (498): NO CHANGE\n if len(c) > k: # (51): NO CHANGE (67): NO CHANGE ... (495): NO CHANGE\n c.sort() # (68): c=[469880797, 476190629, 509544855, 623690081] (260): c=[262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775] (293): c=[469880797, 476190629, 509544855, 623690081]\n b.extend(c[:len(c) - k + 1]) # (69): b=[469880797, 476190629] (261): b=[262703497, 291002410, 469880797, 476190629, 509544855, 623690081] (294): b=[469880797, 476190629]\n c = [] # (52): NO CHANGE (70): c=[] ... (496): NO CHANGE\n else:\n c.append(y) # (8): c=[24979445] (11): c=[24979445, 469880797] ... (499): c=[1604024289]\n if len(c) > k: # (40): NO CHANGE (89): NO CHANGE ... (501): NO CHANGE\n c.sort() # (41): c=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289] (449): c=[210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325, 971407775, 1604024289]\n b.extend(c[:len(c) - k + 1]) # (42): b=[24979445, 210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325] (450): b=[210342416, 262703497, 291002410, 469880797, 476190629, 509544855, 623690081, 628894325]\n if len(b) >= q: # (43): NO CHANGE (90): NO CHANGE ... (502): NO CHANGE\n b.sort() # (44): NO CHANGE (269): NO CHANGE (452): NO CHANGE\n if m is None or m > b[q - 1]: m = b[q - 1] - x # (45): m=444901352 (270): NO CHANGE (453): NO CHANGE\nprint(m)\n"], "anno_status": [false], "diff_content": " n, k, q = map(int, input().split())\n a = [int(x) for x in input().split()]\n m = None\n for x in a:\n b = []\n c = []\n for y in a:\n if y < x:\n- if len(c) > k:\n+ if len(c) >= k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n c = []\n else:\n c.append(y)\n- if len(c) > k:\n+ if len(c) >= k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n if len(b) >= q:\n b.sort()\n- if m is None or m > b[q - 1]: m = b[q - 1] - x\n+ if m is None or m > b[q - 1] - x: m = b[q - 1] - x\n print(m)\n \n", "FL_content": " n, k, q = map(int, input().split())\n a = [int(x) for x in input().split()]\n m = None\n for x in a:\n b = []\n c = []\n for y in a:\n if y < x:\n- if len(c) > k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n c = []\n else:\n c.append(y)\n- if len(c) > k:\n c.sort()\n b.extend(c[:len(c) - k + 1])\n if len(b) >= q:\n b.sort()\n- if m is None or m > b[q - 1]: m = b[q - 1] - x\n print(m)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 22 }, { "user_id": "u922449550", "problem_id": "p03343", "submission1_id": "s149094671", "submission2_id": "s303993648", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K, Q = map(int, input().split())\nA = list(map(int, input().split()))\n\ndef find_maximum(y):\n C = [[]]\n for a in A:\n if a < y and len(C[-1]) > 0:\n C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n cand_x.sort()\n if len(cand_x) >= Q and cand_x[0] == y:\n return cand_x[Q-1]\n else:\n return float('inf')\n\nans = float('inf')\nfor a in A:\n x = find_maximum(a)\n ans = min(ans, x-a)\n\nprint(ans)", "code2": "N, K, Q = map(int, input().split())\nA = list(map(int, input().split()))\n\ndef find_maximum(y):\n C = [[]]\n for a in A:\n if a < y:\n if len(C[-1]) > 0:\n C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n if len(cand_x) >= Q:\n cand_x.sort()\n return cand_x[Q-1], cand_x[0]\n else:\n return 10**18, 0\n\nans = 10**18\nfor a in A:\n x, y = find_maximum(a)\n ans = min(ans, x-y)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585774791", "date2": "1585775593", "bleu_score": "0.9090128716482857", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 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": 103, "input": "11 4 5\n10227698 1631672198 623690081 802524328 575779469 262703497 147009374 971407775 628894325 210342416 520756664\n", "actual_output": "510528966\n", "expected_output": "428770095\n\n", "anno_code": ["N, K, Q = map(int, input().split()) # (0): N=11, K=4, Q=5\nA = list(map(int, input().split())) # (1): A=[10227698, 1631672198, 623690081, 802524328, 575779469, 262703497, 147009374, 971407775, 628894325, 210342416, 520756664]\n\ndef find_maximum(y): # (2): find_maximum=\n C = [[]] # (6): C (53): C ... (551): C\n for a in A: # (7): a=10227698 (10): a=1631672198 ... (585): C\n if a < y and len(C[-1]) > 0: # (8): NO CHANGE (11): NO CHANGE ... (583): C\n C.append([]) # (62): C (68): C ... (581): C\n else:\n C[-1].append(a) # (9): C (12): C ... (584): C\n cand_x = [] # (41): cand_x=[] (88): C=[[10227698, 1631672198], [802524328], [262703497], [971407775], [210342416], []], cand_x=[] ... (586): C, cand_x=[]\n for Ci in C: # (42): Ci=[10227698, 1631672198, 623690081, 802524328, 575779469, 262703497, 147009374, 971407775, 628894325, 210342416, 520756664] (47): NO CHANGE ... (598): C\n m = len(Ci) # (43): m=11 (90): C=[[10227698, 1631672198], [802524328], [262703497], [971407775], [210342416], []], m=2 ... (596): C, m=1\n if m >= K: # (44): NO CHANGE (91): C ... (597): C\n Ci.sort() # (45): C=[[10227698, 147009374, 210342416, 262703497, 520756664, 575779469, 623690081, 628894325, 802524328, 971407775, 1631672198]], Ci=[10227698, 147009374, 210342416, 262703497, 520756664, 575779469, 623690081, 628894325, 802524328, 971407775, 1631672198] (152): C=[[10227698, 623690081, 802524328, 1631672198], [262703497], [971407775, 628894325], [520756664]], Ci=[10227698, 623690081, 802524328, 1631672198] ... (590): C, Ci=[10227698, 575779469, 623690081, 802524328, 1631672198]\n cand_x += Ci[:m-K+1] # (46): cand_x=[10227698, 147009374, 210342416, 262703497, 520756664, 575779469, 623690081, 628894325] (153): C=[[10227698, 623690081, 802524328, 1631672198], [262703497], [971407775, 628894325], [520756664]], cand_x=[10227698] ... (591): C, cand_x=[10227698, 575779469]\n cand_x.sort() # (48): NO CHANGE (108): C ... (599): C\n if len(cand_x) >= Q and cand_x[0] == y: # (49): N=11, K=4, Q=5, A=[10227698, 1631672198, 623690081, 802524328, 575779469, 262703497, 147009374, 971407775, 628894325, 210342416, 520756664], find_maximum=, ans=inf, a=10227698, x=520756664 (109): N=11, K=4, Q=5, A=[10227698, 1631672198, 623690081, 802524328, 575779469, 262703497, 147009374, 971407775, 628894325, 210342416, 520756664], find_maximum=, ans=510528966, a=1631672198, x=inf ... (600): N=11, K=4, Q=5, A=[10227698, 1631672198, 623690081, 802524328, 575779469, 262703497, 147009374, 971407775, 628894325, 210342416, 520756664], find_maximum=, ans=510528966, x=inf\n return cand_x[Q-1]\n else:\n return float('inf')\n\nans = float('inf') # (3): ans=inf\nfor a in A: # (4): a=10227698 (51): a=1631672198 ... (602): NO CHANGE\n x = find_maximum(a) # (5): y=10227698 (52): y=1631672198 ... (550): y=520756664\n ans = min(ans, x-a) # (50): ans=510528966 (110): NO CHANGE ... (601): NO CHANGE\n\nprint(ans)"], "anno_status": [false], "diff_content": " N, K, Q = map(int, input().split())\n A = list(map(int, input().split()))\n \n def find_maximum(y):\n C = [[]]\n for a in A:\n- if a < y and len(C[-1]) > 0:\n- C.append([])\n+ if a < y:\n+ if len(C[-1]) > 0:\n+ C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n- cand_x.sort()\n- if len(cand_x) >= Q and cand_x[0] == y:\n- return cand_x[Q-1]\n+ if len(cand_x) >= Q:\n+ cand_x.sort()\n+ return cand_x[Q-1], cand_x[0]\n else:\n- return float('inf')\n+ return 10**18, 0\n \n-ans = float('inf')\n+ans = 10**18\n for a in A:\n- x = find_maximum(a)\n- ans = min(ans, x-a)\n+ x, y = find_maximum(a)\n+ ans = min(ans, x-y)\n \n print(ans)\n", "FL_content": " N, K, Q = map(int, input().split())\n A = list(map(int, input().split()))\n \n def find_maximum(y):\n C = [[]]\n for a in A:\n- if a < y and len(C[-1]) > 0:\n- C.append([])\n else:\n C[-1].append(a)\n cand_x = []\n for Ci in C:\n m = len(Ci)\n if m >= K:\n Ci.sort()\n cand_x += Ci[:m-K+1]\n- cand_x.sort()\n- if len(cand_x) >= Q and cand_x[0] == y:\n- return cand_x[Q-1]\n else:\n- return float('inf')\n \n-ans = float('inf')\n for a in A:\n- x = find_maximum(a)\n- ans = min(ans, x-a)\n \n print(ans)\n", "added_lines": 10, "removed_lines": 9, "code1_lines": 28 }, { "user_id": "u141610915", "problem_id": "p03343", "submission1_id": "s857212848", "submission2_id": "s492863140", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nN, K, Q = map(int, input().split())\na = list(map(int, input().split()))\nta = a + []\nres = pow(10, 10)\nfor x in sorted(a):\n \n t = sorted(ta)\n if t[Q - 1] == pow(10, 10): break\n res = min(res, t[Q - 1] - t[0])\n for i in range(N):\n if a[i] == x:\n for j in range(i - K + 1, i + K):\n if j in range(N):\n ta[j] = pow(10, 10)\nprint(res)", "code2": "import sys\ninput = sys.stdin.readline\nN, K, Q = map(int, input().split())\na = list(map(int, input().split()))\nta = a + []\nres = pow(10, 10)\nbs = pow(10, 10)\nfor x in sorted(set(a)):\n t = [[]]\n for i in range(N):\n if ta[i] == bs:\n if t[-1] != []:\n t.append([])\n else: t[-1].append(a[i])\n tt = []\n for i in range(len(t)):\n t[i].sort()\n for j in range(len(t[i]) - K + 1):\n tt.append(t[i][j])\n \n if len(tt) < Q: break\n tt.sort()\n res = min(res, tt[Q - 1] - tt[0])\n \n for i in range(N):\n if a[i] == x:\n ta[i] = bs\n \nprint(res)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582178800", "date2": "1582239444", "bleu_score": "0.6259248043641306", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 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, 1, 1, 1, 1, 0, 0, 1, 0, 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": "11 7 2\n24979445 1631672198 623690081 70942633 476190629 262703497 147009374 59168370 628894325 210342416 790610066\n", "actual_output": "34188925\n", "expected_output": "11774263\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nN, K, Q = map(int, input().split()) # (1): N=11, K=7, Q=2\na = list(map(int, input().split())) # (2): a=[24979445, 1631672198, 623690081, 70942633, 476190629, 262703497, 147009374, 59168370, 628894325, 210342416, 790610066]\nta = a + [] # (3): ta=[24979445, 1631672198, 623690081, 70942633, 476190629, 262703497, 147009374, 59168370, 628894325, 210342416, 790610066]\nres = pow(10, 10) # (4): res=10000000000\nfor x in sorted(a): # (5): x=24979445 (66): x=59168370 (130): x=70942633\n \n t = sorted(ta) # (6): t=[24979445, 59168370, 70942633, 147009374, 210342416, 262703497, 476190629, 623690081, 628894325, 790610066, 1631672198] (67): t=[59168370, 210342416, 628894325, 790610066, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000] (131): t=[10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000]\n if t[Q - 1] == pow(10, 10): break # (7): NO CHANGE (68): NO CHANGE (132): NO CHANGE\n res = min(res, t[Q - 1] - t[0]) # (8): res=34188925 (69): NO CHANGE\n for i in range(N): # (9): i=0 (45): i=1 ... (129): NO CHANGE\n if a[i] == x: # (10): NO CHANGE (46): NO CHANGE ... (128): NO CHANGE\n for j in range(i - K + 1, i + K): # (11): j=-6 (13): j=-5 ... (122): NO CHANGE\n if j in range(N): # (12): NO CHANGE (14): NO CHANGE ... (121): NO CHANGE\n ta[j] = pow(10, 10) # (25): ta=[10000000000, 1631672198, 623690081, 70942633, 476190629, 262703497, 147009374, 59168370, 628894325, 210342416, 790610066] (28): ta=[10000000000, 10000000000, 623690081, 70942633, 476190629, 262703497, 147009374, 59168370, 628894325, 210342416, 790610066] ... (115): ta=[10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000]\nprint(res)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n N, K, Q = map(int, input().split())\n a = list(map(int, input().split()))\n ta = a + []\n res = pow(10, 10)\n-for x in sorted(a):\n+bs = pow(10, 10)\n+for x in sorted(set(a)):\n+ t = [[]]\n+ for i in range(N):\n+ if ta[i] == bs:\n+ if t[-1] != []:\n+ t.append([])\n+ else: t[-1].append(a[i])\n+ tt = []\n+ for i in range(len(t)):\n+ t[i].sort()\n+ for j in range(len(t[i]) - K + 1):\n+ tt.append(t[i][j])\n+ \n+ if len(tt) < Q: break\n+ tt.sort()\n+ res = min(res, tt[Q - 1] - tt[0])\n \n- t = sorted(ta)\n- if t[Q - 1] == pow(10, 10): break\n- res = min(res, t[Q - 1] - t[0])\n for i in range(N):\n if a[i] == x:\n- for j in range(i - K + 1, i + K):\n- if j in range(N):\n- ta[j] = pow(10, 10)\n+ ta[i] = bs\n+ \n print(res)\n+\n", "FL_content": " import sys\n input = sys.stdin.readline\n N, K, Q = map(int, input().split())\n a = list(map(int, input().split()))\n ta = a + []\n res = pow(10, 10)\n-for x in sorted(a):\n \n- t = sorted(ta)\n- if t[Q - 1] == pow(10, 10): break\n- res = min(res, t[Q - 1] - t[0])\n for i in range(N):\n if a[i] == x:\n- for j in range(i - K + 1, i + K):\n- if j in range(N):\n- ta[j] = pow(10, 10)\n print(res)\n", "added_lines": 20, "removed_lines": 7, "code1_lines": 17 }, { "user_id": "u098240946", "problem_id": "p03343", "submission1_id": "s256556489", "submission2_id": "s108894240", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K,Q = a = map(int,input().split())\na = list(map(int,input().split()))\ninf = 10**10\nans = inf\nfor i in range(N):\n small = a[i]\n seq = []\n seqq = []\n for j in range(N):\n if a[j] < small:\n seq.append(seqq)\n seqq = []\n else:\n seqq.append(a[j])\n seq.append(seqq)\n aaa = []\n for s in seq:\n if len(s)>=K:\n s.sort()\n aaa += s[:len(s)-K+1]\n if len(aaa)>=Q:\n aaa.sort()\n ans = min(ans,aaa[Q-1]-aaa[0])\n print(i,a[i],aaa,ans)\nprint(ans)", "code2": "N,K,Q = a = map(int,input().split())\na = list(map(int,input().split()))\ninf = 10**10\nans = inf\nfor i in range(N):\n small = a[i]\n seq = []\n seqq = []\n for j in range(N):\n if a[j] < small:\n seq.append(seqq)\n seqq = []\n else:\n seqq.append(a[j])\n seq.append(seqq)\n aaa = []\n for s in seq:\n if len(s)>=K:\n s.sort()\n aaa += s[:len(s)-K+1]\n if len(aaa)>=Q:\n aaa.sort()\n ans = min(ans,aaa[Q-1]-aaa[0])\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1539447287", "date2": "1539447629", "bleu_score": "0.9432716510623844", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "11 7 5\n24979445 861648772 623690081 433933447 476190629 138767190 211047202 971407775 628894325 731963982 822804784\n", "actual_output": "0 24979445 [24979445, 138767190, 211047202, 433933447, 476190629] 451211184\n451211184\n", "expected_output": "451211184\n\n", "anno_code": ["N,K,Q = a = map(int,input().split()) # (0): N=11, K=7, Q=5, a=\na = list(map(int,input().split())) # (1): a=[24979445, 861648772, 623690081, 433933447, 476190629, 138767190, 211047202, 971407775, 628894325, 731963982, 822804784]\ninf = 10**10 # (2): inf=10000000000\nans = inf # (3): ans=10000000000\nfor i in range(N): # (4): i=0 (53): i=1 ... (660): seq\n small = a[i] # (5): small=24979445 (54): small=861648772 ... (593): small=822804784, seq\n seq = [] # (6): seq=[] (55): seq=[] ... (594): seq=[]\n seqq = [] # (7): seqq=[] (56): seqq=[] ... (595): seqq=[]\n for j in range(N): # (8): j=0 (11): j=1 ... (637): seq\n if a[j] < small: # (9): NO CHANGE (12): NO CHANGE ... (635): seq\n seq.append(seqq) # (59): seq (66): seq ... (632): seq\n seqq = [] # (60): NO CHANGE (67): seq, seqq=[] ... (633): seq\n else:\n seqq.append(a[j]) # (10): seqq=[24979445] (13): seqq=[24979445, 861648772] ... (636): seq, seqq=[822804784]\n seq.append(seqq) # (42): seq (100): seq ... (638): seq\n aaa = [] # (43): aaa=[] (101): seq, aaa=[] ... (639): seq\n for s in seq: # (44): s=[24979445, 861648772, 623690081, 433933447, 476190629, 138767190, 211047202, 971407775, 628894325, 731963982, 822804784] (48): NO CHANGE ... (658): seq\n if len(s)>=K: # (45): NO CHANGE (103): seq ... (657): seq\n s.sort() # (46): seq=[[24979445, 138767190, 211047202, 433933447, 476190629, 623690081, 628894325, 731963982, 822804784, 861648772, 971407775]], seqq=[24979445, 138767190, 211047202, 433933447, 476190629, 623690081, 628894325, 731963982, 822804784, 861648772, 971407775], s=[24979445, 138767190, 211047202, 433933447, 476190629, 623690081, 628894325, 731963982, 822804784, 861648772, 971407775] (337): seq=[[], [138767190, 211047202, 433933447, 476190629, 623690081, 628894325, 731963982, 822804784, 861648772, 971407775]], seqq=[138767190, 211047202, 433933447, 476190629, 623690081, 628894325, 731963982, 822804784, 861648772, 971407775], s=[138767190, 211047202, 433933447, 476190629, 623690081, 628894325, 731963982, 822804784, 861648772, 971407775]\n aaa += s[:len(s)-K+1] # (47): aaa=[24979445, 138767190, 211047202, 433933447, 476190629] (338): seq, aaa=[138767190, 211047202, 433933447, 476190629]\n if len(aaa)>=Q: # (49): NO CHANGE (123): seq ... (659): seq\n aaa.sort() # (50): NO CHANGE\n ans = min(ans,aaa[Q-1]-aaa[0]) # (51): ans=451211184\n print(i,a[i],aaa,ans) # (52): NO CHANGE\nprint(ans)"], "anno_status": [false], "diff_content": " N,K,Q = a = map(int,input().split())\n a = list(map(int,input().split()))\n inf = 10**10\n ans = inf\n for i in range(N):\n small = a[i]\n seq = []\n seqq = []\n for j in range(N):\n if a[j] < small:\n seq.append(seqq)\n seqq = []\n else:\n seqq.append(a[j])\n seq.append(seqq)\n aaa = []\n for s in seq:\n if len(s)>=K:\n s.sort()\n aaa += s[:len(s)-K+1]\n if len(aaa)>=Q:\n aaa.sort()\n ans = min(ans,aaa[Q-1]-aaa[0])\n- print(i,a[i],aaa,ans)\n print(ans)\n", "FL_content": " N,K,Q = a = map(int,input().split())\n a = list(map(int,input().split()))\n inf = 10**10\n ans = inf\n for i in range(N):\n small = a[i]\n seq = []\n seqq = []\n for j in range(N):\n if a[j] < small:\n seq.append(seqq)\n seqq = []\n else:\n seqq.append(a[j])\n seq.append(seqq)\n aaa = []\n for s in seq:\n if len(s)>=K:\n s.sort()\n aaa += s[:len(s)-K+1]\n if len(aaa)>=Q:\n aaa.sort()\n ans = min(ans,aaa[Q-1]-aaa[0])\n- print(i,a[i],aaa,ans)\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u941407962", "problem_id": "p03343", "submission1_id": "s882685265", "submission2_id": "s257944154", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K, Q = map(int, input().split())\nX = list(map(int, input().split()))\nY = sorted(X)\n\n\n\n\n\nr = Y[Q-1] - Y[0]\nfor y in Y[1:]:\n tmp = []\n tmp2 = []\n for x in X:\n if x < y:\n tmp.sort()\n tn = len(tmp)\n if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\nprint(r)\n", "code2": "N, K, Q = map(int, input().split())\nX = list(map(int, input().split()))\n\nr = 10**18\nfor y in X:\n tmp = []\n tmp2 = []\n for x in X:\n if x < y:\n tmp.sort()\n tn = len(tmp)\n if len(tmp) > K-1:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n tmp.sort()\n tn = len(tmp)\n if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\nprint(r)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585666701", "date2": "1585669563", "bleu_score": "0.8279156511668356", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "11 7 2\n24979445 1631672198 623690081 70942633 476190629 262703497 147009374 85567703 628894325 210342416 520756664\n", "actual_output": "45963188\n", "expected_output": "14625070\n\n", "anno_code": ["N, K, Q = map(int, input().split()) # (0): N=11, K=7, Q=2\nX = list(map(int, input().split())) # (1): X=[24979445, 1631672198, 623690081, 70942633, 476190629, 262703497, 147009374, 85567703, 628894325, 210342416, 520756664]\nY = sorted(X) # (2): Y=[24979445, 70942633, 85567703, 147009374, 210342416, 262703497, 476190629, 520756664, 623690081, 628894325, 1631672198]\n\n\n\n\n\nr = Y[Q-1] - Y[0] # (3): r=45963188\nfor y in Y[1:]: # (4): y=70942633 (47): y=85567703 ... (614): NO CHANGE\n tmp = [] # (5): tmp=[] (48): tmp=[] ... (536): NO CHANGE\n tmp2 = [] # (6): tmp2=[] (49): NO CHANGE ... (537): NO CHANGE\n for x in X: # (7): x=24979445 (14): x=1631672198 ... (611): NO CHANGE\n if x < y: # (8): NO CHANGE (15): NO CHANGE ... (605): NO CHANGE\n tmp.sort() # (9): NO CHANGE (52): NO CHANGE ... (606): NO CHANGE\n tn = len(tmp) # (10): tn=0 (53): NO CHANGE ... (607): NO CHANGE\n if tn-K+1 > 0: # (11): NO CHANGE (54): NO CHANGE ... (608): NO CHANGE\n tmp2 += tmp[:tn-K+1]\n tmp = [] # (12): NO CHANGE (55): NO CHANGE ... (609): NO CHANGE\n continue # (13): NO CHANGE (56): NO CHANGE ... (610): NO CHANGE\n tmp.append(x) # (16): tmp=[1631672198] (19): tmp=[1631672198, 623690081] ... (547): tmp=[1631672198]\n tmp2.sort() # (45): NO CHANGE (92): NO CHANGE ... (612): NO CHANGE\n if len(tmp2) >= Q: # (46): NO CHANGE (93): NO CHANGE ... (613): NO CHANGE\n r = min(r, tmp2[Q-1] - y)\nprint(r)\n"], "anno_status": [true], "diff_content": " N, K, Q = map(int, input().split())\n X = list(map(int, input().split()))\n-Y = sorted(X)\n \n-\n-\n-\n-\n-r = Y[Q-1] - Y[0]\n-for y in Y[1:]:\n+r = 10**18\n+for y in X:\n tmp = []\n tmp2 = []\n for x in X:\n if x < y:\n tmp.sort()\n tn = len(tmp)\n- if tn-K+1 > 0:\n+ if len(tmp) > K-1:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n+ tmp.sort()\n+ tn = len(tmp)\n+ if tn-K+1 > 0:\n+ tmp2 += tmp[:tn-K+1]\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\n print(r)\n \n", "FL_content": " N, K, Q = map(int, input().split())\n X = list(map(int, input().split()))\n-Y = sorted(X)\n \n-\n-\n-\n-\n-r = Y[Q-1] - Y[0]\n-for y in Y[1:]:\n tmp = []\n tmp2 = []\n for x in X:\n if x < y:\n tmp.sort()\n tn = len(tmp)\n- if tn-K+1 > 0:\n tmp2 += tmp[:tn-K+1]\n tmp = []\n continue\n tmp.append(x)\n tmp2.sort()\n if len(tmp2) >= Q:\n r = min(r, tmp2[Q-1] - y)\n print(r)\n \n", "added_lines": 7, "removed_lines": 8, "code1_lines": 26 }, { "user_id": "u141610915", "problem_id": "p03343", "submission1_id": "s982941533", "submission2_id": "s492863140", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nN, K, Q = map(int, input().split())\na = list(map(int, input().split()))\nres = pow(10, 10)\nfor x in sorted(a):\n t = sorted(a)\n if t[Q - 1] == pow(10, 10): break\n res = min(res, t[Q - 1] - t[0])\n for i in range(N):\n if a[i] == x:\n for j in range(i - K + 1, i + K):\n if j in range(N):\n a[j] = pow(10, 10)\n break\nprint(res)", "code2": "import sys\ninput = sys.stdin.readline\nN, K, Q = map(int, input().split())\na = list(map(int, input().split()))\nta = a + []\nres = pow(10, 10)\nbs = pow(10, 10)\nfor x in sorted(set(a)):\n t = [[]]\n for i in range(N):\n if ta[i] == bs:\n if t[-1] != []:\n t.append([])\n else: t[-1].append(a[i])\n tt = []\n for i in range(len(t)):\n t[i].sort()\n for j in range(len(t[i]) - K + 1):\n tt.append(t[i][j])\n \n if len(tt) < Q: break\n tt.sort()\n res = min(res, tt[Q - 1] - tt[0])\n \n for i in range(N):\n if a[i] == x:\n ta[i] = bs\n \nprint(res)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582178072", "date2": "1582239444", "bleu_score": "0.6073912329456684", "code1_test_status": [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 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, 1, 1, 1, 1, 0, 0, 1, 0, 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": "11 3 5\n24979445 469880797 623690081 433933447 476190629 262703497 147009374 971407775 628894325 210342416 822804784\n", "actual_output": "329181255\n", "expected_output": "322871423\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nN, K, Q = map(int, input().split()) # (1): N=11, K=3, Q=5\na = list(map(int, input().split())) # (2): a=[24979445, 469880797, 623690081, 433933447, 476190629, 262703497, 147009374, 971407775, 628894325, 210342416, 822804784]\nres = pow(10, 10) # (3): res=10000000000\nfor x in sorted(a): # (4): x=24979445 (25): x=147009374 (60): x=210342416\n t = sorted(a) # (5): t=[24979445, 147009374, 210342416, 262703497, 433933447, 469880797, 476190629, 623690081, 628894325, 822804784, 971407775] (26): t=[147009374, 210342416, 262703497, 433933447, 476190629, 628894325, 822804784, 971407775, 10000000000, 10000000000, 10000000000] (61): t=[210342416, 433933447, 822804784, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000]\n if t[Q - 1] == pow(10, 10): break # (6): NO CHANGE (27): NO CHANGE (62): NO CHANGE\n res = min(res, t[Q - 1] - t[0]) # (7): res=408954002 (28): res=329181255\n for i in range(N): # (8): i=0 (29): NO CHANGE ... (41): i=6\n if a[i] == x: # (9): NO CHANGE (30): NO CHANGE ... (42): NO CHANGE\n for j in range(i - K + 1, i + K): # (10): j=-2 (12): j=-1 ... (58): NO CHANGE\n if j in range(N): # (11): NO CHANGE (13): NO CHANGE ... (56): NO CHANGE\n a[j] = pow(10, 10) # (16): a=[10000000000, 469880797, 623690081, 433933447, 476190629, 262703497, 147009374, 971407775, 628894325, 210342416, 822804784] (19): a=[10000000000, 10000000000, 623690081, 433933447, 476190629, 262703497, 147009374, 971407775, 628894325, 210342416, 822804784] ... (57): a=[10000000000, 10000000000, 10000000000, 433933447, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 210342416, 822804784]\n break # (24): NO CHANGE (59): NO CHANGE\nprint(res)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n N, K, Q = map(int, input().split())\n a = list(map(int, input().split()))\n+ta = a + []\n res = pow(10, 10)\n-for x in sorted(a):\n- t = sorted(a)\n- if t[Q - 1] == pow(10, 10): break\n- res = min(res, t[Q - 1] - t[0])\n+bs = pow(10, 10)\n+for x in sorted(set(a)):\n+ t = [[]]\n+ for i in range(N):\n+ if ta[i] == bs:\n+ if t[-1] != []:\n+ t.append([])\n+ else: t[-1].append(a[i])\n+ tt = []\n+ for i in range(len(t)):\n+ t[i].sort()\n+ for j in range(len(t[i]) - K + 1):\n+ tt.append(t[i][j])\n+ \n+ if len(tt) < Q: break\n+ tt.sort()\n+ res = min(res, tt[Q - 1] - tt[0])\n+ \n for i in range(N):\n if a[i] == x:\n- for j in range(i - K + 1, i + K):\n- if j in range(N):\n- a[j] = pow(10, 10)\n- break\n+ ta[i] = bs\n+ \n print(res)\n+\n", "FL_content": " import sys\n input = sys.stdin.readline\n N, K, Q = map(int, input().split())\n a = list(map(int, input().split()))\n res = pow(10, 10)\n-for x in sorted(a):\n- t = sorted(a)\n- if t[Q - 1] == pow(10, 10): break\n- res = min(res, t[Q - 1] - t[0])\n for i in range(N):\n if a[i] == x:\n- for j in range(i - K + 1, i + K):\n- if j in range(N):\n- a[j] = pow(10, 10)\n- break\n print(res)\n", "added_lines": 22, "removed_lines": 8, "code1_lines": 16 }, { "user_id": "u368780724", "problem_id": "p03343", "submission1_id": "s351299238", "submission2_id": "s727654158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K, Q = [int(i) for i in input().split()]\nA = [(int(v),i) for i,v in enumerate(input().split())]\nA.sort()\nB = [0]*(N)\nfor i in range(N):\n B[A[i][1]] = i\nC = [A[B[i]][0] for i in range(N)]\nCandi = set(range(N))\nctr = 0\nans = []\nwhile len(Candi) >= Q:\n ans.append((list(Candi)[0],list(Candi)[Q-1]))\n x = B.index(ctr)\n Candi = Candi - set(B[x-K+1:x+K])\n ctr += 1\nprint(min([A[j][0]-A[i][0] for i,j in ans]))\n", "code2": "import bisect\nN, K, Q = [int(i) for i in input().split()]\nA = [(int(v),i) for i,v in enumerate(input().split())]\nA.sort()\nB = [0]*(N)\nfor i in range(N):\n B[A[i][1]] = i\nC = [A[B[i]][0] for i in range(N)]\nCandi = set(range(N))\nctr = 0\nans = []\nrng = [-1,N]\nwhile len(Candi) >= Q:\n T = sorted(Candi)\n ans.append((list(T)[0],list(T)[Q-1]))\n x = B.index(ctr)\n st = bisect.bisect_left(rng, x)\n Candi = Candi - set(sorted(B[rng[st-1]+1:x]+[2002],reverse = 1)[:K])\\\n - set(sorted(B[x:rng[st]]+[2002],reverse = 1)[:K])- set([B[x]])\n bisect.insort_left(rng, x)\n ctr += 1\nprint(min([A[j][0]-A[i][0] for i,j in ans]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543862481", "date2": "1543910462", "bleu_score": "0.6431174051922417", "code1_test_status": [1, 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, 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, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 103, "input": "10 1 4\n1 1 2 3 5 10 4 21 34 55\n", "actual_output": "-13\n", "expected_output": "2\n\n", "anno_code": ["N, K, Q = [int(i) for i in input().split()] # (0): N=10, K=1, Q=4\nA = [(int(v),i) for i,v in enumerate(input().split())] # (1): A=[(1, 0), (1, 1), (2, 2), (3, 3), (5, 4), (10, 5), (4, 6), (21, 7), (34, 8), (55, 9)]\nA.sort() # (2): A=[(1, 0), (1, 1), (2, 2), (3, 3), (4, 6), (5, 4), (10, 5), (21, 7), (34, 8), (55, 9)]\nB = [0]*(N) # (3): B=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(N): # (4): i=0 (6): i=1 ... (24): NO CHANGE\n B[A[i][1]] = i # (5): NO CHANGE (7): B=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0] ... (23): B=[0, 1, 2, 3, 5, 6, 4, 7, 8, 9]\nC = [A[B[i]][0] for i in range(N)] # (25): C=[1, 1, 2, 3, 5, 10, 4, 21, 34, 55]\nCandi = set(range(N)) # (26): Candi={0, 1, 2, 3, 4, 5, 6, 7, 8, 9}\nctr = 0 # (27): ctr=0\nans = [] # (28): ans=[]\nwhile len(Candi) >= Q: # (29): NO CHANGE (34): NO CHANGE ... (64): NO CHANGE\n ans.append((list(Candi)[0],list(Candi)[Q-1])) # (30): ans=[(0, 3)] (35): ans=[(0, 3), (1, 4)] ... (60): ans=[(0, 3), (1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (8, 7)]\n x = B.index(ctr) # (31): x=0 (36): x=1 ... (61): x=5\n Candi = Candi - set(B[x-K+1:x+K]) # (32): Candi={1, 2, 3, 4, 5, 6, 7, 8, 9} (37): Candi={2, 3, 4, 5, 6, 7, 8, 9} ... (62): Candi={8, 9, 7}\n ctr += 1 # (33): ctr=1 (38): ctr=2 ... (63): ctr=7\nprint(min([A[j][0]-A[i][0] for i,j in ans]))\n"], "anno_status": [true], "diff_content": "+import bisect\n N, K, Q = [int(i) for i in input().split()]\n A = [(int(v),i) for i,v in enumerate(input().split())]\n A.sort()\n B = [0]*(N)\n for i in range(N):\n B[A[i][1]] = i\n C = [A[B[i]][0] for i in range(N)]\n Candi = set(range(N))\n ctr = 0\n ans = []\n+rng = [-1,N]\n while len(Candi) >= Q:\n- ans.append((list(Candi)[0],list(Candi)[Q-1]))\n+ T = sorted(Candi)\n+ ans.append((list(T)[0],list(T)[Q-1]))\n x = B.index(ctr)\n- Candi = Candi - set(B[x-K+1:x+K])\n+ st = bisect.bisect_left(rng, x)\n+ Candi = Candi - set(sorted(B[rng[st-1]+1:x]+[2002],reverse = 1)[:K])\\\n+ - set(sorted(B[x:rng[st]]+[2002],reverse = 1)[:K])- set([B[x]])\n+ bisect.insort_left(rng, x)\n ctr += 1\n print(min([A[j][0]-A[i][0] for i,j in ans]))\n-\n", "FL_content": " N, K, Q = [int(i) for i in input().split()]\n A = [(int(v),i) for i,v in enumerate(input().split())]\n A.sort()\n B = [0]*(N)\n for i in range(N):\n B[A[i][1]] = i\n C = [A[B[i]][0] for i in range(N)]\n Candi = set(range(N))\n ctr = 0\n ans = []\n while len(Candi) >= Q:\n- ans.append((list(Candi)[0],list(Candi)[Q-1]))\n x = B.index(ctr)\n- Candi = Candi - set(B[x-K+1:x+K])\n ctr += 1\n print(min([A[j][0]-A[i][0] for i,j in ans]))\n-\n", "added_lines": 8, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u141610915", "problem_id": "p03343", "submission1_id": "s292708701", "submission2_id": "s492863140", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nN, K, Q = map(int, input().split())\na = list(map(int, input().split()))\nta = a + []\nres = pow(10, 10)\nbs = pow(10, 10)\nfor x in sorted(set(a)):\n t = [[]]\n for i in range(N):\n if ta[i] == bs:\n if t[-1] != []:\n t.append([])\n else: t[-1].append(a[i])\n tt = []\n for i in range(len(t)):\n t[i].sort()\n for j in range(len(t[i]) - K + 1):\n if t[i][j] != bs:\n tt.append(t[i][j])\n if len(tt) < Q: break\n tt.sort()\n res = min(res, tt[Q - 1] - tt[0])\n \n for i in range(N):\n if a[i] == x:\n for j in range(i - K + 1, i + K):\n if j in range(N):\n ta[j] = bs\n \nprint(res)\n", "code2": "import sys\ninput = sys.stdin.readline\nN, K, Q = map(int, input().split())\na = list(map(int, input().split()))\nta = a + []\nres = pow(10, 10)\nbs = pow(10, 10)\nfor x in sorted(set(a)):\n t = [[]]\n for i in range(N):\n if ta[i] == bs:\n if t[-1] != []:\n t.append([])\n else: t[-1].append(a[i])\n tt = []\n for i in range(len(t)):\n t[i].sort()\n for j in range(len(t[i]) - K + 1):\n tt.append(t[i][j])\n \n if len(tt) < Q: break\n tt.sort()\n res = min(res, tt[Q - 1] - tt[0])\n \n for i in range(N):\n if a[i] == x:\n ta[i] = bs\n \nprint(res)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582238139", "date2": "1582239444", "bleu_score": "0.8449565522575692", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 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": 103, "input": "11 3 5\n24979445 469880797 623690081 509544855 476190629 262703497 147009374 971407775 628894325 210342416 1604024289\n", "actual_output": "362535481\n", "expected_output": "329181255\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nN, K, Q = map(int, input().split()) # (1): N=11, K=3, Q=5\na = list(map(int, input().split())) # (2): a=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 147009374, 971407775, 628894325, 210342416, 1604024289]\nta = a + [] # (3): ta=[24979445, 469880797, 623690081, 509544855, 476190629, 262703497, 147009374, 971407775, 628894325, 210342416, 1604024289]\nres = pow(10, 10) # (4): res=10000000000\nbs = pow(10, 10) # (5): bs=10000000000\nfor x in sorted(set(a)): # (6): x=24979445 (114): x=147009374 (215): x=210342416\n t = [[]] # (7): t (115): t (216): t\n for i in range(N): # (8): i=0 (11): i=1 ... (251): t\n if ta[i] == bs: # (9): NO CHANGE (12): NO CHANGE ... (249): NO CHANGE\n if t[-1] != []: # (118): NO CHANGE (121): NO CHANGE ... (244): t\n t.append([]) # (232): t\n else: t[-1].append(a[i]) # (10): t (13): t ... (250): t\n tt = [] # (42): tt=[] (150): tt=[] (252): t, tt=[]\n for i in range(len(t)): # (43): i=0 (73): NO CHANGE ... (259): t\n t[i].sort() # (44): t (152): t ... (257): t\n for j in range(len(t[i]) - K + 1): # (45): j=0 (48): j=1 ... (258): t\n if t[i][j] != bs: # (46): NO CHANGE (49): NO CHANGE ... (169): NO CHANGE\n tt.append(t[i][j]) # (47): tt=[24979445] (50): tt=[24979445, 147009374] ... (170): tt=[147009374, 210342416, 262703497, 476190629, 509544855, 628894325]\n if len(tt) < Q: break # (74): NO CHANGE (173): NO CHANGE (260): t\n tt.sort() # (75): NO CHANGE (174): NO CHANGE\n res = min(res, tt[Q - 1] - tt[0]) # (76): res=444901352 (175): res=362535481\n \n for i in range(N): # (77): NO CHANGE (93): i=1 ... (214): NO CHANGE\n if a[i] == x: # (78): NO CHANGE (94): NO CHANGE ... (213): NO CHANGE\n for j in range(i - K + 1, i + K): # (79): j=-2 (81): j=-1 ... (205): NO CHANGE\n if j in range(N): # (80): NO CHANGE (82): NO CHANGE ... (203): NO CHANGE\n ta[j] = bs # (85): ta=[10000000000, 469880797, 623690081, 509544855, 476190629, 262703497, 147009374, 971407775, 628894325, 210342416, 1604024289] (88): ta=[10000000000, 10000000000, 623690081, 509544855, 476190629, 262703497, 147009374, 971407775, 628894325, 210342416, 1604024289] ... (204): ta=[10000000000, 10000000000, 10000000000, 509544855, 10000000000, 10000000000, 10000000000, 10000000000, 10000000000, 210342416, 1604024289]\n \nprint(res)\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n N, K, Q = map(int, input().split())\n a = list(map(int, input().split()))\n ta = a + []\n res = pow(10, 10)\n bs = pow(10, 10)\n for x in sorted(set(a)):\n t = [[]]\n for i in range(N):\n if ta[i] == bs:\n if t[-1] != []:\n t.append([])\n else: t[-1].append(a[i])\n tt = []\n for i in range(len(t)):\n t[i].sort()\n for j in range(len(t[i]) - K + 1):\n- if t[i][j] != bs:\n- tt.append(t[i][j])\n+ tt.append(t[i][j])\n+ \n if len(tt) < Q: break\n tt.sort()\n res = min(res, tt[Q - 1] - tt[0])\n \n for i in range(N):\n if a[i] == x:\n- for j in range(i - K + 1, i + K):\n- if j in range(N):\n- ta[j] = bs\n+ ta[i] = bs\n \n print(res)\n \n", "FL_content": " import sys\n input = sys.stdin.readline\n N, K, Q = map(int, input().split())\n a = list(map(int, input().split()))\n ta = a + []\n res = pow(10, 10)\n bs = pow(10, 10)\n for x in sorted(set(a)):\n t = [[]]\n for i in range(N):\n if ta[i] == bs:\n if t[-1] != []:\n t.append([])\n else: t[-1].append(a[i])\n tt = []\n for i in range(len(t)):\n t[i].sort()\n for j in range(len(t[i]) - K + 1):\n- if t[i][j] != bs:\n- tt.append(t[i][j])\n if len(tt) < Q: break\n tt.sort()\n res = min(res, tt[Q - 1] - tt[0])\n \n for i in range(N):\n if a[i] == x:\n- for j in range(i - K + 1, i + K):\n- if j in range(N):\n- ta[j] = bs\n \n print(res)\n \n", "added_lines": 3, "removed_lines": 5, "code1_lines": 32 }, { "user_id": "u905582793", "problem_id": "p03343", "submission1_id": "s976041922", "submission2_id": "s930152298", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nn,k,q = map(int,input().split())\na = list(map(int,input().split()))\nif q == 1:\n print(0)\n exit()\nls = [-1,n]\nb = sorted(((a[i],i) for i in range(n)))\nansls = [b[q-1][0]-b[0][0]]\nfor i,x in enumerate(b):\n ins = bisect.bisect_left(ls,i)\n ls.insert(ins,i)\n space = []\n qc = q-1\n for j in range(1,i+3):\n space.append(ls[j]-ls[j-1]-1)\n for j in range(i+1,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\nprint(min(ansls))", "code2": "import bisect\nn,k,q = map(int,input().split())\na = list(map(int,input().split()))\nif q == 1:\n print(0)\n exit()\nls = [-1,n]\nb = sorted(((a[i],i) for i in range(n)))\nansls = [b[q-1][0]-b[0][0]]\nspace = [n]\nqc = q\nfor i,x in enumerate(b):\n for j in range(i,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\n ins = bisect.bisect_left(ls,x[1])\n ls.insert(ins,x[1])\n space = []\n qc = q\n for j in range(1,i+3):\n space.append(ls[j]-ls[j-1]-1)\nprint(min(ansls))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589753934", "date2": "1589754984", "bleu_score": "0.9411400052964475", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 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, 0, 1, 1, 1, 1, 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": "11 7 2\n22030887 861648772 623690081 531780763 476190629 138767190 327456372 934647508 1102097917 269743313 822804784\n", "actual_output": "57713059\n", "expected_output": "116736303\n\n", "anno_code": ["import bisect\nn,k,q = map(int,input().split()) # (0): n=11, k=7, q=2\na = list(map(int,input().split())) # (1): a=[22030887, 861648772, 623690081, 531780763, 476190629, 138767190, 327456372, 934647508, 1102097917, 269743313, 822804784]\nif q == 1: # (2): NO CHANGE\n print(0)\n exit()\nls = [-1,n] # (3): ls=[-1, 11]\nb = sorted(((a[i],i) for i in range(n))) # (4): b=[(22030887, 0), (138767190, 5), (269743313, 9), (327456372, 6), (476190629, 4), (531780763, 3), (623690081, 2), (822804784, 10), (861648772, 1), (934647508, 7), (1102097917, 8)]\nansls = [b[q-1][0]-b[0][0]] # (5): ansls=[116736303]\nfor i,x in enumerate(b): # (6): i=0, x=(22030887, 0) (24): i=1, x=(138767190, 5) ... (349): NO CHANGE\n ins = bisect.bisect_left(ls,i) # (7): ins=1 (25): ins=2 ... (319): ins=11\n ls.insert(ins,i) # (8): ls=[-1, 0, 11] (26): ls=[-1, 0, 1, 11] ... (320): ls=[-1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]\n space = [] # (9): space=[] (27): space=[] ... (321): space=[]\n qc = q-1 # (10): qc=1 (28): qc=1 ... (322): NO CHANGE\n for j in range(1,i+3): # (11): j=1 (13): j=2 ... (347): NO CHANGE\n space.append(ls[j]-ls[j-1]-1) # (12): space=[0] (14): space=[0, 10] ... (346): space=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n for j in range(i+1,n): # (16): j=1 (36): j=2 ... (348): NO CHANGE\n idx = bisect.bisect_left(ls,b[j][1]) # (17): idx=2 (37): idx=3 ... (314): NO CHANGE\n if space[idx-1] < k: # (18): NO CHANGE (38): NO CHANGE ... (315): NO CHANGE\n continue # (111): NO CHANGE (115): NO CHANGE ... (316): NO CHANGE\n qc -= 1 # (19): qc=0 (39): qc=0 ... (85): qc=0\n space[idx-1] -= 1 # (20): space=[0, 9] (40): space=[0, 0, 8] ... (86): space=[0, 0, 0, 0, 6]\n if qc == 0: # (21): NO CHANGE (41): NO CHANGE ... (87): NO CHANGE\n ansls.append(b[j][0]-x[0]) # (22): ansls=[116736303, 116736303] (42): ansls=[116736303, 116736303, 130976123] ... (88): ansls=[116736303, 116736303, 130976123, 57713059, 148734257]\n break # (23): NO CHANGE (43): NO CHANGE ... (89): NO CHANGE\nprint(min(ansls))"], "anno_status": [false], "diff_content": " import bisect\n n,k,q = map(int,input().split())\n a = list(map(int,input().split()))\n if q == 1:\n print(0)\n exit()\n ls = [-1,n]\n b = sorted(((a[i],i) for i in range(n)))\n ansls = [b[q-1][0]-b[0][0]]\n+space = [n]\n+qc = q\n for i,x in enumerate(b):\n- ins = bisect.bisect_left(ls,i)\n- ls.insert(ins,i)\n- space = []\n- qc = q-1\n- for j in range(1,i+3):\n- space.append(ls[j]-ls[j-1]-1)\n- for j in range(i+1,n):\n+ for j in range(i,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\n+ ins = bisect.bisect_left(ls,x[1])\n+ ls.insert(ins,x[1])\n+ space = []\n+ qc = q\n+ for j in range(1,i+3):\n+ space.append(ls[j]-ls[j-1]-1)\n print(min(ansls))\n", "FL_content": " import bisect\n n,k,q = map(int,input().split())\n a = list(map(int,input().split()))\n if q == 1:\n print(0)\n exit()\n ls = [-1,n]\n b = sorted(((a[i],i) for i in range(n)))\n ansls = [b[q-1][0]-b[0][0]]\n for i,x in enumerate(b):\n- ins = bisect.bisect_left(ls,i)\n- ls.insert(ins,i)\n- space = []\n- qc = q-1\n- for j in range(1,i+3):\n- space.append(ls[j]-ls[j-1]-1)\n- for j in range(i+1,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\n print(min(ansls))\n", "added_lines": 9, "removed_lines": 7, "code1_lines": 26 }, { "user_id": "u905582793", "problem_id": "p03343", "submission1_id": "s794503661", "submission2_id": "s930152298", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nn,k,q = map(int,input().split())\na = list(map(int,input().split()))\nif q == 1:\n print(0)\n exit()\nls = [-1,n]\nb = sorted(((a[i],i) for i in range(n)))\nansls = [b[q-1][0]-b[0][0]]\nspace = [n]\nqc = q\nfor i,x in enumerate(b):\n if n-i < k+q-1:\n break\n for j in range(i,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\n ins = bisect.bisect_left(ls,i)\n ls.insert(ins,x[1])\n space = []\n qc = q\n for j in range(1,i+3):\n space.append(ls[j]-ls[j-1]-1)\nprint(min(ansls))", "code2": "import bisect\nn,k,q = map(int,input().split())\na = list(map(int,input().split()))\nif q == 1:\n print(0)\n exit()\nls = [-1,n]\nb = sorted(((a[i],i) for i in range(n)))\nansls = [b[q-1][0]-b[0][0]]\nspace = [n]\nqc = q\nfor i,x in enumerate(b):\n for j in range(i,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\n ins = bisect.bisect_left(ls,x[1])\n ls.insert(ins,x[1])\n space = []\n qc = q\n for j in range(1,i+3):\n space.append(ls[j]-ls[j-1]-1)\nprint(min(ansls))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589754692", "date2": "1589754984", "bleu_score": "0.9502009261981467", "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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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": "11 4 5\n10227698 1631672198 623690081 802524328 575779469 262703497 147009374 971407775 628894325 210342416 520756664\n", "actual_output": "366190828\n", "expected_output": "428770095\n\n", "anno_code": ["import bisect\nn,k,q = map(int,input().split()) # (0): n=11, k=4, q=5\na = list(map(int,input().split())) # (1): a=[10227698, 1631672198, 623690081, 802524328, 575779469, 262703497, 147009374, 971407775, 628894325, 210342416, 520756664]\nif q == 1: # (2): NO CHANGE\n print(0)\n exit()\nls = [-1,n] # (3): ls=[-1, 11]\nb = sorted(((a[i],i) for i in range(n))) # (4): b=[(10227698, 0), (147009374, 6), (210342416, 9), (262703497, 5), (520756664, 10), (575779469, 4), (623690081, 2), (628894325, 8), (802524328, 3), (971407775, 7), (1631672198, 1)]\nansls = [b[q-1][0]-b[0][0]] # (5): ansls=[510528966]\nspace = [n] # (6): space=[11]\nqc = q # (7): qc=5\nfor i,x in enumerate(b): # (8): i=0, x=(10227698, 0) (51): i=1, x=(147009374, 6) ... (203): i=4, x=(520756664, 10)\n if n-i < k+q-1: # (9): NO CHANGE (52): NO CHANGE ... (204): NO CHANGE\n break # (205): NO CHANGE\n for j in range(i,n): # (10): j=0 (16): j=1 ... (180): j=7\n idx = bisect.bisect_left(ls,b[j][1]) # (11): idx=1 (17): NO CHANGE ... (181): NO CHANGE\n if space[idx-1] < k: # (12): NO CHANGE (18): NO CHANGE ... (182): NO CHANGE\n continue # (113): NO CHANGE (123): NO CHANGE ... (139): NO CHANGE\n qc -= 1 # (13): qc=4 (19): qc=3 ... (183): qc=0\n space[idx-1] -= 1 # (14): space=[10] (20): space=[9] ... (184): space=[0, 4, -4, 3]\n if qc == 0: # (15): NO CHANGE (21): NO CHANGE ... (185): NO CHANGE\n ansls.append(b[j][0]-x[0]) # (40): ansls=[510528966, 510528966] (83): ansls=[510528966, 510528966, 428770095] (186): ansls=[510528966, 510528966, 428770095, 366190828]\n break # (41): NO CHANGE (84): NO CHANGE (187): NO CHANGE\n ins = bisect.bisect_left(ls,i) # (42): ins=1 (85): ins=2 ... (188): NO CHANGE\n ls.insert(ins,x[1]) # (43): ls=[-1, 0, 11] (86): ls=[-1, 0, 6, 11] ... (189): ls=[-1, 0, 5, 9, 6, 11]\n space = [] # (44): space=[] (87): space=[] ... (190): space=[]\n qc = q # (45): qc=5 (88): qc=5 ... (191): qc=5\n for j in range(1,i+3): # (46): j=1 (48): j=2 ... (202): NO CHANGE\n space.append(ls[j]-ls[j-1]-1) # (47): space=[0] (49): space=[0, 10] ... (201): space=[0, 4, 3, -4, 4]\nprint(min(ansls))"], "anno_status": [false], "diff_content": " import bisect\n n,k,q = map(int,input().split())\n a = list(map(int,input().split()))\n if q == 1:\n print(0)\n exit()\n ls = [-1,n]\n b = sorted(((a[i],i) for i in range(n)))\n ansls = [b[q-1][0]-b[0][0]]\n space = [n]\n qc = q\n for i,x in enumerate(b):\n- if n-i < k+q-1:\n- break\n for j in range(i,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\n- ins = bisect.bisect_left(ls,i)\n+ ins = bisect.bisect_left(ls,x[1])\n ls.insert(ins,x[1])\n space = []\n qc = q\n for j in range(1,i+3):\n space.append(ls[j]-ls[j-1]-1)\n print(min(ansls))\n", "FL_content": " import bisect\n n,k,q = map(int,input().split())\n a = list(map(int,input().split()))\n if q == 1:\n print(0)\n exit()\n ls = [-1,n]\n b = sorted(((a[i],i) for i in range(n)))\n ansls = [b[q-1][0]-b[0][0]]\n space = [n]\n qc = q\n for i,x in enumerate(b):\n- if n-i < k+q-1:\n- break\n for j in range(i,n):\n idx = bisect.bisect_left(ls,b[j][1])\n if space[idx-1] < k:\n continue\n qc -= 1\n space[idx-1] -= 1\n if qc == 0:\n ansls.append(b[j][0]-x[0])\n break\n- ins = bisect.bisect_left(ls,i)\n ls.insert(ins,x[1])\n space = []\n qc = q\n for j in range(1,i+3):\n space.append(ls[j]-ls[j-1]-1)\n print(min(ansls))\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 30 }, { "user_id": "u227082700", "problem_id": "p03343", "submission1_id": "s528081204", "submission2_id": "s375914239", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k,q=map(int,input().split())\na=list(map(int,input().split()))\nans=10**10\nfor x in a:\n b=[[]]\n can=0\n for i in a:\n if i=k:c+=i[:len(i)-k+1]\n if len(c)=k:c+=i[:len(i)-k+1]\n if len(c)=k:c+=i[:len(i)-k+1] # (46): c=[24979445, 38897442, 210342416, 262703497, 469880797, 476190629, 509544855, 623690081, 628894325] (95): b, c=[469880797, 476190629] ... (561): NO CHANGE\n if len(c)=k:c+=i[:len(i)-k+1]\n if len(c)=k:c+=i[:len(i)-k+1]\n if len(c)= Q:\n T = sorted(Candi)\n ans.append((list(T)[0],list(T)[Q-1]))\n x = B.index(ctr)\n Candi = Candi - set(B[x-K+1:x+K])\n ctr += 1\nprint(min([A[j][0]-A[i][0] for i,j in ans]))", "code2": "import bisect\nN, K, Q = [int(i) for i in input().split()]\nA = [(int(v),i) for i,v in enumerate(input().split())]\nA.sort()\nB = [0]*(N)\nfor i in range(N):\n B[A[i][1]] = i\nC = [A[B[i]][0] for i in range(N)]\nCandi = set(range(N))\nctr = 0\nans = []\nrng = [-1,N]\nwhile len(Candi) >= Q:\n T = sorted(Candi)\n ans.append((list(T)[0],list(T)[Q-1]))\n x = B.index(ctr)\n st = bisect.bisect_left(rng, x)\n Candi = Candi - set(sorted(B[rng[st-1]+1:x]+[2002],reverse = 1)[:K])\\\n - set(sorted(B[x:rng[st]]+[2002],reverse = 1)[:K])- set([B[x]])\n bisect.insort_left(rng, x)\n ctr += 1\nprint(min([A[j][0]-A[i][0] for i,j in ans]))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543862809", "date2": "1543910462", "bleu_score": "0.6761058618440949", "code1_test_status": [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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 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": 103, "input": "11 4 5\n10227698 1631672198 623690081 802524328 575779469 262703497 101880757 971407775 628894325 210342416 520756664\n", "actual_output": "510528966\n", "expected_output": "473898712\n\n", "anno_code": ["N, K, Q = [int(i) for i in input().split()] # (0): N=11, K=4, Q=5\nA = [(int(v),i) for i,v in enumerate(input().split())] # (1): A=[(10227698, 0), (1631672198, 1), (623690081, 2), (802524328, 3), (575779469, 4), (262703497, 5), (101880757, 6), (971407775, 7), (628894325, 8), (210342416, 9), (520756664, 10)]\nA.sort() # (2): A=[(10227698, 0), (101880757, 6), (210342416, 9), (262703497, 5), (520756664, 10), (575779469, 4), (623690081, 2), (628894325, 8), (802524328, 3), (971407775, 7), (1631672198, 1)]\nB = [0]*(N) # (3): B=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(N): # (4): i=0 (6): i=1 ... (26): NO CHANGE\n B[A[i][1]] = i # (5): NO CHANGE (7): B=[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] ... (25): B=[0, 10, 6, 8, 5, 3, 1, 9, 7, 2, 4]\nC = [A[B[i]][0] for i in range(N)] # (27): C=[10227698, 1631672198, 623690081, 802524328, 575779469, 262703497, 101880757, 971407775, 628894325, 210342416, 520756664]\nCandi = set(range(N)) # (28): Candi={0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}\nctr = 0 # (29): ctr=0\nans = [] # (30): ans=[]\nwhile len(Candi) >= Q: # (31): NO CHANGE (37): NO CHANGE (43): NO CHANGE\n T = sorted(Candi) # (32): T=[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10] (38): NO CHANGE\n ans.append((list(T)[0],list(T)[Q-1])) # (33): ans=[(0, 4)] (39): ans=[(0, 4), (0, 4)]\n x = B.index(ctr) # (34): x=0 (40): x=6\n Candi = Candi - set(B[x-K+1:x+K]) # (35): NO CHANGE (41): Candi={0, 10, 4, 6}\n ctr += 1 # (36): ctr=1 (42): ctr=2\nprint(min([A[j][0]-A[i][0] for i,j in ans]))"], "anno_status": [false], "diff_content": "+import bisect\n N, K, Q = [int(i) for i in input().split()]\n A = [(int(v),i) for i,v in enumerate(input().split())]\n A.sort()\n B = [0]*(N)\n for i in range(N):\n B[A[i][1]] = i\n C = [A[B[i]][0] for i in range(N)]\n Candi = set(range(N))\n ctr = 0\n ans = []\n+rng = [-1,N]\n while len(Candi) >= Q:\n T = sorted(Candi)\n ans.append((list(T)[0],list(T)[Q-1]))\n x = B.index(ctr)\n- Candi = Candi - set(B[x-K+1:x+K])\n+ st = bisect.bisect_left(rng, x)\n+ Candi = Candi - set(sorted(B[rng[st-1]+1:x]+[2002],reverse = 1)[:K])\\\n+ - set(sorted(B[x:rng[st]]+[2002],reverse = 1)[:K])- set([B[x]])\n+ bisect.insort_left(rng, x)\n ctr += 1\n print(min([A[j][0]-A[i][0] for i,j in ans]))\n", "FL_content": " N, K, Q = [int(i) for i in input().split()]\n A = [(int(v),i) for i,v in enumerate(input().split())]\n A.sort()\n B = [0]*(N)\n for i in range(N):\n B[A[i][1]] = i\n C = [A[B[i]][0] for i in range(N)]\n Candi = set(range(N))\n ctr = 0\n ans = []\n while len(Candi) >= Q:\n T = sorted(Candi)\n ans.append((list(T)[0],list(T)[Q-1]))\n x = B.index(ctr)\n- Candi = Candi - set(B[x-K+1:x+K])\n ctr += 1\n print(min([A[j][0]-A[i][0] for i,j in ans]))\n", "added_lines": 6, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u218843509", "problem_id": "p03016", "submission1_id": "s203927452", "submission2_id": "s860477292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\nprint(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\n\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\t\n\t\n\tl = mat_dot(l, j, m)\n\t\n\nprint(l[0][0]%m)", "code2": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = max(0, (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\tl = mat_dot(l, j, m)\n\nprint(l[0][0]%m)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560142261", "date2": "1560142791", "bleu_score": "0.9775192490709882", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 57716816346744 7711916121742 23520665\n", "actual_output": "[0, -50004900224993, -50004900224903, -50004900224003, -50004900215003, -50004900125003, -50004899225003, -50004890225003, -50004800225003, -50003900225003, -49994900225003, -49904900225003, -49004900225003, -40004900225003, 638952591813932]\n19930756\n", "expected_output": "22294153\n\n", "anno_code": ["def mat_dot(one, two, mod): # (0): mat_dot=\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod): # (1): mat_pow=\n\tsize = len(mat) # (96): size=3 (111): size=3 ... (291): size=3\n\tres = [[0 for _ in range(size)] for _ in range(size)] # (97): res (112): res ... (292): res\n\tfor i in range(size): # (98): i=0 (100): i=1 ... (299): NO CHANGE\n\t\tres[i][i] = 1 # (99): res (101): res ... (298): res\n\tcnt = 0 # (105): cnt=0 (120): cnt=0 ... (300): cnt=0\n\twhile (1<, mat_pow=, l=[[0, 20999204, 1]], a=57716816346744, b=7711916121742, m=23520665, c=73140648590228, n=14, dgt=[0, -50004900224993, -50004900224903, -50004900224003, -50004900215003, -50004900125003, -50004899225003, -50004890225003, -50004800225003, -50003900225003, -49994900225003, -49904900225003, -49004900225003, -40004900225003, 638952591813932], i=14, d_sum=[0, 4588105141687978, 4688114942137784, 4838129642809793, 5038149243669805, 5288173744294820, 5588203139644838, 5938237371219859, 6338275773019883, 6788310875044910, 7288259877294940, 7837213779769973, 8425272582470009, 8945336285395048, 0], fr=[0, 57716816346744, -385633596211165962962751062, -771267192421695570290892088, -1156900788625284453109465314, -1542534384759466090832360540, -1928167980199575277598475766, -2313801568698959954796790992, -2699435087791099536317106218, -3085067912810788161057421444, -3470693797105967217997736670, -3856250274156050596938051896, -4241112678755177195878367122, -4619034358844735994818682348, -4927548793838616793758997574], d=1, k=[[10, 0, 0], [1, 1, 0], [0, 7522872, 1]], j (121): mat_dot=, mat_pow=, l=[[0, 20999204, 1]], a=57716816346744, b=7711916121742, m=23520665, c=73140648590228, n=14, dgt=[0, -50004900224993, -50004900224903, -50004900224003, -50004900215003, -50004900125003, -50004899225003, -50004890225003, -50004800225003, -50003900225003, -49994900225003, -49904900225003, -49004900225003, -40004900225003, 638952591813932], i=14, d_sum=[0, 4588105141687978, 4688114942137784, 4838129642809793, 5038149243669805, 5288173744294820, 5588203139644838, 5938237371219859, 6338275773019883, 6788310875044910, 7288259877294940, 7837213779769973, 8425272582470009, 8945336285395048, 0], fr=[0, 57716816346744, -385633596211165962962751062, -771267192421695570290892088, -1156900788625284453109465314, -1542534384759466090832360540, -1928167980199575277598475766, -2313801568698959954796790992, -2699435087791099536317106218, -3085067912810788161057421444, -3470693797105967217997736670, -3856250274156050596938051896, -4241112678755177195878367122, -4619034358844735994818682348, -4927548793838616793758997574], d=2, k=[[100, 0, 0], [1, 1, 0], [0, 7522872, 1]], j ... (527): mat_dot=, mat_pow=, l=[[0, 20999204, 1]], a=57716816346744, b=7711916121742, m=23520665, c=73140648590228, n=14, dgt=[0, -50004900224993, -50004900224903, -50004900224003, -50004900215003, -50004900125003, -50004899225003, -50004890225003, -50004800225003, -50003900225003, -49994900225003, -49904900225003, -49004900225003, -40004900225003, 638952591813932], i=14, d_sum=[0, 4588105141687978, 4688114942137784, 4838129642809793, 5038149243669805, 5288173744294820, 5588203139644838, 5938237371219859, 6338275773019883, 6788310875044910, 7288259877294940, 7837213779769973, 8425272582470009, 8945336285395048, 0], fr=[0, 57716816346744, -385633596211165962962751062, -771267192421695570290892088, -1156900788625284453109465314, -1542534384759466090832360540, -1928167980199575277598475766, -2313801568698959954796790992, -2699435087791099536317106218, -3085067912810788161057421444, -3470693797105967217997736670, -3856250274156050596938051896, -4241112678755177195878367122, -4619034358844735994818682348, -4927548793838616793758997574], d=14, k=[[11099300, 0, 0], [1, 1, 0], [0, 7522872, 1]], j\n\t\tif (exp>>cnt)&1: # (302): NO CHANGE (306): NO CHANGE ... (523): NO CHANGE\n\t\t\tres = mat_dot(res, mat, mod) # (311): res (316): res ... (524): res\n\t\tmat = mat_dot(mat, mat, mod) # (303): mat (307): mat ... (525): mat\n\t\tcnt += 1 # (304): cnt=1 (308): cnt=2 ... (526): cnt=50\n\treturn res\n\nl, a, b, m = map(int, input().split()) # (2): l=3, a=57716816346744, b=7711916121742, m=23520665\nc = a + (l-1)*b # (3): c=73140648590228\nn = len(str(c)) # (4): n=14\ndgt = [0 for _ in range(n+1)] # (5): dgt=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(1, n): # (6): i=1 (8): i=2 ... (32): NO CHANGE\n\tdgt[i] = (10**i -a+b-1) # (7): dgt=[0, -50004900224993, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (9): dgt=[0, -50004900224993, -50004900224903, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (31): dgt=[0, -50004900224993, -50004900224903, -50004900224003, -50004900215003, -50004900125003, -50004899225003, -50004890225003, -50004800225003, -50003900225003, -49994900225003, -49904900225003, -49004900225003, -40004900225003, 0]\ndgt[n] = l-sum(dgt) # (33): dgt=[0, -50004900224993, -50004900224903, -50004900224003, -50004900215003, -50004900125003, -50004899225003, -50004890225003, -50004800225003, -50003900225003, -49994900225003, -49904900225003, -49004900225003, -40004900225003, 638952591813932]\nprint(dgt) # (34): NO CHANGE\nd_sum = [0 for _ in range(n+1)] # (35): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n-1, 0, -1): # (36): NO CHANGE (38): i=12 ... (62): NO CHANGE\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1) # (37): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8945336285395048, 0] (39): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8425272582470009, 8945336285395048, 0] ... (61): d_sum=[0, 4588105141687978, 4688114942137784, 4838129642809793, 5038149243669805, 5288173744294820, 5588203139644838, 5938237371219859, 6338275773019883, 6788310875044910, 7288259877294940, 7837213779769973, 8425272582470009, 8945336285395048, 0]\n\nfr = [0 for _ in range(n+1)] # (63): fr=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfr[1] = a # (64): fr=[0, 57716816346744, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(2, n+1): # (65): i=2 (67): i=3 ... (91): NO CHANGE\n\tfr[i] = fr[i-1] + b*dgt[i-1] # (66): fr=[0, 57716816346744, -385633596211165962962751062, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (68): fr=[0, 57716816346744, -385633596211165962962751062, -771267192421695570290892088, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (90): fr=[0, 57716816346744, -385633596211165962962751062, -771267192421695570290892088, -1156900788625284453109465314, -1542534384759466090832360540, -1928167980199575277598475766, -2313801568698959954796790992, -2699435087791099536317106218, -3085067912810788161057421444, -3470693797105967217997736670, -3856250274156050596938051896, -4241112678755177195878367122, -4619034358844735994818682348, -4927548793838616793758997574]\n\nl = [[0, a%m, 1]] # (92): l\nfor d in range(1, n+1): # (93): d=1 (108): d=2 ... (529): NO CHANGE\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]] # (94): k (109): k ... (289): k\n\tj = mat_pow(k, dgt[d], m) # (95): mat=[[10, 0, 0], [1, 1, 0], [0, 7522872, 1]], exp=-50004900224993, mod=23520665 (110): mat=[[100, 0, 0], [1, 1, 0], [0, 7522872, 1]], exp=-50004900224903, mod=23520665 ... (290): mat, exp=638952591813932, mod=23520665\n\t\n\t\n\tl = mat_dot(l, j, m) # (107): NO CHANGE (122): NO CHANGE ... (528): l\n\t\n\nprint(l[0][0]%m)"], "anno_status": [false], "diff_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b-1) \n+\tdgt[i] = max(0, (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n-print(dgt)\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n-\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n-\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n-\t\n-\t\n \tl = mat_dot(l, j, m)\n-\t\n \n print(l[0][0]%m)\n", "FL_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n-print(dgt)\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n-\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n-\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n-\t\n-\t\n \tl = mat_dot(l, j, m)\n-\t\n \n print(l[0][0]%m)\n", "added_lines": 1, "removed_lines": 7, "code1_lines": 43 }, { "user_id": "u218843509", "problem_id": "p03016", "submission1_id": "s333875828", "submission2_id": "s860477292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nans = 0\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = (10**i -a+b) \ndgt[n] = l-sum(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\tl = mat_dot(l, j, m)\n\nprint(l[0][0])", "code2": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = max(0, (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\tl = mat_dot(l, j, m)\n\nprint(l[0][0]%m)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560141785", "date2": "1560142791", "bleu_score": "0.9853797537228117", "code1_test_status": [1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 103, "input": "4 42030388707156 321306038787033 9413723\n", "actual_output": "3778830\n", "expected_output": "6739839\n\n", "anno_code": ["def mat_dot(one, two, mod): # (0): mat_dot=\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod): # (1): mat_pow=\n\tsize = len(mat) # (108): size=3 (351): size=3 ... (3670): size=3\n\tres = [[0 for _ in range(size)] for _ in range(size)] # (109): res (352): res ... (3671): res\n\tfor i in range(size): # (110): i=0 (112): i=1 ... (3678): NO CHANGE\n\t\tres[i][i] = 1 # (111): res (113): res ... (3677): res\n\tcnt = 0 # (117): cnt=0 (360): cnt=0 ... (3679): cnt=0\n\twhile (1<, mat_pow=, l=[[3778830, 3370785, 1]], a=42030388707156, b=321306038787033, m=9413723, c=1005948505068255, ans=0, n=16, dgt=[0, 279275650079887, 279275650079977, 279275650080877, 279275650089877, 279275650179877, 279275651079877, 279275660079877, 279275750079877, 279276650079877, 279285650079877, 279375650079877, 280275650079877, 289275650079877, 379275650079877, 1279275650079877, -5300245862309261], i=16, d_sum=[0, -35026921560899613, -35585472861059567, -36423299811302198, -37540402411661706, -38936780662561091, -40612434569040353, -42567364189599492, -44801570190238508, -47315060040957401, -50107916541756171, -53181048692634818, -56544356493593342, -60304939944631743, -65614799045750021, -84803933796948176, 0], fr=[0, 42030388707156, 89732952856842070197418412427, 179465905713713015907938950668, 269198858570873137053367818609, 358931811430925012547879983550, 448664764319894431533225118491, 538397717498039285426899953432, 628130673567938488403871788373, 717863658555381182213813623314, 807596932718258784353455458255, 897333098635485469790097293196, 987098182096202988196739128137, 1077152440991828836303380963078, 1170098454236537981410022798019, 1291962010972080096516664632960, 1703001002615951911623306467901], d=16, k=[[8867244, 0, 0], [1, 1, 0], [0, 8361961, 1]], j\n\t\tif (exp>>cnt)&1: # (119): NO CHANGE (124): NO CHANGE ... (3661): NO CHANGE\n\t\t\tres = mat_dot(res, mat, mod) # (120): res (125): res ... (3662): res\n\t\tmat = mat_dot(mat, mat, mod) # (121): mat (126): mat ... (3663): mat\n\t\tcnt += 1 # (122): cnt=1 (127): cnt=2 ... (3664): cnt=51\n\treturn res\n\nl, a, b, m = map(int, input().split()) # (2): l=4, a=42030388707156, b=321306038787033, m=9413723\nc = a + (l-1)*b # (3): c=1005948505068255\nans = 0 # (4): ans=0\nn = len(str(c)) # (5): n=16\ndgt = [0 for _ in range(n+1)] # (6): dgt=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(1, n): # (7): i=1 (9): i=2 ... (37): NO CHANGE\n\tdgt[i] = (10**i -a+b) # (8): dgt=[0, 279275650079887, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (10): dgt=[0, 279275650079887, 279275650079977, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (36): dgt=[0, 279275650079887, 279275650079977, 279275650080877, 279275650089877, 279275650179877, 279275651079877, 279275660079877, 279275750079877, 279276650079877, 279285650079877, 279375650079877, 280275650079877, 289275650079877, 379275650079877, 1279275650079877, 0]\ndgt[n] = l-sum(dgt) # (38): dgt=[0, 279275650079887, 279275650079977, 279275650080877, 279275650089877, 279275650179877, 279275651079877, 279275660079877, 279275750079877, 279276650079877, 279285650079877, 279375650079877, 280275650079877, 289275650079877, 379275650079877, 1279275650079877, -5300245862309261]\nd_sum = [0 for _ in range(n+1)] # (39): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n-1, 0, -1): # (40): NO CHANGE (42): i=14 ... (70): NO CHANGE\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1) # (41): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -84803933796948176, 0] (43): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -65614799045750021, -84803933796948176, 0] ... (69): d_sum=[0, -35026921560899613, -35585472861059567, -36423299811302198, -37540402411661706, -38936780662561091, -40612434569040353, -42567364189599492, -44801570190238508, -47315060040957401, -50107916541756171, -53181048692634818, -56544356493593342, -60304939944631743, -65614799045750021, -84803933796948176, 0]\nfr = [0 for _ in range(n+1)] # (71): fr=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfr[1] = a # (72): fr=[0, 42030388707156, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(2, n+1): # (73): i=2 (75): i=3 ... (103): NO CHANGE\n\tfr[i] = fr[i-1] + b*dgt[i-1] # (74): fr=[0, 42030388707156, 89732952856842070197418412427, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (76): fr=[0, 42030388707156, 89732952856842070197418412427, 179465905713713015907938950668, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (102): fr=[0, 42030388707156, 89732952856842070197418412427, 179465905713713015907938950668, 269198858570873137053367818609, 358931811430925012547879983550, 448664764319894431533225118491, 538397717498039285426899953432, 628130673567938488403871788373, 717863658555381182213813623314, 807596932718258784353455458255, 897333098635485469790097293196, 987098182096202988196739128137, 1077152440991828836303380963078, 1170098454236537981410022798019, 1291962010972080096516664632960, 1703001002615951911623306467901]\nl = [[0, a%m, 1]] # (104): l\nfor d in range(1, n+1): # (105): d=1 (348): d=2 ... (3682): NO CHANGE\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]] # (106): k (349): k ... (3668): k\n\tj = mat_pow(k, dgt[d], m) # (107): mat=[[10, 0, 0], [1, 1, 0], [0, 8361961, 1]], exp=279275650079887, mod=9413723 (350): mat=[[100, 0, 0], [1, 1, 0], [0, 8361961, 1]], exp=279275650079977, mod=9413723 ... (3669): mat, exp=-5300245862309261, mod=9413723\n\tl = mat_dot(l, j, m) # (347): l (590): l ... (3681): NO CHANGE\n\nprint(l[0][0])"], "anno_status": [false], "diff_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n-ans = 0\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b) \n+\tdgt[i] = max(0, (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n \tl = mat_dot(l, j, m)\n \n-print(l[0][0])\n+print(l[0][0]%m)\n", "FL_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n-ans = 0\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b) \n dgt[n] = l-sum(dgt)\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n \tl = mat_dot(l, j, m)\n \n-print(l[0][0])\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 38 }, { "user_id": "u218843509", "problem_id": "p03016", "submission1_id": "s610052105", "submission2_id": "s860477292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nans = 0\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\tl = mat_dot(l, j, m)\n\nprint(l[0][0])", "code2": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = max(0, (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\tl = mat_dot(l, j, m)\n\nprint(l[0][0]%m)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560141851", "date2": "1560142791", "bleu_score": "0.9890369849429282", "code1_test_status": [1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 7, "total_score": 103, "input": "15 65472025464171 34316611981321 23143760\n", "actual_output": "5079378\n", "expected_output": "15163385\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n-ans = 0\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b-1) \n+\tdgt[i] = max(0, (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n \tl = mat_dot(l, j, m)\n \n-print(l[0][0])\n+print(l[0][0]%m)\n", "FL_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n-ans = 0\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n \tl = mat_dot(l, j, m)\n \n-print(l[0][0])\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 38 }, { "user_id": "u218843509", "problem_id": "p03016", "submission1_id": "s341674725", "submission2_id": "s860477292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\n\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\n\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\t\n\t\n\tl = mat_dot(l, j, m)\n\t\n\nprint(l[0][0]%m)", "code2": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = max(0, (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\tl = mat_dot(l, j, m)\n\nprint(l[0][0]%m)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560142349", "date2": "1560142791", "bleu_score": "0.9867105077235911", "code1_test_status": [1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 7, "total_score": 103, "input": "1 6082488590097 1634888304420825 26385493\n", "actual_output": "16971997\n", "expected_output": "25587258\n\n", "anno_code": ["def mat_dot(one, two, mod): # (0): mat_dot=\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod): # (1): mat_pow=\n\tsize = len(mat) # (89): size=3 (332): size=3 ... (3029): size=3\n\tres = [[0 for _ in range(size)] for _ in range(size)] # (90): res (333): res ... (3030): res\n\tfor i in range(size): # (91): i=0 (93): i=1 ... (3037): NO CHANGE\n\t\tres[i][i] = 1 # (92): res (94): res ... (3036): res\n\tcnt = 0 # (98): cnt=0 (341): cnt=0 ... (3038): cnt=0\n\twhile (1<, mat_pow=, l=[[16971997, 24960939, 1]], a=6082488590097, b=1634888304420825, m=26385493, c=6082488590097, n=13, dgt=[0, 1628805815830737, 1628805815830827, 1628805815831727, 1628805815840727, 1628805815930727, 1628805816830727, 1628805825830727, 1628805915830727, 1628806815830727, 1628815815830727, 1628905815830727, 1629805815830727, -19546780901079833], i=13, d_sum=[0, -128676894018528650, -131934505650190304, -136820923097685485, -143336146361048393, -151480175440702028, -161253010341686390, -172654651122501479, -185685098449147295, -200344359791623838, -216632517949931108, -234550481924069105, -254108151714037829, 0], fr=[0, 6082488590097, 2662915578474292178529506488122, 5325831156948731490923922260397, 7988746735424642202792316775172, 10651662313915266909400498714947, 13314577892553031563406554904722, 15977493472662195691391353594497, 18640409067485354559163577284272, 21303324809448460824810050974047, 23966242022811041069199024663822, 26629173950168361101012998353597, 29292253017473079007076972043372, 31956803484251775655640945733147], d=13, k=[[3694972, 0, 0], [1, 1, 0], [0, 17859770, 1]], j\n\t\tif (exp>>cnt)&1: # (100): NO CHANGE (105): NO CHANGE ... (3020): NO CHANGE\n\t\t\tres = mat_dot(res, mat, mod) # (101): res (118): res ... (3021): res\n\t\tmat = mat_dot(mat, mat, mod) # (102): mat (106): mat ... (3022): mat\n\t\tcnt += 1 # (103): cnt=1 (107): cnt=2 ... (3023): cnt=51\n\treturn res\n\nl, a, b, m = map(int, input().split()) # (2): l=1, a=6082488590097, b=1634888304420825, m=26385493\nc = a + (l-1)*b # (3): c=6082488590097\nn = len(str(c)) # (4): n=13\ndgt = [0 for _ in range(n+1)] # (5): dgt=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(1, n): # (6): i=1 (8): i=2 ... (30): NO CHANGE\n\tdgt[i] = (10**i -a+b-1) # (7): dgt=[0, 1628805815830737, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (9): dgt=[0, 1628805815830737, 1628805815830827, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (29): dgt=[0, 1628805815830737, 1628805815830827, 1628805815831727, 1628805815840727, 1628805815930727, 1628805816830727, 1628805825830727, 1628805915830727, 1628806815830727, 1628815815830727, 1628905815830727, 1629805815830727, 0]\ndgt[n] = l-sum(dgt) # (31): dgt=[0, 1628805815830737, 1628805815830827, 1628805815831727, 1628805815840727, 1628805815930727, 1628805816830727, 1628805825830727, 1628805915830727, 1628806815830727, 1628815815830727, 1628905815830727, 1629805815830727, -19546780901079833]\n\nd_sum = [0 for _ in range(n+1)] # (32): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n-1, 0, -1): # (33): NO CHANGE (35): i=11 ... (57): NO CHANGE\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1) # (34): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -254108151714037829, 0] (36): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -234550481924069105, -254108151714037829, 0] ... (56): d_sum=[0, -128676894018528650, -131934505650190304, -136820923097685485, -143336146361048393, -151480175440702028, -161253010341686390, -172654651122501479, -185685098449147295, -200344359791623838, -216632517949931108, -234550481924069105, -254108151714037829, 0]\n\nfr = [0 for _ in range(n+1)] # (58): fr=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfr[1] = a # (59): fr=[0, 6082488590097, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(2, n+1): # (60): i=2 (62): i=3 ... (84): NO CHANGE\n\tfr[i] = fr[i-1] + b*dgt[i-1] # (61): fr=[0, 6082488590097, 2662915578474292178529506488122, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (63): fr=[0, 6082488590097, 2662915578474292178529506488122, 5325831156948731490923922260397, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (83): fr=[0, 6082488590097, 2662915578474292178529506488122, 5325831156948731490923922260397, 7988746735424642202792316775172, 10651662313915266909400498714947, 13314577892553031563406554904722, 15977493472662195691391353594497, 18640409067485354559163577284272, 21303324809448460824810050974047, 23966242022811041069199024663822, 26629173950168361101012998353597, 29292253017473079007076972043372, 31956803484251775655640945733147]\n\nl = [[0, a%m, 1]] # (85): l\nfor d in range(1, n+1): # (86): d=1 (329): d=2 ... (3041): NO CHANGE\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]] # (87): k (330): k ... (3027): k\n\tj = mat_pow(k, dgt[d], m) # (88): mat=[[10, 0, 0], [1, 1, 0], [0, 17859770, 1]], exp=1628805815830737, mod=26385493 (331): mat=[[100, 0, 0], [1, 1, 0], [0, 17859770, 1]], exp=1628805815830827, mod=26385493 ... (3028): mat, exp=-19546780901079833, mod=26385493\n\t\n\t\n\tl = mat_dot(l, j, m) # (328): l (572): l ... (3040): NO CHANGE\n\t\n\nprint(l[0][0]%m)"], "anno_status": [false], "diff_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b-1) \n+\tdgt[i] = max(0, (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n-\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n-\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n-\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n-\t\n-\t\n \tl = mat_dot(l, j, m)\n-\t\n \n print(l[0][0]%m)\n", "FL_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n-\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n-\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n-\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n-\t\n-\t\n \tl = mat_dot(l, j, m)\n-\t\n \n print(l[0][0]%m)\n", "added_lines": 1, "removed_lines": 7, "code1_lines": 43 }, { "user_id": "u218843509", "problem_id": "p03016", "submission1_id": "s965682950", "submission2_id": "s860477292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nans = 0\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = (10**i -a+b -1) \ndgt[n] = l-sum(dgt)\n\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\n\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\t\n\t\n\tl = mat_dot(l, j, m)\n\t\n\nprint(l[0][0])", "code2": "def mat_dot(one, two, mod):\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod):\n\tsize = len(mat)\n\tres = [[0 for _ in range(size)] for _ in range(size)]\n\tfor i in range(size):\n\t\tres[i][i] = 1\n\tcnt = 0\n\twhile (1<>cnt)&1:\n\t\t\tres = mat_dot(res, mat, mod)\n\t\tmat = mat_dot(mat, mat, mod)\n\t\tcnt += 1\n\treturn res\n\nl, a, b, m = map(int, input().split())\nc = a + (l-1)*b\nn = len(str(c))\ndgt = [0 for _ in range(n+1)]\nfor i in range(1, n):\n\tdgt[i] = max(0, (10**i -a+b-1) \ndgt[n] = l-sum(dgt)\nd_sum = [0 for _ in range(n+1)]\nfor i in range(n-1, 0, -1):\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\nfr = [0 for _ in range(n+1)]\nfr[1] = a\nfor i in range(2, n+1):\n\tfr[i] = fr[i-1] + b*dgt[i-1]\nl = [[0, a%m, 1]]\nfor d in range(1, n+1):\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n\tj = mat_pow(k, dgt[d], m)\n\tl = mat_dot(l, j, m)\n\nprint(l[0][0]%m)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560140416", "date2": "1560142791", "bleu_score": "0.9751258547196846", "code1_test_status": [1, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": 7, "total_score": 103, "input": "15 21284366351213 247667443425780 8854374\n", "actual_output": "8604129\n", "expected_output": "3545109\n\n", "anno_code": ["def mat_dot(one, two, mod): # (0): mat_dot=\n\treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n\ndef mat_pow(mat, exp, mod): # (1): mat_pow=\n\tsize = len(mat) # (108): size=3 (339): size=3 ... (3629): size=3\n\tres = [[0 for _ in range(size)] for _ in range(size)] # (109): res (340): res ... (3630): res\n\tfor i in range(size): # (110): i=0 (112): i=1 ... (3637): NO CHANGE\n\t\tres[i][i] = 1 # (111): res (113): res ... (3636): res\n\tcnt = 0 # (117): cnt=0 (348): cnt=0 ... (3638): cnt=0\n\twhile (1<, mat_pow=, l=[[8604129, 5277227, 1]], a=21284366351213, b=247667443425780, m=8854374, c=3488628574312133, ans=0, n=16, dgt=[0, 226383077074576, 226383077074666, 226383077075566, 226383077084566, 226383077174566, 226383078074566, 226383087074566, 226383177074566, 226384077074566, 226393077074566, 226483077074566, 227383077074566, 236383077074566, 326383077074566, 1226383077074566, -4506857267229585], i=16, d_sum=[0, -28626920227256806, -29079686381406138, -29758835612632836, -30664367920971100, -31796283306843930, -33154581775291326, -34739263384813288, -36550328801409816, -38587785495080910, -40851716265826570, -43343030113646796, -46071627038541588, -49144607040510946, -53713970119554870, -72109716275673360, 0], fr=[0, 21284366351213, 56067717933921566070347320493, 112135435867865400926236609973, 168203153802032136481209101453, 224270871738427879027013612933, 280338589697113691481138324413, 336406307878700203018465035893, 392474028289293705387811747373, 448541770989957116077358458853, 504609736591319609968905170333, 560679931199672935880451881813, 616772415877934581991998593293, 673087801255279430103545304773, 731632193623456298215092016253, 812466655899953366326638727733, 1116201817259652434438185439213], d=16, k=[[4319068, 0, 0], [1, 1, 0], [0, 3960102, 1]], j\n\t\tif (exp>>cnt)&1: # (119): NO CHANGE (123): NO CHANGE ... (3620): NO CHANGE\n\t\t\tres = mat_dot(res, mat, mod) # (136): res (149): res ... (3621): res\n\t\tmat = mat_dot(mat, mat, mod) # (120): mat (124): mat ... (3622): mat\n\t\tcnt += 1 # (121): cnt=1 (125): cnt=2 ... (3623): cnt=51\n\treturn res\n\nl, a, b, m = map(int, input().split()) # (2): l=15, a=21284366351213, b=247667443425780, m=8854374\nc = a + (l-1)*b # (3): c=3488628574312133\nans = 0 # (4): ans=0\nn = len(str(c)) # (5): n=16\ndgt = [0 for _ in range(n+1)] # (6): dgt=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(1, n): # (7): i=1 (9): i=2 ... (37): NO CHANGE\n\tdgt[i] = (10**i -a+b -1) # (8): dgt=[0, 226383077074576, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (10): dgt=[0, 226383077074576, 226383077074666, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (36): dgt=[0, 226383077074576, 226383077074666, 226383077075566, 226383077084566, 226383077174566, 226383078074566, 226383087074566, 226383177074566, 226384077074566, 226393077074566, 226483077074566, 227383077074566, 236383077074566, 326383077074566, 1226383077074566, 0]\ndgt[n] = l-sum(dgt) # (38): dgt=[0, 226383077074576, 226383077074666, 226383077075566, 226383077084566, 226383077174566, 226383078074566, 226383087074566, 226383177074566, 226384077074566, 226393077074566, 226483077074566, 227383077074566, 236383077074566, 326383077074566, 1226383077074566, -4506857267229585]\n\nd_sum = [0 for _ in range(n+1)] # (39): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n-1, 0, -1): # (40): NO CHANGE (42): i=14 ... (70): NO CHANGE\n\td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1) # (41): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -72109716275673360, 0] (43): d_sum=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -53713970119554870, -72109716275673360, 0] ... (69): d_sum=[0, -28626920227256806, -29079686381406138, -29758835612632836, -30664367920971100, -31796283306843930, -33154581775291326, -34739263384813288, -36550328801409816, -38587785495080910, -40851716265826570, -43343030113646796, -46071627038541588, -49144607040510946, -53713970119554870, -72109716275673360, 0]\n\nfr = [0 for _ in range(n+1)] # (71): fr=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfr[1] = a # (72): fr=[0, 21284366351213, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(2, n+1): # (73): i=2 (75): i=3 ... (103): NO CHANGE\n\tfr[i] = fr[i-1] + b*dgt[i-1] # (74): fr=[0, 21284366351213, 56067717933921566070347320493, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (76): fr=[0, 21284366351213, 56067717933921566070347320493, 112135435867865400926236609973, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (102): fr=[0, 21284366351213, 56067717933921566070347320493, 112135435867865400926236609973, 168203153802032136481209101453, 224270871738427879027013612933, 280338589697113691481138324413, 336406307878700203018465035893, 392474028289293705387811747373, 448541770989957116077358458853, 504609736591319609968905170333, 560679931199672935880451881813, 616772415877934581991998593293, 673087801255279430103545304773, 731632193623456298215092016253, 812466655899953366326638727733, 1116201817259652434438185439213]\n\nl = [[0, a%m, 1]] # (104): l\nfor d in range(1, n+1): # (105): d=1 (336): d=2 ... (3641): NO CHANGE\n\tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]] # (106): k (337): k ... (3627): k\n\tj = mat_pow(k, dgt[d], m) # (107): mat=[[10, 0, 0], [1, 1, 0], [0, 3960102, 1]], exp=226383077074576, mod=8854374 (338): mat=[[100, 0, 0], [1, 1, 0], [0, 3960102, 1]], exp=226383077074666, mod=8854374 ... (3628): mat, exp=-4506857267229585, mod=8854374\n\t\n\t\n\tl = mat_dot(l, j, m) # (335): l (569): l ... (3640): NO CHANGE\n\t\n\nprint(l[0][0])"], "anno_status": [false], "diff_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n-ans = 0\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b -1) \n+\tdgt[i] = max(0, (10**i -a+b-1) \n dgt[n] = l-sum(dgt)\n-\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n-\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n-\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n-\t\n-\t\n \tl = mat_dot(l, j, m)\n-\t\n \n-print(l[0][0])\n+print(l[0][0]%m)\n", "FL_content": " def mat_dot(one, two, mod):\n \treturn [[sum([(one[i][k]*two[k][j])%mod for k in range(len(two))])%mod for j in range(len(two[0]))] for i in range(len(one))]\n \n def mat_pow(mat, exp, mod):\n \tsize = len(mat)\n \tres = [[0 for _ in range(size)] for _ in range(size)]\n \tfor i in range(size):\n \t\tres[i][i] = 1\n \tcnt = 0\n \twhile (1<>cnt)&1:\n \t\t\tres = mat_dot(res, mat, mod)\n \t\tmat = mat_dot(mat, mat, mod)\n \t\tcnt += 1\n \treturn res\n \n l, a, b, m = map(int, input().split())\n c = a + (l-1)*b\n-ans = 0\n n = len(str(c))\n dgt = [0 for _ in range(n+1)]\n for i in range(1, n):\n-\tdgt[i] = (10**i -a+b -1) \n dgt[n] = l-sum(dgt)\n-\n d_sum = [0 for _ in range(n+1)]\n for i in range(n-1, 0, -1):\n \td_sum[i] = d_sum[i+1] + dgt[i+1]*(i+1)\n-\n fr = [0 for _ in range(n+1)]\n fr[1] = a\n for i in range(2, n+1):\n \tfr[i] = fr[i-1] + b*dgt[i-1]\n-\n l = [[0, a%m, 1]]\n for d in range(1, n+1):\n \tk = [[(10**d)%m, 0, 0], [1, 1, 0], [0, b%m, 1]]\n \tj = mat_pow(k, dgt[d], m)\n-\t\n-\t\n \tl = mat_dot(l, j, m)\n-\t\n \n-print(l[0][0])\n", "added_lines": 2, "removed_lines": 9, "code1_lines": 44 }, { "user_id": "u941434715", "problem_id": "p03965", "submission1_id": "s384931577", "submission2_id": "s229988180", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\n\ns = input()\nans = math.ceil(len(s)/2) - s.count(\"p\")\nprint(ans)", "code2": "\nimport math\n\ns = input()\nans = math.floor(len(s)/2) - s.count(\"p\")\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587334951", "date2": "1587335014", "bleu_score": "0.9177796938889471", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "pgg\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\nimport math\n\ns = input() # (0): s=pgg\nans = math.ceil(len(s)/2) - s.count(\"p\") # (1): ans=1\nprint(ans)"], "anno_status": [true], "diff_content": " \n import math\n \n s = input()\n-ans = math.ceil(len(s)/2) - s.count(\"p\")\n+ans = math.floor(len(s)/2) - s.count(\"p\")\n print(ans)\n", "FL_content": " \n import math\n \n s = input()\n-ans = math.ceil(len(s)/2) - s.count(\"p\")\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u652057333", "problem_id": "p03965", "submission1_id": "s382699364", "submission2_id": "s163433465", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = str(input().rstrip())\n\ndef battle(s1, s2):\n l = {'g': {'g': 0, 'p': -1}, 'p': {'g': 1, 'p': 0}}\n return l[s1][s2]\n\nhist = ['g']\n\ng = 1\np = 0\nans = 0\nif s[0] == 'p':\n ans = -1\nfor i in range(1, len(s)):\n cur = 'g'\n if s[i] == 'g':\n if p < g:\n cur = 'p'\n if cur == 'p':\n p += 1\n else:\n g += 1\n hist.append(cur)\n ans += battle(cur, s[i])\n\n\n\nprint(ans)\n", "code2": "s = str(input().rstrip())\n\ndef battle(s1, s2):\n l = {'g': {'g': 0, 'p': -1}, 'p': {'g': 1, 'p': 0}}\n return l[s1][s2]\n\nhist = ['g']\n\ng = 1\np = 0\nans = 0\nif s[0] == 'p':\n ans = -1\nfor i in range(1, len(s)):\n cur = 'g'\n if s[i] == 'g':\n if p < g:\n cur = 'p'\n if s[i] == 'p':\n if p < g:\n cur = 'p'\n\n if cur == 'p':\n p += 1\n else:\n g += 1\n hist.append(cur)\n ans += battle(cur, s[i])\n\n\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586667688", "date2": "1586667779", "bleu_score": "0.8706248812861916", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 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, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 67, "total_score": 101, "input": "pggggggpgp\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["s = str(input().rstrip()) # (0): s=pggggggpgp\n\ndef battle(s1, s2): # (1): battle=\n l = {'g': {'g': 0, 'p': -1}, 'p': {'g': 1, 'p': 0}} # (17): s=pggggggpgp, battle=, hist=['g', 'p'], g=1, p=1, ans=0, i=1, cur=p (26): s=pggggggpgp, battle=, hist=['g', 'p', 'g'], g=2, p=1, ans=0, i=2, cur=g ... (90): s=pggggggpgp, battle=, hist=['g', 'p', 'g', 'p', 'g', 'p', 'g', 'g', 'p', 'g'], g=6, p=4, ans=1, i=9, cur=g\n return l[s1][s2]\n\nhist = ['g'] # (2): hist=['g']\n\ng = 1 # (3): g=1\np = 0 # (4): p=0\nans = 0 # (5): ans=0\nif s[0] == 'p': # (6): NO CHANGE\n ans = -1 # (7): ans=-1\nfor i in range(1, len(s)): # (8): i=1 (18): i=2 ... (91): NO CHANGE\n cur = 'g' # (9): cur=g (19): cur=g ... (84): cur=g\n if s[i] == 'g': # (10): NO CHANGE (20): NO CHANGE ... (85): NO CHANGE\n if p < g: # (11): NO CHANGE (21): NO CHANGE ... (76): NO CHANGE\n cur = 'p' # (12): cur=p (31): cur=p ... (77): cur=p\n if cur == 'p': # (13): NO CHANGE (22): NO CHANGE ... (86): NO CHANGE\n p += 1 # (14): p=1 (33): p=2 ... (79): p=4\n else:\n g += 1 # (23): g=2 (42): g=3 ... (87): g=6\n hist.append(cur) # (15): hist=['g', 'p'] (24): hist=['g', 'p', 'g'] ... (88): hist=['g', 'p', 'g', 'p', 'g', 'p', 'g', 'g', 'p', 'g']\n ans += battle(cur, s[i]) # (16): s1=p, s2=g (25): s1=g, s2=g ... (89): s1=g, s2=p\n\n\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " s = str(input().rstrip())\n \n def battle(s1, s2):\n l = {'g': {'g': 0, 'p': -1}, 'p': {'g': 1, 'p': 0}}\n return l[s1][s2]\n \n hist = ['g']\n \n g = 1\n p = 0\n ans = 0\n if s[0] == 'p':\n ans = -1\n for i in range(1, len(s)):\n cur = 'g'\n if s[i] == 'g':\n if p < g:\n cur = 'p'\n+ if s[i] == 'p':\n+ if p < g:\n+ cur = 'p'\n+\n if cur == 'p':\n p += 1\n else:\n g += 1\n hist.append(cur)\n ans += battle(cur, s[i])\n \n \n \n print(ans)\n \n", "FL_content": " s = str(input().rstrip())\n \n def battle(s1, s2):\n l = {'g': {'g': 0, 'p': -1}, 'p': {'g': 1, 'p': 0}}\n return l[s1][s2]\n \n hist = ['g']\n \n g = 1\n p = 0\n ans = 0\n if s[0] == 'p':\n ans = -1\n for i in range(1, len(s)):\n cur = 'g'\n if s[i] == 'g':\n if p < g:\n cur = 'p'\n if cur == 'p':\n p += 1\n else:\n g += 1\n hist.append(cur)\n ans += battle(cur, s[i])\n \n \n \n print(ans)\n \n", "added_lines": 4, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u844789719", "problem_id": "p03965", "submission1_id": "s866140112", "submission2_id": "s307813677", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = [1 if _ == 'p' else 0 for _ in input()]\nN = len(S)\ncount_g = 0\ncount_p = 0\nscore = 0\nfor hand_t in S:\n if hand_t == 0 and count_p < count_g:\n count_p += 1\n hand_a = 1\n else:\n count_g += 1\n hand_a = 0\n score += hand_a - hand_t\n\nprint(score)\n", "code2": "S = [1 if _ == 'p' else 0 for _ in input()]\nN = len(S)\ncount_g = 0\ncount_p = 0\nscore = 0\nfor hand_t in S:\n if count_p < count_g:\n count_p += 1\n hand_a = 1\n else:\n count_g += 1\n hand_a = 0\n score += hand_a - hand_t\n\nprint(score)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543700855", "date2": "1543700932", "bleu_score": "0.9387130300519002", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 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, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 67, "total_score": 101, "input": "ggggggpppg\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["S = [1 if _ == 'p' else 0 for _ in input()] # (0): S=[0, 0, 0, 0, 0, 0, 1, 1, 1, 0]\nN = len(S) # (1): N=10\ncount_g = 0 # (2): count_g=0\ncount_p = 0 # (3): count_p=0\nscore = 0 # (4): score=0\nfor hand_t in S: # (5): hand_t=0 (10): NO CHANGE ... (55): NO CHANGE\n if hand_t == 0 and count_p < count_g: # (6): NO CHANGE (11): NO CHANGE ... (51): NO CHANGE\n count_p += 1 # (12): count_p=1 (22): count_p=2 ... (52): count_p=4\n hand_a = 1 # (13): hand_a=1 (23): hand_a=1 ... (53): hand_a=1\n else:\n count_g += 1 # (7): count_g=1 (17): count_g=2 ... (47): count_g=6\n hand_a = 0 # (8): hand_a=0 (18): hand_a=0 ... (48): NO CHANGE\n score += hand_a - hand_t # (9): NO CHANGE (14): score=1 ... (54): score=1\n\nprint(score)\n"], "anno_status": [true], "diff_content": " S = [1 if _ == 'p' else 0 for _ in input()]\n N = len(S)\n count_g = 0\n count_p = 0\n score = 0\n for hand_t in S:\n- if hand_t == 0 and count_p < count_g:\n+ if count_p < count_g:\n count_p += 1\n hand_a = 1\n else:\n count_g += 1\n hand_a = 0\n score += hand_a - hand_t\n \n print(score)\n \n", "FL_content": " S = [1 if _ == 'p' else 0 for _ in input()]\n N = len(S)\n count_g = 0\n count_p = 0\n score = 0\n for hand_t in S:\n- if hand_t == 0 and count_p < count_g:\n count_p += 1\n hand_a = 1\n else:\n count_g += 1\n hand_a = 0\n score += hand_a - hand_t\n \n print(score)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u567434159", "problem_id": "p03965", "submission1_id": "s548796857", "submission2_id": "s955567651", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nscore = 0\ntoUse = 0\nfor it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n toUse += 1\n continue\n if toUse > 0:\n toUse -= 1\n else:\n score -=1\n \nprint(score)\n", "code2": "s = input()\nscore = 0\ntoUse = 0\nfor it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n toUse += 1\n continue\n if toUse > 0:\n toUse -= 1\n else:\n toUse += 1\n score -=1\n \nprint(score)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562992934", "date2": "1562992950", "bleu_score": "0.9391467805753186", "code1_test_status": [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, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 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, 1, 0, 0, 0, 0], "code1_test_score": 10, "total_score": 101, "input": "ggpgppgggg\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=ggpgppgggg\nscore = 0 # (1): score=0\ntoUse = 0 # (2): toUse=0\nfor it in s: # (3): it=g (8): NO CHANGE ... (53): NO CHANGE\n if it == 'g' and toUse > 0: # (4): NO CHANGE (9): NO CHANGE ... (49): NO CHANGE\n toUse -= 1 # (10): toUse=0 (40): toUse=0 (50): toUse=0\n score += 1 # (11): score=1 (41): score=0 (51): score=1\n continue # (12): NO CHANGE (42): NO CHANGE (52): NO CHANGE\n if it == 'g': # (5): NO CHANGE (15): NO CHANGE ... (45): NO CHANGE\n toUse += 1 # (6): toUse=1 (21): toUse=1 ... (46): toUse=1\n continue # (7): NO CHANGE (22): NO CHANGE ... (47): NO CHANGE\n if toUse > 0: # (16): NO CHANGE (26): NO CHANGE (31): NO CHANGE\n toUse -= 1 # (27): toUse=0\n else:\n score -=1 # (17): score=0 (32): score=-1\n \nprint(score)\n"], "anno_status": [true], "diff_content": " s = input()\n score = 0\n toUse = 0\n for it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n toUse += 1\n continue\n if toUse > 0:\n toUse -= 1\n else:\n+ toUse += 1\n score -=1\n \n print(score)\n \n", "FL_content": " s = input()\n score = 0\n toUse = 0\n for it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n toUse += 1\n continue\n if toUse > 0:\n toUse -= 1\n else:\n score -=1\n \n print(score)\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u886274153", "problem_id": "p03965", "submission1_id": "s543549275", "submission2_id": "s989327728", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\n\ns = [i for i in s]\nfor i in range(n):\n if s[i] == \"p\":\n s[i] = 1\n else:\n s[i] = 0\nprint(s)\n\nd = [0]*n\nd[0] = 0\ngc = 1\npc = 0\nfor i in range(1, n):\n if gc-1 >= pc:\n d[i] = 1\n pc += 1\n else:\n d[i] = 0\n gc += 1\nprint(d)\n\nans = 0\nfor i in range(n):\n ans += d[i]-s[i]\n\nprint(ans)", "code2": "s = input()\nn = len(s)\n\ns = [i for i in s]\nfor i in range(n):\n if s[i] == \"p\":\n s[i] = 1\n else:\n s[i] = 0\n\nd = [0]*n\nd[0] = 0\ngc = 1\npc = 0\nfor i in range(1, n):\n if gc-1 >= pc:\n d[i] = 1\n pc += 1\n else:\n d[i] = 0\n gc += 1\n\nans = 0\nfor i in range(n):\n ans += d[i]-s[i]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546103909", "date2": "1546104007", "bleu_score": "0.943723972130948", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "pppggggggg\n", "actual_output": "[1, 1, 1, 0, 0, 0, 0, 0, 0, 0]\n[0, 1, 0, 1, 0, 1, 0, 1, 0, 1]\n2\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=pppggggggg\nn = len(s) # (1): n=10\n\ns = [i for i in s] # (2): s=['p', 'p', 'p', 'g', 'g', 'g', 'g', 'g', 'g', 'g']\nfor i in range(n): # (3): i=0 (6): i=1 ... (33): NO CHANGE\n if s[i] == \"p\": # (4): NO CHANGE (7): NO CHANGE ... (31): NO CHANGE\n s[i] = 1 # (5): s=[1, 'p', 'p', 'g', 'g', 'g', 'g', 'g', 'g', 'g'] (8): s=[1, 1, 'p', 'g', 'g', 'g', 'g', 'g', 'g', 'g'] (11): s=[1, 1, 1, 'g', 'g', 'g', 'g', 'g', 'g', 'g']\n else:\n s[i] = 0 # (14): s=[1, 1, 1, 0, 'g', 'g', 'g', 'g', 'g', 'g'] (17): s=[1, 1, 1, 0, 0, 'g', 'g', 'g', 'g', 'g'] ... (32): s=[1, 1, 1, 0, 0, 0, 0, 0, 0, 0]\nprint(s) # (34): NO CHANGE\n\nd = [0]*n # (35): d=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nd[0] = 0 # (36): NO CHANGE\ngc = 1 # (37): gc=1\npc = 0 # (38): pc=0\nfor i in range(1, n): # (39): i=1 (43): i=2 ... (75): NO CHANGE\n if gc-1 >= pc: # (40): NO CHANGE (44): NO CHANGE ... (72): NO CHANGE\n d[i] = 1 # (41): d=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0] (49): d=[0, 1, 0, 1, 0, 0, 0, 0, 0, 0] ... (73): d=[0, 1, 0, 1, 0, 1, 0, 1, 0, 1]\n pc += 1 # (42): pc=1 (50): pc=2 ... (74): pc=5\n else:\n d[i] = 0 # (45): NO CHANGE (53): NO CHANGE ... (69): NO CHANGE\n gc += 1 # (46): gc=2 (54): gc=3 ... (70): gc=5\nprint(d) # (76): NO CHANGE\n\nans = 0 # (77): ans=0\nfor i in range(n): # (78): i=0 (80): i=1 ... (98): NO CHANGE\n ans += d[i]-s[i] # (79): ans=-1 (81): NO CHANGE ... (97): ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n \n s = [i for i in s]\n for i in range(n):\n if s[i] == \"p\":\n s[i] = 1\n else:\n s[i] = 0\n-print(s)\n \n d = [0]*n\n d[0] = 0\n gc = 1\n pc = 0\n for i in range(1, n):\n if gc-1 >= pc:\n d[i] = 1\n pc += 1\n else:\n d[i] = 0\n gc += 1\n-print(d)\n \n ans = 0\n for i in range(n):\n ans += d[i]-s[i]\n \n print(ans)\n", "FL_content": " s = input()\n n = len(s)\n \n s = [i for i in s]\n for i in range(n):\n if s[i] == \"p\":\n s[i] = 1\n else:\n s[i] = 0\n-print(s)\n \n d = [0]*n\n d[0] = 0\n gc = 1\n pc = 0\n for i in range(1, n):\n if gc-1 >= pc:\n d[i] = 1\n pc += 1\n else:\n d[i] = 0\n gc += 1\n-print(d)\n \n ans = 0\n for i in range(n):\n ans += d[i]-s[i]\n \n print(ans)\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u807772568", "problem_id": "p03965", "submission1_id": "s493659686", "submission2_id": "s241928838", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,collections as cl,bisect as bs\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9+7\nMax = sys.maxsize\ndef l(): \n return list(map(int,input().split()))\ndef m(): \n return map(int,input().split())\ndef onem(): \n return int(input())\ndef s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\ndef jo(x): \n return \" \".join(map(str,x))\ndef max2(x): \n return max(map(max,x))\ndef In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\ndef pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n\n\n\ns = input()[:-1]\n\nja = [[0,0] for i in range(len(s)+1)]\n\nfor i in range(len(s)):\n if s[i] == \"g\":\n ja[i+1][0] = ja[i][0] + 1\n ja[i+1][1] = ja[i][1]\n else:\n ja[i+1][0] = ja[i][0]\n ja[i+1][1] = ja[i][1] + 1\n\nco = 0\n\nfor i in range(len(s)-1,-1,-1):\n if s[i] == \"g\":\n if ja[i][0] - ja[i][1] - co > 0:\n co += 1\n \n \n\nprint(co)\n\n", "code2": "import sys,collections as cl,bisect as bs\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9+7\nMax = sys.maxsize\ndef l(): \n return list(map(int,input().split()))\ndef m(): \n return map(int,input().split())\ndef onem(): \n return int(input())\ndef s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\ndef jo(x): \n return \" \".join(map(str,x))\ndef max2(x): \n return max(map(max,x))\ndef In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\ndef pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n\n\n\ns = input()[:-1]\n\npo = 0\n\nfor i in range(len(s)):\n if s[i] == \"p\":\n po += 1\n \n\nprint(len(s)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587340709", "date2": "1587341099", "bleu_score": "0.7477743649059153", "code1_test_status": [0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 63, "total_score": 101, "input": "ggggpgppgg\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["import sys,collections as cl,bisect as bs\nsys.setrecursionlimit(100000) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nmod = 10**9+7 # (2): mod=1000000007\nMax = sys.maxsize # (3): Max=9223372036854775807\ndef l(): # (4): l=\n return list(map(int,input().split()))\ndef m(): # (5): m=\n return map(int,input().split())\ndef onem(): # (6): onem=\n return int(input())\ndef s(x): # (7): s=\n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\ndef jo(x): # (8): jo=\n return \" \".join(map(str,x))\ndef max2(x): # (9): max2=\n return max(map(max,x))\ndef In(x,a): # (10): In=\n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\ndef pow_k(x, n): # (11): pow_k=\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n\n\n\ns = input()[:-1] # (12): s=ggggpgppgg\n\nja = [[0,0] for i in range(len(s)+1)] # (13): ja\n\nfor i in range(len(s)): # (14): i=0 (18): i=1 ... (54): NO CHANGE\n if s[i] == \"g\": # (15): NO CHANGE (19): NO CHANGE ... (51): NO CHANGE\n ja[i+1][0] = ja[i][0] + 1 # (16): ja (20): ja ... (52): ja\n ja[i+1][1] = ja[i][1] # (17): NO CHANGE (21): NO CHANGE ... (53): ja\n else:\n ja[i+1][0] = ja[i][0] # (32): ja=[[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [4, 0], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0]] (40): ja (44): ja\n ja[i+1][1] = ja[i][1] + 1 # (33): ja=[[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [4, 1], [0, 0], [0, 0], [0, 0], [0, 0], [0, 0]] (41): ja (45): ja\n\nco = 0 # (55): co=0\n\nfor i in range(len(s)-1,-1,-1): # (56): NO CHANGE (60): i=8 ... (86): NO CHANGE\n if s[i] == \"g\": # (57): NO CHANGE (61): NO CHANGE ... (84): NO CHANGE\n if ja[i][0] - ja[i][1] - co > 0: # (58): NO CHANGE (62): NO CHANGE ... (85): NO CHANGE\n co += 1 # (59): co=1 (63): co=2 (71): co=3\n \n \n\nprint(co)\n\n"], "anno_status": [false], "diff_content": " import sys,collections as cl,bisect as bs\n sys.setrecursionlimit(100000)\n input = sys.stdin.readline\n mod = 10**9+7\n Max = sys.maxsize\n def l(): \n return list(map(int,input().split()))\n def m(): \n return map(int,input().split())\n def onem(): \n return int(input())\n def s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\n def jo(x): \n return \" \".join(map(str,x))\n def max2(x): \n return max(map(max,x))\n def In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n \n def pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n \n \n \n s = input()[:-1]\n \n-ja = [[0,0] for i in range(len(s)+1)]\n+po = 0\n \n for i in range(len(s)):\n- if s[i] == \"g\":\n- ja[i+1][0] = ja[i][0] + 1\n- ja[i+1][1] = ja[i][1]\n- else:\n- ja[i+1][0] = ja[i][0]\n- ja[i+1][1] = ja[i][1] + 1\n-\n-co = 0\n-\n-for i in range(len(s)-1,-1,-1):\n- if s[i] == \"g\":\n- if ja[i][0] - ja[i][1] - co > 0:\n- co += 1\n- \n+ if s[i] == \"p\":\n+ po += 1\n \n \n-print(co)\n+print(len(s)\n \n \n", "FL_content": " import sys,collections as cl,bisect as bs\n sys.setrecursionlimit(100000)\n input = sys.stdin.readline\n mod = 10**9+7\n Max = sys.maxsize\n def l(): \n return list(map(int,input().split()))\n def m(): \n return map(int,input().split())\n def onem(): \n return int(input())\n def s(x): \n a = []\n if len(x) == 0:\n return []\n aa = x[0]\n su = 1\n for i in range(len(x)-1):\n if aa != x[i+1]:\n a.append([aa,su])\n aa = x[i+1]\n su = 1\n else:\n su += 1\n a.append([aa,su])\n return a\n def jo(x): \n return \" \".join(map(str,x))\n def max2(x): \n return max(map(max,x))\n def In(x,a): \n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n \n def pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n \n \n \n s = input()[:-1]\n \n-ja = [[0,0] for i in range(len(s)+1)]\n \n for i in range(len(s)):\n- if s[i] == \"g\":\n- ja[i+1][0] = ja[i][0] + 1\n- ja[i+1][1] = ja[i][1]\n- else:\n- ja[i+1][0] = ja[i][0]\n- ja[i+1][1] = ja[i][1] + 1\n-\n-co = 0\n-\n-for i in range(len(s)-1,-1,-1):\n- if s[i] == \"g\":\n- if ja[i][0] - ja[i][1] - co > 0:\n- co += 1\n- \n \n \n-print(co)\n \n \n", "added_lines": 4, "removed_lines": 16, "code1_lines": 72 }, { "user_id": "u124498235", "problem_id": "p03965", "submission1_id": "s029707659", "submission2_id": "s169737339", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nans = 0\n\nr = 0\np = 0\n\nfor j in s:\n if j == 'g':\n r += 1\n if p > 1:\n ans -= p\n p = 0\n else:\n p += 1\n if r > 1:\n ans += r\n r = 0\nif p > 1:\n ans -= p\nif r > 1:\n ans += r\nprint (ans)", "code2": "import math\ns = input()\n \nans = 0\n \nr = 0\np = 0\nc = 0\nfor j in s:\n c = r-p\n if j == 'g':\n if c > 0:\n p += 1\n ans += 1\n else:\n r += 1\n else:\n if c > 0:\n p += 1\n else:\n r += 1\n ans -= 1\nprint (ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600607799", "date2": "1600624294", "bleu_score": "0.7138408700792985", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "gppggpgggg\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=gppggpgggg\n\nans = 0 # (1): ans=0\n\nr = 0 # (2): r=0\np = 0 # (3): p=0\n\nfor j in s: # (4): j=g (9): j=p ... (56): NO CHANGE\n if j == 'g': # (5): NO CHANGE (10): NO CHANGE ... (52): NO CHANGE\n r += 1 # (6): r=1 (21): r=1 ... (53): r=4\n if p > 1: # (7): NO CHANGE (22): NO CHANGE ... (54): NO CHANGE\n ans -= p # (23): ans=-2\n p = 0 # (8): NO CHANGE (24): p=0 ... (55): NO CHANGE\n else:\n p += 1 # (11): p=1 (16): p=2 (32): p=1\n if r > 1: # (12): NO CHANGE (17): NO CHANGE (33): NO CHANGE\n ans += r # (34): ans=0\n r = 0 # (13): r=0 (18): NO CHANGE (35): r=0\nif p > 1: # (57): NO CHANGE\n ans -= p\nif r > 1: # (58): NO CHANGE\n ans += r # (59): ans=4\nprint (ans)"], "anno_status": [true], "diff_content": "+import math\n s = input()\n-\n+ \n ans = 0\n-\n+ \n r = 0\n p = 0\n-\n+c = 0\n for j in s:\n+ c = r-p\n if j == 'g':\n- r += 1\n- if p > 1:\n- ans -= p\n- p = 0\n+ if c > 0:\n+ p += 1\n+ ans += 1\n+ else:\n+ r += 1\n else:\n- p += 1\n- if r > 1:\n- ans += r\n- r = 0\n-if p > 1:\n- ans -= p\n-if r > 1:\n- ans += r\n+ if c > 0:\n+ p += 1\n+ else:\n+ r += 1\n+ ans -= 1\n print (ans)\n", "FL_content": " s = input()\n-\n ans = 0\n-\n r = 0\n p = 0\n-\n for j in s:\n if j == 'g':\n- r += 1\n- if p > 1:\n- ans -= p\n- p = 0\n else:\n- p += 1\n- if r > 1:\n- ans += r\n- r = 0\n-if p > 1:\n- ans -= p\n-if r > 1:\n- ans += r\n print (ans)\n", "added_lines": 15, "removed_lines": 15, "code1_lines": 23 }, { "user_id": "u427344224", "problem_id": "p03965", "submission1_id": "s972391285", "submission2_id": "s720154094", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\np_count = 0\ng_count = 0\nwin = 0\n\nfor i in list(s):\n\n if i == \"g\" and p_count <= g_count - 1:\n p_count += 1\n win += 1\n elif i == \"g\":\n g_count += 1\n else:\n p_count += 1\n\nprint(win)\n", "code2": "s = input()\n\np_count = 0\ng_count = 0\nwin = 0\n\nfor i in list(s):\n if i == \"g\" and p_count + 1 <= g_count:\n p_count += 1\n win += 1\n elif i == \"g\":\n g_count += 1\n elif i == \"p\" and p_count + 1 <= g_count:\n p_count += 1\n else:\n g_count += 1\n win -= 1\n\nprint(win)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1547180600", "date2": "1547181021", "bleu_score": "0.7156866614756562", "code1_test_status": [1, 0, 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, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 101, "input": "gggpggggpp\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=gggpggggpp\n\np_count = 0 # (1): p_count=0\ng_count = 0 # (2): g_count=0\nwin = 0 # (3): win=0\n\nfor i in list(s): # (4): i=g (8): NO CHANGE ... (44): NO CHANGE\n\n if i == \"g\" and p_count <= g_count - 1: # (5): NO CHANGE (9): NO CHANGE ... (41): NO CHANGE\n p_count += 1 # (10): p_count=1 (26): p_count=3 (34): p_count=4\n win += 1 # (11): win=1 (27): win=2 (35): win=3\n elif i == \"g\": # (6): NO CHANGE (14): NO CHANGE ... (42): NO CHANGE\n g_count += 1 # (7): g_count=1 (15): g_count=2 ... (31): g_count=4\n else:\n p_count += 1 # (19): p_count=2 (39): p_count=5 (43): p_count=6\n\nprint(win)\n"], "anno_status": [true], "diff_content": " s = input()\n \n p_count = 0\n g_count = 0\n win = 0\n \n for i in list(s):\n-\n- if i == \"g\" and p_count <= g_count - 1:\n+ if i == \"g\" and p_count + 1 <= g_count:\n p_count += 1\n win += 1\n elif i == \"g\":\n g_count += 1\n- else:\n+ elif i == \"p\" and p_count + 1 <= g_count:\n p_count += 1\n+ else:\n+ g_count += 1\n+ win -= 1\n \n print(win)\n \n", "FL_content": " s = input()\n \n p_count = 0\n g_count = 0\n win = 0\n \n for i in list(s):\n-\n- if i == \"g\" and p_count <= g_count - 1:\n p_count += 1\n win += 1\n elif i == \"g\":\n g_count += 1\n- else:\n p_count += 1\n \n print(win)\n \n", "added_lines": 5, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u620084012", "problem_id": "p03965", "submission1_id": "s085573507", "submission2_id": "s373445189", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\ng, p = 0, 0\nans = 0\nfor e in s:\n if e == \"g\":\n if p+1 <= g:\n p += 1\n ans += 1\n else:\n g += 1\n else:\n p += 1\n\nprint(ans)\n", "code2": "s = input()\ng, p = 0, 0\nans = 0\nfor e in s:\n if e == \"g\":\n if p+1 <= g:\n p += 1\n ans += 1\n else:\n g += 1\n else:\n if p+1 <= g:\n p += 1\n else:\n g += 1\n ans -= 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579660158", "date2": "1579660267", "bleu_score": "0.7068584727047963", "code1_test_status": [1, 0, 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, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 101, "input": "ggp\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["s = input() # (0): s=ggp\ng, p = 0, 0 # (1): g=0, p=0\nans = 0 # (2): ans=0\nfor e in s: # (3): e=g (7): NO CHANGE ... (15): NO CHANGE\n if e == \"g\": # (4): NO CHANGE (8): NO CHANGE (13): NO CHANGE\n if p+1 <= g: # (5): NO CHANGE (9): NO CHANGE\n p += 1 # (10): p=1\n ans += 1 # (11): ans=1\n else:\n g += 1 # (6): g=1\n else:\n p += 1 # (14): p=2\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " s = input()\n g, p = 0, 0\n ans = 0\n for e in s:\n if e == \"g\":\n if p+1 <= g:\n p += 1\n ans += 1\n else:\n g += 1\n else:\n- p += 1\n+ if p+1 <= g:\n+ p += 1\n+ else:\n+ g += 1\n+ ans -= 1\n \n print(ans)\n \n", "FL_content": " s = input()\n g, p = 0, 0\n ans = 0\n for e in s:\n if e == \"g\":\n if p+1 <= g:\n p += 1\n ans += 1\n else:\n g += 1\n else:\n- p += 1\n \n print(ans)\n \n", "added_lines": 5, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u397384480", "problem_id": "p03965", "submission1_id": "s760305680", "submission2_id": "s897543784", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nimport collections\nimport copy\nimport functools\nimport heapq\nimport math\nimport sys\nfrom collections import deque\nfrom collections import defaultdict\ninput = sys.stdin.readline\nMOD = 10**9+7\n\ns = list(input().rstrip())\ng = 0\np = 0\nres = []\nans = 0\n\nfor i in range(len(s)):\n c = g-p\n if s[i] == \"g\":\n if c > 0:\n \n p += 1\n ans += 1\n else:\n \n g += 1\n else:\n \n p += 1\nprint(ans)", "code2": "import bisect\nimport collections\nimport copy\nimport functools\nimport heapq\nimport math\nimport sys\nfrom collections import deque\nfrom collections import defaultdict\ninput = sys.stdin.readline\nMOD = 10**9+7\n\ns = list(input().rstrip())\ng = 0\np = 0\nres = []\nans = 0\n\nfor i in range(len(s)):\n c = g-p\n if s[i] == \"g\":\n if c > 0:\n \n p += 1\n ans += 1\n else:\n \n g += 1\n else:\n if c > 0:\n \n p += 1\n else:\n \n g += 1\n ans -= 1\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590731628", "date2": "1590731779", "bleu_score": "0.8372696578863793", "code1_test_status": [1, 0, 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, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 101, "input": "gggggpggpp\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["import bisect\nimport collections\nimport copy\nimport functools\nimport heapq\nimport math\nimport sys\nfrom collections import deque\nfrom collections import defaultdict\ninput = sys.stdin.readline # (0): input=\nMOD = 10**9+7 # (1): MOD=1000000007\n\ns = list(input().rstrip()) # (2): s=['g', 'g', 'g', 'g', 'g', 'p', 'g', 'g', 'p', 'p']\ng = 0 # (3): g=0\np = 0 # (4): p=0\nres = [] # (5): res=[]\nans = 0 # (6): ans=0\n\nfor i in range(len(s)): # (7): i=0 (12): i=1 ... (57): NO CHANGE\n c = g-p # (8): c=0 (13): c=1 ... (54): c=-1\n if s[i] == \"g\": # (9): NO CHANGE (14): NO CHANGE ... (55): NO CHANGE\n if c > 0: # (10): NO CHANGE (15): NO CHANGE ... (46): NO CHANGE\n \n p += 1 # (16): p=1 (27): p=2 (47): p=4\n ans += 1 # (17): ans=1 (28): ans=2 (48): ans=3\n else:\n \n g += 1 # (11): g=1 (22): g=2 ... (42): g=4\n else:\n \n p += 1 # (37): p=3 (52): p=5 (56): p=6\nprint(ans)"], "anno_status": [true], "diff_content": " import bisect\n import collections\n import copy\n import functools\n import heapq\n import math\n import sys\n from collections import deque\n from collections import defaultdict\n input = sys.stdin.readline\n MOD = 10**9+7\n \n s = list(input().rstrip())\n g = 0\n p = 0\n res = []\n ans = 0\n \n for i in range(len(s)):\n c = g-p\n if s[i] == \"g\":\n if c > 0:\n \n p += 1\n ans += 1\n else:\n \n g += 1\n else:\n- \n- p += 1\n+ if c > 0:\n+ \n+ p += 1\n+ else:\n+ \n+ g += 1\n+ ans -= 1\n print(ans)\n", "FL_content": " import bisect\n import collections\n import copy\n import functools\n import heapq\n import math\n import sys\n from collections import deque\n from collections import defaultdict\n input = sys.stdin.readline\n MOD = 10**9+7\n \n s = list(input().rstrip())\n g = 0\n p = 0\n res = []\n ans = 0\n \n for i in range(len(s)):\n c = g-p\n if s[i] == \"g\":\n if c > 0:\n \n p += 1\n ans += 1\n else:\n \n g += 1\n else:\n- \n- p += 1\n print(ans)\n", "added_lines": 7, "removed_lines": 2, "code1_lines": 32 }, { "user_id": "u191874006", "problem_id": "p03965", "submission1_id": "s010305547", "submission2_id": "s157131590", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nimport sys\nimport math\nimport bisect\nsys.setrecursionlimit(1000000000)\nfrom heapq import heappush, heappop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\nmod = 10**9 + 7\n\ns = input()\nn = len(s)\nans = 0\ncnt = 0\nfor i in range(n):\n if s[i] == 'g':\n if cnt > 0:\n ans += 1\n cnt -= 1\n else:\n cnt += 1\n else:\n cnt -= 1\nprint(ans)\n", "code2": "\n\n\nimport sys\nimport math\nimport bisect\nsys.setrecursionlimit(1000000000)\nfrom heapq import heappush, heappop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\nmod = 10**9 + 7\n\ns = input()\nn = len(s)\nans = 0\ncnt = 0\nfor i in range(n):\n if s[i] == 'g':\n if cnt > 0:\n ans += 1\n cnt -= 1\n else:\n cnt += 1\n else:\n if cnt == 0:\n ans -= 1\n cnt += 1\n else:\n cnt -= 1\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1564928435", "date2": "1564928692", "bleu_score": "0.8688254484513072", "code1_test_status": [1, 0, 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, 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, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 101, "input": "ggp\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\n\n\nimport sys\nimport math\nimport bisect\nsys.setrecursionlimit(1000000000) # (0): heappush=, heappop=, defaultdict=, accumulate=, Counter=, deque=, itemgetter=, permutations=\nfrom heapq import heappush, heappop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\nmod = 10**9 + 7 # (1): mod=1000000007\n\ns = input() # (2): s=ggp\nn = len(s) # (3): n=3\nans = 0 # (4): ans=0\ncnt = 0 # (5): cnt=0\nfor i in range(n): # (6): i=0 (10): i=1 ... (18): NO CHANGE\n if s[i] == 'g': # (7): NO CHANGE (11): NO CHANGE (16): NO CHANGE\n if cnt > 0: # (8): NO CHANGE (12): NO CHANGE\n ans += 1 # (13): ans=1\n cnt -= 1 # (14): cnt=0\n else:\n cnt += 1 # (9): cnt=1\n else:\n cnt -= 1 # (17): cnt=-1\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n \n \n import sys\n import math\n import bisect\n sys.setrecursionlimit(1000000000)\n from heapq import heappush, heappop\n from collections import defaultdict\n from itertools import accumulate\n from collections import Counter\n from collections import deque\n from operator import itemgetter\n from itertools import permutations\n mod = 10**9 + 7\n \n s = input()\n n = len(s)\n ans = 0\n cnt = 0\n for i in range(n):\n if s[i] == 'g':\n if cnt > 0:\n ans += 1\n cnt -= 1\n else:\n cnt += 1\n else:\n- cnt -= 1\n+ if cnt == 0:\n+ ans -= 1\n+ cnt += 1\n+ else:\n+ cnt -= 1\n print(ans)\n \n", "FL_content": " \n \n \n import sys\n import math\n import bisect\n sys.setrecursionlimit(1000000000)\n from heapq import heappush, heappop\n from collections import defaultdict\n from itertools import accumulate\n from collections import Counter\n from collections import deque\n from operator import itemgetter\n from itertools import permutations\n mod = 10**9 + 7\n \n s = input()\n n = len(s)\n ans = 0\n cnt = 0\n for i in range(n):\n if s[i] == 'g':\n if cnt > 0:\n ans += 1\n cnt -= 1\n else:\n cnt += 1\n else:\n- cnt -= 1\n print(ans)\n \n", "added_lines": 5, "removed_lines": 1, "code1_lines": 31 }, { "user_id": "u667024514", "problem_id": "p03965", "submission1_id": "s860031279", "submission2_id": "s996939151", "status1": "Wrong Answer", "status2": "Accepted", "code1": "lis = list(input())\ncou = 0\nans = 0\nfor i in range(len(lis)):\n if cou > 0 and lis[i] == \"g\":\n cou -= 1\n ans += 1\n else:\n cou += 1\n if lis[i] == \"p\":\n ans -= 1\nprint(ans)", "code2": "lis = list(input())\ncou = 0\nans = 0\nfor i in range(len(lis)):\n\tif lis[i] == \"g\":\n\t\tif cou > 0:\n\t\t\tcou -= 1\n\t\t\tans += 1\n\t\telse:\n\t\t\tcou += 1\n\telse:\n\t\tif cou > 0:\n\t\t\tcou -= 1\n\t\telse:\n\t\t\tcou += 1\n\t\t\tans -= 1\nprint(max(0,ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1523926187", "date2": "1523926608", "bleu_score": "0.6015872590470707", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 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, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 67, "total_score": 101, "input": "gpggggpggp\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["lis = list(input()) # (0): lis=['g', 'p', 'g', 'g', 'g', 'g', 'p', 'g', 'g', 'p']\ncou = 0 # (1): cou=0\nans = 0 # (2): ans=0\nfor i in range(len(lis)): # (3): i=0 (7): i=1 ... (46): NO CHANGE\n if cou > 0 and lis[i] == \"g\": # (4): NO CHANGE (8): NO CHANGE ... (42): NO CHANGE\n cou -= 1 # (14): cou=1 (18): cou=0 ... (35): cou=0\n ans += 1 # (15): ans=0 (19): ans=1 ... (36): ans=2\n else:\n cou += 1 # (5): cou=1 (9): cou=2 ... (43): cou=2\n if lis[i] == \"p\": # (6): NO CHANGE (10): NO CHANGE ... (44): NO CHANGE\n ans -= 1 # (11): ans=-1 (32): ans=1 (45): ans=1\nprint(ans)"], "anno_status": [true], "diff_content": " lis = list(input())\n cou = 0\n ans = 0\n for i in range(len(lis)):\n- if cou > 0 and lis[i] == \"g\":\n- cou -= 1\n- ans += 1\n- else:\n- cou += 1\n- if lis[i] == \"p\":\n- ans -= 1\n-print(ans)\n+\tif lis[i] == \"g\":\n+\t\tif cou > 0:\n+\t\t\tcou -= 1\n+\t\t\tans += 1\n+\t\telse:\n+\t\t\tcou += 1\n+\telse:\n+\t\tif cou > 0:\n+\t\t\tcou -= 1\n+\t\telse:\n+\t\t\tcou += 1\n+\t\t\tans -= 1\n+print(max(0,ans))\n+\n", "FL_content": " lis = list(input())\n cou = 0\n ans = 0\n for i in range(len(lis)):\n- if cou > 0 and lis[i] == \"g\":\n- cou -= 1\n- ans += 1\n- else:\n- cou += 1\n- if lis[i] == \"p\":\n- ans -= 1\n-print(ans)\n", "added_lines": 14, "removed_lines": 8, "code1_lines": 12 }, { "user_id": "u845536647", "problem_id": "p03965", "submission1_id": "s701403813", "submission2_id": "s606773363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\ng=s.count('g')\np=s.count('p')\na=g-p+(g+p)\nprint(a)", "code2": "s=input()\ng=s.count('g')\np=s.count('p')\na=(-p+(g+p)\nprint(a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574973652", "date2": "1574973854", "bleu_score": "0.9566758893610273", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "ggpggppggg\n", "actual_output": "14\n", "expected_output": "2\n\n", "anno_code": ["s=input() # (0): s=ggpggppggg\ng=s.count('g') # (1): g=7\np=s.count('p') # (2): p=3\na=g-p+(g+p) # (3): a=14\nprint(a)"], "anno_status": [true], "diff_content": " s=input()\n g=s.count('g')\n p=s.count('p')\n-a=g-p+(g+p)\n+a=(-p+(g+p)\n print(a)\n", "FL_content": " s=input()\n g=s.count('g')\n p=s.count('p')\n-a=g-p+(g+p)\n print(a)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u667024514", "problem_id": "p03965", "submission1_id": "s482927256", "submission2_id": "s996939151", "status1": "Wrong Answer", "status2": "Accepted", "code1": "lis = list(input())\ncou = 0\nans = 0\nfor i in range(len(lis)):\n if cou > 0 and lis[i] == \"g\":\n cou -= 1\n ans += 1\n else:\n cou += 1\n if lis[i] == \"p\":\n ans -= 1\nprint(max(ans,0))", "code2": "lis = list(input())\ncou = 0\nans = 0\nfor i in range(len(lis)):\n\tif lis[i] == \"g\":\n\t\tif cou > 0:\n\t\t\tcou -= 1\n\t\t\tans += 1\n\t\telse:\n\t\t\tcou += 1\n\telse:\n\t\tif cou > 0:\n\t\t\tcou -= 1\n\t\telse:\n\t\t\tcou += 1\n\t\t\tans -= 1\nprint(max(0,ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1523926261", "date2": "1523926608", "bleu_score": "0.6192487403444488", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 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, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 67, "total_score": 101, "input": "gggggppgpg\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["lis = list(input()) # (0): lis=['g', 'g', 'g', 'g', 'g', 'p', 'p', 'g', 'p', 'g']\ncou = 0 # (1): cou=0\nans = 0 # (2): ans=0\nfor i in range(len(lis)): # (3): i=0 (7): i=1 ... (46): NO CHANGE\n if cou > 0 and lis[i] == \"g\": # (4): NO CHANGE (8): NO CHANGE ... (43): NO CHANGE\n cou -= 1 # (9): cou=0 (17): cou=0 ... (44): cou=2\n ans += 1 # (10): ans=1 (18): ans=2 ... (45): ans=1\n else:\n cou += 1 # (5): cou=1 (13): cou=1 ... (39): cou=3\n if lis[i] == \"p\": # (6): NO CHANGE (14): NO CHANGE ... (40): NO CHANGE\n ans -= 1 # (27): ans=1 (32): ans=0 (41): ans=0\nprint(max(ans,0))"], "anno_status": [true], "diff_content": " lis = list(input())\n cou = 0\n ans = 0\n for i in range(len(lis)):\n- if cou > 0 and lis[i] == \"g\":\n- cou -= 1\n- ans += 1\n- else:\n- cou += 1\n- if lis[i] == \"p\":\n- ans -= 1\n-print(max(ans,0))\n+\tif lis[i] == \"g\":\n+\t\tif cou > 0:\n+\t\t\tcou -= 1\n+\t\t\tans += 1\n+\t\telse:\n+\t\t\tcou += 1\n+\telse:\n+\t\tif cou > 0:\n+\t\t\tcou -= 1\n+\t\telse:\n+\t\t\tcou += 1\n+\t\t\tans -= 1\n+print(max(0,ans))\n+\n", "FL_content": " lis = list(input())\n cou = 0\n ans = 0\n for i in range(len(lis)):\n- if cou > 0 and lis[i] == \"g\":\n- cou -= 1\n- ans += 1\n- else:\n- cou += 1\n- if lis[i] == \"p\":\n- ans -= 1\n-print(max(ans,0))\n", "added_lines": 14, "removed_lines": 8, "code1_lines": 12 }, { "user_id": "u124498235", "problem_id": "p03965", "submission1_id": "s857336400", "submission2_id": "s169737339", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nans = 0\n\nr = 0\np = 0\n\nfor j in s:\n if j == 'g':\n r += 1\n if p > 1:\n ans -= p\n p = 0\n else:\n p += 1\n if r > 1:\n ans += r\n r = 0\nif p >= 1:\n if p == 1 and ans > 0:\n ans -= 1\n elif p > 1:\n ans -= p\nif r > 1:\n ans += r\nprint (ans)", "code2": "import math\ns = input()\n \nans = 0\n \nr = 0\np = 0\nc = 0\nfor j in s:\n c = r-p\n if j == 'g':\n if c > 0:\n p += 1\n ans += 1\n else:\n r += 1\n else:\n if c > 0:\n p += 1\n else:\n r += 1\n ans -= 1\nprint (ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600608221", "date2": "1600624294", "bleu_score": "0.6606809148049073", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "pgpggpgggg\n", "actual_output": "6\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=pgpggpgggg\n\nans = 0 # (1): ans=0\n\nr = 0 # (2): r=0\np = 0 # (3): p=0\n\nfor j in s: # (4): j=p (9): j=g ... (55): NO CHANGE\n if j == 'g': # (5): NO CHANGE (10): NO CHANGE ... (51): NO CHANGE\n r += 1 # (11): r=1 (21): r=1 ... (52): r=4\n if p > 1: # (12): NO CHANGE (22): NO CHANGE ... (53): NO CHANGE\n ans -= p\n p = 0 # (13): p=0 (23): p=0 ... (54): NO CHANGE\n else:\n p += 1 # (6): p=1 (16): p=1 (31): p=1\n if r > 1: # (7): NO CHANGE (17): NO CHANGE (32): NO CHANGE\n ans += r # (33): ans=2\n r = 0 # (8): NO CHANGE (18): r=0 (34): r=0\nif p >= 1: # (56): NO CHANGE\n if p == 1 and ans > 0:\n ans -= 1\n elif p > 1:\n ans -= p\nif r > 1: # (57): NO CHANGE\n ans += r # (58): ans=6\nprint (ans)"], "anno_status": [true], "diff_content": "+import math\n s = input()\n-\n+ \n ans = 0\n-\n+ \n r = 0\n p = 0\n-\n+c = 0\n for j in s:\n+ c = r-p\n if j == 'g':\n- r += 1\n- if p > 1:\n- ans -= p\n- p = 0\n+ if c > 0:\n+ p += 1\n+ ans += 1\n+ else:\n+ r += 1\n else:\n- p += 1\n- if r > 1:\n- ans += r\n- r = 0\n-if p >= 1:\n- if p == 1 and ans > 0:\n- ans -= 1\n- elif p > 1:\n- ans -= p\n-if r > 1:\n- ans += r\n+ if c > 0:\n+ p += 1\n+ else:\n+ r += 1\n+ ans -= 1\n print (ans)\n", "FL_content": " s = input()\n-\n ans = 0\n-\n r = 0\n p = 0\n-\n for j in s:\n if j == 'g':\n- r += 1\n- if p > 1:\n- ans -= p\n- p = 0\n else:\n- p += 1\n- if r > 1:\n- ans += r\n- r = 0\n-if p >= 1:\n- if p == 1 and ans > 0:\n- ans -= 1\n- elif p > 1:\n- ans -= p\n-if r > 1:\n- ans += r\n print (ans)\n", "added_lines": 15, "removed_lines": 18, "code1_lines": 26 }, { "user_id": "u827202523", "problem_id": "p03965", "submission1_id": "s949440838", "submission2_id": "s093455903", "status1": "Wrong Answer", "status2": "Accepted", "code1": "hands = input()\nans = 0\nfor i, h in enumerate(hands):\n if i % 2 == 1:\n if h == \"p\":\n ans -= 1\n else:\n if h == \"g\":\n ans += 1\n \nprint(ans)\n ", "code2": "hands = input()\nans = 0\nfor i, h in enumerate(hands):\n if i % 2 == 0:\n if h == \"p\":\n ans -= 1\n else:\n if h == \"g\":\n ans += 1\n \nprint(ans)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549408834", "date2": "1549408893", "bleu_score": "0.9845425234727974", "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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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": "pgg\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["hands = input() # (0): hands=pgg\nans = 0 # (1): ans=0\nfor i, h in enumerate(hands): # (2): i=0, h=p (5): i=1, h=g ... (12): NO CHANGE\n if i % 2 == 1: # (3): NO CHANGE (6): NO CHANGE (9): NO CHANGE\n if h == \"p\": # (7): NO CHANGE\n ans -= 1\n else:\n if h == \"g\": # (4): NO CHANGE (10): NO CHANGE\n ans += 1 # (11): ans=1\n \nprint(ans)\n "], "anno_status": [true], "diff_content": " hands = input()\n ans = 0\n for i, h in enumerate(hands):\n- if i % 2 == 1:\n+ if i % 2 == 0:\n if h == \"p\":\n ans -= 1\n else:\n if h == \"g\":\n ans += 1\n \n print(ans)\n \n", "FL_content": " hands = input()\n ans = 0\n for i, h in enumerate(hands):\n- if i % 2 == 1:\n if h == \"p\":\n ans -= 1\n else:\n if h == \"g\":\n ans += 1\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u567434159", "problem_id": "p03965", "submission1_id": "s458613368", "submission2_id": "s955567651", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nscore = 0\ntoUse = 0\nfor it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n continue\n if toUse > 0:\n toUse -= 1\n else:\n score -=1\n \nprint(score)\n", "code2": "s = input()\nscore = 0\ntoUse = 0\nfor it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n toUse += 1\n continue\n if toUse > 0:\n toUse -= 1\n else:\n toUse += 1\n score -=1\n \nprint(score)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562992789", "date2": "1562992950", "bleu_score": "0.8782934687895325", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "gpgpggpggg\n", "actual_output": "-3\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=gpgpggpggg\nscore = 0 # (1): score=0\ntoUse = 0 # (2): toUse=0\nfor it in s: # (3): it=g (7): it=p ... (46): NO CHANGE\n if it == 'g' and toUse > 0: # (4): NO CHANGE (8): NO CHANGE ... (43): NO CHANGE\n toUse -= 1\n score += 1\n continue\n if it == 'g': # (5): NO CHANGE (9): NO CHANGE ... (44): NO CHANGE\n continue # (6): NO CHANGE (15): NO CHANGE ... (45): NO CHANGE\n if toUse > 0: # (10): NO CHANGE (19): NO CHANGE (32): NO CHANGE\n toUse -= 1\n else:\n score -=1 # (11): score=-1 (20): score=-2 (33): score=-3\n \nprint(score)\n"], "anno_status": [true], "diff_content": " s = input()\n score = 0\n toUse = 0\n for it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n+ toUse += 1\n continue\n if toUse > 0:\n toUse -= 1\n else:\n+ toUse += 1\n score -=1\n \n print(score)\n \n", "FL_content": " s = input()\n score = 0\n toUse = 0\n for it in s:\n if it == 'g' and toUse > 0:\n toUse -= 1\n score += 1\n continue\n if it == 'g':\n continue\n if toUse > 0:\n toUse -= 1\n else:\n score -=1\n \n print(score)\n \n", "added_lines": 2, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u667024514", "problem_id": "p03965", "submission1_id": "s942807243", "submission2_id": "s996939151", "status1": "Wrong Answer", "status2": "Accepted", "code1": "lis = list(input())\ncou = 0\nans = 0\nfor i in range(len(lis)):\n if cou > 0 and lis[i] == \"g\":\n cou -= 1\n ans += 1\n else:\n cou += 1\n if lis[i] == \"p\":\n ans -= 1\nprint(ans - cou)", "code2": "lis = list(input())\ncou = 0\nans = 0\nfor i in range(len(lis)):\n\tif lis[i] == \"g\":\n\t\tif cou > 0:\n\t\t\tcou -= 1\n\t\t\tans += 1\n\t\telse:\n\t\t\tcou += 1\n\telse:\n\t\tif cou > 0:\n\t\t\tcou -= 1\n\t\telse:\n\t\t\tcou += 1\n\t\t\tans -= 1\nprint(max(0,ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1523926179", "date2": "1523926608", "bleu_score": "0.6062827237073545", "code1_test_status": [1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 65, "total_score": 101, "input": "gggggpppgg\n", "actual_output": "-1\n", "expected_output": "2\n\n", "anno_code": ["lis = list(input()) # (0): lis=['g', 'g', 'g', 'g', 'g', 'p', 'p', 'p', 'g', 'g']\ncou = 0 # (1): cou=0\nans = 0 # (2): ans=0\nfor i in range(len(lis)): # (3): i=0 (7): i=1 ... (46): NO CHANGE\n if cou > 0 and lis[i] == \"g\": # (4): NO CHANGE (8): NO CHANGE ... (43): NO CHANGE\n cou -= 1 # (9): cou=0 (17): cou=0 ... (44): cou=2\n ans += 1 # (10): ans=1 (18): ans=2 ... (45): ans=1\n else:\n cou += 1 # (5): cou=1 (13): cou=1 ... (35): cou=4\n if lis[i] == \"p\": # (6): NO CHANGE (14): NO CHANGE ... (36): NO CHANGE\n ans -= 1 # (27): ans=1 (32): ans=0 (37): ans=-1\nprint(ans - cou)"], "anno_status": [true], "diff_content": " lis = list(input())\n cou = 0\n ans = 0\n for i in range(len(lis)):\n- if cou > 0 and lis[i] == \"g\":\n- cou -= 1\n- ans += 1\n- else:\n- cou += 1\n- if lis[i] == \"p\":\n- ans -= 1\n-print(ans - cou)\n+\tif lis[i] == \"g\":\n+\t\tif cou > 0:\n+\t\t\tcou -= 1\n+\t\t\tans += 1\n+\t\telse:\n+\t\t\tcou += 1\n+\telse:\n+\t\tif cou > 0:\n+\t\t\tcou -= 1\n+\t\telse:\n+\t\t\tcou += 1\n+\t\t\tans -= 1\n+print(max(0,ans))\n+\n", "FL_content": " lis = list(input())\n cou = 0\n ans = 0\n for i in range(len(lis)):\n- if cou > 0 and lis[i] == \"g\":\n- cou -= 1\n- ans += 1\n- else:\n- cou += 1\n- if lis[i] == \"p\":\n- ans -= 1\n-print(ans - cou)\n", "added_lines": 14, "removed_lines": 8, "code1_lines": 12 }, { "user_id": "u944209426", "problem_id": "p03965", "submission1_id": "s292004126", "submission2_id": "s320814718", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nn=len(s)\nres=0\ntg,tp=0,0\nfor i in range(n):\n if s[i]==\"g\":\n if tg>tp:\n tp+=1\n res+=1\n else:\n tg+=1\n else:\n if tg<=tp:\n tp+=1\n else:\n tg+=1\n res-=1\nprint(res)", "code2": "s=input()\nn=len(s)\nres=0\ntg,tp=0,0\nfor i in range(n):\n if s[i]==\"g\":\n if tg>tp:\n tp+=1\n res+=1\n else:\n tg+=1\n else:\n if tg>tp:\n tp+=1\n else:\n tg+=1\n res-=1\nprint(res)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1540952532", "date2": "1540952578", "bleu_score": "0.9868042038798273", "code1_test_status": [1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 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, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 66, "total_score": 101, "input": "ggpggpgggp\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["s=input() # (0): s=ggpggpgggp\nn=len(s) # (1): n=10\nres=0 # (2): res=0\ntg,tp=0,0 # (3): tg=0, tp=0\nfor i in range(n): # (4): i=0 (8): i=1 ... (49): NO CHANGE\n if s[i]==\"g\": # (5): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n if tg>tp: # (6): NO CHANGE (10): NO CHANGE ... (42): NO CHANGE\n tp+=1 # (11): tp=1 (33): tp=3 (38): tp=4\n res+=1 # (12): res=1 (34): res=1 (39): res=2\n else:\n tg+=1 # (7): tg=1 (20): tg=2 ... (43): tg=5\n else:\n if tg<=tp: # (15): NO CHANGE (27): NO CHANGE (46): NO CHANGE\n tp+=1 # (16): tp=2\n else:\n tg+=1 # (28): tg=4 (47): tg=6\n res-=1 # (29): res=0 (48): res=1\nprint(res)"], "anno_status": [true], "diff_content": " s=input()\n n=len(s)\n res=0\n tg,tp=0,0\n for i in range(n):\n if s[i]==\"g\":\n if tg>tp:\n tp+=1\n res+=1\n else:\n tg+=1\n else:\n- if tg<=tp:\n+ if tg>tp:\n tp+=1\n else:\n tg+=1\n res-=1\n print(res)\n", "FL_content": " s=input()\n n=len(s)\n res=0\n tg,tp=0,0\n for i in range(n):\n if s[i]==\"g\":\n if tg>tp:\n tp+=1\n res+=1\n else:\n tg+=1\n else:\n- if tg<=tp:\n tp+=1\n else:\n tg+=1\n res-=1\n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u940102677", "problem_id": "p04019", "submission1_id": "s502210307", "submission2_id": "s616951003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(input())\nprint(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) and ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")", "code2": "a = list(input())\nprint(\"No\" if ((\"N\" in a) ^ (\"S\" in a)) or ((\"W\" in a) ^ (\"E\" in a)) else \"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1538442406", "date2": "1538442834", "bleu_score": "0.8820300435355595", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 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, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 30, "total_score": 102, "input": "NWND\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a = list(input()) # (0): a=['N', 'W', 'N', 'D']\nprint(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) and ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")"], "anno_status": [true], "diff_content": " a = list(input())\n-print(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) and ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")\n+print(\"No\" if ((\"N\" in a) ^ (\"S\" in a)) or ((\"W\" in a) ^ (\"E\" in a)) else \"Yes\")\n", "FL_content": " a = list(input())\n-print(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) and ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u645250356", "problem_id": "p04019", "submission1_id": "s963392513", "submission2_id": "s189170823", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter,defaultdict,deque\nfrom heapq import heappop,heappush,heapify\nimport sys,bisect,math,itertools\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\nmod2 = 998244353\nINF = float('inf')\ndef inp(): return int(sys.stdin.readline())\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\ndef inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\n\ns = input()\nn = len(s)\nu = 0\nl = 0\nfor i in s:\n if i == 'N':\n u += 1\n elif i == 'S':\n u -= 1\n elif i == 'E':\n l += 1\n else:\n l -= 1\n if u == 0 and l == 0:\n print('Yes')\n break\nelse:\n print('No')\n\n ", "code2": "from collections import Counter,defaultdict,deque\nfrom heapq import heappop,heappush,heapify\nimport sys,bisect,math,itertools\nsys.setrecursionlimit(10**8)\nmod = 10**9+7\nmod2 = 998244353\nINF = float('inf')\ndef inp(): return int(sys.stdin.readline())\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\ndef inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\n\ns = input()\nc = Counter(s)\na,b,c,d = [c['N'], c['S'], c['W'], c['E']]\nif (a and b) or (not a and not b):\n if (c and d) or (not c and not d):\n print('Yes')\n quit()\nprint('No')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574200088", "date2": "1574481798", "bleu_score": "0.718544248841702", "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, 0, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 94, "total_score": 102, "input": "YENN\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["from collections import Counter,defaultdict,deque\nfrom heapq import heappop,heappush,heapify\nimport sys,bisect,math,itertools\nsys.setrecursionlimit(10**8) # (0): NO CHANGE\nmod = 10**9+7 # (1): mod=1000000007\nmod2 = 998244353 # (2): mod2=998244353\nINF = float('inf') # (3): INF=inf, inp=, inpl=, inpln=\ndef inp(): return int(sys.stdin.readline())\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\ndef inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\n\ns = input() # (4): s=YENN\nn = len(s) # (5): n=4\nu = 0 # (6): u=0\nl = 0 # (7): l=0\nfor i in s: # (8): i=Y (14): i=E\n if i == 'N': # (9): NO CHANGE (15): NO CHANGE\n u += 1\n elif i == 'S': # (10): NO CHANGE (16): NO CHANGE\n u -= 1\n elif i == 'E': # (11): NO CHANGE (17): NO CHANGE\n l += 1 # (18): l=0\n else:\n l -= 1 # (12): l=-1\n if u == 0 and l == 0: # (13): NO CHANGE (19): NO CHANGE\n print('Yes') # (20): NO CHANGE\n break\nelse:\n print('No')\n\n "], "anno_status": [true], "diff_content": " from collections import Counter,defaultdict,deque\n from heapq import heappop,heappush,heapify\n import sys,bisect,math,itertools\n sys.setrecursionlimit(10**8)\n mod = 10**9+7\n mod2 = 998244353\n INF = float('inf')\n def inp(): return int(sys.stdin.readline())\n def inpl(): return list(map(int, sys.stdin.readline().split()))\n def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\n \n s = input()\n-n = len(s)\n-u = 0\n-l = 0\n-for i in s:\n- if i == 'N':\n- u += 1\n- elif i == 'S':\n- u -= 1\n- elif i == 'E':\n- l += 1\n- else:\n- l -= 1\n- if u == 0 and l == 0:\n+c = Counter(s)\n+a,b,c,d = [c['N'], c['S'], c['W'], c['E']]\n+if (a and b) or (not a and not b):\n+ if (c and d) or (not c and not d):\n print('Yes')\n- break\n-else:\n- print('No')\n-\n- \n+ quit()\n+print('No')\n", "FL_content": " from collections import Counter,defaultdict,deque\n from heapq import heappop,heappush,heapify\n import sys,bisect,math,itertools\n sys.setrecursionlimit(10**8)\n mod = 10**9+7\n mod2 = 998244353\n INF = float('inf')\n def inp(): return int(sys.stdin.readline())\n def inpl(): return list(map(int, sys.stdin.readline().split()))\n def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))\n \n s = input()\n-n = len(s)\n-u = 0\n-l = 0\n-for i in s:\n- if i == 'N':\n- u += 1\n- elif i == 'S':\n- u -= 1\n- elif i == 'E':\n- l += 1\n- else:\n- l -= 1\n- if u == 0 and l == 0:\n print('Yes')\n- break\n-else:\n- print('No')\n-\n- \n", "added_lines": 6, "removed_lines": 18, "code1_lines": 31 }, { "user_id": "u740284863", "problem_id": "p04019", "submission1_id": "s332643124", "submission2_id": "s392075099", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = str(input())\n\n\nn = 0\nw = 0\ns = 0\ne = 0\nfor i in range(len(k)):\n if k[i] == \"N\":\n n += 1\n elif k[i] == \"W\":\n w += 1\n elif k[i] == \"S\":\n s += 1\n else:\n e += 1\nif (n == 0 and s > 0) or (s == 0 and n > 0) or (e == 0 and w > 0) or (w == 0 and e > 0):\n print(\"No\")\nelse:\n print(\"No\")", "code2": "k = str(input())\n\n\nn = 0\nw = 0\ns = 0\ne = 0\nfor i in range(len(k)):\n if k[i] == \"N\":\n n += 1\n elif k[i] == \"W\":\n w += 1\n elif k[i] == \"S\":\n s += 1\n else:\n e += 1\nif (n == 0 and s > 0) or (s == 0 and n > 0) or (e == 0 and w > 0) or (w == 0 and e > 0):\n print(\"No\")\nelse:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550090205", "date2": "1550090286", "bleu_score": "0.9869714365575545", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 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, 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, 0, 1, 0, 0, 1], "code1_test_score": 72, "total_score": 102, "input": "SEWN\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["k = str(input()) # (0): k=SEWN\n\n\nn = 0 # (1): n=0\nw = 0 # (2): w=0\ns = 0 # (3): s=0\ne = 0 # (4): e=0\nfor i in range(len(k)): # (5): i=0 (10): i=1 ... (22): NO CHANGE\n if k[i] == \"N\": # (6): NO CHANGE (11): NO CHANGE ... (20): NO CHANGE\n n += 1 # (21): n=1\n elif k[i] == \"W\": # (7): NO CHANGE (12): NO CHANGE (17): NO CHANGE\n w += 1 # (18): w=1\n elif k[i] == \"S\": # (8): NO CHANGE (13): NO CHANGE\n s += 1 # (9): s=1\n else:\n e += 1 # (14): e=1\nif (n == 0 and s > 0) or (s == 0 and n > 0) or (e == 0 and w > 0) or (w == 0 and e > 0): # (23): NO CHANGE\n print(\"No\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " k = str(input())\n \n \n n = 0\n w = 0\n s = 0\n e = 0\n for i in range(len(k)):\n if k[i] == \"N\":\n n += 1\n elif k[i] == \"W\":\n w += 1\n elif k[i] == \"S\":\n s += 1\n else:\n e += 1\n if (n == 0 and s > 0) or (s == 0 and n > 0) or (e == 0 and w > 0) or (w == 0 and e > 0):\n print(\"No\")\n else:\n- print(\"No\")\n+ print(\"Yes\")\n", "FL_content": " k = str(input())\n \n \n n = 0\n w = 0\n s = 0\n e = 0\n for i in range(len(k)):\n if k[i] == \"N\":\n n += 1\n elif k[i] == \"W\":\n w += 1\n elif k[i] == \"S\":\n s += 1\n else:\n e += 1\n if (n == 0 and s > 0) or (s == 0 and n > 0) or (e == 0 and w > 0) or (w == 0 and e > 0):\n print(\"No\")\n else:\n- print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u940102677", "problem_id": "p04019", "submission1_id": "s991625851", "submission2_id": "s616951003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(input())\nprint(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) or ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")", "code2": "a = list(input())\nprint(\"No\" if ((\"N\" in a) ^ (\"S\" in a)) or ((\"W\" in a) ^ (\"E\" in a)) else \"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1538442461", "date2": "1538442834", "bleu_score": "0.9192851330075009", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 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, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 30, "total_score": 102, "input": "NZDN\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a = list(input()) # (0): a=['N', 'Z', 'D', 'N']\nprint(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) or ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")"], "anno_status": [true], "diff_content": " a = list(input())\n-print(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) or ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")\n+print(\"No\" if ((\"N\" in a) ^ (\"S\" in a)) or ((\"W\" in a) ^ (\"E\" in a)) else \"Yes\")\n", "FL_content": " a = list(input())\n-print(\"Yes\" if ~((\"N\" in a) ^ (\"S\" in a)) or ~((\"W\" in a) ^ (\"E\" in a)) else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u601018334", "problem_id": "p04019", "submission1_id": "s162538298", "submission2_id": "s874858441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nN = 0\nS = 0\nW = 0\nE = 0\nfor i in range(len(s)) :\n str = s[i]\n if str == 'N' :\n N = 1\n elif str == 'S':\n S = 1\n elif str == 'W':\n W = 1\n elif str == 'E':\n E = 1\nif (N-S)==0 and (W-E)==0 :\n print('YES')\nelse:\n print('NO')\n", "code2": "s = input()\nN = 0\nS = 0\nW = 0\nE = 0\nfor i in range(len(s)) :\n str = s[i]\n if str == 'N' :\n N = 1\n elif str == 'S':\n S = 1\n elif str == 'W':\n W = 1\n elif str == 'E':\n E = 1\nif (N-S)==0 and (W-E)==0 :\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1471828798", "date2": "1471828896", "bleu_score": "0.9784673327905228", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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": "NNDW\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["s = input() # (0): s=NNDW\nN = 0 # (1): N=0\nS = 0 # (2): S=0\nW = 0 # (3): W=0\nE = 0 # (4): E=0\nfor i in range(len(s)) : # (5): i=0 (9): i=1 ... (25): NO CHANGE\n str = s[i] # (6): str=N (10): NO CHANGE ... (20): str=W\n if str == 'N' : # (7): NO CHANGE (11): NO CHANGE ... (21): NO CHANGE\n N = 1 # (8): N=1 (12): NO CHANGE\n elif str == 'S': # (16): NO CHANGE (22): NO CHANGE\n S = 1\n elif str == 'W': # (17): NO CHANGE (23): NO CHANGE\n W = 1 # (24): W=1\n elif str == 'E': # (18): NO CHANGE\n E = 1\nif (N-S)==0 and (W-E)==0 : # (26): NO CHANGE\n print('YES')\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " s = input()\n N = 0\n S = 0\n W = 0\n E = 0\n for i in range(len(s)) :\n str = s[i]\n if str == 'N' :\n N = 1\n elif str == 'S':\n S = 1\n elif str == 'W':\n W = 1\n elif str == 'E':\n E = 1\n if (N-S)==0 and (W-E)==0 :\n- print('YES')\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n \n", "FL_content": " s = input()\n N = 0\n S = 0\n W = 0\n E = 0\n for i in range(len(s)) :\n str = s[i]\n if str == 'N' :\n N = 1\n elif str == 'S':\n S = 1\n elif str == 'W':\n W = 1\n elif str == 'E':\n E = 1\n if (N-S)==0 and (W-E)==0 :\n- print('YES')\n else:\n- print('NO')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u186426563", "problem_id": "p04019", "submission1_id": "s569253180", "submission2_id": "s965090766", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nprint('Yes' if('W' in s == 'E' in s and 'S' in s == 'N' in s) else 'No')", "code2": "s = input()\nprint('Yes' if(('W' in s)==('E' in s) and ('N' in s)==('S' in s)) else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1526414648", "date2": "1526414731", "bleu_score": "0.791969987542263", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 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, 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, 0, 1, 0, 0, 1], "code1_test_score": 72, "total_score": 102, "input": "ENWS\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=ENWS\nprint('Yes' if('W' in s == 'E' in s and 'S' in s == 'N' in s) else 'No')"], "anno_status": [true], "diff_content": " s = input()\n-print('Yes' if('W' in s == 'E' in s and 'S' in s == 'N' in s) else 'No')\n+print('Yes' if(('W' in s)==('E' in s) and ('N' in s)==('S' in s)) else 'No')\n", "FL_content": " s = input()\n-print('Yes' if('W' in s == 'E' in s and 'S' in s == 'N' in s) else 'No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u181431922", "problem_id": "p04019", "submission1_id": "s236956216", "submission2_id": "s407485782", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ins = input().strip()\nif not ('S' in ins and 'N' in ins) and ('S' in ins or 'N' in ins):\n print('No')\n\nif not ('E' in ins and 'W' in ins) and ('E' in ins or 'W' in ins):\n print('No')\n\n \nprint('Yes')", "code2": "s = input().strip()\nif not ('S' in s and 'N' in s) and ('S' in s or 'N' in s):\n print('No')\n exit()\n\nif not ('E' in s and 'W' in s) and ('E' in s or 'W' in s):\n print('No')\n exit()\n\n \nprint('Yes')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546633482", "date2": "1546633536", "bleu_score": "0.809620638654697", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 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, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 30, "total_score": 102, "input": "NNYD\n", "actual_output": "No\nYes\n", "expected_output": "No\n\n", "anno_code": ["ins = input().strip() # (0): ins=NNYD\nif not ('S' in ins and 'N' in ins) and ('S' in ins or 'N' in ins): # (1): NO CHANGE\n print('No') # (2): NO CHANGE\n\nif not ('E' in ins and 'W' in ins) and ('E' in ins or 'W' in ins): # (3): NO CHANGE\n print('No')\n\n \nprint('Yes')"], "anno_status": [true], "diff_content": "-ins = input().strip()\n-if not ('S' in ins and 'N' in ins) and ('S' in ins or 'N' in ins):\n+s = input().strip()\n+if not ('S' in s and 'N' in s) and ('S' in s or 'N' in s):\n print('No')\n+ exit()\n \n-if not ('E' in ins and 'W' in ins) and ('E' in ins or 'W' in ins):\n+if not ('E' in s and 'W' in s) and ('E' in s or 'W' in s):\n print('No')\n+ exit()\n \n \n print('Yes')\n", "FL_content": "-ins = input().strip()\n-if not ('S' in ins and 'N' in ins) and ('S' in ins or 'N' in ins):\n print('No')\n \n-if not ('E' in ins and 'W' in ins) and ('E' in ins or 'W' in ins):\n print('No')\n \n \n print('Yes')\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u252729807", "problem_id": "p04019", "submission1_id": "s875825842", "submission2_id": "s822226863", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nif 'N' in s and 'W' in s and 'S' in s and 'E' in s:\n print('Yes')\nelif 'N' in s and 'W' in s and 'S' not in s and 'E' not in s:\n print('Yes')\nelif 'N' not in s and 'W' not in s and 'S' in s and 'E' in s:\n print('Yes')\nelse:\n print('No')", "code2": "s = input()\nif 'N' in s and 'W' in s and 'S' in s and 'E' in s:\n print('Yes')\nelif ('N' in s and 'S' in s) and ('W' not in s and 'E' not in s):\n print('Yes')\nelif ('N' not in s and 'S' not in s) and ('W' in s and 'E' in s):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587101426", "date2": "1587101639", "bleu_score": "0.9241898565851051", "code1_test_status": [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, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1], "code1_test_score": 87, "total_score": 102, "input": "WMEO\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=WMEO\nif 'N' in s and 'W' in s and 'S' in s and 'E' in s: # (1): NO CHANGE\n print('Yes')\nelif 'N' in s and 'W' in s and 'S' not in s and 'E' not in s: # (2): NO CHANGE\n print('Yes')\nelif 'N' not in s and 'W' not in s and 'S' in s and 'E' in s: # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " s = input()\n if 'N' in s and 'W' in s and 'S' in s and 'E' in s:\n print('Yes')\n-elif 'N' in s and 'W' in s and 'S' not in s and 'E' not in s:\n+elif ('N' in s and 'S' in s) and ('W' not in s and 'E' not in s):\n print('Yes')\n-elif 'N' not in s and 'W' not in s and 'S' in s and 'E' in s:\n+elif ('N' not in s and 'S' not in s) and ('W' in s and 'E' in s):\n print('Yes')\n else:\n print('No')\n", "FL_content": " s = input()\n if 'N' in s and 'W' in s and 'S' in s and 'E' in s:\n print('Yes')\n-elif 'N' in s and 'W' in s and 'S' not in s and 'E' not in s:\n print('Yes')\n-elif 'N' not in s and 'W' not in s and 'S' in s and 'E' in s:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u423585790", "problem_id": "p04019", "submission1_id": "s864565282", "submission2_id": "s467094058", "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 s = S()\n ans = [0, 0]\n for si in s:\n if si == \"N\":\n ans[0] = min(ans[0] + 1, 1)\n elif si == \"W\":\n ans[1] = min(ans[1] + 1, 1)\n elif si == \"S\":\n ans[0] = max(ans[0] - 1, -1)\n else:\n ans[1] = max(ans[1] - 1, -1)\n if ans == [0, 0]:\n print(\"Yes\")\n else:\n print(\"No\")\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 s = S()\n ans = [0, 0]\n for si in s:\n if si == \"N\":\n ans[0] |= 1\n elif si == \"W\":\n ans[1] |= 1\n elif si == \"S\":\n ans[0] |= 2\n else:\n ans[1] |= 2\n if ans[0] in [0, 3] and ans[1] in [0, 3]:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n\n\n\nif __name__ == '__main__':\n solve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578077757", "date2": "1578077985", "bleu_score": "0.9412318443689678", "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, 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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 95, "total_score": 102, "input": "NSNNSNSN\n", "actual_output": "No\n", "expected_output": "Yes\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 s = S()\n ans = [0, 0]\n for si in s:\n if si == \"N\":\n ans[0] = min(ans[0] + 1, 1)\n elif si == \"W\":\n ans[1] = min(ans[1] + 1, 1)\n elif si == \"S\":\n ans[0] = max(ans[0] - 1, -1)\n else:\n ans[1] = max(ans[1] - 1, -1)\n if ans == [0, 0]:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n\n\n\nif __name__ == '__main__':\n solve()\n"], "anno_status": [true], "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 s = S()\n ans = [0, 0]\n for si in s:\n if si == \"N\":\n- ans[0] = min(ans[0] + 1, 1)\n+ ans[0] |= 1\n elif si == \"W\":\n- ans[1] = min(ans[1] + 1, 1)\n+ ans[1] |= 1\n elif si == \"S\":\n- ans[0] = max(ans[0] - 1, -1)\n+ ans[0] |= 2\n else:\n- ans[1] = max(ans[1] - 1, -1)\n- if ans == [0, 0]:\n+ ans[1] |= 2\n+ if ans[0] in [0, 3] and ans[1] in [0, 3]:\n print(\"Yes\")\n else:\n print(\"No\")\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 s = S()\n ans = [0, 0]\n for si in s:\n if si == \"N\":\n- ans[0] = min(ans[0] + 1, 1)\n elif si == \"W\":\n- ans[1] = min(ans[1] + 1, 1)\n elif si == \"S\":\n- ans[0] = max(ans[0] - 1, -1)\n else:\n- ans[1] = max(ans[1] - 1, -1)\n- if ans == [0, 0]:\n print(\"Yes\")\n else:\n print(\"No\")\n return\n \n \n \n if __name__ == '__main__':\n solve()\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 49 }, { "user_id": "u306950978", "problem_id": "p04019", "submission1_id": "s133229669", "submission2_id": "s421173356", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nkita = s.count(\"N\")\nmina = s.count(\"W\")\nnisi = s.count(\"S\")\nhiga = s.count(\"E\")\n\nif kita + mina != 0 and kita*mina == 0:\n print(\"No\")\n exit()\nif nisi + higa != 0 and nisi*higa == 0:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "code2": "s = input()\nkita = s.count(\"N\")\nmina = s.count(\"S\")\nnisi = s.count(\"W\")\nhiga = s.count(\"E\")\n\nif kita + mina != 0 and kita*mina == 0:\n print(\"No\")\n exit()\nif nisi + higa != 0 and nisi*higa == 0:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589063893", "date2": "1589063980", "bleu_score": "1.0", "code1_test_status": [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, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1], "code1_test_score": 87, "total_score": 102, "input": "WNDN\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["s = input() # (0): s=WNDN\nkita = s.count(\"N\") # (1): kita=2\nmina = s.count(\"W\") # (2): mina=1\nnisi = s.count(\"S\") # (3): nisi=0\nhiga = s.count(\"E\") # (4): higa=0\n\nif kita + mina != 0 and kita*mina == 0: # (5): NO CHANGE\n print(\"No\")\n exit()\nif nisi + higa != 0 and nisi*higa == 0: # (6): NO CHANGE\n print(\"No\")\n exit()\n\nprint(\"Yes\")"], "anno_status": [true], "diff_content": " s = input()\n kita = s.count(\"N\")\n-mina = s.count(\"W\")\n-nisi = s.count(\"S\")\n+mina = s.count(\"S\")\n+nisi = s.count(\"W\")\n higa = s.count(\"E\")\n \n if kita + mina != 0 and kita*mina == 0:\n print(\"No\")\n exit()\n if nisi + higa != 0 and nisi*higa == 0:\n print(\"No\")\n exit()\n \n print(\"Yes\")\n", "FL_content": " s = input()\n kita = s.count(\"N\")\n-mina = s.count(\"W\")\n-nisi = s.count(\"S\")\n higa = s.count(\"E\")\n \n if kita + mina != 0 and kita*mina == 0:\n print(\"No\")\n exit()\n if nisi + higa != 0 and nisi*higa == 0:\n print(\"No\")\n exit()\n \n print(\"Yes\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u725133562", "problem_id": "p04019", "submission1_id": "s877234796", "submission2_id": "s110178136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nl = len(s)\njudge = 0\nif 'N' in s:\n judge += 2\nif 'W' in s:\n judge += 1/1000\nif 'S' in s:\n judge -= 2\nif 'E' in s:\n judge -= 1/1000\n\nprint('Yes' if judge == 0 else 'No')", "code2": "s = input()\nl = len(s)\njudge = 0\nif 'N' in s:\n judge += 1000\nif 'W' in s:\n judge += 1\nif 'S' in s:\n judge -= 1000\nif 'E' in s:\n judge -= 1\n\nprint('Yes' if judge == 0 else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590215677", "date2": "1590215765", "bleu_score": "0.9429382187120569", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 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, 0, 1, 1, 1, 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], "code1_test_score": 79, "total_score": 102, "input": "NEWS\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=NEWS\nl = len(s) # (1): l=4\njudge = 0 # (2): judge=0\nif 'N' in s: # (3): NO CHANGE\n judge += 2 # (4): judge=2\nif 'W' in s: # (5): NO CHANGE\n judge += 1/1000 # (6): judge=2.001\nif 'S' in s: # (7): NO CHANGE\n judge -= 2 # (8): judge=0.001\nif 'E' in s: # (9): NO CHANGE\n judge -= 1/1000 # (10): judge=-0\n\nprint('Yes' if judge == 0 else 'No')"], "anno_status": [true], "diff_content": " s = input()\n l = len(s)\n judge = 0\n if 'N' in s:\n- judge += 2\n+ judge += 1000\n if 'W' in s:\n- judge += 1/1000\n+ judge += 1\n if 'S' in s:\n- judge -= 2\n+ judge -= 1000\n if 'E' in s:\n- judge -= 1/1000\n+ judge -= 1\n \n print('Yes' if judge == 0 else 'No')\n", "FL_content": " s = input()\n l = len(s)\n judge = 0\n if 'N' in s:\n- judge += 2\n if 'W' in s:\n- judge += 1/1000\n if 'S' in s:\n- judge -= 2\n if 'E' in s:\n- judge -= 1/1000\n \n print('Yes' if judge == 0 else 'No')\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u086503932", "problem_id": "p04019", "submission1_id": "s400551564", "submission2_id": "s239290941", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\na = S.count('N')\nb = S.count('S')\nc = S.count('E') \nd = S.count('W')\n\nif a*b > 0 and c==0 and d==0:\n print('Yes')\nelif c*d >0 and a==0 and b==0:\n print('Yes')\nelif a==0 and b==0 and c==0 and d==0:\n print('Yes')\nelse:\n print('No')", "code2": "S = input()\na = S.count('N')\nb = S.count('S')\nc = S.count('E') \nd = S.count('W')\n\nif a*b*c*d > 0:\n print('Yes')\nelif a*b > 0 and c==0 and d==0:\n print('Yes')\nelif c*d >0 and a==0 and b==0:\n print('Yes')\nelif a==0 and b==0 and c==0 and d==0:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587334090", "date2": "1587334168", "bleu_score": "0.8806489109203681", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 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, 0, 1, 1, 1, 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], "code1_test_score": 79, "total_score": 102, "input": "WESN\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["S = input() # (0): S=WESN\na = S.count('N') # (1): a=1\nb = S.count('S') # (2): b=1\nc = S.count('E') # (3): c=1\nd = S.count('W') # (4): d=1\n\nif a*b > 0 and c==0 and d==0: # (5): NO CHANGE\n print('Yes')\nelif c*d >0 and a==0 and b==0: # (6): NO CHANGE\n print('Yes')\nelif a==0 and b==0 and c==0 and d==0: # (7): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " S = input()\n a = S.count('N')\n b = S.count('S')\n c = S.count('E') \n d = S.count('W')\n \n-if a*b > 0 and c==0 and d==0:\n+if a*b*c*d > 0:\n+ print('Yes')\n+elif a*b > 0 and c==0 and d==0:\n print('Yes')\n elif c*d >0 and a==0 and b==0:\n print('Yes')\n elif a==0 and b==0 and c==0 and d==0:\n print('Yes')\n else:\n print('No')\n", "FL_content": " S = input()\n a = S.count('N')\n b = S.count('S')\n c = S.count('E') \n d = S.count('W')\n \n-if a*b > 0 and c==0 and d==0:\n print('Yes')\n elif c*d >0 and a==0 and b==0:\n print('Yes')\n elif a==0 and b==0 and c==0 and d==0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u394244719", "problem_id": "p04019", "submission1_id": "s874638858", "submission2_id": "s123245050", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom collections import Counter\n\ninint = lambda: int(sys.stdin.readline())\ninintm = lambda: map(int, sys.stdin.readline().split())\ninintl = lambda: list(inintm())\ninstrm = lambda: map(str, sys.stdin.readline().split())\ninstrl = lambda: list(instrm())\n\ns = input()\n\nif not (\"N\" in s and \"S\" in s):\n print(\"No\")\n exit()\n if not (\"E\" in s and \"W\" in s):\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "code2": "import sys\nfrom collections import Counter\n\ninint = lambda: int(sys.stdin.readline())\ninintm = lambda: map(int, sys.stdin.readline().split())\ninintl = lambda: list(inintm())\ninstrm = lambda: map(str, sys.stdin.readline().split())\ninstrl = lambda: list(instrm())\n\ns = input()\n\nif \"N\" in s and \"S\" in s and \"E\" in s and \"W\" in s:\n print(\"Yes\")\n exit()\n\nif (\"N\" in s and \"S\" in s) and (\"E\" not in s and \"W\" not in s):\n print(\"Yes\")\n exit()\n\nif (\"E\" in s and \"W\" in s) and (\"N\" not in s and \"S\" not in s):\n print(\"Yes\")\n exit()\n\nprint(\"No\")", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597014767", "date2": "1597015284", "bleu_score": "0.7341474094857974", "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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "MWER\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n from collections import Counter\n \n inint = lambda: int(sys.stdin.readline())\n inintm = lambda: map(int, sys.stdin.readline().split())\n inintl = lambda: list(inintm())\n instrm = lambda: map(str, sys.stdin.readline().split())\n instrl = lambda: list(instrm())\n \n s = input()\n \n-if not (\"N\" in s and \"S\" in s):\n- print(\"No\")\n+if \"N\" in s and \"S\" in s and \"E\" in s and \"W\" in s:\n+ print(\"Yes\")\n exit()\n- if not (\"E\" in s and \"W\" in s):\n- print(\"No\")\n- exit()\n \n-print(\"Yes\")\n+if (\"N\" in s and \"S\" in s) and (\"E\" not in s and \"W\" not in s):\n+ print(\"Yes\")\n+ exit()\n+\n+if (\"E\" in s and \"W\" in s) and (\"N\" not in s and \"S\" not in s):\n+ print(\"Yes\")\n+ exit()\n+\n+print(\"No\")\n", "FL_content": " import sys\n from collections import Counter\n \n inint = lambda: int(sys.stdin.readline())\n inintm = lambda: map(int, sys.stdin.readline().split())\n inintl = lambda: list(inintm())\n instrm = lambda: map(str, sys.stdin.readline().split())\n instrl = lambda: list(instrm())\n \n s = input()\n \n-if not (\"N\" in s and \"S\" in s):\n- print(\"No\")\n exit()\n- if not (\"E\" in s and \"W\" in s):\n- print(\"No\")\n- exit()\n \n-print(\"Yes\")\n", "added_lines": 11, "removed_lines": 6, "code1_lines": 19 }, { "user_id": "u725133562", "problem_id": "p04019", "submission1_id": "s290482881", "submission2_id": "s110178136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nl = len(s)\njudge = 0\nif 'N' in s:\n judge += 1\nif 'W' in s:\n judge += 1/1000\nif 'S' in s:\n judge -= 1\nif 'E' in s:\n judge -= 1/1000\n\nprint('Yes' if judge == 0 else 'No')", "code2": "s = input()\nl = len(s)\njudge = 0\nif 'N' in s:\n judge += 1000\nif 'W' in s:\n judge += 1\nif 'S' in s:\n judge -= 1000\nif 'E' in s:\n judge -= 1\n\nprint('Yes' if judge == 0 else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590215619", "date2": "1590215765", "bleu_score": "0.9629410196491461", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 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, 0, 1, 1, 1, 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], "code1_test_score": 79, "total_score": 102, "input": "NESW\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=NESW\nl = len(s) # (1): l=4\njudge = 0 # (2): judge=0\nif 'N' in s: # (3): NO CHANGE\n judge += 1 # (4): judge=1\nif 'W' in s: # (5): NO CHANGE\n judge += 1/1000 # (6): judge=1.001\nif 'S' in s: # (7): NO CHANGE\n judge -= 1 # (8): judge=0.001\nif 'E' in s: # (9): NO CHANGE\n judge -= 1/1000 # (10): judge=-0\n\nprint('Yes' if judge == 0 else 'No')"], "anno_status": [true], "diff_content": " s = input()\n l = len(s)\n judge = 0\n if 'N' in s:\n- judge += 1\n+ judge += 1000\n if 'W' in s:\n- judge += 1/1000\n+ judge += 1\n if 'S' in s:\n- judge -= 1\n+ judge -= 1000\n if 'E' in s:\n- judge -= 1/1000\n+ judge -= 1\n \n print('Yes' if judge == 0 else 'No')\n", "FL_content": " s = input()\n l = len(s)\n judge = 0\n if 'N' in s:\n- judge += 1\n if 'W' in s:\n- judge += 1/1000\n if 'S' in s:\n- judge -= 1\n if 'E' in s:\n- judge -= 1/1000\n \n print('Yes' if judge == 0 else 'No')\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u411858517", "problem_id": "p04019", "submission1_id": "s007278134", "submission2_id": "s851051568", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\ntmp = [0 for _ in range(4)]\n\nres = 'Yes'\nfor i in range(len(S)):\n if S[i] == 'S':\n tmp[0] = 1\n elif S[i] == 'N':\n tmp[1] = 1\n elif S[i] == 'W':\n tmp[2] = 1\n else:\n tmp[2] = 1\n \nif tmp[0] == 1 and tmp[1] == 0:\n res = 'No'\nif tmp[1] == 1 and tmp[0] == 0:\n res = 'No'\nif tmp[2] == 1 and tmp[3] == 0:\n res = 'No'\nif tmp[3] == 1 and tmp[2] == 0:\n res = 'No'\n\nprint(res)\n\n", "code2": "S = input()\n\ntmp = [0 for _ in range(4)]\n\nres = 'Yes'\nfor i in range(len(S)):\n if S[i] == 'S':\n tmp[0] = 1\n elif S[i] == 'N':\n tmp[1] = 1\n elif S[i] == 'W':\n tmp[2] = 1\n else:\n tmp[3] = 1\n \nif tmp[0] == 1 and tmp[1] == 0:\n res = 'No'\nif tmp[1] == 1 and tmp[0] == 0:\n res = 'No'\nif tmp[2] == 1 and tmp[3] == 0:\n res = 'No'\nif tmp[3] == 1 and tmp[2] == 0:\n res = 'No'\n\nprint(res)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551404486", "date2": "1551404543", "bleu_score": "0.9942626876947902", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 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, 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, 0, 1, 1, 0, 1], "code1_test_score": 75, "total_score": 102, "input": "SENW\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["S = input() # (0): S=SENW\n\ntmp = [0 for _ in range(4)] # (1): tmp=[0, 0, 0, 0]\n\nres = 'Yes' # (2): res=Yes\nfor i in range(len(S)): # (3): i=0 (6): i=1 ... (20): NO CHANGE\n if S[i] == 'S': # (4): NO CHANGE (7): NO CHANGE ... (16): NO CHANGE\n tmp[0] = 1 # (5): tmp=[1, 0, 0, 0]\n elif S[i] == 'N': # (8): NO CHANGE (13): NO CHANGE (17): NO CHANGE\n tmp[1] = 1 # (14): tmp=[1, 1, 1, 0]\n elif S[i] == 'W': # (9): NO CHANGE (18): NO CHANGE\n tmp[2] = 1 # (19): NO CHANGE\n else:\n tmp[2] = 1 # (10): tmp=[1, 0, 1, 0]\n \nif tmp[0] == 1 and tmp[1] == 0: # (21): NO CHANGE\n res = 'No'\nif tmp[1] == 1 and tmp[0] == 0: # (22): NO CHANGE\n res = 'No'\nif tmp[2] == 1 and tmp[3] == 0: # (23): NO CHANGE\n res = 'No' # (24): res=No\nif tmp[3] == 1 and tmp[2] == 0: # (25): NO CHANGE\n res = 'No'\n\nprint(res)\n\n"], "anno_status": [true], "diff_content": " S = input()\n \n tmp = [0 for _ in range(4)]\n \n res = 'Yes'\n for i in range(len(S)):\n if S[i] == 'S':\n tmp[0] = 1\n elif S[i] == 'N':\n tmp[1] = 1\n elif S[i] == 'W':\n tmp[2] = 1\n else:\n- tmp[2] = 1\n+ tmp[3] = 1\n \n if tmp[0] == 1 and tmp[1] == 0:\n res = 'No'\n if tmp[1] == 1 and tmp[0] == 0:\n res = 'No'\n if tmp[2] == 1 and tmp[3] == 0:\n res = 'No'\n if tmp[3] == 1 and tmp[2] == 0:\n res = 'No'\n \n print(res)\n \n \n", "FL_content": " S = input()\n \n tmp = [0 for _ in range(4)]\n \n res = 'Yes'\n for i in range(len(S)):\n if S[i] == 'S':\n tmp[0] = 1\n elif S[i] == 'N':\n tmp[1] = 1\n elif S[i] == 'W':\n tmp[2] = 1\n else:\n- tmp[2] = 1\n \n if tmp[0] == 1 and tmp[1] == 0:\n res = 'No'\n if tmp[1] == 1 and tmp[0] == 0:\n res = 'No'\n if tmp[2] == 1 and tmp[3] == 0:\n res = 'No'\n if tmp[3] == 1 and tmp[2] == 0:\n res = 'No'\n \n print(res)\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u361381049", "problem_id": "p04019", "submission1_id": "s476655014", "submission2_id": "s875717904", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nans = 'Yes'\nn = 0\nw = 0\nsow = 0\ne = 0\n\nfor i in range(len(s)):\n if s[i] == 'N':\n n += 1\n elif s[i] == 'W':\n w += 1\n elif s[i] == 'S':\n sow += 1\n else:\n e += 1\n\n\n\nif (n == 0 and w != 0) or (n != 0 and w == 0):\n ans = 'No'\nif (sow == 0 and e != 0) or (sow != 0 and e == 0):\n ans = 'NO'\nprint(ans)", "code2": "s = input()\nans = 'Yes'\nn = 0\nw = 0\nsow = 0\ne = 0\n\nfor i in range(len(s)):\n if s[i] == 'N':\n n += 1\n elif s[i] == 'W':\n w += 1\n elif s[i] == 'S':\n sow += 1\n else:\n e += 1\n\n\n\nif (n == 0 and sow != 0) or (n != 0 and sow == 0):\n ans = 'No'\nif (w == 0 and e != 0) or (w != 0 and e == 0):\n ans = 'No'\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580874004", "date2": "1580874184", "bleu_score": "0.9727906851096648", "code1_test_status": [1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 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, 1, 0, 0, 0, 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, 1, 0], "code1_test_score": 23, "total_score": 102, "input": "NXNF\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["s = input() # (0): s=NXNF\nans = 'Yes' # (1): ans=Yes\nn = 0 # (2): n=0\nw = 0 # (3): w=0\nsow = 0 # (4): sow=0\ne = 0 # (5): e=0\n\nfor i in range(len(s)): # (6): i=0 (9): i=1 ... (22): NO CHANGE\n if s[i] == 'N': # (7): NO CHANGE (10): NO CHANGE ... (18): NO CHANGE\n n += 1 # (8): n=1 (16): n=2\n elif s[i] == 'W': # (11): NO CHANGE (19): NO CHANGE\n w += 1\n elif s[i] == 'S': # (12): NO CHANGE (20): NO CHANGE\n sow += 1\n else:\n e += 1 # (13): e=1 (21): e=2\n\n\n\nif (n == 0 and w != 0) or (n != 0 and w == 0): # (23): NO CHANGE\n ans = 'No' # (24): ans=No\nif (sow == 0 and e != 0) or (sow != 0 and e == 0): # (25): NO CHANGE\n ans = 'NO' # (26): ans=NO\nprint(ans)"], "anno_status": [true], "diff_content": " s = input()\n ans = 'Yes'\n n = 0\n w = 0\n sow = 0\n e = 0\n \n for i in range(len(s)):\n if s[i] == 'N':\n n += 1\n elif s[i] == 'W':\n w += 1\n elif s[i] == 'S':\n sow += 1\n else:\n e += 1\n \n \n \n-if (n == 0 and w != 0) or (n != 0 and w == 0):\n+if (n == 0 and sow != 0) or (n != 0 and sow == 0):\n+ ans = 'No'\n+if (w == 0 and e != 0) or (w != 0 and e == 0):\n ans = 'No'\n-if (sow == 0 and e != 0) or (sow != 0 and e == 0):\n- ans = 'NO'\n print(ans)\n+\n", "FL_content": " s = input()\n ans = 'Yes'\n n = 0\n w = 0\n sow = 0\n e = 0\n \n for i in range(len(s)):\n if s[i] == 'N':\n n += 1\n elif s[i] == 'W':\n w += 1\n elif s[i] == 'S':\n sow += 1\n else:\n e += 1\n \n \n \n-if (n == 0 and w != 0) or (n != 0 and w == 0):\n ans = 'No'\n-if (sow == 0 and e != 0) or (sow != 0 and e == 0):\n- ans = 'NO'\n print(ans)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 24 }, { "user_id": "u309141201", "problem_id": "p04019", "submission1_id": "s697834595", "submission2_id": "s762077275", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nS = input()\n\n\ncn = S.count('N')\nce = S.count('E')\ncs = S.count('S')\ncw = S.count('W')\nif cn > 0 and cs > 0 and ce < 0 and cw < 0:\n print('Yes')\nelif cn < 0 and cs < 0 and ce > 0 and cw > 0:\n print('Yes')\nelif cn > 0 and cs > 0 and ce > 0 and cw > 0:\n print('Yes')\nelse:\n print('No')\n", "code2": "\nS = input()\n\n\ncn = S.count('N')\nce = S.count('E')\ncs = S.count('S')\ncw = S.count('W')\n\nif cn > 0 and cs > 0 and ce == 0 and cw == 0:\n print('Yes')\nelif cn == 0 and cs == 0 and ce > 0 and cw > 0:\n print('Yes')\nelif cn > 0 and cs > 0 and ce > 0 and cw > 0:\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588019732", "date2": "1588019863", "bleu_score": "0.947179172517341", "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, 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, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 95, "total_score": 102, "input": "MWER\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\nS = input() # (0): S=MWER\n\n\ncn = S.count('N') # (1): cn=0\nce = S.count('E') # (2): ce=1\ncs = S.count('S') # (3): cs=0\ncw = S.count('W') # (4): cw=1\nif cn > 0 and cs > 0 and ce < 0 and cw < 0: # (5): NO CHANGE\n print('Yes')\nelif cn < 0 and cs < 0 and ce > 0 and cw > 0: # (6): NO CHANGE\n print('Yes')\nelif cn > 0 and cs > 0 and ce > 0 and cw > 0: # (7): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " \n S = input()\n \n \n cn = S.count('N')\n ce = S.count('E')\n cs = S.count('S')\n cw = S.count('W')\n-if cn > 0 and cs > 0 and ce < 0 and cw < 0:\n+\n+if cn > 0 and cs > 0 and ce == 0 and cw == 0:\n print('Yes')\n-elif cn < 0 and cs < 0 and ce > 0 and cw > 0:\n+elif cn == 0 and cs == 0 and ce > 0 and cw > 0:\n print('Yes')\n elif cn > 0 and cs > 0 and ce > 0 and cw > 0:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " \n S = input()\n \n \n cn = S.count('N')\n ce = S.count('E')\n cs = S.count('S')\n cw = S.count('W')\n-if cn > 0 and cs > 0 and ce < 0 and cw < 0:\n print('Yes')\n-elif cn < 0 and cs < 0 and ce > 0 and cw > 0:\n print('Yes')\n elif cn > 0 and cs > 0 and ce > 0 and cw > 0:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u729133443", "problem_id": "p04019", "submission1_id": "s671837659", "submission2_id": "s587145272", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nif 'S' in s and 'N' in s or not ('S' in s or 'N' in s) or 'E' in s and 'W' in s or not ('E' in s or 'W' in s):\n print('Yes')\nelse:\n print('No')", "code2": "s = list(input())\nif ('N' in s and 'S' in s or not ('N' in s or 'S' in s)) and ('E' in s and 'W' in s or not ('E' in s or 'W' in s)):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1526252709", "date2": "1526253212", "bleu_score": "0.9165027237094538", "code1_test_status": [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, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 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, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0], "code1_test_score": 60, "total_score": 102, "input": "XDNN\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["s = list(input()) # (0): s=['X', 'D', 'N', 'N']\nif 'S' in s and 'N' in s or not ('S' in s or 'N' in s) or 'E' in s and 'W' in s or not ('E' in s or 'W' in s): # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " s = list(input())\n-if 'S' in s and 'N' in s or not ('S' in s or 'N' in s) or 'E' in s and 'W' in s or not ('E' in s or 'W' in s):\n+if ('N' in s and 'S' in s or not ('N' in s or 'S' in s)) and ('E' in s and 'W' in s or not ('E' in s or 'W' in s)):\n print('Yes')\n else:\n print('No')\n", "FL_content": " s = list(input())\n-if 'S' in s and 'N' in s or not ('S' in s or 'N' in s) or 'E' in s and 'W' in s or not ('E' in s or 'W' in s):\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u597455618", "problem_id": "p04019", "submission1_id": "s155717456", "submission2_id": "s015711799", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nif s.count(\"N\") == s.count(\"S\") and s.count(\"W\") == s.count(\"E\"):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "s = input()\nif len(set(s))%2 == 0 and ((s.count(\"N\") and s.count(\"S\")) != 0 or (s.count(\"W\") and s.count(\"E\")) != 0):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574911765", "date2": "1574912674", "bleu_score": "0.6810131064261017", "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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], "code1_test_score": 99, "total_score": 102, "input": "NSNNSNSN\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["s = input() # (0): s=NSNNSNSN\nif s.count(\"N\") == s.count(\"S\") and s.count(\"W\") == s.count(\"E\"): # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " s = input()\n-if s.count(\"N\") == s.count(\"S\") and s.count(\"W\") == s.count(\"E\"):\n+if len(set(s))%2 == 0 and ((s.count(\"N\") and s.count(\"S\")) != 0 or (s.count(\"W\") and s.count(\"E\")) != 0):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " s = input()\n-if s.count(\"N\") == s.count(\"S\") and s.count(\"W\") == s.count(\"E\"):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u682730715", "problem_id": "p04019", "submission1_id": "s718686408", "submission2_id": "s413577259", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nN = 0\nW = 0\nS = 0\nE = 0\nfor i in s:\n if i == 'N':\n N = 1\n if i == 'W':\n W = 1\n if i == 'S':\n S = 1\n if i == 'E':\n E = 1\nif ((N == 0 and S == 0) or (N == 1 and S == 1)) and ((W == 0 and E == 0) or (N == 1 and S == 1)):\n print('Yes')\nelse:\n print('No')", "code2": "s = list(input())\nN = 0\nW = 0\nS = 0\nE = 0\nfor i in s:\n if i == 'N':\n N = 1\n if i == 'W':\n W = 1\n if i == 'S':\n S = 1\n if i == 'E':\n E = 1\nif ((N == 0 and S == 0) or (N == 1 and S == 1)) and ((W == 0 and E == 0) or (W == 1 and E == 1)):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560052231", "date2": "1560052716", "bleu_score": "0.9823621484436937", "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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "MWER\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = list(input()) # (0): s=['M', 'W', 'E', 'R']\nN = 0 # (1): N=0\nW = 0 # (2): W=0\nS = 0 # (3): S=0\nE = 0 # (4): E=0\nfor i in s: # (5): i=M (10): i=W ... (27): NO CHANGE\n if i == 'N': # (6): NO CHANGE (11): NO CHANGE ... (23): NO CHANGE\n N = 1\n if i == 'W': # (7): NO CHANGE (12): NO CHANGE ... (24): NO CHANGE\n W = 1 # (13): W=1\n if i == 'S': # (8): NO CHANGE (14): NO CHANGE ... (25): NO CHANGE\n S = 1\n if i == 'E': # (9): NO CHANGE (15): NO CHANGE ... (26): NO CHANGE\n E = 1 # (21): E=1\nif ((N == 0 and S == 0) or (N == 1 and S == 1)) and ((W == 0 and E == 0) or (N == 1 and S == 1)): # (28): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " s = list(input())\n N = 0\n W = 0\n S = 0\n E = 0\n for i in s:\n if i == 'N':\n N = 1\n if i == 'W':\n W = 1\n if i == 'S':\n S = 1\n if i == 'E':\n E = 1\n-if ((N == 0 and S == 0) or (N == 1 and S == 1)) and ((W == 0 and E == 0) or (N == 1 and S == 1)):\n+if ((N == 0 and S == 0) or (N == 1 and S == 1)) and ((W == 0 and E == 0) or (W == 1 and E == 1)):\n print('Yes')\n else:\n print('No')\n", "FL_content": " s = list(input())\n N = 0\n W = 0\n S = 0\n E = 0\n for i in s:\n if i == 'N':\n N = 1\n if i == 'W':\n W = 1\n if i == 'S':\n S = 1\n if i == 'E':\n E = 1\n-if ((N == 0 and S == 0) or (N == 1 and S == 1)) and ((W == 0 and E == 0) or (N == 1 and S == 1)):\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u459798349", "problem_id": "p02914", "submission1_id": "s122345233", "submission2_id": "s307586964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nA=[int(i) for i in input().split()]\n\nsuma=0\nfor i in range(n):\n suma^=A[i]\n\nB=[~suma&me for me in A]\nB.sort(reverse=True)\n\ncnt=0\nfor i in range(59,-1,-1):\n B.sort(reverse=True)\n if B[cnt]&(1<0:\n \n for q in range(cnt):\n if B[q]&(1<1:\n B[q]^=B[cnt]\n for q in range(cnt+1,n):\n if B[q]&(1<1:\n B[q]^=B[cnt]\n else:\n break \n cnt+=1\n\nans=0\nB.sort(reverse=True)\nfor i in range(min(n,60)):\n ans^=B[i]\n\nprint(ans*2+suma)", "code2": "n=int(input())\nA=[int(i) for i in input().split()]\n\nsuma=0\nfor i in range(n):\n suma^=A[i]\n\nB=[~suma&me for me in A]\nB.sort(reverse=True)\n\ncnt=0\nfor i in range(59,-1,-1):\n B.sort(reverse=True)\n if B[cnt]&(1<0:\n \n for q in range(cnt):\n if B[q]&(1<0:\n B[q]^=B[cnt]\n for q in range(cnt+1,n):\n if B[q]&(1<0:\n B[q]^=B[cnt]\n else:\n break \n cnt+=1\n\nans=0\nB.sort(reverse=True)\nfor i in range(n):\n ans^=B[i]\n\nprint(ans*2+suma)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596951493", "date2": "1596951777", "bleu_score": "0.9736253036951943", "code1_test_status": [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, 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, 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, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "4\n6 17 66 3\n", "actual_output": "86\n", "expected_output": "88\n\n", "anno_code": ["n=int(input()) # (0): n=4\nA=[int(i) for i in input().split()] # (1): A=[6, 17, 66, 3]\n\nsuma=0 # (2): suma=0\nfor i in range(n): # (3): i=0 (5): i=1 ... (11): NO CHANGE\n suma^=A[i] # (4): suma=6 (6): suma=23 ... (10): suma=86\n\nB=[~suma&me for me in A] # (12): B=[0, 1, 0, 1]\nB.sort(reverse=True) # (13): B=[1, 1, 0, 0]\n\ncnt=0 # (14): cnt=0\nfor i in range(59,-1,-1): # (15): i=59 (18): i=58 ... (200): NO CHANGE\n B.sort(reverse=True) # (16): NO CHANGE (19): NO CHANGE ... (193): NO CHANGE\n if B[cnt]&(1<0: # (17): NO CHANGE (20): NO CHANGE ... (194): NO CHANGE\n \n for q in range(cnt): # (195): NO CHANGE\n if B[q]&(1<1:\n B[q]^=B[cnt]\n for q in range(cnt+1,n): # (196): q=1\n if B[q]&(1<1: # (197): NO CHANGE\n B[q]^=B[cnt]\n else:\n break # (198): NO CHANGE\n cnt+=1 # (199): cnt=1\n\nans=0 # (201): ans=0\nB.sort(reverse=True) # (202): NO CHANGE\nfor i in range(min(n,60)): # (203): NO CHANGE (205): i=1 ... (211): NO CHANGE\n ans^=B[i] # (204): ans=1 (206): ans=0 ... (210): NO CHANGE\n\nprint(ans*2+suma)"], "anno_status": [true], "diff_content": " n=int(input())\n A=[int(i) for i in input().split()]\n \n suma=0\n for i in range(n):\n suma^=A[i]\n \n B=[~suma&me for me in A]\n B.sort(reverse=True)\n \n cnt=0\n for i in range(59,-1,-1):\n B.sort(reverse=True)\n if B[cnt]&(1<0:\n \n for q in range(cnt):\n- if B[q]&(1<1:\n+ if B[q]&(1<0:\n B[q]^=B[cnt]\n for q in range(cnt+1,n):\n- if B[q]&(1<1:\n+ if B[q]&(1<0:\n B[q]^=B[cnt]\n else:\n break \n cnt+=1\n \n ans=0\n B.sort(reverse=True)\n-for i in range(min(n,60)):\n+for i in range(n):\n ans^=B[i]\n \n print(ans*2+suma)\n", "FL_content": " n=int(input())\n A=[int(i) for i in input().split()]\n \n suma=0\n for i in range(n):\n suma^=A[i]\n \n B=[~suma&me for me in A]\n B.sort(reverse=True)\n \n cnt=0\n for i in range(59,-1,-1):\n B.sort(reverse=True)\n if B[cnt]&(1<0:\n \n for q in range(cnt):\n- if B[q]&(1<1:\n B[q]^=B[cnt]\n for q in range(cnt+1,n):\n- if B[q]&(1<1:\n B[q]^=B[cnt]\n else:\n break \n cnt+=1\n \n ans=0\n B.sort(reverse=True)\n-for i in range(min(n,60)):\n ans^=B[i]\n \n print(ans*2+suma)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 31 }, { "user_id": "u056801547", "problem_id": "p02914", "submission1_id": "s095687594", "submission2_id": "s607934860", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\na.append(0)\nfor i in range(n):\n a[n] ^= a[i]\n \n \nfor i in range(n):\n a[i] &= ~a[n]\nr = 0\nfor i in range(60, -1, -1):\n for j in range(r, n):\n if (a[j] >> i) & 1:\n a[r], a[j] = a[j], a[r]\n break\n else:\n continue\n \n for j in range(n):\n if (a[j] == a[r]):\n continue\n if (a[j]>>i) & 1:\n a[j] ^= a[r]\n r+=1\ns = 0\nfor i in range(r):\n s ^= a[i]\n \nprint(s*2 + a[n])", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\n \ns = 0\nfor i in range(N) :\n s ^= A[i]\n \nfor i in range(N) :\n A[i] &= ~s\n \nr = 0\nfor i in range(60, -1, -1) :\n for j in range(r, N) :\n if (A[j] >> i) & 1 :\n A[r], A[j] = A[j], A[r]\n break\n else :\n continue\n \n for j in range(N) :\n if j == r :\n continue\n if (A[j] >> i) & 1 :\n A[j] ^= A[r]\n \n r += 1\n \nret = 0\nfor i in range(r) :\n ret ^= A[i]\n \nprint(ret * 2 + s)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570914443", "date2": "1570914712", "bleu_score": "0.7648881926527442", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 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, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 84, "total_score": 103, "input": "20\n1008288677408720767 539403903321871999 1044301017184589821 215886900497862655 504277496111605629 972104334925272829 792625803473366909 972333547668684797 495007025435533594 172946206951478934 1151846447448561405 467257771752201853 683930041385277311 432010719984459389 319104378117934975 611451291444233983 647509226592964607 251832107792119421 827811265410084479 864032478037725181\n", "actual_output": "1393667939036328046\n", "expected_output": "1393667939037393010\n\n", "anno_code": ["n = int(input()) # (0): n=20\na = list(map(int, input().split())) # (1): a=[1008288677408720767, 539403903321871999, 1044301017184589821, 215886900497862655, 504277496111605629, 972104334925272829, 792625803473366909, 972333547668684797, 495007025435533594, 172946206951478934, 1151846447448561405, 467257771752201853, 683930041385277311, 432010719984459389, 319104378117934975, 611451291444233983, 647509226592964607, 251832107792119421, 827811265410084479, 864032478037725181]\na.append(0) # (2): a=[1008288677408720767, 539403903321871999, ..., 864032478037725181, 0]\nfor i in range(n): # (3): i=0 (5): i=1 ... (43): NO CHANGE\n a[n] ^= a[i] # (4): a=[1008288677408720767, 539403903321871999, ..., 864032478037725181, 1008288677408720767] (6): a=[1008288677408720767, 539403903321871999, ..., 864032478037725181, 757292792233545984] ... (42): a=[1008288677408720767, 539403903321871999, ..., 864032478037725181, 912175070176284556]\n \n \nfor i in range(n): # (44): i=0 (46): i=1 ... (84): NO CHANGE\n a[i] &= ~a[n] # (45): a=[96274410808066163, 539403903321871999, ..., 864032478037725181, 912175070176284556] (47): a=[96274410808066163, 239896503351808115, ..., 864032478037725181, 912175070176284556] ... (83): a=[96274410808066163, 239896503351808115, ..., 240107575222517873, 912175070176284556]\nr = 0 # (85): r=0\nfor i in range(60, -1, -1): # (86): i=60 (129): i=59 ... (2329): NO CHANGE\n for j in range(r, n): # (87): j=0 (89): j=1 ... (2327): NO CHANGE\n if (a[j] >> i) & 1: # (88): NO CHANGE (90): NO CHANGE ... (2326): NO CHANGE\n a[r], a[j] = a[j], a[r] # (220): a=[239896503351808115, 96274410808066163, ..., 240107575222517873, 912175070176284556] (298): NO CHANGE ... (2194): NO CHANGE\n break # (221): NO CHANGE (299): NO CHANGE ... (2195): NO CHANGE\n else:\n continue # (128): NO CHANGE (171): NO CHANGE ... (2328): NO CHANGE\n \n for j in range(n): # (222): j=0 (225): j=1 ... (2267): NO CHANGE\n if (a[j] == a[r]): # (223): NO CHANGE (226): NO CHANGE ... (2265): NO CHANGE\n continue # (224): NO CHANGE (306): NO CHANGE ... (2266): NO CHANGE\n if (a[j]>>i) & 1: # (227): NO CHANGE (230): NO CHANGE ... (2259): NO CHANGE\n a[j] ^= a[r] # (231): a=[239896503351808115, 96274410808066163, ..., 240107575222517873, 912175070176284556] (235): a=[239896503351808115, 96274410808066163, ..., 240107575222517873, 912175070176284556] ... (2260): a=[144115188075855874, 72057594038452224, ..., 4096, 912175070176284556]\n r+=1 # (294): r=1 (373): r=2 ... (2268): r=19\ns = 0 # (2330): s=0\nfor i in range(r): # (2331): NO CHANGE (2333): i=1 ... (2369): NO CHANGE\n s ^= a[i] # (2332): s=144115188075855874 (2334): s=216172782114308098 ... (2368): s=240746434430021745\n \nprint(s*2 + a[n])"], "anno_status": [false], "diff_content": "-n = int(input())\n-a = list(map(int, input().split()))\n-a.append(0)\n-for i in range(n):\n- a[n] ^= a[i]\n- \n+N = int(input())\n+A = [int(i) for i in input().split()]\n+ \n+s = 0\n+for i in range(N) :\n+ s ^= A[i]\n \n-for i in range(n):\n- a[i] &= ~a[n]\n+for i in range(N) :\n+ A[i] &= ~s\n+ \n r = 0\n-for i in range(60, -1, -1):\n- for j in range(r, n):\n- if (a[j] >> i) & 1:\n- a[r], a[j] = a[j], a[r]\n+for i in range(60, -1, -1) :\n+ for j in range(r, N) :\n+ if (A[j] >> i) & 1 :\n+ A[r], A[j] = A[j], A[r]\n break\n- else:\n+ else :\n continue\n- \n- for j in range(n):\n- if (a[j] == a[r]):\n+ \n+ for j in range(N) :\n+ if j == r :\n continue\n- if (a[j]>>i) & 1:\n- a[j] ^= a[r]\n- r+=1\n-s = 0\n-for i in range(r):\n- s ^= a[i]\n+ if (A[j] >> i) & 1 :\n+ A[j] ^= A[r]\n+ \n+ r += 1\n+ \n+ret = 0\n+for i in range(r) :\n+ ret ^= A[i]\n \n-print(s*2 + a[n])\n+print(ret * 2 + s)\n", "FL_content": "-n = int(input())\n-a = list(map(int, input().split()))\n-a.append(0)\n-for i in range(n):\n- a[n] ^= a[i]\n- \n \n-for i in range(n):\n- a[i] &= ~a[n]\n r = 0\n-for i in range(60, -1, -1):\n- for j in range(r, n):\n- if (a[j] >> i) & 1:\n- a[r], a[j] = a[j], a[r]\n break\n- else:\n continue\n- \n- for j in range(n):\n- if (a[j] == a[r]):\n continue\n- if (a[j]>>i) & 1:\n- a[j] ^= a[r]\n- r+=1\n-s = 0\n-for i in range(r):\n- s ^= a[i]\n \n-print(s*2 + a[n])\n", "added_lines": 26, "removed_lines": 23, "code1_lines": 29 } ]