Submission #538784


Source Code Expand

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<climits>
#include<algorithm>
#include<vector>
#include<valarray>
#include<string>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<iostream>
using namespace std;
  
  
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define DREP(i,n) for(int i=n;i>0;i--)
#define Rep(i,m,n) for(int i=m;i<n;i++)
#define scani(a) scanf("%d",&a)
#define scand(a) scanf("%lf",&a)
#define scans(s) scanf("%s",s)
#define readi(a) int a;scanf("%d",&a)
#define printi(a) printf("%d",a)
#define prints(s) printf("%s",s)
#define even(n) (((n)+1)%2)
#define odd(n) ((n)%2)
#define sg(x) ((x)?1:0)
#define LF printf("\n")
#define SPACE printf(" ")
#define pb push_back
#define mp make_pair
#define bs binary_search
#define all(a) (a).begin(),(a).end()
#define forall(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define MOD 1000000007
  
typedef long long LL;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<double,double> pdd;
typedef pair<int,int> pii;
  
const double pi=acos(-1.0);
double rad(double t){return t*pi/180.0;}
double deg(double d){return d*180.0/pi;}
int GCD(int x,int y){if(x<y)swap(x,y);return x%y?GCD(y,x%y):y;}
int LCM(int x,int y){return x/GCD(x,y)*y;}

int main(){
  int A,B,C,D;
  cin >> A >> B >> C >> D;
  if(A*D < B*C)cout << "TAKAHASHI" << endl;
  if(A*D > B*C)cout << "AOKI" << endl;
  if(A*D == B*C)cout << "DRAW" << endl;
  return 0;
}

Submission Info

Submission Time
Task A - 勝率計算
User buko1062000
Language C++ (GCC 4.9.2)
Score 100
Code Size 1595 Byte
Status AC
Exec Time 29 ms
Memory 940 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 28 ms 920 KiB
1.txt AC 27 ms 912 KiB
10.txt AC 26 ms 920 KiB
11.txt AC 27 ms 804 KiB
12.txt AC 27 ms 808 KiB
13.txt AC 27 ms 924 KiB
14.txt AC 29 ms 924 KiB
15.txt AC 28 ms 920 KiB
16.txt AC 26 ms 920 KiB
17.txt AC 27 ms 908 KiB
18.txt AC 28 ms 924 KiB
19.txt AC 26 ms 928 KiB
2.txt AC 27 ms 928 KiB
20.txt AC 26 ms 924 KiB
21.txt AC 29 ms 928 KiB
22.txt AC 27 ms 940 KiB
23.txt AC 28 ms 796 KiB
24.txt AC 27 ms 804 KiB
25.txt AC 27 ms 808 KiB
26.txt AC 27 ms 796 KiB
27.txt AC 27 ms 792 KiB
28.txt AC 28 ms 924 KiB
29.txt AC 29 ms 924 KiB
3.txt AC 27 ms 800 KiB
4.txt AC 28 ms 928 KiB
5.txt AC 29 ms 736 KiB
6.txt AC 28 ms 924 KiB
7.txt AC 27 ms 920 KiB
8.txt AC 26 ms 920 KiB
9.txt AC 27 ms 788 KiB
subtask0_sample_01.txt AC 26 ms 920 KiB
subtask0_sample_02.txt AC 26 ms 924 KiB
subtask0_sample_03.txt AC 29 ms 920 KiB