Problem 1: 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.
可以用暴力法来解决,但是网上有人提供了一种巧妙的方法,就是利用等差数列求和。
能被3整除的数:3,6,9,……999
其和为(3+6+…+999)=3*(1+2+3…+333)
所以,能被5整除的数也是一样。所以在时间复杂度为O(1)就解决了这个问题。
int Multiple_3_and_5()
{
int num = 999;
int sum_3 = 3 * (1 + num / 3) * (num / 3) / 2;
int sum_5 = 5 * (1 + num / 5) * (num / 5) / 2;
int sum_15 = 15 * (1 + num / 15) * (num / 15) / 2;
int result = sum_3+sum_5-sum_15 ;
cout <<result <<endl;
return 0;
}