# ---
# title: 1390. Four Divisors
# id: problem1390
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Math
# link: <https://leetcode.com/problems/four-divisors/description/>
# hidden: true
# ---
# 
# Given an integer array `nums`, return the sum of divisors of the integers in
# that array that have exactly four divisors.
# 
# If there is no such integer in the array, return `0`.
# 
# 
# 
# **Example 1:**
# 
#     
#     
#     Input: nums = [21,4,7]
#     Output: 32
#     Explanation:
#     21 has 4 divisors: 1, 3, 7, 21
#     4 has 3 divisors: 1, 2, 4
#     7 has 2 divisors: 1, 7
#     The answer is the sum of divisors of 21 only.
#     
# 
# 
# 
# **Constraints:**
# 
#   * `1 <= nums.length <= 10^4`
#   * `1 <= nums[i] <= 10^5`
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
