整体思路
- 字符串读入
- 倒序存入整数数组,使得低位对齐便于运算。注意:本代码整数数组每个位置只存一位数
- 模拟竖式计算,注意进位、借位等操作
- 反向输出
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
char s[MAXN];
int x[MAXN],y[MAXN],z[MAXN << 1];
int zlen;
bool flag = false;
bool bigger(int x[], int xlen, int y[], int ylen) {
if (xlen < ylen) {
return false;
} else if (xlen > ylen) {
return true;
} else {
for (int i = xlen - 1; i >= 0; i--) {
if (x[i] < y[i]) {
return false;
}
if (x[i] > y[i]) {
return true;
}
}
return true;
}
}
int read_num(int num[]) {
fill(num,num + MAXN,0);
flag = false;
int eof = scanf("%s",&s);
if (eof == -1) {
return 0;
}
int len = strlen(s);
for (int i = 0; i < len; i++) {
num[len - i - 1] = s[i] - '0';
}
return len;
}
void print_num(int ans[], int len) {
if (flag) {
putchar('-');
flag = false;
}
while (len > 1 && ans[len - 1] == 0) {
len--;
}
for (int i = len - 1; i >= 0; i--) {
putchar(ans[i] + '0');
}
putchar('\n');
return ;
}
int add_num(int x[], int xlen, int y[], int ylen, int z[]) {
fill(z,z + (MAXN << 1),0);
int len = max(xlen,ylen);
for (int i = 0; i < len; i++) {
z[i] += x[i] + y[i];
if (z[i] >= 10) {
z[i + 1]++;
z[i] -= 10;
}
}
if (z[len] != 0) {
len++;
}
return len;
}
int sub_num(int x[], int xlen, int y[], int ylen, int z[]) {
fill(z,z + (MAXN << 1),0);
if (!bigger(x,xlen,y,ylen)) {
flag = true;
swap(x,y);
}
int len = max(xlen,ylen);
for (int i = 0; i < len; i++) {
z[i] += x[i] - y[i];
if (z[i] < 0) {
z[i + 1]--;
z[i] += 10;
}
}
return len;
}
int mul_num(int x[], int xlen, int y[], int ylen, int z[]) {
fill(z,z + (MAXN << 1),0);
for (int i = 0; i < xlen; i++) {
for (int j = 0; j < ylen; j++) {
z[i + j] += x[i] * y[j];
if (z[i + j] >= 10) {
z[i + j + 1] += z[i + j] / 10;
z[i + j] %= 10;
}
}
}
return xlen + ylen;
}
int div_sub(int x[], int xlen, int y[], int ylen, int z[]) {
int zloc = xlen - ylen;
for (int i = 1; i <= ylen; i++) {
if (x[xlen - i] > y[ylen - i]) {
break;
}
if (x[xlen - i] < y[ylen - i]) {
zloc--;
break;
}
}
for (int i = zloc,j = 0; i < xlen && j < ylen; i++,j++) {
if (x[i] < y[j]) {
x[i + 1]--;
x[i] += 10;
}
x[i] -= y[j];
}
z[zloc]++;
while (xlen > 1 && x[xlen - 1] == 0) {
xlen--;
}
return xlen;
}
int div_num(int x[], int &xlen, int y[], int ylen, int z[]) {
fill(z,z + (MAXN << 1),0);
int len = xlen - ylen + 1;
if (len < 1) {
return 1;
}
while (bigger(x,xlen,y,ylen)) {
xlen = div_sub(x,xlen,y,ylen,z);
}
return len;
}
void solve() {
int xlen,ylen,zlen;
while (xlen = read_num(x)) {
ylen = read_num(y);
zlen = div_num(x,xlen,y,ylen,z);
print_num(z,zlen);
}
return ;
}
int main() {
solve();
return 0;
}
缺点
- 待优化负数运算,提前处理掉符号位。
- 效率不够高,可进行压位。