You do not have permission to edit this page, for the following reason:
You can view and copy the source of this page.
Templates used on this page:
Return to Pythagorean Triplet.
Pythagorean triplet $(a,b,c)$ satisfies: $$a + b = c$$ You will be given an integer N. You have to count how many triplets a,b,c exist such that $$1 <= a <= b <= c <= N.$$
Input: First line contains T, the number of test cases. Each test case consists of only one integer in one line.
Output: For each test case, print the required answer.
Constraints: $$1 <= T <= 100 \\ 1 <= N <= 10^6$$
Complexity: $O (n)$ <syntaxhighlight lang="c" name="triplet">
</syntaxhighlight>
GATECSE