Codeforces #319(Div.2) A. Multiplication Table

A. Multiplication Table

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

input

10 5

output

2

input

6 12

output

4

input

5 13

output

0

可以看到x在每行最多出现一次，在x/i的地方，枚举i判断x%i==0和x/i<=n，更新答案。O(n)

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){int n, x;while (scanf("%d%d", &n, &x) != EOF){int ans = 0;for (int i = 1; i <= n; i++){if (!(x%i) && (x / i) <= n)ans++;}printf("%d\n", ans);}}