s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s822695744 | p03854 | u354916249 | 1562443397 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 358 | S = input()
while True:
if len(S) == 0:
print('YES')
break
else:
if S[-5:]=='dream':
S = S[:-5]
elif S[-7:] == 'dreamer':
S = S[:-7]
elif S[-5:]== 'erase':
S = S[:-5]
elif S[-6:] == X4:
S = S[:-6]
else:
print('NO')
break
|
s487934772 | p03854 | u927534107 | 1562253074 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 418 | s = str(input())[::-1]
while True:
if s[:5]=="maerd" or s[:5]=="esare":
s=s[5:]
if len(s)==0:
print("YES")
exit()
elif s[:6]=="resare"
s=s[6:]
if len(s)==0:
print("YES")
exit()
elif s[:7]=="remaerd":
s=s[7:]
if len(s)==0:
print("YES")
exit()
else:
print("NO")
exit() |
s468976383 | p03854 | u820047642 | 1562096477 | Python | Python (3.4.3) | py | Runtime Error | 122 | 98536 | 568 | def f(s):
if len(s)==0:
print("YES")
exit()
elif 1<=len(s)<=4:
print("NO")
exit()
else:
if s[0:5]=="maerd" or s[0:5]=="esare":
s=s[5:]
f(s)
elif len(s)==5:
print("NO")
exit()
elif s[0:6]=="resare":
s=s[6:]
f(s)
elif len(s)==6:
print("NO")
exit()
elif s[0:7]=="remaerd":
s=s[7:]
f(s)
else:
print("NO")
exit()
S=input()
S=S[::-1]
f(S) |
s421018323 | p03854 | u293403071 | 1561827814 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 311 | s = str(input())
T = ["dream", "dreamer", "erase", "eraser"]
new_s =reversed(s)
new_t = []
for item in T:
new_t.append(reversed(item))
ans_t =''
for c in new_s:
collector += c
if collector in new_t:
ans_t += collector
collector = ''
if new_s == ans_t:
print('YES')
else:
print('NO') |
s745066369 | p03854 | u187233527 | 1561665620 | Python | Python (3.4.3) | py | Runtime Error | 126 | 98520 | 417 | def rec(s):
if s == '':
return True
else:
res = False
res = res or rec(s[7:]) if len(s) > 6 and s[0:7] == 'dreamer' else res
res = res or rec(s[5:]) if len(s) > 4 and s[0:5] == 'dream' else res
res = res or rec(s[5:]) if len(s) > 4 and s[0:5] == 'erase' else res
res = res or rec(s[6:]) if len(s) > 5 and s[0:6] == 'eraser' else res
return res
print('YES' if rec(input()) else 'NO') |
s476752412 | p03854 | u187233527 | 1561665520 | Python | Python (3.4.3) | py | Runtime Error | 125 | 98588 | 357 | def rec(s):
if s == '':
return True
else:
res = False
res = res or rec(s[7:]) if s[0:7] == 'dreamer' else res
res = res or rec(s[5:]) if s[0:5] == 'dream' else res
res = res or rec(s[5:]) if s[0:5] == 'erase' else res
res = res or rec(s[6:]) if s[0:6] == 'eraser' else res
return res
print('YES' if rec(input()) else 'NO') |
s683843585 | p03854 | u263830634 | 1561171198 | Python | Python (3.4.3) | py | Runtime Error | 241 | 13168 | 690 | import numpy as np
S = str(input())
A = ['dream', 'dreamer', 'erase', 'eraseer']
N = len(S)
i = 0
def check(i): #i最初の文字
flag0 = False
flag1 = False
flag2 = False
flag3 = False
flag4 = False
flag5 = False
if S[i:] == 'dream' or S[i:] == 'dreamer' or S[i:] == 'erase' or S[i:] == 'eraser':
flag1 = True
if S[i:i+7] == 'dreamer':
flag2 = check(i+7)
if S[i:i+5] == 'dream':
flag3 = check(i+5)
if S[i:i+6] == 'eraser':
flag4 = check(i+6)
if S[i:i+5] == 'erase':
flag5 = check(i+5)
return flag0 or flag1 or flag2 or flag3 or flag4 or flag5
if check(0):
print ('YES')
else:
print ('NO') |
s344529095 | p03854 | u147745556 | 1560967100 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 105 | R = int(input())
if(R < 1200):
print('ABC')
elif(R < 2800):
print('ARC')
else :
print('AGC') |
s578718045 | p03854 | u102461423 | 1560918280 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 297 | S = input()
while True:
if S[-5:] == 'dream':
S = S[:-5]
continue
elif S[:-7] == 'dreamer':
S = S[:-7]
continue
elif S[-5:] == 'erase':
S = S[:-5]
continue
elif S[-7:] == 'eraser':
S = S[:-7]
continue
break
answer = 'YES' if not S else 'NO
print(answer) |
s632032779 | p03854 | u837677955 | 1560877372 | Python | Python (3.4.3) | py | Runtime Error | 87 | 4212 | 1245 | from collections import deque
S = input()
q = deque(S)
temp = deque()
def delque(qu,str):
for i in range(len(str)):
qu.popleft()
while len(q) > 0:
temp.append( q.popleft() )
if len(temp) == 5:
if ''.join(list(temp)) == 'dream':
if len(q) > 0:
a = q.popleft()
temp.append(a)
if a == 'd':
delque(temp,'dream')
elif a == 'e':
if len(q) > 1:
b = q.popleft()
temp.append(b)
c = q.popleft()
temp.append(c)
if b == 'r':
if c == 'a':
delque(temp,'dream')
elif c == 'd':
delque(temp,'dreamer')
elif c == 'e':
delque(temp,'dreamer')
if ''.join(list(temp)) == 'erase':
if len(q) > 0:
a = q.popleft()
temp.append(a)
if a == 'd' or a == 'e':
delque(temp,'erase')
elif a == 'r':
delque(temp,'eraser')
if len(temp) == 0:
print('YES')
else:
print('NO') |
s278765139 | p03854 | u837677955 | 1560877303 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1202 | q = deque(S)
temp = deque()
def delque(qu,str):
for i in range(len(str)):
qu.popleft()
while len(q) > 0:
temp.append( q.popleft() )
if len(temp) == 5:
if ''.join(list(temp)) == 'dream':
if len(q) > 0:
a = q.popleft()
temp.append(a)
if a == 'd':
delque(temp,'dream')
elif a == 'e':
if len(q) > 1:
b = q.popleft()
temp.append(b)
c = q.popleft()
temp.append(c)
if b == 'r':
if c == 'a':
delque(temp,'dream')
elif c == 'd':
delque(temp,'dreamer')
elif c == 'e':
delque(temp,'dreamer')
if ''.join(list(temp)) == 'erase':
if len(q) > 0:
a = q.popleft()
temp.append(a)
if a == 'd' or a == 'e':
delque(temp,'erase')
elif a == 'r':
delque(temp,'eraser')
if len(temp) == 0:
print('YES')
else:
print('NO') |
s062199510 | p03854 | u023958502 | 1560069511 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 206 | s = input()
s = s.replace('eraser','z')
s = s.repalace('erase','z')
s = s.repalace('dreamer','z')
s = s.repalace('dream','z')
for S in s:
if S != 'z':
print('NO')
else:
print('YES') |
s733779357 | p03854 | u023958502 | 1560069481 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 205 | s = input()
s = s.replace('eraser','z')
s = s.repalace('erase','z')
s = s.repalace('dreamer','z')
s = s.repalace('dream','z')
for S in s:
if S != z:
print('NO')
else:
print('YES')
|
s815882172 | p03854 | u218487880 | 1559877052 | Python | Python (3.4.3) | py | Runtime Error | 121 | 99472 | 774 | def chk_str(instr):
if instr == "" or instr == "er":
return instr
else:
if instr[0:5] == "dream" or instr[0:5]== "erase":
instr = instr[5:]
return chk_str(instr)
else:
if instr[0:2] == "er":
instr = instr[2:]
return chk_str(instr)
else:
if instr[0:1] == "r":
instr = instr[1:]
return chk_str(instr)
else:
return instr
# input
instr = str(input())
if instr[0:4] == "erer" or instr[-4:] == "erer" or instr == "" or instr == "er":
print("NO")
else:
if chk_str(instr) == "" or chk_str(instr) == "er":
print("YES")
else:
print ("NO")
|
s848367210 | p03854 | u059210959 | 1559605499 | Python | Python (3.4.3) | py | Runtime Error | 108 | 9516 | 589 | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
mod = 10**9+7
# sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
S = str(input())
def check(T,S):
if T == S:
return 1
adds = ["dream","dreamer","erase","eraser"]
for i,add in enumerate(adds):
if S[len(T):len(T)+len(add)] == add:
if check(T+add,S) == 1:
return 1
if check("",S):
print("YES")
else:
print("NO")
|
s155278953 | p03854 | u044442911 | 1559337021 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 608 |
def main():
S = input()
while True:
result_1 = search('dreamer$', S)
result_2 = search('eraser$', S)
result_3 = search('erase$', S)
result_4 = search('dream$', S)
if result_1:
S = S[:result_1.start()]
elif result_2:
S = S[:result_2.start()]
elif result_3:
S = S[:result_3.start()]
elif result_4:
S = S[:result_4.start()]
else:
print("NO")
break
if len(S) == 0:
print("YES")
break
if __name__ == "__main__":
main()
|
s785261779 | p03854 | u312654587 | 1559271691 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 466 | import sys
sys.setrecursionlimit(100000)
def str_read(s):
if len(s) == 0:
return True
else:
flag: bool = False
if s[0:5] in ['dream', 'erase']:
flag = flag or str_read(s[5:])
if s[0:6] in ['eraser']:
flag = flag or str_read(s[6:])
if s[0:7] in ['dreamer']:
flag = flag or str_read(s[7:])
return flag
si = input()
if str_read(si):
print('YES')
else:
print('NO')
|
s498966885 | p03854 | u312654587 | 1559271159 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 425 |
def str_read(s):
if len(s) == 0:
return True
else:
flag: bool = False
if s[0:5] in ['dream', 'erase']:
flag = flag or str_read(s[5:])
if s[0:6] in ['eraser']:
flag = flag or str_read(s[6:])
if s[0:7] in ['dreamer']:
flag = flag or str_read(s[7:])
return flag
si = input()
if str_read(si):
print('YES')
else:
print('NO')
|
s726050307 | p03854 | u312654587 | 1559270918 | Python | Python (3.4.3) | py | Runtime Error | 125 | 98536 | 417 |
def str_read(s):
if len(s) == 0:
return True
else:
flag = False
if s[0:5] in ['dream', 'erase']:
flag = flag or str_read(s[5:])
if s[0:6] in ['eraser']:
flag = flag or str_read(s[6:])
if s[0:7] in ['dreamer']:
flag = flag or str_read(s[7:])
return flag
s = input()
if str_read(s):
print('YES')
else:
print('NO')
|
s568818345 | p03854 | u312654587 | 1559270184 | Python | Python (3.4.3) | py | Runtime Error | 125 | 99264 | 462 |
def str_read(s):
if len(s) == 0:
return True
else:
flag = False
if len(s) > 4 and s[0:5] in ['dream', 'erase']:
flag = flag or str_read(s[5:])
if len(s) > 5 and s[0:6] in ['eraser']:
flag = flag or str_read(s[6:])
if len(s) > 6 and s[0:7] in ['dreamer']:
flag = flag or str_read(s[7:])
return flag
s = input()
if str_read(s):
print('YES')
else:
print('NO')
|
s033764230 | p03854 | u312654587 | 1559270078 | Python | Python (3.4.3) | py | Runtime Error | 130 | 98536 | 460 |
def str_read(s):
if len(s) == 0:
return True
else:
flag = False
if len(s) > 4 and s[0:5] in ['dream', 'erase']:
flag = flag or str_read(s[5:])
if len(s) > 5 and s[0:6] in['eraser']:
flag = flag or str_read(s[6:])
if len(s) > 6 and s[0:7] in['dreamer']:
flag = flag or str_read(s[7:])
return flag
s = input()
if str_read(s):
print('YES')
else:
print('NO')
|
s144499525 | p03854 | u312654587 | 1559269818 | Python | Python (3.4.3) | py | Runtime Error | 123 | 98544 | 460 |
def str_read(s):
if len(s) == 0:
return True
else:
flag = False
if len(s) > 4 and s[0:5] in ['dream', 'erase']:
flag = flag or str_read(s[5:])
if len(s) > 5 and s[0:6] in['eraser']:
flag = flag or str_read(s[6:])
if len(s) > 6 and s[0:7] in['dreamer']:
flag = flag or str_read(s[7:])
return flag
s = input()
if str_read(s):
print('Yes')
else:
print('No')
|
s230611720 | p03854 | u039360403 | 1559213130 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1892 | 135292 | 437 | S=list(input())
i=0
while i!=len(S):
if i+6<=len(S) and S[i:i + 6] == ['e', 'r', 'a', 's', 'e', 'r']:
i += 6
elif i+5<=len(S) and S[i:i+5]==['e','r','a','s','e']:
i+=5
elif i+7<=len(S) and S[i:i+7]==['d','r','e','a','m','e','r'] and (len(S[i+7:])==7 or S[i+7]!='a'):
i+=7
elif i+5<=len(S) and S[i:i+5]==['d','r','e','a','m']:
i+=5
else:
print('NO')
exit()
print('YES')
|
s806445033 | p03854 | u039360403 | 1559212839 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1938 | 134652 | 373 | S=list(input())
i=0
while i!=len(S):
if S[i:i + 6] == ['e', 'r', 'a', 's', 'e', 'r']:
i += 6
elif S[i:i+5]==['e','r','a','s','e']:
i+=5
elif S[i:i+7]==['d','r','e','a','m','e','r'] and (len(S[i+7:])==7 or S[i+7]!='a'):
i+=7
elif S[i:i+5]==['d','r','e','a','m']:
i+=5
else:
print('NO')
exit()
print('YES')
|
s157934535 | p03854 | u975966195 | 1559059511 | Python | Python (3.4.3) | py | Runtime Error | 179 | 134376 | 339 | s = input()[::-1]
words = [w[::-1] for w in ['dream', 'dreamer', 'erase', 'eraser']]
can = 'YES'
while s:
print(s)
match_any = False
for w in words:
if s.startswith(w):
s = s.replace(w, '', 1)
match_any = True
break
if not match_any:
can = 'NO'
break
print(can)
|
s001168196 | p03854 | u041075929 | 1558997187 | Python | Python (3.4.3) | py | Runtime Error | 84 | 9496 | 540 | import sys, os
f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
sys.stdin = open('./input.txt', 'r')
a = ['dream', 'dreamer', 'erase', 'eraser']
s = ''
def dfs(t):
if t == s:
return True
for ss in a:
tmpt = t + ss
if len(tmpt)<= len(s) and tmpt == s[:len(tmpt)]:
if(dfs(tmpt)):
return True
return False
def solve():
global s
s = input()
init= ''
if dfs(init):
print('YES')
else:
print('NO')
solve()
|
s710309650 | p03854 | u133886644 | 1558407773 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 8604 | 609 | import sys
from collections import deque
input = sys.stdin.readline
S = list(input().strip())
P = [list(v) for v in ["dream", "dreamer", "erase", "eraser"]]
n = 0
i = 0
his = deque()
while True:
v = P[i]
p = S[n:n+len(v)]
if p == v:
xx = S[n+len(v):]
if xx == []:
print("YES")
exit()
else:
his.append([n, i + 1])
n += len(v)
i = 0
else:
i += 1
if i == 4:
if len(his) == 0:
break
else:
n, i = his.pop()
print("NO") |
s639168304 | p03854 | u133886644 | 1558406481 | Python | Python (3.4.3) | py | Runtime Error | 502 | 5472 | 369 | import sys
input = sys.stdin.readline
S = list(input().strip())
P = [list(v) for v in ["dream", "dreamer", "erase", "eraser"]]
def dfs(n):
if len(S[n:]) == 0:
return True
for v in P:
if S[n:n+len(v)] == v:
if dfs(n + len(v)):
return True
return False
if dfs(0):
print("YES")
else:
print("NO") |
s982015938 | p03854 | u143492911 | 1558320365 | Python | Python (3.4.3) | py | Runtime Error | 78 | 4180 | 395 | def dfs(n):
divide=["dream","dreamer","erase","eraser"]
if n==len(s):
return True
for i in divide:
if n+len(i)<=len(s):
if s[n:n+len(i)]==i:
if dfs(n+len(i)):
return True
return False
s=input()
print("YES") if dfs(0) else print("NO")
|
s404944568 | p03854 | u143492911 | 1558317420 | Python | Python (3.4.3) | py | Runtime Error | 79 | 4184 | 395 | def dfs(n):
divide=["dream","erase","eraser","dreamer"]
if n==len(s):
return True
for i in divide:
if n+len(i)<=len(s):
if s[n:n+len(i)]==i:
if dfs(n+len(i)):
return True
return False
s=input()
print("YES") if dfs(0) else print("NO")
|
s993655800 | p03854 | u143492911 | 1558315934 | Python | Python (3.4.3) | py | Runtime Error | 81 | 4876 | 410 | def dfs(n):
divide=["dream","erase","eraser","dreamer"]
if n==len(s):
return True
for i in divide:
if n+len(i)<=len(s):
if "".join(s[n:n+len(i)])==i:
if dfs(n+len(i)):
return True
return False
s=list(input())
print("YES") if dfs(0) else print("NO")
|
s813081560 | p03854 | u143492911 | 1558305579 | Python | Python (3.4.3) | py | Runtime Error | 81 | 4816 | 402 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
def dfs(n):
if n==len(s):
return True
for i in divide:
if n+len(i)<=len(s):
if "".join(s[n:n+len(i)])==i:
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s727476475 | p03854 | u143492911 | 1558305163 | Python | Python (3.4.3) | py | Runtime Error | 79 | 4812 | 340 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
def dfs(n):
if n==len(s):return True
for i in divide:
if n+len(i)<=len(s):
if "".join(s[n:n+len(i)]):
if dfs(n+len(i)):return True
return False
print("YES") if dfs(0) else print("NO")
|
s036110346 | p03854 | u143492911 | 1558304891 | Python | Python (3.4.3) | py | Runtime Error | 80 | 4812 | 398 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
def dfs(n):
if n==len(s):
return True
for i in divide:
if n+len(i)<=len(s):
if "".join(s[n:n+len(i)]):
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s125113218 | p03854 | u450904670 | 1558291577 | Python | Python (3.4.3) | py | Runtime Error | 1048 | 100792 | 318 | import re
def hoge(str):
if str == "":
return True
for word in ["dreamer", "eraser", "dream", "erase"]:
keyword = word[::-1]
pattern = re.compile(r"^%s" % keyword)
if(pattern.match(str)):
return hoge(re.sub(pattern, "", str))
return False
S= input()
if(hoge(S[::-1])):
print("YES")
else:
print("NO") |
s142576558 | p03854 | u450904670 | 1558288153 | Python | Python (3.4.3) | py | Runtime Error | 1092 | 98792 | 321 | import re
S=input()
def hoge(str):
if str == "":
return True
for word in ["dreamer", "eraser", "dream", "erase"]:
keyword = word[::-1]
pattern = re.compile(r"^%s" % keyword)
if(str.startswith(keyword)):
return hoge(re.sub(pattern, "", str))
return False
if(hoge(S[::-1])):
print("YES")
else:
print("NO") |
s595077866 | p03854 | u450904670 | 1558287749 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 338 | S=input()
def hoge(str):
if str == "":
return True
for word in ["dreamer", "eraser", "dream", "erase"]
keyword = word.sort(reverse=True)
pattern = re.compile(r"^%s" % keyword)
if(str.startswith(keyword)):
return hoge(str.relpace(pattern, ""))
return False
if hoge(S.sort(reverse=True)):
print("YES")
else:
print("NO") |
s503234752 | p03854 | u450904670 | 1558287703 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 337 | S=input()
def hoge(str)
if str == "":
return True
for word in ["dreamer", "eraser", "dream", "erase"]
keyword = word.sort(reverse=True)
pattern = re.compile(r"^%s" % keyword)
if(str.startswith(keyword)):
return hoge(str.relpace(pattern, ""))
return False
if hoge(S.sort(reverse=True)):
print("YES")
else:
print("NO") |
s701132104 | p03854 | u143492911 | 1558283914 | Python | Python (3.4.3) | py | Runtime Error | 81 | 4816 | 401 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
def dfs(n):
if n==len(s):
return True
for i in divide:
if n+len(i)<=len(s):
if "".join(s[n:n+len(i)])==i:
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s876365671 | p03854 | u450904670 | 1558251105 | Python | Python (3.4.3) | py | Runtime Error | 1074 | 98736 | 425 | import re
s=input()
def hoge(str):
if(str == ""):
return "YES"
if(str.startswith("remaerd")):
return hoge(re.sub('^remaerd', '', str))
if(str.startswith("resare")):
return hoge(re.sub('^resare', '', str))
if(str.startswith("maerd")):
return hoge(re.sub('^maerd', '', str))
if(str.startswith("esare")):
return hoge(re.sub('^esare', '', str))
return "NO"
if(s == ""):
print("NO")
else:
print(hoge(s[::-1])) |
s512851016 | p03854 | u450904670 | 1558250703 | Python | Python (3.4.3) | py | Runtime Error | 1073 | 98732 | 425 | import re
s=input()
def hoge(str):
if(str == ""):
return "YES"
if(str.startswith("maerd")):
return hoge(re.sub('^maerd', '', str))
if(str.startswith("remaerd")):
return hoge(re.sub('^remaerd', '', str))
if(str.startswith("esare")):
return hoge(re.sub('^esare', '', str))
if(str.startswith("resare")):
return hoge(re.sub('^resare', '', str))
return "NO"
if(s == ""):
print("NO")
else:
print(hoge(s[::-1])) |
s125774524 | p03854 | u450904670 | 1558250297 | Python | Python (3.4.3) | py | Runtime Error | 1051 | 98740 | 391 | import re
s=input()
def hoge(str):
if(str == ""):
return "YES"
if(str.startswith("maerd")):
return hoge(re.sub('^maerd', '', str))
if(str.startswith("remaerd")):
return hoge(re.sub('^remaerd', '', str))
if(str.startswith("esare")):
return hoge(re.sub('^esare', '', str))
if(str.startswith("resare")):
return hoge(re.sub('^resare', '', str))
return "NO"
print(hoge(s[::-1])) |
s861103821 | p03854 | u450904670 | 1558249942 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3316 | 468 | import re
s=input()
def hoge(str):
if(str == ""):
return "YES"
if(str.startWith("dream".sort(reverse=True))):
return hoge(re.sub('^maerd', '', str))
if(str.startWith("dreamer".sort(reverse=True))):
return hoge(re.sub('^remerd' '', str))
if(str.startWith("erase".sort(reverse=True))):
return hoge(re.sub('^esare', '', str))
if(str.startWith("eraser".sort(reverse=True))):
return hoge(re.sub('^resare', '', str))
return "NO"
print(s.sort(reverse=True)) |
s359262415 | p03854 | u450904670 | 1558249876 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 474 | import re
s=input()
def hoge(str):
if(str == ""):
return "YES"
if(str.startWith("dream".sort(reverse=True))):
return hoge(re.sub('^maerd', '', str))
if(str.startWith("dreamer".sort(reverse=True))):
return hoge(re.sub('^remerd' '', str))
if(str.startWith("erase".sort(reverse=True))):
return hoge(re.sub('^esare', '', str))
if(str.startWith("eraser".sort(reverse=True))):
return hoge(re.sub('^resare', '', str))
return "NO"
print(s.sort(reverse=True)) |
s850024813 | p03854 | u450904670 | 1558249867 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 473 | import re
s=input()
def hoge(str)
if(str == ""):
return "YES"
if(str.startWith("dream".sort(reverse=True))):
return hoge(re.sub('^maerd', '', str))
if(str.startWith("dreamer".sort(reverse=True))):
return hoge(re.sub('^remerd' '', str))
if(str.startWith("erase".sort(reverse=True))):
return hoge(re.sub('^esare', '', str))
if(str.startWith("eraser".sort(reverse=True))):
return hoge(re.sub('^resare', '', str))
return "NO"
print(s.sort(reverse=True)) |
s669537217 | p03854 | u450904670 | 1558249108 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 490 | import re
s=input()
def hoge(str)
res = []
if(str.startWith("dream")):
res.append(re.sub('^dream', '', str))
if(str.startWith("dreamer")):
res.append(re.sub('^dreamer', '', str))
if(str.startWith("erase")):
res.append(re.sub('^erase', '', str))
if(str.startWith("eraser")):
res.append(re.sub('^eraser', '', str))
return res
def fuga(res):
if(len(res) == 0):
return "NO"
if("" in res):
return "YES"
for str in res:
return fuga(hoge(str))
print(fuga([s]) |
s209455045 | p03854 | u450904670 | 1558247726 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 382 | import re
s=input()
def hoge(str)
if(str == ""):
return "YES"
if(str.startWith("dream")):
return hoge(re.sub('^dream', '', str))
if(str.startWith("dreamer")):
return hoge(re.sub('^dreamer', '', str))
if(str.startWith("erase")):
return hoge(re.sub('^erase', '', str))
if(str.startWith("eraser")):
return hoge(re.sub('^eraser', '', str))
return "NO"
print(hoge(s)) |
s168300817 | p03854 | u143492911 | 1558247036 | Python | Python (3.4.3) | py | Runtime Error | 89 | 4916 | 385 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
def dfs(n):
if n==len(s):
return True
for i in divide:
tmp="".join(s[n:n+len(i)])
if n+len(i)<=len(s) and tmp==i:
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s008125512 | p03854 | u143492911 | 1558246987 | Python | Python (3.4.3) | py | Runtime Error | 92 | 4916 | 473 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
def dfs(n):
if n==len(s):#最後まで行ったらtrue
return True
for i in divide:
tmp="".join(s[n:n+len(i)])
if n+len(i)<=len(s) and tmp==i:
if dfs(n+len(i)):
return True
return False
if dfs(0):
print("YES")
else:
print("NO")
#print("YES") if dfs(0) else print("NO")
|
s927238745 | p03854 | u450904670 | 1558246761 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 348 | s=input()
def hoge(str)
if(str == ""):
return "YES"
if(str.startWith("dream")):
return hoge(str.rstrip("dream"))
if(str.startWith("dreamer")):
return hoge(str.rstrip("dreamer"))
if(str.startWith("erase")):
return hoge(str.rstrip("erase"))
if(str.startWith("eraser")):
return hoge(str.rstrip("eraser"))
return "NO"
print(hoge(s)) |
s990929910 | p03854 | u143492911 | 1558246537 | Python | Python (3.4.3) | py | Runtime Error | 92 | 4916 | 431 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
#全探索する
def dfs(n):
if n==len(s):#最後まで行ったらtrue
return True
for i in divide:
tmp="".join(s[n:n+len(i)])
if n+len(i)<=len(s) and tmp==i:
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s210378293 | p03854 | u143492911 | 1558246384 | Python | Python (3.4.3) | py | Runtime Error | 81 | 4116 | 401 | s=input()
divide=["dream","erase","eraser","dreamer"]
#全探索する
def dfs(n):
if n==len(s):#最後まで行ったらtrue
return True
for i in divide:
if n+len(i)<=len(s) and "".join(s[n:n+len(i)])==i:
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s634005304 | p03854 | u143492911 | 1558246080 | Python | PyPy3 (2.4.0) | py | Runtime Error | 324 | 80136 | 407 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
#全探索する
def dfs(n):
if n==len(s):#最後まで行ったらtrue
return True
for i in divide:
if n+len(i)<=len(s) and "".join(s[n:n+len(i)])==i:
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s502675539 | p03854 | u143492911 | 1558245513 | Python | Python (3.4.3) | py | Runtime Error | 84 | 4816 | 407 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
#全探索する
def dfs(n):
if n==len(s):#最後まで行ったらtrue
return True
for i in divide:
if n+len(i)<=len(s) and "".join(s[n:n+len(i)])==i:
if dfs(n+len(i)):
return True
return False
print("YES") if dfs(0) else print("NO")
|
s988373606 | p03854 | u143492911 | 1558245436 | Python | Python (3.4.3) | py | Runtime Error | 84 | 4816 | 448 | s=list(input())
divide=["dream","erase","eraser","dreamer"]
#全探索する
def dfs(n):
if n==len(s):#最後まで行ったらtrue
return True
for i in divide:
if n+len(i)<=len(s) and "".join(s[n:n+len(i)])==i:
if dfs(n+len(i)):
print(n)
return True
return False
print("YES") if dfs(0) else print("NO")
|
s326091007 | p03854 | u292220197 | 1558243905 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 345 | moji = ["dream", "dreamer", "erase", "eraser"]
for i in range(len(moji)):
moji[i] = moji[i][::-1]
s = input()[::-1]
for i in range(0, 3):
tmp = s.replace(moji[i], "")
if tmp != s:
for j in range(1, 3):
ans = tmp.replace(moji[j], "")
if ans != tmp:
flg = "YES"
if flg == "YES":
print("YES")
else:
print("NO") |
s655280282 | p03854 | u078777263 | 1558114178 | Python | Python (3.4.3) | py | Runtime Error | 122 | 98544 | 317 | strings = ["dream","dreamer","erase","eraser"]
def isDaydream(s):
if s == "":
return True
for string in strings:
if s.endswith(string):
if(isDaydream(s[:len(string)*-1])):
return True
return False
if(isDaydream(input())):
print("YES")
else:
print("NO") |
s017295715 | p03854 | u796789068 | 1557952687 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 446 | S=input()
n=0
#print(S)
while S[:]!=S[:n]:
if S[n:n+5]=="dream" or S[n:n+8]=="dreamera":
n+=5 #dream
elif S[n:n+7]=="dreamer" and S[n+7]!="a":
n+=7 #dreamer
elif S[n:n+5]=="erase" and S[n+6]!="eraser":
n+=5 #erase
elif S[n:n+6]=="eraser" and S[n+6]!="a":
n+=6 #eraser
#elif S[:]==S[:n-1]:
#print("YES")
#exit()
else:
print("NO")
exit()
else:
print("YES") |
s959057918 | p03854 | u796789068 | 1557951420 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 363 | S=input()
n=0
While S[:]!=S[:n-1]:
if S[n:n+5]==dream and S[n:n+7]!=dreamer:
n+=5
elif S[n:n+7]==dreamer:
n+=7
elif S[n:n+5]==erase and S[n+6]!=eraser:
n+=5
elif S[n:n+6]==eraser:
n+=6
#elif S[:]==S[:n-1]:
#print("YES")
#exit()
else:
print("NO")
exit()
else:
print("YES") |
s226400172 | p03854 | u078777263 | 1557516399 | Python | Python (3.4.3) | py | Runtime Error | 106 | 4108 | 364 | strings = ["dream","dreamer","erase","eraser"]
def isDaydream(startindex):
if S[startindex:] == "":
return True
for string in strings:
if S[startindex:].startswith(string):
if(isDaydream(len(string)+startindex)):
return True
return False
S = input()
if(isDaydream(0)):
print("YES")
else:
print("NO") |
s293188060 | p03854 | u078777263 | 1557516343 | Python | Python (3.4.3) | py | Runtime Error | 108 | 4120 | 377 | strings = ["dream","dreamer","erase","eraser"]
def isDaydream(startindex):
global S
if S[startindex:] == "":
return True
for string in strings:
if S[startindex:].startswith(string):
if(isDaydream(len(string)+startindex)):
return True
return False
S = input()
if(isDaydream(0)):
print("YES")
else:
print("NO") |
s847329448 | p03854 | u078777263 | 1557515921 | Python | Python (3.4.3) | py | Runtime Error | 126 | 98532 | 316 | strings = ["dream","dreamer","erase","eraser"]
def isDaydream(s):
if s == "":
return True
for string in strings:
if s.startswith(string):
if(isDaydream(s[len(string):])):
return True
return False
if(isDaydream(input())):
print("YES")
else:
print("NO") |
s975600015 | p03854 | u313402971 | 1557515412 | Python | Python (3.4.3) | py | Runtime Error | 134 | 98552 | 323 | strings = ["dream","dreamer","erase","eraser"]
def isDaydream(s):
if s == "":
return True
for string in strings:
if s.startswith(string):
if(isDaydream(s[len(string):])):
return True
return False
S = input()
if(isDaydream(S)):
print("YES")
else:
print("NO") |
s536892630 | p03854 | u313402971 | 1557514771 | Python | Python (3.4.3) | py | Runtime Error | 126 | 98544 | 316 | strings = ["dream","dreamer","erase","eraser"]
def isDaydream(s):
if s == "":
return True
for string in strings:
if s.startswith(string):
if(isDaydream(s[len(string):])):
return True
return False
if(isDaydream(input())):
print("YES")
else:
print("NO") |
s860502287 | p03854 | u481250941 | 1557192452 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 306 | #
# abc049 c
#
s = input()
words = ['dream', 'dreamer', 'erase', 'eraser']
while len(s) > 0:
flag = 0
for w in words:
if s[-1 * len(w):] == w:
s = s.replace(w, "").rstrip()
flag = 1
break
if flag == 0:
print("NO")
exit()
print("YES" |
s484561474 | p03854 | u806855121 | 1557068630 | Python | Python (3.4.3) | py | Runtime Error | 76 | 6500 | 345 | S = input()
P = ['dream', 'dreamer', 'erase', 'eraser']
def makeS(T, flg):
if len(T) > len(S):
return 0
for p in P:
T += p
if T == S:
return 1
else:
flg += makeS(T, flg)
T = T[:len(T)-len(p)]
return flg
if makeS('', 0):
print('YES')
else:
print('NO') |
s849109956 | p03854 | u279229189 | 1557031547 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 280 | words = {"dream": "A", "dreamer": "A", "erase": "A", "eraser": "A"}
ans = []
inputs = list(input())
inputs = inputs.replace("eraser", "").replace("dreamer", "")
inputs = .replace("dream", "").replace("erase", "")
if len(list(inputs)) > 0:
print("No")
else:
print("Yes") |
s568117282 | p03854 | u279229189 | 1557029987 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3956 | 402 | words = {"dream": "A", "dreamer": "A", "erase": "A", "eraser": "A"}
ans = []
inputs = list(input())
tmp1 = []
for c in reversed(inputs):
tmp1.append(c)
tmp2 = "".join([x for x in reversed(tmp1)])
if tmp2 in words:
ans.append("".join(tmp2))
tmp1.clear()
tmp2.clear()
ans = [x for x in reversed(ans)]
if "".join(ans) == "".join(inputs):
print("YES")
else:
print("No") |
s172255055 | p03854 | u528101648 | 1556845166 | Python | Python (2.7.6) | py | Runtime Error | 78 | 98148 | 663 | def check(string):
if len(string) == 0:
return True
else:
if(string.startswith("dreamer")):
tmp = string[7:]
if check(tmp):
return True
if(string.startswith("dream")):
tmp = string[5:]
if check(tmp):
return True
if(string.startswith("eraser")):
tmp = string[6:]
if check(tmp):
return True
if(string.startswith("erase")):
tmp = string[5:]
if check(tmp):
return True
return False
S = raw_input()
if check(S):
print "YES"
else:
print "NO"
|
s466273623 | p03854 | u518042385 | 1556810247 | Python | Python (3.4.3) | py | Runtime Error | 44 | 4084 | 647 | s=list(input())
booler=True
while s!=[] and booler==True:
if s[-5]=="d" and s[-4]=="r" and s[-3]=="e" and s[-2]=="a" and s[-1]=="m":
for i in range(5):
del s[-1]
elif s[-6]=="e" and s[-5]=="r" and s[-4]=="a" and s[-3]=="s" and s[-2]=="e" and s[-1]=="r":
for i in range(6):
del s[-1]
elif s[-5]=="e" and s[-4]=="r" and s[-3]=="a" and s[-2]=="s" and s[-1]=="e":
for i in range(5):
del s[-1]
elif s[-7]=="d" and s[-6]=="r" and s[-5]=="e" and s[-4]=="a" and s[-3]=="m" and s[-2]=="e" and s[-1]=="r":
for i in range(7):
del s[-1]
else:
booler=False
if booler:
print("YES")
else:
print("NO")
|
s128581056 | p03854 | u518042385 | 1556810175 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4084 | 624 | s=list(input())
booler=True
while s!=[]:
if s[-5]=="d" and s[-4]=="r" and s[-3]=="e" and s[-2]=="a" and s[-1]=="m":
for i in range(5):
del s[-1]
elif s[-6]=="e" and s[-5]=="r" and s[-4]=="a" and s[-3]=="s" and s[-2]=="e" and s[-1]=="r":
for i in range(6):
del s[-1]
elif s[-5]=="e" and s[-4]=="r" and s[-3]=="a" and s[-2]=="s" and s[-1]=="e":
for i in range(5):
del s[-1]
elif s[-7]=="d" and s[-6]=="r" and s[-5]=="e" and s[-4]=="a" and s[-3]=="m" and s[-2]=="e" and s[-1]=="r":
for i in range(7):
del s[-1]
else:
booler=False
if b:
print("YES")
else:
print("NO")
|
s661772085 | p03854 | u909236955 | 1556632370 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3444 | 1050 | #coding:utf-8
import re
if __name__ == "__main__":
patterns = ["dream", "dreamer", "erase" ,"eraser"]
S = input()
# while True:
# flag = False
# if S[-5:] == "dream":
# S = S[:-5]
# flag = True
# if S[-7:] == "dreamer":
# S = S[:-7]
# flag = True
# if S[-5:] == "erase":
# S = S[:-5]
# flag = True
# if S[-6:] == "eraser":
# S = S[:-6]
# flag = True
#
# if flag == False:
# print("NO")
# break
#
# if S == "":
# print("YES")
# break
while True:
flag = False
if re.search("dream$",S):
S = re.sub("dream$","",S)
flag = True
if re.search("dreamer$",S):
S = re.sub("dreamer$","",S)
flag = True
if re.search("erase$",S):
S = re.sub("erase$","",S)
flag = True
if re.search("eraser$",S):
S = r
|
s314132674 | p03854 | u137722467 | 1556302253 | Python | Python (3.4.3) | py | Runtime Error | 190 | 134380 | 319 | s = input()
while(1):
print(s)
if s.endswith('dream'):
s = s[:-5]
elif s.endswith('dreamer'):
s = s[:-7]
elif s.endswith('eraser'):
s = s[:-6]
elif s.endswith('erase'):
s = s[:-5]
else:
print("NO")
quit()
if s == '':
break
print("YES") |
s070003078 | p03854 | u911206742 | 1555250919 | Python | Python (3.4.3) | py | Runtime Error | 1039 | 98640 | 498 | import sys
import re
str_array = ['dream', 'dreamer', 'erase', 'eraser']
rev_str_array = [i[::-1] for i in str_array]
S = sys.stdin.readline().strip()
revS = S[::-1]
def strip_string(revS, rev_str_array):
for s in rev_str_array:
if revS.startswith(s):
revS = re.sub("^%s" % s, "", revS)
revS = strip_string(revS, rev_str_array)
else:
continue
else:
return revS
print("YES" if strip_string(revS, rev_str_array) == "" else "NO") |
s775689844 | p03854 | u103393963 | 1555207185 | Python | Python (3.4.3) | py | Runtime Error | 178 | 134376 | 300 | S = input()
N = ["dream", "dreamer", "erase", "eraser"]
bool = True
while bool:
if len(S) == 0:
break
bool = False
for n in N:
if S.endswith(n):
L = S.rsplit(n,1)
S = L[0]
print(S)
bool = True
break
if bool:
print("YES")
else:
print("NO")
|
s557254661 | p03854 | u488178971 | 1555165681 | Python | Python (3.4.3) | py | Runtime Error | 190 | 134512 | 341 | #049 C
S = input()
A = 'dream'
B = 'dreamer'
C = 'erase'
D = 'eraser'
S=S[::-1]
A=A[::-1]
B=B[::-1]
C=C[::-1]
D=D[::-1]
tmp =""
for i in S:
tmp +=i
print(tmp)
for j in [A,B,C,D]:
if tmp == j:
S=S.replace(tmp,"",1)
print(S)
tmp=""
if len(S)==0:
print('YES')
else:
print('NO') |
s317415806 | p03854 | u677440371 | 1555137059 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 293 | S = str(input())S = str(input())
while "eraser" in S:
S=S.replace("eraser","")
while "erase" in S:
S=S.replace("erase","")
while "dreamer" in S:
S=S.replace("dreamer","")
while "dream" in S:
S=S.replace("dream","")
if len(S) == 0:
print("YES")
else:
print("NO") |
s861469579 | p03854 | u837565838 | 1555097921 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 134 | print("YES") if input().replace("eraser", "").replace("erase", "").replace("dreamer", "").replace("dream", "") == "" else print("NO")
|
s153992253 | p03854 | u041075929 | 1555026373 | Python | Python (3.4.3) | py | Runtime Error | 82 | 6900 | 585 | import sys, os
f = lambda:list(map(int,input().split()))
a = ["dream", "dreamer", "erase", "eraser"]
if 'local' in os.environ :
sys.stdin = open('./input.txt', 'r')
t = input().strip()
def dfs(somes):
if somes == t:
return True
if len(somes) >= len(t):
return False
for i in a:
if len(somes) + len(i) <= len(t) and i == t[len(somes):len(somes) + len(i)]:
if dfs(somes+i):
return True
return False
def solve():
s = ""
if dfs(s):
print("YES")
else:
print("NO")
solve()
|
s467935085 | p03854 | u041075929 | 1555026193 | Python | Python (3.4.3) | py | Runtime Error | 80 | 6896 | 550 | import sys, os
f = lambda:list(map(int,input().split()))
a = ["dream", "dreamer", "erase", "eraser"]
if 'local' in os.environ :
sys.stdin = open('./input.txt', 'r')
t = input().strip()
def dfs(somes):
if somes == t:
return True
if len(somes) >= len(t):
return False
for i in a:
if i == t[len(somes):len(somes) + len(i)]:
if dfs(somes+i):
return True
return False
def solve():
s = ""
if dfs(s):
print("YES")
else:
print("NO")
solve()
|
s231416701 | p03854 | u041075929 | 1555025796 | Python | Python (3.4.3) | py | Runtime Error | 80 | 6508 | 512 | import sys, os
f = lambda:list(map(int,input().split()))
a = ["dream", "dreamer", "erase", "eraser"]
if 'local' in os.environ :
sys.stdin = open('./input.txt', 'r')
t = input().strip()
def dfs(somes):
if somes == t:
return True
if len(somes)>= len(t):
return False
temp = somes
for i in a:
if dfs(somes+i):
return True
return False
def solve():
s = ""
if dfs(s):
print("YES")
else:
print("NO")
solve()
|
s296406945 | p03854 | u041075929 | 1555025624 | Python | Python (3.4.3) | py | Runtime Error | 78 | 6512 | 506 | import sys, os
f = lambda:list(map(int,input().split()))
a = ["dream", "dreamer", "erase", "eraser"]
if 'local' in os.environ :
sys.stdin = open('./input.txt', 'r')
t = input()
def dfs(somes):
if somes == t:
return True
if len(somes)>= len(t):
return False
temp = somes
for i in a:
if dfs(somes+i):
return True
return False
def solve():
s = ""
if dfs(s):
print("YES")
else:
print("NO")
solve()
|
s772706634 | p03854 | u533885955 | 1554943574 | Python | Python (3.4.3) | py | Runtime Error | 20 | 4724 | 653 | #C問題
S=str(input())
Slist=list(S)
Slen=len(Slist)
Srev=Slist[::-1]
kari=""
for i in range(Slen):
if len(kari) == 5:
if kari == "maerd":
kari=Srev[i]
elif kari == "esare":
kari=Slev[i]
else:
kari+=Srev[i]
elif len(kari) == 6:
if kari == "resare":
kari=Srev[i]
else:
kari+=Srev[i]
elif len(kari) == 7:
if kari == "remaerd":
kari=Srev[i]
else:
break
else:
kari+=Srev[i]
if kari == "esare" or kari == "maerd" or kari == "resare" or kari == "remaerd":
print("YES")
else:
print("NO") |
s273397973 | p03854 | u956866689 | 1554656639 | Python | Python (3.4.3) | py | Runtime Error | 82 | 6528 | 328 | # -*- coding:utf-8 -*-
import sys
S = input()
T = ""
def isValid(T, str):
tmp = T+str
if len(tmp) > len(S):
return
if tmp == S:
print("YES")
sys.exit()
T = tmp
isValid(T, "dream")
isValid(T, "dreamer")
isValid(T, "erase")
isValid(T, "eraser")
isValid(T, "")
print("NO")
|
s310202023 | p03854 | u013408661 | 1554433839 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 217 | s=input()
while s>0:
if s[-5:]=='dream':
s=s[:-5]
elif s[-5:]=='erase':
s=s[:-5]
elif s[-6:]=='eraser':
s=s[:-6]
elif s[:-7]=='dreamer':
s=s[:-7]
else:
print('NO')
exit()
print('YES') |
s704241612 | p03854 | u633355062 | 1554397683 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 231 | //words = ['dream', 'dreamer', 'erase', 'eraser']
words = ['dream', 'erase', 'aser*', 'er', 'as']
s = input()
for word in words:
s = s.replace(word, '*')
s = s.replace('*', '')
if len(s) == 0:
print('YES')
else:
print('NO')
|
s679432199 | p03854 | u001687078 | 1554154467 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 253 | s = input()[::-1]
while True:
if s[:5] == "maerd":
s = s[5:]
elif s[:7] == "remaerd":
s - s[7:]
elif s[:5] == "esare":
s = s[5:]
elif s[:6] == "resare":
s - s[6:]
else:
break
if s == "":
print("YES")
else:
print("NO") |
s283122436 | p03854 | u005570675 | 1554065623 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38896 | 219 | def dream(s):
ss=s
s=s.replace("maerd","")
s=s.replace("resare","")
s=s.replace("esare","")
s=s.replace("remserd","")
if s=="":
return "YES"
else:
return "NO"
s=input()
s=s[::-1]
print(dream(s)) |
s735159707 | p03854 | u625811641 | 1554025504 | Python | Python (3.4.3) | py | Runtime Error | 125 | 3956 | 347 | s = list(input())
s.reverse()
s = "".join(s)
before_s = s
for _ in range(10**5):
if s[:5]=="maerd" or s[:5] =="esare":
s = s[5:]
elif s[:7]=="remaerd" :
s = s[7:]
elif s[:6] == "resare":
s = s[6:]
if s == "":
ans = "YES"
break
if s == before_s:
ans ="NO"
break
print(ans) |
s762708666 | p03854 | u623819879 | 1553904315 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 38768 | 312 | import sys
sys.setrecursionlimit(1000000)
a=['dream','dreamer','erase','eraser']
def check(c):
rt=False
size=len(c)
if c=='':
return True
for i in a:
if size>=len(i) and c[:len(i)]==i:
rt=check(c[len(i):]) or rt
return rt
print(cnt,'YES' if check(s) else 'NO', s) |
s431351870 | p03854 | u390694622 | 1553457318 | Python | Python (3.4.3) | py | Runtime Error | 126 | 98572 | 375 | S = input()
# S.reverse()
S = S[::-1]
#dream, dreamer, erase, eraser
headers = ["resare","esare","remaerd","maerd"]
def solve(str):
if str == "":
return(True)
else:
for header in headers:
if str.startswith(header):
return(solve(str[len(header):]))
return(False)
if solve(S):
print('YES')
else:
print('NO') |
s781035552 | p03854 | u900688325 | 1553051886 | Python | Python (3.4.3) | py | Runtime Error | 22 | 11892 | 612 | S = input()
def string_cut(string):
if string[0] == 'd' and len(string)>5:
sliced = string[7:]
if sliced[0] == 'a':
sliced = string[5:]
string_cut(sliced)
else:
string_cut(sliced)
if string[0] == 'e' and len(string)>5:
sliced = string[5:]
if sliced[0] == 'r':
sliced = string[6:]
string_cut(sliced)
else:
string_cut(sliced)
if string[0] != 'd' or string[0] != 'e' or len(string) < 5:
print('NO')
if len(string) == 0:
print('YES')
string_cut(S) |
s340209641 | p03854 | u848654125 | 1552646227 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 559 | def erase_end(string):
if string.endswith("dream"):
string = string.rstrip("dream")
elif string.endswith("dreamer"):
string = string.rstrip("dreamer")
elif string.endswith("erase"):
string = string.rstrip("erase")
elif string.endswith("eraser"):
string = string.rstrip("eraser")
elif string == "":
string = "YES"
else:
string = "NO"
return string
string = input()
while True:
if string == "YES" or string == "NO":
string = erase_end(string)
break
print(string) |
s504798332 | p03854 | u040986872 | 1552284947 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 230 | T = input()
lenT = len(T)
a = T.replace("eraser","xxxxxx")
b = a.replace("dreamer","xxxxxxx")
c = b.replace("erase","xxxxx")
d = c.replace("dream","xxxxx")
D = d.count("x")
if D == lenT:
print("YES")
else D < lenT:
print("NO") |
s060017687 | p03854 | u040986872 | 1552284152 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 359 | T = input()
w0 = "dream"
w1 = "dreamer"
w2 = "erase"
w3 = "eraser"
dict_sen = {0:w0,1:w1,2:w2,3:w3}
dp = ""
cnt = 0
cnt1= 0
F = 0
while(cnt < time2):
cnt += 1
for i in range(4):
if T[F:F+len(dict_sen[i])] == dict_sen[i]:
dp.extend(dict_sen[i])
F = len(dp)
cnt1 += 1
break
if dp != T:
print("NO")
else :
print("YES") |
s645984724 | p03854 | u040986872 | 1552283572 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 384 | T = input()
w0 = "dream"
w1 = "dreamer"
w2 = "erase"
w3 = "eraser"
dict_sen = {0:w0,1:w1,2:w2,3:w3}
dp = ""
cnt = 0
cnt1= 0
time = ceil(len(T)/5)
time2 = floor(len(T)/7)
while(cnt < time):
cnt += 1
for i in range(4):
if T[:len(dict_sen[i])] == dict_sen[i]:
T = T[len(dict_sen[i]):]
cnt1 += 1
break
if cnt1 < time2:
print("NO")
else :
print("YES") |
s622408150 | p03854 | u064246852 | 1551909221 | Python | Python (3.4.3) | py | Runtime Error | 120 | 98560 | 372 | s = input()[::-1]
def solve(s):
if s in ["maerd","remaerd","esare","resare"]:
return True
elif len(s) <= 7:
return False
if s[0:5] in ["maerd","esare"]:
return solve(s[5:])
if s[0:6] == "resare":
return solve(s[6:])
if s[0:7] == "remaerd":
return solve(s[7:])
return False
print("YES" if solve(s) else "NO") |
s511058007 | p03854 | u064246852 | 1551905766 | Python | Python (3.4.3) | py | Runtime Error | 152 | 98540 | 426 | def solve(S):
if S in ["dream","dreamer","erase","eraser"]:
return True
elif len(S) <= 7:
return False
if S[0:7] == "dreamer":
return solve(S[7:]) or solve(S[5:])
elif S[0:5] == "dream":
return solve(S[5:])
if S[0:6] == "eraser":
return solve(S[6:])
elif S[0:5] == "erase":
return solve(S[5:])
return False
print("YES" if solve(input()) else "NO") |
s389809794 | p03854 | u064246852 | 1551905528 | Python | Python (3.4.3) | py | Runtime Error | 133 | 98632 | 442 | def solve(S):
if S in ["dream","dreamer","erase","eraser"]:
return True
elif len(S) <= 7:
return False
if S[0:7] == "dreamer":
return solve(S[7:]) or solve(S[5:])
elif S[0:5] == "dream":
return solve(S[5:])
if S[0:6] == "eraser":
return solve(S[6:]) or solve(S[5:])
elif S[0:5] == "erase":
return solve(S[5:])
return False
print("YES" if solve(input()) else "NO") |
s051028202 | p03854 | u064246852 | 1551905235 | Python | Python (3.4.3) | py | Runtime Error | 132 | 98540 | 483 | def solve(S):
if S == "":
return True
if S in ["dream","dreamer","erase","eraser"]:
return True
elif len(S) <= 6:
return False
if S[0:7] == "dreamer":
return solve(S[7:]) or solve(S[5:])
elif S[0:5] == "dream":
return solve(S[5:])
if S[0:6] == "eraser":
return solve(S[6:]) or solve(S[5:])
elif S[0:5] == "erase":
return solve(S[5:])
return False
print("YES" if solve(input()) else "NO") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.