#include <stdio.h>
long gcd(long a,long b)
{long r;
 while(b)
 {r=a%b;
  a=b;
  b=r;
 }
 return a;
}
int main()
{long n,i,j,cal;
 long temp;
 while(n)
 {scanf("%ld",&n);
  cal=0;
  for(i=1;i<n;i++)
	for(j=i+1;j<=n;j++)
	{temp=gcd(i,j);
	 if(temp==1) cal++;
	}
  if(n==0) break;
  if(n) printf("%ld\n",cal);
  
 }
  return 1;
}

• O(n^2logn),必挂了 (408) frkstyc 2005-07-14 13:44:33
• 输入的问题 (375) xfxyjwf 2005-07-14 13:49:07
• 考虑算法吧! (408) ook 2005-07-14 18:42:29