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

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