Simple solution Brute force
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Details\n Describe your approach to solving the problem. \n- Time taken\n75ms\nBeat
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Details\n<!-- Describe your approach to solving the problem. -->\n- Time taken\n75ms\nBeats 78.02%of users with Python3\n- Space taken\n16.26mb\nBeats 68.99%of users with Python3\n# Complexity\n- Time complexity:$$O(n)$$\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```\nclass Solution:\n    def sumOfSquares(self, nums: List[int]) -> int:\n        s,n=0,len(nums)\n        for i in range(n):\n            if n%(i+1)==0:\n                s=s+nums[i]**2\n        return s\n\n```
['Python3']