3243：Clever Y

题目描述

Little Y finds there is a very interesting formula in mathematics:

X^Y mod Z = K

Given X, Y, Z, we all know how to figure out K fast. However, given X, Z, K, could you figure out Y fast?

输入解释

Input data consists of no more than 20 test cases. For each test case, there would be only one line containing 3 integers X, Z, K (0 ≤ X, Z, K ≤ 10⁹).
Input file ends with 3 zeros separated by spaces.

输出解释

For each test case output one line. Write "No Solution" (without quotes) if you cannot find a feasible Y (0 ≤ Y < Z). Otherwise output the minimum Y you find.

输入样例

5 58 33
2 4 3
0 0 0

输出样例

9
No Solution

该题目是Virtual Judge题目，来自北京大学POJ

题目来源 POJ Monthly--2007.07.08, Guo, Huayang

源链接： POJ-3243

最后修改于 2020-10-29T06:56:41+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
5000	65536