Submission #5444837


Source Code Expand

#include<cstdio>
#include<iostream>
using namespace std;
int read()
{
    char ch=getchar();
    while(ch<'0'||ch>'9')
    ch=getchar();
    return ch-'0';
}
int a[3],b[3];
int main()
{
    for(int i=0;i<3;i++)
    a[i]=read();
    for(int i=0;i<3;i++)
    b[i]=read();
    int q=(a[0]-b[0])*100+(a[1]-b[1])*10+(a[2]-b[2]),u=max(9-a[0],b[0]-1);
    if(u)
    printf("%d",q+u*100);
    else
    {
        u=max(9-a[1],b[1]-1);
        if(u)
        printf("%d",q+u*10);
        else
        {
            u=max(9-a[2],b[2]-1);
            printf("%d",q+u);
        }
    }
    return 0;
}

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 3
WA × 45
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 WA 1 ms 256 KB
ansneg_1.txt WA 1 ms 256 KB
ansneg_2.txt WA 1 ms 256 KB
ansneg_3.txt WA 1 ms 256 KB
ansneg_4.txt WA 1 ms 256 KB
ansneg_5.txt WA 1 ms 256 KB
ansneg_6.txt WA 1 ms 256 KB
ansneg_7.txt WA 1 ms 256 KB
ansneg_8.txt WA 1 ms 256 KB
ansneg_9.txt WA 1 ms 256 KB
handmade_0.txt WA 1 ms 256 KB
handmade_1.txt WA 1 ms 256 KB
random_0.txt WA 1 ms 256 KB
random_1.txt WA 1 ms 256 KB
random_2.txt WA 1 ms 256 KB
random_3.txt WA 1 ms 256 KB
random_4.txt WA 1 ms 256 KB
random_5.txt WA 1 ms 256 KB
random_6.txt WA 1 ms 256 KB
random_7.txt WA 1 ms 256 KB
random_8.txt WA 1 ms 256 KB
random_9.txt WA 1 ms 256 KB
sample_0.txt WA 1 ms 256 KB
sample_1.txt WA 1 ms 256 KB
sample_2.txt WA 1 ms 256 KB
top2fixed_0.txt WA 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 WA 1 ms 256 KB
top2fixed_6.txt WA 1 ms 256 KB
top2fixed_7.txt WA 1 ms 256 KB
top2fixed_8.txt WA 1 ms 256 KB
top2fixed_9.txt WA 1 ms 256 KB
topfixed_0.txt WA 1 ms 256 KB
topfixed_1.txt WA 1 ms 256 KB
topfixed_2.txt WA 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 WA 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