算24点 解题报告

Code:

1. /*********************利用回溯法**********************/
3. #include<iostream>
5. #include<string>//字符串的头文件
6. #include<cmath>
8. usingnamespacestd;
10. constdoublePRECISION(1E-6);//判断是否相等
11. constintCOUNT_OF_NUMBER(4);
12. constintCAL_TWENTY_FOUR(24);
14. doublenumber[COUNT_OF_NUMBER];//存放数据
15. stringexpression[COUNT_OF_NUMBER];//用来存放表达式
17. boolSearch(intn)
18. {
19. intstate=0;//标记是否有符合条件的表达式
20. if(n==1)
21. {
22. if(fabs(number[0]-CAL_TWENTY_FOUR)<PRECISION)
23. {
24. cout<<expression[0]<<endl;
25. returntrue;
26. }
27. else
28. {
29. returnfalse;
30. }
31. }
32. for(inti=0;i<n;i++)
33. {
34. for(intj=i+1;j<n;j++)
35. {
36. doublea,b;
37. stringexpa,expb;
38. a=number[i];
39. b=number[j];
40. number[j]=number[n-1];
41. expa=expression[i];
42. expb=expression[j];
43. expression[j]=expression[n-1];
45. expression[i]='('+expa+'+'+expb+')';//加法处理
46. number[i]=a+b;
47. if(Search(n-1))
48. state=1;
50. expression[i]='('+expa+'-'+expb+')';//减法处理
51. number[i]=a-b;
52. if(Search(n-1))
53. state=1;
55. expression[i]='('+expb+'-'+expa+')';//减法处理
56. number[i]=b-a;
57. if(Search(n-1))
58. state=1;
60. expression[i]=expa+'*'+expb;//乘法处理
61. number[i]=a*b;
62. if(Search(n-1))
63. state=1;
65. if(b!=0)
66. {
67. expression[i]=expa+'/'+expb;//除法处理
68. number[i]=a/b;
69. if(Search(n-1))
70. state=1;
71. }
73. if(a!=0)
74. {
75. expression[i]=expb+'/'+expa;//除法处理
76. number[i]=b/a;
77. if(Search(n-1))
78. state=1;
79. }
80. //数据的赋值
81. number[i]=a;
82. number[j]=b;
83. expression[i]=expa;
84. expression[j]=expb;
85. }
86. }
87. if(state==1)
88. returntrue;
89. else
90. returnfalse;
91. }
92. intmain()
93. {
94. for(inti=0;i<COUNT_OF_NUMBER;i++)
95. {
96. charbuffer[20];
97. intx;
98. cin>>x;
99. number[i]=x;
100. itoa(x,buffer,10);//按十进制将数字转化成字符串
101. expression[i]=buffer;
102. }
103. if(!Search(COUNT_OF_NUMBER))
104. cout<<"Fail."<<endl;
105. return0;
106. }