Braden Shepherdson wrote: The output specification for question 4 says that: 1 <= i < j <= n The strict inequality i < j implies that the sublist a_i + ... + a_j must have length at least 2, and therefore that if T = a_i for some i, that is not valid solution, another number must be included. This is just to confirm that this is the intended semantics. Yes. This is...
The output specification for question 4 says that: 1 <= i < j <= n The strict inequality i < j implies that the sublist a_i + ... + a_j must have length at least 2, and therefore that if T = a_i for some i, that is not valid solution, another number must be included. This is just to confirm that this is the intended semantics. Braden
The input comes from standard input as in assignment 3. On Mon, 17 Mar 2008, Zahrah Khalid wrote: Will the input for Question 4 be obtained from standard in like the last assignment, or are we supposed to read in a file?
its been said, std in/std out "Zahrah Khalid" <zkhalid@student.cs.uwaterloo.ca> wrote in message news:Pine.GSO.4.64.0803171533170.9283@cpu20.student.cs.uwaterloo.ca... Will the input for Question 4 be obtained from standard in like the last assignment, or are we supposed to read in a file?
...> south (the maximum farthest one we can get to without running out of water). More generally, if our algorithm produces a different solution with the same time cost, will it be accepted? Thanks in advance. One other question, what is the correct output be if there is no possible path between the start and finish vertex. 1 line with "0" to indicate no wells on the path?
It is enough to return the list of chosen dancers (order doesn't matter). On Thu, 28 Feb 2008, Mike Caldwell wrote: Another question regarding this: What exactly is to be returned? Is it enough to just return the dancers we have chosen to maximize the profit (in order based on start time)? Or is there other information we should return as well (start and finish times ...
Another question regarding this: What exactly is to be returned? Is it enough to just return the dancers we have chosen to maximize the profit (in order based on start time)? Or is there other information we should return as well (start and finish times used, etc...) ?? Thanks, Mike
...On Fri, 22 Feb 2008, cs341 wrote: The order should be from the starting point to the destination (the reverse order is not acceptable). On Fri, 22 Feb 2008, Johnny V wrote: Hi, Does the output for question 4 have to be in any specific order? IE. Can we output the moves it takes to get from the starting point to the finish in reverse order? thanks.
The order should be from the starting point to the destination (the reverse order is not acceptable). On Fri, 22 Feb 2008, Johnny V wrote: Hi, Does the output for question 4 have to be in any specific order? IE. Can we output the moves it takes to get from the starting point to the finish in reverse order? thanks.
