Submission #1350286
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#define OUT(x) cout << #x << " = " << x << endl
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define rer(i, l, r) for (int (i) = (int)(l); (i) <= (int)(r); (i)++)
#define reu(i, l, r) for (int (i) = (int)(l); (i) < (int)(r); (i)++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<typename T> void pv(T a, T b) { for (T i = a; i != b; i ++) cout << *i << " "; cout << endl; }
template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; }
int in() { int x; scanf("%d", &x); return x; }
long long lin() { long long x; scanf("%lld", &x); return x; }
int calc(string a, string b) {
int aa = 0;
int bb = 0;
int x = 1;
for (int i = a.size() - 1; i >= 0; i --) {
aa += (a[i] - '0') * x;
x *= 10;
}
x = 1;
for (int i = b.size() - 1; i >= 0; i--) {
bb += (b[i] - '0') * x;
x *= 10;
}
return aa - bb;
}
signed main() {
string a, b;
cin >> a >> b;
int ans = -3000;
reu(i, 1, 10) {
string s = "";
s += a[0];
s += a[1];
s += to_string(i);
amax(ans, calc(to_string(i) + a[1] + a[2], b));
amax(ans, calc(a[0] + to_string(i) + a[2], b));
amax(ans, calc(s, b));
}
reu(i, 1, 10) {
string s = "";
s += b[0];
s += b[1];
s += to_string(i);
amax(ans, calc(a, to_string(i) + b[1] + b[2]));
amax(ans, calc(a, b[0] + to_string(i) + b[2]));
amax(ans, calc(a, s));
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time
2017-06-12 15:24:28+0900
Task
A - A - B problem
User
KokiYmgch
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
2057 Byte
Status
WA
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int in()’:
./Main.cpp:12:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int in() { int x; scanf("%d", &x); return x; }
^
./Main.cpp: In function ‘long long int lin()’:
./Main.cpp:13:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
long long lin() { long long x; scanf("%lld", &x); return x; }
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 100
Status
Set Name
Test Cases
Sample
sample_0.txt, sample_1.txt, sample_2.txt
All
ansneg_0.txt, ansneg_1.txt, ansneg_2.txt, ansneg_3.txt, ansneg_4.txt, ansneg_5.txt, ansneg_6.txt, ansneg_7.txt, ansneg_8.txt, ansneg_9.txt, handmade_0.txt, handmade_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_0.txt, sample_1.txt, sample_2.txt, top2fixed_0.txt, top2fixed_1.txt, top2fixed_2.txt, top2fixed_3.txt, top2fixed_4.txt, top2fixed_5.txt, top2fixed_6.txt, top2fixed_7.txt, top2fixed_8.txt, top2fixed_9.txt, topfixed_0.txt, topfixed_1.txt, topfixed_2.txt, topfixed_3.txt, topfixed_4.txt, topfixed_5.txt, topfixed_6.txt, topfixed_7.txt, topfixed_8.txt, topfixed_9.txt
Case Name
Status
Exec Time
Memory
ansneg_0.txt
AC
1 ms
256 KB
ansneg_1.txt
AC
1 ms
256 KB
ansneg_2.txt
AC
1 ms
256 KB
ansneg_3.txt
AC
1 ms
256 KB
ansneg_4.txt
AC
1 ms
256 KB
ansneg_5.txt
AC
1 ms
256 KB
ansneg_6.txt
AC
1 ms
256 KB
ansneg_7.txt
AC
1 ms
256 KB
ansneg_8.txt
AC
1 ms
256 KB
ansneg_9.txt
AC
1 ms
256 KB
handmade_0.txt
AC
1 ms
256 KB
handmade_1.txt
AC
1 ms
256 KB
random_0.txt
AC
1 ms
256 KB
random_1.txt
AC
1 ms
256 KB
random_2.txt
AC
1 ms
256 KB
random_3.txt
AC
1 ms
256 KB
random_4.txt
AC
1 ms
256 KB
random_5.txt
AC
1 ms
256 KB
random_6.txt
AC
1 ms
256 KB
random_7.txt
AC
1 ms
256 KB
random_8.txt
AC
1 ms
256 KB
random_9.txt
AC
1 ms
256 KB
sample_0.txt
AC
1 ms
256 KB
sample_1.txt
AC
1 ms
256 KB
sample_2.txt
AC
1 ms
256 KB
top2fixed_0.txt
AC
1 ms
256 KB
top2fixed_1.txt
WA
1 ms
256 KB
top2fixed_2.txt
WA
1 ms
256 KB
top2fixed_3.txt
WA
1 ms
256 KB
top2fixed_4.txt
WA
1 ms
256 KB
top2fixed_5.txt
AC
1 ms
256 KB
top2fixed_6.txt
AC
1 ms
256 KB
top2fixed_7.txt
AC
1 ms
256 KB
top2fixed_8.txt
WA
1 ms
256 KB
top2fixed_9.txt
WA
1 ms
256 KB
topfixed_0.txt
AC
1 ms
256 KB
topfixed_1.txt
AC
1 ms
256 KB
topfixed_2.txt
AC
1 ms
256 KB
topfixed_3.txt
AC
1 ms
256 KB
topfixed_4.txt
AC
1 ms
256 KB
topfixed_5.txt
AC
1 ms
256 KB
topfixed_6.txt
WA
1 ms
256 KB
topfixed_7.txt
AC
1 ms
256 KB
topfixed_8.txt
AC
1 ms
256 KB
topfixed_9.txt
AC
1 ms
256 KB