Submission #535609


Source Code Expand

using LIB;
using System;
using System.Linq;
using System.Text;
using System.Collections.Generic;

class Program
{
    public static IO IO = new IO();
    static void Main(string[] args)
    {
        double[] n = IO.DOUBLE(' ');
        double t = n[1] / n[0];
        double a = n[3] / n[2];
        if (t > a) { IO.WRITE("TAKAHASHI"); }
        else if (t < a) { IO.WRITE("AOKI"); }
        else { IO.WRITE("DRAW"); }
        IO.FLUSH();
    }
}

namespace LIB
{
    public class IO
    {
        private const int WMAX = 1000;
        private StringBuilder S = new StringBuilder();
        private T R<T>(Func<string, T> f) { return f(Console.ReadLine()); }
        private T[] R<T>(Func<string, T> f, char c) { return STRING().Split(c).Select(f).ToArray(); }
        private T[] R<T>(Func<string, T> f, int l) { T[] r = new T[l]; for (int i = 0; i < l; i++) { r[i] = R(f); } return r; }
        private T[][] R<T>(Func<string, T> f, int l, char c) { T[][] r = new T[l][]; for (int i = 0; i < l; i++) { r[i] = R<T>(f, c); } return r; }
        private void W<T>(Func<T, string> f, T v, bool lf = true) { S.Append(f(v)); if (lf == true) { S.Append('\n'); } if (S.Length >= WMAX) { FLUSH(); } }
        public string STRING() { return R(s => s); }
        public string[] STRING(char c) { return R(s => s, c); }
        public string[] STRING(int l) { return R(s => s, l); }
        public string[][] STRING(int l, char c) { return R(s => s, l, c); }
        public int INT() { return R(int.Parse); }
        public int[] INT(char c) { return R(int.Parse, c); }
        public int[] INT(int l) { return R(int.Parse, l); }
        public int[][] INT(int l, char c) { return R(int.Parse, l, c); }
        public long LONG() { return R(long.Parse); }
        public long[] LONG(char c) { return R(long.Parse, c); }
        public long[] LONG(int l) { return R(long.Parse, l); }
        public long[][] LONG(int l, char c) { return R(long.Parse, l, c); }
        public double DOUBLE() { return R(double.Parse); }
        public double[] DOUBLE(char c) { return R(double.Parse, c); }
        public double[] DOUBLE(int l) { return R(double.Parse, l); }
        public double[][] DOUBLE(int l, char c) { return R(double.Parse, l, c); }
        public void WRITE(string s, bool lf = true) { W(v => v, s, lf); }
        public void WRITE(int s, bool lf = true) { W(v => v.ToString(), s, lf); }
        public void WRITE(long s, bool lf = true) { W(v => v.ToString(), s, lf); }
        public void WRITE(double s, bool lf = true) { W(v => v.ToString(), s, lf); }
        public void FLUSH() { Console.Write(S); S.Length = 0; }
    }
}

Submission Info

Submission Time
Task A - 勝率計算
User nokonoko
Language C# (Mono 3.2.1.0)
Score 100
Code Size 2681 Byte
Status AC
Exec Time 168 ms
Memory 9888 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 33
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Case Name Status Exec Time Memory
0.txt AC 168 ms 9876 KiB
1.txt AC 129 ms 9880 KiB
10.txt AC 131 ms 9752 KiB
11.txt AC 126 ms 9876 KiB
12.txt AC 127 ms 9884 KiB
13.txt AC 126 ms 9884 KiB
14.txt AC 138 ms 9888 KiB
15.txt AC 123 ms 9880 KiB
16.txt AC 126 ms 9888 KiB
17.txt AC 123 ms 9884 KiB
18.txt AC 125 ms 9888 KiB
19.txt AC 128 ms 9884 KiB
2.txt AC 128 ms 9856 KiB
20.txt AC 127 ms 9880 KiB
21.txt AC 124 ms 9840 KiB
22.txt AC 128 ms 9880 KiB
23.txt AC 127 ms 9880 KiB
24.txt AC 129 ms 9884 KiB
25.txt AC 148 ms 9756 KiB
26.txt AC 150 ms 9720 KiB
27.txt AC 129 ms 9764 KiB
28.txt AC 125 ms 9884 KiB
29.txt AC 131 ms 9888 KiB
3.txt AC 124 ms 9884 KiB
4.txt AC 125 ms 9884 KiB
5.txt AC 124 ms 9800 KiB
6.txt AC 125 ms 9884 KiB
7.txt AC 129 ms 9884 KiB
8.txt AC 126 ms 9756 KiB
9.txt AC 125 ms 9880 KiB
subtask0_sample_01.txt AC 124 ms 9888 KiB
subtask0_sample_02.txt AC 127 ms 9884 KiB
subtask0_sample_03.txt AC 124 ms 9884 KiB