All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Recruiting Crisis (Posted on 2014-10-03) Difficulty: 2 of 5
At Perplexia Inc Headquarters, the puzzle-writing department has been hugely understaffed as of late. President and CEO, levik, wants the Recruiting Department to hire a number of puzzle-writers, and, to that end, has asked Division Director of Algorithms, Charlie, to come up with a way of determining how many recruiters are needed to focus on hiring new puzzle-writers to reach their hiring goal.

Any given recruiter can be working on filling p positions at once.

Any given position takes d days to be filled by a recruiter.

The hiring goal is to have h new puzzle-writers total, and the goal date to accomplish this is g days from today.

You may assume there are already enough recruiters available; they simply need to be told which position to focus on filling.

How many recruiters are needed to hire the required number of puzzle-writers by the deadline, in terms of p, d, h, and g?

No Solution Yet Submitted by Dustin    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
solution Comment 1 of 1
let F(x) be the floor of x and C(x) be the ceiling of x

so we can break down time into intervals of length D days

in each of these intervals, each recruiter can recruit P puzzle-writers

in G days there are F(G/D) intervals
thus by the G day deadline, each recruiter can recruit F(G/D)*P

if there are R recruiters then we have
F(G/D)*P*R puzzle writers hired
thus we need F(G/D)*P*R>=H
since R needs to be an integer we have


  Posted by Daniel on 2014-10-10 12:59:49
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information