C/C++ 判斷兩個整數相乘是否溢出

來源:互聯網
上載者:User
 判斷兩int相乘是否溢出,目前找到的最正確方式:

int is_mul_overflow(int a, int b) {
if( a >= 0 && b >=0 ) {
return INT_MAX / a < b;
}
else if( a < 0 && b < 0 ) {
return INT_MAX / a > b;
}
else if( a * b == INT_MIN ) {
return 0;
}
else {
return a < 0 ? is_mul_overflow(-a, b) : is_mul_overflow(a, -b);
}
}

void check(int n1, int n2, int expect_ret, int case_n) {
int ret = is_mul_overflow(n1, n2);
if( expect_ret == is_mul_overflow(n1, n2) )
printf("test pass case:%d\n",case_n);
else
printf("test fail case:%d\n",case_n);
}

int main() {
int case_n = 0;
check(1, 0x80000000, 0, ++case_n);
check(-1, 0x80000000, 1, ++case_n);
check(0x80000000, -1, 1, ++case_n);
check(-1, 0x80000001, 0, ++case_n);
check(0x80000001, -1, 0, ++case_n);
check(1, 0x7fffffff, 0, ++case_n);
check(0x7fffffff, 1, 0, ++case_n);
check(2, 0x7fffffff, 1, ++case_n);
check(0x7fffffff, 2, 1, ++case_n);
check(0x7fffffff, -1, 0, ++case_n);
check(-1, 0x7fffffff, 0, ++case_n);
check(2, 0xc0000000, 0, ++case_n);
check(0xc0000000, 2, 0, ++case_n);
check(0x70000000, 2, 1, ++case_n);
check(2, 0x70000000, 1, ++case_n);

printf("%x\n", INT_MIN);
printf("%x\n", INT_MAX);
return 0;
}

歡迎給出更多測試資料

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.