Kiritow
/
OJ-Problems-Source
mirror of https://github.com/Kiritow/OJ-Problems-Source
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Create 823.cpp

master
Kirigaya Kazuto 2018-06-24 14:26:33 +08:00 committed by GitHub
parent 4c793f2b8f
commit 454daecd5d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 72 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

72
LeetCode-CN/823.cpp Normal file
View File

@ -0,0 +1,72 @@
#include <algorithm>
#include <unordered_map>
const long long MOD = 1000000000 + 7;
class Solution {
public:
int numFactoredBinaryTrees(vector<int>& A) {
std::sort(A.begin(), A.end());
std::unordered_map<long long, long long> mp;
std::unordered_map<long long, long long>::iterator iter;
int n = A.size();
for (int i = 0; i < n; i++)
{
mp.insert(std::make_pair(A[i], 1));
}
for (int i = 0; i < n; i++)
{
long long target = A[i];
long long cnt = 1;
for (int j = 0; j <= i; j++)
{
long long now = A[j];
if (now*now > target) break;
if (target%now != 0) continue;
int another = target / now;
long long dp_now, dp_another;
//printf("now=%d, another=%d\n", now, another);
// If number is not in INPUT LIST, then it should be ZERO
if ((iter = mp.find(now)) != mp.end())
{
dp_now = iter->second;
}
else
{
dp_now = 0;
}
if ((iter = mp.find(another)) != mp.end())
{
dp_another = iter->second;
}
else
{
dp_another = 0;
}
if (now == another)
{
//printf("cnt= %d + %d*%d\n", cnt, dp_now, dp_another);
cnt = (cnt + dp_now * dp_another) % MOD;
}
else
{
//printf("cnt= %d + %d*%d*2\n", cnt, dp_now, dp_another);
cnt = (cnt + dp_now * dp_another * 2) % MOD;
}
}
//printf("mp[%d]=%d\n", target, cnt + 1);
mp[target] = cnt;
}
long long sum = 0;
for (iter = mp.begin(); iter != mp.end(); ++iter)
{
sum = (sum + iter->second) % MOD;
}
return sum;
}
};