| 229 | } |
| 230 | |
| 231 | std::vector<int> factors(int m) { |
| 232 | std::vector<int> result; |
| 233 | for (int i = 2; (ll)(i)*i <= m; i++) { |
| 234 | if (m % i == 0) { |
| 235 | result.push_back(i); |
| 236 | while (m % i == 0) { |
| 237 | m /= i; |
| 238 | } |
| 239 | } |
| 240 | } |
| 241 | if (m > 1) result.push_back(m); |
| 242 | return result; |
| 243 | } |
| 244 | |
| 245 | bool is_primitive_root(int m, int g) { |
| 246 | assert(1 <= g && g < m); |
no outgoing calls
no test coverage detected