A. Make It Zero

time limit per test

1 second

memory limit per test

256 megabytes

During Zhongkao examination, Reycloer met an interesting problem, but he cannot come up with a solution immediately. Time is running out! Please help him.

Initially, you are given an array a consisting of n≥2 integers, and you want to change all elements in it to 0.

In one operation, you select two indices l and r (1≤l≤r≤n) and do the following:

  • Let s=al⊕al+1⊕…⊕ar, where ⊕ denotes the bitwise XOR operation;
  • Then, for all l≤i≤r, replace ai with s.

You can use the operation above in any order at most 8 times in total.

Find a sequence of operations, such that after performing the operations in order, all elements in a are equal to 0. It can be proven that the solution always exists.

Input

The first line of input contains a single integer t (1≤t≤500) — the number of test cases. The description of test cases follows.

The first line of each test case contains a single integer n (2≤n≤100) — the length of the array a.

The second line of each test case contains n integers a1,a2,…,an (0≤ai≤100) — the elements of the array a.

Output

For each test case, in the first line output a single integer k (0≤k≤8) — the number of operations you use.

Then print k lines, in the i-th line output two integers li and ri (1≤li≤ri≤n) representing that you select li and ri in the i-th operation.

Note that you do not have to minimize k. If there are multiple solutions, you may output any of them.

Example

Input

Copy

 

6

4

1 2 3 0

8

3 1 4 1 5 9 2 6

6

1 5 4 1 4 7

5

0 0 0 0 0

7

1 1 9 9 0 1 8

3

100 100 0

Output

Copy

1
1 4
2
4 7
1 8
6
1 2
3 4
5 6
1 3
4 6
1 6
0
4
1 2
6 7
3 4
6 7
1
1 2

Note

In the first test case, since 1⊕2⊕3⊕0=0, after performing the operation on segment [1,4], all the elements in the array are equal to 0.

In the second test case, after the first operation, the array becomes equal to [3,1,4,15,15,15,15,6], after the second operation, the array becomes equal to [0,0,0,0,0,0,0,0].

In the third test case:

Operationa beforea after
1[1,5––––,4,1,4,7][4,4,4,1,4,7]
2[4,4,4,1––––,4,7][4,4,5,5,4,7]
3[4,4,5,5,4,7––––][4,4,5,5,3,3]
4[4,4,5––––––,5,3,3][5,5,5,5,3,3]
5[5,5,5,5,3,3––––––][5,5,5,5,5,5]
6[5,5,5,5,5,5––––––––––––][0,0,0,0,0,0]

In the fourth test case, the initial array contains only 0, so we do not need to perform any operations with it.

解题说明:此题是一道数学题,因为只需要输出一种可行答案,可以采用构造的方法,当n为偶数时,采用2次操作,选择首尾,第一次所有值都一样,第二次肯定是0.如果n为奇数,那么采用4次操作,1到n-1为偶数,2次,最后尾部2次即可。

#include <stdio.h>
#include <limits.h>

int main() 
{
	int t;
	scanf("%d", &t);
	while (t--) 
	{
		int n;
		scanf("%d", &n);
		int a[102];
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
		}
		if (n % 2 == 0)
		{
			printf("2\n");
			printf("1 %d\n", n);
			printf("1 %d\n", n);
		}
		else
		{
			printf("4\n");
			printf("1 %d\n", n - 1);
			printf("1 %d\n", n - 1);
			printf("%d %d\n", n - 1, n);
			printf("%d %d\n", n - 1, n);
		}
	}
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值