[CF1478] Codeforces Round #698 (Div. 2)
Codeforces Round #698 (Div. 2) Problems # Name A ...
Codeforces Round #698 (Div. 2) Problems # Name A ...
裴蜀定理: 定义: 若 \(a,b\) 不全为零,则存在 \(x,y\) ,使得 \(ax+by=gcd(a,b)\) 证明: 记住就行了,证明太长了不想写了..... 例题: CF510 ...