{"problem":{"name":"Daydream","description":{"content":"You are given a string $S$ consisting of lowercase English letters. Another string $T$ is initially empty. Determine whether it is possible to obtain $S = T$ by performing the following operation an a","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc065_a"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$ consisting of lowercase English letters. Another string $T$ is initially empty. Determine whether it is possible to obtain $S = T$ by performing the following operation an arbitrary number of times:\n\n*   Append one of the following at the end of $T$: `dream`, `dreamer`, `erase` and `eraser`.\n\n## Constraints\n\n*   $1≦|S|≦10^5$\n*   $S$ consists of lowercase English letters.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc065_a","tags":[],"sample_group":[["erasedream","YES\n\nAppend `erase` and `dream` at the end of $T$ in this order, to obtain $S = T$."],["dreameraser","YES\n\nAppend `dream` and `eraser` at the end of $T$ in this order, to obtain $S = T$."],["dreamerer","NO"]],"created_at":"2026-03-03 11:01:14"}}