最小公倍数

Lowest Common Multiple Plus

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34922    Accepted Submission(s): 14246

Problem Description

求n个数的最小公倍数。

 

Input

输入包含多个测试实例，每个测试实例的开始是一个正整数n，然后是n个正整数。

 

Output

为每组测试数据输出它们的最小公倍数，每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。

 

Sample Input

  
  

   
   2 4 6
3 2 5 7
  
  

 

Sample Output

  
  

   
   12
70
  
  

 

#include<cstdio>
#include<cmath>
#include<string.h>
#include<iostream>
using namespace std;
int find(int x,int y)
{  int z,X,Y;
   X = x; Y = y;
   if(x < y){int t = x; x = y; y=t;}
   z = y;    
   while(z){
      z = x % y;
      x = y;
      y = z;         
   }
   return X*(Y/x);    
}
int main()
{  
     int n,k,m;
     while(scanf("%d",&n)!=EOF){
          scanf("%d",&k);
          for(int i=1; i < n; i++){
               scanf("%d",&m);
               k = find(k,m);
          }
          printf("%d\n",k);                         
     }   
     return 0;    
}