2778. Sum of Squares of Special Elements Easy

1/**
2 * [2778] Sum of Squares of Special Elements 
3 *
4 * You are given a 1-indexed integer array nums of length n.
5 * An element nums[i] of nums is called special if i divides n, i.e. n % i == 0.
6 * Return the sum of the squares of all special elements of nums.
7 *  
8 * <strong class="example">Example 1:
9 * 
10 * Input: nums = [1,2,3,4]
11 * Output: 21
12 * Explanation: There are exactly 3 special elements in nums: nums[1] since 1 divides 4, nums[2] since 2 divides 4, and nums[4] since 4 divides 4. 
13 * Hence, the sum of the squares of all special elements of nums is nums[1] * nums[1] + nums[2] * nums[2] + nums[4] * nums[4] = 1 * 1 + 2 * 2 + 4 * 4 = 21.  
14 * 
15 * <strong class="example">Example 2:
16 * 
17 * Input: nums = [2,7,1,19,18,3]
18 * Output: 63
19 * Explanation: There are exactly 4 special elements in nums: nums[1] since 1 divides 6, nums[2] since 2 divides 6, nums[3] since 3 divides 6, and nums[6] since 6 divides 6. 
20 * Hence, the sum of the squares of all special elements of nums is nums[1] * nums[1] + nums[2] * nums[2] + nums[3] * nums[3] + nums[6] * nums[6] = 2 * 2 + 7 * 7 + 1 * 1 + 3 * 3 = 63. 
21 * 
22 *  
23 * Constraints:
24 * 
25 * 	1 <= nums.length == n <= 50
26 * 	1 <= nums[i] <= 50
27 * 
28 */
29pub struct Solution {}
30
31// problem: https://leetcode.com/problems/sum-of-squares-of-special-elements/
32// discuss: https://leetcode.com/problems/sum-of-squares-of-special-elements/discuss/?currentPage=1&orderBy=most_votes&query=
33
34// submission codes start here
35
36impl Solution {
37    pub fn sum_of_squares(nums: Vec<i32>) -> i32 {
38        0
39    }
40}
41
42// submission codes end
43
44#[cfg(test)]
45mod tests {
46    use super::*;
47
48    #[test]
49    fn test_2778() {
50    }
51}
52