3123127_ac_4180ms_5408k.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;
import java.math.*;

public class Main
{
	static class Fraction
	{
		BigInteger numerator;
		BigInteger denominator;
	}
	public static void main(String [] args)
	{
		Scanner cin = new Scanner (System.in);
		int n, i, m;
		Integer [] T = new Integer [1001];
		Integer [] D = new Integer [1001];

		n = cin.nextInt();
		for(i = 0; i < n; i++)
		{
			T[i] = cin.nextInt();
		}
		Arrays.sort(T,0,n);
		m = 0;
		for(i = 0; i < n; i++)
		{
			D[m] = T[i];
			while(i < n&&D[m]==T[i])
				i++;
			i--;
			m++;
		}
		Fraction [] f = new Fraction [1001];
		m--;
		for(i = 0; i < m; i++)
		{
			f[i] = new Fraction();
			f[i].numerator = BigInteger.valueOf(D[i]*D[i+1]);
			f[i].denominator = BigInteger.valueOf((D[i+1]-D[i])*2);
			BigInteger gcd = f[i].numerator.gcd(f[i].denominator);
			f[i].numerator = f[i].numerator.divide(gcd);
			f[i].denominator = f[i].denominator.divide(gcd);
		}
		for(i = 1; i < m; i++)
		{
			f[0].denominator = f[0].denominator.gcd(f[i].denominator);
			f[0].numerator = f[0].numerator.multiply(f[i].numerator).divide(f[0].numerator.gcd(f[i].numerator));
		}
		BigInteger gcd = f[0].numerator.gcd(f[0].denominator);
		f[0].numerator = f[0].numerator.divide(gcd);
		f[0].denominator = f[0].denominator.divide(gcd);
		System.out.println(f[0].numerator+" "+f[0].denominator);
	}
}