//1非递归快速乘法
long quickMultiply(int A, int B){//用int爆了
long ans = 0;
long a = (long)A;
long b = (long)B;
for (; b; b >>= 1)
{
if (b & 1)
ans += a;
a <<= 1;
}
return ans;
}
//2递归版
int multiply(int A, int B) {
if (B == 0)return 0;
if (B == 1)return A;
if (B & 1)
return multiply(A << 1, B >> 1) + A;
else return multiply(A << 1, B >> 1);
}
//累加递归
int multiply(int A, int B) {
return B == 0 ? 0 : A + multiply1(A, B - 1);
}