104090A

GYM104090A Modulo Ruins the Legend - exgcd -

题目链接:https://codeforces.com/gym/104090/problem/A 题解: 转化一下发现只需要求满足下式的解: \[ns+\dfrac{n\times (n+1)}{2}d \equiv C(\bmod m) \]设 \(a=n,b=\dfrac{n(n+1)}{2}, ......
104090A 104090 Modulo Legend Ruins
共1篇  :1/1页 首页上一页1下一页尾页