Submission #110617
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <string> #include <vector> #include <algorithm> #include <numeric> #include <set> #include <map> #include <queue> #include <iostream> #include <sstream> #include <cstdio> #include <cmath> #include <ctime> #include <cstring> #include <cctype> #include <list> #include <cassert> #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL #define EPS 1e-9 using namespace std; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll; typedef vector<string> vs; typedef long double ld; int main() { int x, y; cin >> x >> y; cout << max(x, y) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 正直者 |
User | anta |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1324 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 932 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, kensho_diff01, kensho_diff02, kensho_diff03, kensho_diff04, kensho_diff05, kensho_min-max01, kensho_min-max02, kensho_min-max03, kensho_min-max04, kensho_min-max05, kensho_min-max06, kensho_min-max07, kensho_min-max08, kensho_min-max09, kensho_min-max10, kensho_rand01, kensho_rand02, kensho_rand03, kensho_rand04, kensho_rand05, kensho_rand06, kensho_rand07, kensho_rand08, kensho_rand09, kensho_rand10 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 24 ms | 680 KB |
00_sample_02.txt | AC | 21 ms | 808 KB |
kensho_diff01 | AC | 20 ms | 676 KB |
kensho_diff02 | AC | 20 ms | 676 KB |
kensho_diff03 | AC | 20 ms | 672 KB |
kensho_diff04 | AC | 21 ms | 740 KB |
kensho_diff05 | AC | 21 ms | 752 KB |
kensho_min-max01 | AC | 21 ms | 680 KB |
kensho_min-max02 | AC | 21 ms | 932 KB |
kensho_min-max03 | AC | 20 ms | 808 KB |
kensho_min-max04 | AC | 22 ms | 804 KB |
kensho_min-max05 | AC | 20 ms | 928 KB |
kensho_min-max06 | AC | 21 ms | 804 KB |
kensho_min-max07 | AC | 20 ms | 796 KB |
kensho_min-max08 | AC | 21 ms | 760 KB |
kensho_min-max09 | AC | 20 ms | 800 KB |
kensho_min-max10 | AC | 21 ms | 736 KB |
kensho_rand01 | AC | 21 ms | 812 KB |
kensho_rand02 | AC | 21 ms | 680 KB |
kensho_rand03 | AC | 21 ms | 804 KB |
kensho_rand04 | AC | 21 ms | 684 KB |
kensho_rand05 | AC | 20 ms | 800 KB |
kensho_rand06 | AC | 21 ms | 804 KB |
kensho_rand07 | AC | 21 ms | 676 KB |
kensho_rand08 | AC | 20 ms | 800 KB |
kensho_rand09 | AC | 20 ms | 676 KB |
kensho_rand10 | AC | 21 ms | 680 KB |