cf--#729--div2

B. Plus and Multiply

time limit per test3 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
There is an infinite set generated as follows:

1 is in this set.
If x is in this set, x⋅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⋅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⋅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≤t≤105) — 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≤n,a,b≤109) 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.

Example
input
5
24 3 5
10 3 6
2345 1 4
19260817 394 485
19260817 233 264
output
Yes
No
Yes
No
Yes
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.

算法：math + 思维
时间复杂度：logn
设m = a ^ k.
我们可以用(n - m) % b 来判断是否可以，因为 +b 并不会影响 %b 的值，只有 *a 可以产生新的 %b 的值，所以要设m = a ^ k

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
	int T;
	cin >> T;
	
	while(T --)
	{
		int n,a,b;
		scanf("%d%d%d",&n, &a, &b);
		
		// 这里要特判，不然会超时，不过我也有点蒙，为什么这里不判会超时 
		if(a == 1)
		{
			if((n -1) % b == 0)
				puts("Yes");
			else 
				puts("No");
			continue;
		} 
		
		bool flag = false;
		long long m = 1;
		while(m <= n)
		{
			if((n - m) % b == 0)
			{
				flag = true;
				break;
			}
			
			m *= a;
		}
		
		if(flag)
			puts("Yes");
		else
			puts("No");
	}
	
	return 0;
}