[模板]乘法逆元
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 a[i]=(-i/p*a[i%p]%p+p)%p
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 ex_gcd(i,p,x,y); 2 x=(x%p+p)%p
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 inv[i]=pow(i,p-2,p)%p;
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 for(int i=1;i<=n;++i){ 2 fac[i]=fac[i-1]*i%p; 3 invv[i]=(-p/i*invv[p%i]%p+p)%p; 4 inv[i]=inv[i-1]*invv[i]%p; 5 }
$Fate \ is \ Fake$
1 a[i]=(-i/p*a[i%p]%p+p)%p
1 ex_gcd(i,p,x,y); 2 x=(x%p+p)%p
1 inv[i]=pow(i,p-2,p)%p;
1 for(int i=1;i<=n;++i){ 2 fac[i]=fac[i-1]*i%p; 3 invv[i]=(-p/i*invv[p%i]%p+p)%p; 4 inv[i]=inv[i-1]*invv[i]%p; 5 }