4602: Permutation
内存限制：128 MB
时间限制：1 S
标准输入输出
题目类型：传统
评测方式：文本比较
上传者：
提交：4
通过：4
题目描述
Let's call the cost of a permutation p of length n the value of the expression:
Find the maximum cost among all permutations of length n.
†A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array), and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).
输入格式
Each test consists of multiple test cases. The first line contains a single integer t(1≤t≤30) — the number of test cases. The desc
The only line of each test case contains a single integer n (2≤n≤250) — the length of the permutation.
It is guaranteed that the sum of n over all test cases does not exceed 500.
输出格式
For each test case, output a single integer — the maximum cost among all permutations of length n.
输入样例 复制
5
2
4
3
10
20输出样例 复制
2
17
7
303
2529