codeforces 577A Multiplication Table

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.

题目大意：给出两个数n和m，根据n可以建一张n × n的表格，表格的第一行从左到右是1～n，第一列从上到下是1～n，其余的格子等于他所对应的第一行第一列的数的乘积。然后问这张表格中有多少个m。

解题思路：1～n遍历一遍，看看有多少个数可以被m整出，并且商小于n。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
using namespace std;

typedef long long ll;

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    if (n == 1) {
        if (m == 1) printf("1\n");  
        else printf("0\n");
        return 0;
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        if (m % i == 0 && m / i <= n) {
            ans++;
        }
    }
    printf("%d\n", ans);
    return 0;
}