Submission #1307429

---

Source Code Expand

#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const int inf = 999999999;
const double pi = acos(-1);

#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())

ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}

///////////////////////////////////////////////////////////////////////////

int main(){
	string s;
	cin >> s;
	string t[4] = {"dreamer", "dream", "eraser", "erase" };

	while(s != ""){
	   // cout << s << endl;
        rep(i,0,4){
            int index = s.rfind(t[i]);
            if(index != -1 && index == (int)s.size()-(int)t[i].size()){
                s.erase(index);
                break;
            }
            if(i == 3){
                cout << "NO" << endl;
                return 0;
            }
        }
	}
	cout << "YES" << endl;

	return 0;
}

Submission Info

Judge Result