问题描述:
Write a function to find the largest triangle that can be inscribed in an ellipse.

测试用例:
['assert largest_triangle(4,2)==10.392304845413264', 'assert largest_triangle(5,7)==4.639421805988064', 'assert largest_triangle(9,1)==105.2220865598093']

生成的代码:
import math

def largest_triangle(a, b):
    return (3 * math.sqrt(3) / 4) * a * b