Andrew Hoyle mettledrum
mettledrum
/ recursive_change.py
Last active
August 29, 2015 13:59
The classic change-finding recursive algorithm
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # gets combinations of coinage for your change | |
| # makes sure not to repeat combos by using skip_list | |
| # generates partial solutions using partial_list | |
| # when value is reached, partial_list is stuffed into final_list | |
| def spare_a_dime_brotha(money, global_skip_list, global_partial_list, final_list): | |
| # make copies local to the scope | |
| partial_list = global_partial_list[:] | |
| skip_list = global_skip_list[:] | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def scoring | |
| @heat = Heat.find(params[:heat_id]) | |
| @judge = current_user | |
| @event = Event.find(params[:event_id]) | |
| # {st_id => [team#, [team, member, names]]} | |
| @team_info = ScheduledTeam.eager_load( | |
| heat: { | |
| score_system: :score_terms, | |
| scheduled_teams: { | |
| registered_team: { |
NewerOlder