You are given a 111-indexed integer array nums of length n.
nums
n
An element nums[i] is considered special if i divides n evenly, meaning n % i == 0.
nums[i]
i
n % i == 0
Return the sum of the squares of all special elements in nums.
Constraints:
1≤1 \leq1≤ nums.length === n ...
nums.length