Submission #112180
Source Code Expand
#include <iostream>//{{{
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <bitset>
#include <utility>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <memory>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cfloat>
#include <cassert>
#include <ctime>
#include <cctype>//}}}
#define REP(i,b,n) for(int i=(int)(b);i<(int)(n);++i)//{{{
#define rep(i,n) REP(i,0,n)
#define repsz(i,v) rep(i,sz(v))
#define let(v, x) __typeof(x) v = (x)
#define foreach(i,v) for(let(i, (v).begin());i!=(v).end();i++)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size()) //}}}
static const int INF = 1<<25;
static const double EPS = 1e-5;
using namespace std;//{{{
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef pair<int,pii> pipii;//}}}
template<typename T> ostream& out(T b, T e, ostream& os=cout){ //{{{
for(; b != e; ++b != e && os << ", ")os << *b; return os;
}
template<class T> T mineq(T &a, const T &b){ return a = min(a, b); }
template<class T> T maxeq(T &a, const T &b){ return a = max(a, b); } //}}}
bool solve(){
ll a, b;
cin >> a >> b;
cout << max(a, b) << endl;
return true;
}
int main(){
//cin.tie(0);
//ios_base::sync_with_stdio(0);
cout.setf(ios::fixed); cout.precision(10);
solve();
return 0;
}
// vim:set foldmethod=marker commentstring=//%s:
Submission Info
Submission Time |
|
Task |
A - 正直者 |
User |
MiSawa |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1820 Byte |
Status |
AC |
Exec Time |
25 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 |
20 ms |
676 KB |
00_sample_02.txt |
AC |
20 ms |
796 KB |
kensho_diff01 |
AC |
21 ms |
716 KB |
kensho_diff02 |
AC |
21 ms |
800 KB |
kensho_diff03 |
AC |
21 ms |
796 KB |
kensho_diff04 |
AC |
21 ms |
680 KB |
kensho_diff05 |
AC |
20 ms |
928 KB |
kensho_min-max01 |
AC |
20 ms |
808 KB |
kensho_min-max02 |
AC |
21 ms |
804 KB |
kensho_min-max03 |
AC |
21 ms |
932 KB |
kensho_min-max04 |
AC |
20 ms |
676 KB |
kensho_min-max05 |
AC |
21 ms |
808 KB |
kensho_min-max06 |
AC |
20 ms |
928 KB |
kensho_min-max07 |
AC |
20 ms |
680 KB |
kensho_min-max08 |
AC |
21 ms |
680 KB |
kensho_min-max09 |
AC |
20 ms |
676 KB |
kensho_min-max10 |
AC |
20 ms |
800 KB |
kensho_rand01 |
AC |
20 ms |
932 KB |
kensho_rand02 |
AC |
21 ms |
804 KB |
kensho_rand03 |
AC |
20 ms |
680 KB |
kensho_rand04 |
AC |
25 ms |
676 KB |
kensho_rand05 |
AC |
21 ms |
808 KB |
kensho_rand06 |
AC |
20 ms |
928 KB |
kensho_rand07 |
AC |
21 ms |
928 KB |
kensho_rand08 |
AC |
20 ms |
676 KB |
kensho_rand09 |
AC |
21 ms |
680 KB |
kensho_rand10 |
AC |
20 ms |
676 KB |