Submission #2529947
Source Code Expand
#include<stdio.h> #include<string.h> int main(){ char s[100000]; int i,a; scanf("%s",s); a=strlen(s); if(s[0]!='d'&&s[0]!='e'){ printf("No\n"); return 0; } for(i=1;i<a;i++){ switch(s[i]){ case 'd': if(s[i-1]=='m' || s[i-1]=='r'&& s[i-2]=='e' &&(s[i-3]=='m' ||s[i-3]=='s') || s[i-1]=='e'){ // printf("d"); break; } else{ printf("No\n"); return 0; } case 'r': if(s[i-1]=='d' || s[i-1]=='e'){ // printf("r"); break; } else{ printf("No\n"); return 0; } case 'e': if(s[i-1]=='m'||s[i-1]=='r'&&(s[i-2]=='d'||s[i-2]=='e'&&(s[i-3]=='m'||s[i-3]=='s')) || (s[i-1]=='e'&&s[i-2]=='s') ||s[i-1]=='s'){ // printf("e"); break; } else{ printf("No\n"); return 0; } case 'a': if(s[i-1]=='e' &&s[i-2]=='r' ||s[i-1]=='r'&&s[i-2]=='e'){ // printf("a"); break; } else{ printf("No\n"); return 0; } case 'm': if(s[i-1]=='a'&&s[i-2]=='e'){ // printf("m"); break; } else{ printf("No\n"); return 0; } case 's':if(s[i-1]=='a' &&s[i-2]=='r'){ // printf("s"); break; } else{ printf("No\n"); return 0; } default: printf("*No\n"); return 0; } } if(s[a-1]=='m' || s[a-1]=='r'&& s[a-2]=='e' &&(s[a-3]=='m' ||s[a-3]=='s')|| s[a-1]=='e'){ printf("Yes\n"); } else{ printf("No\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Daydream |
User | selream3012 |
Language | C (GCC 5.4.1) |
Score | 0 |
Code Size | 1981 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:6:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",s); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||
Status |
|
|
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 | WA | 1 ms | 128 KB |
subtask0_1.txt | WA | 1 ms | 128 KB |
subtask0_2.txt | WA | 1 ms | 128 KB |
subtask1_0.txt | WA | 1 ms | 256 KB |
subtask1_1.txt | WA | 1 ms | 256 KB |
subtask1_10.txt | WA | 1 ms | 256 KB |
subtask1_11.txt | WA | 1 ms | 256 KB |
subtask1_12.txt | WA | 1 ms | 256 KB |
subtask1_13.txt | WA | 1 ms | 256 KB |
subtask1_14.txt | WA | 1 ms | 256 KB |
subtask1_15.txt | WA | 1 ms | 256 KB |
subtask1_2.txt | WA | 1 ms | 256 KB |
subtask1_3.txt | WA | 1 ms | 256 KB |
subtask1_4.txt | WA | 1 ms | 256 KB |
subtask1_5.txt | WA | 1 ms | 256 KB |
subtask1_6.txt | WA | 1 ms | 256 KB |
subtask1_7.txt | WA | 1 ms | 256 KB |
subtask1_8.txt | WA | 1 ms | 256 KB |
subtask1_9.txt | WA | 1 ms | 256 KB |