Kickstart Round B 2017 Problem A. Math Encoder

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        int k = 1000000007;
        long[] b = new long[10001];
        b[1] = 1;
        for (int i = 2; i < 10001; i++) {
            b[i] = b[i - 1] * 2 % k;
        }
        for (int t = 0; t < T; t++) {
            int N = in.nextInt();
            int[] a = new int[N];
            long re = 0;
            for (int n = 0; n < N; n++) {
                a[n] = in.nextInt();
            }
            for (int i = 0; i < a.length; i++) {
                for (int j = i + 1; j < a.length; j++) {
                    int tp = a[j] - a[i];
                    if (tp != 0) {
                        re += tp * b[j - i] % k;
                        re %= k;
                    }
                }
            }
            System.out.println("Case #" + (t + 1) + ": " + re);
        }
    }