Mercurial > hg > problem6
graph
-
gencases: swap C and D arguments (bug) draftTue, 17 Mar 2015 09:53:40 -0400, by Jordi Gutiérrez Hermoso
-
Case: swap capital and days arguments, was misparsing input (bug) draftTue, 17 Mar 2015 09:50:41 -0400, by Jordi Gutiérrez Hermoso
-
main: call solver with new optional debug arguments draftTue, 17 Mar 2015 09:48:55 -0400, by Jordi Gutiérrez Hermoso
-
snapshot_input.txt, work.ans: new test data draftTue, 17 Mar 2015 09:37:57 -0400, by Jordi Gutiérrez Hermoso
-
failgreedy.txt: synthetic example of where the greedy algorithm fails (new file) draftWed, 11 Mar 2015 16:49:13 -0400, by Jordi Gutiérrez Hermoso
-
main: use CLI args to select the algorithm to use draftWed, 11 Mar 2015 16:47:17 -0400, by Jordi Gutiérrez Hermoso
-
main: use args to get input filename instead of hardwiring it draftWed, 11 Mar 2015 16:46:25 -0400, by Jordi Gutiérrez Hermoso
-
greedy: new greedy algorithm, works reasonably well draftWed, 11 Mar 2015 16:44:55 -0400, by Jordi Gutiérrez Hermoso
-
process_options: new function to handle CLI args draftWed, 11 Mar 2015 16:44:20 -0400, by Jordi Gutiérrez Hermoso
-
randcases.txt: some randomly generated cases to test on draftWed, 11 Mar 2015 16:38:11 -0400, by Jordi Gutiérrez Hermoso
-
gencases: simple tool to generate some random cases (new file) draftWed, 11 Mar 2015 16:37:31 -0400, by Jordi Gutiérrez Hermoso
-
maint: keep line lengths to 80 chars draftWed, 11 Mar 2015 11:26:03 -0400, by Jordi Gutiérrez Hermoso
-
final_capital: first sell the machine before checking balance to buy (bug) draftTue, 10 Mar 2015 22:31:45 -0400, by Jordi Gutiérrez Hermoso
-
brute_force: new function, O(2^N) solution (exponential time) draftTue, 10 Mar 2015 22:22:02 -0400, by Jordi Gutiérrez Hermoso
-
final_capital: consider as invalid plans that buy more than one machine per day draftTue, 10 Mar 2015 22:20:59 -0400, by Jordi Gutiérrez Hermoso
-
parseinput: skip impossible and unprofitable machines draftWed, 11 Mar 2015 10:30:15 -0400, by Jordi Gutiérrez Hermoso
-
parseinput: also save the maximum possible profit for each machine draftTue, 10 Mar 2015 21:17:54 -0400, by Jordi Gutiérrez Hermoso
-
parseinput: replace lists with namedtuplese draftTue, 10 Mar 2015 19:51:14 -0400, by Jordi Gutiérrez Hermoso