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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02777 | u620846115 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = map(str,input().split())\na,b = map(int,input().split())\nu = int(input())\nif s == u:\n print(a-1,b)\nelse:\n print(a,b-1)', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\nif s == u:\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Runtime Error', 'Accepted'] | ['s675993152', 's081150595'] | [9168.0, 9172.0] | [26.0, 31.0] | [125, 125] |
p02777 | u621998662 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['from sys import stdin\nlines = stdin.readlines()\n \nS, T = map(str, lines[0].split())\nA, B = map(int, lines[1].split())\nU = lines[2]\n\nif S == U :\n a = A - 1\n b = B\nelse :\n a = A\n b = B - 1\n\nprint(a, b)', 'S, T = input().split()\nA, B = map(int,input().split())\nU = input()\n\nif S == U :\n a = A - 1\n b = B\nelse :\n a = A\n b = B - 1\n\nprint(a, b)'] | ['Wrong Answer', 'Accepted'] | ['s334806604', 's700684621'] | [3060.0, 2940.0] | [17.0, 17.0] | [203, 139] |
p02777 | u625729943 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input.split()\na, b = map(int, input.split())\ns = input()\nif s == S:\n print(a-1, b)\nelse:\n print(a, b-1)\n', 'import sys, math\ndef input():\n return sys.stdin.readline()[:-1]\nfrom itertools import permutations, combinations\nfrom collections import defaultdict, Counter\nfrom math import factorial\n\nsys.setrecursionlimit(10**7)\nS, T = input().split()\nA, B = map(int, input().split())\ns = input()\n\nif s == S:\n print(A-1, B)\nelse:\n print(A, B-1)\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s222015971', 's352187424'] | [2940.0, 3316.0] | [17.0, 20.0] | [113, 342] |
p02777 | u627213696 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T=map(str,input().split())\nA,B=map(int,input().split())\nU=str(input())\nprint(A-1 if S==U else B-1)', 'S,T=map(str,input().split())\nA,B=map(int,input().split())\nU=str(input())\nif S==U:\n print(A-1,B)\nif T==U:\n print(A,B-1)'] | ['Wrong Answer', 'Accepted'] | ['s034473216', 's010814990'] | [2940.0, 2940.0] | [17.0, 17.0] | [100, 124] |
p02777 | u630027862 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["N = int(input())\nA = list(map(int, input().split()))\ncounter = 0\nfor val in range(N - 1):\n for i in range(N - val - 1):\n if A[val] == A[val+i+1]:\n counter += 1\n break\n else:\n continue\n break\nif counter == 0:\n print('YES')\nelse:\n print('NO')", "N = int(input())\nA = list(map(int, input().split()))\ncounter = 0\nfor val in range(N - 1):\n for i in range(N - val - 1):\n if A[val] == A[val+i+1]:\n counter += 1\n else:\n break\nif counter == 0:\n print('YES')\nelse:\n print('NO')", "N = int(input())\nA = list(map(int, input().split()))\ncounter = 0\nfor val in range(N - 1):\n for i in range(N - val - 1):\n if A[val] == A[val+i+1]:\n counter += 1\n else:\n continue\nif counter == 0:\n print('YES')\nelse:\n print('NO')", 'S, T = input().split()\nA, B = map(int, input().split())\nU = input()\n\nif U == S:\n print(A - 1, B)\nelse:\n print(A, B - 1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s056798599', 's427010371', 's458402327', 's065953104'] | [3060.0, 3060.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0, 18.0] | [291, 269, 271, 125] |
p02777 | u631907675 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['c = input().split()\nn = input().split()\nidx = c.index(input())\nn[idx] -= 1\nprint("".join(n), end="\\n")', 'c = input().split()\nn = [int(c) for c in input().split()]\nidx = c.index(input())\nn[idx] -= 1\nprint(" ".join([str(c) for c in n]), end="\\n")'] | ['Runtime Error', 'Accepted'] | ['s786324786', 's592472284'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 139] |
p02777 | u634046173 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = input().split()\na, b = map(int, input().split())\nu = input()\n\nif s = u :\n a -= 1\nelse:\n b -= 1\nprint(a, b)\n', 's, t = input().split()\na, b = map(int, input().split())\nu = input()\n\nif s == u :\n a -= 1\nelse:\n b -= 1\nprint(a, b)\n'] | ['Runtime Error', 'Accepted'] | ['s566661017', 's355238486'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 117] |
p02777 | u642418876 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T=map(int,input().split())\nA,B=map(int,input().split())\nU=input()\nif U=S:\n print("{} {}".format(A-1,B))\nif U=T:\n print("{} {}".format(A,B-1))\n ', 'S,T=map(str,input().split())\nA,B=map(int,input().split())\nU=str(input())\nif U==S:\n print(A-1,B)\nelse:\n print(A,B-1)\n '] | ['Runtime Error', 'Accepted'] | ['s872150242', 's793113318'] | [2940.0, 2940.0] | [17.0, 17.0] | [148, 120] |
p02777 | u644546699 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['def resolve():\n S, T = input().split()\n A, B = map(int, input().split())\n U = input()\n \n print(U)\n\n if S == U:\n A -= 1\n else:\n B -= 1\n \n print(str(A) + " " + str(B))\n \nif __name__ == "__main__":\n resolve()', 'def resolve():\n S, T = input().split()\n A, B = map(int, input().split())\n U = input().split()\n \n if S == U:\n A -= 1\n else:\n B -= 1\n \n print(str(A) + " " + str(B))\n \nif __name__ == "__main__":\n resolve()', 'def resolve():\n S, T = input().split()\n A, B = map(int, input().split())\n U = input().split()\n \n if S == U:\n A -= 1\n else:\n B -= 1\n \n print(A + " " + B)\n \nif __name__ == "__main__":\n resolve()', 'def resolve():\n S, T = input().split()\n A, B = map(int, input().split())\n U = input().split()\n \n if S == U:\n A = A - 1\n else:\n B = B - 1\n \n print(A, B)\n \nif __name__ == "__main__":\n resolve()', 'def resolve():\n S, T = input().split()\n A, B = map(int, input().split())\n U = input()\n\n if S == U:\n A -= 1\n else:\n B -= 1\n \n print(str(A) + " " + str(B))\n \nif __name__ == "__main__":\n resolve()'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s036363835', 's373845147', 's686483604', 's898841666', 's257750773'] | [3060.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [243, 237, 227, 226, 228] |
p02777 | u645581835 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['red = int(input())\nblue = int(input())\nans = input()\nif ans=="blue":\n blue--\nelse:\n red--\n', 'red = int(input())\nblue = int(input())\nans = input()\nif ans=="blue":\n blue--\nelse:\n red--\nprint(red)\nprint(blue)', 'S, T = input().split()\nA, B = map(int, input().split())\nU = input()\nif U == S: A -= 1\nelse: B -= 1\nprint(A, B)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s457709166', 's977400657', 's544177939'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [92, 114, 113] |
p02777 | u647102103 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t=input().split()\na,b=map(int,input().split())\nu=input()\nif u = s:\n a -=1\nelse:\n b -=1\nprint(a,b)', 's,t=input().split()\na,b=map(int,input().split())\nu=input()\nif u == s:\n a -=1\nelse:\n b -=1\nprint(a,b)'] | ['Runtime Error', 'Accepted'] | ['s249167824', 's386529530'] | [2940.0, 2940.0] | [17.0, 17.0] | [101, 102] |
p02777 | u652569315 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["s,t=input().split()\na,b=map(int,input().split())\nu=input()\nif u==s:\n print(str(a-1)+ ''+str(b))\nelse:\n print(str(a)+ ''+str(b-1)) ", "s,t=input().split()\na,b=map(int,input().split())\nu=input()\nif u==s:\n print(str(a-1)+ '\u3000'+str(b))\nelse:\n print(str(a)+ '\u3000'+str(b-1)) \n", "s,t=input().split()\na,b=map(int,input().split())\nu=input()\nif u==s:\n print(str(a-1)+ ' '+str(b))\nelse:\n print(str(a)+ ' '+str(b-1)) "] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s053149887', 's245563522', 's472859323'] | [3060.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [132, 139, 134] |
p02777 | u652656291 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['a,b = input().split()\nx,y = int(input().split())\nk = input()\n\nif a == k:\n print(x-1,y)\nelse:\n print(x,y-1)\n', 'a,b = input().split()\nx,y = map(int,input().split())\nk = int(input())\n\nif a == k:\n print(x-1,y)\nelse:\n print(x,y-1)\n', 'a,b = str(input().split())\nx,y = int(input().split())\nk = str(input())\n\nif "a" == "k" :\n print(x-1,y)\nelif "b" == "k" :\n print(x,y-1)\nelse:\n print(x,y)', 'a,b = str(input().split())\nx,y = int(input().split())\nk = str(input())\n\nif a == k :\n print(x-1,y)\nelif b == k :\n print(x,y-1)\nelse:\n print(x,y)', 'a,b = input().split()\nx,y = int(input().split())\nk = input()\n\nif a == k :\n print(x-1,y)\nelse\n print(x,y-1)\n', 'a,b = input().split()\nx,y = int(input().split())\nk = input()\n\nif a == k :\n print(x-1,y)\nelif b == k :\n print(x,y-1)\nelse:\n print(x,y)\n', 'a,b = input().split()\nx,y = int(input().split())\nk = input()\n\nif a == k:\n print(x-1,y)\nelse:\n print(x,y-1)\n', 'a,b = input().split()\nx,y = map(int,input().split())\nk = input()\n\nif a == k:\n print(x-1,y)\nelse:\n print(x,y-1)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s012565008', 's012730424', 's545933477', 's580216579', 's602716213', 's660902698', 's739185622', 's651671912'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [109, 118, 154, 146, 109, 137, 109, 113] |
p02777 | u653600072 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = input.split()\na, b = input.split()\nu = input()\n\nif u == s:\n print(a-1, b)\nif u == t:\n print(a, b-1)', 's, t = input().split()\na, b = input().split()\nu = input()\n\na = int(a)\nb = int(b)\n\nif u == s:\n print(a-1, b)\nif u == t:\n print(a, b-1)'] | ['Runtime Error', 'Accepted'] | ['s683551670', 's017758358'] | [2940.0, 3060.0] | [17.0, 17.0] | [112, 139] |
p02777 | u655048024 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = map(str,input().split())\na,b = map(str,input().split())\nu = str(input())\nif(u==s):\n print(a-1,b)\nelif(u==t):\n print(a,b-1)\n', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\nif(u==s):\n print(a-1,b)\nelif(u==t):\n print(a,b-1)\n'] | ['Runtime Error', 'Accepted'] | ['s837364251', 's648833385'] | [8768.0, 9044.0] | [21.0, 26.0] | [131, 131] |
p02777 | u656919695 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["n=int(input())\na=[i for i in input().split()]\n\nprint('YES' if len(set(a)==n) else 'NO')", 's,t =map(str,input().split())\na,b =map(int,input().split())\nu=input()\nif u==s:\n print(a-1)\nelse:\n print(b-1)', 's,t =map(str,input().split())\na,b =map(int,input().split())\nu=input()\nif u==s:\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s113798399', 's292149354', 's738043246'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [87, 114, 118] |
p02777 | u659302753 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["from sys import stdin\n\n\ndef get_result(data):\n return 'x' * len(data)\n\nif __name__ == '__main__':\n data = input()\n result = get_result(data)\n print(result)\n", "from sys import stdin\n\n\ndef get_result(data):\n S, T = data[0]\n A, B = data[1]\n U = data[2][0]\n if S == U:\n A = A - 1\n elif T == U:\n B = B - 1\n return ' '.join([str(A), str(B)])\n\nif __name__ == '__main__':\n raw_data = [val.rstrip('\\n') for val in stdin.readlines()]\n data = [list(map(str, val.split(' '))) for val in raw_data]\n data[1] = [int(val) for val in data[1]]\n result = get_result(data)\n print(result)\n"] | ['Wrong Answer', 'Accepted'] | ['s245508725', 's202358120'] | [2940.0, 3188.0] | [17.0, 20.0] | [168, 456] |
p02777 | u659587571 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['input_list = input().split()\ninput_list2 = list(map(input().split()))\ndelete_ball = input()\nfor ind, n in enumerate(input_list):\n if n == delete_ball:\n input_list2[ind] -= 1\nprint(input_list2)', 'input_list = input().split()\ninput_list2 = list(map(int, input().split()))\ndelete_ball = input()\nfor ind, n in enumerate(input_list):\n if n == delete_ball:\n input_list2[ind] -= 1\nans = ""\nfor m in input_list2:\n ans += str(m) + " "\nprint(ans.rstrip())'] | ['Runtime Error', 'Accepted'] | ['s126157413', 's603633750'] | [2940.0, 3060.0] | [17.0, 18.0] | [196, 255] |
p02777 | u664373116 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t=input().split()\na=list(map(int,input().split()))\nu=input()\n\nif s==u:\n print(a[1])\nelse:\n print(a[0])', 's,t=input().split()\na=list(map(int,input().split()))\nu=input()\n\nif s==u:\n a[0]-=1\nelse:\n a[1]-=1\nprint(a[0],a[1])'] | ['Wrong Answer', 'Accepted'] | ['s704871189', 's453845674'] | [2940.0, 2940.0] | [17.0, 17.0] | [110, 119] |
p02777 | u664907598 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t=map(str,input().split())\na,b=map(int,input().split())\nu=str(input)\n\nif u==s:\n print((a-1),b)\nelse:\n print(a,(b-1))', 's,t=map(str,input().split())\na,b=map(int,input().split())\nu=str(input())\n\n\nif u==s:\n print((a-1),b)\nelse:\n print(a,(b-1))\n'] | ['Wrong Answer', 'Accepted'] | ['s783867603', 's137437790'] | [2940.0, 2940.0] | [17.0, 17.0] | [124, 128] |
p02777 | u666961261 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['N,M = map(str,input().split())\nNN,MM = map(int,input().split())\nress = input()\nif(ress == N):\n NN = NN-1\nelif(ress == M):\n MM == MM-1\nprint(MM,NN)\n \n', 'S,T = map(str, input().split())\nA,B = map(int, input().split())\nU = str(input())\nif U == T:\n B-=1\nelse:\n A-=1\nprint(A, B)'] | ['Wrong Answer', 'Accepted'] | ['s224658061', 's920687572'] | [2940.0, 2940.0] | [18.0, 18.0] | [152, 127] |
p02777 | u667024514 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = map(int,input().split())\na,b = map(int,input().split())\nu = str(input())\nif u == s:\n a -= 1\nelse:\n b -= 1\nprint(a,b)', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\nif u == s:\n a -= 1\nelse:\n b -= 1\nprint(a,b)'] | ['Runtime Error', 'Accepted'] | ['s088991138', 's037593602'] | [2940.0, 2940.0] | [17.0, 17.0] | [128, 128] |
p02777 | u667694979 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T=map(input().split())\na,b=mao(int,input().split())\nU=input()\n\nif S==U:\n print(a-1,b)\nelse:\n print(a,b-1)', 'S,T=input().split()\na,b=map(int,input().split())\nU=input()\n\nif S==U:\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Runtime Error', 'Accepted'] | ['s140588279', 's292227852'] | [3060.0, 2940.0] | [17.0, 17.0] | [109, 104] |
p02777 | u670838922 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['a=input().split()\nN=int(a[0])\nK=int(a[1])\nzantei=0\nP=list(map(float,input().split()))\n\nP_ex=list(map(lambda x: (x+1)/2,P))\n\n\nfor i in range(0,K):\n \n zantei+=P_ex[i]\nzanans=0\nbuffer=P_ex[0]\nbeforeans=zantei\nfor i in range(1,N-K+1):\n if(beforeans-buffer+P_ex[K+i-1]>zantei):\n zantei=beforeans+P_ex[K+i-1]-buffer\n buffer=P_ex[i]\n beforeans+=P_ex[K+i-1]-buffer\n\nprint(zantei)', 'S,T=(input().split())\nA,B=(input().split())\nU=input()\nif(U==S):\n print(int(A)-1,int(B))\nif(U==T):\n print(int(A),int(B)-1)'] | ['Runtime Error', 'Accepted'] | ['s771560899', 's156879623'] | [3064.0, 3060.0] | [17.0, 17.0] | [393, 127] |
p02777 | u674052742 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = list(input().split())\na,b = list(map(int, input().split()))\n\nif input() == s:\n print(a-1)\nelse:\n print(b-1)', 's,t = list(input().split())\na,b = list(map(int, input().split()))\n\nif input() == s:\n print(a-1,b)\nelse:\n print(a,b-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s698414180', 's656324056'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 120] |
p02777 | u674190122 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["'''\nred blue\n3 4\nred\n'''\na, b = [x for x in input().split()]\nan, bn = [int(x) for x in input().split()]\nthrew = input()\nif threw == a:an -= 1\n else:\n bn -= 1\nprint(an, bn) \n ", "'''\nred blue\n3 4\nred\n'''\na, b = [x for x in input().split()]\nan, bn = [int(x) for x in input().split()]\nthrew = input()\nif threw == a:an -= 1\nelse:\n bn -= 1\nprint(an, bn)\n"] | ['Runtime Error', 'Accepted'] | ['s774686478', 's203571647'] | [2940.0, 3060.0] | [17.0, 17.0] | [182, 174] |
p02777 | u685244071 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = map(str, input().split)\nA, B = map(int, input().split)\ninput()\n\na = A - 1\nb = B - 1\n\nif U == S:\n print({} {}.format(a,B))\nelse:\n print({} {}.format(A.b))\n', 'S, T = map(str, input().split)\nA, B = map(int, input().split)\ninPut()\n\na = A - 1\nb = B - 1\n\nif U == S:\n print({} {}.format(a,B))\nelse:\n print({} {}.format(A.b))', 'S, T = map(str, input().split())\nA, B = map(int, input().split())\nU = input()\n\na = A - 1\nb = B - 1\n\nif U == S:\n print({} {}.format(a,B))\nelse:\n print({} {}.format(A,b))\n', 'S, T = map(str, input().split)\nA, B = map(int, input().split)\nU = input()\n\na = A - 1\nb = B - 1\n\nif U == S:\n print({} {}.format(a,B))\nelse:\n print({} {}.format(A.b))\n', 'S, T = map(str, input().split())\nA, B = map(int, input().split())\nU = input()\n\na = A - 1\nb = B - 1\n\nif U == S:\n print({} {}.format(a,B))\nelse:\n print({} {}.format(A.b))\n', "S, T = map(str, input().split())\nA, B = map(int, input().split())\nU = input()\n\na = A - 1\nb = B - 1\n\nif U == S:\n print('{} {}'.format(a,B))\nelse:\n print('{} {}'.format(A,b))\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s405362577', 's636875270', 's845741354', 's930550260', 's984455936', 's399586133'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [163, 162, 171, 167, 171, 175] |
p02777 | u690873774 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['import sys\na,b=map(str, sys.stdin.readline().split())\nc,d=map(int, sys.stdin.readline().split())\ne=sys.stdin.readline()\nif a==e:\n c-=1\nelse:\n d-=1\nprint(c,d)', 's, t = map(str, input().split())\na, b = map(int, input().split())\ne = input()\nif s==e:\n a-=1\nelse:\n b-=1\nprint(a,b)'] | ['Wrong Answer', 'Accepted'] | ['s547050087', 's137461206'] | [2940.0, 2940.0] | [17.0, 17.0] | [159, 117] |
p02777 | u693007703 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split()\n\nA, B = [int(i) for i in input().split()]\n\nU = input().split()\n\nif U == S :\n A = A - 1\nelse :\n B = B - 1\n \nprint(A, B)', 'S, T = input().split()\n\nA, B = [int(i) for i in input().split()]\n\nU = input()\n\nif U == S :\n A = A - 1\nelse :\n B = B - 1\n \nprint(A, B)'] | ['Wrong Answer', 'Accepted'] | ['s115974775', 's814381407'] | [2940.0, 2940.0] | [17.0, 17.0] | [150, 142] |
p02777 | u696646471 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['l=input().split() \nn = list(map(int, input().split()))\nt=input()\nif l[0]==t:\n n[0]=n[0]-1\n print(n[0],n[1])\nelif l[1]==t:\n n[1]=n[1]-1\n print(n[0,n[1])', 'l=input().split() \nn = list(map(int, input().split()))\nt=input()\nif l[0]==t:\n n[0]=n[0]-1\n print(n)\nelif l[1]==t:\n n[1]=n[1]-1\n print(n)', 'l=input().split() \nn = list(map(int, input().split()))\nt=input()\nif l[0]==t:\n n[0]=n-1\n print(n)\nelif l[1]==t:\n n[1]=n-1\n print(n)', 'l=input().split() \nn = list(map(int, input().split()))\nt=input()\nif l[0]==t:\n n[0]=n[0]-1\n print(n[0],n[1])\nelif l[1]==t:\n n[1]=n[1]-1\n print(n[0],n[1])'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s383861807', 's483525925', 's574229847', 's819089208'] | [3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [163, 148, 142, 164] |
p02777 | u697758384 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T = input().split()\nA,B = map(int, input().split())\nU = input()\n\nif U = S: A-=1\nelse: B-=1\nprint(A,B)', 'S,T = map(str, input().split())\nA,B = map(int, input().split())\nU = input()\n\nif U = S:\n print({}""{},(A-1)+B)\nelse:\n print({}""{},A+(B-1))', 'S,T = input().split()\nA,B = map(int, input().split())\nU = input()\n\nif U == S: A-=1\nelse: B-=1\nprint(A,B)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s038482734', 's852818514', 's990860482'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [103, 144, 104] |
p02777 | u699944218 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split()\na, b = int(input.split())\nU = input()\nif str(S) == str(U):\n print(a-1)\nelse:\n print(b-1)', 'S, T = input().split()\na, b = int(input.split())\nU = input()\nif S == U:\n print(a-1)\nelse:\n print(b-1)', 'S, T = input().split()\na, b = int(input.split())\nU = input()\nif list(S) == list(U):\n print(a-1)\nelse:\n print(b-1)', 'S, T = input().split(" ")\nA, B = [int(i) for i in input().split(" ")]\nU = input()\n \nif S==U :\n print("{} {}".format(A-1,B))\nelse:\n print("{} {}".format(A,B-1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s574330359', 's635443588', 's645949257', 's081297215'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 18.0] | [113, 103, 115, 161] |
p02777 | u702914680 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['N = int(input())\nK = int(input())\n\ncount = 0\ni = 1\nwhile i <= N:\n s = str(i)\n if K == len(s) - s.count("0"):\n count = count + 1\n i = i + 1\n\nprint(count)', 'N = int(input())\nK = int(input())\n\ncount = 0\ni = 1\nwhile i <= N:\n s = str(i)\n if K == (len(s) - s.count("0")):\n count = count + 1\n i = i + 1\n\nprint(count)', 'tmp = input().split()\nS = tmp[0]\nT = tmp[1]\ni = list(map(int, input().split()))\nA = i[0]\nB = i[1]\nU = input()\n\nif S == U:\n print(str(A-1) + " " + str(B))\nelse:\n print(str(A) + " " + str(B-1))\n\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s305959830', 's379183591', 's832879784'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 20.0] | [158, 160, 195] |
p02777 | u705007443 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["s=input()\nprint('x'*len(s))", "t,s=map(str,input().split())\na,b=map(int,input().split())\nu=input()\nif u==t:\n a-=1\nelif u==s:\n b-=1\nprint(str(a)+' '+str(b))"] | ['Wrong Answer', 'Accepted'] | ['s144462723', 's899258887'] | [3060.0, 2940.0] | [19.0, 17.0] | [27, 130] |
p02777 | u705418271 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s=list(input())\nprint("x"*len(s))', 's,t=map(str,input().split())\na,b=map(int,input().split())\nu=str(input())\n\nif u==s:\n print(a-1,b)\nelse:\n print(a,b-1)\n '] | ['Wrong Answer', 'Accepted'] | ['s911858813', 's696393518'] | [8972.0, 9040.0] | [26.0, 25.0] | [33, 121] |
p02777 | u706433263 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['a,b=input().split()\nc,d=map(int,input().split())\ne=imput()\nif e==a:\n c=c-1\nelse:\n d=d-1\nprint(c,d)\n', "a,b=input().float()\nc,d=map(int,input().float())\ne=imput()\nif e=='a':\n c=c-1\nelse:\n d=d-1\nprint(c,d)\n", 'a,b=input().float()\nc,d=map(int,input().float())\ne=imput()\nif e==a:\n c=c-1\nelse:\n d=d-1\nprint(c,d)\n', 'a,b=input().split()\nc,d=map(int,input().split())\ne=input()\nif e==a:\n c=c-1\nelse:\n d=d-1\nprint(c,d)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s246330405', 's358771430', 's393363031', 's035568230'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [101, 103, 101, 101] |
p02777 | u711626986 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['a, b=map(str,input().split())\nc, d=map(int,input().split())\ne=str,input()\nif e==a:\n print(c-1,d)\nelse:\n print(c,d-1)\n', 'a, b=map(str,input().split())\nc, d=map(int,input().split())\ne=input()\nf=str(e)\nif a==f:\n print(c-1,d)\nelse:\n print(c,d-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s640925922', 's260096285'] | [2940.0, 2940.0] | [18.0, 17.0] | [119, 124] |
p02777 | u712284046 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['ball = input().split()\nnumber = list(map(int, input().split()))\nU = input()\n\nif U == ball[0]:\n number[0] -= 1\nelse:\n number[1] -= 1\nprint(number)\n', 'ball = input().split()\nnumber = list(map(int, input().split()))\nU = input()\n\nif U == ball[0]:\n number[0] -= 1\nelse:\n number[1] -= 1\nprint(number[0], number[1])'] | ['Wrong Answer', 'Accepted'] | ['s660356587', 's871494076'] | [2940.0, 2940.0] | [17.0, 18.0] | [152, 165] |
p02777 | u717265305 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['import sys\nread = sys.stdin.buffer.read \nreadline = sys.stdin.buffer.readline \nreadlines = sys.stdin.buffer.readlines \n\ns, t = readline().split()\na, b = map(int, readline().split())\nu = readline()\n\nif u == s:\n a-=1\nelif u == t:\n b-=1\nprint(a,b)\n', 'import sys\nread = sys.stdin.buffer.read \nreadline = sys.stdin.buffer.readline \nreadlines = sys.stdin.buffer.readlines \n\ns, t = readline().split()\na, b = map(int, readline().split())\nu = readline()\n\nif u == s:\n a-=1\nelif u == t:\n b-=1\nprint(a,b)', 's, t = input().split()\na, b = map(int, input().split())\nu = input()\n \nif u == s:\n a-=1\nelif u == t:\n b-=1\nprint(a,b)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s442134527', 's669739957', 's942812677'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [330, 329, 118] |
p02777 | u718411265 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T=input().split()\nA,B=map(int,input().split())\nU=input()\nif U==S:\n print(str(A-1))\nelse:\n print(str(B-1))', 'S,T=input().split()\nA,B=map(int,input().split())\nU=input()\nif S==U:\n print(A-1 B)\nelse:\n print(A B-1)', 'S,T=input().split()\nA,B=map(int,input().split())\nU=S or T\nif U==S:\n print(str(A-1))\nelse:\n print(str(B-1))', 'S,T=input().split()\nA,B=map(int,input().split())\nif S==U:\n print(A-1+" "+B)', 'S,T=input().split()\nA,B=map(int,input().split())\nU=input()\n\nif S==U:\n print(A-1,B)\nelse:\n print(A,B-1)'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s008502755', 's067535077', 's749674032', 's765256657', 's487836926'] | [3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 16.0, 17.0, 17.0, 17.0] | [109, 103, 108, 76, 104] |
p02777 | u720124072 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = input().split()\na, b = map(int, input().split())\nu = input().split()\n\nif s == u:\n print(a-1, b)\nelif t == u:\n print(a, b-1)\nelse:\n print(a, b)', 's, t = input().split()\na, b = map(int, input().split())\nu = input().split()\n\nif s == u:\n print(a-1, b)\nelse:\n print(a, b-1)', 's, t = input().split()\na, b = map(int, input().split())\nu = input()\n\nif s == u:\n print(a-1, b)\nelif t == u:\n print(a, b-1)\nelse:\n print(a, b)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s491638543', 's540189003', 's915455654'] | [9176.0, 9156.0, 9112.0] | [31.0, 29.0, 33.0] | [152, 125, 144] |
p02777 | u723792785 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['n,k = map(int,input().split())\np = list(map(int,input().split()))\nu = sum(p[0:k])\nmaxsum = u\nfor i in range(1, n-k+1):\n\tu = u + p[i+k-1] - p[i-1]\n\tif u >= maxsum:\n\t\tmaxsum = u\nprint((maxsum+k)/2)', 's,t=map(str,input().split())\na,b=map(int,input().split())\nu=input()\nif u == s:\n\tprint(a-1, b)\nif u == t:\n\tprint(a, b-1)'] | ['Runtime Error', 'Accepted'] | ['s964169989', 's384918294'] | [3060.0, 2940.0] | [18.0, 17.0] | [195, 119] |
p02777 | u731436822 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['N,K = map(int,input().split())\nP = list(map(int,input().split()))\n\nls = P[0:K]\nsumm = sum(ls)\nans = [0]*K\n\nfor i in range(N-K+1):\n if summ < sum(P[i:i+K]):\n ls = P[i:i+K]\n summ = sum(ls)\nfor j in range(K):\n ans[j]=(ls[j]+1)*ls[j]/(2*ls[j])\nprint(sum(ans))', 'S,T = input().split()\nA,B = map(int,input().split())\nU = input()\n\nif U == S:\n print(A-1,B)\nelse:\n print(A,B-1)'] | ['Runtime Error', 'Accepted'] | ['s371522348', 's489630074'] | [3064.0, 2940.0] | [18.0, 18.0] | [275, 116] |
p02777 | u735335967 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s = input().split()\nnum = [int(i) for i in input().split()]\nu = input()\nnum1 = num[0]\nnum2 = num[1]\n\nif s[0] == u:\n nums = num1 - 1\n print("{} {}".format(nums, num1))\nelif s[1] == u:\n nums = num2 - 1\n print("{} {}".format(num1, nums))\n', 's = input().split()\nnum = [int(i) for i in input().split()]\nu = input()\nnum1 = num[0]\nnum2 = num[1]\n\nif s[0] == u:\n nums = num1 - 1\n print("{} {}".format(nums, num2))\nelif s[1] == u:\n nums = num2 - 1\n print("{} {}".format(num1, nums))\n'] | ['Wrong Answer', 'Accepted'] | ['s574213910', 's138400973'] | [2940.0, 2940.0] | [17.0, 17.0] | [247, 247] |
p02777 | u737491054 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["n=int(input())\nl=list(map(int, input().split()))\ntester=True\nfor i in range(n):\n for j in range(i+1,n): \n if l[i]==l[j]:\n tester=False\n break\n\nif tester==True:\n print('YES')\nelse:\n print('NO')\n\n\n", 's,t=map(str, input().split())\na,b=map(int, input().split())\nu=input()\nif s==u:\n if t==u:\n print(a-1,b-1)\n else:\n print(a-1,b)\nelse:\n if t==u:\n print(a,b-1)\n else:\n print(a,b)\n\n'] | ['Runtime Error', 'Accepted'] | ['s903633603', 's123225346'] | [2940.0, 3060.0] | [18.0, 17.0] | [234, 216] |
p02777 | u739843002 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['str = input().split(" ")\nS = str[0]\nT = str[1]\nnum = input().split(" ")\nNS = int(num[0])\nNT = int(num[1])\nU = input()\n\nif S == U:\n print(str(NS - 1) + " " + str(NT))\nelse:\n print(str(NS) + " " + str(NT - 1))', 'str = input().split(" ")\nS = str[0]\nT = str[1]\nnum = input().split(" ")\nNS = int(num[0])\nNT = int(num[1])\nU = input()\n\nif S == U:\n print(NS - 1, end=" ")\n print(NT)\nelse:\n print(NS, end=" ")\n print(NT - 1)'] | ['Runtime Error', 'Accepted'] | ['s355826965', 's773489691'] | [9052.0, 9128.0] | [25.0, 28.0] | [209, 209] |
p02777 | u742036388 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['n, k = map(int, input().split())\np = list(map(int, input().split()))\n\ntotal_expects = []\n\nfor i in range(0, n): \n \n expect = [q * (1 / p[i]) for q in range(1, p[i]+1)]\n total_expects.append(sum(expect))\n\nprint(max([sum(total_expects[i:i+k]) for i in range(0, k)]))', 's, t = map(str, input().split())\na, b = map(int, input().split())\nu = str(input())\n\nif u == s:\n print(a-1, b)\nelif u == t:\n print(a, b-1)\nelse:\n print(a, b)'] | ['Runtime Error', 'Accepted'] | ['s181507311', 's042987909'] | [3060.0, 3060.0] | [18.0, 17.0] | [351, 165] |
p02777 | u744034042 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = input().split()\na,b = map(int, input().split())\nu = input()\n\nif s == u or t == u:\n print(a+b-1)\nelse:\n print(a+b)', 's,t = input().split()\na,b = map(int,input().split())\nu = input()\nif s == u:\n print(a-1,b)\nif t == u:\n print(a,b-1)\nelse:\n print(a,b)', 's,t = input().split()\na,b = map(int,input().split())\nu = input()\nif s == u:\n print(a-1,b)\nelif t == u:\n print(a,b-1)\nelse:\n print(a,b)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s515977813', 's758816462', 's255163629'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [121, 135, 143] |
p02777 | u745687363 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = input().split()\na, b = map(int, input().split())\nu = input().split()\nif s == u:\n a -= 1\nelse:\n b -= 1\nprint(a, b)\n \n \n', 's, t = input().split()\na, b = map(int, input().split())\nu = input()\nif s == u:\n a -= 1\nif t == u:\n b -= 1\nprint(a, b)\n \n \n'] | ['Wrong Answer', 'Accepted'] | ['s219075886', 's763867399'] | [2940.0, 2940.0] | [17.0, 18.0] | [129, 126] |
p02777 | u746791385 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['print("enter S and T value")\nS, T = input().split()\nprint("enter A and B value")\nA, B = map(int, input().split())\nprint("enter U value")\nU = input()\nif S==U:\n print("{} {}".format(A-1,B))\nelif T==U:\n print("{} {}".format(A,B-1))', 'words = input()\nprint("x"*len(words))', 'print("enter S and T value")\nS, T = input().split()\nprint("enter A and B value")\nA, B = map(int, input().split())\nprint("enter U value")\nU = input()\nif S==U:\n print("{} {}".format(A-1,B))\nelse:\n print("{} {}".format(A,B-1))', 'aa', 'S, T = map(input().split())\nA, B = map(int, input().split())\nU = input()\nif S=U:\n print("{} {}".format(S-1,T))\nelse:\n print("{} {}".format(S,T-1)\n', '\nS, T = input().split()\nA, B = map(int, input().split())\nU = input()\nif S==U:\n print("{} {}".format(A-1,B))\nelse:\n print("{} {}".format(A,B-1))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s117271826', 's162433542', 's616582142', 's660748851', 's960959290', 's634416689'] | [3060.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [230, 37, 225, 2, 148, 145] |
p02777 | u747941497 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["def ex_value(dice):\n return (1+dice)/2\ndef main():\n n,k = map(int, input().split())\n list_p = list(map(int, input().split()))\n list_ex_val = list(map(ex_value, list_p))\n print(max([sum(list_ex_val[i:i+k]) for i in range(n-k+1)]))\n \nif __name__ == '__main__':\n main()", 's,t = map(str, input().split())\na,b = map(int, input().split())\nu = str(input())\n\nif s == u:\n print(a-1, b)\nelse:\n print(a, b-1)'] | ['Runtime Error', 'Accepted'] | ['s867792875', 's087281421'] | [2940.0, 3060.0] | [17.0, 17.0] | [276, 134] |
p02777 | u749512407 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["M = [input() for i in range(3)]\nM[0] = M[0].split()\ns = str(M[0][0])\nt = str(M[0][1])\n\nM[1] = M[1].split()\na = int(M[1][0])\nb = int(M[1][0])\n\nU = str(M[2])\n\nif s == U:\n a -= 1\nelse:\n b -= 1\n\nprint(str(a) + ' ' + str(b))", "M = [input() for i in range(3)]\nM[0] = M[0].split()\ns = str(M[0][0])\nt = str(M[0][1])\n\nM[1] = M[1].split()\na = int(M[1][0])\nb = int(M[1][1])\n\nU = str(M[2])\n\n\nif s == U:\n a -= 1\nelse:\n b -= 1\n\nprint(str(a) + ' ' + str(b))\n"] | ['Wrong Answer', 'Accepted'] | ['s226524837', 's812082966'] | [3064.0, 3064.0] | [17.0, 20.0] | [221, 223] |
p02777 | u749686470 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t=map(input().split())\na,b=map(int,input().split())\nsum=a+b\nu=input()\nsum=sum-1\nprint(sum)\n', 's,t=input().split()\na,b=map(int,input().split())\nsum=a+b\nu=input()\nif(u==s):\n a=a-1\nelse:\n b=b-1\nprint(a,end=" ")\nprint(b)\n'] | ['Runtime Error', 'Accepted'] | ['s700567711', 's114129234'] | [3188.0, 2940.0] | [18.0, 17.0] | [93, 129] |
p02777 | u750838232 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['n,k = map(int,input().split())\np = list(map(int,input().split()))\n \ne = []\n \nfor i in range(len(p)):\n\te.append((1 + p[i]) / 2)\n\ntmp = 0\nl = 0\n \nwhile True:\n res = 0\n j = 0\n for j in range(k):\n res = res + e[l + j]\n if tmp < res:\n tmp = res\n l = l + 1\n if l + k > len(e):\n break\n\nprint(tmp)', "s,t = map(str, input().split())\na,b = map(int, input().split())\nu = str(input())\n\nif u == s:\n a = a - 1\nelif u == t:\n b = b - 1\n\nprint(str(a) + ' ' + str(b))"] | ['Runtime Error', 'Accepted'] | ['s469997438', 's348128940'] | [3064.0, 2940.0] | [18.0, 17.0] | [304, 159] |
p02777 | u752522099 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = input().split())\na,b = map(int,input().split())\nu = input()\n\nif s == u and not t == u:\n gap = a -1\n print(int(gap),b)\nelse:\n gap = b -1\n print(a,int(gap))', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\n\nif s = u and not t = u:\n gap = a -1\n print(int(gap),b)\nelse:\n gap = b -1\n print(a,int(gap))s', 's,t = input().split())\na,b = map(int,input().split())\nu = input()\n\nif s == u:\n gap = a -1\n print(gap,b)\nelse:\n gap = b -1\n print(a,gap)', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\n\nif s = u and not t = u:\n gap = a -1\n print(int(gap))\nelse:\n gap = b -1\n print(int(gap))s', 's,t = input().split())\na,b = map(int,input().split())\nu = input()\n\nif s == u:\n print(a -1,b)\nelse:\n print(a,b-1)', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\n\nif s = u:\n ball_gap = a -1\n print(ball_gap)\nelif t = u:\n ball_gap = b -1\n print(ball_gap)\n ', 's,t = input().split()\na,b = map(int,input().split())\nu = input()\n\nif s == u:\n print(a -1,b)\nelse:\n print(a,b-1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s198253259', 's270661949', 's345714636', 's546037073', 's684296924', 's887968192', 's464470742'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 17.0, 18.0, 17.0, 18.0] | [172, 184, 147, 180, 118, 176, 117] |
p02777 | u752552310 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = input().split()\na, b = map(int, input())\nu = input()\n\nif s == u:\n print(a-1, b)\nelse:\n print(a, b-1)', 's, t = input().split()\na, b = map(int, input().split())\nu = input()\n \nif s == u:\n print(a-1, b)\nelse:\n print(a, b-1)'] | ['Runtime Error', 'Accepted'] | ['s643091338', 's531584998'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 118] |
p02777 | u757919796 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['keys = input.split()\nvalues = tuple(map(int, input().split()))\n\nball = dict(zip(keys, values))\nu = input()\n\nball[u] -= 1\nprint(ball[keys[0]], ball[keys[1]])\n', 'keys = input().split()\nvalues = tuple(map(int, input().split()))\n\nball = dict(zip(keys, values))\nu = input()\n\nball[u] -= 1\nprint(ball[keys[0]], ball[keys[1]])\n'] | ['Runtime Error', 'Accepted'] | ['s850348662', 's941064737'] | [2940.0, 2940.0] | [17.0, 17.0] | [157, 159] |
p02777 | u759718348 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["n = int(input())\n*l, = map(int, input().split())\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\nS = has_duplicates(l)\nif str(S) == 'False':\n print('YES')\nelif str(S) == 'True':\n print('NO')\n\n", "n = int(input())\n*l, = map(int, input().split())\nL = sorted(l)\nS = 0\nfor i in range(n):\n for l in range(n):\n if L[i] == L[l]:\n S = 1\nif S == 0:\n print('Yes')\nelif S == 1:\n print('No')", 'S, T = input().split()\nA, B = map(int,input().split())\nU = input()\nif U == S:\n print(A-1, B)\nelif U == T:\n print(A, B-1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s202215230', 's257974744', 's996272726'] | [2940.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0] | [208, 194, 122] |
p02777 | u761087127 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split()\nA, B = [int(n) for n in input().split()]\nans = {S:A, T:B}\nU = input()\nans[U] -= 1\nprint([i for i in ans.values()])\n', 'S, T = input().split()\nA, B = [int(n) for n in input().split()]\nans = {S:A, T:B}\nU = input()\nans[U] -= 1\nprint(ans[S], ans[T])\n'] | ['Wrong Answer', 'Accepted'] | ['s927295728', 's340785574'] | [2940.0, 2940.0] | [17.0, 18.0] | [138, 127] |
p02777 | u762275701 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = input().split()\na, b = int(input().split())\nu = input()\nif s == u:\n print(a-1, b)\nelse:\n print(a,b-1)\n', 's, t = input().split()\na, b = int(input().split())\nu = input()\nif s == u:\n print(s-1,t)\nelse:\n print(s,t-1)', "s, t = input().split(' ')\na, b = map(int, input().split(' '))\nu = input()\n\nif u == s:\n print(a-1,b)\nelse:\n print(a,b-1)"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s042935599', 's203815950', 's315515128'] | [2940.0, 3060.0, 2940.0] | [17.0, 19.0, 17.0] | [111, 109, 121] |
p02777 | u767438459 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S = input()\nprint("s" * len(S))', 'S,T=map(str, input().split())\nA,B=map(int,input().split())\nU=input()\nif S == U:\n print(A-1, B)\nelse:\n print(A, B-1)'] | ['Wrong Answer', 'Accepted'] | ['s519065761', 's049141641'] | [8940.0, 2940.0] | [25.0, 18.0] | [31, 121] |
p02777 | u767664985 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split()\nA, B = map(int, input().split())\nU = input()\n\nif U == S:\n print(S-1, T)\nelse:\n print(S, T-1)\n', 'S, T = input().split()\nA, B = map(int, input().split())\nU = input()\n\nif U == S:\n print(A-1, B)\nelse:\n print(A, B-1)\n'] | ['Runtime Error', 'Accepted'] | ['s138942815', 's028315147'] | [2940.0, 2940.0] | [17.0, 17.0] | [122, 122] |
p02777 | u768174784 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t=map(input().split())\na,b=map(int,input().split())\nc=input()\nd=""\nif s==c:\n print("{}""{}""{}".format(a-1,d,b))\nelse:\n print("{}""{}""{}".format(a,d,b-1))', 's,t=map(input().split())\na,b=map(int,input().split())\nc=input()\n \nif s==c:\n print("{}""{}".format(a-1,b))\nelse:\n print("{}""{}".format(a,b-1))', 's,t=map(input().split())\na,b=map(int,input().split())\nc=int()\n\nif s==c:\n print("{}""{}".format(a-1,b))\nelse:\n print("{}""{}".format(a,b-1))', 's,t=map(input().split())\na,b=map(int,input().split())\nc=input()\nd=" "\nif s==c:\n print("{}""{}""{}".format(a-1,d,b))\nelse:\n print("{}""{}""{}".format(a,d,b-1))', 'import numpy as np\nn = int(input())\nb = list(int(x) for x in input().split())\na=np.array(b)\n\nx = 0\nfor i in range(n):\n if (a[0] in np.delete(a, 0)) is True:\n print("NO")\n x = 1\n break\n\nif x == 0:\n print("YES")\n', 's,t=input().split()\na,b=map(int,input().split())\nc=input()\nd=" "\nif s==c:\n print("{}""{}""{}".format(a-1,d,b))\nelse:\n print("{}""{}""{}".format(a,d,b-1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s010787053', 's107749146', 's218913696', 's542172595', 's673061510', 's167151580'] | [2940.0, 2940.0, 3060.0, 3060.0, 12496.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 149.0, 17.0] | [159, 144, 141, 160, 237, 155] |
p02777 | u768219634 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["s,t=list(map(str,input().split()))\na,b=list(map(int,input().split()))\nu=list(map(str,input().split()))\nif s != t:\n if u == s:\n a = a-1\n else:\n b = b-1\nprint(a,'',b)", 's,t=map(str,input().split())\na,b=map(int,input().split())\nu=input()\nif (s == u):\n a -= 1\nelif(t == u):\n b -= 1\n\nprint(a,b)'] | ['Wrong Answer', 'Accepted'] | ['s447460045', 's608878280'] | [9152.0, 9148.0] | [29.0, 27.0] | [184, 128] |
p02777 | u771167374 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['n = int(input())\na = list(map(int, input().split()))\na.sort()\nfor i in range(n-1):\n if a[i]==a[i+1]:\n print("NO")\n break\nprint("YES")\n', 's, t = input().split()\na, b = map(int, input().split())\nu = input()\nif u == s :\n print(a-1, b)\nelse :\n print(a, b-1)'] | ['Runtime Error', 'Accepted'] | ['s353139708', 's330223483'] | [2940.0, 2940.0] | [17.0, 17.0] | [141, 122] |
p02777 | u773686010 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['N_dict = {i:0 for i in list(map(str,input().split()))}\nN_List = list(map(int,input().split()))\nct = 0\nfor i in N_dict.keys():\n N_dict[i] = N_List[0]\n ct += 1\nprint(N_dict[str(input())]-1)', 'N_dict = {i:0 for i in list(map(str,input().split()))}\nN_List = list(map(int,input().split()))\nct = 0\nfor i in N_dict.keys():\n N_dict[i] = N_List[0]\n ct += 1\n\nN_dict[str(input())] -= 1\nprint(" ".join(list(map(str,N_dict.values()))))\n', 'N_dict = {i:0 for i in list(map(str,input().split()))}\nN_List = list(map(int,input().split()))\nct = 0\nfor i in N_dict.keys():\n N_dict[i] = N_List[0]\n ct += 1\n\nN_dict[str(input())] -= 1\n" ".join(list(map(str,N_dict.values())))\n', 'N_dict = {i:0 for i in list(map(str,input().split()))}\nN_List = list(map(int,input().split()))\nct = 0\nfor i in N_dict.keys():\n N_dict[i] = N_List[ct]\n ct += 1\n\nN_dict[str(input())] -= 1\nprint(" ".join(list(map(str,N_dict.values()))))\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s020073422', 's312329063', 's961239579', 's371453260'] | [9176.0, 9184.0, 9184.0, 9088.0] | [29.0, 31.0, 27.0, 31.0] | [194, 240, 233, 241] |
p02777 | u774845108 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['using System;\nusing System.Collections;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nclass TEST{\n\tstatic void Main(){\n\t\tSol mySol =new Sol();\n\t\tmySol.Solve();\n\t}\n}\n\nclass Sol{\n\tpublic void Solve(){\n\t\tif(S == U) score[0]--;\n\t\telse score[1]--;\n\t\tConsole.WriteLine(String.Join(" ",score));\n\t}\n\tString S,T;\n\tint[] score;\n\tString U;\n\tpublic Sol(){\n\t\tvar ss = rsa();\n\t\tS = ss[0]; T = ss[1];\n\t\tscore = ria();\n\t\tU = rs();\n\t}\n\n\tstatic String rs(){return Console.ReadLine();}\n\tstatic int ri(){return int.Parse(Console.ReadLine());}\n\tstatic long rl(){return long.Parse(Console.ReadLine());}\n\tstatic double rd(){return double.Parse(Console.ReadLine());}\n\tstatic String[] rsa(char sep=\' \'){return Console.ReadLine().Split(sep);}\n\tstatic int[] ria(char sep=\' \'){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}\n\tstatic long[] rla(char sep=\' \'){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}\n\tstatic double[] rda(char sep=\' \'){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}\n}\n', 'from sys import stdin\nimport sys\nimport numpy as np\nimport collections\nfrom functools import cmp_to_key\nimport heapq\n\n## input functions for me\ndef rsa(sep = \'\'):\n if sep == \'\' :\n return input().split() \n else: return input().split(sep)\ndef rip(sep = \'\'):\n if sep == \'\' :\n return map(int, input().split()) \n else: return map(int, input().split(sep))\ndef ria(sep = \'\'): \n return list(rip(sep))\ndef ri(): return int(input())\ndef rd(): return float(input())\ndef rs(): return input()\n##\ndef main():\n s, t = rsa()\n a, b = ria()\n u = rs()\n if s == u: a -= 1\n if t == u: b -= 1\n print("{0} {1}".format(a,b))\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s100491088', 's130617991'] | [2940.0, 12488.0] | [17.0, 147.0] | [1069, 689] |
p02777 | u774985302 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['T,S = map(str,input().split())\nA,B = map(int,input().split())\nU = input()\nZ = [A+[0,-1][U == T],B+[0,-1][U == S]]\nP = " ".join(Z)\nprint(P)\n\n ', "T,S = input().split()\nA,B = map(int,input().split())\nU = input()\nZ = [A+[0,-1][U == T],B+[0,-1][U == S]]\nO = map(str,Z)\nagy = ' '.join(O)\nprint(agy)"] | ['Runtime Error', 'Accepted'] | ['s248101215', 's191708279'] | [2940.0, 3060.0] | [17.0, 17.0] | [144, 148] |
p02777 | u777241657 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['name_a,name_b=(x for x in input().split())\na_count,b_count=(int(x) for x in input().split())\nfetch_color=input()\n \nif fetch_color==name_a:\n a_coount = a_count-1\nelif fetch_color==name_b:\n b_count = b_count-1\nprint(a_count,b_count)', 'a,b=input().split()\na_num,b_num=intinput().split()\nc=input()\n\nif c==a:\n a_num=int(a_num)-1\n return a_num,b_num\nelif c==b:\n b_num=int(b_num)-1\n return a_num,b_num\n ', 's=input()\narray=[]\narray+=(int(x) for x in input().split())\n\ndef judge(array,s):\n for i in range(int(s)-1):\n print(array[i],array[i+1])\n if array[i] == array[i+1]:\n return True\n else:\n return False\n\nprint(judge(array,s))\n\n ', 'name_a,name_b=(x for x in input().split())\na_count,b_count=(int(x) for x in input().split())\nfetch_color=input()\n\nif fetch_color=name_a:\n a_coount = a_count-1\nelif:\n fetch_color=name_b\n b_count = b_count-1\nprint(a_count,b_count)', 's=input()\narray=[]\narray+=(int(x) for x in input().split())\n\ndef judge(array,s):\n for i in range(int(s)-1):\n if array[i] == array[i+1]:\n return True\n else:\n return False\n\nprint(judge(array,s))', 's=input()\narray=[]\narray+=(int(x) for x in input().split())\narray.sort()\ndef judge(array,s):\n for i in range(int(s)-1):\n if array[i] == array[i+1]:\n return "NO"\n return "YES"\n\nprint(judge(array,s))', "s=input()\nans=''\nfor _ in s:\n ans+='x'\nprint(ans)", 's=input()\narray=[]\narray+=(int(x) for x in input().split())\narray.sort()\ndef judge(array,s):\n for i in range(int(s)-1):\n if array[i] == array[i+1]:\n return "NO"\n return "YES"\n\nprint(judge(array,s))\n', 'name_a,name_b=(x for x in input().split())\na_count,b_count=(int(x) for x in input().split())\nfetch_color=input()\n \nif fetch_color==name_a:\n a_coount = a_count-1\nelif:\n fetch_color==name_b\n b_count = b_count-1\nprint(a_count,b_count)', 's=input()\narray=[]\narray+=(int(x) for x in input().split())\n\ndef judge(array,s):\n for i in range(int(s)-1):\n if array[i] == array[i+1]:\n return True\n else:\n return False\n\nprint(judge(array,s))\n\n ', 'name_a,name_b=(str(x) for x in input().split())\na_count,b_count=(int(x) for x in input().split())\nfetch_color=input()\nans,bns=0,0\nif fetch_color==name_a:\n ans = a_count-1\n bns = b_count\nelif fetch_color==name_b:\n bns = b_count-1\n ans = a_count\nprint(ans,bns)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s008327385', 's020894963', 's062593367', 's216764814', 's414719390', 's523924816', 's712940713', 's741966131', 's891632009', 's961932621', 's763408369'] | [3060.0, 2940.0, 3060.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 3056.0, 3060.0] | [20.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 17.0, 17.0, 17.0, 20.0] | [232, 168, 242, 231, 207, 209, 50, 210, 234, 211, 262] |
p02777 | u779327980 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T = input().split()\nA,B = input().split()\nU = input()\n\nif U = S:\n print(A-1)\nelse:\n print(B-1)\n', 'S = input()\n\nl = len(S)\nK = ""\nfor i in range(l):\n K += "x"\n \nprint(K)', 'S,T = input().split()\nA,B = input().split()\nU = input()\n\nif U == S:\n print(int(A)-1, B)\nelse:\n print(A, int(B)-1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s515152743', 's798844419', 's624273238'] | [2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0] | [99, 72, 115] |
p02777 | u780147002 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T = map(input().split(" "))\nA,B = map(int,input().split(" "))\nU = input()\n\nif S==U:\n A-=1\nelse:\n B-=1\n \nprint(f"{A} {B}")', 'S,T = map(input().split())\nA,B = map(int,input().split())\nU = input().split()\n\nif S==U:\n A-=1\nelse:\n B-=1\n \nprint(f"{A} {B}")', 'S,T = map(input().split())\nA,B = map(int,input().split())\nU = input().split()\n\nif S==U:\n A-=1\nelse:\n B-=1\n \nprint(f"{A} {B}")', 'S,T = input().split(" ")\nA,B = map(int,input().split(" "))\nU = input()\n\nif S==U:\n A-=1\nelse:\n B-=1\n \nprint("{} {}".format(A,B))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s367378162', 's901912248', 's937884416', 's189325925'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 19.0] | [126, 128, 128, 130] |
p02777 | u780475861 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['import sys\nreadline = sys.stdin.readline\ns, t = readline().split()\na, b = map(int, readline().split())\nif s == readline():\n print(a-1,b)\nelse:\n print(a,b-1)', 'import sys\nreadline = sys.stdin.readline\ns, t = readline().split()\na, b = list(map(int, readline().split()))\nif s == readline():\n print(a-1,b)\nelse:\n print(a,b-1)', 's, t = input().split()\na, b = map(int, input().split())\nif s == input():\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s697102741', 's772486578', 's396882104'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 21.0] | [158, 164, 108] |
p02777 | u780698286 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = map(input().split())\na, b = map(int, input().split())\nt = input()\nif s == t:\n print(str(a-1) + " " + str(b))\nelse:\n print(str(a) + " " + str(b-1))', 's = input().split()\na, b = map(int, input().split())\nt = input()\nif s[0] == t:\n print(str(a-1) + " " + str(b))\nelse:\n print(str(a) + " " + str(b-1))\n'] | ['Runtime Error', 'Accepted'] | ['s802701567', 's015036812'] | [9040.0, 9076.0] | [27.0, 25.0] | [155, 151] |
p02777 | u780962115 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['n=int(input())\nK=int(input())\nif K==1:\n counter=0\n for i in range(100):\n for j in range(1,10):\n a="0"*(i)+str(j)+"0"*(99-i)\n if 1<=int(a)<=n:\n counter+=1\n print(counter)\nelif K==2:\n counter=0\n for i in range(100):\n for j in range(i+1,100):\n for k in range(1,10):\n for l in range(1,10):\n a="0"*(i)+str(k)+"0"*(j-i-1)+str(l)+"0"*(99-j)\n if 1<=int(a)<=n:\n counter+=1\n print(counter)\nelif K==3:\n counter=0\n for i in range(100):\n if 100-i>len(str(n)):\n pass\n elif 100-i<len(str(n)):\n for j in range(i+1,100):\n for k in range(j+1,100):\n counter+=9*9*9\n elif 100-i==len(str(n)):\n for j in range(i+1,100):\n for k in range(j+1,100):\n for a in range(int(str(n)[i]),int(str(n)[i])+1):\n for b in range(1,10):\n for c in range(1,10):\n P=str(a)+"0"*(j-i-1)+str(b)+"0"*(k-j-1)+str(c)+"0"*(99-k)\n if 1<=int(P)<=n:\n counter+=1\n counter+=((98-i)*(99-i)//2)*9*9*(int(str(n)[i])-1)\n print(counter)\n \n\n\n \n', 's=list(input().split())\na,b=map(int,input().split())\nu=input()\nif s[0]==u:\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Runtime Error', 'Accepted'] | ['s770186442', 's922800679'] | [3064.0, 2940.0] | [17.0, 17.0] | [1366, 114] |
p02777 | u781758937 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T = input().split()\ncnt = [int(i) for i input().split()]\nU = input()\n\nif U == S:\n cnt[0] -= 1\nelse:\n cnt[1] -= 1\n\nprint(" ".join(cnt))', 'S,T = input().split()\ncnt = [int(i) for i in input().split()]\nU = input()\n \nif U == S:\n cnt[0] -= 1\nelse:\n cnt[1] -= 1\n\nprint(" ".join([str(j) for j in cnt]))'] | ['Runtime Error', 'Accepted'] | ['s322012868', 's693845668'] | [2940.0, 2940.0] | [17.0, 17.0] | [138, 160] |
p02777 | u784022244 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T=map(lambda x: x, input().split())\nA,B=int(input().split())\nU=input()\nL=[(S,A),(T,B)]\nfor l in L:\n x,y=l\n if x==U:\n print(y-1, end=" ")\n else:\n print(y, end=" ")', 'S,T=input().split()\nA, B=map(int, input().split())\nU=input()\n\nif S==U:\n A-=1\nif T==U:\n B-=1\nprint(A, B)'] | ['Runtime Error', 'Accepted'] | ['s019035835', 's419101552'] | [3060.0, 2940.0] | [17.0, 17.0] | [173, 109] |
p02777 | u785728112 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\nx = a-1,b\ny = a,b-1\nif s==u:\n print(x)\nelse:\n print(y)', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\nif s==u:\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Wrong Answer', 'Accepted'] | ['s775783684', 's964313732'] | [8932.0, 9032.0] | [25.0, 27.0] | [135, 123] |
p02777 | u788068140 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = "red", "blue"\nA, B = 3, 4\nU = "red"\n\nS, T = map(str, input().split())\nA, B = map(int, input().split())\nU = input()\n\n\ndef calculate(s, t, a, b, u):\n if u == "s":\n print("{} {}".format((a - 1), b))\n else:\n print("{} {}".format(a, (b - 1)))\n\n\ncalculate(S, T, A, B, U)\n', 'S, T = "red", "blue"\nA, B = 3, 4\nU = "red"\n\nS, T = map(str, input().split())\nA, B = map(int, input().split())\nU = input()\n\n\ndef calculate(s, t, a, b, u):\n if u == s:\n print("{} {}".format((a - 1), b))\n else:\n print("{} {}".format(a, (b - 1)))\n\n\ncalculate(S, T, A, B, U)\n'] | ['Wrong Answer', 'Accepted'] | ['s286836263', 's631376138'] | [9064.0, 8952.0] | [29.0, 27.0] | [292, 290] |
p02777 | u788703383 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["s = input()\nprint('x' * len(s))", 'import sys\ninput = sys.stdin.readline\n \nS, T = input().split()\nA, B = map(int, input().split())\nU = input()\n \nif S==U:\n print(A-1, B)\nelse:\n print(A, B-1)', 'import sys\ninput = sys.stdin.readline\n \nS, T = input().split()\nA, B = map(int, input().split())\nU = input()\n \nif S==U:\n print(A-1,B)\nelse:\n print(A,B-1)', 'import sys\ninput = sys.stdin.readline\n \nS, T = input().split()\nA, B = map(int, input().split())\nU = input()\n \nif S==U:\n print(A-1, B)\nelse:\n print(A, B-1)', 'S, T = input().split()\nA, B = map(int, input().split())\nU = input()\n \nif S==U:\n print(A-1,B)\nelse:\n print(A,B-1)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s212431453', 's238605298', 's863388978', 's934513864', 's752789898'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 17.0, 18.0, 17.0, 17.0] | [31, 156, 154, 156, 114] |
p02777 | u795928154 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ["list1 = input()\nlist2 = input()\nlist3 = input()\nlist1 = list1.split(' ')\nlist2 = list2.split(' ')\nS = list1[0]\nT = list1[1]\nlenS = int(list2[0])\nlenT = int(list2[1])\nselect = list3[0]\nif select == S:\n lenS -= 1\nelif select == T:\n lenT -= 1\nprint(lenS,lenT)", "list1 = input()\nlist1 = list1.split(' ')\nlist2 = input()\nlist2 = list2.split(' ')\nlist3 = input()\nS = list1[0]\nT = list1[1]\nlenS = int(list2[0])\nlenT = int(list2[1])\nselect = list3[0]\nif select == S:\n lenS -= 1\nelif select == T:\n lenT -= 1\nprint(lenS,lenT)", "list1 = input()\nlist1 = list1.split(' ')\nlist2 = input()\nlist2 = list2.split(' ')\nlist3 = input()\nS = list1[0]\nT = list1[1]\nlenS = int(list2[0])\nlenT = int(list2[1])\nselect = list3[0]\nif select == S:\n lenS -= 1\nelse:\n lenT -= 1\nprint(lenS,lenT)", "list1 = input()\nlist1 = list1.split(' ')\nS = list1[0]\nT = list1[1]\nlenS = int(list1[2])\nlenT = int(list1[3])\nselect = list1[4]\nif select == S:\n lenS -= 1\nelse:\n lenT -= 1\nprint(lenS,lenT)", "list1 = input()\nlist1 = list1.split(' ')\nS = list1[0]\nT = list1[1]\nlenS = int(list1[2])\nlenT = int(list1[3])\nselect = list1[4]\nif select == S:\n lenS -= 1\nelse:\n lenT -= 1\nprint(lenS,lenT)", "list1 = input()\nlist1 = list1.split(' ')\nlist2 = input()\nlist2 = list2.split(' ')\nlist3 = input()\nS = list1[0]\nT = list1[1]\nlenS = int(list2[0])\nlenT = int(list2[1])\nselect = list3[0]\nif select == S:\n lenS -= 1\nelse:\n lenT -= 1\nprint(lenS,lenT)", "list1 = input()\nlist1 = list1.split(' ')\nS = list1[0]\nT = list1[1]\nlenS = int(list1[2])\nlenT = int(list1[3])\nselect = list1[4]\nif select == S:\n lenS -= 1\nelse:\n lenT -= 1\nprint(lenS,lenT)", "list1 = input()\nlist2 = input()\nlist3 = input()\nnlist1 = list1.split(' ')\nnlist2 = list2.split(' ')\nS = nlist1[0]\nT = nlist1[1]\nlenS = int(nlist2[0])\nlenT = int(nlist2[1])\nselect = list3\nif select == S:\n lenS -= 1\nelif select == T:\n lenT -= 1\nprint(lenS,lenT)"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s135326656', 's185031474', 's449879339', 's554881474', 's566308646', 's705870244', 's788643804', 's180343770'] | [3064.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 3060.0, 3064.0] | [17.0, 17.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0] | [262, 262, 250, 193, 193, 250, 193, 265] |
p02777 | u796044734 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = map(int,input().split())\na,b = map(int,input().split())\nu =map(int,input().split())\n\nif s==u:\n print( a-1,b)\nelse:\n print( a,b-1)', 's,t = map(int,input().split())\na,b = map(int,input().split())\nu =map(int,input().split())\n\nif s==u:\n print( str(a-1) +" "+ str(b) )\nelse:\n print( str(a) +" "+ str(b-1) ) ', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu =map(str,input().split())\n\nif s==u:\n a -=1\nelse:\n b -=1\n \nprint(a,b)', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu =map(str,input().split())\n\nif s==u:\n print( a-1,b)\nelse:\n print( a,b-1)', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu =map(str,input().split())\n\nif u==s:\n a -=1\nelse:\n b -=1\n \nprint(a,b)\n', 's,t = map(str,input().split())\na,b = map(int,input().split())\nu =input()\n\nif u==s:\n a -=1\nelse:\n b -=1\n \nprint(a,b)\n'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s104405954', 's151583807', 's424729262', 's516174900', 's978432749', 's419657739'] | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0, 19.0, 17.0, 17.0] | [137, 172, 135, 137, 136, 119] |
p02777 | u799215419 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['N, K = map(int, input().split())\np = list(map(int, input().split()))\n\nres = -1\n\nfor i in range(N):\n res = p[i]\n\nprint(res)\n', 'S, T = input().split()\nA, B = map(int, input().split())\nU = input()\ndct = {}\ndct[S] = A\ndct[T] = B\ndct[U] -= 1\nprint(dct[S], dct[T])\n'] | ['Runtime Error', 'Accepted'] | ['s638789359', 's359278806'] | [2940.0, 2940.0] | [17.0, 17.0] | [126, 133] |
p02777 | u802963389 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s, t = input().split()\na, b =map(int, input().split())\nx = input()\n\nif x == a:\n print(a - 1, b)\nelse:\n print(a, b - 1)', 's, t = input().split()\na, b =map(int, input().split())\nx = input()\n\nif x == s:\n print(a - 1, b)\nelse:\n print(a, b - 1)\n'] | ['Wrong Answer', 'Accepted'] | ['s817706941', 's122985355'] | [9020.0, 9060.0] | [29.0, 26.0] | [120, 121] |
p02777 | u804048521 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split()\nA, B = (int(x) for x in input().split())\nU = input()\nprint(A - int(S==U), B - int(T==U) if S == U or T == U)\n ', 'S, T = input().split()\nA, B = (int(x) for x in input().split())\nU = input()\nif S == U or T == U:\n print(A - int(S==U), B - int(T==U))\n \n'] | ['Runtime Error', 'Accepted'] | ['s909496997', 's164345839'] | [2940.0, 2940.0] | [17.0, 17.0] | [134, 138] |
p02777 | u805552010 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['\ns,t = map(str,input().split())\na,b = map(int,input().split())\nu = str(input())\n\nif u == s:\n print(a-1,b)\nelse\n print(a,b-1)\n', 's,t = input().split()\na,b = map(int,input().split())\nu = input()\nif s == u:\n a -= 1\nelse:\n b -= 1\nprint("{} {}".format(a,b))\n'] | ['Runtime Error', 'Accepted'] | ['s524859952', 's143649830'] | [3064.0, 2940.0] | [17.0, 18.0] | [176, 131] |
p02777 | u808799019 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split()\nA, B = map(int, input().split())\nU = input()\nif U == S: A -= 1\nelse: B -= 1\nprint(A+B)', 'S, T = input().split()\nA, B = map(int, input().split())\nU = input()\nif U == S: A -= 1\nelse: B -= 1\nprint(A, B)'] | ['Wrong Answer', 'Accepted'] | ['s147821971', 's037276312'] | [2940.0, 2940.0] | [18.0, 17.0] | [112, 113] |
p02777 | u809819902 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['n=int(input())\na=list(map(int,input().split()))\nb=set(a)\nprint("YES" if n == len(b), else "NO")\n', 's,t=input().split()\na,b=map(int,input().split())\nu=input()\nif u==s:\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Runtime Error', 'Accepted'] | ['s757424679', 's824576159'] | [9024.0, 9096.0] | [25.0, 25.0] | [96, 107] |
p02777 | u815304751 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = input().split()\na,b = map(int,input().split())\nu = input()\n\nif u = s:\n print(a-1,b)\nelse:\n print(a,b-1)\n', 's,t = input().split()\na,b = map(int,input().split())\nu = input()\n\nif u == s:\n print(a-1,b)\nelse:\n print(a,b-1)\n'] | ['Runtime Error', 'Accepted'] | ['s096825289', 's607060878'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 117] |
p02777 | u821432765 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['w = input().split()\nprint(w)\nl = [int(i) for i in input().split()]\nl[w.index(input())] -= 1\nprint(*l)', 'A, B = input().split()\na, b = [int(i) for i in input().split()]\ns = input()\nif s==A:\n print(a-1, b)\nelse:\n print(a, b-1)'] | ['Wrong Answer', 'Accepted'] | ['s267865029', 's315701465'] | [2940.0, 2940.0] | [17.0, 17.0] | [101, 126] |
p02777 | u823885866 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['import sys\ns, t = map(str, sys.stdin.readline().split())\na, b = map(int, sys.stdin.readline().split())\nu = sys.stdin.readline()\nif s == u:\n print(a-1, b)\nelse:\n print(a, b-1)\n', 'import sys\ns, t = map(str, sys.stdin.readline().split())\na, b = map(int, sys.stdin.readline().split())\nu = sys.stdin.readline().rstrip()\nif s == u:\n print(a-1, b)\nelse:\n print(a, b-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s153473623', 's852126672'] | [2940.0, 2940.0] | [18.0, 17.0] | [177, 186] |
p02777 | u824144553 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['def resolve():\n import sys\n input = sys.stdin.readline\n \n S, T = input().split()\n A, B = map(int, input().split())\n U = input()\n\n if U == S:\n print("{} {}".format(A-1, B))\n else:\n print("{} {}".format(A, B-1))\n\n\nif __name__ == "__main__":\n resolve()', 'def resolve():\n import sys\n input = sys.stdin.readline\n \n S, T = input().split()\n A, B = map(int, input().split())\n U = input()\n\n if U == S:\n print(A-1, B)\n else:\n print(A, B-1)\n\n\nif __name__ == "__main__":\n resolve()', 'def resolve():\n S, T = input().split()\n A, B = map(int, input().split())\n U = input()\n\n if U == S:\n print("{} {}".format(A-1, B))\n else:\n print("{} {}".format(A, B-1))\n\n\nif __name__ == "__main__":\n resolve()'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s035547316', 's873164170', 's545397101'] | [3060.0, 3060.0, 3060.0] | [17.0, 18.0, 18.0] | [290, 258, 239] |
p02777 | u825078825 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['a=int(input())\nb=list(map(int,input().split()))\ni=0\nj=0\nc="YES" \nfor i in range(a-1):\n for j in range (a-1):\n if b[i]==b[j]\n c="NO" \nprint(c)', 'a=int(input())\nb=list(map(int,input().split()))\ni=0\nc="YES" \nfor i in range(a-1):\n j=i+1\n for j in range (a-1):\n if b[i]==b[j]:\n c="NO" \nprint(c)', 'a,b=input().split()\nA,B=map(int,input().split())\nc=input()\nif a==c:\n A=A-1\nelse:\n B=B-1\nprint(A,B)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s311740323', 's817329072', 's741802890'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [214, 229, 100] |
p02777 | u827261928 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S,T=map(input().split())\nA,B=map(int,input().split())\nU=input()\nif U==S:\n A=A-1\nelse:\n B=B-1\nprint(A,B)', 'S,T=map(str,input().split())\nA,B=map(int,input().split())\nU=input()\nif U==S:\n A=A-1\nelse:\n B=B-1\nprint(A,B)'] | ['Runtime Error', 'Accepted'] | ['s852594157', 's086339148'] | [8944.0, 8960.0] | [25.0, 26.0] | [109, 113] |
p02777 | u829778936 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['n = int(input())\na = input().split()\nb = set(a)\nif len(b)<len(a):\n print("NO")\nelse:\n print("YES")', '\ns, t = input().split()\na,b = map(int, input().split())\nu = input()\nres = {\n s: a,\n t: b\n}\nres[u] -= 1\nprint(res[s], res[t])'] | ['Runtime Error', 'Accepted'] | ['s409760774', 's694404907'] | [2940.0, 2940.0] | [17.0, 18.0] | [104, 130] |
p02777 | u830661255 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split()\nA, B = map(int, input().split())\nU = input()\n \nif S == U :\n print(A - 1)\nelif T == U :\n print(B - 1)', 'S = input()\nT = input()\nA = int(input())\nB = int(input())\nU = input()\n\nif(S == U):\n print(A - 1)\nelif(T == U):\n print(B - 1)', 'S = input()\nT = input()\nA = int(input())\nB = int(input())\nU = input()\n\nif S == U :\n print(A - 1)\nelif T == U :\n print(B - 1)', 'S, T = input().split\nA, B = map(int, input().split)\nU = input()\n\nif S == U :\n print(A - 1)\nelif T == U :\n print(B - 1)', "S = input('S>')\nT = input('T>')\nA = int(input('A>'))\nB = int(input('B>'))\nU = input('U>')\n\nif(U == S):\n print(A-1)\nelif(T == U):\n print(B-1)", "S, T = input().split()\nA, B = map(int, input().split())\nU = input()\n \nif S == U :\n print(str(A - 1) + ' ' + str(B))\nelif T == U :\n print(str(A) + ' ' + str(B - 1))"] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s113963334', 's132943965', 's468435065', 's625405542', 's773919066', 's407774698'] | [9096.0, 9096.0, 9052.0, 8884.0, 9108.0, 9068.0] | [28.0, 29.0, 27.0, 26.0, 26.0, 29.0] | [125, 126, 126, 120, 142, 165] |
p02777 | u831311378 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = map(int,input().split())\na,b = map(int,input().split())\nu = int(input())\nif u==s:\n a=a-1\nelse:\n b=b-1\nprint(a,b)', 's,t = map(int,input().split())\na,b = map(int,input().split())\nu = input()\nif u==s:\n a=a-1\nelse:\n b=b-1\nprint(a,b)', 's,t = input().split()\na,b = map(int,input().split())\nu = input()\nif u==s:\n a=a-1\nelse:\n b=b-1\nprint(a,b)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s035494437', 's501961557', 's765583183'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [120, 115, 106] |
p02777 | u831752983 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t=input().split()\na,b=map(int,input().split())\nu=input()\nprint(a-1,b if s==u else a,b-1)', 's,t=input().split()\na,b=map(int,input().split())\nu=input()\nif s==u:\n print(a-1,b)\nelse:\n print(a,b-1)'] | ['Wrong Answer', 'Accepted'] | ['s999039284', 's581939978'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 103] |
p02777 | u835090251 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t=input().split()\na,b=map(int,input().split())\nu=input()\nif s==u:\n print(s-1 t)\nelse:\n print(s t-1)', 's,t=input().split()\na,b=map(int,input().split())\nu=input()\nif s==u:\n print(a-1,b)\nelse:\n print(a,b-1)\n'] | ['Runtime Error', 'Accepted'] | ['s656012100', 's321794177'] | [8952.0, 9148.0] | [26.0, 26.0] | [103, 104] |
p02777 | u841568901 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['S, T = input().split\nA, B = map(int, input().split)\nU = input()\n\nprint(A-1, B if S ==U else A, B-1)', 'S, T = input().split()\nA, B = map(int, input().split())\nU = input()\n\nprint(A-1, B if S ==U else A, B-1)', 'S, T = input().split()\nA, B = map(int, input().split())\nprint(A-1, B) if input()==S else print(A, B-1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s309361335', 's853474132', 's014712148'] | [2940.0, 2940.0, 9152.0] | [17.0, 17.0, 28.0] | [99, 103, 102] |
p02777 | u851319680 | 2,000 | 1,048,576 | We have A balls with the string S written on each of them and B balls with the string T written on each of them. From these balls, Takahashi chooses one with the string U written on it and throws it away. Find the number of balls with the string S and balls with the string T that we have now. | ['s,t = map(str, input().split())\na,b = map(str, input().split())\nu = input()\nif s == u:\n print("{} {}".format(a-1, b))\nelse:\n print("{} {}".format(a, b-1))', 's,t = map(str, input().split())\na,b = map(int, input().split())\nu = input()\nif s == u:\n print("{} {}".format(a-1, b))\nelse:\n print("{} {}".format(a, b-1))\n'] | ['Runtime Error', 'Accepted'] | ['s512612841', 's501348460'] | [2940.0, 2940.0] | [17.0, 18.0] | [156, 157] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.