高精度算法

高精度加法：
#include
using namespace std;
const int maxnn = 505;
char a1[maxnn], b1[maxnn];
int a[maxnn], b[maxnn], c[maxnn];
int main(){
cin >> a1 >> b1;
int t1 = strlen(a1), t2 = strlen(b1);
for(int i = 1; i <= t1; i++) a[i] = a1[t1 - i] - '0'; for(int i = 1; i <= t2; i++) b[i] = b1[t2 - i] - '0'; int maxn = max(t1, t2); for(int i = 1; i <= maxn; i++){ c[i] += a[i] + b[i]; c[i + 1] += c[i] / 10; c[i] %= 10; } if(maxn + 1 != 0) maxn++; while(c[max

高精度算法最先出现在Python成神之路。