← 返回题目

题库练习 Nastya and a Game

← 上一题下一题 →

A11796 | $Nastya and a Game$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Nastya received one more array on her birthday, this array can be used to play a traditional Byteland game on it. However, to play the game the players should first select such a subsegment of the array that ![](/uploads/acgo/image/67db2fe0b312913d_47b229d32621.jpeg), where $p$ is the product of all integers on the given array, $s$ is their sum, and $k$ is a given constant for all subsegments. Nastya wonders how many subsegments of the array fit the described conditions. A subsegment of an array is several consecutive integers of the array.

输入格式

The first line contains two integers $n$ and $k$ ( $1<=n<=2·10^{5}$ , $1<=k<=10^{5}$ ), where $n$ is the length of the array and $k$ is the constant described above. The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=10^{8}$ ) — the elements of the array.

输出格式

In the only line print the number of subsegments such that the ratio between the product and the sum on them is equal to $k$ .

输入输出样例

输入 #1

1 1
1

输出 #1

输入 #2

4 2
6 3 8 1

输出 #2

C++ 编辑器

输入

输出