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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02621 | u896791216 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['import sys\n\nn = sys.stdin.readlines()\nprint(n + n ** 2 + n ** 3)', 'a = int(input())\nprint(a + a**2 + a ** 3)'] | ['Runtime Error', 'Accepted'] | ['s200112356', 's054052915'] | [9064.0, 9088.0] | [26.0, 28.0] | [64, 41] |
p02621 | u898967808 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = input()\nprint(a + a**2 + a**3)', 'a = int(input())\nprint(a + a**2 + a**3)'] | ['Runtime Error', 'Accepted'] | ['s517907771', 's833552839'] | [9032.0, 8928.0] | [26.0, 28.0] | [34, 39] |
p02621 | u903005414 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['S = input()\nT = input()\n\ncnt = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n cnt += 1\nprint(cnt)\n', 'a = int(input())\nprint(a + a**2 + a**3)\n'] | ['Runtime Error', 'Accepted'] | ['s455838364', 's632697430'] | [8992.0, 9132.0] | [27.0, 31.0] | [106, 40] |
p02621 | u903082918 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['import sys\n\na = int(sys.stdin.readline())\n\nprint(a+a*a+a*a*a', 'import sys\n\na = int(sys.stdin.readline())\n\nprint(a+a*a+a*a*a)'] | ['Runtime Error', 'Accepted'] | ['s673556385', 's113009912'] | [8896.0, 9036.0] | [26.0, 30.0] | [60, 61] |
p02621 | u903629757 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = int,input()\nprint(a+(a**2)+(a**3))\n', 'a = (int,input())\nb = (int,sum(a+a**2+a**3))\nprint(b)\n', 'a = (int,input())\nprint(a + a^2 + a^3)\n', 'a = int,input()\nb = int,sum(a + a^2 + a^3)\nprint(b)', 'a = int,input()\nprint(a+(a*a)+(a*a*a))', "a = int,input()\nb = a+(a**2)+a**3\nprint('b=',b)", 'a = int,input()\nprint(a+a^2+a^3)', 'a = int,input()\nprint(a+a**2+a**3)', 'a = int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s180985013', 's224631428', 's351863211', 's531085127', 's590584597', 's612463825', 's699044060', 's740107550', 's913430305'] | [9076.0, 9012.0, 9016.0, 9076.0, 8952.0, 9020.0, 9080.0, 8948.0, 8980.0] | [21.0, 25.0, 26.0, 25.0, 22.0, 27.0, 28.0, 21.0, 37.0] | [39, 54, 39, 51, 38, 47, 32, 34, 35] |
p02621 | u910632349 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['\nusing namespace std;\n\nint main()\n{\n\tint a;\n\tcin >> a;\n\tcout << a * a + a + a * a * a <<endl;\n}', 'a=int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Accepted'] | ['s002763854', 's856966241'] | [8852.0, 9144.0] | [24.0, 29.0] | [114, 33] |
p02621 | u911531682 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['n, m, k = [int(_) for _ in input().split()]\na = [int(_) for _ in input().split()]\nb = [int(_) for _ in input().split()]\n\nmaxrecord = 0\n\nfor i in range(1, n + 1):\n left = k - sum(a[:i])\n if left < 0:\n counter = i - 1\n if maxrecord < counter:\n maxrecord = counter\n break\n counter = i\n\n for j in range(1, m + 1):\n if left - sum(b[:j]) < 0:\n if maxrecord < counter:\n maxrecord = counter\n break\n counter += 1\n\nprint(counter)\n', 'a = int(input())\nans = a + a ** 2 + a ** 3\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s345011827', 's334802260'] | [9072.0, 9168.0] | [32.0, 33.0] | [515, 53] |
p02621 | u911612592 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['n,m,k = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\ncount = 0\n\nfor x,y in zip(a,b):\n count += min(a[x],b[y])\n if count > k:\n break\n \nprint(k // count)\n', 'n,m,k = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\ncount = 0\n\nfor i in zip(a,b):\n count += min(a[i],b[i])\n if count > k:\n break\n \nprint(k // count)\n', 'a = input()\n\nprint(a + a ** 2 + a ** 3)', 'a = int(input())\n\nprint(a + a ** 2 + a ** 3)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s050447588', 's169376388', 's197939527', 's775563756'] | [8940.0, 9112.0, 9016.0, 9132.0] | [28.0, 26.0, 20.0, 30.0] | [211, 209, 39, 45] |
p02621 | u912867658 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['s= input()\nprint (s+s**2+s**3)', 's = int(input())\nprint(s+s**2+s**3)'] | ['Runtime Error', 'Accepted'] | ['s179074588', 's169244263'] | [9012.0, 9148.0] | [31.0, 27.0] | [30, 35] |
p02621 | u915764321 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a=int(input())\na+=(a*a)\na+=(a*a*a)\nprint(a)', 'a=int(input())\nans=a\nans+=(a*a)\nans+=(a*a*a)\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s036047832', 's133065706'] | [9136.0, 9116.0] | [28.0, 29.0] | [43, 55] |
p02621 | u917444023 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['import numpy as np\nn,m,k=map(int,input().split())\nA=[0]\nA.append(list(map(int, input().split())))\nB=[0]\nB.append(list(map(int, input().split())))\nans=0\na=np.cumsum(np.array(A))\nb=np.cumsum(np.array(B))\nfor i in range(n+1):\n if k<a[i]:\n break\n j=m\n while b[j]>k-a[i]:\n j-=1\n ans=max(ans,i+j)\nprint(ans)', 'a=int(input())\nprint(a+a*a+a*a*a)'] | ['Runtime Error', 'Accepted'] | ['s231842383', 's770243519'] | [27092.0, 9144.0] | [112.0, 25.0] | [331, 33] |
p02621 | u917642744 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['s=input()\nt=input()\nc=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n c+=1\nprint(c) ', 'a=int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Accepted'] | ['s514837687', 's260000268'] | [9028.0, 9016.0] | [25.0, 27.0] | [86, 33] |
p02621 | u922003189 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['# Python3 program to count \n# number of factors \n# of an array of integers \nMAX = 1000001; \n\n# array to store \n\nfactor = [0]*(MAX + 1); \n\n# function to generate all \nof numbers \n# from 1 to 10^6 \ndef generatePrimeFactors(): \n\tfactor[1] = 1; \n\n\t# Initializes all the \n\t# positions with their value. \n\tfor i in range(2,MAX): \n\t\tfactor[i] = i; \n\n\t# Initializes all \n\t# multiples of 2 with 2 \n\tfor i in range(4,MAX,2): \n\t\tfactor[i] = 2; \n\n\t# A modified version of \n\t# Sieve of Eratosthenes \n\t# to store the smallest \n\tthat divides \n\t# every number. \n\ti = 3; \n\twhile(i * i < MAX): \n\t\t# check if it has \n\t\t\n\t\tif (factor[i] == i): \n\t\t\t# Initializes of j \n\t\t\t# starting from i*i \n\t\t\tj = i * i; \n\t\t\twhile(j < MAX): \n\t\t\t\t# if it has no prime factor \n\t\t\t\t# before, then stores the \n\t\t\t\t\n\t\t\t\tif (factor[j] == j): \n\t\t\t\t\tfactor[j] = i; \n\t\t\t\tj += i; \n\t\ti+=1; \n\n# function to calculate \n# number of factors \ndef calculateNoOFactors(n): \n\tif (n == 1): \n\t\treturn 1; \n\tans = 1; \n\n\t# stores the smallest \n\t# prime number that \n\t# divides n \n\tdup = factor[n]; \n\n\t# stores the count of \n\t# number of times a \n\t\n\tc = 1; \n\n\t# reduces to the next \n\t\n\t# factorization of n \n\tj = int(n / factor[n]); \n\n\t# false when prime \n\t# factorization is done \n\twhile (j > 1): \n\t\t# if the same prime \n\t\t# number is dividing \n\t\t# n, then we increase \n\t\t# the count \n\t\tif (factor[j] == dup): \n\t\t\tc += 1; \n\n\t\t# if its a new prime factor \n\t\t# that is factorizing n, \n\t\t# then we again set c=1 and \n\t\t# change dup to the new prime \n\t\t# factor, and apply the formula \n\t\t# explained above. \n\t\telse: \n\t\t\tdup = factor[j]; \n\t\t\tans = ans * (c + 1); \n\t\t\tc = 1; \n\n\t\t\n\t\t# a number \n\t\tj = int(j / factor[j]); \n\n\t# for the last \n\t\n\tans = ans * (c + 1); \n\n\treturn ans; \n\n\n\nn=int(input())\n\ngeneratePrimeFactors()\nans=0\nfor i in range(1,n+1):\n ans+=calculateNoOFactors(i)*i\n \n\n\nprint(ans)\n \n\n', 'a=int(input())\nprint(a+a*a+a*a*a)\n'] | ['Wrong Answer', 'Accepted'] | ['s398261988', 's810592301'] | [48472.0, 9036.0] | [420.0, 27.0] | [2015, 34] |
p02621 | u923172145 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = input()\na = int(N)\n\nprint(a+a*a+a*a*a)', 'a = int(input())\nprint(a+a*a+a*a*a)'] | ['Runtime Error', 'Accepted'] | ['s460733649', 's045290757'] | [9020.0, 9080.0] | [22.0, 30.0] | [42, 35] |
p02621 | u926080943 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['n=input()\nprint(n+n**2+n**3)', 'n=int(input())\nprint(n+n**2+n**3)'] | ['Runtime Error', 'Accepted'] | ['s077133808', 's837279336'] | [9016.0, 9132.0] | [24.0, 24.0] | [28, 33] |
p02621 | u926266624 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = int(intput())\n\nprint(a + a*a + a*a*a)', 'a = int(input())\n\nprint(a + a*a + a*a*a)'] | ['Runtime Error', 'Accepted'] | ['s238024861', 's263338156'] | [9032.0, 9100.0] | [20.0, 29.0] | [41, 40] |
p02621 | u932868243 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a=int(input())\nprint(a+a＊＊2+a＊＊3)', 'a=int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Accepted'] | ['s477352895', 's068920245'] | [8908.0, 9140.0] | [24.0, 29.0] | [41, 33] |
p02621 | u935642171 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['n,m,k = map(int,input().split())\nA = [int(p) for p in input().split()]\nB = [int(p) for p in input().split()]\na,b = [0],[0]\n\na_apnd = a.append\nb_apnd = b.append\nfor i in range(n):\n a_apnd(a[i]+A[i])\nfor i in range(m):\n b_apnd(b[i]+B[i])\n\ncount = 0\nt = m\nfor i in range(n+1):\n if k<a[i]:\n break\n while b[t] > k-a[i]:\n t -= 1\n count = max(count,i+t)\n\nprint(count)\n', 'a = input()\nprint(a+(a**2)+(a**3))', 'a = int(input())\nprint(a+(a**2)+(a**3))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s560853846', 's881097325', 's006416329'] | [9196.0, 9084.0, 9100.0] | [22.0, 23.0, 29.0] | [372, 34, 39] |
p02621 | u936985471 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = input()\nprint(a + a ** 2 + a ** 3)', 'a = int(input())\nprint(a + a ** 2 + a ** 3)\n'] | ['Runtime Error', 'Accepted'] | ['s769965178', 's520275221'] | [8952.0, 9140.0] | [27.0, 30.0] | [38, 44] |
p02621 | u938480562 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['n=int(intput())\n\nprint(n+n**n+n***n)', 'n = int(input())\n\nprint(n + pow(n,2)+pow(n,3))'] | ['Runtime Error', 'Accepted'] | ['s619394751', 's827694998'] | [8960.0, 8976.0] | [22.0, 26.0] | [36, 46] |
p02621 | u938635664 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['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)\n', 'a = int(input())\nk = a + a**2 + a**3\nprint(k)'] | ['Runtime Error', 'Accepted'] | ['s570608514', 's893188448'] | [9012.0, 9084.0] | [24.0, 25.0] | [99, 45] |
p02621 | u940345550 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a=int(input())\nans=a+a**2+a**3\nprint("ans")', 'a=int(input())\nans=a+a**2+a**3\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s492160175', 's527218174'] | [9156.0, 9148.0] | [30.0, 32.0] | [43, 41] |
p02621 | u940452097 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['num = input()\nprint(num+num**2+num**3)', "ソースコード \n\nCopy\nCopy\ndef a172(a):\n \n return a + a**2 + a**3\n \ndef main():\n a = int(input())\n print(a172(a))\n \nif __name__ == '__main__':\n main()", 'num = int(input())\ntotal = num +num**2 +num**3\nprint(total)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s064232873', 's983740091', 's698398018'] | [9020.0, 9060.0, 9152.0] | [24.0, 19.0, 31.0] | [38, 166, 59] |
p02621 | u944302117 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['n = int(input())\n\nprint(n ** 6)', 'n = int(input())\nprint(n + n**2 + n**3)'] | ['Wrong Answer', 'Accepted'] | ['s974321009', 's560344035'] | [9036.0, 8932.0] | [25.0, 24.0] | [31, 39] |
p02621 | u944731949 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = int(input())\nsum = 0\nfor i in range(a):\n sum += a ** (i+1)\n if i == 2:\n break\nprint(int(sum))', 'a = int(input())\nsum = 0\nfor i in range(3):\n sum += a ** (i+1)\nprint(int(sum))'] | ['Wrong Answer', 'Accepted'] | ['s960372860', 's499896469'] | [8996.0, 8904.0] | [29.0, 36.0] | [110, 81] |
p02621 | u949327459 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = int(input())\n\nclass calculate:\n def __init__(self,a):\n self.check = a\n \n def get_ans(self,a):\n return a + a**2 + a**3\n\nvaluable = calculate(a)\n\n#Sprint(valuable.check)\n\nans = valuable.get_ans(10)\n\nprint(ans)', 'a = int(input())\n\nclass calculate:\n def __init__(self,a):\n self.check = a\n \n def get_ans(self,a):\n return a + a**2 + a**3\n\nvaluable = calculate(a)\n\n#Sprint(valuable.check)\n\nans = valuable.get_ans(a)\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s060200628', 's269590612'] | [9140.0, 9152.0] | [28.0, 23.0] | [234, 233] |
p02621 | u954170646 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['print(int(a+a^2+a^3))', 'a = int(input())\nprint(int(a + a**2 + a**3))'] | ['Runtime Error', 'Accepted'] | ['s821882589', 's061936512'] | [8876.0, 9088.0] | [28.0, 26.0] | [21, 44] |
p02621 | u954191567 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = input()\nprint(a + a * a + a * a * a)', 'a = int(input())\nprint(a + a * a + a * a * a)'] | ['Runtime Error', 'Accepted'] | ['s610716791', 's145514622'] | [8944.0, 9156.0] | [27.0, 26.0] | [40, 45] |
p02621 | u956318161 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['N,M,K = map(int,input().split())\t\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\na=[0]\nb=[0]\nfor i in range(N):\n a.append(a[-1]+A[i])\nfor j in range(M):\n b.append(b[-1]+B[j]) \nfor i in range(len(A)+1):\n for j in range(len(B)+1):\n score=a[i]+b[j]\n if score <= K:\n point=[]\n point.append(i+j)\nprint(max(point))\n', 'a=int(input())\nscore=a+a**2+a**3\nprint(score)'] | ['Runtime Error', 'Accepted'] | ['s395878253', 's871779360'] | [9156.0, 8992.0] | [23.0, 27.0] | [352, 45] |
p02621 | u956547804 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['n,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\ntime=0\ncount=0\nwhile time<k:\n if count==(n+m-1):\n count=n+m+1\n break\n elif count//2>=n or count//2>=m:\n count+=1\n continue\n elif count%2==0:\n time+=a[count//2]\n count+=1\n else:\n time+=b[count//2]\n count+=1\nprint(count-1)', 'n,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\ntime=0\ncount=0\nwhile time<k:\n if count==(n+m-1):\n count=n+m+1\n break\n elif count//2>=n or count//2>=m:\n count+=1\n continue\n elif count%2==0:\n time+=a[count//2]\n count+=1\n else:\n time+=b[count//2]\n count+=1\nprint(count-1)', 'n=int(input())\nprint(n+n**2+n**3)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s281734813', 's502209143', 's812830506'] | [9116.0, 9212.0, 9144.0] | [25.0, 28.0, 28.0] | [385, 385, 33] |
p02621 | u958053648 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a=int(input())\nprint(int(a+a**2*a**3))', 'a=int(input())\nprint(int(a+a**2+a**3))'] | ['Wrong Answer', 'Accepted'] | ['s978351874', 's693943916'] | [9088.0, 9144.0] | [31.0, 32.0] | [38, 38] |
p02621 | u979506439 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ["\ndef function(a):\n return a+a**2+a***3\n\nif __name__ == '__main__':\n a = int(input())\n function(a)", 'def function(a):\n return a + pow(a,2) + pow(a, 3)\n\nif __name__ == "__main__":\n a = int(input())\n print(function(a))'] | ['Runtime Error', 'Accepted'] | ['s409677149', 's132232556'] | [8892.0, 9156.0] | [24.0, 24.0] | [100, 124] |
p02621 | u981747421 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = input()\nprint(a+a*a+a*a*a)', 'a = input()\nprint(int(a+a**2+a**3))', 'a = int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s438324441', 's760201495', 's205887517'] | [9072.0, 9016.0, 9148.0] | [23.0, 21.0, 24.0] | [30, 35, 35] |
p02621 | u986506826 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['num v= input("")\nsum1 = num + num^2 + num^3', 'a = int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Accepted'] | ['s375331298', 's999071359'] | [8912.0, 9060.0] | [25.0, 31.0] | [43, 35] |
p02621 | u986749883 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = input()\n\nprint(a+pow(a,2)+pow(a,3))\n', '\na = int(input())\n\nprint(a+pow(a,2)+pow(a,3))\n\n\n\n\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s044717493', 's469480391'] | [8976.0, 9136.0] | [26.0, 29.0] | [40, 52] |
p02621 | u986942034 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['i = int(input())\nprint(i + i*2 + i*3)', 'i = input()\nprint(i + i*2 + i*3)', 'i = int(input())\nprint(i + i**2 + i**3)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s233005318', 's933791884', 's102323061'] | [9084.0, 9080.0, 9144.0] | [29.0, 29.0, 29.0] | [37, 32, 39] |
p02621 | u990605469 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a=int(input())\nprint(a+a^2+a^3)', 'a=int(input())\nprint(a + a*a + a*a*a)\n'] | ['Wrong Answer', 'Accepted'] | ['s367492756', 's688229853'] | [9156.0, 9144.0] | [36.0, 25.0] | [31, 38] |
p02621 | u993090205 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['from collections import deque\nfrom decimal import *\nn,m,k = [Decimal(int(e)) for e in input().split()]\nAs = deque([Decimal(int(e)) for e in input().split()])\nBs = deque([Decimal(int(e)) for e in input().split()])\nresult = 0\nwhile True:\n if (not As) and (not Bs):\n break\n \n if (not As) and (Bs[0]>k):\n break\n if (not As) and (Bs[0]<=k):\n k = k-Bs.popleft()\n result = result + 1\n continue\n \n if (not Bs) and (As[0]>k):\n break\n if (not Bs) and (As[0]<=k):\n k = k-As.popleft()\n result = result + 1\n continue\n \n \n if As[0]+As[1] <= Bs[0]+Bs[1]:\n min_reduce = As.popleft()\n else:\n min_reduce = Bs.popleft()\n\n if min_reduce > k:\n break\n else:\n k = k-min_reduce\n result = result + 1\nprint(result)', 'a = int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Accepted'] | ['s289719350', 's753034765'] | [9828.0, 9076.0] | [36.0, 29.0] | [833, 35] |
p02621 | u994935583 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = int(input)\nans = a + a*a + a*a*a\nprint(ans)', 'a = int(input())\nans = a + a*a + a*a*a\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s346361712', 's864763672'] | [8972.0, 9140.0] | [27.0, 26.0] | [47, 49] |
p02621 | u995163736 | 2,000 | 1,048,576 | Given an integer a as input, print the value a + a^2 + a^3. | ['a = int(input())\nprint(a+a**2+a***3)', 'a = int(input())\nprint(a+a**2+a**3)'] | ['Runtime Error', 'Accepted'] | ['s889572258', 's730018700'] | [8988.0, 9136.0] | [22.0, 26.0] | [36, 35] |
p02622 | u000842852 | 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\nCopy\nCopy\nS = input()\nT = input()\ncount = 0\nif S == T:\n print(0)\nelse:\n for i in range(len(S)):\n if S[i]!=T[i]:\n count += 1\n print(count)', 'S = input()\nT = input()\ncount = 0\nif S == T:\n print(0)\nelse:\n for i in range(len(S)):\n if S[i]!=T[i]:\n count += 1\n print(count)'] | ['Runtime Error', 'Accepted'] | ['s736677052', 's076718263'] | [9076.0, 9332.0] | [20.0, 60.0] | [169, 138] |
p02622 | u005318559 | 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()\nx = zip(s, t)\ny = []\nfor i, j in x:\n if i == j:\n y.append('')\n else:\n y.append('@')\nprint(y.count('@'))", 'a = input()\nb = input()\nu=zip(a,b)\nx=[]\nfor i,j in u: \n if i==j:\n x.append("") \n else: \n x.append("*")\nprint (x.count("*"))'] | ['Runtime Error', 'Accepted'] | ['s341421172', 's753029154'] | [9292.0, 10948.0] | [23.0, 61.0] | [146, 143] |
p02622 | u005469124 | 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())\nl = len(A)\nC = 0\nfor i in range(0, l):\n if A[i] != B[i]:\n C+=C + 1\nprint(C)\n', 'A = str(input())\nB = str(input())\nl = len(A)\nC = 0\nfor i in range(0, l):\n if A[i] != B[i]:\n C =C + 1\nprint(C)\n'] | ['Wrong Answer', 'Accepted'] | ['s935554943', 's318414711'] | [9520.0, 9348.0] | [1142.0, 64.0] | [120, 120] |
p02622 | u007074599 | 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\nkotae=0\nfor i in range(len(a)):\n if a[i]!=b[i]:\n kotae+=1', 'a=input()\nb=input()\n \nkotae=0\nfor i in range(len(a)):\n if a[i]!=b[i]:\n kotae+=1\n \nprint(kotae)'] | ['Wrong Answer', 'Accepted'] | ['s518439188', 's570568514'] | [9408.0, 9540.0] | [61.0, 63.0] | [88, 111] |
p02622 | u008323723 | 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(inut())\nc=0\n\nfor i in range(len(s)):\n if s[i]!=t[i]:\n c +=1\n\nprint(c)', 's,t = map(input().split())\nc=0\n\nfor i in range(len(s)):\n if s[i]!=t[i]:\n c +=1\n\nprint(c)', 's,t = map(input())\nc=0\n\nfor i in range(len(s)):\n if s[i]!=t[i]:\n c +=1\n\nprint(c)', 's = input()\nt =input()\nc=0\n\nfor i in range(len(s)):\n if s[i]!=t[i]:\n c +=1\n\nprint(c)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s145293374', 's355000303', 's864686603', 's556238003'] | [9084.0, 9292.0, 9008.0, 9488.0] | [31.0, 23.0, 22.0, 64.0] | [83, 92, 84, 88] |
p02622 | u010216603 | 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=o\nS=list(input())\nT=list(input())\nfor i in range(len(S)): \n\tif S[i]！=T[i]:\t\n\t\ta=a+1\nprint(a)', 'a=o\nS=list(input())\nT=list(input())\nfor i in range(len(S)): \n if S[i]！=T[i]:\t\n a=a+1\nprint(a)\n \n', 'a=o\nS=list(input())\nT=list(input())\nfor i in range(len(S)): \n\tif S[i]!=T[i]:\t\n\t\ta=a+1\nprint(a)', 'a=0\nS=list(input())\nT=list(input())\nfor i in range(len(S)): \n\tif S[i]!=T[i]:\t\n\t\ta=a+1\nprint(a)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s707793891', 's893504169', 's901424825', 's281667447'] | [9020.0, 8960.0, 8880.0, 12216.0] | [33.0, 27.0, 29.0, 75.0] | [96, 105, 94, 94] |
p02622 | u010555125 | 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\nx = len(s)\n\nnum = 0\nfor i in range(0, x):\n if s[i] == t[i]:\n num += 1\n\nprint(num)', 's = input()\nt = input()\n\nx = len(s)\n\nnum = 0\nfor i in range(0, x):\n if s[i] != t[i]:\n num += 1\n\nprint(num)'] | ['Wrong Answer', 'Accepted'] | ['s183967285', 's271709196'] | [9348.0, 9364.0] | [62.0, 59.0] | [116, 116] |
p02622 | u015647294 | 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. | ['L = map(str, input().split())\n\ns = L[0]\nS = list(s)\nt = L[1]\nT = list(t)\n\nN = len[S]\ni = 1\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1', 's,t = input(), input()\n\nS = list(s)\nT = list(t)\n\nN = len(s) - 1\ni = 0\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1\n\nprint(i + 1)', 'L = map(str, input().split())\n\ns = L[0]\nS = list(s)\nt = L[1]\nT = list(t)\n\nN = len[S]\ni = 1\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1', 'L = list(input().split())\n\ns = L[0]\nS = list(s)\nt = L[1]\nT = list(t)\n\nN = len[S]\ni = 1\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1', 'rows = int(input())\nL = [input() for i in range(rows)]\n\ns = L[0]\nS = list(s)\nt = L[1]\nT = list(t)\n\nN = len[S]\ni = 1\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1', 'L = map(str, input())\n\ns = L[0]\nS = list(s)\nt = L[1]\nT = list(t)\n\nN = len[S]\ni = 1\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1', 's = input()\nS = list(S)\nT = list(input())\nN = len(s)\ni = 1\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1', 'L = map(str, input().split())\n\ns = L[0]\nS = list(s)\nt = L[1]\nT = list(t)\n\nN = len[S] - 1\ni = 0\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1\n\nprint(i + 1)', 'L = map(str, input().split())\n\ns = L[0]\nS = list(s)\nt = L[1]\nT = list(t)\n\nN = len[S]\ni = 1\n\nwhile N != i:\n if S[i] != T[i]:\n S[i] = T[i]\n i += 1', 's,t = input(), input()\n\nS = list(s)\nT = list(t)\n\nN = len(s) - 1\ni = 0\ncounter = 0\n\nwhile N + 1 != i:\n if S[i] != T[i]:\n S[i] = T[i]\n counter += 1\n i += 1\n\nprint(counter)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s018018972', 's191371897', 's266998975', 's296036395', 's413427228', 's435393177', 's759284503', 's920744002', 's993302984', 's208885953'] | [9248.0, 12484.0, 9216.0, 10332.0, 9340.0, 9180.0, 9200.0, 9216.0, 9236.0, 12484.0] | [22.0, 82.0, 29.0, 31.0, 25.0, 25.0, 28.0, 24.0, 24.0, 100.0] | [157, 150, 161, 157, 186, 153, 129, 175, 157, 189] |
p02622 | u017267800 | 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. | ['a1 = input()\na2 = input()\nt = 0\n\nfor i in range(len(a1)):\n if a1[i] != a2[i]:\n a += 1\n \nprint(a)', 'a1 = input()\na2 = input()\nt = 0\n\nfor i in range(len(a1)):\n if a1[i] != a2[i]:\n t += 1\n \nprint(t)'] | ['Runtime Error', 'Accepted'] | ['s007859238', 's321751820'] | [9384.0, 9324.0] | [49.0, 64.0] | [103, 103] |
p02622 | u021387650 | 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\n\nif s == t:\n print(0)\n exit()\nelse:\n for i in range(len(s)):\n if s[i] != t[i]:\n cnt += 1\n\nprint(cnt)', 'S = input()\nT = input()\n\nans = 0\n\nfor s, t in zip(S, T):\n ans += s != t\nelse:\n\tprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s385633352', 's205436247'] | [9460.0, 9396.0] | [25.0, 55.0] | [143, 93] |
p02622 | u021915951 | 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 = list(input())\ns2 = list(input())\nans = 0\nfor i in range(s1):\n if s1[i] =! s2[i]:\n ans+=1\nprint(ans) ', 's1 = list(input())\ns2 = list(input())\nans = 0\nfor i in range(len(s1)):\n if s1[i] != s2[i]:\n ans+=1\nprint(ans) '] | ['Runtime Error', 'Accepted'] | ['s343355925', 's673587614'] | [9016.0, 12384.0] | [26.0, 73.0] | [112, 114] |
p02622 | u023229441 | 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,j in a,b:\n if i != j:\n ans+=1\nprint(ans)', 'a=input()\nb=input()\nans=0\nfor i,j in zip(a,b):\n if i != j:\n ans+=1\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s060814236', 's676181252'] | [9340.0, 9396.0] | [22.0, 59.0] | [76, 82] |
p02622 | u024343432 | 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,stdout\nLI=lambda:list(map(int,input().split()))\nMAP=lambda:map(int,input().split())\nIN=lambda:int(input())\nS=lambda:input()\nimport math\ndef p(a):print(" ".join(list(map(str,a))))\nfrom collections import Counter\n\ns=S()\nt=t()\nx=0\nfor i in range(len(s)):\n if s[i]!=t[i]:x+=1\nprint(x)', 'from sys import stdin,stdout\nLI=lambda:list(map(int,input().split()))\nMAP=lambda:map(int,input().split())\nIN=lambda:int(input())\nS=lambda:input()\nimport math\ndef p(a):print(" ".join(list(map(str,a))))\nfrom collections import Counter\n\ns=S()\nt=S()\nx=0\nfor i in range(len(s)):\n if s[i]!=t[i]:x+=1\nprint(x)\n'] | ['Runtime Error', 'Accepted'] | ['s932692302', 's775513075'] | [9572.0, 9720.0] | [31.0, 72.0] | [305, 306] |
p02622 | u031679985 | 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)\na=0\nfor i in range(l-1):\n if s[i]==t[i]:\n pass\n else:\n a+=1\n\nprint(a)\n\n', 's=input()\nt=input()\n\nl=len(s)\na=0\nfor i in range(l):\n if s[i]==t[i]:\n pass\n else:\n a+=1\n\nprint(a)\n'] | ['Wrong Answer', 'Accepted'] | ['s456514948', 's280783304'] | [9336.0, 9404.0] | [61.0, 66.0] | [121, 118] |
p02622 | u040298438 | 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. | ['count = 0\na = input()\nb = input()\n\nfor i in len(a):\n if a[i]!=b[i]:\n count += 1\n\nprint(count)', 'count = 0\na = input()\nb = input()\n\nfor i in range(len(a)):\n if a[i]!=b[i]:\n count += 1\n\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s253786107', 's942812333'] | [9320.0, 9392.0] | [26.0, 62.0] | [103, 110] |
p02622 | u043022222 | 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\n\nfor i in range(len(S)):\n if S[i] != T[i]\n\tcount += 1\n\nprint(count)', 'S = list(input())\nT = list(input())\ncount = 0\n\nfor i in range(len(S)):\n if S[i] != T[i]:\n\tcount += 1\n\nprint(count)\n', 'S = list(input())\nT = list(input())\ncount = 0\n\nfor i in range(len(S)):\n if S[i] != T[i]:\n count += 1\n\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s189664690', 's669628024', 's300906865'] | [8824.0, 8980.0, 12364.0] | [24.0, 23.0, 66.0] | [114, 116, 118] |
p02622 | u046187684 | 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 solve(string):\n s, t = string.split()\n return str(len(s) - sum(_s == _t for _s, _t in zip(s, t)) pass\n\n\nif __name__ == '__main__':\n import sys\n print(solve(sys.stdin.read().strip()))\n", "def solve(string):\n s, t = string.split()\n return str(len(s) - sum(_s == _t for _s, _t in zip(s, t)))\n\n\nif __name__ == '__main__':\n import sys\n print(solve(sys.stdin.read().strip()))"] | ['Runtime Error', 'Accepted'] | ['s491767817', 's279166278'] | [8960.0, 9480.0] | [24.0, 45.0] | [261, 194] |
p02622 | u046826851 | 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 = input()\nline2 = input()\nans = 0\nfor i in range(len(line1)):\n if line1[i] == line2[i]:\n ans += 1\nprint(ans)', 'line1 = input()\nline2 = input()\nans = 0\nfor i in range(len(line1)):\n if line1[i] != line2[i]:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s580664163', 's980360520'] | [9356.0, 9352.0] | [58.0, 60.0] | [118, 119] |
p02622 | u047679381 | 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=intput()\nss=intput()\nfor i range(len(s)):\n if(s[i]!=ss[i]):\n c+=1\nprint(c)', 's=input()\nss=input()\nc=0\nfor i in range(len(ss)):\n if(s[i]!=s[i]):\n c+=1\nprint(c)', 's=intput()\nss=intput()\nc=0\nfor i in range(len(s)):\n if(s[i]!=ss[i]):\n c+=1\nprint(c)', 'n=input()\nnn=input()\nc=0\nfor i in range(len(n)):\n if(n[i]!=nn[i]):\n c+=1\nprint(c)\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s256770055', 's731832636', 's958858843', 's767917829'] | [8904.0, 9328.0, 9052.0, 9492.0] | [28.0, 54.0, 24.0, 64.0] | [80, 85, 87, 92] |
p02622 | u048013400 | 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\nj=0\n\nfor i in range(len(S)):\n if s[i] == t[i]:\n j = j+0\n else:\n index = t.index(s[i])\n t[i],t[index] = t[index],t[i]\n j = j+1\n\nprint(j)\nprint(s,t)', 'S = input()\nT = input()\n\ns = list(S[:])\nt = list(T[:])\n\nj=0\n\nfor i in range(len(S)):\n if s[i] == t[i]:\n j = j+0\n else:\n t[i]=s[i]\n j=j+1\n\nprint(j)\n'] | ['Wrong Answer', 'Accepted'] | ['s124918123', 's024933026'] | [14336.0, 12432.0] | [439.0, 87.0] | [236, 174] |
p02622 | u048844044 | 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 = 0\nfor i in s:\n for j in t:\n if i != j:\n i = j\n n += 1\nreturn 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)'] | ['Runtime Error', 'Accepted'] | ['s867705592', 's811318333'] | [8964.0, 9256.0] | [28.0, 65.0] | [104, 104] |
p02622 | u059631536 | 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\nanswer=0\ni=0\nwhile i<len(a):\n if a[i]!=b[i]:\n answer = answer+ 1\n i =i+1\n\nprint(answer)', 'a=input()\nb=input()\n\nanswer=0\ni=0\nwhile i<len(a):\n if a[i]!=b[i]:\n answer = answer+ 1\n i =i+1\n\nprint(answer)'] | ['Time Limit Exceeded', 'Accepted'] | ['s346499771', 's990462657'] | [9440.0, 9400.0] | [2206.0, 89.0] | [110, 109] |
p02622 | u063232468 | 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())\nfor i, _s in enumerate(s):\n if s == t:\n break\n else:\n if _s != t[i]:\n s[i] = t[i]\n else:\n continue\n\nprint(i)', 's=list(input())\nt=list(input())\nans = 0\nfor i, _s in enumerate(s):\n if s[i] != t[i]:\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s708428844', 's187889963'] | [12576.0, 12444.0] | [2206.0, 72.0] | [189, 113] |
p02622 | u063346608 | 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\tprint(S[i])', 'S = input()\nT = input()\n\ncout = 0\nfor i in range(len(S)):\n\tif S[i] != T[i]:\n\t\tcount = count + 1\n\nprint(count)', 'S = input()\nT = input()\n\ncount = 0\nfor i in range(len(S)):\n\tif S[i] != T[i]:\n\t\tcount = count + 1\nprint(count)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s675843195', 's793916821', 's839855926'] | [9264.0, 9316.0, 9316.0] | [85.0, 50.0, 64.0] | [61, 109, 109] |
p02622 | u072409340 | 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\nfor i in range(len(S)):\n if S[i] != T[i]:\n C += 1\n \nprint(c)', 's=input()\nt=input()\nans=0\nfor i in range(len(s)):\n ans+=(s[i]!=t[i])\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s092701182', 's718802786'] | [9344.0, 9380.0] | [49.0, 62.0] | [98, 83] |
p02622 | u073800107 | 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. | ['str1 = input()\nstr2 = input()\n\ni = 0\nfor _ in str1:\n if _ not in str2:\n i += 1\nprint(i)', 'str1 = input()\nstr2 = input()\n\nidx = 0\ncnt = 0\nfor _ in range(len(str1)):\n if str1[idx] != str2[idx]:\n cnt += 1\n idx += 1\n\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s943692043', 's382265823'] | [9268.0, 9384.0] | [44.0, 76.0] | [91, 146] |
p02622 | u075317232 | 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 MinorChange():\n\n str1 = str(input())\n str2 = str(input())\n\n data = []\n\n for num in range(len(str1)):\n if str1[num] != str2[num]:\n data.append(str1[num])\n\n print(len(list(set(data))))\n\nif __name__ == '__main__':\n MinorChange()", "def MinorChange():\n\n str1 = str(input())\n str2 = str(input())\n\n data = []\n\n for num in range(len(str1)):\n if str1[num] != str2[num]:\n data.append(str2[num])\n\n print(len(list(set(data))))\n\nif __name__ == '__main__':\n MinorChange()", "def MinorChange():\n\n str1 = str(input())\n str2 = str(input())\n\n data = []\n\n for num in range(len(str1)):\n if str1[num] != str2[num]:\n data.append(str1[num])\n\n print(list(set(data)))\n\nif __name__ == '__main__':\n MinorChange()", "def MinorChange():\n\n str1 = str(input())\n str2 = str(input())\n\n data = []\n\n for num in range(len(str1)):\n if str1[num] != str2[num]:\n data.append(str2[num])\n\n print(len(data))\n\nif __name__ == '__main__':\n MinorChange()"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s662030330', 's921491546', 's954782001', 's127907784'] | [10960.0, 10964.0, 11036.0, 10896.0] | [56.0, 59.0, 58.0, 59.0] | [265, 265, 260, 254] |
p02622 | u079182025 | 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\ni = 0\nwhile i < len(s):\n\tif s[i] == t[i]:\n\t\tans += 1\n\nprint(ans)', 's = input()\nt = input()\n\nans = 0\ni = 0\nwhile i < len(s):\n\tif s[i] == t[i]:\n\t\tans += 1\n\ti += 1\n\nprint(ans)', 's = input()\nt = input()\n\nans = 0\ni = 0\nwhile i < len(s):\n\tif s[i] != t[i]:\n\t\tans += 1\n\ti += 1\n\nprint(ans)'] | ['Time Limit Exceeded', 'Wrong Answer', 'Accepted'] | ['s641734231', 's781225253', 's783246838'] | [9516.0, 9392.0, 9488.0] | [2206.0, 87.0, 88.0] | [97, 105, 105] |
p02622 | u081365646 | 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()\nnum = 0\nfor s,t in zip(S,T):\n if s != t:\n num +=1\n', 'S = input()\nT = input()\nnum = 0\nfor s,t in zip(S,T):\n if s != t:\n num +=1\nprint(num)'] | ['Wrong Answer', 'Accepted'] | ['s553040787', 's988224169'] | [9400.0, 9400.0] | [59.0, 62.0] | [84, 94] |
p02622 | u082861480 | 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 ans += 1 if s[i] == t[i] else 0\nprint(ans)', 's = input()\nt = input()\nans = 0\nfor i in range(len(s)):\n ans += 1 if s[i] != t[i] else 0\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s793689419', 's601279732'] | [9312.0, 9384.0] | [63.0, 61.0] | [100, 100] |
p02622 | u087118202 | 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=string(input())\nT=string(input())\nnum = 0\nfor i in len(S):\n if S[i] != T[i]:\n num= num+1\nprint(num)', 'S=string(input())\nT=string(input())\nnum = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n num= num+1\nprint(num)', 'a=list(input())\nb=list(input())\ncount=0\nfor str_i in range (len(a)):\n if a[str_i] != b[str_i]:\n count+=1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s334636110', 's822209359', 's633495462'] | [9100.0, 9024.0, 12300.0] | [23.0, 29.0, 66.0] | [105, 118, 121] |
p02622 | u089925107 | 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 i in range(length(S)):\n if S[i] != T[i]:\n aa += 1\nprint(aa)\n \n', 'S = input()\nT = input()\naa = 0\nfor i in range(len(S)):\n if S[i] != T[i]:\n aa += 1\nprint(aa)'] | ['Runtime Error', 'Accepted'] | ['s299620123', 's151708494'] | [9316.0, 9388.0] | [28.0, 66.0] | [102, 95] |
p02622 | u093041722 | 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\tif S[i] == T[i]:\n\t\tans += 1\nprint(ans)', 'S = input()\nT = input()\nans = 0\nfor i in range(len(S)):\n\tif S[i] != T[i]:\n\t\tans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s382136943', 's746813541'] | [9344.0, 9356.0] | [60.0, 64.0] | [95, 95] |
p02622 | u093466556 | 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(0,len(S)):\n if S[i] != T[i]:\n count=count+1\n', 'S =input()\nT = input()\ncount = 0\nfor i in range(0,len(S)):\n if S[i] != T[i]:\n count=count+1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s579669601', 's076779682'] | [9300.0, 9416.0] | [59.0, 65.0] | [102, 114] |
p02622 | u095844416 | 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 i,e in zip(s,t):\n print(i,e)\n if i != e:\n cnt+=1\nprint(cnt)', 's=list(input())\nt=list(input())\ncnt=0\nfor i,e in zip(s,t):\n if i != e:\n cnt+=1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s945137799', 's459078607'] | [12552.0, 12568.0] | [149.0, 66.0] | [106, 93] |
p02622 | u100082504 | 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())\nn = 0\n\nfor i in len(S):\n if S[i] != T[i]:\n n += 1\n\nprint(n)', 'S = str(input())\nT = str(input())\nn = 0\n\nfor i in range(len(S)):\n if S[i] != T[i]:\n n += 1\n \nprint(n)'] | ['Runtime Error', 'Accepted'] | ['s951414048', 's360818994'] | [9316.0, 9424.0] | [22.0, 62.0] | [97, 108] |
p02622 | u105608888 | 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. | ['Answer = input()\ninput_retu = input()\ncount = 0\nfor i in range(len(Answer)):\n if Answer[i] == input_retu[i]:\n continue\n else:\n count += 1', 'Answer = input()\ninput_retu = input()\ncount = 0\nfor i in range(len(Answer)):\n if Answer[i] == input_retu[i]:\n continue\n else:\n count += 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s725164003', 's901537487'] | [9444.0, 9408.0] | [63.0, 62.0] | [157, 170] |
p02622 | u106778233 | 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();t=input();\ncnt=0\nfor i in range(len(s)):\n if s[i]==t[i]:\n cnt+=1\n \n \nprint(cnt)', 's=input();t=input();\ncnt=len(s)\nfor i in range(len(s)):\n if s[i]==t[i]:\n cnt-=1\n \n \nprint(cnt)\n'] | ['Wrong Answer', 'Accepted'] | ['s221163371', 's557380294'] | [9352.0, 9492.0] | [56.0, 56.0] | [99, 105] |
p02622 | u122495382 | 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()\ncount = 0\n\nfor i in range(s):\n if s[i] != t[0]:\n count += 1\n \n print(count)', 's = input()\nt = input()\n \ncount = 0\n \nfor i in range(s):\n if s[i] != t[i]:\n count += 1\n \n print(count)', 's = input()\nt = input()\n\ncount = 0\n \nfor i in range(s):\n if s[i] != t[0]:\n count += 1\n \n print(count)', 's = list(input())\nt = list(input())\ncount = 0\n\nfor i in range(len(s)):\n if s[i] != t[i]:\n count += 1\n\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s149522876', 's266178002', 's817750292', 's981772591'] | [9032.0, 8748.0, 8968.0, 12568.0] | [24.0, 27.0, 26.0, 66.0] | [105, 109, 108, 118] |
p02622 | u125348436 | 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. | ['cnt=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', 'Accepted'] | ['s353839763', 's974039870'] | [9024.0, 9336.0] | [32.0, 66.0] | [74, 94] |
p02622 | u126977215 | 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()\nx = len(s)\nz = 0\nfor i in range(x) :\n if s[i] == t[i] :\n z = z + 1\nprint(z)', 's = input()\nt = input()\nx = len(s)\nz = 0\nfor i in range(x) :\n if s[i] != t[i] :\n z = z + 1\nprint(z)'] | ['Wrong Answer', 'Accepted'] | ['s316301703', 's865578628'] | [9352.0, 9348.0] | [62.0, 65.0] | [103, 103] |
p02622 | u127025777 | 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(map(str,input().split()))\nb = list(map(str,input().split()))\ncount = 0\nfor i in range(0,len(a)) :\n if a[i] != b[i] :\n count = count + 1\n\nprint(count)', 'a = str(input())\nb = str(input())\ncount = 0\nfor i in range(0,len(a)) :\n if a[i] != b[i] :\n count = count + 1\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s899483391', 's860323855'] | [9364.0, 9272.0] | [30.0, 62.0] | [162, 126] |
p02622 | u127288756 | 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(s):\n if s[i]!=t[i]:\n count+=1\n\nprint(count)', 's=input()\nt=input()\n\nc=0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n c+=1\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s629393681', 's525074235'] | [9132.0, 9428.0] | [28.0, 61.0] | [91, 89] |
p02622 | u136869985 | 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([s != t for s, t in zip(input().split())]))', 'print(sum([s != t for s, t in zip(input(), input())]))\n'] | ['Runtime Error', 'Accepted'] | ['s852087253', 's598828482'] | [9200.0, 11016.0] | [29.0, 46.0] | [53, 55] |
p02622 | u149551680 | 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()\n\ncount = 0\nfor s in S:\n for t in T:\n if s != t: count += 1\nprint(count)', 'S = input().strip()\nT = input().strip()\n \nc = 0\n \nfor s,t in zip(S,T):\n if s != t:\n c += 1\nprint(c)'] | ['Wrong Answer', 'Accepted'] | ['s330377753', 's030779749'] | [9412.0, 9476.0] | [2205.0, 59.0] | [115, 103] |
p02622 | u157876329 | 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. | ['=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(len(S)):\n if S[i] != T[i]:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s828414863', 's568023960'] | [9020.0, 9540.0] | [25.0, 65.0] | [100, 101] |
p02622 | u159273602 | 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. | ['m=input()\nn=input()\ncount=0;\nfor i in range(len(m))\n if m[i]!=n[i] :\n count+=1\nprint(count)', 'm=input()\nn=input()\ncount=0;\nfor i in range(len(m))\n if m!=n :\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)', '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', 'Runtime Error', 'Accepted'] | ['s229114657', 's358576317', 's907506581', 's748639644'] | [9012.0, 8948.0, 8944.0, 9344.0] | [29.0, 24.0, 27.0, 64.0] | [102, 96, 106, 103] |
p02622 | u159369286 | 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)\ns.split()\nt.split()\nans = 0\nfor i in range(n):\n if s[i] != t[i]:\n s[i] = t[i]\n else:\n pass\nprint(ans)', '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)'] | ['Runtime Error', 'Accepted'] | ['s331869405', 's582573178'] | [9292.0, 9444.0] | [56.0, 63.0] | [156, 110] |
p02622 | u163543660 | 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\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) '] | ['Wrong Answer', 'Accepted'] | ['s520507043', 's269889488'] | [9320.0, 9312.0] | [58.0, 62.0] | [96, 97] |
p02622 | u165114979 | 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()\na = [str(c) for c in s]\nt = input()\nb = [str(c) for c in s]\n\nc = 0\n\nfor i in range(n):\n if a[i] == b[i]:\n c +=1\n\nprint(n-c)', 's = input()\na = [str(c) for c in s]\nt = input()\nb = [str(c) for c in t]\n\nc = 0\nn = len(a)\nfor i in range(n):\n if a[i] == b[i]:\n c +=1\n\nprint(n-c)\n'] | ['Runtime Error', 'Accepted'] | ['s910134441', 's262202174'] | [12512.0, 12356.0] | [65.0, 95.0] | [139, 150] |
p02622 | u186313164 | 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()\nst = list(s)\nts = list(t)\nj = 0\nfor i in range(len(st)):\n if(st[i] == ts[i]):\n j = 0\n elif(st[i] != ts[i]):\n ts[i] = st[i]\n j = j + 1\n\n# print(st)\n# print(ts)\nprint(j)', 's = input()\nt = input()\nst = list(s)\nts = list(t)\nj = 0\nfor i in range(len(st)):\n if(st[i] == ts[i]):\n j = j\n elif(st[i] != ts[i]):\n ts[i] = st[i]\n j = j + 1\n\n# print(st)\n# print(ts)\nprint(j)'] | ['Wrong Answer', 'Accepted'] | ['s735865754', 's899813794'] | [12452.0, 12352.0] | [102.0, 103.0] | [218, 218] |
p02622 | u187883751 | 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())\nfor m in range(len(m)):\n if m >= 2*10**5:\n break\n elif s != t:\n print(s[m])\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'] | ['s372505730', 's802408945'] | [12464.0, 9480.0] | [36.0, 62.0] | [128, 105] |
p02622 | u190564874 | 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\nstr_s = input()\nstr_t = input()\nstr_len = len(str_s)\nstr_match_cnt = 0\n\nst_converter = lambda s,t : s == t\n\nfor i in range(str_len):\n if st_converter(str_s[i], str_t[i]):\n str_match_cnt += 1\n\nprint(str_match_cnt) ', '# coding: utf-8\n\nstr_s = input()\nstr_t = input()\nstr_len = len(str_s)\nstr_match_cnt = 0\n\nst_converter = lambda s,t : s == t\n\nfor i in range(str_len):\n if not st_converter(str_s[i], str_t[i]):\n str_match_cnt += 1\n\nprint(str_match_cnt) '] | ['Wrong Answer', 'Accepted'] | ['s059288595', 's830751271'] | [9360.0, 9504.0] | [69.0, 76.0] | [243, 247] |
p02622 | u190703272 | 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\nd = 0\n\nfor i in a:\n if b[c] == i:\n d = d+1\n c=c+1\n else:\n c=c+1\n\nprint(d)', 'a = input()\nb = input()\nc = 0\nd = 0\n\nfor i in a:\n if b[c] != i:\n d = d+1\n c=c+1\n else:\n c=c+1\n\nprint(d)'] | ['Wrong Answer', 'Accepted'] | ['s082397263', 's273182673'] | [9344.0, 9472.0] | [56.0, 69.0] | [130, 130] |
p02622 | u193771328 | 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(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(len(s)):\n if s[i] != t[i]:\n count +=1 \n \nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s293043185', 's750528272'] | [9272.0, 9532.0] | [60.0, 65.0] | [116, 121] |
p02622 | u194472175 | 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. | ['#include<stdio.h>\n#include<math.h>\nint count;\nint main(){\n char S[200005],T[200005];\n scanf("%c",S);\n scanf("%c",T);\n for (int i=0;S[i]!=\'\\0\';i++){\n if (S[i]!=T[i])\n count++;\n }\n printf("%d\\n",count);\n}\n', 'S=input()\nT=input()\ncount=0\nfor i in range(len(S)):\n if S[i]!=T[i]:\n T[i]=S[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 T[i]=S[i]\n count +=1\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'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s172812867', 's218518376', 's879085327', 's647064694'] | [8856.0, 9384.0, 9408.0, 9352.0] | [26.0, 51.0, 50.0, 61.0] | [215, 109, 101, 96] |
p02622 | u197833153 | 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()\nnum = 0\n\nfor i in range(len(T)):\n if (S[i] != T[i]):\n S[i] == T[i]\n num += 1\n\nprint(num)', 'S = input()\nT = input()\nnum = 0\n\nfor i in range(len(T)):\n if (S[i] != T[i]):\n num += 1\n\nprint(num)\n'] | ['Wrong Answer', 'Accepted'] | ['s334661468', 's631719379'] | [9336.0, 9344.0] | [77.0, 63.0] | [117, 102] |
p02622 | u199899407 | 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. | ['ans=0\nx,y=input().split()\nfor i in range(len(x)):\n if x[i] != y[i]:\n ans=ans+1\nprint(ans)', 'ans=0\nx=input()\ny=input()\nfor i in range(len(x)):\n if x[i] != y[i]:\n ans=ans+1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s372687101', 's474470448'] | [9300.0, 9280.0] | [30.0, 64.0] | [93, 93] |
p02622 | u202145645 | 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\nwords_a = list(a)\nwords_b = list(b)\n\nmatched_list = []\nfor a in words_a:\n for b in words_b:\n if a==b:\n matched_list.append(a)\n\nprint(len(matched_list))', '# a = input()\n# b = input()\n\n\n\n\n# matched_list = []\n# for a in words_a:\n# for b in words_b:\n# if a!=b:\n# matched_list.append(a)\n\n# print(len(matched_list))\n\na = [input() for i in range(2)]\ni = 0\ncount = 0\n\nwhile i<len(a[0]):\n if a[0][i]!=a[1][i]:\n count+=1\n i+=1\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s865906021', 's821667233'] | [25020.0, 9380.0] | [2206.0, 91.0] | [235, 383] |
p02622 | u211706121 | 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\nans=0\nfor a,b in zip(A,B):\n if a==b:\n ans+=1\nprint(ans)', 'A=input()\nB=input()\n\nans=0\nfor a,b in zip(A,B):\n if a!=b:\n ans+=1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s355253802', 's958655858'] | [9276.0, 9328.0] | [53.0, 55.0] | [86, 87] |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.