当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3939：Sticks and Right Triangle

题目描述
We have a stick with infinite length. Now we want to cut 3 sub-sticks with length x, y, z which is not large than L to form a right triangle. With unknown reasons we assume that x, y, z are all integers and satisfy that x, y, z are all co-primed each other. We want to know how many right triangles are there exist under our constraints
输入解释
The first line of input is an integer T (T<=5) indicating the number of test cases.
Each case contains a single integer L (L<=1,000,000,000,000).
输出解释
For each test case output a single integer in one line, indicating the number of right triangles.
输入样例 
1
5
输出样例 
1
提示
In our test case, we could find a right triangle (3,4,5) which satisfy 3,4,5<=5 and gcd(3,4)=1,gcd(3,5)=1,gcd(4,5)=1.
来自杭电HDUOJ的附加信息
Recommend
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2011 Multi-University Training Contest 10 - Host by HRBEU
源链接： HDU-3939
最后修改于 2020-10-25T23:08:29+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
12000/4000MS(Java/Others) 65535/65536K(Java/Others)