Submission #1609494
Source Code Expand
#include<functional> #include<algorithm> #include<iostream> #include<utility> #include<string> #include<vector> #include<cmath> #include<stack> #include<queue> #include<deque> #include<map> #include<set> #define rep(i,n) for(int i=0;i<n;i++) #define loop(i,x,n) for(int i=x;i<n;i++) #define pb push_back #define int long long using namespace std; const int INF=1000000007; int dx[4]={1,0,-1,0}; int dy[4]={0,1,0,-1}; signed main(){ int a,b; cin>>a>>b; int submax=INF*(-1); rep(i,3){ int w=pow(10,i); int ma=a-a/w*w+9*w; if(submax<ma-b)submax=ma-b; } int mb=b-b/100*100+100; if(submax<a-mb)submax=a-mb; int ichi=b%10; int juu=b%100; mb=b-juu+ichi; if(submax<a-mb)submax=a-mb; mb=b-ichi; if(submax<a-mb)submax=a-mb; cout<<submax<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | fuu32 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 836 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 384 KB |
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 | 3 ms | 384 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 | WA | 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 | WA | 1 ms | 256 KB |
top2fixed_6.txt | WA | 1 ms | 256 KB |
top2fixed_7.txt | WA | 1 ms | 256 KB |
top2fixed_8.txt | AC | 1 ms | 256 KB |
top2fixed_9.txt | AC | 1 ms | 256 KB |
topfixed_0.txt | WA | 1 ms | 256 KB |
topfixed_1.txt | WA | 1 ms | 256 KB |
topfixed_2.txt | AC | 1 ms | 256 KB |
topfixed_3.txt | WA | 1 ms | 256 KB |
topfixed_4.txt | WA | 1 ms | 256 KB |
topfixed_5.txt | WA | 1 ms | 256 KB |
topfixed_6.txt | AC | 1 ms | 256 KB |
topfixed_7.txt | WA | 1 ms | 256 KB |
topfixed_8.txt | WA | 1 ms | 256 KB |
topfixed_9.txt | WA | 1 ms | 256 KB |