Go simple solution
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: $$O((m+n)*logm)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npackage main\n\nimport "sort"\n\nfunc successfulPairs(spells []int, potions []int, success int64) []int {\n\tsort.Ints(potions)\n\tres := []int{}\n\tfor i := 0; i < len(spells); i++ {\n\t\tl, r := 0, len(potions)-1\n\t\tfor l <= r {\n\t\t\tm := l + (r-l)/2\n\t\t\tif int64(spells[i]*potions[m]) < success {\n\t\t\t\tl = m + 1\n\t\t\t} else {\n\t\t\t\tr = m - 1\n\t\t\t}\n\t\t}\n\t\tres = append(res, len(potions)-l)\n\t}\n\treturn res\n}\n\n```
['Go']