18 Dec · Robert Eisele
Project Euler Solution #9: Special Pythagorean triplet
Deprecated: strip_tags(): Passing null to parameter #1 ($string) of type string is deprecated in /www/raw.org/view/.c/en/overview.tpl on line 201
Project Euler
Competitive programming is a focused way to sharpen algorithmic thinking. These are worked solutions — not shortcuts, but walkthroughs of the ideas, trade-offs, and optimizations that lead to efficient answers.
Contents
- Project Euler Solution #1: Multiples of 3 and 5
- Project Euler Solution #2: Even Fibonacci numbers
- Project Euler Solution #3: Largest prime factor
- Project Euler Solution #4: Largest palindrome product
- Project Euler Solution #5: Smallest multiple
- Project Euler Solution #6: Sum square difference
- Project Euler Solution #7: 10001st prime
- Project Euler Solution #8: Largest product in a series
- Project Euler Solution #9: Special Pythagorean triplet
- Project Euler Solution #10: Summation of primes
- Project Euler Solution #11: Largest product in a grid
- Project Euler Solution #12: Highly divisible triangular number
- Project Euler Solution #13: Large sum
- Project Euler Solution #14: Longest Collatz sequence
- Project Euler Solution #15: Lattice paths
- Project Euler Solution #16: Power digit sum
- Project Euler Solution #17: Number letter counts
- Project Euler Solution #18: Maximum path sum I
- Project Euler Solution #19: Counting Sundays
- Project Euler Solution #20: Factorial digit sum
- Project Euler Solution #21: Amicable numbers
- Project Euler Solution #22: Names scores
- Project Euler Solution #23: Non-abundant sums
- Project Euler Solution #24: Lexicographic permutations
- Project Euler Solution #25: 1000-digit Fibonacci number
- Project Euler Solution #26: Reciprocal cycles
- Project Euler Solution #27: Quadratic primes
- Project Euler Solution #28: Number spiral diagonals
- Project Euler Solution #29: Distinct powers
- Project Euler Solution #30: Digit fifth powers
- Project Euler Solution #31: Coin sums
- Project Euler Solution #32: Pandigital products
- Project Euler Solution #33: Digit cancelling fractions
- Project Euler Solution #34: Digit factorials
- Project Euler Solution #35: Circular primes
- Project Euler Solution #36: Double-base palindromes
- Project Euler Solution #37: Truncatable primes
- Project Euler Solution #38: Pandigital multiples
- Project Euler Solution #39: Integer right triangles
- Project Euler Solution #40: Champernowne's constant
- Project Euler Solution #41: Pandigital prime
- Project Euler Solution #42: Coded triangle numbers
- Project Euler Solution #43: Sub-string divisibility
- Project Euler Solution #44: Pentagon numbers
- Project Euler Solution #45: Triangular, pentagonal, and hexagonal
- Project Euler Solution #46: Goldbach's other conjecture
- Project Euler Solution #47: Distinct primes factors
- Project Euler Solution #48: Self powers
- Project Euler Solution #49: Prime permutations
- Project Euler Solution #50: Consecutive prime sum
- Project Euler Solution #52: Permuted multiples
- Project Euler Solution #55: Lychrel numbers
- Project Euler Solution #56: Powerful digit sum
- Project Euler Solution #57: Square root convergents
- Project Euler Solution #58: Spiral primes
- Project Euler Solution #59: XOR decryption
- Project Euler Solution #62: Cubic permutations
- Project Euler Solution #63: Powerful digit counts
- Project Euler Solution #64: Odd period square roots
- Project Euler Solution #67: Maximum path sum II
- Project Euler Solution #69: Totient maximum
- Project Euler Solution #71: Ordered fractions
- Project Euler Solution #72: Counting fractions
- Project Euler Solution #81: Path sum: two ways
- Project Euler Solution #92: Square digit chains
- Project Euler Solution #107: Minimal network