Submission #5032945


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int main()
{
	char  a1,a2,a3,b1,b2,b3;
	int x,y;
	scanf("%c%c%c %c%c%c",&a1,&a2,&a3,&b1,&b2,&b3);
	if(a1=='9'&&b1=='1')
	{
		if(a2=='9'&&b2=='0')
		{
			if(a3!='9'||b3!='0')
			{
				x=a3-'0';
				y=b3-'0';
				if(9-x>=y)
				a3='9';
				else
				b3='1';
			}
		}
		else
		{
			x=a2-'0';
			y=b2-'0';
			if(9-x>=y)
			a2='9';
			else
			b2='0';
		}
	}
	else
	{
		x=a1-'0';
		y=b1-'0';
		if(9-x>=y-1)
		a1='9';
		else
		b1='1';
	}
	x=int(a1-'0')*100+int(a2-'0')*10+int(a3-'0');
	y=int(b1-'0')*100+int(b2-'0')*10+int(b3-'0');
	cout<<x-y;
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%c%c%c %c%c%c",&a1,&a2,&a3,&b1,&b2,&b3);
                                                ^

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