Amicable numbers
2016-03-05 19:03
447 查看
https://projecteuler.net/problem=21
Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
def sumAmicable():
result = 0
#保存已经计算的数据
ddict = {}
for i in range(2,10000):
if i not in ddict:
ddict[i] = d(i)
#对应的值小于i的时候,就不算了,因为我们是从小到大计算过来的
if ddict[i] > i:
if ddict[i] not in ddict:
ddict[ddict[i]] = d(ddict[i])
if ddict[ddict[i]] == i:
result += (ddict[i] + i)
return result
import math
def d(n):
factor = [1]
temp = int(math.sqrt(n))
for i in range(2,temp +1):
if n % i == 0:
factor.append(i)
factor.append(n/i)
if temp ** 2 == n:
return sum(factor) - temp
return sum(factor)
print(sumAmicable())
Amicable numbers
Problem 21
Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
def sumAmicable():
result = 0
#保存已经计算的数据
ddict = {}
for i in range(2,10000):
if i not in ddict:
ddict[i] = d(i)
#对应的值小于i的时候,就不算了,因为我们是从小到大计算过来的
if ddict[i] > i:
if ddict[i] not in ddict:
ddict[ddict[i]] = d(ddict[i])
if ddict[ddict[i]] == i:
result += (ddict[i] + i)
return result
import math
def d(n):
factor = [1]
temp = int(math.sqrt(n))
for i in range(2,temp +1):
if n % i == 0:
factor.append(i)
factor.append(n/i)
if temp ** 2 == n:
return sum(factor) - temp
return sum(factor)
print(sumAmicable())
相关文章推荐
- php实现一个单链表
- poj 3061 Subsequence (尺取法)
- 理解Android之ThreadLocal
- spring mvc 中controller是非线程安全的
- hdu 1166 敌兵布阵 (线段树、树状数组模板,单点更新)
- Spring框架学习(四)
- Android:Paint的setMaskFilter(MaskFilter maskfilter)
- TOEFL(20151220)分析
- C头文件
- 视频监控/存储系统设计要点
- 软件过程与项目管理(第一周作业)
- OpenCV2411 数据类型
- iOS URLencode加号变空格
- python 调用 shell 命令方法
- 语音识别的步骤总结
- Win10预览版14279多国语言包官方下载地址汇总:32/64位俱全
- QT OpenCV2.4.11 .pro文件内容
- iOS第三方库的一些总结
- Python批量重命名
- Html5 postMessage实现跨域消息传递