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.
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.
Print a single number: the number of times x occurs in the table.
10 5
2
6 12
4
5 13
0
A table for the second sample test is given below. The occurrences of number 12 are marked bold.
给你n和x,问你n * n表格中有多少和x相等的数字。
遍历每一行,若存在和x相等的数字则x % i == 0 && x <= i * n
AC代码:
#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
const int MAXN = 1e5 + 5;
typedef long long ll;
ll n, x, ans;
int main(int argc, char const *argv[])
{
scanf("%I64d%I64d", &n, &x);
for(ll i = 1; i <= n; ++i)
if(x % i == 0 && x <= i * n) ans++;
printf("%I64d\n", ans);
return 0;
}