模pow(x,t)下多项式求逆

题意：A(x) is known, A(x)*B(x)=1( mod pow(x,t) ),calculate B(x) ?
解法：先求t=[t/2]时的解为B0(x)，然后经过数学处理可得到B(x)和B0(x)的关系。
详见博客http://picks.logdown.com/posts/189620-inverse-element-of-polynomial

const int mo = 1e9+7;
const int maxn = 100000+10;
int qpow(int a,int b,int mo){
    int ans=1;
    while(b){