2020牛客多校第七场--H--Dividing

题意： 找出知足条件的点对的数量 知足的条件是html (1, k) is always a Legend Tuple, where k is an integer. if (n, k) is a Legend Tuple, (n + k, k) is also a Legend Tuple. if (n, k) is a Legend Tuple, (nk, k) is also a Legen

>>阅读原文<<