AlphaWA的博客

网络上有很多讲解，不再赘述。此处记载此题题解以供复习之用。#include<cstdio> #include<iostream> #include<cstdlib> #include<cmath> #include<set> #include<algorithm> using namespace std; typedef l...

题目：Fermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not very man...