import java.util.*;
import java.io.*;
import java.math.BigInteger;
import java.math.*;
import java.lang.*;
public class Main {
public static void main(String args[])
{
Scanner cin = new Scanner(System.in);
BigInteger res = BigInteger.ZERO;
BigInteger tmp;
int t;
BigInteger a[] = new BigInteger[4010];
while (cin.hasNextInt()) {
t = cin.nextInt();
for (int ii = 0; ii < t; ++ ii) {
tmp = BigInteger.ONE;
int n;
n = cin.nextInt();
for (int i = n-1; i >= 0; -- i) {
a[i] = cin.nextBigInteger();
}
res = BigInteger.ZERO;
for (int i = 0; i < n; ++ i) {
if (i > 0) tmp = tmp.multiply(BigInteger.valueOf(n-i)).divide(BigInteger.valueOf(i));
if (i%2 == 0) res = res.add(tmp.multiply(a[i]));
else{
res = res.subtract(tmp.multiply(a[i]));
}
}
System.out.println(res);
}
}
}
}
2014 Multi-University Training Contest 6 - HDU4927 - Series 1
最新推荐文章于 2016-09-01 18:59:53 发布