A14141 | Floor and Mod
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
A pair of positive integers $(a,b)$ is called special if $\lfloor \frac{a}{b} \rfloor = a \bmod b$ . Here, $\lfloor \frac{a}{b} \rfloor$ is the result of the integer division between $a$ and $b$ , while $a \bmod b$ is its remainder.
You are given two integers $x$ and $y$ . Find the number of special pairs $(a,b)$ such that $1\leq a \leq x$ and $1 \leq b \leq y$ .
You are given two integers $x$ and $y$ . Find the number of special pairs $(a,b)$ such that $1\leq a \leq x$ and $1 \leq b \leq y$ .
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 100$ ) — the number of test cases.
The only line of the description of each test case contains two integers $x$ , $y$ ( $1 \le x,y \le 10^9$ ).
The only line of the description of each test case contains two integers $x$ , $y$ ( $1 \le x,y \le 10^9$ ).
输出格式
For each test case print the answer on a single line.
输入输出样例
输入 #1
9 3 4 2 100 4 3 50 3 12 4 69 420 12345 6789 123456 789 12345678 9
输出 #1
1 0 2 3 5 141 53384 160909 36
In the first test case, the only special pair is $(3, 2)$ .
In the second test case, there are no special pairs.
In the third test case, there are two special pairs: $(3, 2)$ and $(4, 3)$ .
In the second test case, there are no special pairs.
In the third test case, there are two special pairs: $(3, 2)$ and $(4, 3)$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted