Codeforces Round 319 (Div. 2)
翻译中…
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* ≤ 10^{5}$, $1 ≤ *x* ≤ 10^{9}$) — 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.
翻译中…
Note
翻译中…
A table for the second sample test is given below. The occurrences of number $12$ are marked bold.
翻译中…

翻译中…
样例
Input #1
10 5
Output #1
2
InputCopy
OutputCopy
Input #2
6 12
Output #2
4
InputCopy
OutputCopy
Input #3
5 13
Output #3
0
InputCopy
OutputCopy
题目信息
标签
模拟
数论
题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。