CodeForces - 1343B - Balanced Array

链接:https://codeforces.com/problemset/problem/1343/B

原题

You are given a positive integer nn, it is guaranteed that nn is even (i.e. divisible by 22).
You want to construct the array aa of length nn such that:

The first n2n2 elements of aa are even (divisible by 22);
the second n2n2 elements of aa are odd (not divisible by 22);
all elements of aa are distinct and positive;
the sum of the first half equals to the sum of the second half (∑i=1n2ai=∑i=n2+1nai∑i=1n2ai=∑i=n2+1nai).

If there are multiple answers, you can print any. It is not guaranteed that the answer exists.
You have to answer tt independent test cases.

Input
The first line of the input contains one integer tt (1≤t≤1041≤t≤104) — the number of test cases. Then tt test cases follow.
The only line

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值