Description: The problem of m-point is realized by algorithm
Description of laquo:
Given k positive integers, using the arithmetic operator "+", "-", "*", "/" to connect this k positive integer to make the most
The final count is m.
« programming tasks:
For a given k positive integer, the arithmetic expression of m is given.
« data input:
Input data is given by input.txt. The first row has two positive integers k and m, which means that given k positive integers, and
The final number is m. In the next row, we have k positive integers.
« result output:
Output the arithmetic expression of m to the file output.txt. If there are multiple expressions that satisfy the requirements, just lose
Out of 1 group, each step is separated by a semicolon. If you can't get m, output "No Solution!" .
Example of input file:
Input. TXT output. TXT
5, 125
2, 2, 12, 3, 7
Example of output file:
7 * 3 = 21 21 * 12 = 252 252-2 = 252 250/2 = 125
To Search:
- [roundwiththeproblem.Rar] - Backtracking minimize problems with a ro
- [sourcesbanker] - C language simulation algorithm bankers
- [4x4] - 4* 4 keyboard scan applications uVision3
- [matcom] - 070325 All procedures (polynomial fittin
- [lcs] - Algorithm to achieve the longest common
- [blip0] - Malab realize the best linear optimizati
- [xueshengxuankexitong] - Course student database system, includin
- [ACM] - Computer Science students is a good thin
- [log] - This a log printing process, the realiza
- [shuchuwenjianneirong] - The output TXT file contents, line by li
File list (Check if you may need any files):
Download