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 | u695329583 | 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()\nt = 'coffee'\nif s[2] == t[2] and s[3] == t[3] and s[4] == t[4] and s[5] == t[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'] | ['s581368709', 's202574661'] | [9048.0, 8976.0] | [28.0, 25.0] | [133, 86] |
p02723 | u697758384 | 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")\n ', 'S = input()\nif s[2] == s[3] and s[4] == s[5]:\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', 'Accepted'] | ['s147909304', 's435334409', 's885917148', 's800180920'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0, 17.0] | [89, 80, 80, 84] |
p02723 | u705418271 | 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")\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', 'Accepted'] | ['s730877569', 's690506431'] | [9060.0, 8928.0] | [27.0, 29.0] | [80, 81] |
p02723 | u706785092 | 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] and 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'] | ['s085192911', 's889042881'] | [2940.0, 2940.0] | [17.0, 17.0] | [88, 89] |
p02723 | u711754037 | 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 = eval(input())\nprint((user_input // 500) * 1000 + ((user_input % 500) // 5) * 5)', "def Coffee(usr):\n if usr[-1] == usr[-2] and usr[-3] == usr[-4]:\n return 'Yes'\n else:\n return 'No'", 'usr = str(input("Enter: "))\nif usr[-1] == usr[-2] and usr[-3] == usr[-4]:\n\tprint(\'Yes\')\nelse:\n\tprint(\'No\')', "def Coffee(usr):\n if usr[-1] == usr[-2] and usr[-3] == usr[-4]:\n return 'Yes'\n else:\n return 'No'", "usr = eval(input())\nif usr[-1] == usr[-2] and usr[-3] == usr[-4]:\n print('Yes')\nelse:\n print('No')", 'usr = str(input("Enter: "))\nif usr[-3] == usr[-4] and usr[-1] == usr[-2]:\n\tprint(\'Yes\')\nelse:\n\tprint(\'No\')', 'usr = str(input("Enter: "))\nif usr[-1] == usr[-2] and usr[-3] == usr[-4]:\n\tprint(\'Yes\')\nelse:\n\tprint(\'No\')', 'string = input("").lower()\nprint("Yes" if (string[2] == string[3]) and (string[4] == string[5]) else "No")'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s140198665', 's199379350', 's387356948', 's543640994', 's683887021', 's698202483', 's885133272', 's773545422'] | [2940.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [92, 117, 106, 117, 104, 107, 106, 106] |
p02723 | u713914478 | 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())\nR = list(map(int, input().split()))\nG = list(map(int, input().split()))\nN = list(map(int, input().split()))\n\nR.sort(reverse=True)\nG.sort(reverse=True)\nN.sort(reverse=True)\n\nR2 = R[:X]\nG2 = G[:Y]\n\nW = sorted(R2 + G2 + N, reverse=True)\n\nprint(sum(W[0:X+Y]))', 'S = input()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s394438925', 's233710364'] | [3064.0, 2940.0] | [18.0, 17.0] | [292, 80] |
p02723 | u723711163 | 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\nflag = False\n\nif str[2] == str[3] and str[4] == str[5]:\n flag = True\n \nprint(flag)', "str = input()\n \nflag = False\n \nif str[2] == str[3] and str[4] == str[5]:\n flag = True\n \nif flag:\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s820196438', 's743260021'] | [2940.0, 2940.0] | [18.0, 18.0] | [99, 134] |
p02723 | u723844943 | 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("Enter 6 letters: ")\nif S[2]==S[3] and S[4]==S[5] :\n print("Yes")\nelif len(S)<=5:\n print("No")\nelse:\n print("No")', 'S=input("Enter 6 letters: ")\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', 'Wrong Answer', 'Accepted'] | ['s036576115', 's058571750', 's477300962'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [130, 98, 82] |
p02723 | u724742135 | 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 sys import exit, stdin\nS = stdin.readline().rstrip()\nif S[3] == S[4] and S[5] == S[6]:\n print('Yes')\nelse:\n print('No')\n", "from sys import exit, stdin\nS = stdin.readline().rstrip().split()\nif S[3] == S[4] and S[5] == S[6]:\n print('Yes')\nelse:\n print('No')", "from sys import exit, stdin\nS = stdin.readline().rstrip()\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s137579261', 's554358948', 's176832407'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [127, 134, 126] |
p02723 | u726285999 | 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()\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s358230044', 's772883517'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 84] |
p02723 | u727021494 | 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("enter string ")\nif S is S.lower():\n if len(S) == 6:\n if S[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\n else: \n print("No")\n else:\n print("No")', 'S = input("enter string ")\nif len(S) == 6:\n if S[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\n else: \n print("No")\n else:\n print("No")', 'S = input()\nif S is S.lower():\n if len(S) == 6:\n if S[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\n else: \n print("No")\n else:\n print("No")', 'S = input("enter string ")\nS.lower()\nif len(S) == 6:\n if S[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\n else: \n print("No")\n else:\n print("No")', 'S = input("enter string ").lower()\n\nif len(S) == 6:\n if S[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\n else: \n print("No")\n else:\n print("No")', 'S = input("enter string ")\nif S[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\n else: \n print("No")\nelse:\n print("No")\n', 'S = input()\nS = S.lower()\nif len(S) == 6:\n if S[2] == S[3]:\n if S[4] == S[5]:\n print("Yes")\n else: \n print("No")\n else:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s087609452', 's161694656', 's348814714', 's354189970', 's722783467', 's981878388', 's838333416'] | [2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [236, 185, 221, 195, 194, 128, 184] |
p02723 | u727726778 | 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]:\n\tif s[5] == s[6]:\n \t print("Yes")\nelse:\n\tprint("No")', 's = input()\n\nif s[3] == s[4]:\n\tif s[5] == s[6]:\n \t print("Yes")\n else:\n \t print("No")', 's = input()\nif s[2]==s[3] and s[4]==s[5]:\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s214551084', 's404753420', 's724296605'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [85, 107, 74] |
p02723 | u727980193 | 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. | ["\nsrc = input()\nif src[3] == src[4] and src[5] == src[6]:\n print('Yes')\nelse:\n print('No')", "a,b,c,d,e,f = input()\nif c == d and e == f:\n print('Yes')\nelse:\n print('No')\n "] | ['Runtime Error', 'Accepted'] | ['s379283669', 's350003916'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 81] |
p02723 | u732390946 | 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\nstr = input()\nstrlist = list(str)\nprint(strlist)\n\nif str[2] == str[3] and str[4] == str[5]:\n print("Yes")\nelse:\n print("No")\n', '# -*- coding: utf-8 -*-\n\nstr = input()\nstrlist = list(str)\n\nif str[2] == str[3] and str[4] == str[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s181170419', 's498436739'] | [3060.0, 2940.0] | [19.0, 17.0] | [156, 141] |
p02723 | u732743460 | 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")', 's = input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s599347086', 's066853595'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 76] |
p02723 | u736342571 | 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 z in a:\n if a[3]==a[4] & a[5]==a[6] :\n print("Yes")\n else :\n print("No")', 'a = input()\nb = []\nfor z in a:\n b.apppend(z)\nif b[2]==b[3]:\n if b[4]==b[5]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")\n ', 'a = input()\nb = []\nfor z in a:\n b.append(z)\nif b[2]==b[3]:\n if b[4]==b[5]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s015531703', 's928481558', 's605267358'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [96, 141, 137] |
p02723 | u739885912 | 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('Enter something: ')\nif S[2] == S[3] and S[4] == s[5]:\n print('Yes')\nelse:\n print('No')", "s = input('Enter something: ')\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')", "S = input('Enter something: ')\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', 'Wrong Answer', 'Accepted'] | ['s047106791', 's726096235', 's753449956', 's507732953'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0, 17.0] | [103, 103, 103, 84] |
p02723 | u742529680 | 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] && 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', 'Accepted'] | ['s769732704', 's157308505'] | [2940.0, 2940.0] | [18.0, 17.0] | [73, 79] |
p02723 | u743354620 | 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')"] | ['Runtime Error', 'Accepted'] | ['s047753141', 's423005808'] | [3064.0, 2940.0] | [18.0, 17.0] | [81, 82] |
p02723 | u746849814 | 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'] | ['s402370238', 's496784463'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 84] |
p02723 | u747941497 | 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")', 's = str(input())\nif s[3]==s[4] and s[5]==s[6]:\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'] | ['s163762379', 's828992144', 's183592109'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [85, 81, 89] |
p02723 | u749614185 | 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")\ns="coffee"\nprint(s[4])\n', 'S=(input())\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")\ns="coffee"\nprint(s[4])\n', 'S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s400222595', 's403805262', 's802486002'] | [8964.0, 9016.0, 8996.0] | [28.0, 27.0, 26.0] | [98, 100, 74] |
p02723 | u751539777 | 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\nnum_500 = x / 500\n\namari = x - num_500\n\nnum_5 = int(amari / 5)\n\nprint(1000 * num_500 + 5 * num_5)', 'N = input()\nif(N[2] == N[3] and N[4] == N[5]):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s391567070', 's841364393'] | [3068.0, 2940.0] | [17.0, 17.0] | [115, 85] |
p02723 | u754511616 | 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:\n print(', "a,b,c,d,e,f=input()\nif c==d and e==f:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s981713501', 's192841572'] | [8892.0, 9016.0] | [25.0, 27.0] | [46, 72] |
p02723 | u760802228 | 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")'] | ['Runtime Error', 'Accepted'] | ['s236160183', 's380754112'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 92] |
p02723 | u760961954 | 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\n500yen = x//500*1000\n5yen = (x - x//500)//5*5\n\nprint(500yen + 5yen)\n', 's = input()\n\nif(s[3] == s[4] and s[5] == s[6]):\n print("Yes")\n \nelse:\n print("No")', 'x = int(input())\n\n500yen = x//500*1000\n5yen = x%500//5*5\n\nprint(500yen + 5yen)\n', 's = input()\n\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'] | ['s427280821', 's599272493', 's814006052', 's021052905'] | [3188.0, 2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0, 17.0] | [86, 85, 79, 85] |
p02723 | u762325798 | 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. | ['total, N = map(int, input().split())\nnums = list(map(int, input().split()))\nif N == 1:\n print(0)\nelse:\n ans = total - (total - nums[-1] + nums[0])\n prev = nums[0]\n for num in nums[1:]:\n ans = min(total-(num - prev), ans)\n prev = num\n print(ans)\n', 'ele = input().strip()\nif ele[2] == ele[3] and ele[4] == ele[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s185047334', 's936786004'] | [3060.0, 2940.0] | [17.0, 17.0] | [274, 104] |
p02723 | u771156630 | 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 length(s) == 6:\n if s[2] == s[3]:\n \tif s[4] == s[5]:\n print("Yes")\n\telse:\n \tprint("No")\n', 's = input()\n\nif s[-1] == s[-2]:\n if s[-3] == s[-4]:\n print("Yes")\n print("No")\nelse:\n print("No")', '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")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s367604410', 's417675792', 's026156262'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [111, 103, 110] |
p02723 | u773265208 | 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 dijkstra(s,n,w,cost):\n \n \n d = [float("inf")] * n\n used = [False] * n\n d[s] = 0\n\n while True:\n v = -1\n \n for i in range(n):\n if (not used[i]) and (v == -1):\n v = i\n elif (not used[i]) and d[i] < d[v]:\n v = i\n if v == -1:\n break\n used[v] = True\n\n for j in range(n):\n d[j] = min(d[j],d[v]+cost[v][j])\n return tuple(d)\n\nn,x,y = map(int,input().split())\n\n\ncost = [[float("inf") for i in range(n)] for i in range(n)]\n\nfor i in range(n-1):\n cost[i][i+1] = 1\n cost[i+1][i] = 1\ncost[x-1][y-1] = 1\ncost[y-1][x-1] = 1\n\nans = [0 for _ in range(n)]\nfor i in range(n):\n \n res = dijkstra(i,n,n,cost)\n for j in range(i+1,n):\n ans[res[j]] += 1\n\nfor i in range(1,n):\n print(ans[i])\n', "s = input()\n\nif s[2] == s[3] and s[4] == s[5]:\n\tprint('Yes')\nelse:\n\tprint('No')\n"] | ['Runtime Error', 'Accepted'] | ['s578273372', 's869489233'] | [3064.0, 2940.0] | [17.0, 17.0] | [1148, 80] |
p02723 | u780147002 | 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 = input("")\nif(S[2].__eq__(S[3]) and S[4].__eq__(S[5])):\n print("Yes")\nelse:\n print("No")', 'S = input("")\nif(S[2].__eq__(S[3]) and S[4].__eq__(S[5])):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s274773893', 's765567327'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 97] |
p02723 | u783340206 | 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 s:\n if s[2] == s[3] and s[5] == s[6]:\n print("Yes")\n else:\n print("No")', 's = input()\nsr = set(s)\nif s[i]==sr[i]:\n print("Yes")\nelse:\n print("No")', 's = input()\nfor i in s:\n if s[i] == s[i+1]:\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")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s118578428', 's506846576', 's961292969', 's981484011'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 18.0] | [100, 74, 85, 80] |
p02723 | u789436713 | 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]:print("Yes")\nelse print("No")', 's=input()\nif s[2]==s[3] and s[4]==s[5]:print("Yes")\nelse :print("No")'] | ['Runtime Error', 'Accepted'] | ['s213560879', 's470122586'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 69] |
p02723 | u791110052 | 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]:\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")'] | ['Runtime Error', 'Accepted'] | ['s653813430', 's362479642'] | [2940.0, 2940.0] | [17.0, 18.0] | [79, 88] |
p02723 | u794858045 | 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] is S[4] and S[5] is S[6]:\n print("Yes")\nelse:\n print("No")', 'S=input()\nif S[2] is S[3] and S[4] is S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s598174749', 's022460014'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 82] |
p02723 | u798260206 | 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 = list(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', 'Wrong Answer', 'Accepted'] | ['s013421152', 's888079660', 's343896242'] | [2940.0, 3060.0, 2940.0] | [17.0, 19.0, 17.0] | [84, 90, 84] |
p02723 | u798675549 | 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'] | ['s436658113', 's060520781'] | [2940.0, 2940.0] | [18.0, 17.0] | [74, 74] |
p02723 | u799528852 | 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()\na = list(s)\nif a[2] == a[3] and a[4] == a[5]:\n print("Yes")\nelse:\n print("No") \n', 's = input()\na = list(s)\nif a[2] == a[3] and a[4] == a[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s457228019', 's189682978'] | [2940.0, 2940.0] | [17.0, 18.0] | [109, 96] |
p02723 | u802067645 | 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")\nelse:\n print("NO")\n', 's = list(input())\nfor i in s:\n if (s[2] == s[3] and s[4] == s[5]):\n print("YES")\n else:\n print("NO")', 's = list(input())\nif (s[2] == s[3] and s[4] == s[5]):\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s565646186', 's929104013', 's384476682'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [93, 108, 93] |
p02723 | u805066078 | 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'] | ['s414140765', 's472911870'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 89] |
p02723 | u809819902 | 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'] | ['s976936856', 's461306414'] | [2940.0, 8916.0] | [17.0, 28.0] | [66, 61] |
p02723 | u810066979 | 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()\n\nif n[2] == \'f\' and n[3] == \'f\' and n[4] == \'e\' and n[5] == \'e\':\n\tprint("Yes")\nelse:\n\tprint("No")', 'n = input()\n\nif n[2] == \'f\' and n[3] == \'f\' and n[4] == \'e\' and n[5] = \'e\':\n\tprint("Yes")\nelse:\n\tprint("No")', 'n = input()\n\nif n[2] == n[3] and n[4] == n[5] :\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s528052437', 's954645044', 's876439214'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [109, 108, 81] |
p02723 | u815218584 | 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\tprint("Yes")\nelse print("No");', "\ns=input()\nif (s[2]==s[3] and s[4]==s[5] ):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s099119380', 's075157533'] | [2940.0, 2940.0] | [17.0, 17.0] | [77, 78] |
p02723 | u815931251 | 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()\n\nzero = False\nif 0 in a:\n a.remove(0)\n n = n - 1\n zero = True\n #print("contain 0.")\n\nl1 = a[n-1] - a[0] \nl2 = a[0] + k - a[n-1] \nif zero == True:\n ret = l2\nelse:\n ret = l1 if l1 < l2 else l2\nprint("{}".format(ret))', 's = input()\nret = "No"\nif s[2] == s[3] and s[4]==s[5]:\n ret = "Yes"\nprint("{}".format(ret))'] | ['Runtime Error', 'Accepted'] | ['s078977983', 's527280552'] | [3064.0, 2940.0] | [18.0, 17.0] | [348, 94] |
p02723 | u817381202 | 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. | ['nyuryoku = input()\nprint(nyuryoku[4:5],nyuryoku[5:6])\n\nresult = "No"\nif nyuryoku[4:5] == nyuryoku[5:6]:\n if nyuryoku[2:3] == nyuryoku[3:4]:\n result = "Yes"\n \nprint(result)', 'nyuryoku = input()\n\nresult = "No"\nif nyuryoku[4:5] == nyuryoku[5:6]:\n if nyuryoku[2:3] == nyuryoku[3:4]:\n result = "Yes"\n \nprint(result)'] | ['Wrong Answer', 'Accepted'] | ['s214063641', 's337112512'] | [2940.0, 3064.0] | [17.0, 17.0] | [178, 143] |
p02723 | u819593641 | 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[2] == a[3]) & (a[4] == a[5]):\n print(Yes)\nelse:\n print(No)', 'a = input()\nif a[2] == a[3] && a[4] == a[5]:\n print(Yes)\nelse:\n print(No)', 'a = input()\nif (a[2] == a[3]) & (a[4] == a[5]):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s231479181', 's730529252', 's401238118'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [78, 75, 82] |
p02723 | u821432765 | 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. | ['\nfor i in range(10**11):\n pass\n\n', '\nS = input()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")\n\n'] | ['Time Limit Exceeded', 'Accepted'] | ['s291288273', 's283354479'] | [2940.0, 2940.0] | [2103.0, 17.0] | [35, 83] |
p02723 | u823885866 | 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\nS = sys.readline()\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')", "import sys\nS = sys.stdin.readline()\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s482830374', 's289397538'] | [2940.0, 2940.0] | [17.0, 18.0] | [98, 105] |
p02723 | u827554201 | 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!\n\ninput1 = [int(x) for x in input().split()]\nlake = input1[0]\nhomes = input1[1]\ninput2 = [int(x) for x in input().split()]\n\nresult = 1000000\nlast = homes - 1\nfor x in range(homes):\n forward = 0\n backward = 0\n start = input2[x]\n\n # forward\n if x == 0:\n forward = input2[last] - start\n else:\n forward = (lake - start) + input2[x - 1]\n \n # backward\n if x == last:\n backward = (start) - input2[0]\n else:\n backward = (start) + lake - (input2[x + 1])\n\n #print("forward: {}, backward: {}".format(forward, backward))\n result = min(result, forward, backward)\n\nprint(result)\n', 'string = input()\n\nif string[2] == string[3] and string[4] == string[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s144703884', 's247498702'] | [3064.0, 3064.0] | [18.0, 17.0] | [662, 107] |
p02723 | u828139046 | 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()\nif str[2] == str[3] and str[4] == str[5]:\n print('YES')\nelse:\n print('NO')", "str = input()\nif str[2] == str[3] and str[4] == str[5]:\n\tprint('Yes')\nelse:\n\tprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s771302191', 's899064624'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 88] |
p02723 | u830881690 | 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'] | ['s107845667', 's077260825'] | [2940.0, 2940.0] | [17.0, 17.0] | [86, 86] |
p02723 | u834983620 | 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())\n\nif a[2] == a[3] and a[4] == a[5]:\n print("true")\nelse:\n print("false")', 'n,a,b = map(int,input().split())\ncount_list = [0]*n\n\ncnt = 0\nfor i in range(1,n):\n for k in range(i+1,n+1):\n a0 = k-i\n a1 = abs(a-i)+ abs(b-k) + 1\n count_list[cnt] = min(a0,a1)\n #print(i,"@",k,"@",a0,"@",a1,"@",count_list,cnt)\n cnt += 1\n \n \n\nfor result in range(1,n+1):\n print(count_list.count(result))', 'a = list(input())\n \nif a[2] == a[3] and a[4] == a[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s812265283', 's970481386', 's138677679'] | [2940.0, 3064.0, 2940.0] | [18.0, 18.0, 17.0] | [95, 325, 92] |
p02723 | u837673618 | 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 functools import *\nfrom collections import *\nimport sys\nsys.setrecursionlimit(10**6)\ninput = sys.stdin.buffer.readline\n \nM = 10**9+7\n\n@lru_cache(maxsize=None)\ndef mod_inv(x):\n if x == 1:\n return 1\n return M // x * -mod_inv(M%x) % M\n\n@lru_cache(maxsize=None)\ndef calc_subtree(v):\n ret = 1\n size = 1\n for child in Edge[v]:\n Edge[child].remove(v)\n r, s = calc_subtree(child)\n ret = ret * r % M\n size += s\n ret = ret * size % M\n return ret, size\n\nans = {}\ndef set_ans(v, a):\n ans[v] = a\n for child in Edge[v]:\n n = calc_subtree(child)[1]\n set_ans(child, ans[v] * n * mod_inv(N-n) % M)\n\nN = int(input())\nEdge = defaultdict(set)\nfact = N\nfor i in range(1, N):\n fact = fact * i % M\n a, b = map(int, input().split())\n Edge[a].add(b)\n Edge[b].add(a)\n\nset_ans(1, mod_inv(calc_subtree(1)[0]) * fact % M)\nfor i in range(1, N+1):\n print(ans[i])\n\n', 'S = input()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s747321894', 's862399858'] | [3700.0, 2940.0] | [24.0, 18.0] | [873, 76] |
p02723 | u841599623 | 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] & 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'] | ['s941570689', 's380183131'] | [3060.0, 2940.0] | [19.0, 17.0] | [76, 78] |
p02723 | u843013665 | 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("Max len = 6 \\n").lower()\nif len(S)!=6:\n print("Len Error")\nelif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")\n', 'S = input().lower()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s280316398', 's678738163'] | [2940.0, 3060.0] | [17.0, 19.0] | [144, 89] |
p02723 | u844697453 | 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] & a[4]==a[5]:\n print("Yes")\nelse:\n print("No")', 'a = list(input())\nif a[2]==a[3] and a[4]==a[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s765170354', 's936315404'] | [2940.0, 2940.0] | [18.0, 17.0] | [84, 86] |
p02723 | u845847173 | 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[3] == S[4] and S[5] == S[6]:\n print("Yes")\nelse:\n print("No")', 'S = str(input())\n\nif S[3] == S[4] 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', 'Runtime Error', 'Accepted'] | ['s334836822', 's661535881', 's674872560'] | [3068.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [90, 90, 90] |
p02723 | u848263468 | 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[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")'] | ['Runtime Error', 'Accepted'] | ['s755490819', 's085570750'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 78] |
p02723 | u850243304 | 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().split()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n', 's = input().split()\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', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s312375385', 's530567045', 's544586890', 's662556737'] | [9072.0, 9012.0, 9064.0, 8992.0] | [27.0, 25.0, 25.0, 26.0] | [85, 93, 93, 85] |
p02723 | u851704997 | 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'] | ['s605489255', 's076754722'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 81] |
p02723 | u852124489 | 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]:\n if S[5] == S[6]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No") \n', 'S=input()\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'] | ['s956373352', 's576090577'] | [2940.0, 2940.0] | [17.0, 17.0] | [125, 121] |
p02723 | u854612823 | 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'] | ['s519880868', 's451364065'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 80] |
p02723 | u854867898 | 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. | ['# maintain overall min \n\n# find the absolute distance and before exiting the first maintain overall min\n# also check the distance of last and first house\ndef findDistBetween(i,j):\n return abs(i - j)\n\ndef minDistfindDistBetweenLastAndFirstHouse(i,j):\n dist = findDistBetween(i, j)\n return K - dist \n\nK, N = input().split()\nAs = input().split()\n\nK = int(K)\nN = int(N)\n\n# print ("As is")\n# print (As)\n# print (As.split())\nA = [0] * len(As)\nfor i in range(len(As)):\n A[i] = int(As[i])\n \n# A = list(map(lambda x: int(x), As))\n# print (A)\n# overAllMin = float(\'inf\')\n# minDist = 0 \n\n# minDist = 0\n# for j in range(N):\n# # print (i, j)\n# minDist += findDistBetween(A[i], A[j])\n# # find the dist b/w last and first house\n# # minDist2 = minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1])\n\n\n\n\n\n# print (overAllMin)\noverAllMin = float(\'inf\')\nArev = list(reversed(A))\ndist1 = 0 \ndist2 = 0\nprevHouse = -1\nfor i in range(N):\n # print ("PRev house", prevHouse)\n # print ("Next house", A[i])\n\n dist1 = max(findDistBetween(A[i], prevHouse), dist1)\n prevHouse = A[i]\n \n\nma = max(dist1, minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1]))\nprint (K - ma)\n\n# count = 0\n# curHouse = A[i]\n# j = i\n# flag0 = 0 \n# flag1 = 0\n# dist1 = 0 \n# dist2 = 0\n# while count < N:\n# if flag0 is 0:\n# dist1 += findDistBetween(curHouse, A[j])\n# curHouse = A[j]\n# j += 1\n# flag0 = 0\n# count += 1\n\n# if j == N and count < N: \n# print ("in condition")\n# j = 0\n# dist1 += minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1])\n# flag0 = 1\n \n # count += 1\n\n # print ("dist1", dist1)\n\n # count = 0\n # curHouse = A[i]\n # j = i\n # while count < N:\n # if flag1 is 0:\n # dist2 += findDistBetween(curHouse, A[j])\n # curHouse = A[j]\n # j -= 1\n # count += 1\n # flag1 = 0\n # if j == -1 and count < N: \n # j = N - 1 \n # dist2 += minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1])\n # flag1 = 1\n # # count += 1 \n# overAllMin = min(dist1, K - findDistBetween(A[0], A[-1]), overAllMin)\n# print (dist1, K - findDistBetween(A[0], A[-1]), overAllMin)\n \n# print (overAllMin) \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n', '# maintain overall min \n\n# find the absolute distance and before exiting the first maintain overall min\n# also check the distance of last and first house\ndef findDistBetween(i,j):\n return abs(i - j)\n\ndef minDistfindDistBetweenLastAndFirstHouse(i,j):\n dist = findDistBetween(i, j)\n return K - dist \n\nK, N = input().split()\nAs = input().split()\n\nK = int(K)\nN = int(N)\n\nprint ("As is")\nprint (As)\n# print (As.split())\nA = [0] * len(As)\nfor i in range(len(As)):\n A[i] = int(As[i])\n \n# A = list(map(lambda x: int(x), As))\n# print (A)\n# overAllMin = float(\'inf\')\n# minDist = 0 \n\n# minDist = 0\n# for j in range(N):\n# # print (i, j)\n# minDist += findDistBetween(A[i], A[j])\n# # find the dist b/w last and first house\n# # minDist2 = minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1])\n\n\n\n\n\n# print (overAllMin)\noverAllMin = float(\'inf\')\nArev = list(reversed(A))\ndist1 = 0 \ndist2 = 0\nprevHouse = -1\nfor i in range(N):\n #print ("PRev house", prevHouse)\n #print ("Next house", A[i])\n\n dist1 = max(findDistBetween(A[i], prevHouse), dist1)\n prevHouse = A[i]\n \n\nma = max(dist1, minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1]))\nprint (K - ma)\n\n# count = 0\n# curHouse = A[i]\n# j = i\n# flag0 = 0 \n# flag1 = 0\n# dist1 = 0 \n# dist2 = 0\n# while count < N:\n# if flag0 is 0:\n# dist1 += findDistBetween(curHouse, A[j])\n# curHouse = A[j]\n# j += 1\n# flag0 = 0\n# count += 1\n\n# if j == N and count < N: \n# print ("in condition")\n# j = 0\n# dist1 += minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1])\n# flag0 = 1\n \n # count += 1\n\n # print ("dist1", dist1)\n\n # count = 0\n # curHouse = A[i]\n # j = i\n # while count < N:\n # if flag1 is 0:\n # dist2 += findDistBetween(curHouse, A[j])\n # curHouse = A[j]\n # j -= 1\n # count += 1\n # flag1 = 0\n # if j == -1 and count < N: \n # j = N - 1 \n # dist2 += minDistfindDistBetweenLastAndFirstHouse(A[0], A[-1])\n # flag1 = 1\n # # count += 1 \n# overAllMin = min(dist1, K - findDistBetween(A[0], A[-1]), overAllMin)\n# print (dist1, K - findDistBetween(A[0], A[-1]), overAllMin)\n \n# print (overAllMin) \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n', 'S = input()\n\nif len(S) > 6:\n if S[2] is S[3] and S[4] is S[5]:\n print ("Yes")\n exit()\nprint ("No")\n \n ', 'S = input()\n\nif len(S) >= 6:\n if S[2] is S[3] and S[4] is S[5]:\n print ("Yes")\n exit()\nprint ("No")\n \n '] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s558304792', 's830500472', 's971585951', 's619407429'] | [3064.0, 3064.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0, 17.0] | [2672, 2666, 129, 130] |
p02723 | u859773831 | 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())\nprint(n//500 * 1000 + (n%500)//5 * 5)', 's=input()\nif s[3-1]==s[4-1] and s[5-1]==s[6-1]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s673800318', 's655965292'] | [2940.0, 3064.0] | [17.0, 17.0] | [52, 82] |
p02723 | u860966226 | 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. | ['data = input()\n\nif data[3] == data[4] and data[5] == data[6]:\n print("Yes")\nelse:\n print("No")\n', 'data = input()\n \nif data[2] == data[3] and data[4] == data[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s738956689', 's093525960'] | [2940.0, 2940.0] | [18.0, 18.0] | [97, 98] |
p02723 | u865222833 | 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 s = input().strip()\n if s[2] == s[3] and s[4] == s[5]:\n print('True')\n else:\n print('False')\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n s = input()\n if s[2] == s[3] and s[4] == s[5]:\n print('Yes')\n else:\n print('No')\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s600852992', 's903446623'] | [2940.0, 9060.0] | [17.0, 28.0] | [169, 157] |
p02723 | u867616076 | 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] && 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'] | ['Runtime Error', 'Accepted'] | ['s692739687', 's392690060'] | [8944.0, 9076.0] | [21.0, 30.0] | [89, 90] |
p02723 | u868339437 | 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)\n else:\n print(\'No\')\nelse:\n print("No")\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'] | ['s491179610', 's741229646'] | [2940.0, 2940.0] | [17.0, 17.0] | [121, 122] |
p02723 | u869265610 | 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()\nfor i in range(4):\n if N[i]==N[i+1]:\n print("Yes")\n exit()\n else:\n print("No")\n', 'N=input()\nif N[2]==N[3]: and N[4]==N[5]:\n print("Yes")\nelse:\n print("No")\n', 'N=input()\nfor i in range(6):\n if N[i]==N[i+1]:\n print("Yes")\n exit()\n else:\n print("No")', 'N=input()\nif N[2]==N[3] and N[4]==N[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s017400299', 's309643300', 's515111691', 's655330396'] | [8984.0, 8884.0, 9020.0, 9012.0] | [28.0, 22.0, 24.0, 27.0] | [100, 76, 99, 74] |
p02723 | u871873383 | 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())\ntot=int(X/500)\ny=X-tot*500\ntot=tot*1000 + int(y/5)*5\nprint(tot)', "S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s186226915', 's097179610'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 78] |
p02723 | u872158847 | 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. | ['val = input()\nif val[2] == val[3] && val[4] == val[5]:\n print("Yes")\nelse:\n print("No")\n', 'val = input()\nif val[2] == val[3] and val[4] == val[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s959637065', 's347808987'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 95] |
p02723 | u872323287 | 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]:\n if [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'] | ['s984804180', 's400081840'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 80] |
p02723 | u873736356 | 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')\n", "S = input()\nif(S[2] == S[3] and S[4] == S[5]):\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s674637743', 's206795137'] | [2940.0, 2940.0] | [18.0, 17.0] | [86, 86] |
p02723 | u877829843 | 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())\nX = min(x,y)\nY = max(x,y)\nx =X\ny = Y\nsum = x +y +1\ndist = x+1\nfor i in range(2,dist):\n\tsum += dist//i\ndist = n+1-y\nfor j in range(2,dist):\n\tsum += dist//j\ndist = y+1-x\nsum+= dist\nfor k in range(2,dist):\n sum += dist//k\nsum+= y-n+2', "txt = input()\nif( txt[2] == txt[3] and txt[4] == txt[5]):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s142050492', 's536225473'] | [3064.0, 2940.0] | [17.0, 17.0] | [267, 92] |
p02723 | u878291720 | 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\nS = sys.argv\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'] | ['s936944528', 's643713052'] | [2940.0, 2940.0] | [18.0, 17.0] | [88, 76] |
p02723 | u878654696 | 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*500*2+x%500//5*5)', 'a = input()\nprint("Yes" if a[2] == a[3] and a[4] == a[5] else "No")'] | ['Runtime Error', 'Accepted'] | ['s097234227', 's811725561'] | [2940.0, 2940.0] | [18.0, 17.0] | [47, 67] |
p02723 | u879248892 | 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()))\nans1 = max(a) - min(a)\nfor i in range (0,n):\n if a[i] >= (k/2):\n a[i] = a[i] - k\nans2 = abs(max(a) - min(a))\nprint(min(ans1,ans2))', 's = input()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s403360968', 's988798106'] | [3060.0, 2940.0] | [18.0, 17.0] | [208, 80] |
p02723 | u880221923 | 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] and s[4] == s[5]:\n "Yes"\nelse:\n "No"\n', 's = list(input())\n\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s941450405', 's669968541'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 91] |
p02723 | u882013918 | 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 print('NO')", "s = input()\nprint('Yes') if s[2] == s[3] and s[4] == s[5] else print('No')"] | ['Wrong Answer', 'Accepted'] | ['s813808845', 's892751805'] | [2940.0, 2940.0] | [17.0, 17.0] | [74, 74] |
p02723 | u888437858 | 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"\n', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s459254780', 's690756469'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 79] |
p02723 | u889018047 | 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=\'ejkld\'\na=S[2]\nb=S[3]\nc=S[4]\nd=S[5]\n\nif a == b and c == d:\n print("yes")\nelse:\n print("no")', 'import random\nletters = \'abcdefghijklmnopqrstuvwxyz\'\nS=random.choices(letters, k=5)\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'str=input()\nS=print(str)\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'str = input()\nS = print(str)\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'S=\'coffee\'\na=S[2]\nb=S[3]\nc=S[4]\nd=S[5]\n\nif a == b and c == d:\n print("yes")\nelse:\n print("no")', 'S=imput()\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'S=\'kihnki\'\na=S[2]\nb=S[3]\nc=S[4]\nd=S[5]\n\nif a == b and c == d:\n print("yes")\nelse:\n print("no")', 'S=\'\'\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'S=\'iphone\'\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'S=\'coffee\'\na=S[2]\nb=S[3]\nc=S[4]\nd=S[5]\n\nif (a == b) and (c == d):\n print("yes")\nelse:\n print("no")', 'S=\'coffee\'\na=S[2]\nb=S[3]\nc=S[4]\nd=S[5]\nif a == b and c == d:\n print("yes")\nelse:\n print("no")', 'coffee\nstr=input()\nS=print(str)\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', 'S=\'coffee\'\na=print(S[2])\nb=print(S[3])\nc=print(S[4])\nd=print(S[5])\n\nif a == b and c==d:\n print("yes")\nelse:\n print("no")', 'S=\'coffee\'\na=S[2]\nb=S[3]\nc=S[4]\nd=S[5]\nif a == b and c == d:\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', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s046775945', 's249267280', 's273410475', 's288401723', 's305327022', 's335645887', 's442182132', 's453323517', 's597376072', 's648760782', 's652460627', 's714494824', 's808524279', 's882946372', 's305453778'] | [2940.0, 4336.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 32.0, 18.0, 17.0, 18.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0] | [100, 157, 98, 102, 101, 83, 101, 78, 84, 105, 100, 105, 127, 100, 86] |
p02723 | u890785941 | 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'] | ['s666433030', 's644154984'] | [2940.0, 2940.0] | [17.0, 18.0] | [74, 74] |
p02723 | u892882715 | 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\nprint(X // 500 * 1000 + X % 500 // 5 * 5)\n', 'if S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")\n ', 'word = input()\n\nif word[2] == word[3] and word[4] == word[5]:\n print("Yes")\nelse:\n print("No")\n \n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s468924711', 's552411988', 's842748477'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [60, 71, 100] |
p02723 | u893297141 | 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'] | ['s814653003', 's996874225'] | [8904.0, 8712.0] | [27.0, 27.0] | [80, 80] |
p02723 | u899929023 | 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'] | ['Wrong Answer', 'Accepted'] | ['s361796875', 's505685825'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 77] |
p02723 | u904547029 | 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 = list(map(int,input().split()))\nA = list(map(int,input().split()))\n\nmiddle = K // 2\n\ni=0\nwhile A[i] <= middle:\n i += 1\n\nd0 = A[i] - A[i-1]\nd1 = K - A[-1] + A[0]\n\nif d0 >= d1: print(K - d0)\nelse: print(K-d1)\n', 'word = input()\nif word[2]==word[3] and word[4]==word[5]:\n print ("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s763668285', 's879279356'] | [3060.0, 2940.0] | [17.0, 17.0] | [213, 92] |
p02723 | u904995051 | 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. | ['#ABC160A\ns = input()\nprint("Yes" if s[3]==s[4] ans s[5]==s[6] else "No")', '#ABC160A\ns = input()\nprint("Yes" if s[3]==s[4] and s[5]==s[6] else "No")\n', '#ABC160A\ns = input()\nprint("Yes" if s[2]==s[3] and s[4]==s[5] else "No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s711124331', 's989463755', 's276460483'] | [9036.0, 8940.0, 9060.0] | [21.0, 23.0, 27.0] | [72, 73, 72] |
p02723 | u913461467 | 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] & s[4]==s[5]:\n print("Yes")\nelse:\n print("No")', 's = input()\nif s[3]=s[4] && s[5]=s[6]:\n print("Yes")\nelse:\n print("No")', 'S = str(input())\nif S[2]==S[3] & S[4]==S[5]:\n print("Yes")\nelse:\n print("No")', 's = str(input())\nif s[2]=s[3] & s[4]=s[5]:\n print("Yes")\nelse:\n print("No")', 's = input()\nif s[2]=s[3] && 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', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s072942022', 's232275667', 's292993168', 's365590683', 's734034224', 's605412976'] | [3064.0, 2940.0, 2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [79, 73, 79, 77, 73, 81] |
p02723 | u914802579 | 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] ans 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'] | ['s945623203', 's731186235'] | [2940.0, 2940.0] | [18.0, 17.0] | [74, 78] |
p02723 | u915647268 | 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 queue\n\ndef push(n, dist, dist_list):\n\tif dist_list[n] > dist:\n\t\tdist_list[n] = dist\n\t\tq.put(n)\n\n\n\nq = queue.Queue()\nn, x, y = [int(i) for i in input().split()]\nresult = [0] * (n-1)\n\nfor p in range(n):\n\tdist_list = [111111] * n\n\tdist = 0\n\tq.put(p)\n\tdist_list[p] = dist \n\twhile not q.empty():\n\t\tp = q.get()\n\t\tdist = dist_list[p]\n\t\tif p+1 < n: push(p+1, dist+1, dist_list)\n\t\tif p-1 >= 0: push(p-1, dist+1, dist_list)\n\t\tif p == (x-1): push(y-1, dist+1, dist_list)\n\t\tif p == (y-1): push(x-1, dist+1, dist_list)\n\t\n\tfor i in dist_list:\n\t\tif i != 0:\n\t\t\tresult[i-1] += 1\n\nfor ans in result:\n\tprint(ans//2)\n\t\t\n\n\n\n\n', 'S = input()\nif S[2] == S[3] and S[4] == S[5]:\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Runtime Error', 'Accepted'] | ['s386217765', 's291291943'] | [3952.0, 2940.0] | [26.0, 18.0] | [611, 78] |
p02723 | u916662650 | 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] and s[4] == s:\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'] | ['s399129449', 's365811786'] | [2940.0, 2940.0] | [18.0, 17.0] | [88, 91] |
p02723 | u923647326 | 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'] | ['s856626981', 's049493042'] | [2940.0, 2940.0] | [18.0, 17.0] | [80, 85] |
p02723 | u924671994 | 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")\n\nelse: print("no")', 'a= input()\n\nif a[2] == a[3] and a[4] == a[5]:\n print("Yes")\n\nelse: print("No")'] | ['Wrong Answer', 'Accepted'] | ['s547016850', 's649978249'] | [8952.0, 8992.0] | [29.0, 28.0] | [79, 79] |
p02723 | u924783770 | 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())\n\n\ndef count(k):\n count=0\n for i in range(1,N):\n for j in range(i+1,N+1):\n if min(abs(j-i),abs(X-i)+abs(Y-j)+1)==k:\n count+=1\n if count >= 4:\n break\n return count\n\nfor k in range(1,N):\n print(count(k))', 'S=list(input())\n\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s891882508', 's075659817'] | [3060.0, 2940.0] | [17.0, 17.0] | [310, 85] |
p02723 | u928480992 | 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)", "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'] | ['s201739221', 's358915543', 's384096534', 's549536484'] | [2940.0, 2940.0, 3188.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [80, 79, 79, 80] |
p02723 | u929996201 | 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] || s[4]!=s[5]):\n print("No")\n exit()\nelse:\n print("Yes")', 's = input()\nif(s[2]!=s[3] or s[4]!=s[5]):\n print("No")\n exit()\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s747728780', 's793725566'] | [8836.0, 9084.0] | [20.0, 28.0] | [85, 85] |
p02723 | u931173291 | 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. | ['e = list(map(int,input().split()))\nK = e[0]\nN = e[1]\na = list(map(int,input().split()))\nc = [a[i+1] - a[i] for i in range(N-1)]\nf = a[0]+ K - a[N-1]\nc.append(f)\nd = max(c)\nprint(K - d)\n', "s = input()\nif s[2] == s[3]:\n if s[4] == s[5]:\n print('Yes')\n else: print('No')\nelse: \n print('No') "] | ['Runtime Error', 'Accepted'] | ['s229777083', 's872698844'] | [3060.0, 2940.0] | [18.0, 17.0] | [185, 118] |
p02723 | u940402366 | 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=sorted(A)\nA.append(A[0]+K)\ni=0\nb=0\nfor i in range(N):\n if b<A[i+1]-A[i]:\n b=A[i+1]-A[i]\nprint(K-b)', "S=list(input())\nprint('Yes'if S[2]==S[3]and S[4]==S[5] else 'No')\n"] | ['Runtime Error', 'Accepted'] | ['s109268466', 's349633415'] | [3064.0, 2940.0] | [17.0, 17.0] | [172, 66] |
p02723 | u949115942 | 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\nAn = list(map(int, input().split()))\n\nnode = [An[i+1] - An[i] for i in range(len(An) - 1)]\n\nnode = node[:] + [k - An[n-1] + An[0]]\n\nprint(k - max(node))', "S = input()\nif (S[2] == S[3]) and (S[4] == S[5]):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s087201633', 's089942730'] | [3060.0, 2940.0] | [18.0, 17.0] | [187, 88] |
p02723 | u950337877 | 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. | ["\ns = input()\na = list(s)\n if a[2] == a[3] and a[4] == a[5]:\n print('Yes')\n else:\n print('No')\n", 'coin = int(input())\nsiawase = 0\nif coin >= 500:\n siawase = siawase + int(coin / 500) * 1000\n amari = int(coin % 500)\n siawase = siawase + int(amari / 5) *5\nelif coin >= 5:\n siawase = siawase + int(coin / 5) * 5\n \nprint(int(siawase))\n', "\ns = input()\na = list(s)\nif a[2] == a[3] || a[4] == a[5]:\n print('Yes')\nelse:\n print('No')", 'coin = int(input())\nsiawase = 0\nif coin >= 500:\n siawase = siawase + int(coin / 500) * 1000\n amari = coin % 500\n siawase = siawase + int(amari / 5) *5\nelif coin >= 5:\n siawase = siawase + int(coin / 5) * 5\n \nprint(int(siawase))\n', "\ns = input()\na = list(s)\nif a[2] == a[3] and a[4] == a[5]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s227826925', 's886609803', 's903679075', 's905575269', 's545945723'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0] | [140, 248, 122, 243, 123] |
p02723 | u953379577 | 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")\n'] | ['Runtime Error', 'Accepted'] | ['s062415763', 's000947985'] | [2940.0, 2940.0] | [18.0, 18.0] | [68, 81] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.