programming · project euler

Project Euler: Problem 30 – Digit fifth powers

Problem Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits: 1634 = 1^4 + 6^4 + 3^4 + 4^4 8208 = 8^4 + 2^4 + 0^4 + 8^4 9474 = 9^4 + 4^4 + 7^4 + 4^4 As 1 = 1^4 is not a sum… Continue reading Project Euler: Problem 30 – Digit fifth powers

programming · project euler

Project Euler: Problem 29 – Distinct powers

Problem Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5: 2^2=4, 2^3=8, 2^4=16, 2^5=32 3^2=9, 3^3=27, 3^4=81, 3^5=243 4^2=16, 4^3=64, 4^4=256, 4^5=1024 5^2=25, 5^3=125, 5^4=625, 5^5=3125 If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct… Continue reading Project Euler: Problem 29 – Distinct powers

programming · Types

Programming problem types

There are 16 types of programming problem are appearing in programming contest. They are listed below: 1. Dynamic Programming 2. Greedy 3. Complete Search 4. Flood Fill 5. Shortest Path 6. Recursive Search Techniques 7. Minimum Spanning Tree 8. Knapsack 9. Computational Geometry 10. Network Flow 11. Eulerian Path 12. Two-Dimensional Convex Hull 13. BigNums… Continue reading Programming problem types