[PYTHON] | ALGORITHM
\nRuntime: 3561 ms, faster than 73.68% of Python3 online submissions for Sum of Floored Pairs.\nMemory Usage: 32.6 MB, less than 56.84% of Python3 online submis
\nRuntime: **3561 ms, faster than 73.68%** of Python3 online submissions for Sum of Floored Pairs.\nMemory Usage: **32.6 MB, less than 56.84%** of Python3 online submissions for Sum of Floored Pairs.\n```\n\nclass Solution:\n    def sumOfFlooredPairs(self, n: List[int]) -> int:\n        f, m, c = Counter(n), max(n), [0]*(max(n)+1)\n        for k in f:\n            d, r = f[k], 1\n            while r*k <= m: c[r*k] += d; r += 1\n        r, j = 0, 0\n        for i in range(m+1):\n            r += c[i]\n            if i in f: j += f[i]*r\n        return j%(10**9+7)\n\t\t\n```\n**BTW: THIS IS NOT MY COMPLETE IDEA, I MADE `@satendrapandey`\'s VERSION A BIT FASTER**
['Python', 'Python3']