PPT PPH
C_K_Yang czp001 liuguangxi Min_25 C3PO Philippe_57721 gerrob mathpseudo sinan hervas Caesum Buri nielkh
Public  07/04/14  8xp  Programming  58.3% 
Consider the primitive Phytagorean triangles with an hypotenuse equal to a Pythagorean prime (i.e. a prime of the form 4*n+1).
How many such triangles are there if their hypotenuses are between 10^19 and 10^19+10^6?
Input format: count,sum of the smallest sides
Example: 11,248 for such triangles with hypotenuses in the range [1,100]
[My timing: <8s]
How many such triangles are there if their hypotenuses are between 10^19 and 10^19+10^6?
Input format: count,sum of the smallest sides
Example: 11,248 for such triangles with hypotenuses in the range [1,100]
[My timing: <8s]
New Members
 JMR03 1d:19h
 MrSexysPizza 3d:3h
 N3W70N 3d:7h
 cod3bluezer0 4d:13h
 cduruk 1w:2d
Fresh Problems

Segments 1d:11h
solved by 5 
Plowing the field 3d:9h
solved by 11 
Mertens Equations 1w:3d
solved by 9 
Vampire Numbers 2w:3d
solved by 11 
Convex numbers 2w:6d
solved by 4