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 | u060012100 | 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()) \nprint('YES' if S[2] == S[3] and S[4] ==S[5] else 'NO' ) ", "S = str(input()) \nprint('YES' if S[2] ==S[3] and 'NO' if S[4]==S[5] ", "S = str(input())\n\nprint('Yes' if S[2]==S[3] and S[4]==S[5] else 'No')"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s677583166', 's837169798', 's819452760'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [74, 68, 69] |
p02723 | u063346608 | 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]:\n\tprint("Yes")\nelse:\n\tprint("No")', 'S = input()\n\nif S[2] ==S[3] and S[4] == S[5]:\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Runtime Error', 'Accepted'] | ['s790479821', 's359146100'] | [2940.0, 9060.0] | [18.0, 33.0] | [80, 78] |
p02723 | u065346745 | 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()\n\nif A[2]==A[3] and A[4]==A[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")'] | ['Wrong Answer', 'Accepted'] | ['s792869024', 's380153003'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 82] |
p02723 | u065870010 | 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("No")', 'a=input()\n\nif a[2]==a[3]:\n if a[4]==[5]:\n print("Yes")\n else:\n print("No")', 'a=input()\n\n\nb=False\nif a[2]==a[3]:\n if a[4]==a[5]:\n a=True\n \nprint(b)', 'a=input()\n\n\nb=False\nif a[2]==a[3]:\n if a[4]==a[5]:\n b=True\n \nprint(b)', 'a=input()\n\n\nb=False\nif a[2]==a[3]:\n if a[4]==a[5]:\n b=True\n \nprint(b)', 'a=input()\n\n\nb=False\nif a[2]==a[3]:\n if a[4]==a[5]:\n b=True\n\n\nif b==True:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s022010122', 's329284807', 's614015845', 's721832293', 's992793636', 's839563473'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0, 17.0, 17.0, 18.0] | [11, 94, 82, 82, 82, 121] |
p02723 | u067986264 | 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())\nm = {}\nfor i in range(1,n):\n m[i] = 0\nfor i in range(1,n):\n for j in range(i+1,n+1):\n dif = min(abs(j-i),(abs(x-i)+1+abs(j-y)),(abs(y-i)+1+abs(j-x)))\n m[dif]+=1\n[print(m[i]) for i in range(1,n)]\n', 'N, X, Y = map(int,input().split())\nl = [0]*(N-1)\nfor i in range(1,N):\n for j in range(i+1,N+1):\n d=min(j-i,abs(X-i)+1+abs(Y-j),abs(Y-i)+1+abs(X-j))\n l[d-1] += 1\nfor a in l:\n print(a)\n', 'N, X, Y = map(int,input().split())\nl = [0]*(N-1)\nfor i in range(1,N):\n for j in range(i+1,N+1):\n d=min(j-i,abs(X-i)+1+abs(Y-j),abs(Y-i)+1+abs(X-j))\n l[d-1] += 1\nfor k in range(N-1):\n print(l[k])\n', 'N, X, Y = map(int,input().split())\nl = [0]*(N-1)\nfor i in range(1,N):\n for j in range(i+1,N+1):\n d=min(j-i,abs(X-i)+1+abs(Y-j),abs(Y-i)+1+abs(X-j))\n l[d-1] += 1\nfor k in range(N-1):\n print(l[k])', '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', 'Accepted'] | ['s166189594', 's306321495', 's463937365', 's588521718', 's954473959'] | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [248, 203, 215, 214, 84] |
p02723 | u068844030 | 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\ns = input()\nif s[2] == s[3] and s[4] == s[5]:\n print("yes")\nelse:\n print("No") ', '##A\ns = input()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s174946939', 's439699623'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 89] |
p02723 | u069273180 | 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())\nS = S[2:6:1]\ncoffee = ["f","f","e","e"]\n \nif S == coffee:\n print("Yes")\nelse:\n print("no")', 'S = list(input())\nS = S[2:5:1]\ncoffee = ["f","f","e","e"]\n \nif S == coffee:\n print("Yes")\nelse:\n print("no")', 'S = list(input())\ncoffee = ["c","o","f","f","e","e"]\n \nif S == coffee:\n print("Yes")\nelse:\n print("no")', 'S = list(input())\ncoffee = ["c","o","f","f","e","e"]\nif S == coffee:\n print("Yes")\n else:\n print("no")', 'S = list(input())\nS =[2:5:1]\ncoffee = ["f","f","e","e"]\n \nif S == coffee:\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")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s060837953', 's115958997', 's317447541', 's775462213', 's947416020', 's960663035'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [115, 115, 110, 109, 113, 87] |
p02723 | u069479805 | 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, num_red_apple, num_green_apple, num_apple = map(int, input().strip().split())\nred_apples = list(map(int, input().strip().split()))\ngreen_apples = list(map(int, input().strip().split()))\napples = list(map(int, input().strip().split()))\n\ngood_apples = []\nfor i in range(1, X+1):\n good_apples.append(sorted(red_apples)[-i])\n\nfor i in range(1, Y+1):\n good_apples.append(sorted(green_apples)[-i])\n\nwhile(1):\n if max(apples) > min(good_apples):\n good_apple = apples.pop(apples.index(max(apples)))\n good_apples.remove(min(good_apples))\n good_apples.append(good_apple)\n else:\n break\n \nprint(sum(good_apples))\n ', 'X, Y, num_red_apple, num_green_apple, num_apple = map(int, input().strip().split())\nred_apples = list(map(int, input().strip().split()))\ngreen_apples = list(map(int, input().strip().split()))\napples = list(map(int, input().strip().split()))\n\ngood_apples = []\nfor i in range(1, X+1):\n good_apples.append(sorted(red_apples)[-i])\n\nfor i in range(1, Y+1):\n good_apples.append(sorted(green_apples)[-i])\n\nwhile(1):\n if max(apples) > min(good_apples):\n good_apple = apples.pop(apples.index(max(apples)))\n good_apples.remove(min(good_apples))\n good_apples.append(good_apple)\n else:\n break\n \nprint(good_apples)', 'word = input()\n\ndef Coffee(word):\n if word[2] == word[3] and word[4] == word[5]:\n print("Yes")\n else:\n print("No")\n \nCoffee(word)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s108576939', 's655904912', 's255196215'] | [3316.0, 3064.0, 2940.0] | [21.0, 17.0, 18.0] | [658, 644, 142] |
p02723 | u071361440 | 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 = int(input())\ncnt = (n // 1000) * 2000\nn -= (n // 1000) * 1000\ncnt += (n // 5) * 5\nprint(cnt)', 'n = int(input())\ncnt = (n // 1000) * 2000\nn -= (n // 1000) * 1000\ncnt += (n // 5) * 5\nprint(cnt)', 's = input()\nif s[2] == s[3] and s[4] == s[5]:\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s759703237', 's837097853', 's065011657'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [96, 96, 78] |
p02723 | u072606168 | 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())\nans = "No"\nif len(s) == 6:\n if s[2]==s[3] and s[4]==s[5]:\n ans = "Yes"\nprint(ans)', 's = input()\nans = "No"\nif len(s) == 6:\n if s[2]==s[3] and s[4]==s[5]:\n ans = "Yes"\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s762174417', 's760116340'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 97] |
p02723 | u075489826 | 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\ndef fastio():\n from io import StringIO\n from atexit import register\n global input\n sys.stdin = StringIO(sys.stdin.read())\n input = lambda : sys.stdin.readline().rstrip('\\r\\n')\n sys.stdout = StringIO()\n register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\nfastio()\n\nINF = 10**20\nMOD = 10**9 + 7\nI = lambda:list(map(int,input().split()))\n# from math import gcd\nfrom math import ceil\nfrom collections import defaultdict as dd, Counter\nfrom bisect import bisect_left as bl, bisect_right as br\n\ns, = input()\nans = 'No'\nif s[2] == s[3] and s[5] == s[6]:\n ans = 'Yes'\nprint(ans)", "import sys\ndef fastio():\n from io import StringIO\n from atexit import register\n global input\n sys.stdin = StringIO(sys.stdin.read())\n input = lambda : sys.stdin.readline().rstrip('\\r\\n')\n sys.stdout = StringIO()\n register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\nfastio()\n\nINF = 10**20\nMOD = 10**9 + 7\nI = lambda:list(map(int,input().split()))\n# from math import gcd\nfrom math import ceil\nfrom collections import defaultdict as dd, Counter\nfrom bisect import bisect_left as bl, bisect_right as br\n\ns = input()\nans = 'No'\nif s[2] == s[3] and s[4] == s[5]:\n ans = 'Yes'\nprint(ans)"] | ['Runtime Error', 'Accepted'] | ['s863011015', 's284378368'] | [3316.0, 3316.0] | [21.0, 21.0] | [616, 615] |
p02723 | u080685822 | 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()))\na.sort()\nb = []\nc = abs(k+a[0]-a[n-1])\nfor i in range(1, n):\n b.append(abs(a[i] - a[i-1]))\n b.sort()\n p = b[-1]\n\nif p > c:\n print(k - p)\nelse:\n print(k - c)\n', 's = input()\nif s[-1] == s[-2]:\n if s[-3] == s[-4]:\n print("Yes")\n exit()\n\nprint("No")'] | ['Runtime Error', 'Accepted'] | ['s504652020', 's138780730'] | [3064.0, 2940.0] | [17.0, 17.0] | [231, 92] |
p02723 | u084320347 | 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")\n'] | ['Runtime Error', 'Accepted'] | ['s961553631', 's394581973'] | [2940.0, 2940.0] | [18.0, 17.0] | [80, 81] |
p02723 | u084411645 | 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 = int(input())\na -= a%5\nprint(2*a - a%500)', 's = input()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s915639861', 's874936550'] | [8964.0, 2940.0] | [29.0, 17.0] | [44, 84] |
p02723 | u085772923 | 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 = (int(x) for x in input().split())\na = [int(i) for i in input().split()]\nb = []\n\nfor i in range(n-1):\n b.append(a[i+1] - a[i])\n \nb.append(a[0] + k -a[n-1])\n\nans=0\n\nb.sort()\n\nfor i in range(len(b)-1):\n ans = b[i] + ans\n \n \nprint(ans)\n ', "s = input()\n\nif s[2] == s[3]:\n \n if s[4] == s[5]:\n print('Yes')\n else:\n print('No')\n\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s175264170', 's896591280'] | [3060.0, 2940.0] | [19.0, 17.0] | [263, 130] |
p02723 | u086438369 | 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())\npn = list(map(int, input().split()))\nqn = list(map(int, input().split()))\nrn = list(map(int, input().split()))\n\npn.sort(reverse=True)\nqn.sort(reverse=True)\n\npqr = pn[:x] + qn[:y] + rn\npqr.sort(reverse=True)\n \nprint(sum(pqr[:x+y]))\n', "s = input()\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')\n "] | ['Runtime Error', 'Accepted'] | ['s318944777', 's032309908'] | [3060.0, 2940.0] | [17.0, 17.0] | [274, 83] |
p02723 | u086769062 | 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 coffee(s):\n if len(s) < 6:\n return False\n if s[2] == s[3] and s[4] == s[5]:\n return True\n else:\n return False\n \nstring = input()\nprint(coffee(string))', "def coffee(s):\n if len(s) < 6:\n return False\n if s[2] == s[3] and s[4] == s[5]:\n return 'Yes'\n else:\n return 'No'\n\nstring = input()\nprint(coffee(string))"] | ['Wrong Answer', 'Accepted'] | ['s738651201', 's336475111'] | [2940.0, 3060.0] | [17.0, 19.0] | [167, 165] |
p02723 | u090406054 | 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[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', 's = list(input())\nif s[2] = s[3] and s[4] = s[5]:\n print("Yes")\n \nelse:\n print"No")', 's =list(input())\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\n \nelse:\n print("No")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s610763796', 's854484440', 's905594452', 's434583492'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [89, 82, 86, 89] |
p02723 | u090445726 | 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 len(S) < 5:\n return False\nelse:\n if s[2] == s[3] and s[4] == s[5]:\n return True\n \nreturn False\n ', "\ns = input()\n\nif len(s) < 5:\n print('No')\n\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s787102866', 's932051298'] | [2940.0, 2940.0] | [18.0, 17.0] | [118, 118] |
p02723 | u091412190 | 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[2] == S[3]\u3000and S[4] == S[5]:\n print("Yse")\nelse:\n print("No")\n', 'S = list(input())\nif S[2] == S[3] and S[4] == S[5]:\n print("Yse")\nelse:\n print("No")\n', 'S = list(input())\nif S[2] == S[3]:\n if S[4] == S[5]:\n print("Yse")\n else:\n print("No")\nelse:\n print("No")', 'S = list(input())\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s342965757', 's830984177', 's995289858', 's972559416'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [93, 91, 114, 91] |
p02723 | u093943966 | 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 = str(input())\n\ndef test(string):\n string.split()\n if string[2] == string[3] and string[4] == string[5]:\n return "Yes"\n else:\n return "No"', 'string = str(input())\n\ndef test(string):\n string.split()\n if string[2] == string[3] and string[4] == string[5]:\n print("Yes")\n else:\n print("No")', 's = (str(i) for i in input().split())\n\ndef test(s):\n s.split()\n if s[2] == s[3] and s[4] == s[5]:\n print("Yes")\n else:\n print("No")', 'def test(string):\n string.split()\n if string[2] == string[3] and string[4] == string[5]:\n return "Yes"\n else:\n return "No"', 'def test(s):\n s.split()\n if s[2] == s[3] and s[4] == s[5]:\n print("Yes")\n else:\n print("No")', 'def test(s):\n s.split()\n if s[2] == s[3] and s[4] == s[5]:\n print("Yes")\n else:\n print("No")', 's = input()\n\ns.split()\n if s[2] == s[3] and s[4] == s[5]:\n print("Yes")\n else:\n print("No")', 'string = input()\nstring.split()\nif string[2] == string[3] and string[4] == string[5]:\n\tprint("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s067664520', 's108917101', 's185476056', 's318274130', 's363179183', 's373322421', 's463068259', 's147541223'] | [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] | [168, 168, 154, 145, 115, 115, 111, 121] |
p02723 | u095094246 | 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[2] == s[3] & s[4] == s[5]:\n print('Yes')\nelse:\n print('No')", "s = list(input())\nif (s[2] == s[3]) & (s[4] == s[5]):\n print('Yes')\nelse:\n print('No')\n\n"] | ['Runtime Error', 'Accepted'] | ['s887519661', 's397412109'] | [2940.0, 2940.0] | [18.0, 17.0] | [84, 90] |
p02723 | u095844416 | 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[4] == s[5] and s[6] == s[7]:\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'] | ['s355202456', 's769537439'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 79] |
p02723 | u096294926 | 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()\n\nif A[0]!=A[1]!=A[2]!=A[4] andA[0]!=A[1]!=A[3]!=A[5] and A[2]==A[3] and A[4] == A[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")'] | ['Runtime Error', 'Accepted'] | ['s015494795', 's795511572'] | [2940.0, 2940.0] | [18.0, 17.0] | [137, 83] |
p02723 | u103198430 | 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 -*-\nimport sys\nfrom collections import defaultdict\n\n\nMAX_INT = 2**62-1\nsys.setrecursionlimit(10**6)\n\ninput = sys.stdin.readline\n\n\nN = 2 * (10**5) + 1\nMOD = 10**9 + 7\n\nfact = [1] * N\nfact_inv = [0] * N\n\nfor i in range(1, 2 * (10**5)+1):\n fact[i] = fact[i-1] * i % MOD\n fact_inv[i] = pow(fact[i], MOD-2, MOD)\n\n\ndef solve(g):\n def dfs(pre, cur):\n if pre in memo and cur in memo[pre]:\n return memo[pre][cur]\n\n num, ways = 1, 1\n\n for nxt in g[cur]:\n if nxt == pre:\n continue\n n, w = dfs(cur, nxt)\n num += n\n ways = ways * w % m * fi[n] % m\n\n ways = ways * f[num-1] % m\n memo[pre][cur] = num, ways\n return num, ways\n\n m = MOD\n memo = defaultdict(dict)\n f, fi = fact, fact_inv\n\n for i in range(1, len(g)):\n print(dfs(None, i)[1])\n\n\ndef main():\n n = int(input())\n g = [[] for _ in range(n+1)]\n\n for _ in range(n-1):\n a, b = map(int, input().split())\n g[a].append(b)\n g[b].append(a)\n\n solve(g)\n\n\nif __name__ == "__main__":\n\n main()\n', 'import sys\n\n\ndef input() -> str:\n return sys.stdin.readline().rstrip("\\r\\n")\n\n\ndef main():\n s = input()\n if len(s) == 6 and s[-2] == s[-1] and s[2] == s[3]:\n print(\'Yes\')\n else:\n print(\'No\')\n\nif __name__ == "__main__":\n\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s419267636', 's623748958'] | [19148.0, 2940.0] | [874.0, 17.0] | [1119, 257] |
p02723 | u104005543 | 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] and s[5] == s[6]:\n print('Yes')\nelse:\n print('No')", 'k, n = map(int, input().split())\narr = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n if i + 1 <= n - 1:\n if arr[i + 1] - arr[i] > ans:\n ans = arr[i + 1] - arr[i]\n else:\n if arr[i] - arr[0] > ans:\n ans = arr[i] - arr[0]\nprint(ans)', 'k, n = map(int, input().split())\narr = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n if i + 1 <= n - 1:\n if arr[i + 1] - arr[i] > ans:\n ans = arr[i + 1] - arr[i]\n else:\n if arr[i] - arr[0] > ans:\n ans = arr[i] - arr[0]\nprint(ans)', "s = str(input())\nif s[3] == s[2] and s[5] == s[4]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s157019133', 's709242323', 's994309340', 's389116218'] | [2940.0, 3064.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0, 19.0] | [89, 285, 285, 89] |
p02723 | u106816675 | 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()\nl = []\nfor i in S:\n l.append(i)\n\nif l[3] == l[4]:\n if l[5] == l[6]:\n print('Yes')\n\nprint('No')", "S = input()\nl = []\ncont = 0\nfor i in S:\n l.append(i)\n\nif l[2] == l[3]:\n if l[4] == l[5]:\n cont = 1\n\nif cont == 1:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s982735355', 's766901343'] | [3060.0, 3064.0] | [32.0, 18.0] | [119, 165] |
p02723 | u111652094 | 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())\n\nif S[2]==S[3] and S[5]==S[6]:\n print("Yes")\nelse:\n print("No")', 'S=str(input())\n\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s269713156', 's108003161'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 84] |
p02723 | u112266373 | 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 itertools as it\nimport collections\n\nn, x, y = list(map(int, input().split(' ')))\n\ndist_list = []\ndist_a = dist_list.append\nfor i, j in it.combinations(list(range(n)), 2):\n warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))\n if abs(j - i) < warp_dist:\n dist_a(abs(j - i))\n else:\n dist_a(warp_dist)\n\ndist_c = collections.Counter(dist_list)\n\nfor i in range(1, n):\n print(dist_c[i])\n", "import itertools as it\nimport collections\n \nn, x, y = list(map(int, input().split(' ')))\n \ndist_list = []\ndist_a = dist_list.append\nfor i, j in it.combinations(list(range(n)), 2):\n warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))\n if abs(j - i) < warp_dist:\n dist_a(abs(j - i))\n else:\n dist_a(warp_dist)\n \ndist_c = collections.Counter(dist_list)\n \nfor i in range(1, n):\n print(dist_c[i])", "x, y, a, b, c = list(map(int, input().split(' ')))\np_list = sorted(list(map(int, input().split(' '))), reverse=True)\nq_list = sorted(list(map(int, input().split(' '))), reverse=True)\nr_list = sorted(list(map(int, input().split(' '))), reverse=True)\n\nxy_list = sorted(p_list[:x] + q_list[:y])\n\ni = 0\nfor r in range(c):\n if r_list[r] > xy_list[0]:\n i += 1\n else:\n break\n\nif i == 0:\n print(sum(xy_list))\nelse:\n print(sum(xy_list[i:] + r_list[:i]))\n", "s = input()\n\ns_list = [i for i in s]\n\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s253360709', 's586288340', 's601770805', 's693569034'] | [3316.0, 3316.0, 3064.0, 2940.0] | [20.0, 21.0, 17.0, 17.0] | [413, 416, 471, 111] |
p02723 | u112629957 | 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=list(input())\nif Str[3]==Str[4] and Str[5]==Str[6]:\n print("Yes")\nelse:print("No") ', 'List=list(input())\nif List[2]==List[3] and List[4]==List[5]:\n print("Yes")\nelse:print("No")'] | ['Runtime Error', 'Accepted'] | ['s449792100', 's473922035'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 92] |
p02723 | u121953215 | 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')", "S = str(input())\n \nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s765316312', 's003327961'] | [2940.0, 2940.0] | [18.0, 17.0] | [61, 87] |
p02723 | u122495382 | 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\nprint("Yes" if s[3]==s[4] and s[5]==s[6] else "No")', 's = input()\n\nprint("Yes" if s[2] == s[3] and s[4] == s[5] else "No")'] | ['Runtime Error', 'Accepted'] | ['s167551586', 's164138742'] | [9100.0, 9036.0] | [28.0, 27.0] | [64, 68] |
p02723 | u122557211 | 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 check(cfe):\n if(cfe[2]!=cfe[3]):\n return "No"\n else:\n if(cfe[4]!=cfe[5]):\n return "No"\n else:\n return "Yes"\n\ndef main():\n str = input()\n\n for i in range(6):\n print(str[i])\n\n print(check(str))\n\nmain()\n', 'def check(cfe):\n if(cfe[2]!=cfe[3]):\n return "No"\n else:\n if(cfe[4]!=cfe[5]):\n return "No"\n else:\n return "Yes"\n\ndef main():\n str = input()\n print(check(str))\n \nmain()\n'] | ['Wrong Answer', 'Accepted'] | ['s142186263', 's379659249'] | [2940.0, 2940.0] | [17.0, 17.0] | [269, 226] |
p02723 | u125269142 | 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)", "s = input()\n \nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s471347503', 's469311955'] | [9020.0, 9024.0] | [23.0, 30.0] | [80, 82] |
p02723 | u127110353 | 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. | ['inputs=input()\nstr3=inputs[2]\nstr4=inputs[3]\nstr5=inputs[4]\nstr6=inputs[5]\n\niscoffee=False\nif str3==str4 and str5==str6:\n iscoffee=True\nprint(str(iscoffee))', 'inputs=input()\n\nprint(True if inputs[2]==inputs[3] and inputs[4]==inputs[5] else False)', 's = input()\nstr3=inputs[2]\nstr4=inputs[3]\nstr5=inputs[4]\nstr6=inputs[5]\n\niscoffee=False\nif str3==str4 and str5==str6:\n iscoffee=True\nprint(str(iscoffee))', 'inputs=input()\n\nprint("Yes" if inputs[2]==inputs[3] and inputs[4]==inputs[5] else "No")'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s081267511', 's404816642', 's602684929', 's618850853'] | [3060.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 18.0] | [159, 87, 156, 87] |
p02723 | u127288756 | 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'] | ['s964327519', 's519313186'] | [2940.0, 2940.0] | [17.0, 18.0] | [78, 78] |
p02723 | u131597793 | 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 len(S) == 6 and S[2]==S[3] and S[4]==S[5]:\n print("Yes")', "if len(S) == 6 and S[2]==S[3] and S[4]==S[5]: print('Yes')\nelse: print('No')", "def coffee():\n if len(S) == 6 and S[2]==S[3] and S[4]==S[5]:\n return 'Yes'\n\ncoffee()", "S = input()\n\nif len(S) == 6 and S[2]==S[3] and S[4]==S[5]: print('Yes')\nelse: print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s043249154', 's182863437', 's889137780', 's136281573'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [62, 76, 94, 89] |
p02723 | u132049876 | 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("Yes") if s[2] == s[3] and s[4] == s[5] else print("No")'] | ['Runtime Error', 'Accepted'] | ['s394612465', 's482082813'] | [2940.0, 2940.0] | [18.0, 18.0] | [46, 74] |
p02723 | u134341470 | 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. | ['"""\nAuthor : co_devil Chirag Garg\nInstitute : JIIT\n"""\nfrom math import factorial\nfrom math import log, ceil\nfrom collections import defaultdict\nfrom math import *\nfrom sys import stdin, stdout\nimport itertools\nimport os\nimport sys\nimport threading\nfrom collections import deque, Counter, OrderedDict, defaultdict\nfrom heapq import *\n# from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd\n\n# from decimal import *,threading\nfrom fractions import Fraction\nmod = int(pow(10, 9)+7)\n\n\ndef ii(): return int(input())\n\n\ndef si(): return str(input())\n\n\ndef mi(): return map(int, input().split())\n\n\ndef li(): return list(mi())\n\n\ndef fii(): return int(stdin.readline())\n\n\ndef fsi(): return str(stdin.readline())\n\n\ndef fmi(): return map(int, stdin.readline().split())\n\n\ndef fli(): return list(fmi())\n\n\nabd = {\'a\': 0, \'b\': 1, \'c\': 2, \'d\': 3, \'e\': 4, \'f\': 5, \'g\': 6, \'h\': 7, \'i\': 8, \'j\': 9, \'k\': 10, \'l\': 11, \'m\': 12,\n \'n\': 13, \'o\': 14, \'p\': 15, \'q\': 16, \'r\': 17, \'s\': 18, \'t\': 19, \'u\': 20, \'v\': 21, \'w\': 22, \'x\': 23, \'y\': 24,\n \'z\': 25}\n\n\ndef getKey(item): return item[0]\n\n\ndef sort2(l): return sorted(l, key=getKey)\n\n\ndef d2(n, m, num): return [[num for x in range(m)] for y in range(n)]\n\n\ndef isPowerOfTwo(x): return (x and (not (x & (x - 1))))\n\n\ndef decimalToBinary(n): return bin(n).replace("0b", "")\n\n\ndef ntl(n): return [int(i) for i in str(n)]\n\n\ndef powerMod(x, y, p):\n res = 1\n x %= p\n while y > 0:\n if y & 1:\n res = (res * x) % p\n y = y >> 1\n x = (x * x) % p\n return res\n\n\ngraph = defaultdict(list)\nvisited = [0] * 1000000\ncol = [-1] * 1000000\n\n\ndef bfs(d, v):\n q = []\n q.append(v)\n visited[v] = 1\n while len(q) != 0:\n x = q[0]\n q.pop(0)\n for i in d[x]:\n if visited[i] != 1:\n visited[i] = 1\n q.append(i)\n print(x)\n\n\ndef make_graph(e):\n d = {}\n for i in range(e):\n x, y = mi()\n if x not in d:\n d[x] = [y]\n else:\n d[x].append(y)\n if y not in d:\n d[y] = [x]\n else:\n d[y].append(x)\n return d\n\n\ndef gr2(n):\n d = defaultdict(list)\n for i in range(n):\n x, y = mi()\n d[x].append(y)\n return d\n\n\ndef connected_components(graph):\n seen = set()\n\n def dfs(v):\n vs = set([v])\n component = []\n while vs:\n v = vs.pop()\n seen.add(v)\n vs |= set(graph[v]) - seen\n component.append(v)\n return component\n\n ans = []\n for v in graph:\n if v not in seen:\n d = dfs(v)\n ans.append(d)\n return ans\n\n\ndef primeFactors(n):\n s = set()\n while n % 2 == 0:\n s.add(2)\n n = n // 2\n for i in range(3, int(sqrt(n)) + 1, 2):\n while n % i == 0:\n s.add(i)\n n = n // i\n if n > 2:\n s.add(n)\n return s\n\n\ndef find_all(a_str, sub):\n start = 0\n while True:\n start = a_str.find(sub, start)\n if start == -1:\n return\n yield start\n start += len(sub)\n\n\ndef SieveOfEratosthenes(n, isPrime):\n isPrime[0] = isPrime[1] = False\n for i in range(2, n):\n isPrime[i] = True\n p = 2\n while (p * p <= n):\n if (isPrime[p] == True):\n i = p * p\n while (i <= n):\n isPrime[i] = False\n i += p\n p += 1\n return isPrime\n\n\ndef dijkstra(edges, f, t):\n g = defaultdict(list)\n for l, r, c in edges:\n g[l].append((c, r))\n\n q, seen, mins = [(0, f, ())], set(), {f: 0}\n while q:\n (cost, v1, path) = heappop(q)\n if v1 not in seen:\n seen.add(v1)\n path = (v1, path)\n if v1 == t:\n return (cost, path)\n\n for c, v2 in g.get(v1, ()):\n if v2 in seen:\n continue\n prev = mins.get(v2, None)\n next = cost + c\n if prev is None or next < prev:\n mins[v2] = next\n heappush(q, (next, v2, path))\n return float("inf")\n\n\ndef binsearch(a, l, r, x):\n while l <= r:\n mid = l + (r-1)//2\n if a[mid]:\n return mid\n elif a[mid] > x:\n l = mid-1\n else:\n r = mid+1\n return -1\n\n\n\n\n\n# visited[v] = 1\n# while len(q) != 0:\n\n\n\n# if visited[i] != 1:\n# visited[i] = 1\n\n# print(x)\ns = si()\nif s[2] == s[3] and s[4] == s[5]:\n print("YES")\nelse:\n print("NO")\n', '"""\nAuthor : co_devil Chirag Garg\nInstitute : JIIT\n"""\nfrom math import factorial\nfrom math import log, ceil\nfrom collections import defaultdict\nfrom math import *\nfrom sys import stdin, stdout\nimport itertools\nimport os\nimport sys\nimport threading\nfrom collections import deque, Counter, OrderedDict, defaultdict\nfrom heapq import *\n# from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd\n\n# from decimal import *,threading\nfrom fractions import Fraction\nmod = int(pow(10, 9)+7)\n\n\ndef ii(): return int(input())\n\n\ndef si(): return str(input())\n\n\ndef mi(): return map(int, input().split())\n\n\ndef li(): return list(mi())\n\n\ndef fii(): return int(stdin.readline())\n\n\ndef fsi(): return str(stdin.readline())\n\n\ndef fmi(): return map(int, stdin.readline().split())\n\n\ndef fli(): return list(fmi())\n\n\nabd = {\'a\': 0, \'b\': 1, \'c\': 2, \'d\': 3, \'e\': 4, \'f\': 5, \'g\': 6, \'h\': 7, \'i\': 8, \'j\': 9, \'k\': 10, \'l\': 11, \'m\': 12,\n \'n\': 13, \'o\': 14, \'p\': 15, \'q\': 16, \'r\': 17, \'s\': 18, \'t\': 19, \'u\': 20, \'v\': 21, \'w\': 22, \'x\': 23, \'y\': 24,\n \'z\': 25}\n\n\ndef getKey(item): return item[0]\n\n\ndef sort2(l): return sorted(l, key=getKey)\n\n\ndef d2(n, m, num): return [[num for x in range(m)] for y in range(n)]\n\n\ndef isPowerOfTwo(x): return (x and (not (x & (x - 1))))\n\n\ndef decimalToBinary(n): return bin(n).replace("0b", "")\n\n\ndef ntl(n): return [int(i) for i in str(n)]\n\n\ndef powerMod(x, y, p):\n res = 1\n x %= p\n while y > 0:\n if y & 1:\n res = (res * x) % p\n y = y >> 1\n x = (x * x) % p\n return res\n\n\ngraph = defaultdict(list)\nvisited = [0] * 1000000\ncol = [-1] * 1000000\n\n\ndef bfs(d, v):\n q = []\n q.append(v)\n visited[v] = 1\n while len(q) != 0:\n x = q[0]\n q.pop(0)\n for i in d[x]:\n if visited[i] != 1:\n visited[i] = 1\n q.append(i)\n print(x)\n\n\ndef make_graph(e):\n d = {}\n for i in range(e):\n x, y = mi()\n if x not in d:\n d[x] = [y]\n else:\n d[x].append(y)\n if y not in d:\n d[y] = [x]\n else:\n d[y].append(x)\n return d\n\n\ndef gr2(n):\n d = defaultdict(list)\n for i in range(n):\n x, y = mi()\n d[x].append(y)\n return d\n\n\ndef connected_components(graph):\n seen = set()\n\n def dfs(v):\n vs = set([v])\n component = []\n while vs:\n v = vs.pop()\n seen.add(v)\n vs |= set(graph[v]) - seen\n component.append(v)\n return component\n\n ans = []\n for v in graph:\n if v not in seen:\n d = dfs(v)\n ans.append(d)\n return ans\n\n\ndef primeFactors(n):\n s = set()\n while n % 2 == 0:\n s.add(2)\n n = n // 2\n for i in range(3, int(sqrt(n)) + 1, 2):\n while n % i == 0:\n s.add(i)\n n = n // i\n if n > 2:\n s.add(n)\n return s\n\n\ndef find_all(a_str, sub):\n start = 0\n while True:\n start = a_str.find(sub, start)\n if start == -1:\n return\n yield start\n start += len(sub)\n\n\ndef SieveOfEratosthenes(n, isPrime):\n isPrime[0] = isPrime[1] = False\n for i in range(2, n):\n isPrime[i] = True\n p = 2\n while (p * p <= n):\n if (isPrime[p] == True):\n i = p * p\n while (i <= n):\n isPrime[i] = False\n i += p\n p += 1\n return isPrime\n\n\ndef dijkstra(edges, f, t):\n g = defaultdict(list)\n for l, r, c in edges:\n g[l].append((c, r))\n\n q, seen, mins = [(0, f, ())], set(), {f: 0}\n while q:\n (cost, v1, path) = heappop(q)\n if v1 not in seen:\n seen.add(v1)\n path = (v1, path)\n if v1 == t:\n return (cost, path)\n\n for c, v2 in g.get(v1, ()):\n if v2 in seen:\n continue\n prev = mins.get(v2, None)\n next = cost + c\n if prev is None or next < prev:\n mins[v2] = next\n heappush(q, (next, v2, path))\n return float("inf")\n\n\ndef binsearch(a, l, r, x):\n while l <= r:\n mid = l + (r-1)//2\n if a[mid]:\n return mid\n elif a[mid] > x:\n l = mid-1\n else:\n r = mid+1\n return -1\n\n\n\n\n\n# visited[v] = 1\n# while len(q) != 0:\n\n\n\n# if visited[i] != 1:\n# visited[i] = 1\n\n# print(x)\ns = si()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s240690226', 's970871542'] | [21252.0, 22788.0] | [84.0, 67.0] | [4724, 4724] |
p02723 | u136090046 | 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("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'] | ['s375231408', 's481394647'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 65] |
p02723 | u137930457 | 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 = list(input())\n\nfor i in range(len(string)):\n if(string[2] == string[3] and string[4]==string[5]):\n print("Yes")\n else:\n print("No")\n \t\n\n', 'def main():\n s = list(input())\n \n if(len(s)!=6):\n main()\n \n for e in s:\n if(e.islower()==False):\n main()\n \n \n for i in range(6):\n if(s[2]==s[3] and s[4]==s[5]):\n print("Yes")\n else:\n print("No")\n \nmain()', 'def main():\n s = list(input())\n \n if(len(s)!=6):\n main()\n \n for e in s:\n if(e.islower()==False):\n main()\n \n if(s[2]==s[3] and s[4]==s[5]):\n print("Yes")\n else:\n print("No")\nmain()'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s708087534', 's742520841', 's432574462'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [153, 315, 242] |
p02723 | u141419468 | 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 = input()\n\nif coffee[2] = coffee[3] and coffee[4] = coffee[5]:\n print("Yes")\nelse:\n print("No")', 'coffee = input()\n\nif coffee[2] == coffee[3] and coffee[4] == coffee[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s196850554', 's507284596'] | [2940.0, 2940.0] | [17.0, 17.0] | [108, 110] |
p02723 | u142027881 | 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=list(input())\nif(a[2]==a[3] and a[4]==a[5]):\n print('YES')\nelse:\n print('NO')", "a=list(input())\nif(a[3]==a[4]) and (a[5]==a[6]):\n print('YES')\nelse:\n print('NO')\n", "a=list(input())\nif(a[2]==a[3]) and (a[4]==a[5]):\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s253553076', 's429112956', 's166244761'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0] | [81, 84, 84] |
p02723 | u145600939 | 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\nsys.setrecursionlimit(10**6)\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\nn = int(readline())\n\nmod = 10**9 + 7\n\ndef expo(x,n):\n var = 1\n while n>0:\n if n%2 == 1:\n var = (var*x) % mod\n x = (x*x)%mod\n n = n>>1\n return var\n\ndef conbi(*x):\n num = 1\n den = 1\n for i in range(1,sum(x)+1):\n num = (num*i)%mod\n for i in x:\n for j in range(1,i+1):\n den = (den * j)%mod\n return (num*expo(den,mod-2))%mod\n\npath = [set() for _ in range(n)]\npathq= [0]*n\n\nfor _ in range(n-1):\n a,b = map(int,read().split())\n a -= 1\n b -= 1\n path[a].add(b)\n pathq[a] += 1\n path[b].add(a)\n pathq[b] += 1\n\nmemo = {}\ndef go(i,j):\n if (i,j) in memo.keys():\n return memo[(i,j)]\n else:\n memo[(i,j)] = [1,1]\n cnt = []\n meth = 1\n for k in path[j]:\n if i != k:\n [x,y] = go(j,k)\n meth *= y\n meth %= mod\n cnt.append(x)\n memo[(i,j)] = [sum(cnt)%mod + 1, meth*conbi(*cnt)%mod]\n return memo[(i,j)]\n\nfor i in range(n):\n ans = 1\n cnt = []\n meth = 1\n for j in path[i]:\n [x,y] = go(i,j)\n meth *= y\n meth %= mod\n cnt.append(x)\n print(meth*conbi(*cnt)%mod)\n', "s = input()\nif s[2] == s[3] and s[5] == s[4]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s626905210', 's124373582'] | [3188.0, 2940.0] | [18.0, 17.0] | [1310, 81] |
p02723 | u151079949 | 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]:\n if S[5]==S[6]:\n print("Yes")\n else:\n print("No")\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'] | ['s103604647', 's727493807', 's436144801'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [74, 102, 74] |
p02723 | u154473588 | 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. | ['inputs = list(map(int, (input().split())))\n\nn = inputs[0]\nx = inputs[1] - 1 # 3\ny = inputs[2] - 1 # 7\nz = y - x - 1 # 3\nc = y - x + 1\nk = [0 for i in range(n-1)]\n\nfor i in range(n - 1):\n for j in range(i + 1, n):\n if i <= x and j >= y:\n d = j - i - z\n elif i <= x and not j >= y:\n d = min(j - i, c - j + x + x - i)\n elif not i <= x and j >= y:\n d = min(j - i, c - y + i + j - y)\n else:\n d = j - i\n # print(str(i+1) + " "+str(j+1)+" "+str(d))\n k[d - 1] += 1\n\nfor e in k:\n print(e)\n', '# inputs = list(map(int, (input().split())))\n\ns = input()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s442499641', 's557955852'] | [3064.0, 2940.0] | [18.0, 17.0] | [575, 130] |
p02723 | u158760165 | 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")', 's = input()\n\nif (s[2] == s[3])and(s[4] == s[5]):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s116700426', 's149556881'] | [2940.0, 2940.0] | [18.0, 17.0] | [77, 83] |
p02723 | u161155417 | 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()\nif S[2]==S[3] and S[4]==[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'] | ['s012343816', 's596894488'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 76] |
p02723 | u163136535 | 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")\nelif\n print("No")\n', 's = input()\nif s[3] == s[4] and s[5] == s[6]:\n print("Yes")\nelif\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'] | ['s051960140', 's286984704', 's780570685'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [80, 77, 80] |
p02723 | u163320134 | 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'] | ['s912095014', 's097607454'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 74] |
p02723 | u164559514 | 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 __name__=='__main__':\n S = input()\n if S[2]==S[3] and S[4]==S[5]:\\\n print(Yes)\n else:\n print(No)", 'S = input()\nif S[2]==S[3] and S[4]==S[5]:\\\n print(Yes)\nelse:\n print(No)', "if __name__=='__main__':\n S = input()\n if S[2]==S[3] and S[4]==S[5]:\\\n print('Yes')\n else:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s559774232', 's954581948', 's606378410'] | [2940.0, 2940.0, 2940.0] | [18.0, 19.0, 17.0] | [118, 77, 122] |
p02723 | u166807268 | 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] and S[5]==S[6])\n\tprint('Yes')\nelse\n\tprint('No')\n\t", "S = str(input())\nprint('Yes' if S[2]==S[3] and S[4]==S[5] else 'No')"] | ['Runtime Error', 'Accepted'] | ['s846216855', 's540638325'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 68] |
p02723 | u169866975 | 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]:\n if s[4] == s[5]:\n print('yes')\nelse:\n print('no')", "s = input().lower()\n\nif s[2] == s[3]:\n if 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'] | ['s242115965', 's281885399', 's106620359'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [86, 93, 80] |
p02723 | u170410075 | 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()\nf==-1\nif s[2]==s[3]:\n if s[4]==s[5]:\n f==1\nif f==1:\n print('Yes')\nelse:\n print('No')", "s=input()\nf=-1\nif s[2]==s[3]:\n if s[4]==s[5]:\n f=1\nif f==1:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s153406370', 's550948535'] | [3060.0, 2940.0] | [17.0, 17.0] | [110, 108] |
p02723 | u172873334 | 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] && 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'] | ['s040696957', 's253755380'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 63] |
p02723 | u173329233 | 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] == 'f' and S[3] == 'f' and S[4] == 'e' and S[5] == 'e':\n print('Yes')\nelse:\n pirnt('No')", "S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s578058745', 's637078569'] | [2940.0, 2940.0] | [18.0, 18.0] | [110, 80] |
p02723 | u181295070 | 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()))\nA.append(k)\nA.sort()\nm = max(y-x for x,y in zip(A,A[1:]))\nans = k-m\nprint(ans)', 'import numpy as np\nk,n = map(int,input().split())\nA = list(map(int,input().split()))\nA.append(k)\nA.sort()\ndist = np.diff(A)\nans = k-max(dist)\nprint(ans)', "s = input()\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s730862520', 's734596753', 's308957421'] | [3064.0, 12508.0, 2940.0] | [18.0, 148.0, 17.0] | [144, 152, 80] |
p02723 | u194930818 | 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\neat = []\n\n\np.sort(reverse=True)\nif X > A:\n eat.extend(p)\nelse:\n eat.extend(p[:X])\n\nq.sort(reverse=True)\nif Y > B:\n eat.extend(q)\nelse:\n eat.extend(q[:Y])\nloss = X+Y - len(eat)\n\n\nwhile loss > 0:\n r.sort(reverse=True)\n eat.append(r.pop(0)) \n loss -= 1\n\n\neat.sort()\nr.sort()\nfor i in range(len(eat)):\n if len(r) != 0 and eat[i] < r[-1]:\n eat[i] = r.pop(-1)\n else:\n break\n\nprint(sum(eat))\n', '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\neat = []\n\n\np.sort(reverse=True)\nif X > A:\n eat.extend(p)\nelse:\n eat.extend(p[:X])\n\nq.sort(reverse=True)\nif Y > B:\n eat.extend(q)\nelse:\n eat.extend(q[:Y])\nloss = X+Y - len(eat)\n\n\nwhile loss > 0:\n r.sort(reverse=True)\n eat.append(r.pop(0)) \n loss -= 1\n\n\neat.sort()\nfor i in range(len(eat)):\n if len(r) != 0 and eat[i] < r[0]:\n eat[i] = r.pop(0)\n else:\n break\n\nprint(sum(eat))\n', "s = list(input())\n\nret = (s[2] == s[3]) and (s[4] == s[5])\nif ret:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s362476435', 's472557697', 's593427882'] | [3064.0, 3064.0, 2940.0] | [18.0, 18.0, 17.0] | [677, 666, 106] |
p02723 | u197045432 | 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();\na=input().split();\nk=int(k);\nn=int(n);\nby=0;\nfor i in range(n):\n\ta[i]=int(a[i]);\nfor i in range(n-1):\n\tif a[i+1]-a[i]>by:\n\t\tby=a[i+1]-a[i];\nif (k-a[n-1])+a[0]>by :\n\tby=(k-a[n-1])+a[0];\nprint(k-by);\n', 'a=input();\nif a[3]==a[2] and a[5]==a[4]:\n\tprint("Yes");\nelse:\n\tprint("No")'] | ['Runtime Error', 'Accepted'] | ['s387775712', 's175520582'] | [3064.0, 2940.0] | [17.0, 17.0] | [219, 74] |
p02723 | u197921942 | 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[3]==s[4] and s[5]==s[6] else "No")', 's=input()\nprint("Yes" if s[2]==s[3] and s[4]==s[5] else "No")'] | ['Runtime Error', 'Accepted'] | ['s126793112', 's514908626'] | [2940.0, 3064.0] | [17.0, 17.0] | [61, 61] |
p02723 | u199120400 | 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] && s[4] == s[5])\u3000print('Yes')\nelse print('No')", "s = input()\n\nif s[2] == s[3] && 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', 'Accepted'] | ['s027018750', 's251321416', 's264148509'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [77, 80, 84] |
p02723 | u201387466 | 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\ninput=sys.stdin.readline\nS = list(input())\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")import sys', 'import sys\ninput=sys.stdin.readline\nS = list(input())\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s717151684', 's782370335'] | [2940.0, 2940.0] | [17.0, 17.0] | [136, 126] |
p02723 | u201921821 | 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 main():\n word = input()\n if (word[2]==word[3]) and (word[4]==word[5]):\n print("Yes")\n else:\n print("No")', 'def main():\n word = input()\n if (word[2]==word[3]) and (word[4]==word[5]):\n print("Yes")\n else:\n print("No")\n \n main()', 'word = input()\nif (word[2]==word[3]) and (word[4]==word[5]):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s533411531', 's737833091', 's226777759'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [117, 130, 99] |
p02723 | u203116413 | 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. | ['answer = input()\n\ncount = 0\nlist = []\nfor i in answer:\n list.append(i)\n\nif len(answer) != 6:\n print(False)\n \nelif list[2] == list[3] and list[4] == list[5]:\n print(True)\n\nelse:\n print(False)\n', 'answer = input()\n\ncount = 0\nlist = []\nfor i in answer:\n list.append(i)\n\nif len(answer) != 6:\n print("No")\n\nelif list[2] == list[3] and list[4] == list[5]:\n print("Yes")\n\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s698198348', 's462271420'] | [9040.0, 8952.0] | [29.0, 28.0] | [206, 201] |
p02723 | u203669169 | 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\ndef solve(S):\n if S[4] == S[5] and S[6] == S[7]:\n return "Yes"\n else:\n return "No"\n\nprint(solve(S))', 'S = input()\n\ndef solve(S):\n if S[2] == S[3] and S[4] == S[5]:\n return "Yes"\n else:\n return "No"\n\nprint(solve(S))'] | ['Runtime Error', 'Accepted'] | ['s414131919', 's684317241'] | [3056.0, 2940.0] | [17.0, 18.0] | [132, 132] |
p02723 | u204260373 | 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()\nlist=[a,b,c,d,e,f]\nif list[c]==list[d] or list[e]==list[f]:\n print("Yes")\nelse:\n print("No")', 's=input()\nif s[2]==s[3] and s[4]==[5]:\n print("Yes")\nelse:\n print("No")\n', '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', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s283519129', 's462316894', 's700478876', 's516090401'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [104, 74, 79, 74] |
p02723 | u205087376 | 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())\na = int((x//500)*1000)\nb = int(((x-(x//500)*500)//5)*5)\nprint(int(a+b))\n', "w = input()\nif w[2]==w[3] and w[4]==w[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s763727060', 's953482187'] | [2940.0, 2940.0] | [18.0, 17.0] | [89, 76] |
p02723 | u205918233 | 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')", "S = input()\n\nif(S[2] == S[3] and S[4] == S[5]):\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s208694039', 's113292837'] | [2940.0, 2940.0] | [18.0, 17.0] | [82, 82] |
p02723 | u209313313 | 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')"] | ['Runtime Error', 'Accepted'] | ['s029484142', 's728475761'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 83] |
p02723 | u211277872 | 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().strip()\nif(A[2] == A[3] and A[4] == A[5])\n print("Yes")\nelse\n print ("no")', 'A = input().strip()\nif(A[3] == A[4] and A[5] == A[6])\n print("Yes")\nelse\n print ("no")', 'A = input().strip()\nif(A[3] == A[4] and A[5] == A[6])\n print("Yes")\nelse\n print ("no")', 'S = input().strip()\nif(S[0] == S[1]):\n p = 0\nelse:\n p = 1\nif (S[1] == S[2]):\n q = 0\nelse:\n q = 1\nprint(p + q)', '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', 'Wrong Answer', 'Accepted'] | ['s057259934', 's057905125', 's254301737', 's670819406', 's120812567'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [92, 92, 92, 121, 80] |
p02723 | u215403436 | 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] == 'f' and s[3] == 'f' and s[4] == 'e' and s[5] == 'e':\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'] | ['s075114680', 's745133525'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 85] |
p02723 | u216306899 | 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())\nlst = list(map(int, input().split()))\n\ndist = lst[-1]-lst[0]\nfor i in range(N-1):\n dist = min(dist, K-lst[i+1]+lst[i])\nprint(dist)', 'S = input()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s914447796', 's483599315'] | [3060.0, 2940.0] | [18.0, 17.0] | [166, 76] |
p02723 | u217086212 | 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'] | ['s184927458', 's664165702'] | [2940.0, 3064.0] | [18.0, 18.0] | [80, 80] |
p02723 | u217303170 | 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'] | ['s378953402', 's735844886', 's584097794'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [84, 80, 84] |
p02723 | u219537663 | 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. | ['input=list(input())\nif(input[2]==input[3] and input[5]==input[6]):\n print("Yes")\nelse:\n print("No")', 'input=list(input())\nif(input[2]==input[3] and input[4]==input[5]):\n print("YES")\nelse:\n print("NO")\n', 'string=str(input())\nif(string[2]==string[3] and string[4]==string[5]):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s555466008', 's893509170', 's129997303'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [101, 104, 110] |
p02723 | u219937318 | 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=list(input())\n\nif n[3]==n[4] and n[5]==n[6]:\n print("Yes")\nelse:\n print("No")\n', 'n=list(input())\n\nif (n[3]==n[4] and n[5]==n[6]):\n print("Yes")\nelse:\n print("No")', 'n=list(input())\n\nif (n[3]==n[4] and n[5]==n[6])\n print("Yes")\nelse:\n print("No")\n \n', 'n=list(input())\n\nif (n[3]==n[4]):\n pass\n if (n[5]==n[6]):\n print("Yes")\n else:\n print("No")\n', 'n=list(input())\n\nif n[2]==n[3] and n[4]==n[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s390179981', 's489851163', 's768733751', 's863557686', 's632577895'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [86, 87, 92, 115, 86] |
p02723 | u223442335 | 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("Enter 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'] | ['s978209155', 's953041157'] | [2940.0, 2940.0] | [17.0, 18.0] | [104, 83] |
p02723 | u224554402 | 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]\u3000== S[2]:\n if S[4]==S[6]:\n return str(Yes)\n ', "\nS = str(input())\na= 'Yes'\nb='No'\nif S[3] is S[2] and S[4] is S[5]:\n print(a)\nelse:\n print(b)\n\n\n"] | ['Runtime Error', 'Accepted'] | ['s256431852', 's144232660'] | [2940.0, 2940.0] | [17.0, 17.0] | [73, 102] |
p02723 | u226191225 | 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())\nans = x//500 * 1000\nans += (x%500)//5*5\nprint(ans)', "s = list(str(input()))\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s134672859', 's492524962'] | [2940.0, 2940.0] | [18.0, 17.0] | [67, 91] |
p02723 | u228303592 | 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]&&s[4]==s[5]:\n ans = Yes\n \nprint(ans)', 's = input()\nans = "No"\n\nif s[2]==s[3]&&s[4]==s[5]:\n ans = "Yes"\n \nprint(ans)\n', 's = input()\nans = "No"\n\nif s[2]==s[3] and s[4]==s[5]:\n ans = "Yes"\n \nprint(ans)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s132144538', 's248739683', 's797112709'] | [8936.0, 8896.0, 9088.0] | [22.0, 25.0, 28.0] | [74, 79, 82] |
p02723 | u234630561 | 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: print("NO")\n', 's=input()\nprint("YES"if s[2]==s[3] and s[4]==[5] else "NO")', 's=input()\nprint("YES" if s[2]==s[3] and s[4]==s[5] else "NO")', 's=input()\n\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\n\nelse:print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s131919438', 's869495024', 's932058970', 's540208499'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 18.0] | [72, 59, 61, 76] |
p02723 | u234733300 | 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())) for i in range(3)]\nRed = sorted(P[0], reverse=True)\nGreen = sorted(P[1], reverse=True)\nTrans = sorted(P[2], reverse=True)\n\npre_max = sum(Red[:X]) + sum(Green[:Y])\nRed = Red[:X]\nGreen = Green[:Y]\nfor i in range (C):\n maxo = pre_max\n if (Trans[i] > Red[-1+i]):\n maxo= pre_max + Trans[i] - Red[-1+i]\nfor i in range (C):\n if (Trans[i] > Green[-1+i]):\n maxo = pre_max + Trans[i] - Green[-1+i]\n \nprint(maxo)', 'S = input()\nif(S[2] == S[3] and S[4]==S[5] ):\n\tprint("YES")\nelse :\n\tprint("No")', 'S = input()\nif(S[2] == S[3] and S[4]==S[5] ):\n\tprint("Yes")\nelse :\n\tprint("No")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s239126146', 's902029290', 's269824937'] | [3064.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [491, 79, 79] |
p02723 | u236666830 | 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. | ['\nK, N = map(int, input().split())\nA = list(map(int, input().split()))\n\ndiff = K + A[0] - A[-1]\n\nfor i in range(N-1):\n diff = max(diff , A[i+1]-A[i])\n\nprint(K-diff)\n', "\n\ns = input()\n\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s563218412', 's065286050'] | [2940.0, 2940.0] | [17.0, 17.0] | [167, 84] |
p02723 | u238928527 | 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 re\n\ntext = input()\nif text[2] == text[3] && text[4] == text[5]:\n return "Yes"\nelse:\n return "No"', 'text = input()\nif len(text) < 6:\n print("No")\nelif text[2] == text[3] and text[4] == text[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s129132332', 's301531205'] | [2940.0, 2940.0] | [17.0, 17.0] | [105, 130] |
p02723 | u248221744 | 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'] | ['s554647225', 's250365403'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 80] |
p02723 | u248670151 | 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=list(str(input()))\nif a[2]==a[3] and a[4]==a[5]:\n print('yes')\nelse:\n print('no') \n ", "a=list(str(input()))\nif a[2]==a[3] and a[4]==a[5]:\n print('Yes')\nelse:\n print('No') "] | ['Wrong Answer', 'Accepted'] | ['s139092677', 's992588448'] | [8956.0, 8996.0] | [27.0, 26.0] | [98, 90] |
p02723 | u250554058 | 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 main():\n x = input()\n if(x[2] == x[3]):\n if(x[4] == x[5]):\n print("Yes")\n else:\n print("No")\n \nif __name__ == \'main\':\n main()', 'def main():\n k, N = (int(x) for x in input().split())\n min_LIST = []\n LIST = []\n LIST = list(map(int,input().split()))\n\n for i in range(len(LIST) - 1):\n min_LIST.append(LIST[i + 1] - LIST[i])\n if(min_LIST[i] <= (LIST[i + 1] - LIST[i])):\n x = (LIST[i + 1] - LIST[i])\n\n min_LIST.append(LIST[0] + (k - LIST[-1]))\n if(x <= (LIST[0] + (k - LIST[-1]))):\n x = (LIST[0] + (k - LIST[-1]))\n\n sum_list = sum(min_LIST) - x\n\n print(sum_list)\nif __name__ == "__main__":\n main()\n\n\n\n\n', 'def main():\n x = input()\n if(len(x) == 6 and x.islower()):\n if(x[2] == x[3] and x[4] == x[5]):\n print("Yes")\n else:\n print("No")\n \nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s459188368', 's657602527', 's937860819'] | [2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [147, 492, 190] |
p02723 | u252964975 | 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=map(int, input().split())\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[5]==S[4]):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s276314364', 's249889165'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 75] |
p02723 | u254221913 | 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'] | ['s217519694', 's050369675'] | [3064.0, 2940.0] | [17.0, 18.0] | [84, 84] |
p02723 | u257084573 | 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[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\nprint("No")', 'S = input()\n\nS = list(S)\n\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s209348672', 's596374880'] | [2940.0, 2940.0] | [18.0, 17.0] | [88, 98] |
p02723 | u257265865 | 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")\n', 'S=input()\nprint("Yes" if S[2] == S[3] and S[4]==S[5] else "No")\n'] | ['Runtime Error', 'Accepted'] | ['s358810336', 's054706881'] | [2940.0, 3064.0] | [17.0, 17.0] | [63, 64] |
p02723 | u259268066 | 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 = input()\nif ((x[2] == x[3]) & (x[4]==x[6])):\n print("Yes")\nelse:\n print("No")', 'x = input()\nif (x[2] == x[3]) & (x[4] == x[5]):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s268234323', 's136615628'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 86] |
p02723 | u260068288 | 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=int(input())\nif a > 500:\n print((a//500)*1000+((a%500)//5)*5)\nelse:\n print(a//5*5)', 'a=int(input())\nif a > 500:\n print((a//500)*1000+((a%500)//5)*5)\nelse:\n print(a//5*5)', 'a=int(input())\nif a > 500:\n print((a//500)*1000+((a%500)//5)*5)\nelse:\n print((a//5)*5)', 'a=input()\nif a[2] == a[3] and a[4] == a[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s587913941', 's766159897', 's787206035', 's075492120'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [90, 90, 92, 82] |
p02723 | u260608653 | 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 = list(input());\nif (string[2] == string[3] && string[4] == string[5]):\n\tprint("Yes");\nelse:\n print("No");', 'string = list(input("");\nif (string[2] == string[3]):\n if (string[4] == string[5]):\n print("Yes");\n else:\n print("No");\nelse:\n print("No");', 'string = input().split();\nif (string[2] == string[3]):\n if (string[4] == string[5]):\n print("Yes");\n else:\n print("No");\nelse:\n print("No");', 'string = list(input());\nif (string[2] == string[3] && string[4] == string[5]):\n\tprint("Yes");\n else:\n print("No");', 'string = list(input());\nif (string[2] == string[3] and string[4] == string[5]):\n\tprint("Yes");\n else:\n print("No");', 'string = list(input());\nif (string[2] == string[3] and string[4] == string[5]):\n\tprint("Yes");\nelse:\n print("No");'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s352654649', 's718230962', 's835764604', 's874398762', 's946184509', 's002011239'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0, 18.0] | [116, 148, 149, 118, 119, 117] |
p02723 | u261082314 | 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,m)=map(int,input().split())\na=input().split()\na=list(map(int,a))\nl=[]\nk=0\na=sorted(a)\nfor i in range(m-1):\n d=abs(a[i]-a[i+1])\n k=k+d\n l.append(d)\n# k=k-d\nc=n-k\nl.append(c)\nl=sorted(l)\n\nprint(n-l[-1])', '(n,m)=map(int,input().split())\na=input().split()\na=list(map(int,a))\nl=[]\nk=0\na=sorted(a)\nfor i in range(m-1):\n d=abs(a[i]-a[i+1])\n k=k+d\n l.append(d)\n# k=k-d\nc=n-k\nl.append(c)\nl=sorted(l)\n\nprint(n-l[-1])', "a = input()\nif (a[2]==a[3]) & (a[4] == a[5]):\n print('Yes')\nelse:\n\tprint('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s407442537', 's740471168', 's799275587'] | [3064.0, 3064.0, 2940.0] | [18.0, 18.0, 19.0] | [212, 212, 81] |
p02723 | u262955682 | 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 len(s) < 6:\n print(\'-1\')\n\nelif s[2] == s[3] and s[4] == s[5]:\n print("YES")\nelse:\n print("NO")\n \n', 's = input()\n\nif len(s) < 6:\n print(\'-1\')\n\nelif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n\n \n\n'] | ['Wrong Answer', 'Accepted'] | ['s800496747', 's291082606'] | [2940.0, 2940.0] | [17.0, 18.0] | [127, 129] |
p02723 | u266014018 | 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())\nK = [0]*(N-1)\nfor i in range(1,N):\n for j in range(i+1, N+1):\n idx = min([j-i, abs(X-i)+ abs(j-Y)+1, abs(Y-i) + 1 + abs(X-j)])-1\n K[idx] +=1\nfor value in K:\n print(value) ', "import sys\n\ns = list(input())\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s196500963', 's690231664'] | [3064.0, 2940.0] | [17.0, 17.0] | [229, 102] |
p02723 | u269340384 | 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()\nif string[2]==string[3] and string[4]==string[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'] | ['s021933171', 's299777752'] | [2940.0, 2940.0] | [17.0, 17.0] | [101, 76] |
p02723 | u269749457 | 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 return 'Yes'\nelse:\n return 'No'", "S = input()\n \nif(S[2] == S[3] and S[4] == S[5]):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s527606429', 's586249494'] | [2940.0, 2940.0] | [18.0, 17.0] | [86, 87] |
p02723 | u273787824 | 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\nimport os\n\ndef remove_empty(target_list: list):\n empty_removed_list = [x for x in target_list if x]\n return empty_removed_list\n\ndef get_stdin_str_list():\n input_str = input().strip()\n input_str_list = input_str.split()\n return input_str_list\n\ndef get_stdin_int_list():\n input_str_list = get_stdin_str_list()\n input_int_list = list(map(input_str_list, int))\n return input_int_list\n\n\nS = get_stdin_str_list()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', '# coding: UTF-8\nimport os\n\ndef remove_empty(target_list: list):\n empty_removed_list = [x for x in target_list if x]\n return empty_removed_list\n\ndef get_stdin_str_list():\n input_str = input().strip()\n input_str_list = input_str.split()\n return input_str_list\n\ndef get_stdin_int_list():\n input_str_list = get_stdin_str_list()\n input_int_list = list(map(input_str_list, int))\n return input_int_list\n\n\nS = get_stdin_str_list()[0]\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s763998122', 's920325175'] | [3060.0, 3060.0] | [18.0, 18.0] | [519, 522] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.