(Created page with "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.$$ ''...")
(No difference)

Revision as of 18:22, 23 July 2014

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$$

Extra space can reduce time complexity

Complexity: $O (n)$ <syntaxhighlight lang="c" name="triplet">


</syntaxhighlight>




blog comments powered by Disqus

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$$

Extra space can reduce time complexity[edit]

Complexity: $O (n)$ <syntaxhighlight lang="c" name="triplet">


</syntaxhighlight>




blog comments powered by Disqus