“Pythagoras, One More Time” 三元组是指所有满足 $x^2 + y^2 = z^2 - 7$ 的解，其中 $x, y, z$ 为不超过 $n$ 的正整数。
你需要计算满足 $x \le y \le z$ 的三元组 $(x, y, z)$ 的数量。
第一行包含一个整数 $T$ ($1 \le T \le 10000$)，表示测试用例的总数。
对于每个测试用例，输入一行包含一个整数 $n$ ($1 \le n \le 10^8$)。
对于每个测试用例，输出一行，包含三元组的总数。
10 1 2 3 4 5 6 7 8 9 10
0 0 1 1 2 3 3 3 4 4
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: