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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02723 | u276588887 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s = input()\n\nif s[2]==s[3] ans s[4]==s[5] : print('Yes')\nelse : print('No')", "s = input()\n\nif s[2]==s[3] and s[4]==s[5] : print('Yes')\nelse : print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s286620853', 's060827018'] | [8928.0, 8940.0] | [23.0, 34.0] | [75, 76] |
p02723 | u277920185 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['x=int(input())\ncnt = 0\nq = x // 500\ncnt += (q * 1000)\nw = x % 500\ne = w // 5\ncnt += (e * 5)\nprint(cnt)', "a=list(input())\nif a[2] == a[3] and a[4] == a[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s468488373', 's473628174'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 85] |
p02723 | u283751459 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = list(input())\n\nif s[2] == s[3] & s[4] == s[5]:\n print("Yes")\nelse:\n print("No")', 's = list(input())\n\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s262134558', 's428498716'] | [8896.0, 8948.0] | [28.0, 28.0] | [85, 87] |
p02723 | u283853418 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S =input()\nS =int(S)\na = 0\nb =0\n\nwhile S>=500:\n S -=500\n a +=1\n g =S-(500*a)\n while g>=5:\n g -=5\n b +=1\nh =1000*a +5*b\nprint(h)', 'a = input()\na = list(a)\nif a[2] == a[3] and a[4] ==a[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s073548372', 's760852081'] | [2940.0, 2940.0] | [18.0, 17.0] | [137, 91] |
p02723 | u284927738 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['K, N = map(int, input().split())\n \nA_list = list(map(int, input().split()))\n\ndistance = []\ndiff = 0\n\nfor i in range(0, N):\n \n if i == N-1:\n diff = K + A_list[0] - A_list[i]\n distance.append(diff)\n \n else:\n diff = A_list[i+1] - A_list[i]\n distance.append(diff)\n \n\nprint(sum(distance) - max(distance))', 'S = input()\n\nif (S[2] == S[3]) and (S[4] == S[5]):\n print("Yes")\n \nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s581527694', 's809641288'] | [3060.0, 2940.0] | [18.0, 17.0] | [350, 94] |
p02723 | u288335507 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['x = int(input())\nh = 0\nfh = x // 500\nh += fh * 1000\nr = x % 500\nf = r // 5\nh += f * 5\nprint(h)', "s = input()\nif (s[2] == s[3]) & (s[4] == s[5]):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s387963492', 's006757024'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 86] |
p02723 | u289053627 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['print(True)', 'input_value = input()\n\nprint((input_value[2] == input_value[3]) and (input_value[4] == input_value[5]))', 'input_value = input()\n\nreturn (input_value[2] == input_value[3]) and (input_value[4] == input_value[5])', "input_value = input()\n\nprint(\n 'Yes'\n if (input_value[2] == input_value[3]) and (input_value[4] == input_value[5])\n else\n 'No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s173855943', 's575355877', 's709419548', 's724473844'] | [2940.0, 2940.0, 2940.0, 3068.0] | [17.0, 17.0, 17.0, 18.0] | [11, 103, 103, 132] |
p02723 | u289845051 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\n\n\njudge = (S[2] == S[3] and S[4] == S[5])\n\nprint(judge)', 'S = input()\n\n\njudge = (S[2] == S[3] and S[4] == S[5])\n\nif judge:\n\tprint("Yes")\nelse:\n\tprint("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s054611368', 's233917377'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 98] |
p02723 | u290673589 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s=input()\nif(s[2]==s[3] and s[4]==s[5]):\n print('YES')\nelse:\n print('NO')", "s=input()\nif(s[2]==s[3] and s[4]==s[5]):\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s017991168', 's700196885'] | [2940.0, 2940.0] | [18.0, 17.0] | [79, 79] |
p02723 | u290784570 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['K, N = map(int, input().split())\nA = list(map(int, input().split()))\n\nfor i in range(0, N): \n for j in range(i + 1, N): \n if A[i] + A[j] == K: \n if A[i] > A[j]:\n print(A[i] - A[j])\n else:\n print(A[j] - A[i])', 's = input()\n\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s854822217', 's731870817'] | [3060.0, 2940.0] | [17.0, 17.0] | [293, 85] |
p02723 | u290886932 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S = input()S = input()\n\nif len(S) >= 6:\n if S[2]==S[3] and S[4]==S[5]:\n ret = 'Yes'\n else:\n ret = 'No'\nelse:\n ret = 'No'\nprint(ret)", "S = input()\n \nif len(S) >= 6:\n if S[2]==S[3] and S[4]==S[5]:\n ret = 'Yes'\n else:\n ret = 'No'\nelse:\n ret = 'No'\nprint(ret)"] | ['Runtime Error', 'Accepted'] | ['s668115943', 's859886913'] | [2940.0, 2940.0] | [17.0, 18.0] | [154, 144] |
p02723 | u293177248 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["if s[2] == s[3] and s[4] == s[5]:\n print('Yes')\n", "s = input()\n\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s572328364', 's293695855'] | [2940.0, 2940.0] | [17.0, 17.0] | [51, 86] |
p02723 | u297047173 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = coffee\nif S is coffee-like\n return("Yes")\n else\n print("No")\n \n \n', "def get_count(text):\n if text[2] == text[3] and text[4] == text[5]:\n return 'Yes'\n else:\n return 'No'\n \n \nif __name__ == '__main__':\n string = input().strip()\n \n result = get_count(string)\n print(result)"] | ['Runtime Error', 'Accepted'] | ['s326335924', 's081371189'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 232] |
p02723 | u297089927 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['K,N=map(int,input().split())\nA=list(map(int,input().split()))\nList=[]\nfor i in range(N):\n b=abs(A[i]-A[i-1])\n List.append(b)\nSL=sorted(List)\nprint(K-SL[-1])', 'K,N=map(int,input().split())\nA=list(map(int,input().split()))\nd=0\nfor i in range(N-1):\n b=A[i+1]-A[i]\n if A[i+1]-A[0] >= K/2:\n d=d+A[i]-A[0]+K-A[i+1]\nprint(d)\n ', 'K,N=map(int,input().split())\nA=list(map(int,input().split()))\nd=0\nfor i in range(N-1):\n b=A[i+1]-A[i]\n if d == 0 and A[i+1]-A[0] >= K/2:\n d=d+A[i]-A[0]+K-A[i+1]\nif d == 0:\n d=d+A[N-1]\nprint(d)', 'X,Y,A,B,C=map(int,input().split())\np=sorted(list(map(int,input().split())))\nq=sorted(list(map(int,input().split())))\nr=sorted(list(map(int,input().split())))\nfor i in range(min(X,Y)):\n if p[A-X+i] > q[B-Y+i]:\n if r[-1] >= q[B-Y+i]:\n del q[B-Y+i]\n q.insert(B-Y+i,r[-1])\n del r[-1]\n r.insert(0,0)\n if r[-1] > p[A-X+i]:\n del p[A-X+i]\n p.insert(A-X+i,r[-1])\n del r[-1]\n r.insert(0,0)\n else:\n if r[-1] > p[A-X+i]:\n del p[A-X+i]\n p.insert(A-X+i,r[-1])\n del r[-1]\n r.insert(0,0)\n if r[-1] > q[B-Y+i]:\n del q[B-Y+i]\n q.insert(B-Y+i,r[-1])\n del r[-1]\n r.insert(0,0)\nif X>Y:\n for j in range(X-Y):\n if p[A-X+Y+j] < r[-1]:\n del p[A-X+Y+j]\n p.insert(A-X+Y+j,r[-1])\n del r[-1]\n r.insert(0,0)\nif X<Y:\n for j in range(Y-X):\n if q[B-Y+X+j] < r[-1]:\n del q[B-Y+X+j]\n q.insert(B-Y+X+j,r[-1])\n del r[-1]\n r.insert(0,0)\nP=sorted(p)\nQ=sorted(q)\nsc=0\nfor k in range(X):\n sc+=P[A-X+k]\nfor l in range(Y):\n sc+=Q[B-Y+l]\nprint(sc)\n', 'K,N=map(int,input().split())\nA=list(map(int,input().split()))\nd=0\nfor i in range(N-1):\n if d == 0 and A[i+1]-A[0] >= K/2:\n d=d+A[i]-A[0]+K-A[i+1]\nif d == 0:\n d=d+A[N-1]-A[N-2]\nprint(d)', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s248072558', 's280172147', 's539321739', 's562996690', 's850505453', 's523740109'] | [3060.0, 3060.0, 3060.0, 3192.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [158, 166, 198, 1068, 189, 74] |
p02723 | u303913580 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["p=S\nif p[3]==p[4] and p[5]=p[6]:\n print('Yes')\nelse:\n print('No')\n ", 's=\'S\'\nif s[2]==s[3] and s[4]==s[5]:\n print(\'Yes")\nelse:\n print(\'No\')', "S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s546927074', 's814013984', 's510813145'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [70, 70, 74] |
p02723 | u308914480 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=input()\nif s[3]=s[4] and s[5]=s[6]:\n print("Yes")\nelse:\n print("No")', 's=input()\nif s[3]=s[4] and s[5]=s[6]\n print("Yes")\nelse\n print("No")', 's=input()\nif s[3]=s[4] and s[5]=s[6]:\n print("Yes")\nelse if:\n print("No")', 'S=input()\nif s[3]==s[4] and s[5]==s[6]:\n print("Yes")\nelse:\n print("No")', 's=input()\nif s[2]=s[3] and s[4]=s[5]:\n print("Yes")\nelse:\n print("No")', 's=input()\nif s[2]=s[3] and s[4]=s[5]:\n print("Yes")\n else:\n print("No")', 's=input()\nif s[3]==s[4] and s[5]==s[6]:\n print("Yes")\nelse:\n print("No")', 's=input()\nif s[3]==s[4] and s[5]==s[6]:\n print("Yes")\nelse:\n print("No")', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s044758645', 's223007113', 's238712885', 's491017696', 's657176181', 's691223665', 's731546525', 's873324946', 's988566480'] | [9012.0, 8972.0, 8816.0, 8944.0, 9032.0, 9012.0, 9092.0, 9100.0, 9008.0] | [26.0, 21.0, 27.0, 31.0, 27.0, 20.0, 32.0, 24.0, 27.0] | [70, 68, 73, 74, 72, 76, 74, 74, 74] |
p02723 | u309120194 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S = input()\n\nif S[3] == S[4] and S[5] == S[6]: print('Yes')\nelse: print('No')", "S = input()\n \nif S[2] == S[3] and S[4] == S[5]: print('Yes')\nelse: print('No')"] | ['Runtime Error', 'Accepted'] | ['s289441084', 's987695537'] | [9076.0, 9020.0] | [27.0, 27.0] | [77, 78] |
p02723 | u316649390 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\nif S[3] == S[4] and S[5] == S[6]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nif S[3] == S[4] and S[5] == S[6]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s467385503', 's814207285', 's029529712'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [80, 84, 84] |
p02723 | u323051878 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['list=input().rstrip\nif list[2]==list[3] and list[4]==list[5]:\n\tprint("Yes")\nelse:\n\tprint("No")\n ', 'list=input().rstrip()\nif list[2]==list[3] and list[4]==list[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s752948426', 's638860074'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 98] |
p02723 | u323531048 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['[N, X, Y] = input().split()\nN = int(N)\nX = int(X)\nY = int(Y)\ndist_list = []\n\nfor i in range(N):\n for j in range(i+1, N):\n a = j - i\n b = abs(i+1 - X) + abs(j+1 -Y) + 1\n if a > b:\n dist_list.append(b)\n else:\n dist_list.append(a)\n\nfor k in range(N-1):\n print(dist_list.count(k+1))\n\n', 'S = input()\n\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s780679625', 's292690057'] | [3064.0, 3068.0] | [17.0, 17.0] | [336, 85] |
p02723 | u325270534 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['K, N = input().split()\ni, lists = 0, []\nwhile i < N:\n lists.append(eval(input()))\n i += 1\nif 0 in lists:\n lists.remove(0) \nprint(max(lists) - min(lists))', 'string = input("").lower()\nprint("Yes" if string[3] == string[4] and string[5] == string[6] else "No")', 'string = input("").lower()\nprint("Yes" if (string[2] == string[3]) and (string[4] == string[5]) else "No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s004764203', 's792691102', 's779477956'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [161, 102, 106] |
p02723 | u327532412 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S = list(input())\nif S[3] == S[4] and S[3] == S[4]:\n print('Yes')\nelse:\n print('No')", "S = list(input())\nif S[3] == S[4] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')", "\nS = list(input())\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s238161888', 's313204226', 's353276342'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [90, 90, 91] |
p02723 | u328755070 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print("yes")\n \nelse:\n print("No")\n', 'S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\n \nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s446754541', 's406853282'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 90] |
p02723 | u329817560 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['# coding: utf-8\n# Your code here!\ns = input()\nprint(s[2]==s[3] and s[4]==s[5])\n', "# coding: utf-8\n# Your code here!\ns = input()\nret = 'No'\nif s[2]==s[3] and s[4]==s[5]:\n ret = 'Yes'\nprint(ret)\n"] | ['Wrong Answer', 'Accepted'] | ['s724313812', 's704938846'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 114] |
p02723 | u331213700 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['n=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")\n ', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")\n \n'] | ['Runtime Error', 'Accepted'] | ['s749174781', 's701607394'] | [9016.0, 9052.0] | [23.0, 30.0] | [77, 78] |
p02723 | u331997680 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\n \nif (S[2] = S[3] and S[4] = S[5]):\n print("Yes")\nelse:\n print("No")', 'a = input()\n\nif (a[2] = a[3] and a[4] = a[5]):\n print(Yes)\nelse:\n print(No)', 'S = input()\n \nif (S[2] = S[3] and S[4] = S[5]):\n print(Yes)\nelse:\n print(No)', 'S = input()\n \nif (S[2] == S[3] and S[4] == S[5]):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s571754696', 's628606465', 's721659854', 's621045897'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 22.0] | [82, 77, 78, 84] |
p02723 | u334242570 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=input()\nfor i in range(0,6):\n if(s[3]==s[4] and s[4]==s[5]):\n print("Yes")\n break\n else:\n print ("No")\n break\n', 's=input()\nfor i in range(0,6):\n if(s[3]==s[4] and s[4]==s[5]):\n print("yes")\n break\n else:\n print ("no")\n break', 's=input()\nfor i in range(0,6):\n if(s[2]==s[3] and s[4]==s[5]):\n print("Yes")\n break\n else:\n print ("No")\n break\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s571498752', 's774184546', 's079057780'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [126, 125, 126] |
p02723 | u335012204 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['# -*- coding: utf-8 -*-\nS= input()\nS_list = list(S)\nprint(S_list)\nif S_list[2] == S_list[3]:\n if S_list[4] == S_list[5]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")', 'S= input()\nS_list = list(S)\nprint(S_list)\nif S_list[2] == S_list[3]:\n if S_list[4] == S_list[5]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")', '# -*- coding: utf-8 -*-\nS= input()\nS_list = list(S)\nprint(S_list)\nif S_list[2] == S_list[3]:\n if S_list[4] == S_list[5]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")', '# -*- coding: utf-8 -*-\nS= input()\nS_list = list(S)\nif S_list[2] == S_list[3]:\n if S_list[4] == S_list[5]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s007072059', 's396688074', 's773878004', 's790747114'] | [2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [196, 172, 196, 182] |
p02723 | u342353677 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s=input()\nif s[-2]==s[-3] and s[-4]==s[-5]:\n print('Yes')\nelse:\n print('No')", "s=input()\nif s[-2]==s[-3] and s[-4]==s[-5]:\n print('Yes')\nelse:\n print('No')", "s=input()\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s455303917', 's855051270', 's499977101'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [78, 78, 74] |
p02723 | u344959886 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=input()\nif s[2]==[3] and s[4]==[5]:\n print("Yes")\nelse:\n print("No")', 's=input()\n\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s699592687', 's084974090'] | [2940.0, 2940.0] | [18.0, 17.0] | [72, 76] |
p02723 | u346266986 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['word = input()\nprint("yes" if(word[2] == word[3] and word[4] == word[5]) else "No")', 'word = input()\nprint("yes") if(word[2] == word[3] and word[4] == word[5]) else print("No")\n\n\n', 'word = input()\nprint("yes" if(word[2] == word[3] and word[4] == word[5]) else "No")\n\n\n', 'word = input()\nprint("Yes" if(word[2] == word[3] and word[4] == word[5]) else "No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s351343258', 's488126467', 's589627182', 's763780767'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0] | [83, 93, 86, 83] |
p02723 | u347920118 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['cf =list(input())\n\nif cf[2]=cf[3] and cf[4]=cf[5]:\n print("Yes")\nelse:\n print("No")', 'cf =list(input())\n\nif cf[2]==cf[3] and cf[4]==cf[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s568759656', 's648059579'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 90] |
p02723 | u348728239 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S = input()\nS= list(S)\nif S[2]==S[3] and S[4]==S[5]:\n print('yes')\nelse: \n print('no')", "S = input()\nS= list(S)\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse: \n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s981750427', 's419783184'] | [2940.0, 2940.0] | [17.0, 17.0] | [88, 88] |
p02723 | u349753002 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\nfor i in range(0, len(S)):\n if ((S[2]==S[3])&(S[4]==S[5])):\n print("yes")\n break\n else:\n print("No")\n break', 'S = input()\nfor i in range(0, len(S)):\n if ((S[2]==S[3])&(S[4]==S[5])):\n print("Yes")\n break\n else:\n print("No")\n break'] | ['Wrong Answer', 'Accepted'] | ['s212700744', 's267995309'] | [2940.0, 3060.0] | [17.0, 19.0] | [153, 153] |
p02723 | u350093546 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s=input()\n\nif s[2]==s[3] and s[4]=s[5]:\n print ('Yes')\n\nelse:\n print('No')", "s=input()\n\nif s[2]==s[3] and s[4]==s[5]:\n print ('Yes')\n\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s745268854', 's219902445'] | [2940.0, 2940.0] | [17.0, 18.0] | [76, 78] |
p02723 | u354623416 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['https://atcoder.jp/contests/abc160/tasks/abc160_a', 'S = input()\n \nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s931141327', 's088668030'] | [2940.0, 2940.0] | [17.0, 17.0] | [49, 82] |
p02723 | u355154595 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S=input()\nif S[2]==s[3] and S[4]==s[5]:\n print('Yes')\nelse:\n print('No')", "S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s795802867', 's002262467'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 79] |
p02723 | u357120030 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\ncheck = S[2] == S[4] and S[3] == S[5]\n\nprint("Yes" if check else "No")', 'S = int(input())\n\ncheck = S[2] == S[3] and S[4] == S[5]\n\nprint("Yes" if check else "No")', 'S = int(input())\n\ncheck = S[2] == S[4] and S[3] == S[5]\n\nprint("Yes" if check else "No")', 'S = input()\n\ncheck = S[2] == S[3] and S[4] == S[5]\n\nprint("Yes" if check else "No")'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s762041285', 's986145420', 's995576268', 's966253087'] | [9096.0, 9092.0, 9160.0, 8936.0] | [28.0, 33.0, 20.0, 25.0] | [82, 88, 88, 83] |
p02723 | u357240307 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["if s[2] == s[3] & s[4] == s[5]:\n print('Yes')\nelse:\n print('No')", "s = input()\n\nif s[2] == s[3] & s[4] == s[5]:\n print('Yes')\nelse:\n print('No')", 'x = input()\n \nhappyPoints = 0\n \ny = x - (x % 500)\n \nif x % 500 !== x:\n happyPoints += (x/500)*1000\n \tif y % 5 !== y:\n z = y - (y % 5)\n happyPoints += y\nelif x % 5 !== x:\n w = x - (x % 5)\n happyPoints += w\n \n print(happyPoints)\n', 'x = input()\n \nhappyPoints = 0\n \ny = x - (x % 500)\n \nif x % 500 !== x:\n happyPoints += (x/500)*1000\n \tif y % 5 !== y:\n z = y - (y % 5)\n happyPoints += y\nelif x % 5 !== x:\n w = x - (x % 5)\n happyPoints += w\n \n print(happyPoints)\n', "s = input()\n \nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s169793489', 's213936790', 's246752645', 's918755912', 's604117770'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [66, 79, 242, 242, 82] |
p02723 | u357289011 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s = input()\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse\n print('No')", "s = input()\nif s[2] = s[3] and s[4] = s[5]:\n print('Yes')\nelse\n print('No')", "s = input()\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s361145436', 's460885842', 's317833234'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [83, 81, 84] |
p02723 | u358747500 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['n, x, y = map(int, input().split())\nli = [0] * (n-1)\nfor i in range(1, n+1):\n for j in range(i+1, n+1):\n num = min(j-i, abs(x-i)+abs(y-j)+1)\n li[num-1] += 1\nfor i in range(n-1):\n print(li[i])', "s=input()\nif (s[2]==s[3] and s[4]==s[5]):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s886042369', 's994792633'] | [3060.0, 2940.0] | [17.0, 17.0] | [199, 76] |
p02723 | u358957649 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = input\nprint("Yes" if s[2]==s[3] and s[4]==s[5] else "No")', 's = input()\nprint("Yes" if s[2]==s[3] and s[4]==s[5] else "No")'] | ['Runtime Error', 'Accepted'] | ['s538035584', 's000624167'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 63] |
p02723 | u359048838 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s=input();\nans =0\nfor n in set(i for i in s[2::]):\n if s.count(n)==2:\n ans+=1\nprint('Yes' if ans>1 else 'No'", "s=input()[2::];print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 else 'No')"] | ['Runtime Error', 'Accepted'] | ['s811980078', 's490229503'] | [2940.0, 2940.0] | [17.0, 17.0] | [112, 82] |
p02723 | u362563655 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=list(input())\nif s[3]==s[4] and s[5] == s[6]:\n print("Yes")\nelse:\n print("No")', 's=list(input())\nif s[2]==s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s096968828', 's149019260'] | [3064.0, 3064.0] | [17.0, 19.0] | [82, 82] |
p02723 | u363080243 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['N = str(input("Enter something:"))\n if N[3] == N[4] and N[5] == N[6]:\n print("yes")\n else:\n print("No")', 'print yes or no"""\nN = str(input("Enter something:"))\nfor str in N:\n if N[3] == N[4] and N[5] == N[6]:\n print("yes")\n else:\n print("No")', "if s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')", '"""print yes or no"""\nN = str(input("Enter something:"))\nfor str in N:\n if N[3] == N[4] and N[5] == N[6]:\n print("yes")\n else:\n print("No")', "s = input()\nif s[2] == s[3] and s[4] == s[5]:\n\tprint('Yes')\nelse:\n\tprint('No')\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s206781816', 's520341324', 's562882897', 's639110194', 's247179921'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0] | [123, 156, 68, 159, 79] |
p02723 | u365243017 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\nif S[2] = S[3] and S[4] = S[5]:\n print(Yes)\nelse if:\n print(No)\n', "S = input()\nIf S[2]=S[3] and S[4]=S[5]:\n print('Yes')\nelse:\n print('No')\n ", 'S = input()\nif S[2] = S[3] and S[4] = S[5]:\n print(Yes)\nelse:\n print(No)\n', 'S=int(input())\na=S//500\nb=S%500\nc=b//5\nprint(a*1000+c*5)\n', "S=input()\nIf S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')\n \n", 'a,b=divmod(int(input()),500)\nprint(a*1000+(b//5)*5)\n', 'S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print(Yes)\nelse:\n print(No)\n', "S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')\n \n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s371994939', 's398187044', 's449165590', 's669426249', 's680016280', 's860943104', 's913425361', 's126008192'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [78, 77, 75, 57, 78, 52, 77, 78] |
p02723 | u365770301 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=int(input())\n\nn=list(s)\n\nif n[2]==n[3] and n[4]==n[5]:\n print("Yes")\nelse:\n print("No")', 's=input()\n\n\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s193680493', 's432113474'] | [2940.0, 2940.0] | [18.0, 17.0] | [91, 76] |
p02723 | u366344215 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["if txt[2] == txt[3] and txt[4] == txt[5]:\n print('Yes')\nelse :\n print('No')\n", "txt = input()\n\nif txt[2] == txt[3] and txt[4] == txt[5]:\n print('Yes')\nelse :\n print('No')\n\n\n\n"] | ['Runtime Error', 'Accepted'] | ['s449406628', 's304680100'] | [2940.0, 2940.0] | [17.0, 18.0] | [82, 100] |
p02723 | u373858851 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["k,n=map(int,input().split())\nhouses=list(map(int,input().split()))\nhouses.sort()\nmaxx=-float('INF')\nfor i in range(n-1):\n if houses[i+1]-houses[i]>maxx:\n maxx=houses[i+1]-houses[i]\n\nmaxx=max([maxx,k-(houses[-1]-houses[0])])\nprint(maxx)\n", 's=input()\n\nif s[2]==s[3]:\n if s[4]==s[5]:\n print("Yes")\n else:\n print(\'No\')\nelse:\n print(\'No\')\n'] | ['Runtime Error', 'Accepted'] | ['s938020487', 's728463495'] | [3060.0, 2940.0] | [17.0, 17.0] | [246, 104] |
p02723 | u374765578 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = str(input())\nif(s[2] == s[3] and s[4] == s[5]):\n print("yes")\n\nelse:\n print("no")', 's = str(input())\nif(s[2] == s[3] and s[4] == s[5]):\n print("Yes")\n\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s721805312', 's123208116'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 92] |
p02723 | u376754170 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["inp = input()\nprint('Yes' if inp[3] == inp[4] and inp[5] == inp[6] else 'No')", "inp = input()\nprint('Yes' if inp == 'coffee' else 'No')", 'k, n = map(int, input().split())\nhome_positions = list(map(int, input().split()))\n\n\ndef max_distance_homes(homes):\n max_distance = 0\n for i in range(len(homes) - 1):\n distance = homes[i + 1] - homes[i]\n if max_distance < distance:\n max_distance = distance\n distance = k + homes[0] - homes[-1]\n if max_distance < distance:\n max_distance = distance\n return max_distance\n\n\nprint(k - max_distance_homes(home_positions))', "inp = input()\nprint('Yes' if inp[2] == inp[3] and inp[4] == inp[5] else 'No')"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s535275738', 's651488667', 's830603074', 's295888817'] | [2940.0, 2940.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0, 18.0] | [77, 55, 462, 77] |
p02723 | u378782369 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['user_input = input()\ncoffee = "coffee"\nis_same = [2,3,4,5]\nis_sim = True\n\nfor i in is_same:\n if not (user_input[i] == coffee[i]):\n is_sim = False\n\nif is_sim:\n print("Yes")\nelse:\n print("No")', 'usr = input()\narr = [2,4]\nbol = True\n\nfor i in arr:\n if not (usr[i] == usr[i+1]):\n bol = False\n\nif bol:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s794328173', 's798232863'] | [3064.0, 2940.0] | [18.0, 17.0] | [206, 152] |
p02723 | u384122990 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['K, N = map(int,input().split())\nA = list(map(int, input().split()))\nList = []\n\nfor i in range(1, N):\n List.append(A[i] - A[i-1])\n \nd = K - A[-1] + A[0]\nList.append(d)\nList.sort()\nprint(sum(List[:-1]))\n ', 'S = input()\n\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")\n '] | ['Runtime Error', 'Accepted'] | ['s706224246', 's270616971'] | [3060.0, 2940.0] | [17.0, 17.0] | [205, 86] |
p02723 | u388297793 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=int(input())\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s147339845', 's735446179'] | [9064.0, 8876.0] | [23.0, 28.0] | [83, 78] |
p02723 | u388458865 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['a,b,c,d,e,f = input()\nif (c==d) and (e==f) : print("Yes")\nelse print("No")', 'n = input()\nprint (list (n))', 'cin >>> a,b,c,d,e,f;\nif c=d and e=f : cout <<< "Yes"\nelse : cout <<< "No"', 'a,b,c,d,e,f = input()\nif (c==d) and (e==f) : print("Yes")\nelse : print("No")'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s445350902', 's761762310', 's939770464', 's691867643'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [74, 28, 73, 76] |
p02723 | u389135205 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['k,n = map(int,input().split())\npos = list(map(int,input().split()))\n\n\n\n\n\nsubtract = []\nfor i in range(n-1):\n subtract.append(pos[i+1]-pos[i])\n\n(posの終点～posの始点)\nsubtract.append(k-pos[n-1]+pos[0])\n\n\nidx = subtract.index(max(subtract))\n\nif idx == 0:\n rsl = k-pos[idx-1]+pos[0]\nelse:\n rsl = pos[n-1]-pos[0]\n\nprint(rsl)', 'str = input()\n\nif str[2] == str[3] and str[4] == str[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s690654837', 's158929206'] | [3064.0, 2940.0] | [17.0, 17.0] | [559, 95] |
p02723 | u392172834 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['money = int(input())\n \nhappy = 0\n \nhappy += int((money / 500) * 1000)\n \nmoney -= (money / 500) * 500\n \nhappy += int((money / 5) * 5)\n \nprint(happy)', "string = input()\nif string[2] == string[3] and string[4] == string[5]:\n\tprint('Yes')\nelse:\n \tprint('No')"] | ['Runtime Error', 'Accepted'] | ['s407171892', 's949374059'] | [2940.0, 2940.0] | [17.0, 18.0] | [147, 105] |
p02723 | u394244719 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = str(input())\nif s[2] == s[3] and s[4] = s[5]:\n print("Yes")\nelse:\n print("No")\n', 's = str(input())\nprint("Yes") if s[2] == s[3] and s[4] == s[5] else print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s192986807', 's772700956'] | [2940.0, 3064.0] | [17.0, 17.0] | [89, 80] |
p02723 | u394520553 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["x=[x for x in input()]\nif(x[3]==x[4] and x[5]==x[6]):\n print('Yes')\nelse:\n print('No')", "x=input()\nif(x[2]==x[3] and x[4]==x[5]):print('Yes')\nelse:print('No')"] | ['Runtime Error', 'Accepted'] | ['s629185794', 's791803759'] | [2940.0, 2940.0] | [18.0, 17.0] | [92, 69] |
p02723 | u398355880 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['a=input()\nif a[0]==a[1] and a[2]==a[3] and a[4]==a[5]:\n print("Yes")\nelse:\n print("No")', 'a=input()\nif a[2]==a[3] and a[4]==a[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s856708465', 's248045171'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 74] |
p02723 | u402342597 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["str = input()\n\nstr_list = list(str)\n\nif str_list[2] == str_list[3] & str_list[4] == str_list[5]:\nprint('Yes')\nelse:\nprint('No')\n\n", "str = input()\n\nstr_list = list(str)\n\nif str_list[2] == str_list[3] && str_list[4] == str_list[5]:\nprint('Yes')\nelse:\nprint('No')\n\n", "str = input()\n \nif str[2] == str[3] and str[4] == str[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s546278977', 's635298934', 's278328357'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [129, 130, 98] |
p02723 | u404794295 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S=input()\nif S[2]==[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")', 'S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s929145419', 's637267871'] | [2940.0, 2940.0] | [17.0, 17.0] | [77, 78] |
p02723 | u408849410 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S = list(input())\n\nif S[2]==S[3]:\n\tif S[4] == S[5]:\n \tprint('Yes')\n\telse:\n print('No')\nelse:\n print('No')\n \n\n\n", "S= list(input())\n \nif S[2]==S[3]:\n if S[4] == S[5]:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s046441034', 's647806871'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 125] |
p02723 | u410558877 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['X = int(input())\n\nnum1000 = X // 500\nr500 = X % 500\nnum5 = r500 // 5\n\nprint(num1000 * 1000 + num5 * 5)\n', "S = input()\n\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s579932983', 's460725908'] | [9060.0, 9044.0] | [24.0, 26.0] | [103, 85] |
p02723 | u412197640 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = input()\nif s[3] == s[4] and s[5] == s[6]:\n print("Yes")\nelse:\n print("No")\n', 's = input()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s403935278', 's572081157'] | [2940.0, 2940.0] | [17.0, 18.0] | [85, 85] |
p02723 | u421308322 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['import sys\nfrom io import StringIO\nimport unittest\n\ndef resolve():\n word = input()\n if word[2] == word[3] and word[4] == word[5]:\n print(\'Yes\')\n else:\n print(\'No\')\n\nclass TestClass(unittest.TestCase):\n def assertIO(self, input, output):\n stdout, stdin = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n resolve()\n sys.stdout.seek(0)\n out = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = stdout, stdin\n self.assertEqual(out, output)\n def test_入力例_1(self):\n input = \n output = """Yes"""\n self.assertIO(input, output)\n def test_入力例_2(self):\n input = """iphone"""\n output = """No"""\n self.assertIO(input, output)\n def test_入力例_3(self):\n input = """coffee"""\n output = """Yes"""\n self.assertIO(input, output)\n\nif __name__ == "__main__":\n unittest.main()', "def resolve():\n word = input()\n if word[2] == word[3] and word[4] == word[5]:\n print('Yes')\n else:\n print('No')", 'import sys\nfrom io import StringIO\nimport unittest\n\ndef resolve():\n word = input()\n if word[2] == word[3] and word[4] == word[5]:\n print(\'Yes\')\n else:\n print(\'No\')\n\nif __name__ == "__main__":\n resolve()'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s207507096', 's666139234', 's626972453'] | [5716.0, 2940.0, 5716.0] | [46.0, 17.0, 42.0] | [956, 134, 228] |
p02723 | u422977492 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=input()\nif(s[3]==s[4] and s[5]==[6]):\n print("Yes")\nelse:\n print("No")', 'n=list(input())\nif n[2]==n[3] and n[4]==n[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s513663297', 's414607835'] | [9000.0, 2940.0] | [28.0, 17.0] | [74, 80] |
p02723 | u425762225 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['#!/usr/bin/env python3\n\ndef main():\n S = input()\n if S[2]==S[3] and S[4]==S[5]:\n print("Yes")\n else:\n print("No")\n\nif \'__name__\' == \'__main__\':\n main()\n', 'S = input()\n\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s852459459', 's015545585'] | [2940.0, 2940.0] | [17.0, 17.0] | [178, 77] |
p02723 | u426175055 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['from collections import defaultdict\nN,X,Y = map(int,input().split())\n\nk = defaultdict(lambda: 0)\n\nfor i in range(N-1):\n for j in range(i+1,N):\n dist = min( j-i , abs(X-1-i)+1+abs(Y-1-j) , abs(Y-1-i)+1+abs(X-1-j) )\n k[dist] += 1\n\nfor i in range(1,N+1):\n print(k[i])\n', "S = input()\n\nif S[2]==S[3] and S[4]==S[5]:\n print('yes')\nelse:\n print('No') \n", "S = input()\n\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s311110641', 's390850893', 's698727750'] | [3316.0, 2940.0, 2940.0] | [21.0, 17.0, 18.0] | [285, 86, 82] |
p02723 | u426205961 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['coffee = str(input())\niff3 = coffee[3]\niff4 = coffee[4]\niff5 = coffee[5]\niff6 = coffee[6]\nif iff3 == iff4 :\n if iff5 == iff6 :\n print("Yes")\n if iff5 != iff6 :\n print("No")\nif iff3 != iff4:\n print("No")', 'a = input()\niff3 = a[2]\niff4 = a[3]\niff5 = a[4]\niff6 = a[5]\nif iff3 == iff4 :\n if iff5 == iff6 :\n print("Yes")\n else :\n print("No")\nelse :\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s283915650', 's342891662'] | [9012.0, 9052.0] | [22.0, 26.0] | [225, 174] |
p02723 | u426506117 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S=input()\nif S[2]==S[3]andS[4]==S[5]:\n print("Yes")\nelse:\n print("No")', 'S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")\n\n'] | ['Runtime Error', 'Accepted'] | ['s185738897', 's890430982'] | [8920.0, 8908.0] | [20.0, 26.0] | [72, 76] |
p02723 | u429029348 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['X=int(input())\nprint(X//500*1000+X%500//5*5)', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n ans="Yes"\nelse:\n ans="No"\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s984335406', 's594261355'] | [2940.0, 2940.0] | [18.0, 17.0] | [44, 79] |
p02723 | u431349272 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["if S[2]==S[3] and S[4]=S[5]:\n print('Yes')\nelse:\n print('No')", "S = input()\nif S[2]==S[3] and S[4]=S[5]:\n print('Yes')\nelse:\n print('No')", "if S[3]==S[4] and S[5]=S[6]:\n print('Yes')\nelse:\n print('No')", "S = input()\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s258191841', 's383719600', 's641397179', 's980774377'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [67, 79, 67, 80] |
p02723 | u433371341 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["string = input()\n\nif string[2] == string[3] and string[4] == string[5]:\n print 'Yes'\nelse:\n print 'No'", "string = input()\n\nif string[2] == string[3] and string[4] == string[5]:\n print('Yes')\nelse:\n print('No')\n\n"] | ['Runtime Error', 'Accepted'] | ['s221053779', 's005405406'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 108] |
p02723 | u434311880 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = list(input())\nif S[4] == S[5] and S[2] == S[3]:\n print("Yes")\nelse:\n print("No")\nprint(S)\n', 'S = list(input())\nif S[4] == S[5] and S[2] == S[3]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s889603260', 's071232500'] | [2940.0, 3064.0] | [17.0, 19.0] | [100, 90] |
p02723 | u440608859 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=str(input())\nif s[2]==s[3] and s[4]==s[5]:\n print("YES")\nelse:\n print("NO")', 's=str(input())\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s888675528', 's886370481'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 83] |
p02723 | u440613652 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['k,n=map(int,input().split())\narr=list(map(int,input().split()))\n\nfor i in range(n-1):\n\tarr.append(arr[i]+k)\n\nmin_=99999999999\n\nfor i in range(n):\n\tif arr[i+n-1]-arr[i]<min_:\n\t\tmin_=arr[i+n-1]-arr[i]\n\n\nprint(min_)', 's=input()\n\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No") '] | ['Runtime Error', 'Accepted'] | ['s686648003', 's126402461'] | [9036.0, 9120.0] | [26.0, 26.0] | [212, 76] |
p02723 | u441246928 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S = input()\nif S[3] == S[4] and S[5] == S[6] :\n print( 'Yes' )\nelse :\n print( 'No' )", "S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print( 'Yes' )\nelse :\n print( 'No' )"] | ['Runtime Error', 'Accepted'] | ['s479007339', 's649765849'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 89] |
p02723 | u441902623 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['cof = input()\nif cof[2] == cof[3] & cof[4] == cof[5]:\n print("Yes")\nelse:\n print("No")', 'cof = input()\nif cof[2] == cof[3] and cof[4] == cof[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s949910265', 's934893980'] | [8768.0, 9012.0] | [32.0, 27.0] | [88, 90] |
p02723 | u452157159 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = f"@{input()}"\nprint(s[3] == s[4] and s[5] == s[6])', 's = f"@{input()}"\nprint((s[3] == s[4] and s[5] == s[6]) and "Yes" or "No")\n'] | ['Wrong Answer', 'Accepted'] | ['s928743863', 's531273668'] | [9092.0, 9080.0] | [30.0, 28.0] | [54, 75] |
p02723 | u452269253 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = int(input())\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s294713600', 's726834457'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 84] |
p02723 | u452512115 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No"', "X = int(input())\nif n==17:\n print('YES')\n \nelse:\n print('NO')", 'S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s242176021', 's752727493', 's271234573'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [79, 64, 80] |
p02723 | u452913314 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['S = input()\n\nif(S[2]==S[3] and S[4]==S[5]):\n print("yes")\n exit()\n\nprint("No")', 'S = input()\n\nif(S[2]==S[3] and S[4]==S[5]):\n print("Yes")\n exit()\n\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s076790707', 's957150520'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 84] |
p02723 | u456376495 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = input()\n\nif s[2] == s[3] and [4] == s [5]:\n print("Yes")\nelse:\n print("No")', 's = input()\n\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s069026901', 's458165639'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 81] |
p02723 | u457953718 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["# -*- coding: utf-8 -*-\n# get a integer\na = input()\n# output\nif len(a) == 6 and a[2] == a[3] and a[4] == a[5]:\n\tprint('Yes')\nelse\n\tprint('No')", '# -*- coding: utf-8 -*-\n# get a integer\na = raw_input()\n# output\nprint(len(a) == 6 and a[2] == a[3] and a[4] == a[5])', '# -*- coding: utf-8 -*-\n# get a integer\na = input()\n# output\nprint(len(a) == 6 and a[2] == a[3] and a[4] == a[5])', "# -*- coding: utf-8 -*-\n# get a integer\na = input()\n# output\nif len(a) == 6 and a[2] == a[3] and a[4] == a[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s275235368', 's639181943', 's697358716', 's624846051'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [142, 117, 113, 149] |
p02723 | u459554582 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['def merge(A,B):\n C = []\n \n while len(A)!=0 and len(B) != 0:\n if A[0]>B[0]:\n C.append(A[0])\n del A[0]\n else:\n C.append(B[0])\n del B[0]\n\n if len(A)>len(B):\n C.extend(A)\n else:\n C.extend(B)\n\n return C\n\nif __name__ == "__main__":\n X,Y,A,B,C = map(int,input().split())\n P = list(map(int,input().split()))\n Q = list(map(int,input().split()))\n R = list(map(int,input().split()))\n\n \n # P = [1,23,4,1,2]\n # Q = [4,3,56]\n # R = [70,20,1]\n\n P.sort(reverse=True)\n Q.sort(reverse=True)\n R.sort(reverse=True)\n\n S = merge(P[:X],Q[:Y])\n S = merge(S,R)\n \n score = 0\n for i in range(X+Y):\n score += S[i]\n print(score)\n\n', "S = input()\n\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s517717172', 's396664079'] | [3064.0, 2940.0] | [18.0, 17.0] | [763, 85] |
p02723 | u460386402 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s=input()\nif s[3]==s[4] and s[5]==s[6]:\n print('Yes')\n exit()\n \nprint('No')", 'k,n=map(int,input().split())\na=list(map(int,input().split()))\nb=0\ns=[0]*n\n\nfor i in range(n-1):\n s[i]=a[i+1]-a[i]\n\nfor i in range(n):\n if s[i]<k/3:\n b=b+s[i]\n else:\n con=k-s[i]\n print(con)\n exit()\n \nprint(b)', "s=input()\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s358583980', 's475349147', 's997989697'] | [2940.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0] | [78, 260, 74] |
p02723 | u465101448 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["S=input()\nans='no'\n\nif S[2]==S[3] and S[4]==S[5]:\n ans='yes'\n \nprint(ans)", "S=input()\nans='no'\n\nif S[2]==S[3] or S[4]==S[5]:\n ans='yes'\n \nprint(ans)", "S=input()\nans='No'\n\nif S[2]==S[3] and S[4]==S[5]:\n ans='Yes'\n \nprint(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s831107524', 's876176624', 's043441264'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [79, 78, 79] |
p02723 | u471539833 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['X,Y,A,B,C=map(int,input().split())\np=list(map(int,input().split()))\nq=list(map(int,input().split()))\nr=list(map(int,input().split()))\n\np.sort()\nq.sort()\np.reverse()\nq.reverse()\n\na=p[:]\na.extend(q)\na.extend(r)\na.sort()\na.reverse()\nb=q[:]\nb.extend(r)\nb.sort()\nb.reverse()\nc=p[:]\nc.extend(r)\nc.sort()\nc.reverse()\nred=0\ngreen=0\nsum=0\nsum1=0\nsum2=0\nd=0\nfor i in range((X+Y)*2):\n if(a[i] in p):\n red+=1\n elif(a[i] in q):\n green+=1\n d+=a[i]\n if(red>X and i-X-Y+1+green==Y):\n break\n if(i<X):\n sum1+=p[i]\n sum2+=c[i]\n if(i<Y):\n sum1+=b[i]\n sum2+=q[i]\n if(i==X+Y and red<=X and green<=Y):\n print(sum)\n break\n if(red>X and i-X-Y+1+green==Y):\n print(sum1)\n break\n elif(green>Y and i-X-Y+1+red==X):\n print(sum2)\n break', 's=input()\n\nif(s[2]==s[3]and s[4]==s[5]):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s076368094', 's301949224'] | [3064.0, 2940.0] | [17.0, 18.0] | [761, 75] |
p02723 | u472696272 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s = input().split()\ns = [i for i in s]\n\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')", "s = list(input())\n\nif s[0]!=s[1] and s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s915373854', 's430730056'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 99] |
p02723 | u474122160 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['a=input()\nfor i in range(0,int(len(a))):\n if(a[2]==a[3]):\n\tif(a[4]==a[5]):\n print("YES")\n else:\n print("NO")\n else:\n print("NO)\n ', 'a=input()\nif((a[2]==a[3])and(a[4]==a[5])):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s187981970', 's167660161'] | [2940.0, 2940.0] | [17.0, 17.0] | [148, 82] |
p02723 | u474561976 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['n, k = map(int, input().split(" "))\nhouses = list(map(int, input().split(" ")))\ndif_houses = [houses[x+1]-houses[x] for x in range(k-1)]\ndif_houses.append(houses[0]-houses[k-1]+n)\n\nmax_dif = max(dif_houses)\nprint(n-max_dif)', 's = input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s890822892', 's207427346'] | [3060.0, 2940.0] | [17.0, 17.0] | [223, 80] |
p02723 | u479353489 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s=input()\nreturn s[2]==s[3] and s[4]==s[5]', 's=input()\nprint(s[2]==s[3] and s[4]==s[5])', 'S = input()\nprint("Yes" if S[2]==S[3]and S[4]==S[5] else "No")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s313585548', 's549932161', 's141735762'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [42, 42, 62] |
p02723 | u480264129 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s=input()\nprint('Yse' if s[2] is s[3] and s[4] is s[5] else 'No')", "s=input()\nprint('Yes' if s[2] in s[3] and s[4] in s[5] else 'No')"] | ['Wrong Answer', 'Accepted'] | ['s916869176', 's640674870'] | [2940.0, 2940.0] | [18.0, 18.0] | [65, 65] |
p02723 | u482522932 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = input()\nif s[2]==s[3] and s[4]==s[5]:\n print(Yes)\nelse:\n print(No)', 's = str(input())\nif s[2]==s[3] and s[4]==s[5]:\n print(Yes)\nelse:\n print(No)', 's = str(input())\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s272295088', 's500678755', 's518496372'] | [2940.0, 2940.0, 3060.0] | [18.0, 17.0, 19.0] | [76, 81, 85] |
p02723 | u482883507 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['n=input()\nif a[2]==a[3] and a[4]==a[5]:\n print("Yes")\nelse:\n print("No")', 'a=input()\nif a[2]==a[3] and a[4]==a[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s737374510', 's863423573'] | [2940.0, 2940.0] | [18.0, 17.0] | [74, 75] |
p02723 | u487044452 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['X,Y,A,B,C = map(int,input().split())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\nC_copy = C.copy()\nfor i in range(30):\n C_copy.append(0)\n C.append(0)\nux_1 = 0\nuy_1 = 0\nfor i in range(X):\n ux_1 += max(max(A),max(C_copy))\n if max(A) >= max(C_copy):\n A.pop(A.index(max(A)))\n else:\n C_copy.pop(C_copy.index(max(C_copy)))\nfor i in range(Y):\n uy_1 += max(max(B),max(C_copy))\n if max(B) >= max(C_copy):\n B.pop(B.index(max(B)))\n else:\n C_copy.pop(C_copy.index(max(C_copy)))\nprint(ux_1 + uy_1)', "S = str(input())\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s957549378', 's124209784'] | [3064.0, 2940.0] | [17.0, 17.0] | [597, 89] |
p02723 | u489153633 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['s = str(input())\nif s[3]==s[4] && s[5]==s[6]:\n pritn("Yes")\nelse:\n print("No")', '_in = list(map(int, input().split()))\nk = _in[0]\nn = _in[1]\np = 0\n_i = list(map(int, input().split()))\ndis = 0\nmdis = k - _i[n-1] + _i[0]\nfor i in range(0,n-2):\n dis = _i[i+1]- _i[i]\n if dis>mdis:\n mdis = dis\nprint(k-mdis)', '_in = list(map(int, input().split()))\nk = _in[0]\nn = _in[1]\np = 0\n_i = list(map(int, input().split()))\ndis = 0\nmdis = k - _i[n-1] + _i[0]\nfor i in range(1,n-2):\n dis = _i[i+1]- _i[i]\n if dis>=mdis:\n mdis = dis\nprint(k-mdis)', 's = str(input())\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s086902050', 's625016048', 's635869146', 's848149006'] | [2940.0, 3060.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0, 17.0] | [84, 235, 236, 85] |
p02723 | u492414556 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ['def solve():\n val = str(input())\n return val[2] == val[3] && val[4] == val[5]\nsolve();', "def solve():\n val = str(input())\n if val[2] == val[3] and val[4] == val[5]:\n print('Yes')\n else:\n print('No')\nsolve();"] | ['Runtime Error', 'Accepted'] | ['s643380360', 's596187665'] | [2940.0, 3064.0] | [17.0, 17.0] | [88, 127] |
p02723 | u493318999 | 2,000 | 1,048,576 | A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like. | ["s = input()\nif s[2:4] == 'ff' and s[4:6] == 'ee':\n print('Yes')\nelse:\n print('No')", "s = input()\nif s[3:4] == 'ff' and s[5:6] == 'ee'\n print('Yes')\nelse:\n print('No')", "s = input()\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s237257659', 's497835513', 's184029456'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [88, 87, 80] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.