About

About Me

https://cp3solution.blogspot.com/

Showing posts with label icpc practic. Show all posts
Showing posts with label icpc practic. Show all posts

Sunday, September 30, 2018

LightOJ 1216 - Juice in the Glass solution in c++


1216 - Juice in the Glass


1216 - Juice in the Glass
Once upon a time, there lived a mad programmer. He loved to solve creative problems other than anything. His wife loved him quite a lot but disliked his curiosity for the problems. One day he came from office, his wife gave him a glass of cold lime juice. She was in a romantic mood and waiting for some romantic stuff. But the programmer asked her curiously, "If I give u radius of the top and bottom part of the glass and the height, can you come up with the volume of the glass?" His wife became a bit disappointed but as she is smart she replied with a smile, "You already have drunk some juice, and the glass is not full. If I give you the height of the juice, can you find the volume of the remaining juice in the glass?" Then the programmer kissed his wife and said, "You are the best problem setter in the world!"

Now he set the same problem for you. The radius of the upper part r1 and lower part r2 is given. If height of the glass is h and height of the juice is p what is the volume of the juice in the glass?




















1216 - Juice in the Glass


Input

Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case starts with a line containing four integers r1 r2 h p (1 ≤ r2 < r1 ≤ 100, 1 ≤ p ≤ h ≤ 100).





Output

For each case, print the case number and the volume of the juice in the glass. Errors less than 10-6 will be ignored.
Sample Input
Output for Sample Input
2
5 2 3 2
5 2 3 3
Case 1: 58.643062867
Case 2: 122.52211349








Thought at least 3 times then see my code...........





























PROBLEM SETTER: AKM MUBASHWIR ALAM
SPECIAL THANKS: JANE ALAM JAN













Light OJ 1008 - Fibsieve`s Fantabulous Birthday solution in c++


1008 - Fibsieve`s Fantabulous Birthday

1008 - Fibsieve`s Fantabulous Birthday

Fibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.
Among these gifts there was an N x N glass chessboard that had a light in each of its cells. When the board was turned on a distinct cell would light up every second, and then go dark.
The cells would light up in the sequence shown in the diagram. Each cell is marked with the second in which it would light up.
1008 - Fibsieve`s Fantabulous Birthday

(The numbers in the grids stand for the time when the corresponding cell lights up)
In the first second the light at cell (1, 1) would be on. And in the 5th second the cell (3, 1) would be on. Now, Fibsieve is trying to predict which cell will light up at a certain time (given in seconds). Assume that N is large enough.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.
Each case will contain an integer S (1 ≤ S ≤ 1015) which stands for the time.

Output

For each case you have to print the case number and two numbers (x, y), the column and the row number.

Sample Input

Output for Sample Input

3
8
20
25
Case 1: 2 3
Case 2: 5 4
Case 3: 1 5


PROBLEM SETTER: MUNTASIR MUZAHID CHOWDHURY
SPECIAL THANKS: JANE ALAM JAN (DATASET)

Thought at least 3 times then see my solution........