#include<bits/stdc++.h>
using namespace std;
const int maxn = 1005;
char str1[maxn];
char str2[maxn];
int res[maxn];
int sub_bigNum(char str1[], char str2[]){
int str2_tmp[maxn] = {0};
int len1 = strlen(str1);
int len2 = strlen(str2);
int flag = 0; //flag = 0 表示正数
char* tmp = NULL;
int count = 0;
if(len1 < len2){
flag = 1;
tmp = str1;
str1 = str2;
str2 = tmp;
swap(len1,len2);
}
else if(len1 == len2){
for(int i = 0; i < len1; ++i){
if(str1[i] == str2[i]) continue;
if(str1[i] > str2[i]){
flag = 0;
break;
}
else{
flag = 1;
tmp = str1;
str1 = str2;
str2 = tmp;
break;
}
}
}
for(int i = 0; i < len1; ++i){
res[count++] = str1[len1-1-i]-'0';
}
for(int i = 0; i < len2; ++i){
str2_tmp[i] = str2[len2-1-i]-'0';
}
int maxlen = len1 > len2 ? len1 : len2;
for(int i = 0; i < maxlen; ++i){
res[i] = res[i] - str2_tmp[i];
if(res[i] < 0){
res[i] += 10;
res[i+1] -=