Datasets:
TnT
/
Multi_CodeNet4Repair

Dataset card Data Studio Files
xet
Community
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
u497188176
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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[3]==S[4] and S[5]==S[6]:\n print('Yes')\nelse:\n print('No')\n", "S=input()\nif S[3]==S[4] and S[5]==S[6]:\n print('Yes')\nelse:\n print('No')\n", "S=int(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', 'Runtime Error', 'Runtime Error', 'Accepted']
['s024724410', 's071497565', 's558310959', 's405894741']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0, 17.0]
[87, 79, 83, 79]
p02723
u500990280
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 Print('Yes')\n else:\n Print('No')", "S = input()\n \nif S[3] ==S[4] and S[5] == S[6]:\n print('Yes')\nelse:\n print('No')", "S = input()\n \nif S[2] ==S[3] and S[4] == S[5]:\n Print('Yes')\nelse:\n Print('No')", "S = input()\n \nif S[3] ==S[4] and S[5] == S[6]:\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', 'Accepted']
['s140247082', 's739615262', 's792892314', 's896263787', 's411994164']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 18.0, 17.0]
[84, 81, 81, 81, 81]
p02723
u508061226
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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[3]==S[4] & S[5]==S[6]:\n print("Yes");\nelse:\n print("No");', 'S = input();\n\nif S[3]==S[4] & S[5]==S[6]:\n print("Yes");\nelse\n print("No");', 'S = input();\n \nif S[2]==S[3] and S[4]==S[5]:\n print("Yes");\nelse:\n print("No");\n']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s117348814', 's828802108', 's992276496', 's992561343']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[79, 79, 77, 82]
p02723
u508273185
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 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']
['s738605238', 's551464519']
[2940.0, 3060.0]
[17.0, 19.0]
[81, 81]
p02723
u508842013
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 INT(): x = int(input()) return x\ndef LIST(): x = list(map(int, input().split())) return x\n\nS = input()\nif S[2]==S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")', '\n\nS = str(input())\nif S[2] == S[3] and S[4] == S[5]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s216330942', 's866748440']
[2940.0, 2940.0]
[18.0, 17.0]
[177, 91]
p02723
u509739538
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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] and x[4]==x[5]:\n print("YES")\nelse:\n print("NO")', 'x = input()\nif x[2]==x[3] and x[4]==x[5]:\n print("Yes")\nelse:\n print("No")']
['Wrong Answer', 'Accepted']
['s222595538', 's937877192']
[3060.0, 2940.0]
[19.0, 17.0]
[76, 76]
p02723
u511379665
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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")', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s792264550', 's595108448']
[2940.0, 2940.0]
[17.0, 17.0]
[77, 78]
p02723
u513929200
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['letters = eval(input("Enter: "))\nfor i in letters:\n print(["Yes" if (i[2]==i[3] and i[4]==i[5]) "Yes" if letters=="coffee-like" else "No"])', 'letters = eval(input("Enter: "))\nfor i in letters:\n print("Yes" if (i[2]==i[3] and i[4]==i[5]) "Yes" if letters=="coffee-like" else "No")', 'i = eval(input("Enter: "))\nprint(["Yes" if (i[2]==i[3] and i[4]==i[5]) "Yes" if letters=="coffee-like" else "No"])', 'letters = eval(input("Enter: "))\nfor i in letters:\n\tprint(["Yes" if i[2]==i[3] and i[4]==i[5] else "No"])', 'l = input("Enter: ")\nprint("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")', 'letters = eval(input("Enter your words: "))\nfor i in letters:\n if (i[2]==i[3]) and (i[4]==i[5]:\n print("Yes")\n else:\n print("No")', 'letters = eval(input("Enter: "))\nfor i in letters:\n if i[2]==i[3] and i[4]==i[5]:\n print("Yes")\n elif letters=="coffee-like":\n print("Yes")\n else:\n print("No")', 'letters = eval(input("Enter your words: "))\nfor i in letters:\n print(["Yes" if (i[2]==i[3] and i[4]==i[5]) else "NO" )\n', 'l = eval(input("Enter: "))\nfor i in len(l):\n if len(l)<=6:\n if i[2]==i[3] and i[4]==i[5]:\n print("Yes")\n elif l=="coffee-like":\n print("Yes")\n else:\n print("No")\n print("No")\n ', 'i = eval(input("Enter your words: "))\nif (i[2]==i[3]) and (i[4]==i[5]:\n print("Yes")\nelif i=="coffee-like":\n print("Yes")\nelse:\n print("No")', 'letters = eval(input("Enter your words: "))\nfor i in letters:\n if i[2]==i[3] and i[4]==i[5]:\n print("Yes")\n else:\n print("No")', 'l = input("Enter: ")\nif len(l)<= 6 and l==[a-z]:\n\tprint("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")', 'l = input("Enter: ")\nprint("Yes" if (l[2]==l[3] and l[4]==l[5] else "No"))', 'letters = eval(input("Enter: "))\nif letters.index(2)==letters.index(3) and letters.index(4)==letters.index(5):\n print("Yes)\nelif letters=="coffee-like":\n print("Yes")\nelse:\n print("No")', 'letters = eval(input("Enter your words: "))\nfor i in letters:\n print(["Yes" if (i[2]==i[3] and i[4]==i[5]) else "NO" )', 'letters = eval(input("Enter: "))\nfor i in letters:\n\tprint(["Yes" if i[2]==i[3] and i[4]==i[5] else "No"])\n', 'l = input("Enter: ")\nprint("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")', 'l = input()\nprint("Yes" if (l[2]==l[3] and l[4]==l[5]) else "No")']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s048366694', 's064956347', 's067485974', 's184082973', 's286272754', 's323066912', 's472700173', 's501768358', 's533196821', 's559254647', 's618206347', 's685617266', 's748685728', 's762473213', 's917691766', 's967932151', 's998914318', 's392749685']
[2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 3060.0, 2940.0, 3060.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 18.0, 18.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0]
[140, 138, 114, 105, 74, 141, 171, 120, 205, 153, 134, 103, 74, 189, 119, 106, 74, 65]
p02723
u514065394
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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\tprint('YES')\nelse:\n\tprint('NO')", "s = list(input())\nif s[2] == s[3] and s[4] == s[5]:\n\tprint('Yes')\nelse:\n\tprint('No')"]
['Wrong Answer', 'Accepted']
['s174559771', 's099208549']
[2940.0, 2940.0]
[17.0, 18.0]
[84, 84]
p02723
u514334797
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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]andS[4]==S[5]:\n print("Yes")\nelse:\n print("No")\n ', 'S = input()\n\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse:\n print("No")\n']
['Runtime Error', 'Accepted']
['s305049369', 's477099402']
[8880.0, 8980.0]
[24.0, 23.0]
[84, 82]
p02723
u515740713
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 \nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nS = readline().decode().rstrip()\nif S[0] == S[5] and S[1] == S[4] and S[2] == S[3]:\n print('Yes')\nelse:\n print('No')", "import sys \nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nS = readline().decode().rstrip()\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')"]
['Wrong Answer', 'Accepted']
['s566791140', 's092156252']
[9104.0, 9080.0]
[24.0, 28.0]
[239, 222]
p02723
u517447467
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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[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']
['s099916196', 's332646160']
[2940.0, 2940.0]
[17.0, 17.0]
[80, 81]
p02723
u518064858
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s702199758', 's501057169']
[2940.0, 3064.0]
[17.0, 17.0]
[78, 79]
p02723
u519968172
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s850363358', 's890951728']
[2940.0, 2940.0]
[17.0, 17.0]
[74, 74]
p02723
u520331522
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
["letters = input()\nif letters[2] == letters[3] && letters[4] == letters[5] :\n print('Yes')\n\nelse :\n print('No')", "letters = input()\nif letters[2] == letters[3] and letters[4] == letters[5] :\n print('Yes')\n\nelse :\n print('No')"]
['Runtime Error', 'Accepted']
['s363009825', 's800501424']
[2940.0, 2940.0]
[17.0, 17.0]
[116, 117]
p02723
u521271655
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['words = list(input())\nif words[3] == words[4] and words[5]== words[6]:\n print("Yes")\nelse:\n print("No")', 'words = list(input())\nif words[2] == words[3] and words[4]== words[5]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s884822851', 's740297099']
[2940.0, 2940.0]
[17.0, 17.0]
[109, 109]
p02723
u523957440
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['abcdef=input()\nif c==d and e==f:\n print(yes)\n else:\n print(no)', 'S=input()\nSbara=list(S)\nif Sbara[2]==Sbara[3] and Sbara[4]==Sbara[5]:\n print("yes")\nelse:\n print("no")', 'S=input()\nSbara=list(S)\nif Sbara[2]==Sbara[3] and Sbara[4]==Sbara[5]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s086100840', 's324984016', 's298240554']
[2940.0, 3064.0, 2940.0]
[17.0, 17.0, 17.0]
[67, 104, 104]
p02723
u524922893
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s439941859', 's331839858']
[2940.0, 2940.0]
[17.0, 17.0]
[71, 78]
p02723
u526803885
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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(string):\n if len(string) == 6:\n for i in range(0,len(string)):\n if string[i+2] == string[i+3] and string[i+4] == string[i+5]:\n return 'Yes'\n else:\n return 'No'\n \nprint(coffee('iphone'))", "def coffee(s):\n if len(s) == 6 and s.islower():\n for i in range(0,len(s)):\n if s[i+2] == s[i+3] and s[i+4] == s[i+5]:\n return 'Yes'\n else:\n return 'No'\n else:\n return ''", "def coffee(string):\n if len(string) == 6 and string.islower():\n for i in range(0,len(string)):\n if string[i+2] == string[i+3] and string[i+4] == string[i+5]:\n return 'Yes'\n else:\n return 'No'", 'b=int(input())\nif b>=500:\n overall=b*2\n print(overall)\nelif b<=499 and b>0:\n print(b)\nelif b<=0:\n print(0)', "def coffee_like(s):\n for i in range(0,len(s)):\n if s[i+2] == s[i+3] and s[i+4] == s[i+5]:\n return 'Yes'\n else:\n return 'No'", "def coffee(string):\n if len(string) == 6 and string.islower():\n for i in range(0,len(string)):\n if string[i+2] == string[i+3] and string[i+4] == string[i+5]:\n return 'Yes'\n else:\n return 'No'\n else:\n return 'False'\n \nprint(coffee('COFFEE'))", "def coffee(s):\n if len(s) == 6 and s.lower():\n for i in range(0,len(s)):\n if s[i+2] == s[i+3] and s[i+4] == s[i+5]:\n return 'Yes'\n else:\n return 'No'", 'a=int(input())\nb= a // 500\nbc= a % 500\nabc = bc // 5\nhappy= b * 1000 + abc * 5\nprint(happy)', "def coffee_like(s):\n s=list(str(s))\n for i in range(0,len(s)):\n if s[i+2] == s[i+3] and s[i+4] == s[i+5]:\n return 'Yes'\n else:\n return 'No'", "def coffee(s):\n if len(s) == 6 and s.islower():\n for i in range(0,len(s)):\n if s[i+2] == s[i+3] and s[i+4] == s[i+5]:\n return 'Yes'\n else:\n return 'No'", "s = input()\ns=str(s)\nb=list(s)\nif b[2]==b[3] and b[4]==b[5]:\n print('Yes')\nelse:\n print('No')"]
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s190109077', 's211762783', 's225205465', 's353777852', 's382496198', 's735531515', 's884644974', 's948271618', 's969138602', 's972555718', 's688392382']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 18.0, 17.0, 18.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 18.0]
[311, 281, 287, 126, 184, 371, 245, 91, 205, 247, 103]
p02723
u533632572
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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)>6s=input()\n\nif(s[2]==s[3] and s[4]==s[5]):\n print("Yes")\nelse:\n print("No")\n', 's=input()\n \nif(s[2]==s[3] and s[4]==s[5]):\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s491878699', 's955626928']
[2940.0, 2940.0]
[17.0, 17.0]
[98, 77]
p02723
u534081198
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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:] =="ffee":\n print("Yes")\nelse:\n print("No")', 'S = input()\nif len(set(list(S[2:4]))) == len(set(list(S[4:6]))) == 1:\n print("Yes")\nelse:\n print("No")']
['Wrong Answer', 'Accepted']
['s365883679', 's026072968']
[2940.0, 2940.0]
[17.0, 17.0]
[70, 108]
p02723
u536034761
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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[2] and S[5]==S[4]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s947833590', 's614804959']
[8992.0, 8900.0]
[27.0, 27.0]
[78, 78]
p02723
u538817603
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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())\nprint(s)\nif s[2] == s[3] && 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")']
['Runtime Error', 'Accepted']
['s978466724', 's690783727']
[2940.0, 2940.0]
[17.0, 17.0]
[94, 86]
p02723
u539018546
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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")']
['Wrong Answer', 'Accepted']
['s249605282', 's896192542']
[2940.0, 2940.0]
[18.0, 17.0]
[85, 85]
p02723
u540631540
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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")', 'a,b,c,d,e,f = list(input())\nif c==d and e==f:\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']
['s323867900', 's822882348', 's167754941']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[84, 82, 84]
p02723
u542541293
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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]:\n if S[5] == S[6]:\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']
['s891727274', 's078329887']
[2940.0, 2940.0]
[17.0, 18.0]
[110, 110]
p02723
u546573715
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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())\nSS = S//500\nSSS = (S%500)//5\nprint(1000*SS + 5*SSS)', 'S = int(input())\n\nS500 = S/500\n\nS_nokori = S%500\n\nS5 = S_nokori/5\n\nprint(1000*S500 + 5*S5)', 'X = int(input())\n \nans = (X//500)*1000\nans += ((X % 500)//5) * 5\n \nprint(ans)', '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")\n\n\n', 'S = input()\nSS = S/500\nSSS = (S%500)/5\nprint(1000*SS + 5*SSS)', 'S = int(input())\nS500 = S/500\nS5 = (S%500)/5\nprint(1000*S500 + 5*S5)', "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', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
['s125852389', 's232140581', 's239969555', 's241652254', 's246034705', 's363994753', 's996957176', 's260217002']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0]
[68, 90, 77, 88, 84, 61, 68, 82]
p02723
u546853743
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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(map(str,input().split()))\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')"]
['Runtime Error', 'Accepted']
['s288216001', 's074404117']
[9100.0, 9100.0]
[30.0, 24.0]
[101, 84]
p02723
u550535134
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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")\n', 'S = input()\nprint("Yes" if S[4] == S[5] and S[6] == S[7] else "No")', 'S = input()\nprint("Yes" if S[2] == S[3] and S[4] == S[5] else "No")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s321883898', 's565201299', 's293634106']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 18.0]
[68, 67, 67]
p02723
u551056021
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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_in = input()\nif s_in[2]==s_in[3] and s_in[4]==s_in[5]:\n print('yes')\nelse:\n print('no')\n", "s_in = input()\nif s_in[2]==s_in[3] and s_in[4]==s_in[5]:\n print('yes')\nelse:\n print('no')\n", "s_in = S\nif s_in[2]==s_in[3] and s_in[4]==s_in[5]:\n print('yes')\nelse:\n print('no')", "s_in = input()\nif s_in[2]==s_in[3] and s_in[4]==s_in[5]:\n print('Yes')\nelse:\n print('No')\n"]
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s072173015', 's282159207', 's372580752', 's573453738']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[96, 96, 89, 96]
p02723
u551437236
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s191509935', 's643677608']
[2940.0, 2940.0]
[17.0, 17.0]
[74, 74]
p02723
u555178877
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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("sはcoffeeと似ています")\n\telse;\n print("sはcoffeeと似ていません")\n', 's=input()\n\nif (s[2]==s[3] and s[4]==s[5]):\n\tprint("yes")\nelse:\n print("no")\n', 's = input()\n\nif((s[3]==s[4]) and (s[5]==s[6])):\n \tprint("yes")\nelse:\n\tprint("no")\n', 's = input()\n\nif((s[2]==s[3]) and (s[4]==s[5])):\n \tprint("yes")\nelse:\n\tprint("no")\n', 's=input()\n\nif s[3]==s[4] and s[5]==s[6]\n\tprint("sはcoffeeと似ています")\n\telse\n print("sはcoffeeと似ていません")', 's = input()\n\nif((s[3]==s[4]) and (s[5]==s[6])):\n \tprint("Yes")\nelse:\n\tprint("No")\n', 's=input()\n\nif (s[3]==s[4] and s[5]==s[6]):\n\tprint("yes")\n\telse:\n print("no")\n', 's=input()\n\nif s[3]==s[4] and s[5]==s[6];\n\tprint("sはcoffeeと似ています")\n\telse\n print("sはcoffeeと似ていません")\n', 's=input()\n\nif s[3]==s[4] and s[5]==s[6]:\n\tprint("sはcoffeeと似ています")\n\telse:\n print("sはcoffeeと似ていません")\n', 's = input()\n\nif((s[2]==s[3]) and (s[4]==s[5])):\n \tprint("Yes")\nelse:\n\tprint("No")\n']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s239094768', 's247942055', 's264489843', 's314532703', 's472137115', 's847298044', 's848266860', 's898567596', 's920958877', 's104294084']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0]
[132, 79, 83, 83, 129, 83, 80, 131, 132, 83]
p02723
u566321790
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
["word = map(str, input())\n\nif word[2]==word[3] and word[4]==word[5]:\n print('Yes')\nelse:\n print('No')", "word = str(input())\n \nif word[2]==word[3] and word[4]==word[5]:\n print('Yes')\nelse:\n print('No')"]
['Runtime Error', 'Accepted']
['s740857369', 's357594090']
[2940.0, 2940.0]
[17.0, 17.0]
[102, 98]
p02723
u570112440
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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.length() != 6):\n print("No")\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', 'Accepted']
['s535425649', 's128420961']
[2940.0, 2940.0]
[17.0, 17.0]
[116, 83]
p02723
u571395477
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 K, N = [int(_) for _ in input().split()]\n A = list(map(int, input().split()))\n mx = 0\n\n for i in range(N-1):\n dis = A[i+1]-A[i]\n if dis > mx:\n mx = dis\n se = A[N-1] - A[0]\n if (K-(se)) > mx:\n mx = K - se\n print(mx)\nmain()', "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\nmain()\n\n\n"]
['Runtime Error', 'Accepted']
['s250390009', 's318881291']
[3060.0, 2940.0]
[17.0, 17.0]
[287, 127]
p02723
u571832343
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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] or 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']
['s865338226', 's497898095']
[2940.0, 2940.0]
[17.0, 17.0]
[79, 80]
p02723
u573685971
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 -*-\ntext = list(S)\nif text[2] == text[3]:\n if text[4]==text[5]:\n print('Yes')\n else:\n prinrt('No')\nelse:\n print('No')", "# -*- coding: utf-8 -*-\ntext = list(input())\nif text[2] == text[3]:\n if text[4]==text[5]:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')"]
['Runtime Error', 'Accepted']
['s483634800', 's995153490']
[2940.0, 3064.0]
[17.0, 18.0]
[160, 165]
p02723
u574211979
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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) < 6:\n print("No")\nelse:\n if S[2] == S[3] and S[4] == S[5]:\n print("No")\n else:\n print("No")', 'S = input()\nif len(S) < 6:\n print("No")\nelse:\n if S[2] == S[3] and S[4] == S[5]:\n print("Yes")\n else:\n print("No")']
['Wrong Answer', 'Accepted']
['s897346560', 's753349421']
[2940.0, 2940.0]
[17.0, 17.0]
[136, 137]
p02723
u577189232
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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\tprint("Yes")\nelse:\n\tprint("No")\n', 'S = input()\nif (S[2] == S[3]) and (S[4] == S[5]):\n\tprint("Yes")\nelse:\n\tprint("No")']
['Runtime Error', 'Accepted']
['s729388601', 's975519617']
[2940.0, 2940.0]
[17.0, 17.0]
[78, 82]
p02723
u578647703
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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]:\n if S[5]==S[6]:\n print("Yes")\n else:\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', 'Accepted']
['s781911438', 's842866924']
[2940.0, 2940.0]
[17.0, 18.0]
[119, 119]
p02723
u579943540
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 n.islower:\n\tif n[2]==n[3] and n[4==n[5]:\n\t\tprint("Yes")\n\telse:\n\t\tprint("No")\nelse:\n\tprint("No")', 'n=input()\nif n.islower():\n\tif n[2]==n[3] and n[4]==n[5]:\n\t\tprint("Yes")\n\telse:\n\t\tprint("No")\nelse:\n\tprint("No")']
['Runtime Error', 'Accepted']
['s797019107', 's306835389']
[2940.0, 2940.0]
[17.0, 17.0]
[108, 111]
p02723
u587079202
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['message = input()\n\ntemp_list=list(message)\n\n\nif (temp_list[2] == temp_list[3]) and (temp_list[4] == temp_list[5]):\n print("Yes")\nelse\n print("No")', 'message = input()\n\ntemp_list=list(message)\n\n\nif (temp_list[2] == temp_list[3]) and (temp_list[4] == temp_list[5]):\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s731866514', 's885495030']
[2940.0, 2940.0]
[17.0, 17.0]
[152, 153]
p02723
u588048170
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 a string: "))\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")', 's = str(input("Enter a string: "))\n\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n', 's = str(input())\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s169850726', 's892212774', 's616915297']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[107, 109, 89]
p02723
u595375942
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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[4]=='e' and s[5]=='e' else 'No')", "s=input()\nprint('Yes' if s[2]=='f' and s[3]=='f' and s[4]=='e' and s[5]=='e' else 'No')", "s=input()\nprint('Yes' if s[2]==s[3] and s[4]==s[5] else 'No')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s411595959', 's764139668', 's708314532']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[59, 87, 61]
p02723
u600261652
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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()\nif S[3] == S[4] and S[5] == S[6]:\n print("Yes")\nelse:\n print("No")', 'S = input()\nprint("Yes" if S[2] == S[3] and S[4] == S[5] else "No")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s008267512', 's273271409', 's528516851']
[3064.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[67, 80, 67]
p02723
u601506265
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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[3] == s[4] and s[5] == s[6]:\n print('Yes')\nelse:\n print('No')", "def func(data):\n if data[2] == data[3] and data[4] == data[5]:\n print('Yes')\n else:\n print('No')", "def func(data):\n if data[2] == data[3] and data[4] == data[5]:\n print('Yes')\n else:\n print('No')\nfunc(S)", "def func(data):\n if data[2] == data[3] and data[4] == data[5]:\n print('Yes')\n else:\n print('No')\n\nfunc(s)", "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', 'Runtime Error', 'Accepted']
['s012686475', 's322660930', 's327086205', 's698243938', 's072309218']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0, 17.0]
[68, 104, 112, 113, 79]
p02723
u601980345
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 S[4] == S[5]:\n print(Yes)\n else:\n print(No)\nelse:\n print(No)', '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")']
['Runtime Error', 'Accepted']
['s448469695', 's726873908']
[2940.0, 2940.0]
[17.0, 18.0]
[118, 122]
p02723
u602188782
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 collections\nN,X,Y = map(int,input().split())\nToltN=N*(N-1)/2\nDist=[[0 for i in range(N)] for i in range(N)]\nfor i in range(N):\n for j in range(i,N): \n MyDist=abs(i-(X-1))+abs(j-(Y-1))+1\n if MyDist<j-i:\n Dist[i][j]=MyDist\n else:\n Dist[i][j] = j-i\nfor j in range(N-1):\n ans=[0]\n for i in range(N):\n ans+=Dist[i]\nc = collections.Counter(ans)\nfor i in range(N-1):\n print(c[i+1])\n', '# -*- coding: utf-8 -*-\nS= list(input())\n\nif S[2]==S[3] and S[4]==S[5]:\n YorN="Yes"\nelse:\n YorN="No"\nprint(YorN)']
['Runtime Error', 'Accepted']
['s729884583', 's308126463']
[3316.0, 2940.0]
[22.0, 17.0]
[471, 118]
p02723
u611033537
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 = str(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']
['s084179258', 's902390756', 's416120345']
[2940.0, 2940.0, 2940.0]
[17.0, 18.0, 17.0]
[80, 85, 80]
p02723
u614181788
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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:] == "ffee":\n answer = "Yes"\n\nelse:\n answer = "No"\n\nprint(answer)', 'S = input() \nif S[2] == S[3] and S[4]==S[5]:\n answer = "Yes"\n\nelse:\n answer = "No"\n\nprint(answer)']
['Wrong Answer', 'Accepted']
['s481420535', 's510682589']
[2940.0, 2940.0]
[17.0, 17.0]
[102, 114]
p02723
u615323709
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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()\n\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', 'Runtime Error', 'Accepted']
['s324511163', 's970359393', 's786856688']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[80, 81, 81]
p02723
u616854811
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
["S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print('yes')\nelse:\n print('no')", "S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print('Yes')\nelse:\n print('No')"]
['Wrong Answer', 'Accepted']
['s835571459', 's758256504']
[2940.0, 2940.0]
[17.0, 18.0]
[74, 74]
p02723
u617718239
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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())\narrayP = list(map(int, input().split()))\narrayQ = list(map(int, input().split()))\narrayR = list(map(int, input().split()))\narrayP.sort(reverse=True)\narrayQ.sort(reverse=True)\narrayR.sort(reverse=True)\narrayAns = []\nfor i in range(x):\n arrayAns.append(int(arrayP[i]))\nfor i in range(y):\n arrayAns.append(int(arrayQ[i]))\narrayAns.sort()\nfor i in range(len(arrayR)):\n if len(arrayAns) >= i\n if arrayAns[i] <= int(arrayR[i]):\n arrayAns[i] = int(arrayR[i])\n else:\n break\nprint(sum(arrayAns))\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")']
['Runtime Error', 'Accepted']
['s821566550', 's556242573']
[3064.0, 2940.0]
[17.0, 17.0]
[573, 122]
p02723
u618101737
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 numpy as np\n\n\ndef solve():\n if s[2]==s[3] and s[4]==s[5]:\n print("YES")\n else:\n print("NO")\n return\n\n\ns = str(input())\nsolve()\n', 'import numpy as np\n\n\ndef solve():\n if s[2]==s[3] and s[4]==s[5]:\n print("Yes")\n else:\n print("No")\n return\n\n\ns = str(input())\nsolve()\n']
['Wrong Answer', 'Accepted']
['s931849012', 's320492758']
[13784.0, 12504.0]
[152.0, 152.0]
[198, 198]
p02723
u618160127
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s683787097', 's558267356']
[2940.0, 2940.0]
[17.0, 18.0]
[84, 84]
p02723
u619809897
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 list(input().split())[3] == list(input().split())[4] else print("No")', '\ncoffee = input()\nprint("Yes") if coffee[3] == coffee[4] else print("No")', 'print("Yes") if list(input().split())[3-1] == list(input().split())[4-1] else print("No")', 'coffee = input()\nprint("Yes") if coffee[2] == coffee[3] and coffee[4] == coffee[5] else print("No")']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s061531738', 's080519344', 's669585177', 's907012875']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 18.0]
[85, 73, 89, 99]
p02723
u620549327
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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())\nif (n[2]==n[3])and(n[4]==n[5]):\n print("YES")\nelse:\n print("NO")\n \n', 'n = list(input())\nif (n[5]):\n if (n[2]==n[3])and(n[4]==n[5]):\n print("YES")\n else:\n print("NO")\n \n ', 'n = list(input())\nif (n[5]):\n if (n[2]==n[3])and(n[4]==n[5]):\n print("Yes")\n else:\n print("No")']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s753476990', 's831896986', 's997781425']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[94, 128, 115]
p02723
u621225737
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 return "Yes"\n\nreturn "No"', 'S = input()\nif S[2]==S[3] and S[4]==S[5]:\n\tprint("Yes")\nelse:\n\tprint("No")']
['Runtime Error', 'Accepted']
['s136822740', 's306674305']
[2940.0, 2940.0]
[17.0, 17.0]
[57, 74]
p02723
u621509373
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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\ncondition = s[2]==s[3] and s[3]==s[4]\n\nif condition:\n print("Yes")\nelse:\n print("No")', 's = input()\n \ncondition = s[2]==s[3] and s[4]==s[5]\n \nif condition:\n print("Yes")\nelse:\n print("No")']
['Wrong Answer', 'Accepted']
['s957474034', 's384153561']
[2940.0, 2940.0]
[17.0, 17.0]
[100, 102]
p02723
u624075921
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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) < 6:\n print('No')\nelif s[-1] == [-2] and s[-3] == s[-4]:\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']
['s504238525', 's920651020']
[3060.0, 2940.0]
[17.0, 17.0]
[114, 81]
p02723
u626011428
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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)\nb = x - 500*a\nc = int(b/5)\n\nprint(1000*a + 5*c)\n\n', 'x = list(input())\nif (x[2] ==x[3]) and (x[4]==x[5]):\n print("Yes")\nelse: print("No")']
['Runtime Error', 'Accepted']
['s276836201', 's430784512']
[2940.0, 2940.0]
[17.0, 17.0]
[81, 85]
p02723
u629560745
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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) == 6 and s[2] == s[3] and s[4] == s[5]:\n print('Yse')\nelse:\n print('No')", "s = input()\nif s[2] == s[3] and s[4] == s[5]:\n print('Yse')\nelse:\n print('No')", "s = input()\nif len(s) == 6 and s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s835340363', 's880480125', 's260221953']
[2940.0, 2940.0, 2940.0]
[18.0, 18.0, 17.0]
[100, 84, 100]
p02723
u631998785
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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")\n', '\nS1=list(S)\nif S1[2]==S1[3] and S1[4]==S1[5]:\n print("Yes")\nelse : \n print("No")\n\n', '\nS1=list(S)\nprint(S1)\nif S1[2]==S1[3] and S1[4]==S1[5]:\n print("Yes")\nelse : \n print("No")\n\n', 'S=input()\nif S[2]==S[3] and S[4]==S[5]:\n print("Yes")\nelse : \n print("No")\n\n']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s011880362', 's217749407', 's912965097', 's893173000']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[71, 88, 98, 82]
p02723
u632261919
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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()\n\nif x[2] == x[3] and x[4] == x[5]:\n print("yes")\nelse:\n print("no")', 'x = input()\n\nif x[2] == x[3] and x[4] == x[5]:\n print("Yes")\nelse:\n print("No")']
['Wrong Answer', 'Accepted']
['s176065549', 's427706566']
[2940.0, 2940.0]
[17.0, 17.0]
[85, 85]
p02723
u633284019
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s614454112', 's385730960']
[8864.0, 9100.0]
[24.0, 27.0]
[79, 80]
p02723
u634762694
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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) != 6:\n print("NO")\nelse:\n a = [0]*26\n flag = True\n if s[2] != s[3]:\n flag = False\n if s[4] != s[5]:\n flag = False\n if s[3] == s[4]:\n flag = False\n if s[0] == s[1] or s[0] == s[2]:\n flag = False\n if s[0] == s[4] or s[1] == s[2]:\n flag = False\n if s[1] == s[4]:\n flag = False\n if flag:\n print("YES")\n else:\n print("NO")\n\n', 's = input()\nif len(s) != 6:\n print("NO")\nelse:\n a = [0]*26\n flag = True\n if s[2] != s[3]:\n flag = False\n if s[4] != s[5]:\n flag = False\n if flag:\n print("YES")\n else:\n print("NO")', 's = input()\n\nflag = True\nif s[2] != s[3]:\n flag = False\nif s[4] != s[5]:\n flag = False\nif flag:\n print("YES")\nelse:\n print("NO")', 's = input()\nflag = True\nif len(s) != 6:\n flag = False\n\nfor i in s:\n if ord(i) < 97 or ord(i) > 122:\n flag = False\nif len(s) == 6:\n if s[2] != s[3]:\n flag = False\n if s[4] != s[5]:\n flag = False\nif flag:\n print("YES")\nelse:\n print("NO")', 's = input()\nflag = True\nif len(s) != 6:\n flag = False\n\nfor i in s:\n if ord(i) < 97 or ord(i) > 122:\n flag = False\nif len(s) == 6:\n if s[2] != s[3]:\n flag = False\n if s[4] != s[5]:\n flag = False\nif flag:\n print("Yes")\nelse:\n print("No")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s114174107', 's256418657', 's480682818', 's613993412', 's268926417']
[3064.0, 3060.0, 2940.0, 3060.0, 3060.0]
[17.0, 17.0, 17.0, 17.0, 17.0]
[430, 228, 140, 274, 274]
p02723
u638725699
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 (a45] == a[5]):\n print("Yes")\nelse:\n print("No")', 'a = input()\nif (a[3] == a[4]) and (a[5] == a[6]):\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', 'Runtime Error', 'Accepted']
['s094938260', 's919727633', 's728204416']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0]
[88, 88, 88]
p02723
u638867180
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s059115138', 's723176404']
[2940.0, 2940.0]
[17.0, 17.0]
[73, 74]
p02723
u639703036
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 (n[2] == n[3] and n[4] == n[5]):\n print("YES")\nelse:\n print("NO")', 'n =list(input())\nif (n[2] == n[3] and n[4] == n[5]):\n print("YES")\nelse:\n print("NO")', 'n =input()\nif ((n[2] == n[3]) and (n[4] == n[5])):\n print("YES")\nelse:\n print("NO")', 'n = input()\nif (n[2] == n[3] and n[4] == n[5]):\n print("Yes")\nelse:\n print("No")']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s432981636', 's493045671', 's823426897', 's424325095']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[85, 91, 89, 86]
p02723
u640319601
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s819145890', 's901713833']
[9032.0, 8976.0]
[29.0, 27.0]
[70, 70]
p02723
u646412443
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 queue\n\nn, x, y = map(int, input().split())\nx -= 1\ny -= 1\nINF = 10010101010101\nans = [0]*n\ndef put(v, d):\n if dist[v] != INF:\n return\n dist[v] = d\n q.put(v)\nfor sv in range(n):\n q = queue.Queue()\n dist = [INF for _ in range(n)]\n put(sv, 0)\n while not q.empty():\n v = q.get()\n d = dist[v]\n if v-1 >= 0:\n put(v-1, d+1)\n if v+1 < n:\n put(v+1, d+1)\n if v == x:\n put(y, d+1)\n if v == y:\n put(x, d+1)\n for i in range(n):\n ans[dist[i]] += 1\nfor i in range(n):\n ans[i] = int(ans[i] / 2)\n\nprint(*ans[1:], sep='\\n')", "s = list(input())\nans = True\nif not s[2] == s[3]:\n ans = False\nif not s[4] == s[5]:\n ans = False\nif ans:\n print('Yes')\nelse:\n print('No')\n"]
['Runtime Error', 'Accepted']
['s593007064', 's986820926']
[4080.0, 2940.0]
[29.0, 17.0]
[662, 150]
p02723
u646818123
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['def solve():\n\ts = input()\n \tif s[2] == s[3] and s[4] == s[5]:\n\t\tprint("Yes")\n else:\n\t\tprint("No")\n \nif __name__ == "__main__":\n\tsolve()', 'def solve():\n s = input()\n if s[2] == s[3] and s[4] == s[5]:\n print("Yes")\n else:\n print("No")\n\n return\n\nif __name__ == "__main__":\n solve()']
['Runtime Error', 'Accepted']
['s012371607', 's643670636']
[2940.0, 2940.0]
[17.0, 17.0]
[149, 151]
p02723
u646892595
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 = A[0]\nsub = []\nfor _ in range(N):\n p = A.pop()\n sub.append(K-p)\n K = p\nsub[0] += a\nsub.remove(max(sub))\nprint(sum(sub))', 'K, N = map(int,input().split())\nA = list(map(int, input().split()))\nsub = [A[0]+K-A[N-1]]\nfor _ in range(N-1):\n p = A.pop()\n sub.append(K-p)\n K = p\nsub.remove(max(sub))\nprint(sum(sub))', "S = input()\nans = 'No'\nif S[2] == S[3] and S[4] == S[5]:\n ans = 'Yes'\nprint(ans)"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s087240644', 's113033464', 's848978882']
[3060.0, 3060.0, 2940.0]
[17.0, 17.0, 17.0]
[199, 193, 82]
p02723
u652656291
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 = str(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")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s399117582', 's519961782', 's180841620']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0]
[81, 86, 80]
p02723
u653175574
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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']
['s570053986', 's854556032']
[2940.0, 2940.0]
[19.0, 19.0]
[80, 81]
p02723
u654697086
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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")']
['Wrong Answer', 'Accepted']
['s074311021', 's500721405']
[2940.0, 2940.0]
[18.0, 17.0]
[129, 91]
p02723
u657183715
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
["s=input()\nif s[2]==s[3] and s[4]==s[5]:\n print('YES')\nelse:\n print('No')", 'x=int(input())\nhappiness = 0\nif x>=500:\n ans = divmod(x,500)\n happiness += 1000*ans[0]\n x = ans[1]\n\nif x>=5:\n ans =divmod(x,5)\n happiness += 5*ans[0]\n\nprint(happiness)', "s=input()\nif s[2]==s[3] and s[4]==s[5]:\n print('YES')\nelse:\n print('NO')", "s=input()\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')"]
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s311940277', 's775391867', 's997853510', 's983163596']
[2940.0, 3064.0, 2940.0, 3068.0]
[18.0, 18.0, 17.0, 19.0]
[78, 182, 78, 78]
p02723
u658525821
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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(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']
['s683896622', 's153552553']
[2940.0, 2940.0]
[17.0, 17.0]
[75, 76]
p02723
u660042112
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 print((S[2] == S[3]) & (S[4] == S[5]))', 'if __name__ == "__main__":\n S = input()\n if ((S[2] == S[3]) & (S[4] == S[5])):\n print(\'Yes\')\n else:\n print(\'No\')']
['Wrong Answer', 'Accepted']
['s849809459', 's553272514']
[3060.0, 2940.0]
[19.0, 17.0]
[85, 135]
p02723
u660899380
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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] == 2[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")', 's = input()\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s707704496', 's608461510']
[2940.0, 2940.0]
[17.0, 18.0]
[80, 80]
p02723
u664015993
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['#500-1000, 5-5\n\nx = int(input())\nfiveHundred = x//500\nx -= fiveHundred*500\nfives = x//5\nprint(fiveHundred*1000+fives*5)\n', 's = input()\n\nif s[2]==s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s647662927', 's497126229']
[2940.0, 2940.0]
[17.0, 17.0]
[120, 79]
p02723
u665078057
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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\nklist = [0]*(n)\nfor i in range(1, n):\n for j in range(i+1, n+1):\n k = min(j-i, abs(j-y)+1+abs(x-i))\n klist[k] += 1\n\nfor _ in range(1, n):\n print(klist[_])', "s = input()\nif s[2] == s[3] and s[4] == s[5]:\n print('Yes')\nelse:\n print('No')"]
['Runtime Error', 'Accepted']
['s169996565', 's774967247']
[3060.0, 2940.0]
[17.0, 17.0]
[199, 80]
p02723
u667694979
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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(map(str,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[4]==s[5]:\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s037382995', 's304893462']
[2940.0, 2940.0]
[18.0, 17.0]
[97, 74]
p02723
u670180528
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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().split()\nif c==d and e==f:\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']
['s372090966', 's777759165']
[2940.0, 2940.0]
[17.0, 17.0]
[80, 73]
p02723
u671446913
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['#!/usr/bin/env python3\nimport collections\nimport itertools as it\nimport math\nimport numpy as np\n\n# = input()\n# = int(input())\n# = map(int, input().split())\n# = list(map(int, input().split()))\n\n#\n# c = collections.Counter()\n', "s = input()\n\nprint('Yes' if s[2]==s[3] and s[4]==s[5] else 'No')"]
['Wrong Answer', 'Accepted']
['s109107614', 's374458939']
[23708.0, 2940.0]
[1933.0, 18.0]
[264, 64]
p02723
u672293324
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['s=input()\nif s[2]=s[3]ands[4]=s[5]:\n print("Yes")\nelse:\n print("No") ', 's=input()\nif s[2]=s[3] and s[4]=s[5]:\n print("Yes")\nelse:\n print("No") ', 's=input()\nif s[2]==s[3] and s[4]==s[5]:\n print("Yes")\nelse:\n print("No")\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s382095596', 's428723678', 's963755105']
[2940.0, 2940.0, 2940.0]
[17.0, 18.0, 18.0]
[78, 80, 79]
p02723
u672647070
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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(n, ar):\n status = []\n if ar[3] == ar[4] and ar[5] == ar[6]:\n return 'Yes'\n else:\n return 'No'\n\nif __name__ == '__main__':\n\n n = int(input())\n\n ar = list(map(str, input().rstrip().split()))\n\n result = coffee(n, ar)\n print(result)", "def coffee(ar):\n \n if ar[3] == ar[4] and ar[5] == ar[6]:\n return 'Yes'\n else:\n return 'No'\n\nif __name__ == '__main__':\n\n ar = str(input().split())\n\n result = coffee(ar)\n print(result)", "def coffee(x):\n for i in range(len(x)):\n if x[i+2] == x[i+3] and x[i+4] == x[i+5]:\n return 'Yes'\n else:\n return 'No'", "def coffee(word):\n ar = [char for char in word] \n if (ar[2] == ar[3]) and (ar[4] == ar[5]):\n return 'Yes'\n else:\n return 'No'\n\nif __name__ == '__main__':\n\n ar = str(input())\n\n result = coffee(ar)\n print(result)"]
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s143362530', 's266121193', 's833433495', 's986920282']
[3060.0, 3060.0, 2940.0, 2940.0]
[17.0, 19.0, 17.0, 17.0]
[270, 211, 133, 238]
p02723
u673338219
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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[2]==s[3]) and (s[4]==s[5]):\n print("Yes")\nelse:\n print("No")']
['Runtime Error', 'Accepted']
['s662251699', 's528818699']
[2940.0, 2940.0]
[18.0, 18.0]
[82, 86]
p02723
u673922428
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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\nans="No"\n\nif(S[2]==S[3]):\n if(S[4]==S[5]):\n ans="yes"\n\nprint(ans)\n ', 'S=input()\n \nans="No"\n \nif(S[2]==S[3]):\n if(S[4]==S[5]):\n ans="Yes"\n \nprint(ans)\n ']
['Wrong Answer', 'Accepted']
['s492265377', 's937398612']
[2940.0, 2940.0]
[17.0, 17.0]
[83, 98]
p02723
u674588203
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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.index(2)==S.index(3) and S.index(4)==S.index(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']
['s199855158', 's477187272']
[2940.0, 2940.0]
[17.0, 17.0]
[98, 75]
p02723
u677265530
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 = S.split()\nif S[2]==S[3]:\n if S[4]==S[5]:\n return "Yes"\n else: return "No"\nelse: return "No"', 'S = S.split()\nif (S[2]=="f")&(S[3]=="f"):\n if (S[4]=="e")&(S[5]=="e"):\n return Yes\n else: return No\nelse: return No', 'S = input()\nS = S.split()\nif ((S[2]==S[3])&(S[4]==S[5])):\n\tprint("Yes")\nelse: \n print("No")\n', 'S = input()\n#S = S.split()\nif ((S[2]==S[3])&(S[4]==S[5])):\n\tprint("Yes")\nelse: \n\tprint("No")\n']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s174504738', 's280733253', 's802028716', 's524362832']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0, 17.0]
[100, 120, 95, 93]
p02723
u680144812
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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])', 'S = input()\nprint("Yes" if S[2] == S[3] and S[4] == S[5] else "No")\n']
['Runtime Error', 'Accepted']
['s259504755', 's844191213']
[2940.0, 2940.0]
[17.0, 18.0]
[57, 68]
p02723
u685971021
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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())\nprint(S)\n\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')\n", "S = list(input())\n\nif S[2] == S[3] and S[4] == S[5]:\n print('Yes')\nelse:\n print('No')\n"]
['Wrong Answer', 'Accepted']
['s123936286', 's668469983']
[2940.0, 2940.0]
[17.0, 17.0]
[101, 92]
p02723
u689890477
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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")\n \nesle:\n print("No")', 'a = input()\nif a[2]==a[3] and a[4]==a[5]:\n print("Yes")\n \nesle:\n print("No")', 'a = input()\nif a[2]==a[3] and a[4]==a[5]:\n print("Yes")\n \nelse:\n print("No")']
['Runtime Error', 'Runtime Error', 'Accepted']
['s212386855', 's830141833', 's620923585']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[107, 106, 106]
p02723
u691195128
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal. Given a string S, determine whether it is coffee-like.
['test = input()\nfor test in 6\n print(test)', 'test = input()\nif test[2] == test[3]:\n if test[4] == test[5]:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")\n']
['Runtime Error', 'Accepted']
['s745998574', 's410819739']
[2940.0, 2940.0]
[17.0, 17.0]
[41, 124]
p02723
u692498898
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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')", "s=input()\nif s[2]==s[3] and s[4]==s[5]:\n print('Yes')\nelse:\n print('No')"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s386638628', 's974043806', 's983676736']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 19.0]
[72, 72, 74]
p02723
u692687119
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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')\n\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')\n\nelse:\n print('No')"]
['Runtime Error', 'Accepted']
['s304884842', 's924693846']
[3064.0, 2940.0]
[18.0, 17.0]
[108, 110]
p02723
u693025087
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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 -*-\nX = int(input())\n\nnum_500 = int(X / 500)\nnum_5 = int((X - (num_500*500)) / 5)\n\nprint((num_500*1000) + (num_5)*5)', "# -*- coding: utf-8 -*-\nX, Y, A, B, C = map(int, input().split())\nred_oishisa = list(map(int, input().split()))\ngreen_oishisa = list(map(int, input().split()))\nno_oishisa = list(map(int, input().split()))\n\nred_oishisa = list(sorted(red_oishisa))[::-1]\ngreen_oishisa = list(sorted(green_oishisa))[::-1]\nno_oishisa = list(sorted(no_oishisa))[::-1]\n\noishisa_s = []\n\ni=1\nj=1\nk=1\nwhile(True):\n if len(oishisa_s) == X+Y:\n break\n \n hikaku_dict = dict()\n if i <= X:\n hikaku_dict['red'] = red_oishisa[i-1]\n if j <= Y:\n hikaku_dict['green'] = green_oishisa[j-1]\n if k <= C:\n hikaku_dict['no'] = no_oishisa[k-1]\n \n max_key, max_value = max(hikaku_dict.items(), key=lambda x:x[1])\n oishisa_s.append(max_value)\n if max_key == 'red':\n i += 1\n elif max_key == 'green':\n j += 1\n elif max_key == 'no':\n k += 1\n\nprint(sum(oishisa_s))", "# -*- coding: utf-8 -*-\nstring = input()\n\nif string[2] == string[3] and string[4] == string[5]:\n print('Yes')\nelse:\n print('No')"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s042350276', 's099881636', 's452817725']
[2940.0, 3064.0, 2940.0]
[17.0, 18.0, 17.0]
[136, 900, 130]
p02723
u693391925
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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())\narrayP = list(map(int, input().split()))\narrayQ = list(map(int, input().split()))\narrayR = list(map(int, input().split()))\narrayP.sort(reverse=True)\narrayQ.sort(reverse=True)\narrayR.sort(reverse=True)\narrayAns = []\nfor i in range(x):\n arrayAns.append(int(arrayP[i]))\nfor i in range(y):\n arrayAns.append(int(arrayQ[i]))\narrayAns.sort()\nfor i in range(min(len(arrayR), len(arrayAns))):\n if arrayAns[i] <= int(arrayR[i]):\n arrayAns[i] = int(arrayR[i])\n else:\n break\nprint(sum(arrayAns))', 'x, y, a, b, c = map(int, input().split())\narrayP = list(map(int, input().split()))\narrayQ = list(map(int, input().split()))\narrayR = list(map(int, input().split()))\narrayP.sort(reverse=True)\narrayQ.sort(reverse=True)\narrayR.sort(reverse=True)\narrayAns = []\nfor i in range(x):\n arrayAns.append(int(arrayP[i]))\nfor i in range(y):\n arrayAns.append(int(arrayQ[i]))\narrayAns.sort()\nfor i in range(len(arrayR)):\n if arrayAns[i] <= int(arrayR[i]):\n arrayAns[i] = int(arrayR[i])\n else:\n break\nprint(sum(arrayAns))', "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']
['s066213130', 's125457267', 's787252577']
[3064.0, 3064.0, 2940.0]
[18.0, 18.0, 17.0]
[551, 531, 79]
p02723
u694422786
2,000
1,048,576
A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th 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] == a[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n', 's = input()\n\nif s[2] == s[3] and s[4] == s[5]:\n print("Yes")\nelse:\n print("No")\n']
['Runtime Error', 'Accepted']
['s490513246', 's216223170']
[2940.0, 2940.0]
[17.0, 17.0]
[86, 86]