跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0877. Molly's Chemicals

    ID: 883 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 5 上传者: 标签>二分枚举数据结构模拟数学算法思想编程与模拟进阶难度共享题库Codeforces英文题面题目来源题面语言

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 (-109ai≤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].


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 308 题。保留原作者与原赛事署名。