山东理工ACM 1603 Least Common Multiple

http://acm.sdut.edu.cn/judgeonline/showproblem?problem_id=1603

#include<iostream>
using namespace std;
int multiple(long a,long b)
{//最小公倍数函数
    int c,p,q;
p=a;
q=b;    //a,b不用交换也行；
while(c=a%b)
{

  a=b;
  b=c;
}
return p/b*q;   //b为最大公约数
}
int main()
{   long n,i,m,j,k,a[1000];
cin>>n;
for(i=1;i<=n;i++)
{
  cin>>m;
  for(j=1;j<=m;j++)
  cin>>a[j];
  for(k=m-1;k>=1;k--)
  {
    a[k]=multiple(a[k],a[k+1]);

  }   //从后向前对a【k】a【k+1】求最小公倍数赋给a【k】；
   cout<<a[1]<<endl;

}
return 0;
}

山东理工ACM 1603 Least Common Multiple相关推荐

山东理工ACM【2105】小泉的难题
小泉的难题 Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述机械实验班有个同学叫小泉,有一天数学老师给小泉布置了一道个人作业,给小 ...
Lowest Common Multiple Plus ——ACM
1. Lowest Common Multiple Plus 求n个数的最小公倍数. Input 输入包含多个测试实例,每个测试实例的开始是一个正整数n,然后是n个正整数.为每组测试数据输出它们的最小 ...
HDU 4913 Least common multiple
/* hdu4913 Least common multiple http://acm.hdu.edu.cn/showproblem.php?pid=4913 离散化线段树统计逆序数思想 tips ...
杭电2028--Lowest Common Multiple Plus
Lowest Common Multiple Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (J ...
hdoj-2028-Lowest common multiple plus
题目:Lowest common multiple plus 代码: #include<stdio.h> int common(int a,int b)//计算最大公约数 {int c=a ...
HDOJ-1019 Least Common Multiple
Problem Description The least common multiple (LCM) of a set of positive integers is the smallest po ...
HDU2028 Lowest Common Multiple Plus【GCD+LCM】
Lowest Common Multiple Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java ...
HDU2028 Lowest Common Multiple Plus【入门】
Lowest Common Multiple Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (J ...
Least Common Multiple
下面为学长大家公认的水题, 我比水题还睡的 WA 了三遍才成功在好队友的帮助下,A 了杭电HDU Least Common Multiple Problem Description The ...
问题 A: Least Common Multiple
题目描述 The least common multiple (LCM) of a set of positive integers is the smallest positive integer ...

山东理工ACM 1603 Least Common Multiple

山东理工ACM 1603 Least Common Multiple相关推荐

最新文章

热门文章