Submission #4479893


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
string s1,s2;
int suan(string x,string y)
{
    int k1=x[0]*100+x[1]*10+x[2];
    int k2=y[0]*100+y[1]*10+y[2];
    return k1-k2;
}
int main(){
    cin>>s1>>s2;
    bool p=0;
    for(int i=0;i<3;++i)
    {
        if(s1[i]<='9'||s2[i]>='1')
        {
            int maxn=0;
            if(s1[i]<'9')
            {
                char c=s1[i];
                s1[i]='9';
                maxn=suan(s1,s2);
                s1[i]=c;
            }
            if((s2[i]>'1'&&i==0)||(s2[i]>'0'&&i>0))
            {
                char c=s2[i];
                if(i==0)s2[i]='1';
                else s2[i]='0';
                maxn=max(maxn,suan(s1,s2));
                s2[i]=c;
            }
            cout<<maxn<<endl;
            p=1;
            break;
        }
        if(!p)cout<<suan(s1,s2)<<endl;
    }
    return 0;
}

Submission Info

Submission Time
Task A - A - B problem
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 872 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
WA × 1
AC × 24
WA × 21
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 2 ms 256 KB
ansneg_1.txt AC 2 ms 256 KB
ansneg_2.txt AC 2 ms 256 KB
ansneg_3.txt AC 2 ms 256 KB
ansneg_4.txt AC 2 ms 256 KB
ansneg_5.txt AC 2 ms 256 KB
ansneg_6.txt AC 2 ms 256 KB
ansneg_7.txt AC 2 ms 256 KB
ansneg_8.txt AC 2 ms 256 KB
ansneg_9.txt AC 2 ms 256 KB
handmade_0.txt AC 2 ms 256 KB
handmade_1.txt AC 2 ms 256 KB
random_0.txt AC 2 ms 256 KB
random_1.txt AC 2 ms 256 KB
random_2.txt AC 2 ms 256 KB
random_3.txt AC 2 ms 256 KB
random_4.txt AC 2 ms 256 KB
random_5.txt AC 2 ms 256 KB
random_6.txt AC 2 ms 256 KB
random_7.txt AC 2 ms 256 KB
random_8.txt AC 2 ms 256 KB
random_9.txt AC 2 ms 256 KB
sample_0.txt AC 2 ms 256 KB
sample_1.txt WA 2 ms 256 KB
sample_2.txt AC 2 ms 256 KB
top2fixed_0.txt WA 2 ms 256 KB
top2fixed_1.txt WA 2 ms 256 KB
top2fixed_2.txt WA 2 ms 256 KB
top2fixed_3.txt WA 2 ms 256 KB
top2fixed_4.txt WA 2 ms 256 KB
top2fixed_5.txt WA 2 ms 256 KB
top2fixed_6.txt WA 2 ms 256 KB
top2fixed_7.txt WA 2 ms 256 KB
top2fixed_8.txt WA 2 ms 256 KB
top2fixed_9.txt WA 2 ms 256 KB
topfixed_0.txt WA 2 ms 256 KB
topfixed_1.txt WA 2 ms 256 KB
topfixed_2.txt WA 2 ms 256 KB
topfixed_3.txt WA 2 ms 256 KB
topfixed_4.txt WA 2 ms 256 KB
topfixed_5.txt WA 2 ms 256 KB
topfixed_6.txt WA 2 ms 256 KB
topfixed_7.txt WA 2 ms 256 KB
topfixed_8.txt WA 2 ms 256 KB
topfixed_9.txt WA 2 ms 256 KB