哪里跟扩展欧几里得搭上边了么啊
用C的话得用大数,java好一点
分数求最小公倍数 = 分子的最小公倍数/分母的最大公约数
import java.math.*;
import java.util.*;public class Main
{
public static void main(String args[])
{
BigInteger a, b, c, up = null, down = null;
int n = 0, cnt;
Scanner cin = new Scanner(System.in);
int t[] = new int [1005];
int ls[] = new int [1005];
while(cin.hasNext())
{
cnt = 1;
n = cin.nextInt();
for( int i = 0; i < n; i++)
t[i] = cin.nextInt();
Arrays.sort(t,0, n);
ls[0] = t[0];
for( int i = 1; i < n ;i++)
if(t[i] != t[i-1]) ls[cnt++] = t[i];
for( int i = 1; i < cnt; i++)
{
a = BigInteger.valueOf(ls[i]*ls[0]);
b = BigInteger.valueOf((ls[i] - ls[0])*2);
BigInteger g = a.gcd(b);
a = a.divide(g);
b = b.divide(g);
if( i == 1)
{
up = a;
down = b;
}
else
{
up = up.multiply(a).divide(up.gcd(a));
down = down.gcd(b);
}
}
System.out.println(up +" "+ down);
}
cin.close();
}
}