Submission #3084159
Source Code Expand
/// Containers Start
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#include<random>
/// C Header Files
#include <cstdio>
#include <cctype>
#include <cmath>
#include <math.h>
#include <cmath>
#include <ctime>
#include <cstring>
/// Containers End
using namespace std;
/// Math Start
#define PI acos(-1.0)
#define Pi 3.141592653589793
#define EPS (1e-7)
#define INF (0x3f3f3f3f)
/// Math End
/// Extra Start
#define nn '\n'
#define pb push_back
#define SS stringstream
#define ull unsigned long long
#define mod 1000000007
#define SIZE 2000001
#define _cin ios_base::sync_with_stdio(0); cin.tie(0);
#define sz(a) int((a).size())
#define space " "
#define All(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define Ignore cin.ignore()
#define StringToInt if ( ! (istringstream(s) >> n) ) n = 0;
#define SORT(c) sort(All((c)))
#define RSORT(c) sort(rall((c)))
/// Extra End
/// Functions Start
template<class T>
T gcd(T a, T b) {
if (b == 0)return a;
return gcd(b, a % b);
}
long int gcd(long int a, long int b) {
if (b == 0)return a;
return gcd(b, a % b);
}
template<class T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T>
string converter(T n) {
SS x;
x << n;
return x.str();
}
#define rep(i, n) for(int i = 0;i < n;i++)
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define FORD(i, a, b) for(int i=(a);i>=(b);i--)
#define FORA(arr) for(auto &i:arr)
#define Cin(a) cin >>a;
#define Cin2(a, b) cin>>a>>b;
#define Cin3(a, b, c) cin>>a>>b>>c;
#define Cin4(a, b, c, d) cin>>a>>b>>c>>d;
#define Cini(a) int a; cin>>a;
#define Cinii(a, b) int a,b; cin>>a>>b;
#define Cins(s) string s; cin >> s;
#define Cinc(c) char c; cin >> c;
/// Functions End
/// Array Start
#define SET(a) memset( a, -1, sizeof a )
#define CLR(a) memset( a, 0, sizeof a )
#define MEM(a, val) memset( a, val, sizeof a )
/// Array End
/// Debug Start
#define deb(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << '\t' << #y << ": " << y << endl
#define deb3(x, y, z) cout << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z << end
/// Debug End
/// TypeDef Start
typedef long long int ll;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<char, int> mci;
typedef map<int, string> mis;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<pii> vii;
/// TypeDef End
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/**>>>>>>>>>>>>>>>>>>> END <<<<<<<<<<<<<<<<<<**/
///topcoder template
int main(void) {
Cinii(a, b);
int out = (a > b) ? a : b;
cout << out << nn;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 正直者 |
User |
gasugesu |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3513 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 |