高精度减法要注意的是被减数必须必减数大,同时需要处理借位。方法类似于高精度加法。
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 1001
using namespace std ;
int main ( )
{
int a [ N ] , b [ N ] , c [ N ] , i ;
char n [ N ] , n1 [ N ] , n2 [ N ] ;
memset ( a , 0 , sizeof ( a ) ) ;
memset ( b , 0 , sizeof ( b ) ) ;
memset ( c , 0 , sizeof ( c ) ) ;
gets ( n1 ) ;
gets ( n2 ) ;
int lena = strlen ( n1 ) , lenb = strlen ( n2 ) ;
if ( lena < lenb || ( lena == lenb && strcmp ( n1 , n2 ) < 0 ) )
{
strcpy ( n , n1 ) ;
strcpy ( n1 , n2 ) ;
strcpy ( n2 , n ) ;
swap ( lena , lenb ) ;
printf ( "-" ) ;
}
for ( i = 0 ; i < lena ; i ++ ) a [ lena - i ] = int ( n1 [ i ] - '0' ) ;
for ( i = 0 ; i < lenb ; i ++ ) b [ lenb - i ] = int ( n2 [ i ] - '0' ) ;
i = 1 ;
while ( i <= lena || i<= lenb )
{
if ( a [ i ] < b [ i ] )
{
a [ i ] += 10 ;
a [ i + 1 ] -- ;
}
c [ i ] = a [ i ] - b [ i ] ;
i ++ ;
}
int lenc = i ;
while ( c [ lenc ] == 0 && lenc > 1 ) lenc -- ;
for ( i = lenc ; i >= 1 ; i -- ) printf ( "%d" , c [ i ] ) ;
return 0 ;
}
相关链接:
C++高精度加法模板:
https://blog.csdn.net/zj_mrz/article/details/80948327
C++快速幂模板:
https://blog.csdn.net/zj_mrz/article/details/80950616