HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Geometry > problem:


50362 - Pythagorean Numbers

Guest
• Discussion of problem (2)

Section problems

• 50263 - Points
• 50268 - Triangles
• 50663 - Lights
• 50670 - Picture
• 51041 - Plane Segmentation
• 50422 - Area and Perimeter of diffe...
• 50473 - Counting Circles Positions
• 50327 - Parallel Lines
• 50362 - Pythagorean Numbers
• 50328 - How far away
• 50397 - The Number of Points in a ...
• 50399 - Mobile Base Station
• 50487 - Radius of Inscribed Circle
• 50480 - What quadrant is it?
• 50825 - Drawing Polygon
• 50508 - The Biggest Area
• 50854 - Area of Triangle Revised

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Prepared by Ibrahim Mesecan. Difficulty Beta

Pythagorean Number Triples

Write a program that is going to show the number of Pythagorean Number Triples that are less than or equal to the given number n.
For example if n=20 then the Pythagorean Number Triples are:
  5 3 4
  10 6 8
  13 5 12
  15 9 12
  17 8 15
  20 12 16
giving the result 6.
Note: After counting (5 3 4), (5 4 3) is not count because essantially they are the same triples.

Input specification
You will be given an integer number (n) where 1 ≤ n ≤ 1000

Output specification
Show the number of Pythagorean Number Triples.

Sample Input I
  20
Sample Input II
  100
Sample Output I
  6
Sample Output II
  52


Для отправки решений необходимо выполнить вход.

www.contester.ru