Sticks and Right Triangle

Question

Problem Description
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

Input
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).

Output
For each test case output a single integer in one line, indicating the number of right triangles.

Sample Input
1
5

Sample Output
1

Answer 1

以下回答参考 皆我百晓生、券券喵儿 等免费微信小程序相关内容作答，并由本人整理回复。

# 读取数据
input = readLines()

for(i in 1:length(input)){
    n = as.integer(input[i][1])
    l = as.integer(input[i][2])

    # 判断是否满足条件
    if(l < 4){
        print(0)
    }else{
        ans = 0
        for(x in 1:(l/3)){
            for(y in (x+1):(l/3)){
                for(z in (y+1):(l/3)){
                    if(x*y*z == l && x+y+z != l){
                        ans += 1
                    }
                }
            }
        }

        print(ans)
    }
}