【codeforces 776C】Molly's Chemicals 题解_dev-c++ c.molly's chemicals-CSDN博客

本文链接：https://blog.csdn.net/rosekc/article/details/57086046

博客介绍了如何利用前缀和解决codeforces上的776C问题，即求解在给定化学物质序列中，能够通过连续子序列和得到非负整数幂次k的段的数量。博主分享了解题思路，包括问题转化、避免效率低下的查找方法，以及处理特殊情况的技巧。

摘要由CSDN通过智能技术生成

【codeforces 776C】Molly’s Chemicals 题解

题目

题目链接：http://codeforces.com/problemset/problem/776/C

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 a_i.

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 ≤ 10⁵, 1 ≤ |k| ≤ 10).

Next line contains n integers a₁, a₂, …, a_n ( - 10⁹ ≤ a_i ≤ 10⁹) — 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 k⁰ = 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].