# Programming Puzzle

The Latest and exclusive collection of Programming Puzzle to tease your brain. Programming Puzzle helps exercising the brain and develop it to think logical and solve real world problems differenlty. PuzzleFry brings you the best Programming Puzzle, you'll enjoy wide range of Programming Puzzle, Lets try few Programming Puzzle listed below -
• Two robots are placed at different points on a straight line of infinite length. When they are first placed down, they each spray out some oil to mark their starting points.

You must program each robot to ensure that the robots will eventually crash into each other. A program can consist of the following four instructions:

• Go left one space
• Go right one space
• Skip the next instruction if there is oil in my current spot
• Go to a label

[Note that a “label” is a name that refers to a line of your code. For example, you could label the third line of your program “surveying”. Then, the instruction “goto surveying” would jump to line 3 and start executing from there on the next cycle.]

A robot will carry out one instruction per second. Both robots need not have the same program. Note that you won’t know ahead of time which robot is on the left and which is on the right.

View Solution
Submit Solution
• 947.9K views

• What will be the output of the following program?

```int main() {

union {

int i;

int j;

void f() {

printf("i=%d, j=%d\n", i, j);

}

};

i = 3;

j = i+++ ++i;

f();

return 0;

}

```
View Solution
Submit Solution
• 1,096.4K views

• What will be the output of the program-
print(5);

```void print (int n){

if (n>0){

printf(“hello”);

print(n-1);

}

printf(“world”);

}

```

View Solution
Submit Solution
• 1,131.1K views

• A programmer walks to the butcher shop and buys a KILO of meat.
An hour later he comes back upset that the butcher shortchanged him by 24 grams.

Hint:- A computer Programmer can only solve and understand it 🙂

View Solution
Submit Solution
• 1,164.3K views

• You are given an array with integers (both positive and negative) in any random order.

Find the sub-array with the largest sum.

View Solution
Submit Solution
• 1,225.2K views

• What do these things all have in common: Laughter, living well, and a good offense?

View Solution
Submit Solution
• 1,255.6K views

• There are 100 passengers boarding a 100 passenger airplane. When passenger 1 gets onto the plane, he is dissoriented, so he randomly picks a seat. Each of the remaining passengers (2, 3, 4, etc.) get onto the plane and take their seat if it is available or picks one of the remaining seats at random if it is not.

What is the chance that the last passenger (passenger 100) will get his seat?

View Solution
Submit Solution
• 1,253.8K views

• Two men, Watson and Holmes, are out in the extremely dry forest. They are completely surrounded by a large forest fire on one side and a dangerous cliff on the other. The wind is blowing the forest fire towards them and the cliff. The fire will reach them in about one day.

Holmes turns to Watson, “I have matches, berries, and enough water for a day. We aren’t going to die.” How can they avoid getting swallowed up by the forest fire?

View Solution
Submit Solution
• 1,254.0K views

• Write a C function to count number of nodes in a given singly linked list.

For example, the function should return 6 for linked list 1->3->1->4->2->1.

View Solution
Submit Solution
• 1,264.3K views

• 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

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. After 250 seconds, you will have C=500 cookies and can buy a farm that producesF=4 cookies per second.

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

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```

View Solution
Submit Solution
Albert Scholar
• 1,270.4K views