CF383D.Antimatter

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Iahub accidentally discovered a secret lab. He found there nn devices ordered in a line, numbered from 11 to nn from left to right. Each device ii (1<=i<=n)(1<=i<=n) can create either aia_{i} units of matter or aia_{i} units of antimatter.

Iahub wants to choose some contiguous subarray of devices in the lab, specify the production mode for each of them (produce matter or antimatter) and finally take a photo of it. However he will be successful only if the amounts of matter and antimatter produced in the selected subarray will be the same (otherwise there would be overflowing matter or antimatter in the photo).

You are requested to compute the number of different ways Iahub can successful take a photo. A photo is different than another if it represents another subarray, or if at least one device of the subarray is set to produce matter in one of the photos and antimatter in the other one.

输入格式

The first line contains an integer nn (1<=n<=1000)(1<=n<=1000) . The second line contains nn integers a1a_{1} , a2a_{2} , ..., ana_{n} (1<=ai<=1000)(1<=a_{i}<=1000) .

The sum a1+a2+...+ana_{1}+a_{2}+...+a_{n} will be less than or equal to 1000010000 .

输出格式

Output a single integer, the number of ways Iahub can take a photo, modulo 10000000071000000007 ( 109+710^{9}+7 ).

输入输出样例

  • 输入#1

    4
    1 1 1 1
    

    输出#1

    12
    

说明/提示

The possible photos are [1+, 2-], [1-, 2+], [2+, 3-], [2-, 3+], [3+, 4-], [3-, 4+], [1+, 2+, 3-, 4-], [1+, 2-, 3+, 4-], [1+, 2-, 3-, 4+], [1-, 2+, 3+, 4-], [1-, 2+, 3-, 4+] and [1-, 2-, 3+, 4+], where " ii +" means that the ii -th element produces matter, and " ii -" means that the ii -th element produces antimatter.

首页