17630번 - Tower 점수다국어

Farmhand Jernej gets bored in the evenings, thus he invented a simple game. He wants to build a tower from numbers on pieces of paper. He starts with a piece of paper and writes 1 on it.

Jernej can write another number on a piece of paper and place it on top of the tower. The new value on the top of the tower must be a valid sum of numbers on consecutive papers comprising the tower. Let's say there are currently n pieces of paper comprising the tower. He makes a sum of numbers in the tower within arbitrary positions [l, u], where 1 ≤ l ≤ u ≤ n and puts the sum on top.

Jernej wants to produce T towers with desired numbers on top. Help him find out the required steps. He also asks you to minimize the number of those steps.

In the first line of input, you will be given a positive integer T (number of different towers Jernej wants to produce).

In each of the next T lines, there will be one positive integer q , the value Jernej wants to produce at the end. All games are independent.

For each integer q:

• print one line with number s (0 ≤ s ≤ 1000) - required steps to produce the desired value.
• In the next s lines, there should be 2 space-separated positive integers l and u, range bounds to produce the desired value.

• 1 ≤ T ≤ 1000
• 1 ≤ q ≤ 10¹⁸

There will be 10 test cases with T towers. For each test case, points will be calculated using the following rules:

• If the solution produces the desired value with minimal number of steps for all towers, you get 10 points for the test case,
• otherwise, your solution will be scored as the minimum of the score of all towers, where towers are scored as 1 + (minimum steps)/solution steps) · 7.
• If the solution for one of the towers is invalid, the solution gets 0 points.

All towers will have a valid solution.