Description: ★ issue of the number of structures to describe the problem to only include the number of a [0 .. 9] of the string, use some of the character string to build a 15, the largest integer divisible. Note that each string of characters can only be used once. ★ programming tasks for a given string from the structure to the greatest integer divisible by 15. ★ data input is given by the input data file input.txt. Input data include only the number of a [0 .. 9] string, the string length of 1 .. 1000. If you can not build out the figures, please output " impossible" . ★ run data output will be output to a file in output.txt. Output line number of string.
To Search:
File list (Check if you may need any files):
make.cpp
Download