blob: 7813f17a81c5059db3de7bc3156e39eacf72d896 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
#include "leetcode.h"
class Solution {
public:
int numFactoredBinaryTrees(vector<int> &arr) {
sort(arr.begin(), arr.end());
int n = arr.size();
long ans = 0;
unordered_map<int, long> um;
for (int num : arr) {
long ways = 1;
double lim = sqrt(num);
for (int i = 0, fA = arr[0]; fA <= lim; fA = arr[++i]) {
if (num % fA != 0)
continue;
int fB = num / fA;
if (um.find(fB) != um.end())
ways += um[fA] * um[fB] * (fA == fB ? 1 : 2);
}
um[num] = ways;
ans = (ans + ways) % 1000000007;
}
return (int)ans;
}
};
int main() {
Solution obj;
vector<int> arr = {2, 4};
cout << obj.numFactoredBinaryTrees(arr);
}
|