A14138 | $Copy or Prefix Sum$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given an array of integers $b_1, b_2, \ldots, b_n$ . An array $a_1, a_2, \ldots, a_n$ of integers is hybrid if for each $i$ ( $1 \leq i \leq n$ ) at least one of these conditions is true: - $b_i = a_i$ , or - $b_i = \sum_{j=1}^{i} a_j$ . Find the number of hybrid arrays $a_1, a_2, \ldots, a_n$ . As the result can be very large, you should print the answer modulo $10^9 + 7$ .

The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases. The first line of each test case contains a single integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ). The second line of each test case contains $n$ integers $b_1, b_2, \ldots, b_n$ ( $-10^9 \le b_i \le 10^9$ ). It is guaranteed that the sum of $n$ for all test cases does not exceed $2 \cdot 10^5$ .

For each test case, print a single integer: the number of hybrid arrays $a_1, a_2, \ldots, a_n$ modulo $10^9 + 7$ .

输入 #1

4
3
1 -1 1
4
1 2 3 4
10
2 -1 1 -2 2 3 -5 0 2 -1
4
0 0 0 1

输出 #1

C++ 编辑器

输入

输出