Submission #535576


Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif

using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8



int main(){
	LL a, b, c, d, e, f;
	LL x, y, z;
	double p, q, r;
	string s = "a", t, u;
	
	a = b = c = d = e = f = 0;
	x = y = z = 0;
	p = q = r = 0.0;
	
	cin >> a >> b >> c >> d >> e >> f;
	cin.clear();
	cin >> s >> t >> u;
	cin.clear();
	
	if(a * d < c * b){ puts("TAKAHASHI"); }
	else if(a * d > c * b){ puts("AOKI"); }
	else{ puts("DRAW"); }
	
}

Submission Info

Submission Time
Task A - 勝率計算
User climpet
Language C++ (GCC 4.9.2)
Score 100
Code Size 1845 Byte
Status AC
Exec Time 35 ms
Memory 924 KB

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 26 ms 800 KB
1.txt AC 27 ms 772 KB
10.txt AC 25 ms 920 KB
11.txt AC 26 ms 676 KB
12.txt AC 27 ms 896 KB
13.txt AC 27 ms 804 KB
14.txt AC 26 ms 804 KB
15.txt AC 26 ms 796 KB
16.txt AC 26 ms 804 KB
17.txt AC 35 ms 920 KB
18.txt AC 26 ms 796 KB
19.txt AC 25 ms 812 KB
2.txt AC 25 ms 800 KB
20.txt AC 27 ms 920 KB
21.txt AC 29 ms 852 KB
22.txt AC 27 ms 808 KB
23.txt AC 25 ms 920 KB
24.txt AC 27 ms 916 KB
25.txt AC 25 ms 916 KB
26.txt AC 27 ms 736 KB
27.txt AC 27 ms 800 KB
28.txt AC 24 ms 800 KB
29.txt AC 25 ms 912 KB
3.txt AC 27 ms 800 KB
4.txt AC 27 ms 804 KB
5.txt AC 25 ms 920 KB
6.txt AC 27 ms 920 KB
7.txt AC 27 ms 924 KB
8.txt AC 24 ms 796 KB
9.txt AC 27 ms 804 KB
subtask0_sample_01.txt AC 27 ms 800 KB
subtask0_sample_02.txt AC 26 ms 728 KB
subtask0_sample_03.txt AC 27 ms 804 KB