Codeforces 776C-Molly's Chemicals

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个数，和一个数k，现在问你有多少个区间和等于k的x次方，x从0到无穷

解题思路：先求出前缀和，也就是求有多少个sum[r]-sum[l]=pow(k,x)，r>l。x最大只有lg(1e14)，可以将式子变为sum[r]-pow(k,x)=sum[l]。每次结束后将前缀和放到map里

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
const LL INF=1e14;

int n;
LL k,sum[100050];
map<LL,LL>x;
set<LL>a;
set<LL>::iterator it;

int main()
{
    while(~scanf("%d %lld",&n,&k))
    {
        x.clear();
        a.clear();
        sum[0]=0;
        for(int i=1;i<=n;i++) scanf("%lld",&sum[i]),sum[i]+=sum[i-1];
        a.insert(1);
        LL temp=k;
        for(int i=1;i<=60;i++)
        {
            if(temp>INF) break;
            a.insert(temp);
            temp*=k;
        }
        LL ans=0;
        x[0]=1;
        for(int i=1;i<=n;i++)
        {
            for(it=a.begin();it!=a.end();it++) ans+=x[sum[i]-*it];
            x[sum[i]]++;
        }
        printf("%lld\n",ans);
    }
    return 0;
}