高精度加法:
先将两个字符串换成倒序int型,之后用 g 记录进位的数;
#include<bits/stdc++.h>
using namespace std;
const int maxn = 10000 + 10;
char s_1[maxn],s_2[maxn];
int num_1[maxn],num_2[maxn];
int main()
{
int Tcase;
scanf("%d",&Tcase);
for(int ii = 1; ii <= Tcase ; ii ++)
{
scanf("%s%s",s_1,s_2);
int len_1 = strlen(s_1),len_2 = strlen(s_2);
for(int i = 0; i < len_1 ; i ++)
{
num_1[i] = s_1[len_1 - i - 1] - '0';
}
for(int i = 0;i < len_2 ; i ++)
{
num_2[i] = s_2[len_2 - i - 1] - '0';
}
int num[maxn];
memset(num,0,sizeof(num));
int len = 0;
for(int i = 0, g = 0; g || i < max(len_1 , len_2); i ++)//核心代码
{
int x = g;
if(i < len_1)
x += num_1[i];
if(i < len_2)
x += num_2[i];
g = x / 10 ;
x = x % 10;
num[len ++] = x;
}
while(num[len] == 0)//去除前导0
len --;
cout << "Case "<< ii << ":" << endl;
cout << s_1 << " + " << s_2 <<" = ";
for(int i = len ; i >= 0 ; i -- )
cout << num[i] ;
cout << endl;
if(ii < Tcase)
cout << endl;
}
return 0;
}
高精度减法:首先也要进行预处理,保证a代表的整形数大于b代表的整形数;然后去除前导零的时候考虑一下差为0的情况;
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
int main()
{
char s1[maxn],s2[maxn];
while(~ scanf("%s%s",s1,s2) )//相减的是大数减小数
{
int a[maxn],b[maxn];
int lena = strlen(s1);
int lenb = strlen(s2);
for(int i = 0;i < lena ;i ++)
a[i] = s1[lena - i - 1] - '0';
for(int i = 0 ;i < lenb ;i ++)
b[i] = s2[lenb - i - 1] - '0';
int c[maxn];
memset(c,0,sizeof(c));
int lenc = 0;
for(int i = 0 ,g = 0;i < lena ; i ++)
{
int x = a[i] - g;
if(i < lenb)
x -= b[i];
if(x >= 0)
g = 0;
else
{
g = 1;
x += 10;
}
c[lenc ++] = x;
}
while(c[lenc] == 0 && lenc )// 去除前导0,加上&&lenc是为了防止出现0的情况
lenc --;
for(int i = lenc ;i >= 0 ;i --)
cout << c[i];
cout << endl;
}
return 0;
}
hdu 1042 N!
#include<bits/stdc++.h>
using namespace std;
#define PI acos(-1.0)
const int maxn = 50000 + 10;
int ans[maxn];
int main()
{
int n;
while( ~ scanf("%d",&n) )
{
memset(ans,0,sizeof(ans));
ans[0] = 1;
for(int i = 2; i <= n; i ++)
{
int c= 0;
for(int j = 0; j < maxn ; j ++)
{
int temp = ans[j] * i + c;
c = temp /10;
ans[j] = temp % 10;
}
}
int i;
for(i = maxn - 1; i >= 0; i --)
if(ans[i] != 0)
break;
for(int j = i ; j >= 0 ; j --)
printf("%d",ans[j]);
cout << endl;
}
return 0;
}
高精度乘法:1.如果直接模拟的话时间复杂度是O(n ^2);2.时间复杂度还可以小一点,用快速傅里叶的话就是O(nlgn);
1.朴素乘法;
也是先将字符串转换成倒序int数组;
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 10000 + 10;
char s_1[maxn],s_2[maxn];
int num_1[maxn],num_2[maxn];
int main()
{
while( ~ scanf("%s%s",s_1,s_2))
{
int len_1 = strlen(s_1),len_2 = strlen(s_2);
for(int i = 0; i < len_1 ; i ++)
{
num_1[i] = s_1[len_1 - i - 1] - '0';
}
for(int i = 0;i < len_2 ; i ++)
{
num_2[i] = s_2[len_2 - i - 1] - '0';
}
int num[maxn];
memset(num,0,sizeof(num));
int len = len_1 + len_2 + 1;
for(int i = 0 ;i < len_1 ; i ++)
{
for(int j = 0; j < len_2; j ++)
{
num[i +j] += num_1[i] * num_2[j];// 核心
}
}
for(int i = 0 ;i < len ; i ++)
{
num[i + 1] += num[i] / 10;
num[i] = num[i] % 10;
}
while(num[len] == 0)
len --;
for(int i = len ; i >= 0 ;i --)
cout << num[i];
cout << endl;
}
return 0;
}
2.快速傅里叶
在这附上一些集成的高精度模板,c++中的bign,不过里面的乘法和除法的时间复杂度都是O(n^ 2),而且是除法只能是大数除小数,减法也是只能大数减小数;
转载自
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
const int MAXN = 410;
struct bign
{
int len, s[MAXN];
bign ()
{
memset(s, 0, sizeof(s));
len = 1;
}
bign (int num) { *this = num; }
bign (const char *num) { *this = num; }
bign operator = (const int num)
{
char s[MAXN];
sprintf(s, "%d", num);
*this = s;
return *this;
}
bign operator = (const char *num)
{
for(int i = 0; num[i] == '0'; num++) ; //去前导0
len = strlen(num);
for(int i = 0; i < len; i++) s[i] = num[len-i-1] - '0';
return *this;
}
bign operator + (const bign &b) const //+
{
bign c;
c.len = 0;
for(int i = 0, g = 0; g || i < max(len, b.len); i++)
{
int x = g;
if(i < len) x += s[i];
if(i < b.len) x += b.s[i];
c.s[c.len++] = x % 10;
g = x / 10;
}
return c;
}
bign operator += (const bign &b)
{
*this = *this + b;
return *this;
}
void clean()
{
while(len > 1 && !s[len-1]) len--;
}
bign operator * (const bign &b) //*
{
bign c;
c.len = len + b.len;
for(int i = 0; i < len; i++)
{
for(int j = 0; j < b.len; j++)
{
c.s[i+j] += s[i] * b.s[j];
}
}
for(int i = 0; i < c.len; i++)
{
c.s[i+1] += c.s[i]/10;
c.s[i] %= 10;
}
c.clean();
return c;
}
bign operator *= (const bign &b)
{
*this = *this * b;
return *this;
}
bign operator - (const bign &b)
{
bign c;
c.len = 0;
for(int i = 0, g = 0; i < len; i++)
{
int x = s[i] - g;
if(i < b.len) x -= b.s[i];
if(x >= 0) g = 0;
else
{
g = 1;
x += 10;
}
c.s[c.len++] = x;
}
c.clean();
return c;
}
bign operator -= (const bign &b)
{
*this = *this - b;
return *this;
}
bign operator / (const bign &b)
{
bign c, f = 0;
for(int i = len-1; i >= 0; i--)
{
f = f*10;
f.s[0] = s[i];
while(f >= b)
{
f -= b;
c.s[i]++;
}
}
c.len = len;
c.clean();
return c;
}
bign operator /= (const bign &b)
{
*this = *this / b;
return *this;
}
bign operator % (const bign &b)
{
bign r = *this / b;
r = *this - r*b;
return r;
}
bign operator %= (const bign &b)
{
*this = *this % b;
return *this;
}
bool operator < (const bign &b)
{
if(len != b.len) return len < b.len;
for(int i = len-1; i >= 0; i--)
{
if(s[i] != b.s[i]) return s[i] < b.s[i];
}
return false;
}
bool operator > (const bign &b)
{
if(len != b.len) return len > b.len;
for(int i = len-1; i >= 0; i--)
{
if(s[i] != b.s[i]) return s[i] > b.s[i];
}
return false;
}
bool operator == (const bign &b)
{
return !(*this > b) && !(*this < b);
}
bool operator != (const bign &b)
{
return !(*this == b);
}
bool operator <= (const bign &b)
{
return *this < b || *this == b;
}
bool operator >= (const bign &b)
{
return *this > b || *this == b;
}
string str() const
{
string res = "";
for(int i = 0; i < len; i++) res = char(s[i]+'0') + res;
return res;
}
};
istream& operator >> (istream &in, bign &x)
{
string s;
in >> s;
x = s.c_str();
return in;
}
ostream& operator << (ostream &out, const bign &x)
{
out << x.str();
return out;
}
int main()
{
bign a, b, c, d, e, f, g;
while(cin>>a>>b)
{
a.clean(), b.clean();
c = a+b;
d = a-b;
e = a*b;
f = a/b;
g = a%b;
cout<<"a+b"<<"="<<c<<endl; // a += b
cout<<"a-b"<<"="<<d<<endl; // a -= b;
cout<<"a*b"<<"="<<e<<endl; // a *= b;
cout<<"a/b"<<"="<<f<<endl; // a /= b;
cout<<"a%b"<<"="<<g<<endl; // a %= b;
if(a != b) printf("YES\n");
else printf("NO\n");
}
return 0;
}