Submission #4428915


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
char sa[505],sb[505];
int a[505],b[505],s[505];
int main(){
    cin>>sa>>sb;
    int la=strlen(sa),lb=strlen(sb);
    if(la<lb||(la==lb&&strcmp(sa,sb)<0)){
    	cout<<"-";
    	swap(sa,sb);
    	swap(la,lb);
	}
    int ls=max(la,lb);
    for(int i=0;i<la;i++)a[la-i]=sa[i]-'0';
    for(int i=0;i<lb;i++)b[lb-i]=sb[i]-'0';
    for(int i=1;i<=ls;i++)s[i]=a[i]-b[i];
    for(int i=1;i<=ls;i++){
    	if(s[i]<0){
    		s[i+1]--;
    		s[i]+=10;
		}
	}
	while(s[ls]==0&&ls>1)ls--;
	for(int i=ls;i>=1;i--)cout<<s[i];
	return 0;
}

Submission Info

Submission Time
Task A - A - B problem
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 569 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