by mike_a7y8v5a2 | Jan 21, 2019 | Uncategorized

Some short/fast solutions to CodeChef January Long Challenge 2019 Div 2 Problem name: Fancy Quotes (FANCY) for _ in xrange(input()): print “Real Fancy” if “not” in raw_input().split() else “regularly fancy” Problem name: Lucky...
by mike_a7y8v5a2 | Dec 3, 2018 | Project Euler

Project Euler 1 Problem Statement If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. Solution Obvious solution This can be...
by mike_a7y8v5a2 | Nov 2, 2018 | Project Euler

Project Euler 2 Problem Statement Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … Find the sum of all the even-valued terms in the...
by mike_a7y8v5a2 | Nov 5, 2018 | Project Euler

Project Euler 3 Problem Statement The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? Solution This problem is solved without using arrays or a giant list of prime numbers. Instead, we generate prospective...
by mike_a7y8v5a2 | Nov 21, 2018 | Project Euler

Project Euler 4 Problem Statement A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers. Solution We can quickly...
by mike_a7y8v5a2 | Dec 4, 2018 | Project Euler

Project Euler 5 Problem Statement 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest number that is evenly divisible by all of the numbers from 1 to 20? Solution Euclid’s algorithm The...
by mike_a7y8v5a2 | Nov 1, 2018 | Project Euler

Project Euler 16 Problem Statement The sum of the squares of the first ten natural numbers is 1² + 2² + … + 10² = 385. The square of the sum of the first ten natural numbers is (1 + 2 + … + 10)² = 55² = 3025. Hence the difference between the sum of the...
by mike_a7y8v5a2 | Dec 10, 2018 | Project Euler

Project Euler 7 Problem Statement Originally published on blog.dreamshire.com, M. Molony, MAY 12, 2009. By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number? Solution This solution will...
by mike_a7y8v5a2 | Nov 3, 2018 | Project Euler

Project Euler 8 Problem Statement The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832. 73167176531330624919225119674426574742355349194934699893520312774506326239578318016984… Find the greatest product of 13...
by mike_a7y8v5a2 | Nov 22, 2018 | Project Euler

Project Euler 9 Problem Statement A Pythagorean triplet is a set of three natural numbers, a ≤ b < c, for which, For example, . There exists exactly one Pythagorean triplet for which a + b + c = 1000.Find the product abc. Solution A Pythagorean triple consists...