Submission #535561
Source Code Expand
#define NDEBUG
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
using namespace std;
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) os << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T> void print(T a, int n, const string& split = " ") { for (int i = 0; i < n; i++) { cout << a[i]; if (i + 1 != n) cout << split; } cout << endl; }
template <typename T> void print2d(T a, int w, int h, int width = -1, int br = 0) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <typename T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
#define dump(v) (cout << #v << ": " << v << endl)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))
template <typename T, typename U> void upmin(T& a, const U& b) { a = min<T>(a, b); }
template <typename T, typename U> void upmax(T& a, const U& b) { a = max<T>(a, b); }
template <typename T> void uniq(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
typedef long long ll;
typedef pair<int, int> pint;
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
int x = b * c, y = a * d;
if (x > y)
cout << "TAKAHASHI" << endl;
else if (x < y)
cout << "AOKI" << endl;
else
cout << "DRAW" << endl;
}
Submission Info
Submission Time |
|
Task |
A - 勝率計算 |
User |
takapt |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
3502 Byte |
Status |
AC |
Exec Time |
31 ms |
Memory |
1048 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 |
28 ms |
944 KB |
1.txt |
AC |
27 ms |
1040 KB |
10.txt |
AC |
28 ms |
1040 KB |
11.txt |
AC |
29 ms |
1036 KB |
12.txt |
AC |
29 ms |
1040 KB |
13.txt |
AC |
29 ms |
840 KB |
14.txt |
AC |
29 ms |
856 KB |
15.txt |
AC |
31 ms |
1040 KB |
16.txt |
AC |
28 ms |
928 KB |
17.txt |
AC |
28 ms |
864 KB |
18.txt |
AC |
27 ms |
860 KB |
19.txt |
AC |
27 ms |
940 KB |
2.txt |
AC |
28 ms |
864 KB |
20.txt |
AC |
26 ms |
856 KB |
21.txt |
AC |
25 ms |
1040 KB |
22.txt |
AC |
28 ms |
1044 KB |
23.txt |
AC |
28 ms |
868 KB |
24.txt |
AC |
26 ms |
876 KB |
25.txt |
AC |
27 ms |
924 KB |
26.txt |
AC |
28 ms |
1044 KB |
27.txt |
AC |
28 ms |
1040 KB |
28.txt |
AC |
26 ms |
1048 KB |
29.txt |
AC |
27 ms |
1048 KB |
3.txt |
AC |
27 ms |
880 KB |
4.txt |
AC |
31 ms |
992 KB |
5.txt |
AC |
26 ms |
1044 KB |
6.txt |
AC |
27 ms |
880 KB |
7.txt |
AC |
30 ms |
1048 KB |
8.txt |
AC |
27 ms |
868 KB |
9.txt |
AC |
28 ms |
884 KB |
subtask0_sample_01.txt |
AC |
30 ms |
1044 KB |
subtask0_sample_02.txt |
AC |
27 ms |
848 KB |
subtask0_sample_03.txt |
AC |
28 ms |
864 KB |