Codeforces Round 846 (Div. 2) E. Josuke and Complete Graph 详解 数论分块
题目大意题意来源解题思路首先我们假设存在xxx满足a,b∈[l,r],gcd(a,b)=xa,b\in[l,r],gcd(a,b)=xa,b∈[l,r],gcd(a,b)=x那么肯定gcd(⌊a/x⌋,⌊b/x⌋)=1就是互质gcd(\lfloora/x\rfloor,\lfloorb/x\rfloor)=1就是互质gcd(⌊a/x⌋,⌊b/x⌋)=1就是互质假设a#include#include