#19693. 2^x mod n = 1
2^x mod n = 1
说明
给你一个正整数n,要求你找到最小的x(x>0)满足2^x mod n = 1。输入格式
输入包含多组测试数据。每行一个正整数,代表n的值。输出格式
如果最小的x存在,则输出2^x mod n = 1(注意x和n要用具体的值代替),否则输出2^? mod n = 1。2
52^? mod 2 = 1
2^4 mod 5 = 1
2
52^? mod 2 = 1
2^4 mod 5 = 1
By signing up a 算道OJ universal account, you can submit code and join discussions in all online judging services provided by us.