输入还是有点问题.因为要有许多组测试.

今天是星期六,给出参考代码.
least common multiple

#include<iostream.h>
#include<stdio.h>
#define N 1000

long mul(long m,long n)
{ long t=0,m1,n1;
long Rem;
m1=m;
n1=n;
if(m<n)
{ t=m;
m=n;
n=t;
}
while(n>0)
{ Rem = m % n;
m = n;
n = Rem;
}
t=m1/m;
t=t*n1;
return(t);
}

int main()
{
int i,n,num;
long max,a[N];
scanf("%d",&n);
while(n>0)
{
scanf("%d",&num);
max=0;
for(i=0;i<num;i++)
scanf("%ld",&a[i]);
for(i=0;i<num-1;i++)
a[i+1]=mul(a[i],a[i+1]);
max=a[num-1];
printf("%ld\n",max);
n--;
}
return(0);
}

Digital Roots

#include<stdio.h>
#include<string.h>
#define N 1000
int qiusum(int num)
{
int sum=0;
while(num)
{
sum=sum+num%10;
num=num/10;
}
return(sum);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen ("Digital Roots.txt","r",stdin);
#endif
int i,n,len;
char data[N];
while(EOF!=(scanf("%s",data))&&strcmp(data,"0")!=0)
{
n=0;
len=strlen(data);
for(i=0;i<len;i++)
n=n+(data[i]-'0');
while(n>9)
n=qiusum(n);
printf("%d\n",n);
}
return(0);
}

2 //先输入测试数据的组数
3 5 7 15
6 4 10296 936 1287 792 1

E文的题目而已.