...代码呢。。。
by anke2017 @ 2024-03-15 17:38:48
@[ljc0910](/user/1154556)
by anke2017 @ 2024-03-15 17:38:56
@[ljc0910](/user/1154556) 看一下数据范围
by wrkwrkwrk @ 2024-03-15 17:58:36
@[ljc0910](/user/1154556) 给你看一下我的代码吧 ~~求关注இ௰இ~~
```cpp
#include<bits/stdc++.h>
#define mian main
#define MAXN 1000005
using namespace std;
string a , b;
int na[MAXN], nb[MAXN], ans[MAXN];
bool pd;
int main() {
cin >> a >> b;
if((a < b && a.size() == b.size()) || a.size() < b.size())
{
swap(a, b);
pd = true;
}
for(int i = a.size(); i > 0; i --) na[i] = a[a.size() - i] - '0';
for(int i = b.size(); i > 0; i --) nb[i] = b[b.size() - i] - '0';
int maxl = max(a.size(), b.size());
for(int i = 1; i <= maxl; i ++)
{
if(na[i] < nb[i])
{
na[i + 1] --;
na[i] += 10;
}
ans[i] = na[i] - nb[i];
}
while(ans[maxl] == 0) maxl --;
if(pd == true) cout << "-";
for(int i = maxl; i > 0; i --) cout << ans[i];
if(maxl < 1) cout << "0";
return 0;
}
```
by quxiangyu @ 2024-03-15 18:10:30