Submission #1771447


Source Code Expand

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }

int X, Y;
int main() {
    cin >> X >> Y;
    if (X < Y) cout << Y << endl;
    else cout << X << endl;
}

Submission Info

Submission Time
Task A - 正直者
User drken
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1502 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 27
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