Problem 5
Smallest multiple
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
最小公倍数
2520是最小的能够被1到10整除的数。
最小的能够被1到20整除的正数是多少?
/********************* Program 1 *************************
* 思路:
* 1.求出所有 1 到 最大因数 之间的每两个数的最小公倍数
* 2.以此类推
* 3.求最小公倍数:
* 两个数的乘积等于这两个数的最大公约数与最小公倍数的积
* 4.求最大公因数:辗转相除法
* 收获:
* 1.1. 判断质数的方法
* 1.2. 辗转相除法求最大公因数
* 1.3. 两个数的乘积等于这两个数的最大公约数与最小公倍数的积
* 评价:
* 优点:
* 1.效率较高;
* 缺点:
* 1.创建的局部变量较多
* 2.暂时没能找到更高效的算法
************************************************************/
#define _CRT_SECURE_NO_WARNINGS
#define THE_BIGGEST_FACTOR 10
#include <stdio.h>
/*---------------------------------------------------------*/
//求 num1st 和 num2nd 的最大公因数
// num1st 的取值范围;1~4294967295
// num2nd 的取值范围;1~4294967295
unsigned int GetGreatestCommonFactor(unsigned int num1st, unsigned int num2nd)
{
unsigned int tmp = 1;
if (num1st < num2nd)
{
tmp = num1st;
num1st = num2nd;
num2nd = tmp;
}
while (tmp = num1st % num2nd)// 收获1.2
{
num1st = num2nd;
num2nd = tmp;
}
return num2nd;
}
//求 num1st 和 num2nd 的最小公倍数
// num1st 的取值范围;1~4294967295
// num2nd 的取值范围;1~4294967295
unsigned int GetLeastCommonMultiple(unsigned int num1st, unsigned int num2nd)
{
unsigned int greastCommonFactor = GetGreatestCommonFactor(num1st, num2nd);
return num1st * num2nd / greastCommonFactor;// 收获1.3
}
int main()
{
unsigned int ret = 1;
for (unsigned int i = 1; i <= THE_BIGGEST_FACTOR; i++)
ret = GetLeastCommonMultiple(ret, i);
printf("答案是:%d\n", ret);
return 0;
}
/*------------------ not so successful ---------------------*/
//判断 num 是否是质数
// num 的取值范围是;1~4294967295
//返回值:
// 1 :num 是质数
// 0 :num 是合数
#include <math.h>
unsigned int CheckPrimeNumber(unsigned int num)// 收获1.1
{
unsigned int flag = 2;
unsigned int upperLimit = (unsigned int)sqrt((double)num);
for (int i = 2; i <= upperLimit; i++, flag++)
if (!(num % i))
break;
if (flag > upperLimit)
return 1;
else
return 0;
}