AtCoder Regular Contest 039

Submission #4028593

Source codeソースコード

#include<bits/stdc++.h>
using namespace std;
int n,m,ans=-100000,x,y;
int main()
{
    scanf("%d%d",&n,&m);
    x=n,y=m;
    ans=max(ans,(x%100+900-y));//更改n的百位
    ans=max(ans,((x/100)*100+x%10+90)-y);//更改n的十位
    ans=max(ans,x+9-x%10-y);//更改n的个位
    ans=max(ans,x-(y%100+100));//更改m的百位
    ans=max(ans,x-((y/100)*100+y%10));//更改m的十位
    ans=max(ans,x-(y-y%10));//更改m的个位
    cout<<ans<<endl;
    return 0;
}

Submission

Task問題 A - A - B problem
User nameユーザ名 luogu_bot3
Created time投稿日時
Language言語 C++ (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 468 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 256 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample_0.txt,sample_1.txt,sample_2.txt
All 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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