codeforces 577A(暴力枚举)

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

Note

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

为了避免暴力超时，看看是否可以用一个循环为遍历每一行或者每一列，若x%i==0，有x/=i;如果x<=n,则ans++;

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll __int64
#define eps 1e8
using namespace std;
int n;
int main()
{
    ll n,m,i,j,k,x;
    while(~scanf("%lld%lld",&n,&x))
    {
        ll ans=0;
        for(i=1;i<=n;i++)
            if(x%i==0&&(x/i)<=n)
                ans++;
        printf("%lld\n",ans);
    }
    return 0;
}