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 | u212786022 | 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())\n\nans = 0\n\nfor i in range(len(S)):\n ans += (S[i]==T[i])\n\nprint(ans)\n', 'S = list(input())\nT = list(input())\n\nans = 0\n\nfor i in range(len(S)):\n ans += (S[i]=T[i])\n\nprint(ans)', 'S = list(input())\nT = list(input())\n\nans = 0\n\nfor i in range(len(S)):\n ans += (S[i]!=T[i])\n\nprint(ans)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s246454225', 's393010270', 's259172706'] | [12388.0, 8860.0, 12396.0] | [68.0, 24.0, 66.0] | [104, 102, 104] |
p02622 | u214639130 | 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,count=input(),input(),0\n\nfor i in range(len(s)):\n if s[i]!=t[i]:\n count++\nprint(count)\n', 's,t,count=input(),input(),0\n\nfor i in range(len(s)):\n if s[i]!=t[i]:\n count+=1\nprint(count)\n'] | ['Runtime Error', 'Accepted'] | ['s311418469', 's510684614'] | [8948.0, 9312.0] | [24.0, 64.0] | [95, 96] |
p02622 | u215315599 | 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()\ncnt = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n cnt += 1\nprint(i)', 'S, T = input().split()\ncnt = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n cnt += 1\nprint(cnt)', 'S = input()\nT = input()\ncnt = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n cnt += 1\nprint(cnt)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s678586558', 's907058209', 's360107864'] | [9132.0, 9280.0, 9472.0] | [22.0, 28.0, 67.0] | [95, 97, 98] |
p02622 | u217303170 | 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 = 'abcde'\nt = 'bcdea'\nn = len(s)\ncnt = 0\nfor i in range(n):\n if s[i] != t[i]:\n cnt += 1\nprint(cnt)\n", 's = input()\nt = input()\nn = len(s)\ncnt = 0\nfor i in range(n):\n if s[i] != t[i]:\n cnt += 1\nprint(cnt)\n'] | ['Wrong Answer', 'Accepted'] | ['s230127745', 's853426977'] | [8868.0, 9480.0] | [32.0, 64.0] | [111, 111] |
p02622 | u217571418 | 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())\ncount = 0\n\nfor i in len(s):\n\tif s[i] != t[i]:\n\t\tcount += 1\n\nprint(count)', 's = str(input())\nt = str(input())\ncount = 0\n\nfor i in range(len(s)):\n\tif s[i] != t[i]:\n\t\tcount += 1\n\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s268767987', 's376815998'] | [9268.0, 9440.0] | [29.0, 61.0] | [106, 113] |
p02622 | u218834617 | 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(x!=y for x,y in zip(S,T))\n', 'S=input()\nT=input()\nprint(sum(x!=y for x,y in zip(S,T)))\n'] | ['Runtime Error', 'Accepted'] | ['s472475600', 's344029442'] | [8860.0, 9272.0] | [25.0, 49.0] | [56, 57] |
p02622 | u220277788 | 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().strip()\nT = input().strip()\ncount = 0\nfor i in len(S):\n if S[i] == T[i]:\n count += 1\nprint(count)', 'S = input().strip()\nT = input().strip()\ncount = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s733105673', 's109324506'] | [9268.0, 9284.0] | [23.0, 61.0] | [113, 120] |
p02622 | u237380198 | 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\nsl = list(s)\ntl = list(t)\n\ncount = 0\n\nfor a, b in sl, tl:\n if a!=b:\n count++\n \nprint(count)', 's = input()\nt = input()\n\nsl = list(s)\ntl = list(t)\n\ncount = 0\n\nfor (a, b) in zip(sl, tl):\n if a!=b:\n count++\n \nprint(count)\n', 's = input()\nt = input()\n\nsl = list(s)\ntl = list(t)\n\ncount = 0\n\nfor (a, b) in zip(sl, tl):\n if a!=b:\n count+=1\n \nprint(count)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s271761867', 's631259985', 's779552047'] | [8864.0, 8980.0, 12576.0] | [25.0, 24.0, 64.0] | [123, 131, 132] |
p02622 | u237601489 | 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()\ndef count_diff(s,t) :\n lst_s = list(s)\n lst_t = list(t)\n len_s = len(lst_s)\n ng = 0\n for i in range(len_s) :\n if lst_s[i] != lst_t[i] :\n ng += 1\n print(ng)\n\ncount_diff(s,t)', 'def count_diff(s,t) :\n lst_s = list(s)\n lst_t = list(t)\n len_s = len(lst_s)\n ng = 0\n for i in range(len_s) :\n if lst_s[i] != lst_t[i] :\n ng += 1\n print(ng)\n \ns = input()\nt = input()\n\ncount_diff(s,t)'] | ['Wrong Answer', 'Accepted'] | ['s143916186', 's959188522'] | [12532.0, 12572.0] | [99.0, 52.0] | [236, 241] |
p02622 | u242220327 | 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. | ['String s\nString t\nint x\nint i = 0\ns = input()\nt = input()\nfor(i in range(len(s)))\n if(s[i] == t[i])\n x = x + 1\n i = i + 1\nprint(x)', 'int x = 0\nint i = 0\ns = input()\nt = input()\nfor i in range(len(s))\n if s[i] == t[i]:\n x = x + 1\n i = i + 1\nprint(x)', 'String s\nString t\nint x\nint i = 0\ns = input()\nt = input()\nfor i in range(len(s))\n if(s[i] == t[i])\n x = x + 1\n i = i + 1\nprint(x)', 'String s\nString t\nint x\nint i = 0\ns = input()\nt = input()\nfor i in range(len(s))\n if(s[i] == t[i]):\n x = x + 1\n i = i + 1\nprint(x)', 'x = 0\ns = input()\nt = input()\nfor i in range(len(s))\n if s[i] == t[i]:\n x = x + 1\n i = i + 1\nprint(x)', 'x = 0\ns = input()\nt = input()\ny = len(s)\nfor i in range(y)\n if s[i] == t[i]:\n x += 1\n i += 1\nprint(x)', 'String s\nString t\nint x\nint i = 0\ns = input()\nt = input()\nfor i in range(len(s))\n if s[i] == t[i]:\n x = x + 1\n i = i + 1\nprint(x)', 'x = 0\ns = input()\nt = input()\ny = len(s)\nfor i in range(y)\n if s[i] == t[i]:\n x = x + 1\n i = i + 1\nprint(x)', 'x = 0\ns = input()\nt = input()\ny = len(s)\nfor i in range(y):\n if s[i] != t[i]:\n x += 1\n i += 1\nprint(x)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s066453109', 's288995056', 's430199261', 's440707167', 's798004494', 's800227471', 's873452289', 's917100487', 's628735071'] | [8936.0, 8996.0, 8936.0, 9004.0, 8964.0, 9012.0, 8940.0, 9012.0, 9312.0] | [29.0, 21.0, 26.0, 25.0, 24.0, 23.0, 25.0, 27.0, 74.0] | [135, 120, 134, 135, 106, 106, 134, 112, 107] |
p02622 | u244836567 | 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()\nc=0\nfor i in range(len(a)):\n if a[i]==b[i]:\n c=c+1\nprint(c)', 'a=input()\nb=input()\nc=0\nfor i in range(len(a)):\n if a[i]==b[i]:\n c=c+1\nprint(len(a)-c)'] | ['Wrong Answer', 'Accepted'] | ['s299822373', 's788520152'] | [9356.0, 9296.0] | [57.0, 58.0] | [83, 90] |
p02622 | u250413186 | 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())\n\nprint(a+a**2+a**3)', 'S=input()\nT=input()\n\ncount=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n count+=1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s364003322', 's552399373'] | [9252.0, 9420.0] | [30.0, 67.0] | [34, 100] |
p02622 | u257442624 | 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()\nj = 0\nfor i in range(len(s)):\n if not(s[i] == t[i]):\n j += 1\n \nprint(j)', 's = input()\nt = input()\nj = 0\nfor i in range(len(s)):\n if not(s[i] == t[i]):\n j += 1\n \nprint(j)'] | ['Wrong Answer', 'Accepted'] | ['s854942342', 's170326480'] | [9404.0, 9216.0] | [31.0, 68.0] | [115, 99] |
p02622 | u271123940 | 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())\ncount = 0\nfor i range(len(s)):\n if s[i] == t[i]:\n \tpass\n else:\n count += 1\nprint(count)', 's = str(input())\nt = str(input())\ncount = 0\nfor i range(len(s)+1):\n if s[i] == t[i]:\n pass\n else:\n count += 1\nprint(count)', 's = input()\nt = input()\ncount = 0\nfor i range(len(s)+1):\n if s[i] == t[i]:\n pass\n else:\n count += 1\nprint(count)', 's = input()\nt = input()\ncount = 0\nfor i range(len(s)):\n if s[i] == t[i]:\n pass\n else:\n count += 1\nprint(count)', 's=str(input())\nt=str(input())\nlength=len(s)\ncount=0\nfor i in range(length):\n\tif s[i]==t[i]:\n\t\tpass\n\telse:\n\t\tcount+=1\nprint(count)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s152645881', 's165336162', 's483921639', 's683465806', 's636684374'] | [8952.0, 8908.0, 9016.0, 8972.0, 9336.0] | [21.0, 25.0, 25.0, 23.0, 61.0] | [127, 130, 120, 118, 130] |
p02622 | u272457181 | 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 = 0\nfor i in range(len(s)):\n if s[i] == t[i]:\n a += 1\n \nprint(a)', 's = input()\nt = input()\na = 0\nfor i in range(len(s)):\n if not s[i] == t[i]:\n a += 1\n \nprint(a)'] | ['Wrong Answer', 'Accepted'] | ['s893230652', 's431417006'] | [9416.0, 9284.0] | [57.0, 62.0] | [97, 101] |
p02622 | u276229014 | 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,cnt=0\nfor check in s:\n if t[cnt] == check:\n cnt+=1\n else:\n ans+=1\n cnt+=1\nprint(ans)', 's = input()\nt = input()\nans=0\ncnt=0\nfor check in s:\n if t[cnt] == check:\n cnt+=1\n else:\n ans+=1\n cnt+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s370082898', 's096359123'] | [9088.0, 9404.0] | [23.0, 71.0] | [141, 141] |
p02622 | u278086871 | 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()\nc=0\nfor i in range(a):\n if(a[i]!=b[i]):\n c=c+1\nprint(c)', 'a=input()\nb=input()\nc=0\nfor i in range(len(a)):\n if(a[i]!=b[i]):\n c=c+1\nprint(c)\n'] | ['Runtime Error', 'Accepted'] | ['s094366046', 's419286889'] | [9424.0, 9372.0] | [24.0, 61.0] | [79, 85] |
p02622 | u279570066 | 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(S):\n if S[i] != T[i]:\n T[i] = S[i]\n\nprint(S)\nprint(T)', 'S = input()\nT = input()\n \ncount = 0\nfor i in S:\n if S[i] != T[i]:\n count +=1\n \nprint(count)', 'S = input()\nT = input()\n \ncount = 0\nfor i in range(S):\n if S[i] != T[i]:\n count +=1\n\nprint(count)\n \n \n', 'S = input()\nT = input()\n\nj =0\nfor i in S:\n if i != T[j]:\n count +=1\n j+=1\n\nprint(count)', 'S = input()\nT = input()\ncount = 0\nj =0\nfor i in S:\n if i != T[j]:\n count +=1\n j+=1\n\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s177627862', 's255620676', 's505013076', 's823504702', 's466232133'] | [9436.0, 9576.0, 9420.0, 9372.0, 9364.0] | [23.0, 26.0, 25.0, 53.0, 67.0] | [97, 95, 109, 92, 101] |
p02622 | u283751459 | 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 i in range(len(S)):\n if S[i] == T[i]:\n \tcontinue\n else:\n S[i] = T[i]\n count += 1\nreturn count\n ', 'S = list(input())\nT = list(input())\n\ncount = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n \tcontinue\n else:\n S[i] = T[i]\n count += 1\nprint(count)\n \n'] | ['Runtime Error', 'Accepted'] | ['s137895826', 's728736052'] | [9088.0, 12508.0] | [33.0, 88.0] | [146, 159] |
p02622 | u283937533 | 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\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', 'S = input()\nT = input()\n\ndef count_diff(S,T):\n cnt = 0\n for c1,c2 in zip(S, T):\n if c1 != c2:\n cnt += 1\n return cnt\nprint(count_diff(S,T))'] | ['Wrong Answer', 'Accepted'] | ['s899744109', 's138185009'] | [9296.0, 9344.0] | [34.0, 47.0] | [143, 165] |
p02622 | u290886932 | 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. | ['ret = 0\nS = input()\nT = input()\nprint(len[S[i] for i in range(len(S)) if S[i] != T[i]])', 'ret = 0\nS = input()\nT = input()\nprint(len([S[i] for i in range(len(S)) if S[i] != T[i]]))'] | ['Runtime Error', 'Accepted'] | ['s203379845', 's288381497'] | [9016.0, 11016.0] | [28.0, 54.0] | [87, 89] |
p02622 | u293215208 | 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 \nc = 0\n \nfor s in S:\n for t in T:\n if s != t:\n c += 1\nprint(c)', 'import sys\nS = input[0]\nT = input[1]\nleng\u3000= len(S)\nint N = 0\n\nfor i in leng:\n if S.charAt(i) == T.charAt(j):\n N = N + 1\n\nprint (N)', 'S = input()\nT = input()\n \nc = 0\n \nfor s,t in zip(S,T):\n if s != t:\n c += 1\nprint(c)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s018783271', 's396995157', 's018259933'] | [9508.0, 9012.0, 9372.0] | [2206.0, 22.0, 63.0] | [96, 136, 87] |
p02622 | u293760596 | 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 = str(input())\nb = str(input())\nc = 0\nfor i in range(len(a)):\n if a[i] == b[i]:\n c += 0\n else:\n b[i] = a[i]\n c += 1\nprint(c)', 'a = str(input())\nb = str(input())\nc = 0\nfor i in range(len(a)):\n if a[i] == b[i]:\n c += 0\n else:\n c += 1\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s433583405', 's481442476'] | [9364.0, 9412.0] | [55.0, 62.0] | [137, 121] |
p02622 | u293992530 | 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\nsys.setrecursionlimit(2147483647)\ninput=sys.stdin.readline\n\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(len(T)-count)\n\nif __name__=='__main__':\n main()", "import sys\nsys.setrecursionlimit(2147483647)\ninput=sys.stdin.readline\n\ndef main():\n S = int(input())\n T = int(input())\n count = 0\n for i in range(len(S)):\n if(S[i] != T[i]):\n count+=1\n print(len(T)-count)\n\nif __name__=='__main__':\n main()", "import sys\nsys.setrecursionlimit(2147483647)\ninput=sys.stdin.readline\n\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\nif __name__=='__main__':\n main()"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s257576104', 's850813142', 's680558410'] | [9332.0, 9432.0, 9416.0] | [50.0, 25.0, 48.0] | [242, 252, 235] |
p02622 | u295030042 | 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()\nc=len(a)\nd=0\nfor i in range(c):\n if a[i]==b[i]:\n d=d+1\nprint(d)\n \n ', 'a=input()\nb=input()\nc=len(a)\nd=0\nfor i in range(c):\n if a[i]==b[i]:\n d=d+1\nprint(c-d)\n \n \n'] | ['Wrong Answer', 'Accepted'] | ['s745726574', 's888150357'] | [9264.0, 9264.0] | [59.0, 59.0] | [95, 98] |
p02622 | u295172198 | 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\n\nfor s, t in zip(S,T):\n if s==t:\n ret+=1\nprint(ret)\n', 'S = input()\nT = input()\n\nret = 0\n\nfor s, t in zip(S,T):\n if s!=t:\n ret+=1\nprint(ret)\n'] | ['Wrong Answer', 'Accepted'] | ['s919117234', 's171050614'] | [9328.0, 9536.0] | [57.0, 54.0] | [95, 95] |
p02622 | u300297722 | 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 = []\nb = []\na.append(S)\nb.append(T)\ncount = 0\nfor i in range(len(a)):\n if a[i] != b[i]:\n count += 1\n else :\n pass\nprint(count)', 'S = input()\nT = input()\na = list(S)\nb = list(T)\ncount = 0\nfor i in range(len(a)):\n if a[i] != b[i]:\n count += 1\n else :\n pass\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s316463085', 's116166652'] | [9368.0, 12572.0] | [27.0, 67.0] | [172, 158] |
p02622 | u301423456 | 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(map(str,input().split()))\nt = list(map(str,input().split()))\ncount = 0\nfor i in range(len(s)):\n if(s[i] != t[i]):\n count += 1\nprint(count)', 's = list(map(str,input().split()))\nt = list(map(str,input().split()))\ncount = 0\nfor i in range(len(s)):\n if(s[i] == t[i]):\n count ++\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)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s332465378', 's594703899', 's195465480'] | [9400.0, 8944.0, 9376.0] | [32.0, 25.0, 64.0] | [157, 155, 110] |
p02622 | u303344598 | 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()\nr = 0\nfor i in range(0,len(a)):\n if a[i] == b[i]:\n r += 1\nprint(r)', 'a = input()\nb = input()\nr = 0\nfor i in range(0,len(a)):\n if a[i] != b[i]:\n r += 1\nprint(r)'] | ['Wrong Answer', 'Accepted'] | ['s408788118', 's879186452'] | [9248.0, 9380.0] | [59.0, 62.0] | [94, 94] |
p02622 | u305349402 | 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()\ntmp = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n pass:\n else:\n tmp += 1\n \n \nprint(tmp)\n ', 'S = input()\nT = input()\ntmp = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n pass\n else:\n tmp += 1\n \n \nprint(tmp)'] | ['Runtime Error', 'Accepted'] | ['s217982375', 's294818293'] | [8948.0, 9476.0] | [24.0, 65.0] | [129, 125] |
p02622 | u306142032 | 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. | ['print(sum(a!=b for a,b in zip(input(),input()))\n', 'print(sum(a!=b for a,b in zip(input(),input())))'] | ['Runtime Error', 'Accepted'] | ['s311396255', 's682222211'] | [8956.0, 9468.0] | [26.0, 50.0] | [48, 48] |
p02622 | u306260540 | 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'] | ['s714412940', 's753655035'] | [9320.0, 9412.0] | [64.0, 63.0] | [104, 105] |
p02622 | u309120194 | 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())\n\nans = 0\nfor i in range(len(S)):\n if s[i] != T[i]: ans += 1\nprint(ans)', 'S = list(input())\nT = list(input())\n \nans = 0\nfor i in range(len(S)):\n if S[i] != T[i]: ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s514660381', 's795563317'] | [12560.0, 12504.0] | [32.0, 69.0] | [107, 108] |
p02622 | u311220892 | 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()\nc=0\nfor i in range(len(s)):\n\tif s[i]!=t[i]:\n c+=1\nprint(c)', 's=input()\nt=input()\nc=0\nif len(s)==len(t):\n for i in range(len(s)):\n if s[i]!=t[i]:\n c+=1\n print(c)\nelse:\n print(c)\n \n'] | ['Runtime Error', 'Accepted'] | ['s553305659', 's557772408'] | [8868.0, 9316.0] | [23.0, 62.0] | [83, 148] |
p02622 | u313317027 | 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 ronge(len(s)):\n if s[i] != t[i]:\n count = count + 1\n \nprint(count)', 's = input()\nt = input()\n \ncount = 0\n \nfor i in range(len(s)):\n if s[i] != t[i]:\n count = count + 1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s508573182', 's430885500'] | [9336.0, 9332.0] | [27.0, 65.0] | [118, 120] |
p02622 | u315184129 | 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\na = 0\n\nfor i in range(len(s)):\n\tif s[i] == t[i]:a = a + 1\n \nprint(a)', 's = input()\nt = input()\n\na = 0\n\nfor i in range(len(s)):\n\tif s[i] != t[i]:\n\t\ta = a + 1\n \nprint(a)'] | ['Wrong Answer', 'Accepted'] | ['s913539899', 's709398431'] | [9132.0, 9324.0] | [66.0, 62.0] | [96, 99] |
p02622 | u317187086 | 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, c = input(), input(), 0\nfor i in range(len(s)): c += 1 if s[i] == t[i] else 0\nprint(c)', 's, t, c = input(), input(), 0\nfor i in range(len(s)):\n if s[i] != t[i]: c += 1\nprint(c)'] | ['Wrong Answer', 'Accepted'] | ['s902188421', 's136733459'] | [9348.0, 9156.0] | [63.0, 61.0] | [92, 88] |
p02622 | u321644110 | 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 = list(input().split())\ncount=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n count+=1\nprint(count)', 'S,T = list(input().split())\ncount=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n count+=1\nprint(count)', 'S= list(input())\nT= list(input())\ncount=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n count=count+1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s083670135', 's401238900', 's574312935'] | [9216.0, 9288.0, 12496.0] | [24.0, 31.0, 70.0] | [108, 108, 119] |
p02622 | u322171361 | 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()\naa=0\nfor s,t in zip(S,T):\n if s!=t:\n a+=1\nprint(a)', 'S=input()\nT=input()\naa=0\nfor s,t in zip(S,T):\n if s!=t:\n aa+=1\nprint(aa)'] | ['Runtime Error', 'Accepted'] | ['s052217162', 's988627169'] | [9364.0, 9364.0] | [46.0, 59.0] | [74, 76] |
p02622 | u334983390 | 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())\nrevise = 0\nlen_str = len(s)\nfor i in range(len_str):\n if s[i] != t[i]:\n revise += 1', 's = str(input())\nt = str(input())\nrevise = 0\nlen_str = len(s)\nfor i in range(len_str):\n if s[i] != t[i]:\n revise += 1\nprint(int(revise))'] | ['Wrong Answer', 'Accepted'] | ['s752995203', 's155916052'] | [9360.0, 9308.0] | [61.0, 62.0] | [127, 146] |
p02622 | u337949146 | 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 range(len(S)):\n if S[i] != T[i] :\n cnt += 1\nprrint(cnt)', 'S = input()\nT = input()\ncnt = 0\nfor i in range(len(S)):\n if S[i] != T[i] :\n cnt += 1\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s935305253', 's028494122'] | [9436.0, 9484.0] | [55.0, 62.0] | [106, 105] |
p02622 | u340428002 | 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. | ['# coding: UTF-8\n\nS = input()\nT = input()\n\nres = set()\nfor ss, tt in zip(S, T):\n if ss != tt:\n set[ss] = 1\n\nprint(len(res))', '# coding: UTF-8\n\nS = input()\nT = input()\n\nres = 0\nfor ss, tt in zip(S, T):\n if ss != tt:\n res += 1\n\nprint(res)'] | ['Runtime Error', 'Accepted'] | ['s073060661', 's206245634'] | [9488.0, 9488.0] | [49.0, 62.0] | [132, 120] |
p02622 | u343545816 | 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()\nif s == t:\n print(0)\ncount = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n count += 1\nprint(count)\n ', 's = input()\nt = input()\n\ncount = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s582117515', 's634241165'] | [9240.0, 9364.0] | [24.0, 62.0] | [121, 105] |
p02622 | u344748592 | 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()\no=0\nfor x,y in s,t:\n if x != y:\n o+=1\nprint(o)\n ', 's=input()\nt=input()\no=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n\t\to+=1\nprint(o)', 's=input()\nt=input()\no=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n o+=1\nprint(o)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s482609745', 's870010034', 's296612399'] | [9316.0, 8964.0, 9376.0] | [22.0, 22.0, 62.0] | [73, 80, 83] |
p02622 | u352676541 | 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()\ni = 0\nans = 1\nwhile S!=T:\n if S[i] != T[i]:\n S = S[:i-1] + T[i] +S[i+len(S)]\n ans+=1\n i+=1\nprint(ans)', 'S = input()\nT = input()\n\nfor i in S:\n if S[i] != T[i]:\n \ti+=1\nprint(i)\n', 'S = input()\nT = input()\nans = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n ans += 1\nprint(i)', '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', 'Wrong Answer', 'Accepted'] | ['s152159192', 's279373750', 's648848086', 's639811884'] | [9400.0, 9224.0, 9472.0, 9308.0] | [28.0, 27.0, 61.0, 62.0] | [133, 73, 96, 98] |
p02622 | u367147039 | 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)\n', 's=input()\nt=input()\n\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s282905191', 's216237982'] | [9488.0, 9296.0] | [58.0, 60.0] | [96, 96] |
p02622 | u377834804 | 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(int, input().split())\n\ncnt = 0\nfor s, t in zip(S, T):\n if s != t:\n cnt += 1\n\nprint(cnt)', 'S = input()\nT = input()\n\ncnt = 0\nfor s, t in zip(S, T):\n if s != t:\n cnt += 1\n\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s204197023', 's755940709'] | [9468.0, 9464.0] | [27.0, 61.0] | [102, 93] |
p02622 | u378691508 | 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 i in range(len(S)):\n if S[i]!=T[i]:\n count+=1\nprint(i)', 'S=input()\nT=input()\n\nans=0\nfor i in range(len(S)):\n\tif S[i]!=T[i]:\n\t\tans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s058848254', 's472203293'] | [9308.0, 9304.0] | [60.0, 63.0] | [91, 86] |
p02622 | u382639013 | 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)-1):\n if S[i] != T[i]:\n ans += 1\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)'] | ['Wrong Answer', 'Accepted'] | ['s650905157', 's928902386'] | [9408.0, 9284.0] | [68.0, 65.0] | [108, 106] |
p02622 | u384708632 | 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\nimport os\nf = open('input.txt', 'r')\nsys.stdin = f\nS = 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", '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'] | ['s151755382', 's613569929'] | [9104.0, 9308.0] | [23.0, 62.0] | [173, 111] |
p02622 | u398383435 | 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 = list(S)\nT = list(T)\n\ni = 0\nj = 0\n\nwhile j < len(S):\n if S[j] = T[j]:\n i = i\n j += 1\n else:\n i += 1\n j += 1\n \nprint(i)', 'S = input()\nT = input()\n\nS = list(S)\nT = list(T)\n\ni = 0\nj = 0\n\nwhile j < len(S):\n if S[j] == T[j]:\n i = i\n j += 1\n else:\n i += 1\n j += 1\n\nprint(i)'] | ['Runtime Error', 'Accepted'] | ['s771981275', 's881335566'] | [8652.0, 12596.0] | [25.0, 88.0] | [163, 180] |
p02622 | u404856401 | 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())\nc = 0\nfor i in len(s):\n if(s[i] != t[i]):\n c+=1\n\nprint(c)', 's = str(input())\nt = str(input())\nc = 0\nfor i in range(len(s)):\n if(s[i] != t[i]):\n c+=1\n \nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s302978779', 's575369319'] | [9340.0, 9464.0] | [22.0, 60.0] | [95, 103] |
p02622 | u407415713 | 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 = [x for x in input()]\nt = [y for y in input()]\ncount = 0\nfor _ in range(len(s)):\n if s[_] == t[_]:\n count+=1\nprint(count)', 's = [x for x in input()]\nt = [y for y in input()]\ncount = 0\nfor _ in range(len(s)):\n if s[_] != t[_]:\n count+=1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s403940448', 's420656500'] | [12712.0, 12580.0] | [66.0, 72.0] | [134, 134] |
p02622 | u410917601 | 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=int(input())\nT=int(input())\ncount=0;\nfor i in range(0,len(S)):\n if (T[i]!=S[i]):\n count+=1\nprint(count)', "S='apple'\nT='apple'\ncount=0;\nfor i in range(0,len(S)):\n if (T[i]!=S[i]):\n count+=1\nprint(count)", 'S=input()\nT=input()\ncount=0;\nfor i in range(0,len(S)):\n if (T[i]!=S[i]):\n count+=1\nprint(count)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s291365050', 's341173713', 's374816061'] | [9252.0, 9100.0, 9200.0] | [22.0, 28.0, 64.0] | [115, 105, 105] |
p02622 | u410956928 | 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().sprit()\na=0\nfor i in range(0,len(s)):\n if s[i]==t[i]:\n a=a+1\n else:\n a=a+0\nprint(a)', 's,t = input(), input()\na = 0\nfor i in range(len(s)):\n if s[i]==t[i]:\n a = a + 1\nprint(a)\n', 's,t = input(), split()\na = 0\nfor i in range(len(s)):\n if s[i]==t[i]:\n a = a + 1\n else:\n a = a + 0\nprint(a)\n', 's,t = input().sprit()\na=0\nfor i in range(len(s)):\n if s[i]==t[i]:\n a=a+1\n else:\n a=a+0\nprint(a)', 'S,T = input().split()\na=0\nfor i in range(len(S)):\n if S[i]==T[i]:\n a=a+1\n else:\n a=a+0\nprint(a)', 's,t = input().sprit()\ni=int(input())\na=0\nif s[i]=t[i]:\n a=a+1\nelse:\n a=a+0\nprint(a)', 's,t = input().split()\na = 0\nfor i in range(len(t)):\n if s[i] == t[i]:\n a = a + 1\n else:\n a = a + 0\nprint(a)', 's,t = input(), input()\na = 0\nfor i in range(len(s)):\n if s[i]==t[i]:\n a = a + 1\n else:\n a = a + 0\nprint(a)\n', 's,t = input().split()\na=0\nfor i in range(len(s)):\n if s[i]==t[i]:\n a=a+1\n else:\n a=a+0\nprint(a)', 's,t = input().split()\na = 0\nfor i in range(len(s)):\n if s[i]==t[i]:\n a = a + 1\n else:\n a = a + 0\nprint(a)\n', 's,t = input(), input()\na = 0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n a = a + 1\nprint(a)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s086762552', 's094883500', 's158622527', 's246859019', 's333658439', 's338271299', 's373726010', 's423552961', 's637170359', 's774022661', 's146629051'] | [9288.0, 9180.0, 9168.0, 9260.0, 9224.0, 8952.0, 9116.0, 9332.0, 9288.0, 9172.0, 9372.0] | [27.0, 66.0, 29.0, 26.0, 27.0, 23.0, 33.0, 66.0, 23.0, 28.0, 65.0] | [105, 99, 127, 107, 107, 89, 127, 127, 107, 126, 98] |
p02622 | u427093056 | 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=0\nfor x in range(s):\n if s[x]!=t[x]:\n a+=1\nprint(a)', 's=input()\nt=input()\na=0\nfor x in range(len(s)):\n if s[x]!=t[x]:\n a+=1\nprint(a)'] | ['Runtime Error', 'Accepted'] | ['s822499336', 's586692746'] | [9288.0, 9484.0] | [26.0, 63.0] | [77, 82] |
p02622 | u430395207 | 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 S, T:\n if s != t:\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)'] | ['Runtime Error', 'Accepted'] | ['s237988629', 's507115050'] | [9336.0, 9324.0] | [31.0, 64.0] | [92, 104] |
p02622 | u449473917 | 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]!=t[i]:\n ans+=1\n \nprint(ans)', 's=input()\nt=input()\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\n \nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s308743140', 's814591991'] | [9224.0, 9428.0] | [25.0, 63.0] | [98, 103] |
p02622 | u449580152 | 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=iuput()\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)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s781830480', 's869404416', 's781116194'] | [9252.0, 9108.0, 9472.0] | [61.0, 21.0, 70.0] | [96, 96, 97] |
p02622 | u454145409 | 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())\n\ncount = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n count += 1\nprint(count)', 'S = list(input())\nT = list(input())\n\ncount = 0\nfor i in range(len(S)):\n if S[i] == T[i]:\n count += 1\nprint(count)', 'S = list(input())\nT = list(input())\ncount = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n count += 1\nprint(count)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s661900221', 's858860653', 's525959599'] | [12492.0, 12424.0, 12296.0] | [67.0, 62.0, 71.0] | [136, 136, 122] |
p02622 | u454866890 | 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. | ['line1 = list(input())\nline2 = list(input())\nt = 0\nfor i in range(len(line1)):\n if line1[i] == line2[i]:\n t = t +1\nprint (t)', 'a = list(input())\nb = list(input())\nt = 0\nfor i in range(len(a)):\n if not a[i] == b[i]:\n t = t +1\n #print(a[i])\nprint (t)'] | ['Wrong Answer', 'Accepted'] | ['s624056100', 's705079623'] | [12372.0, 12456.0] | [67.0, 69.0] | [135, 141] |
p02622 | u455957070 | 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 = input()\na = [int(c) for c in s]\nb = [int(d) for d in t]\nans = 0\nfor i in range(len(a)):\n if(a[i] != b[i]):\n ans += 1\nprint(ans)', 's = input()\nt = input()\na = [c for c in s]\nb = [d for d in t]\nans = 0\nfor i in range(len(a)):\n if(a[i] != b[i]):\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s862574831', 's303046176'] | [9316.0, 12528.0] | [28.0, 74.0] | [159, 137] |
p02622 | u473234868 | 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()\nu = 0\n\nif s == t:\n print(0)\nelse:\n for i in range(len(s)):\n if s[i] != t[i]:\n u += 1\n else:\n path\n\nprint(u)\n', 's = input()\nt = input()\nu = 0\n\nif s == t:\n print(0)\nelse:\n for i in range(len(s)):\n if s[i] == t[i]:\n u += 1\n\nprint(u)', 's = input()\nt = input()\nu = 0\n\nif s == t:\n print(0)\nelse:\n for i in range(len(s)):\n if s[i] != t[i]:\n u += 1\n print(u)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s023992056', 's403580166', 's883395422'] | [9556.0, 9360.0, 9256.0] | [56.0, 58.0, 62.0] | [150, 128, 130] |
p02622 | u476628920 | 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 B()\n S = input()\n T = input()\n count=0\n for i in range(len(S)):\n if S[i]!=T[i]:\n count = count+1\nprint(count)\nB()', '#172B\ndef B()\n S = input()\n T = input()\n count=0\n for i in range(length(S)):\n if S[i]!=T[i]:\n count = count+1\nprint(count)\nB()', 'def B():\n s = input()\n t = input()\n count=0\n for i in range(len(s)):\n if s[i]!=t[i]:\n count = count+1\nprint(count)\nB()', 'def B():\n s = input()\n t = input()\n count=0\n for i in range(len(s)):\n if s[i]!=t[i]:\n count = count+1\n print(count)\nB()'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s950792297', 's989314870', 's990532788', 's402398233'] | [8940.0, 8992.0, 9024.0, 9380.0] | [22.0, 25.0, 23.0, 48.0] | [127, 136, 132, 134] |
p02622 | u477101389 | 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()\nb=input()\nc=0\nfor i in len(s):\n if s[i]!=b[i]:\n c=c+1\n else:\n pass\nprint(c)', 's=input()\nb=input()\nc=0\nfor i in range(len(s)):\n if s[i]!=b[i]:\n c=c+1\n else:\n pass\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s703459793', 's911554246'] | [9192.0, 9424.0] | [28.0, 62.0] | [93, 112] |
p02622 | u479353489 | 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, ch in enumerate(S):\n if ch != T[i]:\n ans += 1\nreturn ans', 'S = input()\nT = input()\nans = 0\nfor i, ch in enumerate(S):\n if ch != T[i]:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s619836650', 's757299931'] | [9016.0, 9252.0] | [26.0, 64.0] | [99, 99] |
p02622 | u480072433 | 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. | ["s1 = input().split()\nstrS = s1[0]\ns2 = input().split()\nstrT = s2[0]\n\n#strS = 'cupofcoffee'\n#strT = 'cupofhottea'\n\n#strS = 'abcde'\n#strT = 'bcdea'\n\n#strS = 'apple'\n#strT = 'apple'\n\ncharStrSList = list(strS)\ncharStrTList = list(strT)\n\nintCnt = 0\nidx = 0\nfor sChar in charStrSList:\n if (sChar != charStrTList[idx]) :\n intCnt += 1\n print(sChar)\n print(charStrTList[idx])\n print(intCnt) \n idx += 1\n\nprint(intCnt) \n", 's1 = input().split()\nstrS = s1[0]\ns2 = input().split()\nstrT = s2[0]\n\ncharStrSList = list(strS)\ncharStrTList = list(strT)\ndiffStrList = []\n\nidxA = 0\nfor sChar in charStrSList:\n if (sChar != charStrTList[idxA]) :\n diffStrList.append(sChar)\n idxA += 1\n\nprint(len(diffStrList)) '] | ['Wrong Answer', 'Accepted'] | ['s597855584', 's108515491'] | [12444.0, 14228.0] | [227.0, 78.0] | [443, 287] |
p02622 | u488934106 | 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 b172(slist, tlist):\n\n ans = 0\n\n for s, t in slist, tlist:\n if s != t:\n ans += 1\n\n return ans\n\ndef main():\n slist = list(str(input()))\n tlist = list(str(input()))\n print(b172(slist, tlist))\n\nif __name__ == '__main__':\n main()", "def b172(slist, tlist):\n\n ans = 0\n\n for s, t in zip(slist, tlist):\n if s != t:\n ans += 1\n\n return ans\n\ndef main():\n slist = list(str(input()))\n tlist = list(str(input()))\n print(b172(slist, tlist))\n\nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s240350605', 's702841767'] | [12524.0, 12440.0] | [34.0, 47.0] | [267, 272] |
p02622 | u493318999 | 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\ncnt = 0\nfor i in range():\n if s[i] != t[i]:\n cnt += 1\n\nprint(cnt) \n', 's = input()\nt = input()\n\ncnt = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n cnt += 1\n\nprint(cnt) '] | ['Runtime Error', 'Accepted'] | ['s763965489', 's492573742'] | [9328.0, 9372.0] | [27.0, 61.0] | [109, 114] |
p02622 | u497277272 | 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 = list(map(str, input().split()))\n T = list(map(str, input().split()))\n \n count = 0\n for i,s in enumerate(S):\n if s != T[i]:\n count +=1\n \n print(count)\n\nif __name__ == '__main__':\n main()\n ", "def main():\n S = input()\n T = input()\n \n count = 0\n for i in range(len(S)):\n if S[i] != T[i]:\n count +=1\n \n print(count)\n\nif __name__ == '__main__':\n main()\n "] | ['Wrong Answer', 'Accepted'] | ['s100565419', 's431842198'] | [9272.0, 9436.0] | [26.0, 48.0] | [253, 209] |
p02622 | u500673386 | 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. | ['t=input()\ni=0\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)', 's=input()\nt=input()\ni=0\nans=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s302586205', 's764460005'] | [9284.0, 9336.0] | [30.0, 66.0] | [88, 98] |
p02622 | u501486979 | 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)\nfor i in range(len(S)):\n if(S[i]!=T[i]):\n S[i]=T[i]\nprint(i+1)\n ', 'S=input()\nT=input()\nS1=list(S)\nT1=list(T)\nfor i in range(len(S1)):\n if(S1[i]!=T1[i]):\n S1[i]=T1[i]\nprint(i+1)\n ', 'S=input()\nT=input()\nS1=list(S)\nT1=list(T)\n\nfor i in range(len(S1)):\n if(S1[i]!=T1[i]):\n S1[i]=T1[i]\n \nprint(i)\n ', 'S=input()\nT=input()\nS=list(S)\nT=list(T)\nj=0\nfor i in range(len(S)):\n if(S[i]!=T[i]):\n S[i]=T[i]\n j +=1\nprint(j)\n '] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s294200747', 's484882170', 's765597289', 's171706970'] | [12432.0, 12368.0, 12300.0, 12440.0] | [73.0, 72.0, 69.0, 82.0] | [117, 124, 128, 133] |
p02622 | u503111914 | 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)\n'] | ['Runtime Error', 'Accepted'] | ['s973284954', 's221667555'] | [8876.0, 9368.0] | [25.0, 64.0] | [101, 101] |
p02622 | u504348975 | 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(int, input().split())\n2 A = list(map(int, input().split()))\n3 B = list(map(int, input().split()))\n\nnum = 0\nfor ind, s in enumerate(A):\n if A[ind] != B[ind]:\n num = num + 1\nprint(num)', 'S, T= map(string, input().split())\n\nnum = 0\nfor ind, s in enumerate(S):\n if S[ind] != T[ind]:\n num = num + 1\nprint(num)', 'S, T= input().split()\n\nnum = 0\nfor ind, s in enumerate(S):\n if S[ind] != T[ind]:\n num = num + 1\nprint(num)', 'S, T= map(int, input().split())\n\nnum = 0\nfor ind, s in enumerate(S):\n if S[ind] != T[ind]:\n num = num + 1\nprint(num)', 's = input()\nt = input()\n\nnum = 0\nfor ind, s in enumerate(A):\n if A[ind] != B[ind]:\n num = num + 1\nprint(num)', 'S = input()\nT = input()\n\nnum = 0\nfor ind, s in enumerate(S):\n if S[ind] != T[ind]:\n num = num + 1\nprint(num)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s014823004', 's028930038', 's552385653', 's615382338', 's686905800', 's949881713'] | [8856.0, 8956.0, 9144.0, 9276.0, 9352.0, 9284.0] | [30.0, 25.0, 26.0, 29.0, 27.0, 68.0] | [203, 130, 117, 127, 119, 119] |
p02622 | u506233529 | 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. | ['x, y=input().split()\nm = 0 \nfor i in range(len(x)):\n if x[i] != y[i]:\n Y = y.replace(y[i], x[i]) \n m+=1\nprint(m) ', 'x=input()\ny=input()\nm = 0 \nfor i in range(len(x)-1):\n if x[i] != y[i]:\n Y = y.replace(y[i], x[i]) \n m+=1\n \nprint(m) ', 'x=input()\ny=input()\nm = 0 \nfor i in range(len(x)):\n if x[i] != y[i]: \n m+=1\nprint(m) '] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s598467166', 's664725122', 's639793050'] | [9072.0, 9408.0, 9252.0] | [25.0, 2206.0, 65.0] | [133, 145, 100] |
p02622 | u529134895 | 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(s)\nprint(t)\n\ntime = 0\nfor i in range(len(s)):\n if s[i] != t[i] :\n s[i] = t[i]\n time += 1\n \nprint(time)', 'a = list(input().split())\ns = a[0]\nt = a[1]\n\ns = list(s)\nt = list(t)\ntime = 0\nfor i in range(len(s)):\n if s[i] != t[i] :\n s[i] = t[i]\n time += 1\n\nprint(time)', 's = list(input())\nt = list(input())\n\ntime = 0\nfor i in range(len(s)):\n if s[i] != t[i] :\n s[i] = t[i]\n time += 1\n \nprint(time)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s683311109', 's913885190', 's143505929'] | [14084.0, 9152.0, 12380.0] | [110.0, 27.0, 90.0] | [161, 174, 143] |
p02622 | u531456543 | 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()\ndef hamming_dist(str1,str2):\n ans = 0\n a,b = len(str1),len(str2)\n if a > b:\n ans = a - b\n length = b\n elif a < b:\n ans = b - a\n length = a\n else:\n length = a\n for i in range(length):\n if str1[i] != str2[i]:\n ans += 1\n return ans\nprint(hamming_dist(s,t))', 's = input()\nt = input()\ndef hamming_dist(str1,str2):\n ans = 0\n a,b = len(str1),len(str2)\n if a > b:\n ans = a - b\n length = b\n elif a < b:\n ans = b - a\n length = a\n else:\n length = a\n for i in range(length):\n if str1[i] != str2[i]:\n ans += 1\n return ans\nprint(hamming_dist(s,t))'] | ['Runtime Error', 'Accepted'] | ['s429753241', 's360046994'] | [9340.0, 9420.0] | [27.0, 49.0] | [351, 351] |
p02622 | u539659844 | 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 k in range(a):\n if s[k] != t[k]:\n count += 1\n \nprint(count)', 's = input()\nt = input()\ncount = 0\nfor k in range(len(s)):\n if s[k] != t[k]:\n count += 1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s619018369', 's685730382'] | [9344.0, 9420.0] | [25.0, 67.0] | [104, 109] |
p02622 | u542267798 | 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++\nprint(count)', 'S = input()\nT = input()\ncount = 0\ni = 0\nfor i in range(len(S)):\n if S[i]!= T[i]:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s677311160', 's403390953'] | [8836.0, 9244.0] | [27.0, 63.0] | [101, 109] |
p02622 | u546236742 | 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())\nn = 0\nfor c, d in zip(a, b):\n if c != d:\n count += 1', 'a = list(input())\nb = list(input())\nn = 0\nfor c, d in zip(a, b):\n if c != d:\n n += 1\nprint(n)'] | ['Runtime Error', 'Accepted'] | ['s324340118', 's259100830'] | [12580.0, 12500.0] | [51.0, 67.0] | [92, 97] |
p02622 | u553459461 | 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()\n\ncnt = 0\n\ni=0\n\nwhile(i<len(a)):\n if(a[i]!=b[i]):\n cnt+=1\n cnt+=1\n\nprint(cnt)', 'a = input()\nb = input()\n\ncnt = 0\n\ni=0\n\nwhile(i<len(a)):\n if(a[i]!=b[i]):\n cnt+=1\n i+=1\n\nprint(cnt)'] | ['Time Limit Exceeded', 'Accepted'] | ['s112734616', 's462152664'] | [9444.0, 9364.0] | [2205.0, 87.0] | [105, 109] |
p02622 | u556594202 | 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)+1):\n if S[i]!=T[i]:\n count +=1\n print(T[i])\nprint(count)', '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'] | ['s338404395', 's195041640'] | [9448.0, 9360.0] | [109.0, 61.0] | [121, 104] |
p02622 | u559315737 | 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()\nt=sdtin.readline()\ncount=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n count+=1\nprint(count) ', 'from sys import stdin\ns=stdin.readline()\nt=stdin.readline()\ncount=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n count+=1\nprint(count) '] | ['Runtime Error', 'Accepted'] | ['s405766647', 's172620059'] | [9180.0, 9436.0] | [26.0, 62.0] | [138, 138] |
p02622 | u566297428 | 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\nif S == T:\n print(count)\n exit(0)\n\nfor i in range(len(S)):\n if S[i] != T[i]:\n S = S.replace(S[i], T[i])\n count += 1\nprint(count)', 'S = input()\nT = input()\ncount = 0\n\n\nfor i in range(len(S)):\n if S[i] != T[i]:\n count += 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s992560954', 's816869797'] | [9468.0, 9284.0] | [2206.0, 64.0] | [185, 112] |
p02622 | u568576853 | 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'] | ['s270627377', 's975461289'] | [9300.0, 9412.0] | [59.0, 64.0] | [88, 88] |
p02622 | u576364343 | 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**2+a**3)', 'S = str(input())\nT = str(input())\nlength =len(S)\nlistS=list(S)\nlistT=list(T)\nnum = len(T)\nres = 0\nfor i in range(length):\n if (listS[num-1] != listT[num-1]):\n res +=1\n num -=1\nprint(res)'] | ['Runtime Error', 'Accepted'] | ['s217769482', 's644267179'] | [9428.0, 12492.0] | [31.0, 91.0] | [34, 199] |
p02622 | u581248859 | 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()\nT = map(int,imput().split())\ncnt = 0\nfor x,y in S,T:\n\tif x!=y:\n\t\tcnt += 1\n\nprint(cnt)', 'S = input()\nT = input()\ncnt = 0\nfor x,y in S,T:\n\tif x!=y:\n\t\tcnt += 1\n\nprint(cnt)', 'S = input()\nT = input()\nslen = len(S)\n\ncnt = 0\nfor i in range(0,slen):\n\tif S[i] !=T[i]:\n\t\tcnt += 1\n\nprint(cnt)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s281334512', 's318052785', 's264186598'] | [9352.0, 9376.0, 9308.0] | [25.0, 27.0, 60.0] | [110, 81, 111] |
p02622 | u582803594 | 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())\nb=0\nprint(S)\nprint(T)\n\nfor i in range(0,len(S)):\n if S[i]!= T[i]:\n b+=1\n\nprint(b)\n', 'S=list(input())\nT=list(input())\nb=0\n\n\nfor i in range(0,len(S)):\n if S[i]!= T[i]:\n b+=1\n\nprint(b)\n'] | ['Wrong Answer', 'Accepted'] | ['s700691435', 's707303762'] | [13884.0, 12504.0] | [87.0, 68.0] | [124, 107] |
p02622 | u583363497 | 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()\ndiffernce=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n difference+=1\nprint(difference)', 'S=input()\nT=input()\n \ndiffernce=0\n \nfor i in range(len(S)):\n if S[i]!=T[i]\n difference +=1\n \nprint(difference)\n ', 'S=input()\nT=input()\n\ndiffernce=0\n\nfor i in range(len(S)):\n if [S[i]!=T[i])\n difference +=1\n\nprint(difference)\n\n\n', 'S=input()\nT=input()\ndiffernce=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n difference+=1\nprint(difference)', 'S=input()\nT=input()\ndifference=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n difference+=1\nprint(difference)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s136480369', 's215568454', 's251946166', 's692548893', 's806723258'] | [9296.0, 8920.0, 8936.0, 9348.0, 9308.0] | [48.0, 21.0, 23.0, 51.0, 61.0] | [110, 118, 118, 108, 109] |
p02622 | u586639900 | 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()\n\nleng = len(S)\ncount = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n count += 1\n\nprint(count)', 'S = input()\nT = input()\n \nleng = len(S)\ncount = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n count += 1\n \nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s690905313', 's325559222'] | [9232.0, 9376.0] | [25.0, 65.0] | [119, 122] |
p02622 | u591808161 | 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. | ['\nimport 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()))\n\n\ns = input().rstrip()\nt = intput().rstrip()\nresult = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n result += 1\n \nprint(result)', '\nimport 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()))\n\n\ns = input().rstrip()\nt = input().rstrip()\nresult = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n result += 1\n \nprint(result)'] | ['Runtime Error', 'Accepted'] | ['s787761709', 's007289575'] | [9276.0, 9256.0] | [26.0, 69.0] | [320, 319] |
p02622 | u594592689 | 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([1 for index,char in enumerate(s) if p[index]!=char])) \n ', 's=input()\nt=input()\nprint(sum([1 for index,char in enumerate(s) if t[index]!=char])) \n '] | ['Runtime Error', 'Accepted'] | ['s042399730', 's538687866'] | [9564.0, 10780.0] | [25.0, 51.0] | [88, 87] |
p02622 | u597867180 | 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, b = input().split()\ncount = 0\nfor i in range(len(a)):\n if (a[i]!= b[i]):\n count += 1\nprint(count)', 'a, b = input().split()\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)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s077126307', 's624570972', 's607940254'] | [9292.0, 9288.0, 9468.0] | [24.0, 25.0, 63.0] | [104, 104, 105] |
p02622 | u599547273 | 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(sum(s != t for s, t zip(S, T)))', 'S = input()\nT = input()\n\nprint(sum(s != t for s, t in zip(S, T)))'] | ['Runtime Error', 'Accepted'] | ['s465240701', 's897415820'] | [8888.0, 9396.0] | [26.0, 46.0] | [62, 65] |
p02622 | u602773379 | 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())\nlength=len(s)\ncount=0\nfor i in range(s):\n\tif s[i]==t[i]:\n\t\tpass\n\telse:\n\t\tcount+=1\nprint(count)', 'S=str(input())\nT=str(input())\nans=0\nfor i in range(len(S)):\n\tif S[i]!=T[i]:\n\t\tans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s177617569', 's388329869'] | [9376.0, 9440.0] | [24.0, 60.0] | [124, 95] |
p02622 | u607569985 | 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. | ['N,K=map(int,input().split())\np=list(map(int,input().split()))\np.sort()\nres=0\nfor x in p[:K]:\n\tres+=x\n\nprint(res)', 'S=input()\nT=input()\n\nres=0\nfor i in range(len(S)):\n\tif not S[i]==T[i]:\n\t\tres+=1\nprint(res)'] | ['Runtime Error', 'Accepted'] | ['s494564008', 's758643659'] | [9352.0, 9316.0] | [31.0, 61.0] | [112, 90] |
p02622 | u611090896 | 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)', '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,j) in zip(s,t):\n if i != j:\n count+=1\nprint(count)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s740519340', 's872408374', 's158913249'] | [9352.0, 9328.0, 9376.0] | [25.0, 27.0, 56.0] | [93, 94, 94] |
p02622 | u612599720 | 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. | ['# -*- coding: utf-8 -*-\nS = list(input())\nT = list(input())\ntotal = 0\nfor num in range(len(S)):\n if S[num] == T[num]:\n total +=1\nprint(total)', '# -*- coding: utf-8 -*-\nS = list(input())\nT = list(input())\ntotal = 0\nfor num in range(len(S)):\n if S[num] != T[num]:\n total += 1\nprint(total)'] | ['Wrong Answer', 'Accepted'] | ['s724082510', 's479631345'] | [12572.0, 12436.0] | [61.0, 75.0] | [145, 152] |
p02622 | u616489782 | 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();\ncnt = 0;\nfor i in range(len(s)):\n if s[i] != t[i] :\n cnt=cnt+1;\nprint(cnt);\n', '[s,t]=input().split();\n\ncnt = 0;\nfor i in range(len(s)):\n if s[i] != t[i] :\n cnt=cnt+1;\n \nprint(cnt);', '#[s,t]=input().split();\ns=input();\nt=input();\ncnt = 0;\nfor i in range(len(s)):\n if s[i] != t[i] :\n cnt=cnt+1;\n \nprint(cnt);'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s470361772', 's844539536', 's907588140'] | [9236.0, 9160.0, 9424.0] | [26.0, 24.0, 64.0] | [109, 118, 140] |
p02622 | u617829104 | 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 = o\nfor i in len(S):\n if S[i] != T[i]:\n a += 1\nprint(a)\n ', 'S = input()\nT = input()\na = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n a += 1\nprint(a)'] | ['Runtime Error', 'Accepted'] | ['s730275069', 's345818272'] | [9276.0, 9512.0] | [25.0, 66.0] | [90, 92] |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.