Submission #535587
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <set> #include <map> #include <list> #include <queue> #include <stack> #include <cmath> #include <ctype.h> #include <ctime> #include <cstdio> #include <vector> #include <string> #include <bitset> #include <cctype> #include <cstdlib> #include <cstring> #include <utility> #include <numeric> #include <complex> #include <sstream> #include <fstream> #include <iomanip> #include <cassert> #include <iostream> #include <iterator> #include <algorithm> #define aLL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define F(i,j,k) fill(i[0],i[0]+j*j,k) #define P(p) cout<<(p)<<endl; #define EXISt(s,e) ((s).find(e)!=(s).end()) #define INF 1<<25 #define MAX 100000000 #define PI 3.14159265258979 #define pb push_back using namespace std; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<double> vd; typedef pair<int, int> pii; typedef pair<long, long> pll; typedef long long ll; int dx[] = { 0, 1, 0, -1 }; int dy[] = { -1, 0, 1, 0 }; int sttoi(std::string str) { int ret; std::stringstream ss; ss << str; ss >> ret; return ret; } bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) { return a.second > b.second; } vector<int> v; void calc(){ } void solve() { double n,m,o,p; cin >> n >> m >> o >> p; if (m / n < p / o){ P("AOKI"); } else if (m / n == p / o){ P("DRAW"); } else{ P("TAKAHASHI"); } } int main() { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 勝率計算 |
User | pantacia1128 |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 1566 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 932 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 | 796 KB |
1.txt | AC | 24 ms | 928 KB |
10.txt | AC | 25 ms | 804 KB |
11.txt | AC | 26 ms | 928 KB |
12.txt | AC | 24 ms | 808 KB |
13.txt | AC | 24 ms | 800 KB |
14.txt | AC | 25 ms | 924 KB |
15.txt | AC | 26 ms | 800 KB |
16.txt | AC | 26 ms | 792 KB |
17.txt | AC | 25 ms | 924 KB |
18.txt | AC | 25 ms | 800 KB |
19.txt | AC | 24 ms | 800 KB |
2.txt | AC | 25 ms | 920 KB |
20.txt | AC | 25 ms | 924 KB |
21.txt | AC | 24 ms | 808 KB |
22.txt | AC | 25 ms | 676 KB |
23.txt | AC | 25 ms | 916 KB |
24.txt | AC | 24 ms | 932 KB |
25.txt | AC | 26 ms | 924 KB |
26.txt | AC | 24 ms | 928 KB |
27.txt | AC | 26 ms | 804 KB |
28.txt | AC | 27 ms | 724 KB |
29.txt | AC | 28 ms | 704 KB |
3.txt | AC | 27 ms | 808 KB |
4.txt | AC | 24 ms | 748 KB |
5.txt | AC | 25 ms | 928 KB |
6.txt | AC | 25 ms | 728 KB |
7.txt | AC | 25 ms | 800 KB |
8.txt | AC | 25 ms | 808 KB |
9.txt | AC | 26 ms | 800 KB |
subtask0_sample_01.txt | AC | 28 ms | 796 KB |
subtask0_sample_02.txt | AC | 24 ms | 800 KB |
subtask0_sample_03.txt | AC | 25 ms | 920 KB |