Simple and very easy solution || O(n) || runtime:1ms || beats:100%
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    public int sumOfSquares(int[] nums) {\n        int sum = 0;\n        int n = nums.length;\n        for(int i = 0;i<nums.length;i++){\n            if(n% (i+1) == 0){\n                sum+=nums[i]*nums[i];\n            }\n        }\n        return sum;\n        \n    }\n}\n```
['Java']