2028.cpp

ACM 威士忌部分答案

/*
2028 Lowest Common Multiple Plus
Time Limit : 1000 ms  Memory Limit : 32768 K  Output Limit : 256 K

GUN C++
*/
#include <iostream>
using namespace std;


/************最小公倍数***************/
long  LCM(long  num1,long  num2)
{
    long int a,b,temp;
    if(num1>0 && num2>0)
    {
        if(num1<num2)/*交换两个数，使大数放在num1上*/
        {
            temp=num1;
            num1=num2;
            num2=temp;
        }
        a=num1;b=num2;
        while(b!=0)/*利用辗除法，直到b为0为止*/
        {
            temp=a%b;
            a=b;
            b=temp;
        }
        num1/=a;
        return num1*num2;
    }
    else
    {   return 0;}
}

int main()
{
    int t,n1,n2,ca;
    while(cin>>t)
    {
        cin>>n1;
        for(ca=1;ca<t;ca++)
        {
            cin>>n2;
            n1=LCM(n1,n2);
        }
        cout<<n1<<endl;
    }
    return 0;
}