Submission #5186661


Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
int ans,sum,num;
int main() 
{
	int a,b;
	scanf("%d%d",&a,&b);
	int ag=a%10,as=a/10%10,ab=a/100%10;
	int bg=b%10,bs=b/10%10,bb=b/100%10;
	if(ab==9&&bb!=1)
	{
		num=bg+bs*10+100;
		ans=a-num;
	}
	if(ab!=9&&bb==1)
	{
		sum=ag+as*10+900;
		ans=sum-b;
	}
	if(ab!=9&&bb!=1)
	{
		sum=ag+as*10+900;
		num=bg+bs*10+100;
		ans=max(sum-b,a-num);
	}
	if(ab==9&&bb==1)
	{
		if(as==9&&bs!=0)
		{
			num=bg+bb*100;
			ans=a-num;
		}
		if(as!=9&&bs==0)
		{
			sum=ag+90+ab*100;
			ans=sum-b;
		}
		if(as!=9&&bs!=0)
		{
			sum=ag+90+ab*100;
			num=bg+bb*100;
			ans=max(sum-b,a-num);
		}
		if(as==9&&bs==0)
		{
			if(ag==9&&bg!=0)
			{
				num=bs*10+bb*100;
				ans=a-num;
			}
			if(ag!=9&&bg==0)
			{
				sum=9+as*10+ab*100;
				ans=sum-b;
			}
			if(ag!=9&&bg!=0)
			{
				sum=9+as*10+ab*100;
				num=bs*10+bb*100;
				ans=max(sum-b,a-num);
			}
			if(ag==9&&bg==0)
			{
				printf("898\n");
				return 0;
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

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

Compile Error

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

Judge Result

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