Submission #2526939


Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<iomanip>
using namespace std;

#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define rep2(i,j,n) for(int i=(j);i<=(n);i++)
#define all(i) i.begin(),i.end()
#define INF 1e9

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef pair<int, int> pi;
typedef long long i64;

int main() {
	string s;
	cin >> s;
	if (s[s.size() - 1] == 'T') cout << "YES\n";
	else cout << "NO\n";
}

Submission Info

Submission Time
Task A - お茶
User playroller
Language C++14 (GCC 5.4.1)
Score 100
Code Size 670 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 20
Set Name Test Cases
Sample sample_0.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt
All sample_0.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.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
sample_0.txt AC 1 ms 256 KB
sample_1.txt AC 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB
sample_4.txt AC 1 ms 256 KB
subtask1_0.txt AC 1 ms 256 KB
subtask1_1.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_2.txt AC 1 ms 256 KB
subtask1_3.txt AC 1 ms 256 KB
subtask1_4.txt AC 1 ms 256 KB
subtask1_5.txt AC 1 ms 256 KB
subtask1_6.txt AC 1 ms 256 KB
subtask1_7.txt AC 1 ms 256 KB
subtask1_8.txt AC 1 ms 256 KB
subtask1_9.txt AC 1 ms 256 KB