Preparando MOJI

Multiplication Table

1000ms 262144K

Description:

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.

Input:

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.

Output:

Print a single number: the number of times x occurs in the table.

Sample Input:

10 5

Sample Output:

2

Sample Input:

6 12

Sample Output:

4

Sample Input:

5 13

Sample Output:

0

Note:

A table for the second sample test is given below. The occurrences of number 12 are marked bold.

Informação

Codeforces

Provedor Codeforces

Código CF577A

Tags

implementationnumber theory

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:00:00

Relacionados

Nada ainda