codeforces 776c Molly's Chemicals 【思维】

C. Molly's Chemicals

time limit per test

2.5 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Molly Hooper has n different kinds of chemicals arranged in a line. Each of the chemicals has an affection value, The i-th of them has affection value ai.

Molly wants Sherlock to fall in love with her. She intends to do this by mixing a contiguous segment of chemicals together to make a love potion with total affection value as a non-negative integer power of k. Total affection value of a continuous segment of chemicals is the sum of affection values of each chemical in that segment.

Help her to do so in finding the total number of such segments.

Input

The first line of input contains two integers, n and k, the number of chemicals and the number, such that the total affection value is a non-negative power of this number k. (1 ≤ n ≤ 105, 1 ≤ |k| ≤ 10).

Next line contains n integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — affection values of chemicals.

Output

Output a single integer — the number of valid segments.

Examples

input

4 2
2 2 2 2

output

8

input

4 -3
3 -6 -3 12

output

3

Note

Do keep in mind that k0 = 1.

In the first sample, Molly can get following different affection values:

• 2: segments [1, 1], [2, 2], [3, 3], [4, 4];

• 4: segments [1, 2], [2, 3], [3, 4];

• 6: segments [1, 3], [2, 4];

• 8: segments [1, 4].

Out of these, 2, 4 and 8 are powers of k = 2. Therefore, the answer is 8.

In the second sample, Molly can choose segments [1, 2], [3, 3], [3, 4].

自己写的代码总是会超时，用了深搜来搜索所有可能的结果超时，或者用数组存都是超时的

因为，最差情况下，n==10^5,然后二重循环，最坏的情况下的时间复杂度为10^10,肯定超时。

这道题的意思要求输入数组a[n],查找数组任何连续段是否为k的幂次，输出总共有多少个区间段满足；

区间段的可能最大值为10^9*10^5==10^14;  log2(10^14) ≈47；那么生成x[ i]用来存k^i; 

那就从幂入手，查看是否幂为数组区间值；

[sum-x[i] ]=he;  sum意为目前所扫到位置的和；然后循环一遍x[ ]，得到的he是否存在于mp中，如果存在，那么说明x[i] 为数组a[n ]的区间段！

如果不存在说明x[i ]不为a[n] 区间段；

例如：

4 -3

3 -6 -3 12

扫描一遍得到mp[3],mp[-3],mp[-6],mp[6];

sum-x[i]=he ==> sum-he==x[i];

图示：

         | ---------->  x[i]   <----------  |

-------------------------------------------

         | he                                        | sum

再结合下述代码模拟一下过程：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
typedef long long LL;
#define MAX 2e14+10

LL x[50];
map<LL,int >mp;
int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k))
    {
        mp.clear();
        memset(x,0,sizeof(x));
        int pos=1;
        x[0]=1;
        if(k==-1)
        {
            x[1]=-1;
            pos=2;
        }
        else if(k!=1)
        {

            for(int i=1;x[i-1]<MAX;i++)
            {
                x[i]=x[i-1]*k;
                pos=i;
            }
        }
        mp[0]++;
        LL elem,sum=0,num=0;

        for(int i=1;i<=n;i++)
        {
            scanf("%I64d",&elem);
            sum+=elem;
            mp[sum]++;
            for(int j=0;j<pos;j++)
            {
                num+=mp[sum-x[j]];
            }
        }
        printf("%I64d\n",num);
    }
    return 0;
}