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

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

  September 30, 2018    Md Abdulla Al Mamun

---

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 r₁ and lower part r₂ 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?

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing four integers r₁ r₂ h p (1 ≤ r₂ < r₁ ≤ 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

Read More

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

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

  September 30, 2018    Md Abdulla Al Mamun

---

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.

(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 ≤ 10¹⁵) 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........

Read More

LightOJ 1202 - Bishops solution in c or c++

LightOJ 1202 - Bishops solution in c or c++

  September 30, 2018    Md Abdulla Al Mamun

---

1202 - Bishops (LightOJ 1202)

There is an Infinite chessboard. Two bishops are there. (Bishop means the chess piece that moves diagonally).

Now you are given the position of the two bishops. You have to find the minimum chess moves to take one to another. With a chess move, a bishop can be moved to a long distance (along the diagonal lines) with just one move.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case contains four integers r₁ c₁ r₂ c₂ denoting the positions of the bishops. Each of the integers will be positive and not greater than 10⁹. You can also assume that the positions will be distinct.

Output

For each case, print the case number and the minimum moves required to take one bishop to the other. Print 'impossible' if it's not possible.

Sample Input	Output for Sample Input
3 1 1 10 10 1 1 10 11 1 1 5 3	Case 1: 1 Case 2: impossible Case 3: 2

---

SPECIAL THANKS: JANE ALAM JAN (DESCRIPTION, SOLUTION, DATASET)

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

Read More

Watermelon codeforces solution in c

Watermelon codeforces solution in c

  September 28, 2018    Md Abdulla Al Mamun

---

A. Watermelon

https://codeforces.com/problemset/problem/4/A

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.

Pete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.

Input

The first (and the only) input line contains integer number w (1 ≤ w ≤ 100) — the weight of the watermelon bought by the boys.

Output

Print YES, if the boys can divide the watermelon into two parts, each of them weighing even number of kilos; and NO in the opposite case.

Examples

input

Copy

8

output

Copy

YES

Note

For example, the boys can divide the watermelon into two parts of 2 and 6 kilos respectively (another variant — two parts of 4 and 4 kilos).

Excuse me!!!!!!!!!!!!!!!!!!!!!!!!!
If you tried 3 or more time and you failed then you see my code. Otherwise try 3 times then see my code, Because it it killed your creativity.

Read More

Theatre Square CodeForece solution in c

Theatre Square CodeForece solution in c

  September 28, 2018    Md Abdulla Al Mamun

---

A. Theatre Square

https://codeforces.com/contest/1/problem/A

time limit per test: 1 second

memory limit per test : 256 megabytes

input: standard input

output: standard output

Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a × a.

What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.

Input

The input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).

Output

Write the needed number of flagstones.

Examples

input

Copy

6 6 4

output

Copy

4

Excuse me!!!!!!!!!!!!!!!!!!!!!!!!!

If you tried 3 or more time and you failed then you see my code. Otherwise try 3 times then see my code, Because it it killed your creativity.

Read More