A14266 | The Number of Pairs
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given three positive (greater than zero) integers $c$ , $d$ and $x$ .
You have to find the number of pairs of positive integers $(a, b)$ such that equality $c \cdot lcm(a, b) - d \cdot gcd(a, b) = x$ holds. Where $lcm(a, b)$ is the least common multiple of $a$ and $b$ and $gcd(a, b)$ is the greatest common divisor of $a$ and $b$ .
You have to find the number of pairs of positive integers $(a, b)$ such that equality $c \cdot lcm(a, b) - d \cdot gcd(a, b) = x$ holds. Where $lcm(a, b)$ is the least common multiple of $a$ and $b$ and $gcd(a, b)$ is the greatest common divisor of $a$ and $b$ .
输入格式
The first line contains one integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.
Each test case consists of one line containing three integer $c$ , $d$ and $x$ ( $1 \le c, d, x \le 10^7$ ).
Each test case consists of one line containing three integer $c$ , $d$ and $x$ ( $1 \le c, d, x \le 10^7$ ).
输出格式
For each test case, print one integer — the number of pairs ( $a, b$ ) such that the above equality holds.
输入输出样例
输入 #1
4 1 1 3 4 2 6 3 3 7 2 7 25
输出 #1
4 3 0 8
In the first example, the correct pairs are: ( $1, 4$ ), ( $4,1$ ), ( $3, 6$ ), ( $6, 3$ ).
In the second example, the correct pairs are: ( $1, 2$ ), ( $2, 1$ ), ( $3, 3$ ).
In the second example, the correct pairs are: ( $1, 2$ ), ( $2, 1$ ), ( $3, 3$ ).
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted