結果
問題 | No.201 yukicoderじゃんけん |
ユーザー |
![]() |
提出日時 | 2015-06-20 06:13:12 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,374 bytes |
コンパイル時間 | 1,344 ms |
コンパイル使用メモリ | 159,896 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-07 04:38:01 |
合計ジャッジ時間 | 1,885 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define FOR(i, s, n) for(int i = s; i < (int)n; ++i)#define per(i, n) for(int i = n; i >= 0; i--)#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)#define FORIT(i, A) for (auto i : A)#define PRINT(x) cout << (x) << "\n"#define ALL(a) (a).begin(),(a).end()#define RALL(a) (a).rbegin(), (a).rend()#define MP make_pair#define PB push_back#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)#define SZ(a) int((a).size())#define EXIST(s,e) ((s).find(e)!=(s).end())#define SORT(c) sort((c).begin(),(c).end())#define CLR(a) memset((a), 0 ,sizeof(a))#define NCLR(a) memset((a), -1 ,sizeof(a))#define sq(n) (n) * (n)typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<string> VS;typedef pair<int, int> PII;typedef long long LL;typedef vector<LL> VLL;typedef vector<VLL> VVLL;typedef unsigned int uint;typedef unsigned long long ull;typedef priority_queue<int> maxpq;typedef priority_queue< int, vector<int>, greater<int> > minpq;typedef complex<double> Point;static const double EPS = 1e-10;static const double PI = acos( -1.0 );static const int mod = 1000000007;static const int INF = 1 << 29;static const LL LL_INF = 1ll << 60;static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };#ifdef WIN32#define dump(x) cerr << #x << " = " << (x) << "\n"#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n"#else#define dump(x)#define debug(x)#endifstring strs[ 2 ][ 3 ];void input() {for ( int i = 0; i < 2; i++ ) {for ( int j = 0; j < 3; j++ ) {cin >> strs[ i ][ j ];}}};void solve() {while ( strs[ 0 ][ 1 ].size() < strs[ 1 ][ 1 ].size() ) {strs[ 0 ][ 1 ] = "0" + strs[ 0 ][ 1 ];}while ( strs[ 1 ][ 1 ].size() < strs[ 0 ][ 1 ].size() ) {strs[ 1 ][ 1 ] = "0" + strs[ 1 ][ 1 ];}if ( strs[ 0 ][ 1 ] == strs[ 1 ][ 1 ] ) {PRINT( -1 );}else {PRINT( strs[ 0 ][ 1 ] < strs[ 1 ][ 1 ] ? strs[ 1 ][ 0 ] : strs[ 0 ][ 0 ] );}}int main() {ios::sync_with_stdio( false );cin.tie( 0 );input();#ifdef WIN32clock_t stime = clock();#endifsolve();#ifdef WIN32clock_t etime = clock();cerr << "TIME : " << ( double ) ( etime - stime ) / CLOCKS_PER_SEC << "\n";#endifreturn 0;}