Python (Simple Hashmap + Prefix Sum)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def sumOfFlooredPairs(self, nums):\n        ans, dict1, mod = [0]*(max(nums)+1), collections.Counter(nums), 10**9 + 7\n\n        for num in dict1:\n            for j in range(num,len(ans),num):\n                ans[j] += dict1[num]\n\n        res = [ans[0]]\n\n        for i in ans[1:]:\n            res.append(res[-1] + i)\n\n        return sum([res[i] for i in nums])%mod\n\n\n\n\n\n        \n\n        \n```
['Python3']