[摘要] 求2个二进制数的GCDjava大数位压import java.math.*;import java.util.*;import java.io.*;public class Main { public BigInteger GCD(BigInteger x, BigInteger y) {[全文]
[摘要] 题意:给定n个点的树,m个操作树有点权和边权下面n-1行给出树边下面m行操作 :● ADD1 u v k: for nodes on the path from u to v, the value of these nodes increase by k.● ADD2 u v ...[全文]