• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1901_2000.s1925_count_square_sum_triples.readme.md Maven / Gradle / Ivy

1925\. Count Square Sum Triples

Easy

A **square triple** `(a,b,c)` is a triple where `a`, `b`, and `c` are **integers** and a2 + b2 = c2.

Given an integer `n`, return _the number of **square triples** such that_ `1 <= a, b, c <= n`.

**Example 1:**

**Input:** n = 5

**Output:** 2

**Explanation:** The square triples are (3,4,5) and (4,3,5).

**Example 2:**

**Input:** n = 10

**Output:** 4

**Explanation:** The square triples are (3,4,5), (4,3,5), (6,8,10), and (8,6,10).

**Constraints:**

*   `1 <= n <= 250`