A. Pythagorean Theorem II

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 a, b and c, often called the Pythagorean equation:

a2 + b2 = c2

where c represents the length of the hypotenuse, and a and b represent the lengths of the other two sides.

Given n, your task is to count how many right-angled triangles with side-lengths a, b and c that satisfied an inequality 1 ≤ a ≤ b ≤ c ≤ n.

Input

The only line contains one integer n (1 ≤ n ≤ 104) as we mentioned above.

Output

Print a single integer — the answer to the problem.

Sample test(s)

input

5

output

1

input

74

output

35

解题说明：此题就是判断在n范围内有多少组数字能够构成直角三角形，穷举暴力即可

#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;

int main()
{
    int n,i,j,k,h=0;
    float d;
    scanf("%d",&n);
    for(i=1;i<n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			d=sqrt(i*i+j*j);
			if(d*d==(i*i+j*j)&& d<=n) 
			{	
				h++;
			}
		}
	}
    printf("%d\n",h);
    return 0;
}