Codeforces Round 213 (Div. 2)
C
Matrix
Codeforces
未评级
原题
← BD →
翻译中…

You have a string of decimal digits $*s*$. Let's define $*b*_{*ij*} = *s*_{*i*}·*s*_{*j*}$. Find in matrix $*b*$ the number of such rectangles that the sum $*b*_{*ij*}$ for all cells $(*i*, *j*)$ that are the elements of the rectangle equals $*a*$ in each rectangle.

翻译中…

A rectangle in a matrix is a group of four integers $(*x*, *y*, *z*, *t*)$ $(*x* ≤ *y*, *z* ≤ *t*)$. The elements of the rectangle are all cells $(*i*, *j*)$ such that $*x* ≤ *i* ≤ *y*, *z* ≤ *j* ≤ *t*$.

翻译中…

Input

翻译中…

The first line contains integer $*a*$ ($0 ≤ *a* ≤ 10^{9}$), the second line contains a string of decimal integers $*s*$ ($1 ≤ |*s*| ≤ 4000$).

翻译中…

Output

翻译中…

Print a single integer — the answer to a problem.

翻译中…

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

翻译中…

样例

Input #1
10
12345
Output #1
6
InputCopy OutputCopy
Input #2
16
439873893693495623498263984765
Output #2
40
InputCopy OutputCopy
题目信息
题号
365C
时间限制
1 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。