直接上AC代码 #include<bits/stdc++.h> using namespace std; #define int long long const int mod=10007; int qp(int a,int b){//快速幂板子 int res=1; while(b){ if(b%2)res=res*a%mod; a=a*a%mod;b>>=1; } return res; } int a,b,k,n,m; int inv[10010],c=1; signed main(){ in...