<PREV Problem:

NEXT>

Solved by 64 users: ...

The smallest solutions The fastest solutions The best scored solutions The smallest solutions User Date Attempt Time CM SC mishik 12 oct 2007 C++ 24 00.60 231   mishik 13 apr 2008 C++ 27 00.57 235   DAV 10 mar 2010 C++ 20 00.13 240   DAV 10 mar 2010 C++ 19 00.12 250   DAV 10 mar 2010 C++ 18 00.10 252   velomeloman 14 dec 2008 C++ 8 00.40 255   checkil 17 dec 2008 C++ 1 00.39 258   velomeloman 14 dec 2008 C++ 9 00.40 258   velomeloman 13 dec 2008 C++ 7 00.40 260   lutyj 23 jan 2008 C++ 2 00.75 260   gchebanov 22 oct 2012 C++ 2 00.06 262   mishik 10 oct 2007 C++ 12 00.52 263   mishik 10 oct 2007 C++ 11 00.48 274   pmnox 05 feb 2009 C++ 3 00.68 274   VladimirChelnokov 14 sep 2007 C++ 3 01.34 295   VladimirChelnokov 14 sep 2007 C++ 2 01.23 301   arti 11 feb 2008 C++ 4 00.79 310   VladimirChelnokov 14 sep 2007 C++ 8 00.96 312   gchebanov 23 oct 2012 C++ 3 00.05 319   zmy 10 dec 2007 C++ 1 00.95 321   VladimirChelnokov 14 sep 2007 C++ 6 00.95 321   Languages C++ 46 Kylix 12 Java 3 C 3 FPC 1

<   <   <   <   <   <   <   <   <   <

Pythagorean triples

Time limit = 2 second(s)

A Pythagorean triple consists of three positive integers a, b, and c, such that a²+b²=c². Your program should calculate N-th Pythagorean triple, considering triples to be sorted in ascending order (lexicographically by c, a, b). Triples (a, b, c) and (b, a, c) are considered to be different.

Input: Single integer number N. 0 < N < 1000000.

Output: Three integers delimited with spaces: a, b, c.

Input#1 1

Output#1 3 4 5

Input#2 3

Output#2 6 8 10

Author:
Statement by Artem Voroztsov, solution, checker & tests by Dmitriy Polischuk
15 September 2007

<PREV | Problem set | Search related messages | NEXT>