Submission #1365613
Source Code Expand
//------------- //include //------------- #include <map> #include <set> #include <list> #include <cmath> #include <vector> #include <string> #include <cctype> #include <random> #include <cstdlib> #include <iostream> #include <algorithm> using namespace std; //------------- //typedef //------------- typedef long long LL; typedef vector<int> VI; typedef vector<string> VS; typedef pair<int, int> PII; typedef vector<int, int> VII; typedef map<string, int> MSI; //------------- //utillty //------------- #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define MK make_pair #define PB push_back #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //------------- //repetition //------------- #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //------------- //debug //------------- #define dump(x) cerr << #x << " = " << (x) << endl; #define dumpl(x) REP(i,SZ(x))cerr<<i<<x<<"="<<x[i]<<endl; #define SIZE(x) cout<<sizeof(x)<<endl; const int MOD = 1000000007; //------------- //cout //------------- #define COUTL(x) cout<<x<<endl #define COUT(x) cout<<x int main() { int X, Y; cin >> X >> Y; COUTL(max(X, Y)); #ifdef _DEBUG while(1); #endif return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 正直者 |
User | ayatakamaru |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1418 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
kensho_diff01 | AC | 1 ms | 256 KB |
kensho_diff02 | AC | 1 ms | 256 KB |
kensho_diff03 | AC | 1 ms | 256 KB |
kensho_diff04 | AC | 1 ms | 256 KB |
kensho_diff05 | AC | 1 ms | 256 KB |
kensho_min-max01 | AC | 1 ms | 256 KB |
kensho_min-max02 | AC | 1 ms | 256 KB |
kensho_min-max03 | AC | 1 ms | 256 KB |
kensho_min-max04 | AC | 1 ms | 256 KB |
kensho_min-max05 | AC | 1 ms | 256 KB |
kensho_min-max06 | AC | 1 ms | 256 KB |
kensho_min-max07 | AC | 1 ms | 256 KB |
kensho_min-max08 | AC | 1 ms | 256 KB |
kensho_min-max09 | AC | 1 ms | 256 KB |
kensho_min-max10 | AC | 1 ms | 256 KB |
kensho_rand01 | AC | 1 ms | 256 KB |
kensho_rand02 | AC | 1 ms | 256 KB |
kensho_rand03 | AC | 1 ms | 256 KB |
kensho_rand04 | AC | 1 ms | 256 KB |
kensho_rand05 | AC | 1 ms | 256 KB |
kensho_rand06 | AC | 1 ms | 256 KB |
kensho_rand07 | AC | 1 ms | 256 KB |
kensho_rand08 | AC | 1 ms | 256 KB |
kensho_rand09 | AC | 1 ms | 256 KB |
kensho_rand10 | AC | 1 ms | 256 KB |