08 2023 档案
摘要:[大佬的讲解](https://blog.csdn.net/qq_34181160/article/details/113448738) [视频讲解](https://www.bilibili.com/video/BV1ce411u7qP/?spm_id_from=333.337.search-ca
阅读全文
摘要:```cpp long long ksm(long long X){ long long sum=1; int N=mod-2; while(N){ if(N&1) sum=sum*X%mod; X=X*X%mod; N/=2; } return sum; } ``` 这就是快速幂的板子,因为要求逆
阅读全文