Submission #2423487
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1000000000; const ll LINF = (ll) 4000000000000000000; const ll MOD = (ll) 1000000007; const double PI = acos(1.0); const int limit = 100010; #define REP(i,m,n) for(int i = (int)m; i < (int)n; i++) #define rep(i,n) REP(i,0,n) #define rep2(i,n) REP(i,1,n+1) #define rep3(i,n) REP(i,0,n+1) #define REPM(i,m,n) for(int i = (int)m; i >= (int)n; i--) #define REPLL(i,m,n) for(ll i=m;i<(ll)(n);i++) #define repll(i,n) REPLL(i,0,n) #define repll2(i,n) REPLL(i,1,n+1) #define MP make_pair #define YES(n) cout << ((n) ? "YES" : "NO") << endl #define Yes(n) cout << ((n) ? "Yes" : "No") << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl #define NP(v) next_permutation(v.begin(),v.end()) #define Size(s) (int) s.size() //------------------------------------------------------ int main() { string a, b; cin >> a >> b; int Max = -INF; rep(k, 3) { rep(i, 10) { if (k == 0 && i == 0) continue; string s = a; s[k] = (char) (i + '0'); int diff = stoi(s) - stoi(b); Max = max(Max, diff); } } rep(k, 3) { rep(i, 10) { if (k == 0 && i == 0) continue; string s = b; s[k] = (char) (i + '0'); int diff = stoi(a) - stoi(s); Max = max(Max, diff); } } cout << Max << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | stoq |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1590 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | AC | 1 ms | 256 KB |
top2fixed_2.txt | AC | 1 ms | 256 KB |
top2fixed_3.txt | AC | 1 ms | 256 KB |
top2fixed_4.txt | AC | 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 | AC | 1 ms | 256 KB |
top2fixed_9.txt | AC | 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 | AC | 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 |