four-divisors

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code>, 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 <code>0</code>.

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

<pre>
Input: nums = [21,21]
Output: 64
</pre>

Example 3:

<pre>
Input: nums = [1,2,3,4,5]
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
</ul>

sumFourDivisors

Four Divisors

Array

Math

给你一个整数数组 <code>nums</code>，请你返回该数组中恰有四个因数的这些整数的各因数之和。如果数组中不存在满足题意的整数，则返回 <code>0</code> 。

&nbsp;

示例 1：

<pre>
输入：nums = [21,4,7]
输出：32
解释：
21 有 4 个因数：1, 3, 7, 21
4 有 3 个因数：1, 2, 4
7 有 2 个因数：1, 7
答案仅为 21 的所有因数的和。
</pre>

示例 2:

<pre>
输入: nums = [21,21]
输出: 64
</pre>

示例 3:

<pre>
输入: nums = [1,2,3,4,5]
输出: 0</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
</ul>