Lowest Common Multiple Plus
Total Submission(s): 54570 Accepted Submission(s): 22595
2 4 6 3 2 5 7
12 70
#include <stdio.h>
int GCD(long long int n,long long int m)
{
if (m <= n)
if (n%m == 0)
return(m);
else
return (GCD(m, n%m));
else
return(GCD(m, n));
}
int main()
{
int n, i;
long long int a[100] = { 0 }, k = 0, s = 1;
while (scanf("%d", &n) != EOF)
{
for (i = 0;i<n;i++)
scanf("%lld", &a[i]);
s = 1;
for (i = 0;i < n;i++)
{
k = GCD(s, a[i]);
if (k == 1)
s = s*a[i];
else
s = s*(a[i] / k);
}
printf("%lld\n", s);
}
}
412



被折叠的 条评论
为什么被折叠?



