qq_44797733的博客

LCS stands for longest common subsequence, and it is a well known problem. A sequence in this problemmeans a list of integers, and a sequence X is considered a subsequence of another sequence Y, when thesequence X can be obtained by deleting zero or more e

扩展欧几里得算法： 1.扩展欧几里得算法可以求逆元 2.扩展欧几里得算法可以求类似ax+by=m,的所有整数解，当m%gcd(a,b)==0则ax+by=m有无线多个解，否则无解 扩展欧几里得的基础式 ax+by=gcd(a,b) 下面会用到这个式子 下面我会给出这个基础式的模板 扩展欧几里得算法求逆元： 刚开始值知道这个算法可以求解逆元， 逆元的定义：ax1(mod b) （注意gcd(a,b)==1的时候才能保证a的逆元是x）ax%b=1ax-by=1（是不是和上面...