Submission #385897
Source Code Expand
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;
#define For(i,a,b) for(int (i) = (a);i < (b);(i)++)
#define rep(i,n) For(i,0,n)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (sizeof(a))
#define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)
bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 1e9;
int main()
{
int x, y;
cin >> x >> y;
cout << max(x, y) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 正直者 |
User |
omu |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1274 Byte |
Status |
AC |
Exec Time |
29 ms |
Memory |
1040 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 |
27 ms |
924 KB |
00_sample_02.txt |
AC |
25 ms |
924 KB |
kensho_diff01 |
AC |
24 ms |
920 KB |
kensho_diff02 |
AC |
26 ms |
860 KB |
kensho_diff03 |
AC |
24 ms |
924 KB |
kensho_diff04 |
AC |
25 ms |
920 KB |
kensho_diff05 |
AC |
25 ms |
924 KB |
kensho_min-max01 |
AC |
25 ms |
924 KB |
kensho_min-max02 |
AC |
24 ms |
1040 KB |
kensho_min-max03 |
AC |
26 ms |
924 KB |
kensho_min-max04 |
AC |
26 ms |
924 KB |
kensho_min-max05 |
AC |
26 ms |
856 KB |
kensho_min-max06 |
AC |
26 ms |
924 KB |
kensho_min-max07 |
AC |
26 ms |
1040 KB |
kensho_min-max08 |
AC |
25 ms |
924 KB |
kensho_min-max09 |
AC |
26 ms |
924 KB |
kensho_min-max10 |
AC |
26 ms |
924 KB |
kensho_rand01 |
AC |
26 ms |
924 KB |
kensho_rand02 |
AC |
26 ms |
876 KB |
kensho_rand03 |
AC |
26 ms |
928 KB |
kensho_rand04 |
AC |
25 ms |
924 KB |
kensho_rand05 |
AC |
29 ms |
920 KB |
kensho_rand06 |
AC |
26 ms |
860 KB |
kensho_rand07 |
AC |
29 ms |
928 KB |
kensho_rand08 |
AC |
26 ms |
920 KB |
kensho_rand09 |
AC |
27 ms |
908 KB |
kensho_rand10 |
AC |
26 ms |
928 KB |