All Puzzles
-
The number of hours left today is half of the number of hours already passed. What time is it?
A. 8:00 a.m.
B. 12:00
C. 14:00
D. 16:00View SolutionSubmit Solution- 1,450.6K views
- 1 answers
- 0 votes
-
After the recent Puzzle annual marathon, the judges were comparing notes to determine who finished where. From their notes, can you help them to reconstruct the final result?
- Matthew Merryman beat Tom Trent and Jimmy James.
- Peter Piper beat Jimmy James, Tom Trent and Alan Ardman.
- Zach Zebra lost to Peter Piper.
- Graham Goodfellow beat Tom Trent
- Zach Zebra beat Frank Flintbone.
- Graham Goodfellow lost to Frank Flintbone and Peter Piper.
- Tom Trent beat Brian Brick.
- Alan Ardman beat Zach Zebra, Kevin Kingfisher and Graham Goodfellow.
- Kevin Kingfisher lost to Graham Goodfellow and Matthew Merryman.
- Brian Brick beat Kevin Kingfisher.
- Matthew Merryman lost to Alan Ardman and Zach Zebra.
- Frank Flintbone beat Tom Trent, Matthew Merryman and Brian Brick.
- Tom Trent lost to Jimmy James and Alan Ardman.
- Jimmy James beat Graham Goodfellow and Brian Brick.
View SolutionSubmit Solution- 1,449.4K views
- 1 answers
- 0 votes
-
At the recent spring fete, four keen gardeners were displaying their fine roses.
In total there were four colours and each rose appeared in two colours.
From the clues below can you tell who had which colour roses?
- Mr Green had a yellow rose.
- Mr Yellow did not have a red one.
- Mr Red had a blue rose but not a green one.
- Mr Blue did not have a yellow one.
- One person with a red rose also had a green one.
- One person with a yellow rose also had a blue one.
- One of the persons with a green rose had no red.
- Neither of the persons with a yellow rose had a green one.
- No person has two roses of the same colour.
- No two persons had the same two colour roses and their names provide no clues.
View SolutionSubmit Solution- 1,449.9K views
- 1 answers
- 0 votes
-
This was the second problem for Google Code Jam Qualification round 2014, if you are able to solve this problem with the first one(which is very easy) you will be eligible for the next round.
Problem
In this problem, you start with 0 cookies. You gain cookies at a rate of 2 cookies per second, by clicking on a giant cookie. Any time you have at least C cookies, you can buy a cookie farm. Every time you buy a cookie farm, it costs you C cookies and gives you an extra F cookies per second.
Once you have X cookies that you haven’t spent on farms, you win! Figure out how long it will take you to win if you use the best possible strategy.
Example
Suppose C=500.0, F=4.0 and X=2000.0. Here’s how the best possible strategy plays out:
- You start with 0 cookies, but producing 2 cookies per second.
- After 250 seconds, you will have C=500 cookies and can buy a farm that producesF=4 cookies per second.
- After buying the farm, you have 0 cookies, and your total cookie production is 6 cookies per second.
- The next farm will cost 500 cookies, which you can buy after about 83.3333333seconds.
- After buying your second farm, you have 0 cookies, and your total cookie production is 10 cookies per second.
- Another farm will cost 500 cookies, which you can buy after 50 seconds.
- After buying your third farm, you have 0 cookies, and your total cookie production is 14 cookies per second.
- Another farm would cost 500 cookies, but it actually makes sense not to buy it: instead you can just wait until you have X=2000 cookies, which takes about142.8571429 seconds.
Total time: 250 + 83.3333333 + 50 + 142.8571429 = 526.1904762 seconds.
Notice that you get cookies continuously: so 0.1 seconds after the game starts you’ll have 0.2 cookies, and π seconds after the game starts you’ll have 2π cookies.
Input
The first line of the input gives the number of test cases, T. T lines follow. Each line contains three space-separated real-valued numbers: C, F and X, whose meanings are described earlier in the problem statement.
C, F and X will each consist of at least 1 digit followed by 1 decimal point followed by from 1 to 5 digits. There will be no leading zeroes.
Output
For each test case, output one line containing “Case #x: y”, where x is the test case number (starting from 1) and y is the minimum number of seconds it takes before you can have X delicious cookies.
We recommend outputting y to 7 decimal places, but it is not required. y will be considered correct if it is close enough to the correct number: within an absolute or relative error of 10-6. See the FAQ for an explanation of what that means, and what formats of real numbers we accept.
Limits
1 ≤ T ≤ 100.
Small dataset
1 ≤ C ≤ 500.
1 ≤ F ≤ 4.
1 ≤ X ≤ 2000.Large dataset
1 ≤ C ≤ 10000.
1 ≤ F ≤ 100.
1 ≤ X ≤ 100000.Sample
Input Output 4 30.0 1.0 2.0 30.0 2.0 100.0 30.50000 3.14159 1999.19990 500.0 4.0 2000.0
Case #1: 1.0000000 Case #2: 39.1666667 Case #3: 63.9680013 Case #4: 526.1904762
View SolutionSubmit Solution- 1,450.0K views
- 1 answers
- 0 votes
-
Meanwhile, back at the castle, the ogre found that the
boots he had picked at random from his dark storeroom
were all six-league boots. He threw them back. He
needed seven-league boots so that he could cover more
territory.
If in that dark storeroom he had four six-league boots
and eight seven-league boots, how many boots did he
have to pull out to make sure he had a pair of sevenleague
boots?View SolutionSubmit Solution- 1,450.3K views
- 1 answers
- 0 votes
-
The king had his doubts about his sons’ fighting
skills, and so he sent his two eldest to the court magidan
for potions to help fight the ogre.
The magician kept his magic hidden, mindful of the
danger of his potent potion falling into the wrong
hands. In a secret but inconvenient compartment in his
laboratory, he hoarded:
1. four ogre-fighters
2. three dragon-destroyers
3. two evil wizard-vanquishers
How many potions did he have to reach for in order
to make sure that he could give an ogre-fighter to each
of the king’s two sons?View SolutionSubmit Solution- 1,450.5K views
- 1 answers
- 0 votes
-
The local king, determined to defend his kingdom from that wicked ogre, sent his two eldest sons to the court swordsmith.
The swordsmith kept a supply of special ogrefighters (four daggers, three swords and two axes) locked in a chest. The two princes insisted on having the same kind of weapon.
How many weapons did the swordsmith have to take out of the chest to be sure he could meet the demands of the princes?View SolutionSubmit Solution- 1,451.9K views
- 1 answers
- 0 votes
-
Planning to roam the countryside and prey upon its
defenseless people, the ogre reached into his dark
closet. There he had stored four six-league boots and
eight seven-league boots. How many boots did he have
to pull out of the closet to make sure he had a pair that
matched?View SolutionSubmit Solution- 1,450.7K views
- 1 answers
- 0 votes
-
On the day before the spacecraft was to return to
Earth, the Martians held a dinner party for the crew. In
all there were eight at the table: Aken, Bal, Mun, Mark,
Wora, Jones, Rider and Smith.
a. One was a history buff.
b. One was a whiz at math.
c. One was very tall.
d. One was Aken’s friend.
e. One had yellow feathers.
f. One was a pilot.
g. One was a rock collector.
h. One spoke a number of languages.
1. The person who was Aken’s friend sat directly
opposite Mark.
2. Wora sat between the math whiz and Aken’s
friend.
3. The tall one sat opposite Wora, with Aken to her
left.
4. Smith, who had no real friends among the group,
sat to the right of Mun who towered over the rest
of the group.
5. The one who had yellow feathers sat opposite Bal,
between Mun and the one who spoke a number of
languages.
6. Jones was to the right of the rock collector and
opposite the pilot who was next to Rider.
Who was Aken’s friend?View SolutionSubmit Solution- 1,451.2K views
- 1 answers
- 0 votes
-
Kim Jones, Jan Robinson and Pat Smith are the officers
of the spaceship. They serve as the craft’s pilot,
engineer and biochemist, though not necessarily in that
order. Because they have difficulty with Martian names,
they nickname the three Martians who work with them
Jones, Smith and Robinson.
1. Robinson is a Yomi.
2. Jones doesn’t speak any language other than
Martian.
3. Most Martian linguists are Uti.
4. The Martian who serves as interpreter respects the
Martian whose name is the same as the biochemist’s.
5. The Martian whose name is the same as the biochemist
is a Grundi.
6. Jan Robinson beat the engineer at chess.
Who is the pilot?Submit Solution- 1,450.7K views
- 0 answers
- 0 votes
