CF364A.Matrix
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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) (x<=y,z<=t) . The elements of the rectangle are all cells (i,j) such that x<=i<=y,z<=j<=t .
输入格式
The first line contains integer a ( 0<=a<=109 ), the second line contains a string of decimal integers s ( 1<=∣s∣<=4000 ).
输出格式
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.
输入输出样例
输入#1
10 12345
输出#1
6
输入#2
16 439873893693495623498263984765
输出#2
40