C. Numbers on Whiteboard codeforce 1430c 构造栈

最新推荐文章于 2021-11-20 00:19:53 发布

我不是手机

最新推荐文章于 2021-11-20 00:19:53 发布

阅读量366

点赞数 1

分类专栏： cf800--1200

本文链接：https://blog.csdn.net/qq_45891413/article/details/109025487

版权

给定白板上写有1到n的整数，每次操作可以擦除任意两个数a和b并用(a+b)/2向上取整替换。目标是通过n-1次操作使最后留下的数尽可能小。例如n=4，最佳策略是(4,2)→(3,3)→(3,1)→2。输出每个测试案例的最小可能结果数及每次操作的数对。" 112908541,10469409,Python函数详解：定义、调用与参数,"['Python编程', '函数', '编程基础']

摘要由CSDN通过智能技术生成

C. Numbers on Whiteboard
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Numbers 1,2,3,…n (each integer from 1 to n once) are written on a board. In one operation you can erase any two numbers a and b from the board and write one integer a+b2 rounded up instead.

You should perform the given operation n−1 times and make the resulting number that will be left on the board as small as possible.

For example, if n=4, the following course of action is optimal:

choose a=4 and b=2, so the new number is 3, and the whiteboard contains [1,3,3];
choose a=3 and b=3, so the new number is 3, and the whiteboard contains [1,3];
choose a=1 and b=3, so the new number is 2, and the whiteboard contains [2].
It’s easy to see that after n−1 operations, there will be left only one number. Your goal is to minimize it.

Input
The first line contains one integer t (1≤t≤1000) — the number of test cases.

The only line of each test case contains one integer n (2≤n≤2⋅105) — the number of integers written on the board initially.

It’s guaranteed that the total sum of n over test cases doesn’t exceed 2⋅105.

Output
For each test case, in the first line, print the minimum possible number left on the board after n−1 operations. Each of the next n−1 lines should contain two integers — numbers a and b chosen and erased in each operation.
每次取最后两个进行操作，然后把操作完的数字压入栈中，直到最后栈中只有一个数字为止