problem_id
stringlengths 6
6
| user_id
stringlengths 10
10
| time_limit
float64 1k
8k
| memory_limit
float64 262k
1.05M
| problem_description
stringlengths 48
1.55k
| codes
stringlengths 35
98.9k
| status
stringlengths 28
1.7k
| submission_ids
stringlengths 28
1.41k
| memories
stringlengths 13
808
| cpu_times
stringlengths 11
610
| code_sizes
stringlengths 7
505
|
|---|---|---|---|---|---|---|---|---|---|---|
p02622 | u619672182 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\ncount = 0\nfor i in len(S):\n if S[i] != T[i]:\n count+= 1\nprint(count)\n\n', 'S = input()\nT = input()\ncount = 0\nfor i in len(S):\n if S[i] != T[i]\n count+= 1\nprint(count)\n \n', 'S = input()\nT = input()\ncount = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n count+= 1\nprint(count)\n\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s410300949', 's677642665', 's908069330'] | [9392.0, 8948.0, 9332.0] | [27.0, 27.0, 66.0] | [104, 107, 111] |
p02622 | u621596556 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\nint t = 0\n\nfor i in range(n):\n if(s[i] != t[i]):\n t+=1;\nprint(t) \n\n\n', 's = input()\nt = input()\n\ncount = 0\n\nfor i in range(len(s)):\n if(s[i] != t[i]):\n count+=1;\nprint(count) \n'] | ['Runtime Error', 'Accepted'] | ['s015932121', 's559381736'] | [8896.0, 9348.0] | [29.0, 62.0] | [100, 111] |
p02622 | u628633224 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a = input()\nb = input()\nans = 0\nfor i in range(len(a)):\n if a[i] == b[i]:\n ans += 1\nprint(ans)', 'a = input()\nb = input()\nans = 0\nfor i in range(len(a)):\n if a[i] != b[i]:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s491615951', 's393407840'] | [9320.0, 9472.0] | [58.0, 63.0] | [98, 99] |
p02622 | u629201777 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a=input()\nb=input()\ncount=0\nfor i in range(len(a)):\n if a[i]==b[i]:\n count+=1\nprint(count)', 'a=input()\nb=input()\ncount=0\nfor i in range(len(a)):\n if a[i]!=b[i]:\n count+=1\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s214845659', 's239197614'] | [9172.0, 9168.0] | [58.0, 63.0] | [94, 95] |
p02622 | u632757234 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=input()\nt=input()\nl=len(s)\ncount=0\nif(s==t):\n break\nelse:\n for i in range(l):\n if(s[i]==t[i]):\n continue\n else:\n count+=1\n\nprint(count)', 's=input()\nt=input()\nl=len(s)\ncount=0\nif(s==t):\n print(count)\n \nelse:\n for i in range(l):\n if(s[i]==t[i]):\n continue\n else:\n count+=1\n\n print(count)\n'] | ['Runtime Error', 'Accepted'] | ['s715659792', 's173737222'] | [9100.0, 9456.0] | [24.0, 70.0] | [155, 168] |
p02622 | u635329504 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S= input()\nT= input()\n\ncount = 0\ni = 0\nwhile i < len(S):\n print("len" + str(len(S)))\n print("S[i]:" + S[i])\n\n if S[i] != T[i]:\n count+=1\n i+=1\n\nprint(count)\n', 'S= input()\nT= input()\n\ncount = 0\ni = 0\nwhile i < len(S):\n print("len" + str(len(S)))\n print("S[i]:" + S[i])\n\n if S[i] != T[i]:\n count+=1\n i+=1\n\nprint(count)\n', 'S= input()\nT= input()\n\nx = 0\ni = 0\nwhile i < len(S):\n if S[i] != T[i]:\n x += 1\n i+=1\n\nprint(x)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s301102409', 's826376308', 's010474228'] | [9496.0, 9268.0, 9320.0] | [250.0, 242.0, 84.0] | [176, 176, 108] |
p02622 | u642085002 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\ncount = 0\nfor s, t in zip(S, T):\n if s != t:\n count += 1\n\nprint(int((count+1)/2))', 'S = input()\nT = input()\ncount = 0\nfor s, t in zip(S, T):\n if s != t:\n count += 1\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s029030293', 's882371037'] | [9396.0, 9344.0] | [65.0, 62.0] | [115, 104] |
p02622 | u643270269 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\ncounter = 0\n\nwhile(S != T):\n for i in range(len(S)):\n if S[i] != T[i]:\n S[i] = T[i]\n counter = counter + 1\n else:\n pass\n\nprint(counter)', 'S = list(i for i in input())\nT = list(i for i in input())\n\ncounter = 0\n\nwhile(S != T):\n for i in range(len(S)):\n if S[i] != T[i]:\n S[i] = T[i]\n counter = counter + 1\n else:\n pass\n\nprint(counter)'] | ['Runtime Error', 'Accepted'] | ['s888900584', 's179027512'] | [9236.0, 12656.0] | [27.0, 96.0] | [209, 244] |
p02622 | u656803083 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\ncount = 0\n\nfor i in range(len(s))\nif s[i] == t[i]:\n count += 1\n\nprint(count)\n', 's = input()\nt = input()\n \ncount = 0\n \nfor i in range(len(s))\nif s[i] != t[i]:\n count += 1\n\nprint(count)', 's = input()\nt = input()\n \ncount = 0\n \nfor i in range(len(s)):\n\tif s[i] != t[i]:\n\t\tcount += 1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s459966978', 's719119425', 's322745020'] | [9016.0, 8920.0, 9324.0] | [25.0, 22.0, 63.0] | [103, 104, 105] |
p02622 | u661649266 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\n\ncount = 0\nfor (s,t) in map(S,T):\n if s != t:\n count += 1\nprint(count)', 'S = input()\nT = input()\n \ncount = 0\nfor (s,t) in zip(S,T):\n if s != t:\n count += 1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s437251718', 's481175841'] | [9232.0, 9400.0] | [28.0, 57.0] | [98, 104] |
p02622 | u663116324 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nsum = 0\nfor i in range(len(S)):\n if S[i-1] <> T[i-1]:\n sum = sum + 1\nprint(sum) ', 'S = input()\nT = input()\nsum = 0\nfor i in range(len(S)):\n if S[i-1] != T[i-1]:\n sum = sum + 1\nprint(sum) '] | ['Runtime Error', 'Accepted'] | ['s707731157', 's461515526'] | [8984.0, 9228.0] | [23.0, 72.0] | [109, 109] |
p02622 | u667937724 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\n\nn = 1\n\nfor a in range len(S)\n\nif S[a] = T[a] :\n n += 1\n\nreturn n', 'S = input()\nT = input()\n\nn = 0\n\nfor a in range(len(S)) :\n\n if not S[a] == T[a] :\n n += 1\n\nprint(n)'] | ['Runtime Error', 'Accepted'] | ['s940476336', 's712040541'] | [8944.0, 9404.0] | [20.0, 65.0] | [92, 108] |
p02622 | u669684885 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['first_string = "abcde"\nsecond_string = "abcfd"\ncount = 0\n\nfor x, y in zip(first_string, range(len(first_string))):\n if(second_string[y] != x):\n count += 1\nprint(count)', 'first_string = input()\nsecond_string = input()\ncount = 0\n\nfor x, y in zip(first_string, range(len(first_string))):\n if(second_string[y] != x):\n count += 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s444624413', 's219699216'] | [9000.0, 9456.0] | [31.0, 62.0] | [177, 177] |
p02622 | u672316981 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ["def distance(x, y):\n return (x ** 2 + y ** 2) ** (1 / 2)\n\n\ndef main():\n n, d = map(int, input().split())\n xy_lst = [list(map(int, input().split())) for _ in range(n)]\n count = 0\n\n for i in range(n):\n x = xy_lst[i][0]\n y = xy_lst[i][1]\n if distance(x, y) <= d:\n count += 1\n\n print(count)\n\n\nif __name__ == '__main__':\n main()", 's = str(input())\nt = str(input())\ncount = 0\n\nfor i in range(len(s)):\n if s[i] != t[i]:\n count += 1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s217531753', 's058654305'] | [9324.0, 9216.0] | [27.0, 61.0] | [376, 130] |
p02622 | u674190122 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = list(input())\nt = list(input())\nprint(sum([1 for x, y in zip(s, t) if x != y])', 's = input()\nt = input()\nprint(sum([1 for x, y in zip(s, t) if x != y]))'] | ['Runtime Error', 'Accepted'] | ['s616675465', 's836758537'] | [8972.0, 10884.0] | [24.0, 43.0] | [82, 71] |
p02622 | u681966513 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a = input()\nb = input()\ncnt = 0\nfor i in range(len(a)):\n\tif a[i] != b[i]:\n \tcnt+=1\nprint(cnt)', 'a = input()\nb = input()\ncnt = 0\nfor i in range(len(a)):\n if a[i] != b[i]:\n cnt += 1\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s633810771', 's986379941'] | [8956.0, 9400.0] | [21.0, 64.0] | [96, 104] |
p02622 | u685983477 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ["def main():\n s=input()\n t=input()\n res=0\n for i in range(len(s)):\n if(s[i]==t[i]):\n res+=1\n print(res)\nif __name__ == '__main__':\n main()\n", "def main():\n s=input()\n t=input()\n res=0\n for i in range(len(s)):\n if(s[i]!=t[i]):\n res+=1\n print(res)\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s716887858', 's987569964'] | [9312.0, 9368.0] | [44.0, 52.0] | [174, 174] |
p02622 | u699008198 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\n\nret = 0\nfor i in len(S):\n if S[i] != T[i]:\n ret += 1\nprint( ret )', 'S = input()\nT = input()\n \nret = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n ret += 1\nprint( ret )'] | ['Runtime Error', 'Accepted'] | ['s779066079', 's445331836'] | [9476.0, 9404.0] | [25.0, 67.0] | [94, 102] |
p02622 | u702018889 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s,t=input().split()\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)', 's,t=input().split()\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)', 's=input()\nt=input()\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s148526914', 's972338052', 's389566133'] | [9252.0, 9160.0, 9428.0] | [22.0, 25.0, 59.0] | [88, 88, 88] |
p02622 | u704157847 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\ndif = 0\nfor _ in range(len(s)):\n if s[0] != t[0]:\n dif += 1\n \nprint(dif)', 's = input()\nt = input()\n\ndif = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n dif += 1\n \nprint(dif)'] | ['Wrong Answer', 'Accepted'] | ['s170156042', 's580046584'] | [9320.0, 9392.0] | [60.0, 59.0] | [104, 104] |
p02622 | u713342695 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=input()\nT=input()\nk=0\ni=0\nwhile S!=T\t\n\tif S[i]==T[i]:\n \telse:\n k+=1\n i+=1\n\nprint(k)', 'ソースコード \n\nCopy\nCopy\nS=input()\nT=input()\nk=0\ni=0\n\nwhile i==len(S)\n\tif S[i]==T[i]:\n \telse:\n k+=1\n i+=1\n end', 'S=input()\nT=input()\nk=0\nfor i in range(len(S))\n\tif S[i]==T[i]:\n \tcontinue\n \telse:\n \tk+=1\n\nprint(k)', 'S=input()\nT=input()\nk=0\nfor i in range(len(S))\n\tif S[i]!=T[i]:\n \tk+=1\nprint(k)', 'S=input()\nT=input()\nk=0\nfor i in range(len(S))\n\tif S[i]==T[i]:\n \tcontinue\n \telse:\n \tk+=1\nprint(k)', 'S=input()\nT=input()\nk=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n k+=1\nprint(k)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s012942380', 's245427144', 's333447563', 's582332545', 's706441703', 's293713648'] | [8792.0, 8996.0, 8792.0, 8868.0, 8992.0, 9336.0] | [25.0, 24.0, 23.0, 19.0, 24.0, 62.0] | [94, 128, 105, 81, 104, 82] |
p02622 | u720314082 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=str(input())\nT=str(input())\nsum=0\n\nfor i in range(len(S)):\n if S[i]!=T[i]:\n sum++\n\nprint(sum)', 'S=str(input())\nT=str(input())\nsum=0\n\nfor i in range(len(S)):\n if S[i]!=T[i]:\n sum+=1\n\nprint(sum)'] | ['Runtime Error', 'Accepted'] | ['s990530106', 's573810688'] | [9028.0, 9372.0] | [23.0, 61.0] | [105, 106] |
p02622 | u722217673 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nprint(sum(s != t for s, t in zip(S, T))', 'S = input()\nT = input()\nprint(sum(s != t for s, t in zip(S, T)))'] | ['Runtime Error', 'Accepted'] | ['s478398014', 's898406566'] | [8904.0, 9404.0] | [29.0, 44.0] | [63, 64] |
p02622 | u726068550 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input().split()\nS = list(S)\nT = input.split()\nT = list(T)\nfor i in S:\n if(S[i]!=T[i]):\n count++;\n\nprint(count)', 'ST = input().split()\nS = list(S)\nT = list(T)\nfor i in S:\n if(S[i]!=T[i]):\n count++\n \nprint(count)', 'S = input().split()\nS = list(S)\nT = input.split()\nT = list(T)\nfor i in S:\n if(S[i]!=T[i]):\n count++\n \nprint(count)', 'S = input()\ns = list(S)\nT = input()\nt = list(T)\ns1=s[0]\nt1=t[0]\ncount = 0\nj=0\nfor i in S:\n if(s[j]!=t[j]):\n count=count+1\n j=j+1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s388622883', 's866464719', 's900742370', 's859891568'] | [9012.0, 8920.0, 8960.0, 12244.0] | [24.0, 25.0, 22.0, 76.0] | [118, 101, 118, 146] |
p02622 | u727787724 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=list(input().split())\nt=list(input().split())\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)', '# coding: utf-8\n# Your code here!\ns=list(input())\nt=list(input())\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s889939889', 's193355190'] | [9320.0, 12352.0] | [30.0, 68.0] | [116, 136] |
p02622 | u739045240 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\ns = list(S)\nt = list(T)\nK = len(s)\nn=0\nfor i in range(0, K):\n if s[i] == t[i]:\n n+=1\n else:\n pass\nprint(n)', 'S = input()\nT = input()\ns = list(S)\nt = list(T)\nK = len(s)\nn=0\nfor i in range(0, K):\n if s[i] != t[i]:\n n+=1\n else:\n pass\nprint(n)'] | ['Wrong Answer', 'Accepted'] | ['s565211632', 's954727398'] | [12460.0, 12404.0] | [68.0, 68.0] | [138, 138] |
p02622 | u743164083 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = list(input())\nt = list(input())\ni = 0\ncnt = 0\nwhile (i < len(s)):\n if s != t:\n cnt += 1\n i += 1\nprint(cnt)', 's = list(input())\nt = list(input())\ncnt = 0\nfor i, v in zip(s,t):\n if i != v:\n cnt += 1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s961691560', 's456394165'] | [12360.0, 12424.0] | [2206.0, 65.0] | [122, 107] |
p02622 | u749416810 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['def minchange(s,t):\n m=len(s)\n n=len(t)\n if n!=m:\n return -1\n cnt=[0]*256\n for i in range(n):\n cnt[ord(t[i])]+=1\n for i in range(n):\n cnt[ord(s[i])]-=1\n for i in range(256):\n if cnt[i]:\n return -1\n res=0\n i=n-1\n j=n-1\n while i>=0:\n while i>=0 and s[i]!=t[i]:\n i-=1\n res+=1\n if i>=0:\n i-=1\n j-=1\n return res\ns=input()\nt=input()\nprint(str(minchange(s,t)))\n \n \n', 'def minchange(s,t):\n m=len(s)\n n=len(t)\n if n!=m:\n return -1\n cnt=[0]*256\n for i in range(n):\n cnt[ord(t[i])]+=1\n for i in range(n):\n cnt[ord(s[i])]-=1\n for i in range(256):\n if cnt[i]:\n return -1\n res=0\n i=n-1\n j=n-1\n while i>=0:\n while i>=0 and s[i]!=t[i]:\n i-=1\n res+=1\n if i>=0:\n i-=1\n j-=1\n return res\ns=input()\nt=input()\nprint(str(minchange(s,t))\n \n \n', 'def minchange(s,t):\n m=len(s)\n n=len(t)\n if n!=m:\n return -1\n cnt=[0]*256\n for i in range(n):\n cnt[ord(t[i])]+=1\n for i in range(n):\n cnt[ord(s[i])]-=1\n for i in range(256):\n if cnt[i]:\n return -1\n res=0\n i=n-1\n j=n-1\n while i>=0:\n while i>=0 and s[i]!=t[i]:\n i-=1\n res+=1\n if i>=0:\n i-=1\n j-=1\n return res\ns=input()\nt=int(input())\nprint(str(minchange(s,t))\n \n ', 'def minchange(s,t):\n m=len(s)\n n=len(t)\n if n!=m:\n return -1\n cnt=[0]*256\n for i in range(n):\n cnt[ord(t[i])]+=1\n for i in range(n):\n cnt[ord(s[i])]-=1\n res=0\n i=n-1\n j=n-1\n while i>=0:\n while i>=0 and s[i]!=t[i]:\n i-=1\n res+=1\n if i>=0:\n i-=1\n j-=1\n return res\ns=input()\nt=input()\nprint(str(minchange(s,t)))\n \n \n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s670748210', 's682738151', 's934792271', 's033370985'] | [9432.0, 9092.0, 8816.0, 9660.0] | [108.0, 26.0, 23.0, 99.0] | [419, 418, 422, 365] |
p02622 | u756607246 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['from sys import stdin\ns = stdin.readline().rstrip()\nt = stdin.readline().rstrip()\n\n#print(s, t)\n\na = [x for x in s]\nb = [x for x in t]\n\ncount = 0\n\nfor i in range(len(a)):\n if a[i] == a[i]:\n count += 1\nprint(count)\n', 'from sys import stdin\ns = stdin.readline().rstrip()\nt = stdin.readline().rstrip()\n\n#print(s, t)\n\na = [x for x in s]\nb = [x for x in t]\n\ncount = 0\n\nfor i in range(len(a)):\n if a[i] != b[i]:\n count += 1\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s011889571', 's906235050'] | [12660.0, 12664.0] | [77.0, 75.0] | [218, 218] |
p02622 | u763628696 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input().split()\nt = input().split()\nc = 0\n\nfor i in rangea(len(s)):\n if s[i] != t[i]:\n c += 1\n\nprint(str(c))\n', 's = input()\nt = input()\nc = 0\n \nfor i in range(len(s)):\n if s[i] != t[i]:\n c += 1\n \nprint(str(c))'] | ['Runtime Error', 'Accepted'] | ['s336163901', 's154787224'] | [9396.0, 9372.0] | [30.0, 62.0] | [117, 101] |
p02622 | u765438844 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nW = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n w += 1\nprint(W)', 'S = input()\nT = input()\nW = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n W += 1\nprint(W)\n'] | ['Runtime Error', 'Accepted'] | ['s790330986', 's754506181'] | [9376.0, 9520.0] | [49.0, 63.0] | [98, 99] |
p02622 | u773077120 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nsum(S[i] != T[i] for i in range(len(S)))', 'S = input()\nT = input()\nprint(sum(S[i] != T[i] for i in range(len(S))))'] | ['Wrong Answer', 'Accepted'] | ['s475355388', 's818264187'] | [9456.0, 9240.0] | [54.0, 57.0] | [64, 71] |
p02622 | u773081031 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\nl = len(s)\nc = 0\nfor i in range(0, l):\n if s[i]==t[i]:\n c+=1', 's = input()\nt = input()\n \nl = len(s)\nc = 0\nfor i in range(0, l):\n if s[i]!=t[i]:\n c+=1\n \nprint(c)'] | ['Wrong Answer', 'Accepted'] | ['s566140331', 's164791391'] | [9292.0, 9544.0] | [57.0, 72.0] | [89, 104] |
p02622 | u774056921 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s,t=input().split()\nu=0\nfor i in range(0,len(s)):\n if s[i]!=t[i]:\n u+=1\nprint(u)\n', 's=input()\nt=input()\nu=0\nfor i in range(0,len(s)):\n if s[i]!=t[i]:\n u+=1\nprint(u)'] | ['Runtime Error', 'Accepted'] | ['s537487000', 's056664247'] | [9112.0, 9348.0] | [29.0, 64.0] | [91, 90] |
p02622 | u775723163 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\nans = 0\nfor i in range(lne(s)):\n ans +=(s[i]!=t[i])\n \nprint(ans)', 's = input()\nt = input()\n\nans = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n ans += 1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s490674832', 's101656931'] | [9196.0, 9316.0] | [24.0, 74.0] | [90, 106] |
p02622 | u789436713 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=input()\nT=input()\ncnt=0\nfor i in len(S):\n if(S[i]==T[i]):\n cnt+=1\n \nprint(cnt)', 'S=input()\nT=input()\ncnt=0\nfor i in range(len(S)):\n if(S[i]!=T[i]):\n cnt+=1\n \nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s158753986', 's559036448'] | [9484.0, 9340.0] | [27.0, 62.0] | [87, 94] |
p02622 | u798136015 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\n\nres = sum(1 if s == t else 0 for s, t in zip(S,T))\nprint(res)', 'S = input()\nT = input()\n \nres = sum(0 if s == t else 1 for s, t in zip(S,T))\nprint(res)'] | ['Wrong Answer', 'Accepted'] | ['s007765471', 's268794620'] | [9468.0, 9232.0] | [48.0, 45.0] | [86, 87] |
p02622 | u798260206 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\ncnt = 0\nfor i in len(s):\n if s[i] != t[i]:\n cnt += 1\n \nprint(cnt)', 's = input()\nt = input()\ncnt = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n cnt += 1\n \nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s313267518', 's423726762'] | [9348.0, 9336.0] | [29.0, 67.0] | [96, 103] |
p02622 | u799428010 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=input()\nT=input()\ncout=0\nfor i in len(S):\n if S[i]!=T[i]:\n cout=cout+1\nprint (cout)', "S=input()\nT=input()\nif S==T:\n print('0')\nelif S!=T:\n STand = set(S) & set(T)\n STlist = list(STand )\n print(len(STlist))", "S=str(input())\nT=str(input()\nif S==T:\n print('0')", 'S= list(map(str, input().split()))\nT= list(map(str, input().split()))\n\nSTand = set(S) & set(T)\nSTlist = list(STand )\nprint(len(STlist))', 'S=input()\nT=input()\ncout=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n cout=cout+1\nprint (cout)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s094912697', 's136177400', 's296114123', 's695659266', 's799958368'] | [9260.0, 9480.0, 9004.0, 9336.0, 9312.0] | [22.0, 36.0, 21.0, 29.0, 62.0] | [89, 133, 54, 135, 102] |
p02622 | u809108154 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['import sys\nreadline= sys.stdin.buffer.readline\n\ns, t = map(str,readline().split())\n\ncount=0\nfor idx, i in enumerate(s):\n if s[idx]!=t[idx]:\n count+=1\nprint(count)', 's = input()\nt = input()\n\ncount=0\nfor idx, i in enumerate(s):\n if s[idx]!=t[idx]:\n count+=1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s430479386', 's672626255'] | [9132.0, 9240.0] | [27.0, 69.0] | [166, 107] |
p02622 | u836695640 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nans = 0\n\nfor i in range(len(s)):\n if (s[i] != t[i]):\n ans = ans + 1\n\nprint(ans)\n', 's = input()\nt = input()\nans = 0\n \nfor i in range(len(s)):\n if (s[i] != t[i]):\n ans = ans + 1\n \nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s129663924', 's751694246'] | [9412.0, 9356.0] | [21.0, 62.0] | [108, 109] |
p02622 | u841942209 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = list(input ())\nT = list(input ())\na = len(S)\nchange_time = 0\n\nfor i in a:\n if (S[i] ==T[i])\n continue\n \n else:\n S[i] =T[i]\n change_time += 1\n \n \nprint(change_time)', 'S = list(input ())\nT = list(input ())\na = len(S)\nchange_time = 0\n \nfor i in range(a):\n if S[i] ==T[i]:\n \tcontinue\n \n else:\n \n \tchange_time += 1\n \n \nprint(change_time)'] | ['Runtime Error', 'Accepted'] | ['s936042389', 's332824677'] | [8980.0, 12404.0] | [24.0, 68.0] | [175, 173] |
p02622 | u844123804 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a = input().split()\nb = input().split()\n\ncnt = 0\nfor i in range(len(a)):\n if a[i]!=b[i]:\n cnt += 1\n \nprint(cnt)', 'a = input()\nb = input()\n\ncnt = 0\nfor i in range(len(a)):\n if a[i]!=b[i]:\n cnt += 1\n \nprint(cnt)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s165573089', 's237472362'] | [9468.0, 9396.0] | [28.0, 61.0] | [118, 104] |
p02622 | u848482233 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=input()\nt=input()\n\nfor i in s.size():\n if s[i]!==t[i]:\n ans += 1\nprint(ans)', 's=input()\nt=input()\n \nfor i in range(s.size()):\n if s[i]!=t[i]:\n ans += 1\nprint(ans)', 's=input()\nt=input()\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s181792279', 's463890840', 's474738682'] | [8984.0, 9428.0, 9344.0] | [24.0, 20.0, 62.0] | [81, 88, 90] |
p02622 | u849433300 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\nprint(len(list(set(s) - set(t))))', 's = input()\nt = input()\nans = 0\n\nfor i in range(len(s)):\n if s[i] != t[i]:\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s261842029', 's566542797'] | [9392.0, 9276.0] | [33.0, 63.0] | [58, 99] |
p02622 | u850479192 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s,t = map(list, input().split())\nk = []\nfor i in range(len(s)):\n k.append(s[i] == t[i])\nprint(len(s)-sum(k))', 's,t = map(list, input().split())\nk = []\nfor i in range(len(s)):\n k.append(s[i] !=t[i])\nprint(sum(k))', 's = list(input())\nt = list(input())\nk = []\nfor i in range(len(s)):\n k.append(s[i] == t[i])\nprint(len(s)-sum(k))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s243586047', 's735158200', 's238587884'] | [10584.0, 10352.0, 13872.0] | [32.0, 30.0, 76.0] | [111, 103, 114] |
p02622 | u851704997 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nfor i in range(len(S)):\n if(S[i] != T[i]):\n ans += 1\nprint(str(ans))', 'S = input()\nT = input()\nans = 0\nfor i in range(len(S)):\n if(S[i] != T[i]):\n ans += 1\nprint(str(ans))'] | ['Runtime Error', 'Accepted'] | ['s339642347', 's728180691'] | [9272.0, 9280.0] | [50.0, 62.0] | [96, 104] |
p02622 | u855967722 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ["def main():\n S = input()\n T = input()\n count = 0\n for i in len(S):\n if S[i] != T[i]:\n count+=1\n print(count)\n\n\nif __name__ == '__main__':\n main()", "#!/usr/bin/env python3\ndef main():\n S = input()\n T = input()\n count = 0\n for i in range(len(S)):\n if S[i] != T[i]:\n count+=1\n print(count)\n\n\nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s718774052', 's744078715'] | [9608.0, 9368.0] | [29.0, 46.0] | [182, 212] |
p02622 | u859021444 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['word1=list(input())\nword2=list(input2())\ni = 0\nfor i, j in word1, word2 :\n if i!=J:\n i++\nprint(i)\n ', 'word1 = list(input())\nword2 = list(input())\ni = 0\nfor p, q in zip(word1, word2):\n\tif p!=q:\n\t\ti+=1\nprint(i)'] | ['Runtime Error', 'Accepted'] | ['s094655535', 's571069361'] | [8952.0, 12308.0] | [25.0, 62.0] | [106, 106] |
p02622 | u863371419 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['import timeit\n\na = [input() for i in range(2)]\n\nS = a[0]\nT = a[1]\n\ndef count_diff2(S,T):\n cnt = 0\n for c1,c2 in zip(S, T):\n if c1 != c2:\n cnt += 1\n return cnt\n\nprint(timeit.timeit(lambda: count_diff2(S,T)))', 'import timeit\n\na = [input() for i in range(2)]\n\nS = a[0]\nT = a[1]\n\ndef count_diff2(S,T):\n cnt = 0\n for c1,c2 in zip(S, T):\n if c1 != c2:\n cnt += 1\n return cnt\n\nprint(count_diff2(S,T))\n'] | ['Wrong Answer', 'Accepted'] | ['s639429809', 's308196516'] | [9540.0, 9432.0] | [2206.0, 47.0] | [233, 211] |
p02622 | u876754484 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\nfor i in range(len(s)):\n if s[i] is not t[i]:\n i++\n\nprint(i)', 's = input()\nt = input()\nj = 0\n \nfor i in range(len(s)):\n if s[i] is not t[i]:\n j += 1\n \nprint(j)'] | ['Runtime Error', 'Accepted'] | ['s879028748', 's659405303'] | [9020.0, 9352.0] | [24.0, 61.0] | [89, 120] |
p02622 | u882514852 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nans = 0\nfor i in range(S):\n if S[i+1] == T[i+1]:\n ans += 1\nprint(ans)', 'S = input()\nT = input()\nans = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n continue\n ans += 1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s314761218', 's448766205'] | [9424.0, 9400.0] | [24.0, 65.0] | [97, 110] |
p02622 | u883866798 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['first_str = input().split()\nanwser_str = input().split()\ncnt = 0\nfor i in range(len(first_str)):\n if first_str[i] != anwser_str[i]:\n first_str[i] = anwser_str[i]\n cnt += 1\n\nprint(cnt)', 'first_str = list(input())\nanwser_str = list(input())\ncnt = 0\nfor i in range(len(first_str)):\n if first_str[i] != anwser_str[i]:\n first_str[i] = anwser_str[i]\n cnt += 1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s961617421', 's490996714'] | [9472.0, 12412.0] | [33.0, 81.0] | [200, 195] |
p02622 | u885519146 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ["import re\ns = input()\nt = input()\nresult=0\nif(re.fullmatch(r'[a-z]{1-20000}', s) and re.fullmatch(r'[a-z]{1-20000}', t)):\n for i, j in s, t:\n if i==j:\n result+=1\n print(result)", "import re\nS = input()\nT = input()\nresult=0\nif(len(S)!=len(T)):\n pass\nelif(re.fullmatch(r'[a-z]{1,200000}', S) and re.fullmatch(r'[a-z]{1,200000}', T)):\n for i in range(len(S)):\n if S[i]!=T[i]:\n result+=1\n print(result)"] | ['Wrong Answer', 'Accepted'] | ['s123312141', 's320907114'] | [10076.0, 10068.0] | [35.0, 71.0] | [200, 245] |
p02622 | u887080361 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=input()\nt=input()\ncount=0\nfor i in s:\n if s[i] != t[i]:\n count += 1\nprint(count)', 's=input().split()\nt=input().split()\ncount=0\nfor i in s:\n if s[i] != t[i]:\n count += 1\nprint(count)', 's=input()\nt=input()\nlength=len(s)\ncount=0\nfor i in range(length):\n if s[i] != t[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s216474348', 's241937523', 's409766227'] | [9128.0, 9416.0, 9352.0] | [23.0, 22.0, 62.0] | [92, 108, 118] |
p02622 | u887733878 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=input()\nT=input()\nans=0\nfor i in range(len(S)):\n if S[i]==T[i]:\n ans+=1\nprint(ans)', 'S=input()\nT=input()\nans=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s404998637', 's709476553'] | [9348.0, 9256.0] | [62.0, 66.0] | [94, 94] |
p02622 | u893197162 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=input()\nt = input()\ncount = 0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n count += 1', 's = input()\nt = input()\ncount = 0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n count += 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s007693721', 's362245074'] | [9372.0, 9472.0] | [62.0, 62.0] | [87, 102] |
p02622 | u898109279 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\nresult = 0\nfor i, v in enumerate(s):\n if t[i] !== v :\n result += 1\n \nprint(result)', 's = input()\nt = input()\n\nresult = 0\nfor i, v in enumerate(s):\n if t[i] != v :\n result += 1\n \nprint(result)\n'] | ['Runtime Error', 'Accepted'] | ['s271032864', 's620594724'] | [8924.0, 9416.0] | [26.0, 61.0] | [114, 114] |
p02622 | u898176173 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['import sys\ns = sys.stdin.readline().rstrip()\nt = sys.stdin.readline().rstrip()\n\ncount = 0\nfor i in range(len(s)):\n if s[i] != s[t]:\n count += 1\n\nprint(count)', 's = sys.stdin.readline().rstrip()\nt = sys.stdin.readline().rstrip()\n\ncount = 0\nfor i in range(len(s)):\n if s[i] != s[t]:\n count += 1\nprint(count)', 'import sys\n\ns = sys.stdin.readline().rstrip()\nt = sys.stdin.readline().rstrip()\n\ncount = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s327183241', 's535209979', 's643133542'] | [9396.0, 8852.0, 9424.0] | [24.0, 26.0, 64.0] | [161, 149, 161] |
p02622 | u910263818 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=input()\ns1=input()\nc=0;\nfor i in range(len(s1)):\n if(s1[i]!=s[i]):\n c++;\nprint(c)', 's=input()\ns1=input()\nc=0;\nfor i in range(len(s1)):\n if(s1[i]!=s[i]):\n c+=1;\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s364614076', 's493081999'] | [9012.0, 9340.0] | [22.0, 66.0] | [87, 88] |
p02622 | u911612592 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = str(input())\nt = str(input())\n\ncount = 0\n\nfor i in range s:\n if s[i] != t[i]\n count += 1\n \nprint(count)', 's = str(input())\nt = str(input())\n\nsl = len(s)\n\ncount = 0\n\nfor i in range(0,sl):\n if s[i] != t[i]:\n count += 1\n\nprint(count)\n'] | ['Runtime Error', 'Accepted'] | ['s355120169', 's681613353'] | [9008.0, 9344.0] | [26.0, 59.0] | [110, 131] |
p02622 | u917444023 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a=int(input())\nprint(a+a*a+a*a*a)', 's=list(input())\nt=list(input())\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s210602143', 's373522625'] | [9292.0, 12564.0] | [30.0, 70.0] | [33, 106] |
p02622 | u918601425 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=input()\nT=input()\ncount=0\nfor i in range(len(S)):\n if S[i]==T[i]:\n count+=1\nprint(count)', 'S=input()\nT=input()\ncount=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n count+=1\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s405945663', 's426782472'] | [9440.0, 9304.0] | [57.0, 60.0] | [94, 95] |
p02622 | u920359958 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ["try:\n s = input()\n t = input()\n count = 0\n for i in range(len(s)):\n if not s[i] == t[i]:\n count += 1\n print(count)\nexcept EOFError:\n print('EOFError')\n ", 's = input()\nt = input()\ncount = 0\nfor i in range(len(a)):\n if not s[i] == t[i]:\n count += 1\nprint(count)', 'm=input()\nn=input()\ncount=0\nfor i in range(len(m)):\n if m[i]!=n[i]:\n count+=1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s431897701', 's451152826', 's305698852'] | [8996.0, 9336.0, 9392.0] | [27.0, 29.0, 64.0] | [163, 108, 97] |
p02622 | u921352252 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=input()\nt=input()\na=t.count(s)\nb=len(t)-a\nprint(b)\n ', 's=list(input())\nt=list(input())\ncount=0\nfor i in range(0,len(s)):\n if s[i]!=t[i]:\n count+=1\n \nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s431805848', 's761374413'] | [9384.0, 12216.0] | [30.0, 72.0] | [55, 113] |
p02622 | u924594299 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = str(input())\nT = str(input())\n\ncount = 0\nfor i in range(i, len(S)):\n if S[i] != T[i]:\n count+=1\n \nprint(count)', 'S = str(input())\nT = str(input())\n \ncount = 0\nfor i in range(0, len(S)):\n if S[i] != T[i]:\n count+=1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s282259790', 's170351848'] | [9304.0, 9368.0] | [22.0, 61.0] | [121, 122] |
p02622 | u924785929 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = list(input())\nT = list(input())\ncount = 0\nfor s,t in zip(S,T):\n if s != t:\n count += 1', 'S = list(input())\nT = list(input())\ncount = 0\nfor s,t in zip(S,T):\n if s != t:\n count += 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s920046791', 's517395149'] | [12496.0, 12508.0] | [67.0, 67.0] | [100, 113] |
p02622 | u925478395 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a = list(input())\nb = list(input())\ncount = 0\n\nfor i,con in enumerate(b):\n if i == a[i]:\n break\n else:\n count+=1\n \nprint(count)', 'a = list(input())\nb = list(input())\ncount = 0\n\nfor i,con in enumerate(b):\n if i == a[i]:\n break\n else:\n count+=1\nprint(count)', 'a = list(input())\nb = list(input())\n\nfor i,con in enumerate(b):\n if i == a[i]:\n break\n else:\n count+=1\nprint(count)\n \n ', 'a = list(input())\nb = list(input())\ncount = 0\n\nfor i in range(len(b)):\n if b[i] != a[i]:\n \tcount+=1\n \nprint(count)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s529935657', 's871059885', 's907548544', 's289940183'] | [12424.0, 12420.0, 12564.0, 12488.0] | [67.0, 71.0, 32.0, 68.0] | [138, 133, 131, 119] |
p02622 | u926266624 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n\ns_len = len(s)\ncount = 0\nfor i in range(s):\n if s[i] != t[i]:\n count += 1\nprint(count)', 's = input()\nt = input()\n\ns_len = len(s)\ncount = 0\nfor i in range(s_len):\n if s[i] != t[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s809395574', 's857091513'] | [9336.0, 9340.0] | [26.0, 61.0] | [116, 120] |
p02622 | u933929042 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\ncount = 0\nfor i in len(s):\n if s[i] != t[i]:\n count += 1\n \nprint(count)\n', 's = input()\nt = input()\ncount = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n count += 1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s271732070', 's938145381'] | [9272.0, 9332.0] | [25.0, 65.0] | [103, 115] |
p02622 | u937396845 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=list(input().split())\nT=list(input().split())\ncount=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n count = count+1\nprint(count)', 'ans=0\nS=list(input())\nT=list(input())\nfor i in range(len(S)):\n if S[i] != T[i]:\n ans = ans+1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s288184929', 's895851129'] | [9472.0, 12564.0] | [31.0, 72.0] | [129, 107] |
p02622 | u938635664 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nk = len(T)', 'S = input()\nT = input()\nk = len(T)\nfor i in range(k):\n if S[k] == T[k]:\n m = m\n else:\n m += 1\nprint(m)', 'S = input()\nT = input()\nk = len(T)\nm = 0\nfor i in range(k):\n if S[k] == T[k]:\n m = m\n else:\n m += 1\nprint(m)', 'S = input()\nT = input()\nk = len(T)\nm = 0\nfor i in range(k):\n if S[k] == T[k]:\n m = m\n else:\n S[k] = T[k]\n m += 1\nprint(m)', 'S = input()\nT = input()\nk = len(T)\nm = 0\nfor i in range(k):\n if S[i] != T[i]:\n m += 1\nprint(m)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s084303262', 's260287922', 's353905193', 's488194362', 's768160693'] | [9336.0, 9384.0, 9340.0, 9392.0, 9364.0] | [27.0, 27.0, 25.0, 24.0, 66.0] | [34, 110, 116, 132, 98] |
p02622 | u941280449 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['\na=input()\nb=input()\ni=0\ngood=0\nwhile(i<len(a)):\n if(a[i]!=b[i]):\n good+=1\n\ti+=1\nprint(good) ', 'a=input()\nb=input()\ni=0\ngood=0\nwhile(i<len(a)):\n if(a[i]!=b[i]):\n good+=1\nprint(good) ', 'a=input()\nb=input()\n\ngood=0\nfor i in range(len(a)):\n if(a[i]!=b[i]):\n good+=1\nprint(good)'] | ['Runtime Error', 'Time Limit Exceeded', 'Accepted'] | ['s074272695', 's140934793', 's638698438'] | [8888.0, 9344.0, 9416.0] | [23.0, 2206.0, 61.0] | [110, 103, 99] |
p02622 | u942280986 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S=input()\nT=input()\ncount=list(range(0,len(S)))\nprint(count)\n\nc=0\n\nfor i in count:\n if S[i] != T[i]:\n c+=1\n else:\n continue\nprint(c)', 'S=input()\nT=input()\ncount=list(range(0,len(S)))\nc=0\n\nfor i in count:\n if S[i] != T[i]:\n c+=1\n else:\n continue\nprint(c)'] | ['Wrong Answer', 'Accepted'] | ['s047259112', 's112566678'] | [20092.0, 17124.0] | [83.0, 73.0] | [152, 138] |
p02622 | u944302117 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['input1 = input()\ninput2 = input()\n\ndef match(x, y):\n i = 0\n if x is y:\n i = 1\n return i\n\nresult_list = map(match, input1, input2)\nprint(result_list.count(0))', 'input1 = input()\ninput2 = input()\n\ndef match(x, y):\n i = 0\n if x is y:\n i = 1\n return i\n\nresult_list = list(map(match, input1, input2))\nprint(result_list.count(0))'] | ['Runtime Error', 'Accepted'] | ['s241570755', 's221301640'] | [9388.0, 10864.0] | [26.0, 48.0] | [173, 179] |
p02622 | u947664173 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s=list(input())\nt=list(input())\nu=len(s)\nans=0\nfor i in range(u):\n if s[u] != t[u]:\n ans+=1\n \nprint(ans)', '# -*- coding: utf-8 -*-\n"""\nCreated on Fri Sep 18 19:19:52 2020\n\n@author: ezwry\n"""\n\ns=list(input())\nt=list(input())\nu=len(s)\nans=0\nfor i in range(u):\n if s[i] != t[i]:\n ans+=1\n \nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s240860707', 's358674556'] | [12508.0, 12440.0] | [35.0, 69.0] | [111, 202] |
p02622 | u949327459 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['A = input()\n\nA = A.splitlines()\n\nchange_num = 0\n\nNum = len(A[0])\n\nS = list(A[0])\nT = list(A[1])\n\nfor i in range(Num):\n if S[i] is not T[i]:\n change_num += 1\n\nprint(change_num)', 'S = input()\nT = input()\n\nNum = len(S)\n\nS = list(S)\nT = list(T)\n\nchange_num = 0\n\nfor i in range(Num):\n if S[i] is not T[i]:\n change_num += 1\n\nprint(change_num)'] | ['Runtime Error', 'Accepted'] | ['s632297873', 's697343145'] | [10464.0, 12252.0] | [27.0, 63.0] | [185, 168] |
p02622 | u951997475 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\n \nlen([x for x in map(set, zip(S, T)) if len(x) == 2])', 'S = input()\nT = input()\n \nprint(len([x for x in map(set, zip(S, T)) if len(x) == 2]))'] | ['Wrong Answer', 'Accepted'] | ['s733871443', 's447254235'] | [55288.0, 55200.0] | [204.0, 211.0] | [78, 85] |
p02622 | u954170646 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['first=strings.spitlines(input())\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(len(P)-1):\n if P=0:count=count+1\n else count=count\nprint(count)', 'second=input()\nfirst=splitlines(second)\nP=string(first[0])\nS=string(first[1])\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] is S[t]:\n count=count+1\n# else:\n# count=count\nprint(int(count))', 'second=input()\nfirst=spitlines(second)\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t]=S[t]:count=count+1\n else count=count\nprint(count)', 'first=input()\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(len(P)-1):\n if P eq 0:count=count+1\n else count=count\nprint(count)', 'a=[input() for i in range(2)]\nP=a[0]\nS=a[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] != S[t]:\n count=count++\nprint(count)', 'a=[input() for i in range(2)]\nP=a[0]\nS=a[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] == S[t]:\n count=count+1\nprint(count)', 'a=[input() for i in range(2)]\nP=a[0]\nS=a[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] is S[t]:\n count=count+1\n# else:\n# count=count\nprint(int(count))', 'first=strings.spitlines(input())\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(len(P)-1):\n if P eq 0:count=count+1\n else count=count\nprint(count)', 'second=input()\nfirst=splitlines(second)\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t]=S[t]:count=count+1\n else count=count\nprint(int(count))', 'second=input()\nfirst=strings.spitlines(second)\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(len(P)-1):\n if P[t]=S[t]:count=count+1\n else count=count\nprint(count)', 'second=input()\nfirst=spit(second)\nP=string(first[0])\nS=string(first[1])\ncount=0\nfor t in range(0,len(P)-1):\n if P[t]=S[t]:count=count+1\n else count=count\nprint(int(count))', 'second=input()\nfirst=split(second)\nP=string(first[0])\nS=string(first[1])\ncount=0\nfor t in range(0,len(P)-1):\n if P[t]=S[t]:count=count+1\n else count=count\nprint(int(count))', 'second=input()\nfirst=strings.spitlines(second)\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(len(P)-1):\n if P=0:count=count+1\n else count=count\nprint(count)', 'second=input()\nfirst=splitlines(second)\nP=string(first[0])\nS=string(first[1])\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] is S[t]:count=count+1\n# else:\n# count=count\nprint(int(count))', 'a=[input() for i in range(2)]\nP=a[0]\nS=a[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] != S[t]:\n count=count+1\nprint(count)', 'second=input()\nfirst=splitlines(second)\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] is S[t]:count=count+1\n else count=count\nprint(int(count))', 'IN=input()\n[P,S]=splitlines(IN)\ncount=0\nfor t in range(len(P)-1):\n if P[t] = S[t]:\n count=count+1\n else:\n count=count\nprint(int(count))\n', 'second=input()\nfirst=splitlines(second)\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t] is S[t]:count=count+1\n else:\n count=count\nprint(int(count))', 'second=input()\nfirst=strings.spitlines(second)\nP=first[0]\nS=first[1]\ncount=0\nfor t in range(0,len(P)-1):\n if P[t]=S[t]:count=count+1\n else count=count\nprint(count)', 'a=[input() for i in range(2)]\nP=a[0]\nS=a[1]\ncount=0\nfor t in range(len(P)):\n if P[t] != S[t]:\n count=count+1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s120422397', 's121684228', 's253837574', 's323519296', 's369471946', 's428596542', 's448765342', 's464494654', 's499393954', 's523050953', 's596606425', 's621618853', 's737512312', 's814994961', 's847915337', 's936382707', 's939787719', 's955558208', 's973167594', 's795748517'] | [8852.0, 9096.0, 9024.0, 8928.0, 8828.0, 9336.0, 9312.0, 8912.0, 8876.0, 8748.0, 8800.0, 8992.0, 8828.0, 9228.0, 9344.0, 8852.0, 9016.0, 8788.0, 8868.0, 9412.0] | [25.0, 25.0, 25.0, 24.0, 26.0, 62.0, 64.0, 25.0, 21.0, 20.0, 24.0, 24.0, 28.0, 26.0, 65.0, 29.0, 34.0, 27.0, 29.0, 61.0] | [145, 198, 159, 129, 129, 129, 164, 148, 165, 165, 175, 176, 159, 193, 129, 168, 144, 175, 167, 125] |
p02622 | u957486750 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['k=list(input())\nm=list(input())\nams=0\nfor i in (len(k)):\n if(k[i]!=m[i]):\n ams+=1\nprint(ams)', 'k=list(input())\nm=list(input())\nams=0\nfor i in range(len(k)):\n if(k[i]!=m[i]):\n ams+=1\nprint(ams)'] | ['Runtime Error', 'Accepted'] | ['s327727090', 's829742830'] | [12492.0, 12504.0] | [33.0, 68.0] | [96, 101] |
p02622 | u959340534 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\nans = 0\nfor S, T in zip(s, t):\n if S == T:\n ans += 1\nprint(ans)', 's = input()\nt = input()\nans = 0\nfor S, T in zip(s, t):\n if S != T:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s438199285', 's911601778'] | [9340.0, 9328.0] | [58.0, 58.0] | [91, 92] |
p02622 | u967484343 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a = input()\nb = input()\ncount = 0\nfor i in a:\n if b[i] != a[i]:\n b[i] = a[i]\n count += 1\nprint(count)', 'a = input()\nb = input()\ncount = 0\nfor i in range(len(a)):\n if b[i] != a[i]:\n b = b[i-1:] + a[i] + b[:i+1]\n count += 1\nprint(count)', 'a = input()\nb = input()\ncount = 0\nfor i in range(len(a)):\n if b[i] != a[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s022979277', 's817658524', 's832655867'] | [9140.0, 10504.0, 9208.0] | [25.0, 2206.0, 61.0] | [119, 148, 111] |
p02622 | u969848070 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['a = input()\nb = input()\nans = 0\nfor i in range(len(a)):\n if a[i] == b[i]:\n ans += 1\nprint(ans)', 'a = input()\nb = input()\nans = 0\nfor i in range(len(a)):\n if a[i] != b[i]:\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s268890840', 's191067357'] | [9344.0, 9212.0] | [64.0, 61.0] | [98, 98] |
p02622 | u972036293 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\ncount = 0\nfor i in [:len(S)]:\n if S[i] != T[i]:\n count += 1\nprint(count)\n', 'S = input()\nT = input()\ncount = 0\nfor i in [:len(S)]:\n if S[i] == T[i]:\n count += 1\nprint(count)', 'S = input()\nT = input()\ncount = 0\nfor i in [0:len(S)]:\n if S[i] != T[i]:\n count += 1\nprint(count)\n', 'S = input()\nT = input()\ncount = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n count += 1\nprint(count)\n', 'S = input()\nT = input()\ncount = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s484897807', 's498877642', 's716460241', 's807392678', 's528506860'] | [8936.0, 8984.0, 8960.0, 9356.0, 9388.0] | [26.0, 24.0, 25.0, 60.0, 63.0] | [101, 100, 102, 105, 104] |
p02622 | u975997984 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = input()\nT = input()\nN = len(S)\nans = 0\nfor i in range(N):\n if not S[i] == T[i]:\n S[i] = T[i]\n ans += 1\nprint(ans)\n', 'S = input()\nT = input()\nN = len(S)\nans = 0\nfor i in range(N):\n if S[i] != T[i]:\n ans += 1\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s028680665', 's258407332'] | [9324.0, 9416.0] | [50.0, 60.0] | [135, 111] |
p02622 | u981747421 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['S = list(input())\nT = list(input())\ncnt = 0\nfor s,t in S,T:\n if s != t:\n cnt++\nprint(cnt)', 'S = list(input())\nT = list(input())\ncnt = 0\nfor t in range(0,int(len(S))-1):\n if S[t] != T[t]:\n cnt += 1\nprint(cnt)', 'S = list(input())\nT = list(input())\ncnt = 0\nfor t in range(int(len(S))):\n if S[t] != T[t]:\n cnt++\nprint(cnt)', "S = list(input().split(''))\nT = list(input().split(''))\ncnt = 0\nfor s,t in S,T:\n if s != t:\n cnt++\nprint(cnt)", 'S = list(input())\nT = list(input())\ncnt = 0\nfor t in range(0,int(len(S))-1):\n if S[t] != T[t]:\n cnt++\nprint(cnt)', 'S = list(input())\nT = list(input())\ncnt = 0\nfor t in range(0,int(len(S))):\n if S[t] != T[t]:\n cnt += 1\nprint(cnt)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s023282772', 's304937843', 's387579542', 's417104771', 's733000996', 's654568895'] | [8892.0, 12496.0, 8960.0, 8920.0, 8940.0, 12420.0] | [23.0, 69.0, 22.0, 20.0, 23.0, 66.0] | [93, 119, 112, 113, 116, 117] |
p02622 | u987637902 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['# B Minor Change\nS = list(input())\nT = list(input())\nl=len(S)\nct = 0\nprint(l)\nfor i in range(l):\n if S[i] != T[i]:\n ct += 1\nprint(ct)\n', '# B Minor Change\nS = list(input())\nT = list(input())\nl=len(S)\nct = 0\nprint(l)\nfor i in range(l):\n if S[i] != T[i]:\n ct += 1\nprint(ct)', '# B Minor Change\nS = list(input())\nT = list(input())\nl =len(S)\nct = 0\nfor i in range(l):\n if S[i] != T[i]:\n ct += 1\nprint(ct)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s306701894', 's769148851', 's707729774'] | [12364.0, 12316.0, 12456.0] | [66.0, 66.0, 69.0] | [144, 143, 135] |
p02622 | u993090205 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\nresult = len([_ for a,b in zip(s,t) if a != b])\nprint(result)', 's = input()\nt = input()\nresult = len([e for a,b in zip(s,t) if a != b])\nprint(result)', 's = input()\nt = input()\nresult = len([a,b for a,b in zip(s,t) if a != b])\nprint(result)', 's = input()\nt = input()\nresult = len([e for a,b in zip(s,t) if a != b])\nprint(result)', 's = input()\nt = input()\nresult = len([e for a,b in zip(s,t) if a != b])\nprint(result)', 's = input()\nt = input()\nresult = len([e for a,b in zip(s,t) if a != b])\nprint(result)', 's = input()\nt = input()\nresult = len([a for a,b in zip(s,t) if a != b])\nprint(result)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s094740192', 's282631158', 's356427748', 's492388326', 's541639277', 's731710390', 's935698188'] | [9536.0, 9608.0, 9028.0, 9604.0, 9492.0, 9492.0, 10896.0] | [38.0, 36.0, 24.0, 36.0, 43.0, 42.0, 46.0] | [85, 86, 88, 86, 85, 85, 85] |
p02622 | u993893148 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['c = 0\ns = str(input())\nt = str(input())\n\nd = {}\nif s==t:\n\tprint(0)\nelif sorted(s) == sorted(t):\n\tprint(len(s))\nelse:\n\tfor i in s:\n\t\tif i not in d:\n\t\t\td[i] = 1\n\t\telse:\n\t\t\td[i] +=1\n\n\tfor i in d:\n\t\tif i in t:\n\t\t\td[i]-=1\n\t\telse:\n\t\t\tc+=d[i]\n\tprint(c)', '\nc = 0\ns = str(input())\nt = str(input())\n\nd = {}\nif sorted(s) == sorted(t):\n\tprint(len(s))\nelse:\n\tfor i in s:\n\t\tif i not in d:\n\t\t\td[i] = 1\n\t\telse:\n\t\t\td[i] +=1\n\n\tfor i in d:\n\t\tif i in t:\n\t\t\td[i]-=1\n\t\telse:\n\t\t\tc+=d[i]\n\tprint(c)\n', '\nt = str(input())\ns = str(input())\n\nprint(len(list(filter(lambda i: t[i]!=s[i], range(len(t))))))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s109325808', 's843319200', 's896982103'] | [13084.0, 13444.0, 17004.0] | [103.0, 110.0, 61.0] | [245, 226, 98] |
p02622 | u995163736 | 2,000 | 1,048,576 | Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so. Operation: Choose one character of S and replace it with a different character. | ['s = input()\nt = input()\n \nans = 0:\nfor i in range(len(s)):\n if s[i] != t[i]:\n ans += 1\nprint(ans)', 's = input()\nt = input()\n\nans = 0:\nfor i in range(s):\n if s[i] != t[i]:\n ans += 1\nprint(ans)', 's = input()\nt = input()\n \nans = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s238330202', 's470737677', 's382379457'] | [8880.0, 8944.0, 9300.0] | [24.0, 23.0, 63.0] | [101, 95, 106] |
p02623 | u000037600 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['from biesect import biesect_right\nfrom numpy import cumsum\nfrom sys import stdin\ninput=stdin.readline\nn,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\na=numpy.cumsum(a)\nb=numpy.cumsum(b)\nans=0\nfor i in range(len(a)):\n x=k-a[i]\n y=biesect.biesect_right(b,x)\n if ans<y+i+1:\n ans=y+i+1\nprint(ans)', 'from bisect import bisect_right\nfrom numpy import cumsum\nfrom sys import stdin\ninput=stdin.readline\nn,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\na=cumsum(a)\nb=cumsum(b)\nans=0\nif a[0]<k:\n for i in range(len(a)):\n x=k-a[i]\n y=bisect_right(b,x)\n print(y)\n if ans<y+i+1:\n ans=y+i+1\nprint(ans)', 'from bisect import bisect_right\nfrom numpy import cumsum\nfrom sys import stdin\ninput=stdin.readline\nn,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\na=numpy.cumsum(a)\nb=numpy.cumsum(b)\nans=0\nfor i in range(len(a)):\n x=k-a[i]\n y=bisect.bisect_right(b,x)\n if ans<y+i+1:\n ans=y+i+1\nprint(ans)', 'from bisect import bisect_right\nfrom numpy import cumsum\nfrom sys import stdin\ninput=stdin.readline\nn,m,k=map(int,input().split())\na=[0]+list(map(int,input().split()))\nb=list(map(int,input().split()))\na=cumsum(a)\nb=cumsum(b)\nans=0\nfor i in range(len(a)):\n x=k-a[i]\n if x>=0:\n y=bisect_right(b,x)\n if ans<y+i:\n ans=y+i\n else:\n break\nprint(ans)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s323118554', 's823500991', 's829054192', 's734463955'] | [9144.0, 59444.0, 59168.0, 59244.0] | [26.0, 735.0, 191.0, 662.0] | [347, 358, 343, 359] |
p02623 | u000623733 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['import bisect\n\nN, M, K = map(int, input().split())\nAlist = [0] + list(map(int, input().split()))\nBlist = list(map(int, input().split()))\n\nB = [Blist[0]]\nfor b in Blist[1:]:\n B.append(b + B[-1])\n\n\nsums = 0\nans = 0\nfor idx, a in enumerate(Alist):\n sums += a\n if sums > K:\n break\n k = K - sums\n print(k)\n tmp = bisect.bisect_right(B, k)\n ans = max(ans, idx + tmp)\n\nprint(ans)', 'import bisect\n\nN, M, K = map(int, input().split())\nAlist = [0] + list(map(int, input().split()))\nBlist = list(map(int, input().split()))\n\nB = [Blist[0]]\nfor b in Blist[1:]:\n B.append(b + B[-1])\n\nprint(B)\n\nsums = 0\nans = 0\nfor idx, a in enumerate(Alist):\n sums += a\n if sums > K:\n break\n k = K - sums\n tmp = bisect.bisect_right(B, k)\n ans = max(ans, idx + tmp)\n\nprint(ans)', 'import bisect\n\nN, M, K = map(int, input().split())\nAlist = [0] + list(map(int, input().split()))\nBlist = list(map(int, input().split()))\n\nB = [Blist[0]]\nfor b in Blist[1:]:\n B.append(b + B[-1])\n\n\nsums = 0\nans = 0\nfor idx, a in enumerate(Alist):\n sums += a\n if sums > K:\n break\n k = K - sums\n tmp = bisect.bisect_right(B, k)\n ans = max(ans, idx + tmp)\n\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s090674722', 's237799482', 's703903915'] | [40004.0, 45940.0, 40028.0] | [352.0, 309.0, 302.0] | [400, 396, 387] |
p02623 | u010178026 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['n, m, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na2 = [0]\nb2 = [0]\nfor i in range(n):\n a2.append(a2[i]+a[i])\nfor i in range(n):\n b2.append(b2[i]+b[i])\nfor i in range(len(a)):\n if a[0] > k:\n break\n cnt = 0\n sm = 0\n while sm < k-a2[i]:\n sm = b2[cnt]\n cnt += 1\n ans = max(cnt, ans)\nprint(ans)', 'n, m, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na2 = [0]\nb2 = [0]\nfor i in range(n):\n a2.append(a2[i]+a[i])\nfor i in range(m):\n b2.append(b2[i]+b[i])\nans = 0\ncnt = m\nfor i in range(n+1):\n if a2[i] > k:\n break\n sm = 0\n while b2[cnt] > k-a2[i]:\n cnt -= 1\n ans = max(cnt+i, ans)\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s399742690', 's531853938'] | [47356.0, 47372.0] | [231.0, 295.0] | [390, 378] |
p02623 | u017415492 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['n,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\n\nsa=[]\nka=0\nsb=[]\nkb=0\nfor i in range(n):\n if ka+a[i]<=k:\n ka+=a[i]\n sa.append(a[i])\n else:\n break\nfor i in range(m):\n if kb+b[i]<=k:\n kb+=b[i]\n sb.append(b[i])\n else:\n break\nans=max(len(sa),len(sb))\ntb=[]\nfor i in range(len(sa)):\n if sa[i]>k:\n break\n while kb+sa[i]>k:\n kb-=sb[-1]\n sb.pop(-1)\n tb.append(sa[i])\n kb+=sa[i]\n if ans<(len(sb)+len(tb)):\n ans=len(sb)\nprint(ans)\n', 'n,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\n\nsa=[]\nka=0\nsb=[]\nkb=0\nfor i in range(n):\n if ka+a[i]<=k:\n ka+=a[i]\n sa.append(a[i])\n else:\n break\nfor i in range(m):\n if kb+b[i]<=k:\n kb+=b[i]\n sb.append(b[i])\n else:\n break\nans=max(len(sa),len(sb))\ntb=[]\nfor i in range(len(sa)):\n if sa[i]>k:\n break\n while kb+sa[i]>k:\n kb-=sb[-1]\n sb.pop(-1)\n tb.append(sa[i])\n kb+=sa[i]\n if ans<(len(sb)+len(tb)):\n ans=(len(sb)+len(tb))\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s269754565', 's226246271'] | [41824.0, 41636.0] | [416.0, 355.0] | [510, 520] |
p02623 | u017624958 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['from collections import deque\n\nN, M, K = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n# print(A)\n\n\n\nconsumptions_A = [0]\nfor Ai in A:\n consumptions_A.append(consumptions_A + Ai)\n\nconsumptions_B = []\nfor Bi in B:\n consumptions_B.append(sum(B[:i]))\n\nanswer = 0\nj = M\nfor i in range(len(consumptions_A)):\n if (consumptions_A[i] > K): break\n\n remaining_time = K - consumptions_A[i]\n while consumptions_B[j] > remaining_time:\n j -= 1\n \n num_books = i + j\n answer = max(answer, num_books)\n\nprint(answer)\n', 'from collections import deque\n\nN, M, K = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n# print(A)\n\n\n\nconsumptions_A = [0]\nfor Ai in A:\n consumptions_A.append(consumptions_A + Ai)\n\nconsumptions_B = []\nfor Bi in B:\n consumptions_B.append(consumptions_B + Bi)\n\nanswer = 0\nj = M\nfor i in range(len(consumptions_A)):\n if (consumptions_A[i] > K): break\n\n remaining_time = K - consumptions_A[i]\n while consumptions_B[j] > remaining_time:\n j -= 1\n \n num_books = i + j\n answer = max(answer, num_books)\n\nprint(answer)\n', 'from collections import deque\n\nN, M, K = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n# print(A)\n\nA = deque(A)\nB = deque(B)\n\nnum_books = 0\nremaining_time = K\n\nwhile True:\n consumption = 0\n\n if len(A) == 0 and len(B) == 0: break\n\n if len(A) == 0:\n consumption = B.popleft()\n elif len(B) == 0:\n consumption = A.popleft()\n elif A[0] == B[0]:\n if A[1] < B[1]:\n consumption = A.popleft()\n elif: \n consumption = B.popleft()\n elif A[0] < B[0]:\n consumption = A.popleft()\n else:\n consumption = B.popleft()\n # print(consumption)\n \n remaining_time -= consumption\n if remaining_time < 0: break\n\n num_books += 1\n\nprint(num_books)\n \n', 'from collections import deque\n\nN, M, K = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n# print(A)\n\n\n\nconsumptions_A = [0]\nfor i in range(len(A)):\n consumptions_A.append(consumptions_A[i] + A[i])\n\nconsumptions_B = [0]\nfor i in range(len(B)):\n consumptions_B.append(consumptions_B[i] + B[i])\n\nanswer = 0\nj = M\nfor i in range(len(consumptions_A)):\n if (consumptions_A[i] > K): break\n\n remaining_time = K - consumptions_A[i]\n while consumptions_B[j] > remaining_time:\n j -= 1\n \n num_books = i + j\n answer = max(answer, num_books)\n\nprint(answer)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s280751540', 's904257009', 's914323775', 's200660937'] | [42100.0, 42156.0, 9016.0, 47816.0] | [123.0, 110.0, 23.0, 306.0] | [615, 624, 809, 657] |
p02623 | u021916304 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['def ii():return int(input())\ndef iim():return map(int,input().split())\ndef iil():return list(map(int,input().split()))\n\nimport numpy as np\n\nn,m,k = iim()\na = iil()\ncuma = np.cumsum(a)\nb = iil()\ncumb = np.cumsum(b)\n\nbest = m\nans = 0\nfor i in range(n):\n if cuma[i] > k:\n break\n while b[best] > k-a[i]:\n best -= 1\n ans = max(ans,best+i)\nprint(ans)\n', 'def ii():return int(input())\ndef iim():return map(int,input().split())\ndef iil():return list(map(int,input().split()))\n\nimport numpy as np\n\nn,m,k = iim()\na = iil()\ncuma = [0]\nfor i in a:\n cuma.append(cuma[-1]+i)\nb = iil()\ncumb = [0]\nfor i in b:\n cumb.append(cumb[-1]+i)\n\nbest = m\nans = 0\nfor i in range(n+1):\n if cuma[i] > k:\n break\n while cumb[best] > k-cuma[i]:\n best -= 1\n ans = max(ans,best+i)\n\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s789425221', 's519200482'] | [61856.0, 68372.0] | [216.0, 362.0] | [368, 439] |
p02623 | u024768467 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['n,m,k = map(int,input().split())\na_list = list(map(int,input().split()))\nb_list = list(map(int,input().split()))\n\nfrom itertools import accumulate\nimport bisect\n\nsum_a_list = list(accumulate([0] + a_list))\nsum_b_list = list(accumulate([0] + b_list))\n\nans = 0\nb_idx = 0\nfor a_idx in range(n+1):\n if sum_a_list[a_idx] > k:\n continue\n\n time_rest = k - sum_a_list[a_idx]\n b_idx = bisect.bisect_right(sum_b_list,time_rest)\n\n ans = max(ans, a_idx + b_idx)\n\nprint(ans)', 'n,m,k = map(int,input().split())\na_list = list(map(int,input().split()))\nb_list = list(map(int,input().split()))\n\nfrom itertools import accumulate\nimport bisect\n\nsum_a_list = list(accumulate([0] + a_list))\nsum_b_list = list(accumulate([0] + b_list))\n\nans = 0\nb_idx = 0\nfor a_idx in range(n+1):\n if sum_a_list[a_idx] > k:\n continue\n\n time_rest = k - sum_a_list[a_idx]\n b_idx = bisect.bisect_left(sum_b_list,time_rest)\n \n ans = max(ans, a_idx + b_idx)\n \nprint(ans)', 'n,m,k = map(int,input().split())\na_list = list(map(int,input().split()))\nb_list = list(map(int,input().split()))\n\nfrom itertools import accumulate\nsum_a_list = list(accumulate([0] + a_list))\nsum_b_list = list(accumulate([0] + b_list))\n\nans = 0\nb_idx = 0\nfor a_idx in range(n+1):\n if sum_a_list[a_idx] > k:\n continue\n\n time_rest = k - sum_a_list[a_idx]\n b_idx = bisect.bisect_left(sum_b_list,time_rest)\n \n ans = max(ans, a_idx + b_idx)\n \nprint(ans)', 'n,m,k = map(int,input().split())\na_list = list(map(int,input().split()))\nb_list = list(map(int,input().split()))\n\nfrom itertools import accumulate\nimport bisect\n\nsum_a_list = list(accumulate([0] + a_list))\nsum_b_list = list(accumulate([0] + b_list))\n\nans = 0\nb_idx = 0\nfor a_idx in range(n+1):\n if sum_a_list[a_idx] > k:\n continue\n\n time_rest = k - sum_a_list[a_idx]\n \n b_idx = bisect.bisect_right(sum_b_list,time_rest) - 1\n \n ans = max(ans, a_idx + b_idx)\n \nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s663823099', 's785821917', 's808162805', 's049028015'] | [49264.0, 48940.0, 48844.0, 49252.0] | [268.0, 268.0, 142.0, 299.0] | [480, 491, 476, 566] |
p02623 | u025287757 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['def main():\n N, M, K = map(int, input().split())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n time = 0\n num = 0\n while True:\n if num < N and time + A[num] <= K:\n time += A[num]\n num += 1\n else:\n break\n ans = num\n ans_temp = num\n for i in range(M):\n print(time)\n time += B[i]\n ans_temp += 1\n print(time)\n while time > K:\n if num > 0:\n time -= A[num-1]\n num -= 1\n ans_temp -=1\n else:\n break\n if num == 0 and time > K:\n break\n ans = max(ans, ans_temp)\n print(ans)\n \nif __name__ == "__main__":\n main()\n ', 'def main():\n N, M, K = map(int, input().split())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n time = 0\n num = 0\n while True:\n if num < N and time + A[num] <= K:\n time += A[num]\n num += 1\n else:\n break\n ans = num\n ans_temp = num\n for i in range(M):\n time += B[i]\n ans_temp += 1\n while time > K:\n if num > 0:\n time -= A[num-1]\n num -= 1\n ans_temp -=1\n else:\n break\n if num == 0 and time > K:\n break\n ans = max(ans, ans_temp)\n print(ans)\n \nif __name__ == "__main__":\n main()\n '] | ['Wrong Answer', 'Accepted'] | ['s809017174', 's752590929'] | [40928.0, 40628.0] | [335.0, 224.0] | [627, 595] |
p02623 | u029056424 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['N,M,K = map(int,input().split())\n\nA = list(map(int, input().split()))\nB =list(map(int, input().split()))\n\nsumA=[A[0]]\nsumB=[B[0]]\n\n\nfor i in range(1,N):\n sumA.append(sumA[-1]+A[i])\n\nfor a in range(len(sumA)):\n if sumA[a]>K:\n lessthanA=a-1\n break\nif sumA[-1]<=K:\n lessthanA=N-1\n\n \nfor i in range(1,M):\n sumB.append(sumB[-1]+B[i])\n\n \ntotalBook=0\ntime=0\n\nif A[0]>K and B[0]>K:\n totalBook=0\nelif A[-1]+B[-1]<=K:\n totalBook=N+M\n\nelse:\n for a in range(lessthanA,-1,-1):\n print(a*10000)\n for b in range(len(sumB)):\n print(b*1000000)\n if sumB[b]>=K-sumA[a]:\n print("sumB")\n print(sumB[b])\n break\n \n if a+b>=totalBook:\n print("totalBook")\n print(a)\n print(b)\n totalBook=a+b+1\n\nprint(totalBook)\n ', 'N,M,K = map(int,input().split())\n\nA = list(map(int, input().split()))\nB =list(map(int, input().split()))\n\nsumA=[0]\nsumB=[0]\n\n\nfor i in range(N):\n sumA.append(sumA[-1]+A[i])\nfor i in range(M):\n sumB.append(sumB[-1]+B[i])\n\n \ntotal=0\nstartB=len(sumB)-1\nfor a in range(len(sumA)):\n for b in range(startB,-1,-1):\n if sumA[a]+sumB[b]<=K:\n total=max(total,a+b)\n startB=b\n break\n if sumA[a]>K:\n break\n \nprint(total)\n '] | ['Wrong Answer', 'Accepted'] | ['s776348203', 's127983566'] | [48956.0, 47304.0] | [209.0, 352.0] | [766, 439] |
p02623 | u032484849 | 2,000 | 1,048,576 | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it. It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M). Consider the following action: * Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk. How many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading. | ['n,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\n\na.append(10**9+1)\nb.append(10**9+1)\n\ni,j,ans=0,0,0\nwhile k>=0:\n print(i,j)\n if a[i]>10**9:\n k-=b[j]\n j+=1\n elif b[i]>10**9:\n k-=a[i]\n i+=1\n elif a[i]>b[j]:\n k-=b[j]\n j+=1\n else:\n k-=a[i]\n i+=1\n if k<0:\n break\n ans+=1\n\nprint(ans)\n ', 'n,m,k=map(int,input().split())\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\n\na,b=[0],[0]\nfor i in range(n):\n a.append(a[i]+A[i])\nfor i in range(m):\n b.append(b[i]+B[i])\n\nj,ans=m,0\nfor i in range(n+1):\n if a[i]>k:\n break\n while b[j] > k-a[i]:\n j-=1\n ans=max(ans,i+j)\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s269514271', 's023023114'] | [40636.0, 47460.0] | [443.0, 292.0] | [415, 326] |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.