1390. Four Divisors

/**
 * Problem: LeetCode 1390 - Four Divisors
 * Difficulty: Medium
 * Language: Java
 * Author: CodeByTushu
 */
class Solution {
    public int sumFourDivisors(int[] nums) {
        int totalSum = 0;

        for (int num : nums) {
            int count = 0;
            int sum = 0;

            for (int d = 1; d * d <= num; d++) {
                if (num % d == 0) {
                    if (d * d == num) {
                        count += 1;
                        sum += d;
                    } else {
                        count += 2;
                        sum += d + (num / d);
                    }
                    if (count > 4) {
                        break;
                    }
                }
            }

            if (count == 4) {
                totalSum += sum;
            }
        }

        return totalSum;
    }
}

"""
Problem: LeetCode 1390 - Four Divisors
Difficulty: Medium
Language: Python
Author: CodeByTushu
"""
from typing import List

class Solution:
    def sumFourDivisors(self, nums: List[int]) -> int:
        total_sum = 0

        for num in nums:
            count = 0
            curr_sum = 0
            d = 1
            while d * d <= num:
                if num % d == 0:
                    if d * d == num:
                        count += 1
                        curr_sum += d
                    else:
                        count += 2
                        curr_sum += d + (num // d)
                    if count > 4:
                        break
                d += 1

            if count == 4:
                total_sum += curr_sum

        return total_sum

/**
 * Problem: LeetCode 1390 - Four Divisors
 * Difficulty: Medium
 * Language: C++
 * Author: CodeByTushu
 */
#include <vector>

using namespace std;

class Solution {
public:
    int sumFourDivisors(vector<int>& nums) {
        int totalSum = 0;

        for (int num : nums) {
            int count = 0;
            int sum = 0;

            for (int d = 1; d * d <= num; ++d) {
                if (num % d == 0) {
                    if (d * d == num) {
                        count += 1;
                        sum += d;
                    } else {
                        count += 2;
                        sum += d + (num / d);
                    }
                    if (count > 4) {
                        break;
                    }
                }
            }

            if (count == 4) {
                totalSum += sum;
            }
        }

        return totalSum;
    }
};

/**
 * Problem: LeetCode 1390 - Four Divisors
 * Difficulty: Medium
 * Language: JavaScript
 * Author: CodeByTushu
 */
/**
 * @param {number[]} nums
 * @return {number}
 */
var sumFourDivisors = function(nums) {
    let totalSum = 0;

    for (const num of nums) {
        let count = 0;
        let sum = 0;

        for (let d = 1; d * d <= num; d++) {
            if (num % d === 0) {
                if (d * d === num) {
                    count += 1;
                    sum += d;
                } else {
                    count += 2;
                    sum += d + (num / d);
                }
                if (count > 4) {
                    break;
                }
            }
        }

        if (count === 4) {
            totalSum += sum;
        }
    }

    return totalSum;
};