HDU 4961 Boring Sum(分解因子)
2014-08-19 22:44
323 查看
HDU 4961 Boring Sum
题目链接题意:先预处理出每个数字的因子,然后左右扫描一遍计算即可
代码:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 100005;
int n, num
, vis
, a
, b
;
vector<int> g
;
void init() {
for (int i = 1; i <= 100000; i++) {
int m = (int)sqrt(i * 1.0);
for (int j = 1; j <= m; j++) {
if (i % j) continue;
g[i].push_back(j);
if (i / j != j)
g[i].push_back(i / j);
}
}
}
int main() {
init();
while (~scanf("%d", &n) && n) {
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++) {
scanf("%d", &num[i]);
if (!vis[num[i]]) a[i] = num[i];
else a[i] = vis[num[i]];
for (int j = 0; j < g[num[i]].size(); j++)
vis[g[num[i]][j]] = num[i];
}
memset(vis, 0, sizeof(vis));
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (!vis[num[i]])
ans += (ll)a[i] * num[i];
else
ans += (ll)a[i] * vis[num[i]];
for (int j = 0; j < g[num[i]].size(); j++)
vis[g[num[i]][j]] = num[i];
}
printf("%I64d\n", ans);
}
return 0;
}
相关文章推荐
- HDU 4961 Boring Sum(哈希标记,暴力枚举)
- hdu 4961 Boring Sum(数学题)
- 组队赛3-B ,HDU 4961 Boring Sum(数学题)
- HDU 4961(杭电多校#9 1002题)Boring Sum(瞎搞)
- HDU 4961 Boring Sum(构造题)
- hdu 4961 Boring Sum (思维 哈希 扫描)
- hdu 4961 Boring Sum(数学题)
- hdu 4961 Boring Sum(高效)
- hdu 4961 Boring Sum(高效)
- hdu 4961 Boring Sum(2014 Multi-University Training Contest 9)
- HDU 1333 分解素数因子
- UVa 10791 Minimum Sum LCM(素因子分解)
- HDU 4344-Mark the Rope-大数素因子分解
- hdu 4961 因子
- uva 10791 - Minimum Sum LCM(分解因子)
- HDU 6069 Counting Divisors(唯一分解定理+因子数)
- HDU 4704 Sum (费马小定理+快速幂+整数和分解+欧拉降幂)
- HDU 4961 Boring Sum 因数分解
- HDU 3641 Treasure Hunting(阶乘素因子分解+二分)
- POJ1845 Sumdiv 费马小定理+欧拉函数+素因子分解