Description: 4-11 optimal order asked laquo services; Problem description : n with customers while waiting for customer service so that the order can be divided by the sum of n-ping. Laquo; Programming tasks : to the n needs of its customers time and programming services for calculating optimal order. Laquo; Data input : from the document input.txt given input data. The first line is a positive integer n, n said a customer. Following a visit, n is an integer, n said the needs of the customer service hours. Laquo; Results output : Programming will calculate the average waiting time for the smallest output to a file output.txt. Examples of input document output files example input.txt output.txt1056 12 1 99 1000 234 33 55 99 812532.
To Search:
File list (Check if you may need any files):
Download