## I take what you receive

I take what you receive and surrender it all by waving my fla. What am I?

A mailbox.

the answer

I take what you receive and surrender it all by waving my fla. What am I?

A mailbox.

the answer

If money really did grow on trees, what would be everyone’s favorite season?

Fall.

the answer

I eat other animals.
I have a big mouth.
I am green.
I live in the water.
Who am I?

I am a crocodile.

the answer

A horse is on a 24 foot chain and wants an apple that is 26 feet away. How can the horse get to the apple?

The chain is not attached to anything.

the answer

Where do fish keep their money?

In the river bank.

the answer

Would you have more money with a million dollars today or a penny today and double your money every day for 31 days?

Second option. Double your money every day for 31 days.

the answer

What is a little dog's favorite drink?

Pupsi-cola.

the answer

If you drop a yellow hat in the Red Sea, what does it become?

Wet.

the answer

There are n coins in a line. (Assume n is even). Two players take turns to take a coin from one of the ends of the line until there are no more coins left. The player with the larger amount of money wins.
Would you rather go first or second? Does it matter?
Assume that you go first, describe an algorithm to compute the maximum amount of money you can win.
Note that the strategy to pick maximum of two corners may not work. In the following example, first player looses the game when he/she uses strategy to pick maximum of two corners.
Example 18 20 15 30 10 14
First Player picks 18, now row of coins is
20 15 30 10 14
Second player picks 20, now row of coins is
15 30 10 14
First Player picks 15, now row of coins is
30 10 14
Second player picks 30, now row of coins is
10 14
First Player picks 14, now row of coins is
10
Second player picks 10, game over.
The total value collected by second player is more (20 + 30 + 10) compared to first player (18 + 15 + 14). So the second player wins.

Going first will guarantee that you will not lose. By following the strategy below, you will always win the game (or get a possible tie).
(1) Count the sum of all coins that are odd-numbered. (Call this X)
(2) Count the sum of all coins that are even-numbered. (Call this Y)
(3) If X > Y, take the left-most coin first. Choose all odd-numbered coins in subsequent moves.
(4) If X < Y, take the right-most coin first. Choose all even-numbered coins in subsequent moves.
(5) If X == Y, you will guarantee to get a tie if you stick with taking only even-numbered/odd-numbered coins.
You might be wondering how you can always choose odd-numbered/even-numbered coins. Let me illustrate this using an example where you have 6 coins:
Example
18 20 15 30 10 14
Sum of odd coins = 18 + 15 + 10 = 43
Sum of even coins = 20 + 30 + 14 = 64.
Since the sum of even coins is more, the first player decides to collect all even coins. He first picks 14, now the other player can only pick a coin (10 or 18). Whichever is picked the other player, the first player again gets an opportunity to pick an even coin and block all even coins.

the answer

What did the schizophrenic bookkeeper say?

I hear invoices!

the answer

© 2019 SOLVE or DIE

Design by Talmer.cz