Submission #4062697


Source Code Expand

#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
char a[9001],b[9001];
long long x[9001],y[9001],z[9001];
int main()
{
	cin>>a>>b;
	long long la=strlen(a),lb=strlen(b),t,i,j;
	for(i=0;i<la;i++) x[i]=a[la-1-i]-48;
	for(i=0;i<lb;i++) y[i]=b[lb-1-i]-48;
	for(i=0;i<=9000;i++)
	{
		t=x[i]-y[i]-z[i];
		if(t<0)
		{
			z[i+1]++;
			z[i]=t+10;
		}
		else z[i]=t;
	}
	for(i=9000;i>=0;i--) if(z[i]!=0) break;
	if(i==-1) cout<<"0";
	for( ;i>=0;i--) cout<<z[i];
	return 0;
}

Submission Info

Submission Time
Task A - A - B problem
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 0
Code Size 517 Byte
Status WA
Exec Time 3 ms
Memory 384 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 2 ms 384 KB
ansneg_1.txt WA 2 ms 384 KB
ansneg_2.txt WA 2 ms 384 KB
ansneg_3.txt WA 2 ms 384 KB
ansneg_4.txt WA 2 ms 384 KB
ansneg_5.txt WA 2 ms 384 KB
ansneg_6.txt WA 2 ms 384 KB
ansneg_7.txt WA 2 ms 384 KB
ansneg_8.txt WA 2 ms 384 KB
ansneg_9.txt WA 3 ms 384 KB
handmade_0.txt WA 1 ms 384 KB
handmade_1.txt WA 1 ms 384 KB
random_0.txt WA 1 ms 384 KB
random_1.txt WA 1 ms 384 KB
random_2.txt WA 2 ms 384 KB
random_3.txt WA 1 ms 384 KB
random_4.txt WA 2 ms 384 KB
random_5.txt WA 1 ms 384 KB
random_6.txt WA 1 ms 384 KB
random_7.txt WA 2 ms 384 KB
random_8.txt WA 1 ms 384 KB
random_9.txt WA 1 ms 384 KB
sample_0.txt WA 1 ms 384 KB
sample_1.txt WA 1 ms 384 KB
sample_2.txt WA 2 ms 384 KB
top2fixed_0.txt WA 1 ms 384 KB
top2fixed_1.txt WA 1 ms 384 KB
top2fixed_2.txt WA 1 ms 384 KB
top2fixed_3.txt WA 1 ms 384 KB
top2fixed_4.txt WA 1 ms 384 KB
top2fixed_5.txt WA 1 ms 384 KB
top2fixed_6.txt WA 1 ms 384 KB
top2fixed_7.txt WA 1 ms 384 KB
top2fixed_8.txt WA 1 ms 384 KB
top2fixed_9.txt WA 1 ms 384 KB
topfixed_0.txt WA 1 ms 384 KB
topfixed_1.txt WA 1 ms 384 KB
topfixed_2.txt WA 1 ms 384 KB
topfixed_3.txt WA 1 ms 384 KB
topfixed_4.txt WA 1 ms 384 KB
topfixed_5.txt WA 1 ms 384 KB
topfixed_6.txt WA 1 ms 384 KB
topfixed_7.txt WA 1 ms 384 KB
topfixed_8.txt WA 1 ms 384 KB
topfixed_9.txt WA 1 ms 384 KB