QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #279035 | #5436. DRX vs. T1 | Jalppatel1428 | WA | 0ms | 3628kb | C++14 | 321b | 2023-12-08 03:25:19 | 2023-12-08 03:25:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve(){
string str;
cin>>str;
int cnt=0;
for(int i=0;i<str.size();i++){
cnt+=(str[i]=='T');
cnt-=(str[i]=='D');
}
if(cnt>0)cout<<"T1"<<endl;
else cout<<"RDX"<<endl;
}
int main(){
int tc=1;
//cin>>tc;
while(tc--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
TDTT?
output:
T1
result:
ok single line: 'T1'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3624kb
input:
DTDD?
output:
RDX
result:
wrong answer 1st lines differ - expected: 'DRX', found: 'RDX'