Codeforces Round 729 (Div. 2)
B
Plus and Multiply
Codeforces
1500
原题
← AC →
翻译中…

There is an infinite set generated as follows:

翻译中…
  • $1$ is in this set.
  • If $x$ is in this set, $x \cdot a$ and $x+b$ both are in this set.
翻译中…

For example, when $a=3$ and $b=6$, the five smallest elements of the set are:

翻译中…
  • $1$,
  • $3$ ($1$ is in this set, so $1\cdot a=3$ is in this set),
  • $7$ ($1$ is in this set, so $1+b=7$ is in this set),
  • $9$ ($3$ is in this set, so $3\cdot a=9$ is in this set),
  • $13$ ($7$ is in this set, so $7+b=13$ is in this set).
翻译中…

Given positive integers $a$, $b$, $n$, determine if $n$ is in this set.

翻译中…

Input

翻译中…

The input consists of multiple test cases. The first line contains an integer $t$ ($1\leq t\leq 10^5$) — the number of test cases. The description of the test cases follows.

翻译中…

The only line describing each test case contains three integers $n$, $a$, $b$ ($1\leq n,a,b\leq 10^9$) separated by a single space.

翻译中…

Output

翻译中…

For each test case, print "Yes" if $n$ is in this set, and "No" otherwise. You can print each letter in any case.

翻译中…

Note

翻译中…

In the first test case, $24$ is generated as follows:

翻译中…
  • $1$ is in this set, so $3$ and $6$ are in this set;
  • $3$ is in this set, so $9$ and $8$ are in this set;
  • $8$ is in this set, so $24$ and $13$ are in this set.
翻译中…

Thus we can see $24$ is in this set.

翻译中…

The five smallest elements of the set in the second test case is described in statements. We can see that $10$ isn't among them.

翻译中…

样例

Input #1
5
24 3 5
10 3 6
2345 1 4
19260817 394 485
19260817 233 264
Output #1
Yes
No
Yes
No
Yes
InputCopy OutputCopy
题目信息
题号
1542B
时间限制
3 s
内存限制
512 MB
标签
构造
数学
数论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。