您好,登錄后才能下訂單哦!
這篇文章給大家分享的是有關(guān)C++如何實(shí)現(xiàn)計(jì)算24點(diǎn)的程序的內(nèi)容。小編覺得挺實(shí)用的,因此分享給大家做個(gè)參考,一起跟隨小編過來看看吧。
近來家庭作業(yè)里有24點(diǎn)的題目,為了找出所有可能的組合,就寫了個(gè)簡(jiǎn)單的程序:
1. 運(yùn)行程序
2. 輸入4個(gè)整數(shù),比如:3 3 7 8
3. 顯示所有可能的組合
代碼:
#include "assert.h" #include <iostream> double operate(double num1, double num2, int op) { assert(op >= 0 && op < 4); if(op == 0){ return num1 + num2; } else if(op == 1){ return num1 - num2; } else if(op == 2){ return num1 * num2; } else{ return num1/num2; } } int calculate(int num1, int num2, int num3, int num4) { char operators[] = "+-*/"; for(int i = 0; i < 4; i ++) { for(int j = 0; j < 4; j ++) { for (int k = 0; k < 4; k ++) { double ret = operate(num1, num2, i); ret = operate(ret, num3, j); ret = operate(ret, num4, k); if(abs(ret - 24) < 0.001){ printf("((%d %c %d) %c %d) %c %d = %f\n", num1, operators[i], num2, operators[j], num3, operators[k], num4, ret); } ret = operate(num1, num2, i); double ret2 = operate(num3, num4, k); ret = operate(ret, ret2, j); if(abs(ret - 24) < 0.001){ printf("(%d %c %d) %c (%d %c %d) = %f\n", num1, operators[i], num2, operators[j], num3, operators[k], num4, ret); } ret = operate(num2, num3, j); ret = operate(num1, ret, i); ret = operate(ret, num4, k); if(abs(ret - 24) < 0.001){ printf("(%d %c (%d %c %d)) %c %d = %f\n", num1, operators[i], num2, operators[j], num3, operators[k], num4, ret); } ret = operate(num2, num3, j); ret = operate(ret, num4, k); ret = operate(num1, ret, i); if(abs(ret - 24) < 0.001){ printf("%d %c ((%d %c %d) %c %d) = %f\n", num1, operators[i], num2, operators[j], num3, operators[k], num4, ret); } ret = operate(num3, num4, k); ret = operate(num2, ret, j); ret = operate(num1, ret, i); if(abs(ret - 24) < 0.001){ printf("%d %c (%d %c (%d %c %d)) = %f\n", num1, operators[i], num2, operators[j], num3, operators[k], num4, ret); } } } } return 0; } int main(int argc, char* argv[]) { int nums[4] = {0, 0, 0, 0}; std::cin >> nums[0] >> nums[1] >> nums[2] >> nums[3]; for (int i = 0; i < sizeof(nums)/sizeof(nums[0]); i ++) { int num1 = nums[i]; int ret = num1; for(int j = 0; j < sizeof(nums)/sizeof(nums[0]); j ++) { if(j == i) continue; int num2 = nums[j]; for(int k = 0; k < sizeof(nums)/sizeof(nums[0]); k++) { if( k == i || k == j) continue; int num3 = nums[k]; for(int l = 0; l < sizeof(nums)/sizeof(nums[0]); l ++) { if(l == i || l == j || l == k) continue; int num4 = nums[l]; calculate(num1, num2, num3, num4); } } } } return 0; }
感謝各位的閱讀!關(guān)于“C++如何實(shí)現(xiàn)計(jì)算24點(diǎn)的程序”這篇文章就分享到這里了,希望以上內(nèi)容可以對(duì)大家有一定的幫助,讓大家可以學(xué)到更多知識(shí),如果覺得文章不錯(cuò),可以把它分享出去讓更多的人看到吧!
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如果涉及侵權(quán)請(qǐng)聯(lián)系站長(zhǎng)郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。