ZOJ-2095
2014-03-14 23:14
405 查看
因子分解,直接暴力枚举了,时间不是很理想,水过去了
#include<stdio.h> #include<math.h> int factor_sum(int num) { if (num == 1) return 0; int i, sum = 1, n = (int) sqrt(num); for (i = 2; i <= n; i++) if (num % i == 0) { int div = num / i; sum = i != div ? sum + i + div : sum + i; } return sum; } int main() { int n; scanf("%d", &n); while (n--) { int num; scanf("%d", &num); printf("%d\n", factor_sum(num)); } return 0; }
相关文章推荐
- zoj 2095 Divisor Summation
- ZOJ 2095 Divisor Summation
- zoj 2095 Divisor Summation
- ZOJ 2095和HDU1215(打表)(优化)
- zoj 2095 Divisor Summation
- zoj 2095 求一个数除数的和
- ZOJ 2095 Divisor Summation
- ZOJ 2095 数论,因子之和
- zoj 1733 Common Subsequence
- ZOJ 3336 Friend Number II
- ZOJ 3841 Cards (组合数+乘法逆元)
- ZOJ - 3593 One Person Game (扩展欧几里得 技巧)@
- zoj 1484 Minimum Inversion Number
- zoj 1076 Gene Assembly
- ZOJ 2319 Beatuiful People
- ZOJ - 3953 Intervals(贪心)
- zoj 1789 The Suspects
- ZOJ-2554
- ZOJ - 1733 Common Subsequence
- ACM刷题之ZOJ————May Day Holiday