Project Euler #75: Singular integer right triangles Discussions | | HackerRank

Project Euler #75: Singular integer right triangles

  • + 0 comments

    the first step of my algorithm is to generate all the primitive triples and their multiples with perimeter less or equal 5*10^6 using Euclid's formula, and in first instance I assumed that m<=1200 was sufficient to generate al the triples (I've approximated n=m, so max perimeter was near 4*1200^2) but this way I was loosing some triangles generated by higher m...