Submission #535562
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
void Main() {
double a,b,c,d;
cin >> a >> b >> c >> d;
if(b/a>d/c) pr("TAKAHASHI");
else if(b/a<d/c) pr("AOKI");
else pr("DRAW");
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
Main();return 0;
}
Submission Info
Submission Time |
|
Task |
A - 勝率計算 |
User |
kzyKT |
Language |
C++ (GCC 4.9.2) |
Score |
100 |
Code Size |
1312 Byte |
Status |
AC |
Exec Time |
26 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
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 |
26 ms |
924 KB |
1.txt |
AC |
24 ms |
808 KB |
10.txt |
AC |
25 ms |
924 KB |
11.txt |
AC |
26 ms |
728 KB |
12.txt |
AC |
26 ms |
728 KB |
13.txt |
AC |
26 ms |
916 KB |
14.txt |
AC |
26 ms |
800 KB |
15.txt |
AC |
26 ms |
724 KB |
16.txt |
AC |
26 ms |
800 KB |
17.txt |
AC |
25 ms |
816 KB |
18.txt |
AC |
26 ms |
724 KB |
19.txt |
AC |
26 ms |
804 KB |
2.txt |
AC |
26 ms |
756 KB |
20.txt |
AC |
26 ms |
800 KB |
21.txt |
AC |
25 ms |
796 KB |
22.txt |
AC |
26 ms |
912 KB |
23.txt |
AC |
26 ms |
800 KB |
24.txt |
AC |
26 ms |
792 KB |
25.txt |
AC |
25 ms |
916 KB |
26.txt |
AC |
24 ms |
804 KB |
27.txt |
AC |
25 ms |
928 KB |
28.txt |
AC |
24 ms |
916 KB |
29.txt |
AC |
26 ms |
732 KB |
3.txt |
AC |
25 ms |
796 KB |
4.txt |
AC |
26 ms |
804 KB |
5.txt |
AC |
24 ms |
928 KB |
6.txt |
AC |
26 ms |
800 KB |
7.txt |
AC |
25 ms |
792 KB |
8.txt |
AC |
26 ms |
920 KB |
9.txt |
AC |
25 ms |
728 KB |
subtask0_sample_01.txt |
AC |
25 ms |
784 KB |
subtask0_sample_02.txt |
AC |
25 ms |
792 KB |
subtask0_sample_03.txt |
AC |
24 ms |
796 KB |