/*
做本體好杯具, 是數(shù)據(jù)若還是怎么的
START
1 + 29 = 300
END
START
1 + 29 = 30 0
END
結(jié)果是什么？
理論上是WA
但是我的代碼是 PE
交上去就卻AC了
夠暈的 但我看題目也沒說不能出現(xiàn)這組情況
還有
START
1 + 2 = 3
END
START
1 + 2 = 3
END
這個結(jié)果也讓人杯具
*/
#include <iostream>
#include <string>
#include <sstream>
#include <cstring>
#define MAXN 5005
using namespace std;
char corrans[MAXN], mans[MAXN];
string fc, fm;
void result() {
if(fc == fm) {
puts("Accepted");
return ;
}
int i;
string s1 = "", s2 = "";
for(i = 0; i < fc.length(); ++ i) {
if(fc[ i ] != ' ' && fc[ i ] != 9) {
s1 += fc[ i ];
}
}
for(i = 0; i < fm.length(); ++ i) {
if(fm[ i ] != ' ' && fm[ i ] != 9) {
s2 += fm[ i ];
}
}
if(s1 != s2) puts("Wrong Answer");
else puts("Presentation Error");
}
int main() {
int test, i;
scanf("%d%*c", &test);
while(test --) {
fc = "";
while(gets(corrans)) {
if(strcmp("END", corrans) == 0) break;
if(corrans[ 0 ] == 0) fc += " ";
else {
for(i = 0; i < strlen(corrans); ++ i) {
fc += corrans[ i ];
}
}
}
fm = "";
while(gets(mans)) {
if(strcmp("END", mans) == 0) break;
if(mans[ 0 ] == 0) fm += " ";
else {
for(i = 0; i < strlen(mans); ++ i) {
fm += mans[ i ];
}
}
}
result();
}
return 0;
}