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

#F2263. Matrix

    ID: 2269 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 4 上传者: 标签>组合数学数据结构模拟数学编程与模拟进阶难度共享题库Codeforces英文题面题目来源题面语言

Matrix

题目描述

A. Matrix
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You have a string of decimal digits s. Let's define bij=si·sj. Find in matrix b the number of such rectangles that the sum bij 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) (xy,zt). The elements of the rectangle are all cells (i,j) such that xiy,zjt.

Input

The first line contains integer a (0≤a≤109), 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 C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples
Input
10
12345
Output
6
Input
16
439873893693495623498263984765
Output
40

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