Submission #3221701


Source Code Expand

using System;
using System.Linq;
using System.Collections.Generic;
using System.Numerics;
using static System.Console;

class Solver {
    Scanner sc = new Scanner();

    public void Solve() {
        var S = ReadLine();
        S = S.Replace("eraser", "");
        S = S.Replace("erase", "");
        S = S.Replace("dreamer", "");
        S = S.Replace("dream", "");

        if (S == "") {
            WriteLine("YES");
        } else {
            WriteLine("NO");
        }
    }
}



class Scanner {
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner() {
        s = new string[0];
        i = 0;
    }

    public string next() {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        if (s.Length == 0) return next();
        i = 0;
        return s[i++];
    }

    public int nextInt() {


        return int.Parse(next());
    }
    public int[] ArrayInt(int N, int add = 0) {
        int[] Array = new int[N];
        for (int i = 0; i < N; i++) {
            Array[i] = nextInt() + add;
        }
        return Array;
    }

    public long nextLong() {
        return long.Parse(next());
    }

    public long[] ArrayLong(int N, long add = 0) {
        long[] Array = new long[N];
        for (int i = 0; i < N; i++) {
            Array[i] = nextLong() + add;
        }
        return Array;
    }

    public double nextDouble() {
        return double.Parse(next());
    }

    public double[] ArrayDouble(int N, double add = 0) {
        double[] Array = new double[N];
        for (int i = 0; i < N; i++) {
            Array[i] = nextDouble() + add;
        }
        return Array;
    }
}

class Program {
    static void Main(string[] args) {
        Solver s = new Solver();
        s.Solve();
    }
}

Submission Info

Submission Time
Task C - Daydream
User r_k
Language C# (Mono 4.6.2.0)
Score 300
Code Size 1996 Byte
Status AC
Exec Time 24 ms
Memory 13108 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 19
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 20 ms 11092 KB
subtask0_1.txt AC 19 ms 9044 KB
subtask0_2.txt AC 19 ms 9044 KB
subtask1_0.txt AC 23 ms 9952 KB
subtask1_1.txt AC 24 ms 9952 KB
subtask1_10.txt AC 23 ms 9952 KB
subtask1_11.txt AC 23 ms 12000 KB
subtask1_12.txt AC 24 ms 12000 KB
subtask1_13.txt AC 23 ms 11172 KB
subtask1_14.txt AC 23 ms 9952 KB
subtask1_15.txt AC 23 ms 9952 KB
subtask1_2.txt AC 23 ms 9952 KB
subtask1_3.txt AC 23 ms 9952 KB
subtask1_4.txt AC 23 ms 12000 KB
subtask1_5.txt AC 23 ms 9952 KB
subtask1_6.txt AC 24 ms 13108 KB
subtask1_7.txt AC 24 ms 13104 KB
subtask1_8.txt AC 23 ms 9952 KB
subtask1_9.txt AC 23 ms 12000 KB