Project Euler 1

'''
Created on 2014年8月20日
problem1 : Multiples of 3 and 5
    If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
    Find the sum of all the multiples of 3 or 5 below 1000.
@author: wxp2971
'''

# 最直接的方式，当数值比较大的时候，计算时间比较长，考虑递推公式
def calcSum1(targetNum, numA, numB):
    sum1 = 0
    for i in range(targetNum):
        if (i%numA == 0) or (i%numB == 0):
            sum1 += i
    return sum1
    
#　递推公式方法，等差数列求和
def SumDivisibleBy(x, targetNum):
    targetNum -= 1
    retSum =(x + int(targetNum/x)*x) *  int(targetNum/x)/2   # 求和公式　sum = (a_0 + a_n)*n/2
    return int(retSum)

def calcSum2(targetNum, numA, numB):
    sum = SumDivisibleBy(numA,targetNum) + SumDivisibleBy(numB,targetNum) - SumDivisibleBy(numA*numB,targetNum)
    return sum

#　测试运行时间
import time
for num in range(10000,100000,10000):
    starttime1 = time.clock()
    targetNum = num; numA= 3; numB = 5
    sum1 = calcSum1(targetNum, numA, numB)
    endtime1 = time.clock() 
    print (sum1,endtime1-starttime1) 
    starttime1 = time.clock()
    targetNum = num; numA= 3; numB = 5
    sum2 = calcSum2(targetNum, numA, numB)
    endtime1 = time.clock() 
    print (sum2,endtime1-starttime1) 

10000 23331668 0.0024419999999999997
10000 23331668 1.4000000000000123e-05
20000 93316668 0.005533000000000003
20000 93316668 1.2999999999999123e-05
30000 209985000 0.008
30000 209985000 1.0000000000003062e-05
40000 373326668 0.011091999999999998
40000 373326668 1.7000000000003124e-05
50000 583291668 0.01212400000000001
50000 583291668 1.1999999999998123e-05
60000 839970000 0.016543000000000002
60000 839970000 1.1999999999998123e-05
70000 1143321668 0.017314999999999997
70000 1143321668 2.6999999999999247e-05
80000 1493266668 0.020576999999999998
80000 1493266668 2.3999999999996247e-05
90000 1889955000 0.02545800000000001
90000 1889955000 1.6999999999989246e-05