考虑推广sum(i in Z){mu^2(i)}的做法. #include"roundCount.cpp" #include<cstdio> #include<vector> #include<cstring> #include<algorithm> #include<primesieve.hpp> namespace GPG{ typedef long long ll; typedef bool B; namespace G…