Book of programming problems

Contains advanced programming problems for schools, colleges and problem-hungry inidividuals

Problem list
Register
FAQ
Log In
Post a new problem

Given mountain-climbers' profiles, find a schedule for climbing a mountain with minimum number of climbers
Complexity (1-100): 45 A group of mountain-climbers is described by pairs (S,C) for each climber: S - how much provision can the climber carry; C - how much provision he consumes per day. Climbing a mountain takes N days. The way back takes the same time and provision as the way to the top. Some climbers can turn back on the way to the top, giving all his/her provision to others. At least one climber should reach the top. All climbers should return home. Find a schedule with minimal number of climbers.
Solution:	solution.pas

Given mountain-climbers' profiles, find a schedule for climbing a mountain with minimum number of climbers

Complexity (1-100): 45

A group of mountain-climbers is described by pairs (S,C) for each climber:

S - how much provision can the climber carry;
C - how much provision he consumes per day.

Climbing a mountain takes N days. The way back takes the same time and provision as the way to the top. Some climbers can turn back on the way to the top, giving all his/her provision to others. At least one climber should reach the top. All climbers should return home.

Find a schedule with minimal number of climbers.

Solution:

solution.pas

There are no posts in this topic.

Post Reply

Book of programming problems is powered by UseBB 1 Forum Software | Contact Admin