https://leetcode.com/problems/count-the-number-of-good-subsequences/description/ 求[1,n]的所有数逆元在模p下的逆元， 用pow(n,p – 2,p)太慢了。所有用下面代码