> #include<stdio.h>
> long f(long m,long n)
> {
> 	if(m==n)return m;
> 	else if(m>n)return f(m-n,n);
> 	else return f(m,n-m);
> 
> }
> main()
> {
> 	long b[1006],temp=1,x,y,te,s=1;
> 	int n,i,t,a[1006],c[1006],j=1;
> 	scanf("%d",&n);
> 	for(i=0;i<1004;i++)
> 	   c[i]=0;
> 	for(i=1;i<=n;i++)
> 		scanf("%d",&a[i]);		
> 	for(i=1;i<=n;i++)
> 	{
> 		if(c[i]==0)
> 		{
> 			t=a[i];c[i]=1;
> 		    while(i!=t)
> 			{c[t]=1;t=a[t];s=s+1;}
> 			b[j]=s;j++;s=1;
> 		}
> 	}
> 	for(i=2;i<j;i++)
> 	{
> 		x=b[i-1];y=b[i];te=x*y;
> 		temp=f(x,y);
> 		if(temp>0)
> 		  b[i]=te/temp;
> 	}
> 	printf("%ld",b[i-1]);
> }

• 偶也记住了，多谢xfxyjwf大牛 (0) Sempr 2006-05-03 08:41:03
• Re:求GCD时栈溢出,推荐使用int Gcd(int a, int b){ return a == 0 ? b : Gcd(b % a, a); } (13) b412860771 2006-05-03 13:10:21
• Re:求GCD时栈溢出,推荐使用int Gcd(int a, int b){ return a == 0 ? b : Gcd(b % a, a); } (27) KosonLau 2007-04-19 02:35:15