include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
const int N = 100010;
int aa[N];
int bb[N];
int cc[N];
void fun(int m,int n,int la,int lb)
{
for (int i = 1; i <= la; i)
{
int j = 0;
cc[i] = m[i] - n[i]+cc[i];
if (cc[i] < 0)
{
while (cc[i] + 10 * j < 0)
{
j;
}
cc[i] = 10 * j + cc[i];
cc[i + 1] = -j;
}
}
}
void maxs(int la, int lb)
{
if (la > lb)
{
fun(aa, bb,la,lb);
int j = la;
while (cc[j] == 0)
{
j–;
}
for (int i = j; i >= 1; i–)
cout << cc[i] ;
cout << endl;
}
else if (la < lb)
{
fun(bb, aa, lb, la);
cout << “-“;
int j = lb;
while (cc[j] == 0)
{
j–;
}
for (int i = j; i >= 1; i–)
cout << cc[i];
cout << endl;
}
else
{
for (int i = la; i >= 1; i–)
{
if (aa[i] > bb[i])
{
fun(aa, bb, la, lb);
int j = la;
while (cc[j] == 0)
{
j–;
}
for (int i = j; i >= 1; i–)
cout << cc[i];
cout << endl;
break;
}
else if(aa[i][HTML_REMOVED]= 1; i–)
cout << cc[i];
cout << endl;
break;
}
if (i == 1)
cout << 0 << endl;
}
}
}
int main()
{
string a, b;
cin >> a;
cin >> b;
int la = a.size();
int lb = b.size();
for (int i = la; i >= 1; i--)
aa[la-i+1] = a[i-1] - '0';
for (int i = lb; i >= 1; i--)
bb[lb-i+1] = b[i-1] - '0';
maxs(la, lb);
system("pause");
return 0;
}