Albert's Profile
Scholar
76
points

Questions
4

Answers
2

  • A king wants an advisor and comes to ask the 3 wisest sages.

    He blindfolds them and put the hats on their head. Afterwards, the king takes off their blindfolds. He tells them that their hat is either blue or white. He tells them that whoever can deduce the color of their hat will be his next advisor. Also he tells them that at least one of the sages will be wearing a blue hat. The sages can all see each other’s hats except of course, their own. Sage A sees that the other 2 are wearing blue hats.
    For hours no one spoke, then Sage A stands up and tells the  king the colour of his hat. What color is it and how does he know?

    Share
    View Solution
    Submit Solution
    • 6082 views
    • 4 answers
    • 1 votes

  • King Akbar asked Birbal

    Write something on this wall, which if read in good times, makes you sad and if read in your bad time, makes you happy.

    Share
    View Solution
    Submit Solution
    • 5693 views
    • 2 answers
    • 1 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:

      1. You start with 0 cookies, but producing 2 cookies per second.

     

      1. After 250 seconds, you will have C=500 cookies and can buy a farm that producesF=4 cookies per second.

     

      1. After buying the farm, you have 0 cookies, and your total cookie production is 6 cookies per second.

     

      1. The next farm will cost 500 cookies, which you can buy after about 83.3333333seconds.

     

      1. After buying your second farm, you have 0 cookies, and your total cookie production is 10 cookies per second.

     

      1. Another farm will cost 500 cookies, which you can buy after 50 seconds.

     

      1. After buying your third farm, you have 0 cookies, and your total cookie production is 14 cookies per second.

     

      1. 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, TT lines follow. Each line contains three space-separated real-valued numbers: CF and X, whose meanings are described earlier in the problem statement.

    CF 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

     

     

    Share
    View Solution
    Submit Solution
    • 4141 views
    • 1 answers
    • 0 votes

  • You are trying to cook an egg for exactly fifteen minutes, but instead of a timer, you are given two ropes which burn for exactly 1 hour each. The ropes, however, are of uneven densities – i e , half the rope length-wise might take only two minutes to burn. How can you cook the egg for exactly fifteen minutes?

    Share
    View Solution
    Submit Solution
    • 4652 views
    • 2 answers
    • 1 votes