ZYM/BH-int2048-2023
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

upd: ready to optimize /

Browse Source
This commit is contained in:
ZhuangYumin
2023-10-31 10:30:46 +08:00
parent d1ff3e34eb
commit 1966cc7c66
2 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/int2048.cpp
View File

@ -555,7 +555,7 @@ inline void UnsignedDivide(int2048 &A, const int2048 *pB) {
int2048 x_pre(x);
int2048 kOne(1);
UnsignedMinus(x_pre, &kOne);
int cnt = 0;
// int cnt = 0;
while (true) {
/**
* x_{n+1}=2*x_n-x_n*x_n*B/(10^L1))
@ -563,6 +563,8 @@ inline void UnsignedDivide(int2048 &A, const int2048 *pB) {
int2048 tmp = *pB;
UnsignedMultiply(tmp, &x);
UnsignedMultiply(tmp, &x);
// std::cerr << "max length ratio during computing"
// << (double)tmp.num_length / (double)L1 << std::endl;
tmp.RightMoveBy(L1);
int2048 x_next = x;
UnsignedAdd(x_next, &x);
@ -571,7 +573,9 @@ inline void UnsignedDivide(int2048 &A, const int2048 *pB) {
if (UnsignedCmp(x_next, x_pre) == 0) break;
x_pre = std::move(x);
x = std::move(x_next);
cnt++;
// std::cerr << "length ratio of x after each step"
// << (double)x.num_length / (double)L1 << std::endl;
// cnt++;
}
/*ret=A*x/10^(L1)*/
UnsignedMultiply(x, &A);
@ -591,7 +595,7 @@ inline void UnsignedDivide(int2048 &A, const int2048 *pB) {
UnsignedAdd(x, &kOne);
// cnt++;
}
std::cerr << cnt << std::endl;
// std::cerr << cnt << std::endl;
A = std::move(x);
}
int2048 &int2048::Divide(const int2048 &B) {

2
tester/cases/3.py
View File

@ -36,7 +36,7 @@ opt_python=[]
if True:
for i in range(0,10):
val=randint(-10**2,10**2)
val=randint(-10**100,10**100)
opt_cpp.append("a_"+str(i)+"=int2048(\""+str(val)+"\");")
opt_python.append("a_"+str(i)+"="+str(val))
opt_cpp.append("a_"+str(i)+".print(); puts(\"\");")