题目链接:http://acm.ustc.edu.cn/ustcoj/problem.php?id=1385
根据素因子分解定律知,任何一个数都可以分解成有限个素数幂的乘积;因而,求最小公倍数就转换成素因子分解,接着只要使用大数乘法算出答案即可(好吧,我承认我不太会写大数乘法,希望热心的网友指导一下):
我的代码如下:
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
int prime[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; //100以内的素数(共25个)
int pow1[] = {1, 10, 100, 1000, 10000, 100000, 1000000};
int mark[25] = {0};
int maxIndex[25] = {0};
int result[50] = {0};
void bigNumMul(int i)
{
for (int k = 0; k < 50; k++)
result[k] *= maxIndex[i];
for (int k = 0; k < 50; k++)
{
if (result[k] / 10 != 0)
{
result[k+1] += result[k] / 10;
result[k] %= 10;
}
}
}
void getResult(void)
{
result[0] = 1;
for (int i = 0; i < 25; i++)
if (maxIndex[i] != 0)
bigNumMul(i);int sign = 0;
for (int j = 49; j >= 0; j--)
if (result[j] != 0)
{
sign = j;
break;
}for (int j = sign; j >= 0; j--)
printf("%d", result[j]);
printf("\n");
}
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
memset(mark, 0, sizeof(int) * 25);
memset(maxIndex, 0, sizeof(int) * 25);
memset(result, 0, sizeof(int) * 50);for (int i = 2; i <= n; i++)
{
int x = i;
memset(mark, 0, sizeof(int) * 25);
for (int j = 0; prime[j] <= x;)
{
if (x % prime[j] == 0)
{
mark[j]++;
x /= prime[j];
}
else
j++;
}for (int j = 0; j < 25; j++)
if (mark[j] > maxIndex[j])
maxIndex[j] = mark[j];
}for (int i = 0; i < 25; i++)
if (maxIndex[i] != 0)
{
int temp = maxIndex[i];
maxIndex[i] = (int)pow((double)prime[i], temp);
}getResult();
}
return 0;
}