CF304A.Pythagorean Theorem II

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:

In any right-angled triangle, the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares whose sides are the two legs (the two sides that meet at a right angle).

The theorem can be written as an equation relating the lengths of the sides aa , bb and cc , often called the Pythagorean equation:

a2+b2=c2a^{2}+b^{2}=c^{2} where cc represents the length of the hypotenuse, and aa and bb represent the lengths of the other two sides.

Given nn , your task is to count how many right-angled triangles with side-lengths aa , bb and cc that satisfied an inequality 1<=a<=b<=c<=n1<=a<=b<=c<=n .

输入格式

The only line contains one integer n (1<=n<=104)n (1<=n<=10^{4}) as we mentioned above.

输出格式

Print a single integer — the answer to the problem.

输入输出样例

  • 输入#1

    5
    

    输出#1

    1
    
  • 输入#2

    74
    

    输出#2

    35
    
首页