結果
問題 | No.201 yukicoderじゃんけん |
ユーザー | はむこ |
提出日時 | 2016-08-06 10:36:44 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 3,301 bytes |
コンパイル時間 | 1,326 ms |
コンパイル使用メモリ | 162,040 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-07 02:58:32 |
合計ジャッジ時間 | 1,996 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>using namespace std;#ifdef _WIN32#define scanfll(x) scanf("%I64d", x)#define printfll(x) printf("%I64d", x)#else#define scanfll(x) scanf("%lld", x)#define printfll(x) printf("%lld", x)#endif#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)#define pb push_back#define all(x) (x).begin(), (x).end()#define fi first#define se second#define mt make_tuple#define mp make_pairtemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }using ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>;using vi = vector<int>; using vvi = vector<vi>;vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }using P = pair<ll, ll>;template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};template<class Ch, class Tr, class Tuple, size_t... Is>void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }template<class Ch, class Tr, class... Args>auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; cout << endl; } return o; }template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o<< "]"; return o; }template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o <<*it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }template <typename T, typename U> ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end();it++) o << *it; o << "]"; return o; }void printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }#define ldout fixed << setprecision(40)static const double EPS = 1e-14;static const long long INF = 1e18;static const long long mo = 1e9+7;int main(void) {cin.tie(0); ios::sync_with_stdio(false);string _;string sa, sb;string na, nb;cin >> sa >> na; cin >> _; cin >> sb >> nb; cin >> _;if (na.size() != nb.size()) {cout << (na.size() > nb.size() ? sa : sb) << endl;} else {if (na == nb) {cout << "-1" << endl;} else {cout << (na > nb ? sa : sb) << endl;}}return 0;}