Codeforces•Sep 01, 2025

Add Candies

Hazrat Ali

Codeforces

There are n bags with candies, initially the i-th bag contains i candies. You want all the bags to contain an equal amount of candies in the end.

To achieve this, you will:

  • Choose m such that 1≤m≤1000

  • Perform m operations. In the j-th operation, you will pick one bag and add j candies to all bags apart from the chosen one.

Your goal is to find a valid sequence of operations after which all the bags will contain an equal amount of candies.

  • It can be proved that for the given constraints such a sequence always exists.

  • You don't have to minimize m.

  • If there are several valid sequences, you can output any.

Input

Each test contains multiple test cases.

The first line contains the number of test cases t (1≤t≤100). Description of the test cases follows.

The first and only line of each test case contains one integer n (2≤n≤100).

Output

For each testcase, print two lines with your answer.

In the first line print m (1≤m≤1000) — the number of operations you want to take.

In the second line print m positive integers a1,a2,…,am (1≤ai≤n), where aj is the number of bag you chose on the j-th operation.

Example
Input
2
2
3
Output
1
2
5
3 3 3 1 2

Solution
#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    cout << n - 1 << endl;
    for (int i = 2; i <= n; i++) {
      cout << i << " ";
    }
    cout << endl;
  }
  return 0;
}


Comments