Easy task and the solution is the same C#
\n# Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n
\n# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public int SumOfSquares(int[] nums) {\n        int sum = 0;\n        for(int i = 0; i < nums.Length; i++)\n        {\n            if(nums.Length % (i + 1) == 0)\n            {\n                sum += nums[i] * nums[i];\n            }\n        }\n        return sum;\n    }\n}\n```\n![89f26eaf70fa927a79d4793441425859.jpg](https://assets.leetcode.com/users/images/6eee75c4-e34d-44d7-9c9a-14866c6b5b92_1715159065.8169217.jpeg)\n
['C#']