Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

我的怎么怎么WA掉,帮忙看看PRO3002

Posted by 109121ouyang at 2009-04-06 15:05:20 and last updated at 2009-04-06 15:08:28
	#include<iostream>
    #include<math.h>
	using namespace std;
	int getw(int a,int b)//两个数的最大公约数
	{
		int temp,r;
		if(a<b)
		{
			temp=a;
			a=b;
			b=temp;
		}
		while(b)
		{
		   r=a%b;
		   a=b;
		   b=r;
		}
		return a;
	}
	int getm(int m,int *a)//多个数求最大公约数;
	{
		int *b,i;
		b=new int[m-1];
		if(m>2){
		b[0]=getw(a[0],a[1]);
		for(i=1;i<m-1;i++)
			b[i]=a[i+1];
		return getm(m-1,b);
		}
		else
			return getw(a[0],a[1]);
		delete []b;
	}
   long	 work(int m,int *a)//求多个数的最小公倍数
		{
		  int  *b;   
		  b=new int[m-1];   
		  if(m>2)   
		  {   
		  b[0]=a[0]*a[1]/getw(a[0],a[1]);   
		  for(int i=1;i<m-1;i++)   
		  {   
			 b[i]=a[i+1];   
		  }   
		  return   work(m-1,b);   
		  }   
		  else  return a[0]*a[1]/getw(a[0],a[1]); 
		  delete []b;
    

	}

	int main()
	{
		int a[10];
		int i,j;
	    long number,sum=1;
	
     	for(i=0;i<9;i++)
		{
	     	sum=sum*10;
		}
			int n,m;//n是机器数m是该机器的轮子数;
				cin>>n;
				for(i=0;i<n;i++)
				{
					cin>>m;
					for(j=0;j<m;j++)
					{
					   cin>>a[j];
					}
					getm(m,a);
					number=work(m,a);
					if(number<sum)
						cout<<number<<endl;
					else 
						cout<<"More than a billion."<<endl;
							}

			
		return 0;
	}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator