Submission #1441566
Source Code Expand
using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Text; namespace AtCoder { class MainClass { public static void Main(string[] args) { new MainClass().solve(); } Scanner cin = new Scanner(); String S; void solve() { S = cin.next(); bool isTea = S[S.Length - 1] == 'T'; Console.WriteLine(isTea ? "YES" : "NO"); } class Scanner { string[] nextBuffer; int BufferCnt; char[] cs = new char[] { ' ' }; public Scanner() { nextBuffer = new string[0]; BufferCnt = 0; } public string next() { if (BufferCnt < nextBuffer.Length) return nextBuffer[BufferCnt++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); nextBuffer = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); BufferCnt = 0; return nextBuffer[BufferCnt++]; } public int nextInt() { return int.Parse(next()); } public long nextLong() { return long.Parse(next()); } public double nextDouble() { return double.Parse(next()); } } class Mathf { private int mod = 1000000007; public Mathf() { } public Mathf(int mod) { this.mod = mod; } public long Pow(long a, long b) { if (b == 0) return 1; if (b % 2 == 1) return (a % mod * Pow(a % mod, b - 1) % mod) % mod; else return Pow(a * a % mod, b / 2) % mod; } public long Fact(long n) { return n != 0 ? (n % mod * (Fact(n - 1) % mod) % mod) : 1; } public long C(long n, long r) { if (r == 0 || n == r) return 1; else return (Fact(n) % mod * Pow((Fact(n - r) % mod * Fact(r) % mod) % mod, mod - 2) % mod) % mod; } } } }
Submission Info
Submission Time | |
---|---|
Task | A - お茶 |
User | rui0422 |
Language | C# (Mono 4.6.2.0) |
Score | 100 |
Code Size | 2067 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 13140 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 19 ms | 9044 KB |
sample_1.txt | AC | 19 ms | 11092 KB |
sample_2.txt | AC | 19 ms | 9044 KB |
sample_3.txt | AC | 19 ms | 9044 KB |
sample_4.txt | AC | 20 ms | 13140 KB |
subtask1_0.txt | AC | 19 ms | 11092 KB |
subtask1_1.txt | AC | 19 ms | 9044 KB |
subtask1_10.txt | AC | 20 ms | 13140 KB |
subtask1_11.txt | AC | 19 ms | 11092 KB |
subtask1_12.txt | AC | 19 ms | 11092 KB |
subtask1_13.txt | AC | 19 ms | 9044 KB |
subtask1_14.txt | AC | 19 ms | 9044 KB |
subtask1_2.txt | AC | 19 ms | 9044 KB |
subtask1_3.txt | AC | 19 ms | 9044 KB |
subtask1_4.txt | AC | 19 ms | 11092 KB |
subtask1_5.txt | AC | 19 ms | 11092 KB |
subtask1_6.txt | AC | 19 ms | 9044 KB |
subtask1_7.txt | AC | 19 ms | 11092 KB |
subtask1_8.txt | AC | 19 ms | 11092 KB |
subtask1_9.txt | AC | 19 ms | 11092 KB |