| 43 | } |
| 44 | |
| 45 | TEST(MathTest, PowMod) { |
| 46 | auto naive = [&](ll x, ll n, int mod) { |
| 47 | ll y = internal::safe_mod(x, mod); |
| 48 | ull z = 1 % mod; |
| 49 | for (ll i = 0; i < n; i++) { |
| 50 | z = (z * y) % mod; |
| 51 | } |
| 52 | return z; |
| 53 | }; |
| 54 | for (int a = -100; a <= 100; a++) { |
| 55 | for (int b = 0; b <= 100; b++) { |
| 56 | for (int c = 1; c <= 100; c++) { |
| 57 | ASSERT_EQ(naive(a, b, c), pow_mod(a, b, c)); |
| 58 | } |
| 59 | } |
| 60 | } |
| 61 | } |
| 62 | |
| 63 | TEST(MathTest, InvBoundHand) { |
| 64 | const ll minll = std::numeric_limits<ll>::min(); |