Codeforces - GCD Counting
题目链接：Codeforces - GCD Counting显然，做法很多。我就直接点分治暴力了。每次分治重心，然后对每个数，分解质因数。对重心的每个质因数都求一下答案，取max即可。AC代码：#pragma GCC optimize("-Ofast","-funroll-all-loops")#include<bits/stdc++.h>//#define int ...
