Programming Puzzle

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 SolutionSubmit Solution 947.9K views
 1 answers
 0 votes

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 SolutionSubmit Solution 1,096.4K views
 3 answers
 0 votes

What will be the output of the program
print(5);
void print (int n){ if (n>0){ printf(“hello”); print(n1); } printf(“world”); }
View SolutionSubmit Solution 1,131.1K views
 3 answers
 1 votes

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 SolutionSubmit Solution 1,264.3K 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 spaceseparated realvalued 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,270.4K views
 1 answers
 0 votes