Find Right-Triangle Triples

Find every triple of positive integers a < b < c for which a² + b² = c² and a + b + c = perimeter. Return each triple as [a, b, c], ordered by increasing a and then b. Do not include permutations of the same sides.

Implement pythagorean_triplets(perimeter).

Input

perimeter: The required sum of all three sides.

Output

Return a list of triples in the specified order.

Contraintes

3 ≤ perimeter ≤ 100,000. Return an empty list if no triangle qualifies.

Exemples

Entrée :
perimeter = 30

Sortie attendue :
expected = [
    [5, 12, 13]
]

Entrée :
long long perimeter = 30;

Sortie attendue :
std::vector<std::vector<long long>> expected = {
    {5, 12, 13}
};

Entrée :
long perimeter = 30;

Sortie attendue :
long[][] expected = new long[][] {
    new long[] {5, 12, 13}
};

Entrée :
perimeter = 11

Sortie attendue :
expected = []

Entrée :
long long perimeter = 11;

Sortie attendue :
std::vector<std::vector<long long>> expected = {};

Entrée :
long perimeter = 11;

Sortie attendue :
long[][] expected = new long[][] {};

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Pythagorean Triplet