给定n 个正整数和4 个运算符＋、－、*、/，

且运算符无优先级，如2+3*5=25。对于任意给定

的整数m，试设计一个算法，用以上给出的n 个数

和4 个运算符，产生整数m，且用的运算次数最少

给出的n个数中每个数最多只能用1 次，但每种运

算符可以任意使用。-given positive integer n and four Operators +,-,*,/, but Operators without precedence, if 2 3 * 5 = 25. For any given integer m, design a test algorithm, using the above given number n and four Operators, have integer m, and with the least number of Operational n is the number of each number can only be used up to a meeting, but each Operators can use arbitrary.