Let's consider a table consisting of n rows and n columns. The cell located at the intersection of i-th row and j-th column contains number i × j. The rows and columns are numbered starting from 1.
You are given a positive integer x. Your task is to count the number of cells in a table that contain number x.
The single line contains numbers n and x (1 ≤ n ≤ 105, 1 ≤ x ≤ 109) — the size of the table and the number that we are looking for in the table.
Print a single number: the number of times x occurs in the table.
10 5
2
6 12
4
5 13
0
A table for the second sample test is given below. The occurrences of number 12 are marked bold.
题目大意：给出一个$n\times n$的矩阵A，满足$A_{i,j}=i\times j$。求一个数x在矩阵A中出现的次数。
从1到n，若它能整除x且商不超过n，答案就递增。
代码在此。
评论 (0)
