Submission #5297993
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define Rep(i,n) for(int i=0;i<(int)(n);i++) #define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++) #define REP(i,n) for(ll i=0;i<(ll)(n);i++) #define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--) #define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++) #define put(a) cout<<a<<"\n" #define all(a) (a).begin(),(a).end() #define SORT(a) sort((a).begin(),(a).end()) #define oorret 0 #define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}() typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> P; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a=b;return 1;}return 0;} template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a=b;return 1;}return 0;} int strtoint(string s){ int res = 0; REP(i,s.size()){ res *= 10; res += s[i]-'0'; } return res; } int main(){ string a,b; cin >> a >> b; int res = INT_MIN; Rep(i,3){ string c = a; c[i]='9'; int ta = strtoint(c); int tb = strtoint(b); chmax(res,ta-tb); } Rep(i,3){ string c = b; if(i==0){ c[i]='1'; }else{ c[i]='0'; } int ta = strtoint(a); int tb = strtoint(c); chmax(res,ta-tb); } put(res); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | idaten |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1438 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 |