收获如下：
①今后出现bug首先检查是否很简单地因为开的数据类型太小了导致数据溢出（比如此题，buf开成int之后就WA了）
题目地址：点击打开链接 题目描述：The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.
输入：Input will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 ... nm where m is the number of integers in the set and n1 ... nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.
输出：For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.
样例输入： 2 3 5 7 15 6 4 10296 936 1287 792 1 样例输出： 105 10296 #include <iostream> using namespace std; long long LCM(long long a,long long b); int main(){ int n,m; long long buf[10000]; cin>>n; for (int index=0;index<n;index++){ //input cin>>m; for (int i=0;i<m;i++){ cin>>buf[i]; } //process for (int i=0;i<m-1;i++){ buf[i+1]=LCM(buf[i],buf[i+1]); } //output cout<<buf[m-1]<<endl; } return true; } long long LCM(long long a,long long b){ long long temp; long long pro; if (a<b){ temp=a; a=b; b=temp; } pro=a*b; while (a&&b){ temp=b; b=a%b; a=temp; } return pro/a; }