Tag: dynamic programming
-
Hey there! I’ve committed a new class on JenPop, and it’s called “Individual”. It was made to represent the rules of typical genetic algorithms: a genetic representation of the solution domain; a fitness function to evaluate the solution domain. I’ve read a bit more on the subject and figured that genetic algorithms, although being able to achieve good solutions…
-
Hello again! This one is one hell of a tricky problem. No wonder it’s called “Numbers”: In this problem, you have to find the last three digits before the decimal point for the number (3 + √5)n. For example, when n = 5, (3 + √5)5 = 3935.73982… The answer is 935. For n = 2, (3 + √5)2 = 27.4164079……
-
Well, since we’re mostly finished with the company project, I can now put some of my attention here again. I’ts been a while! I’ve been trying to crack some hard (for me at least) CodeJam problems, from probabilities to geometry and I’ve not been able to move on much, must study a lot more. In…
-
Well, it’s been a tough weekend. Many new things were installed at home, lots of drilling and weightlifting (oh my arms…) but feels nicer after all. 🙂 More places for the kittens to hide. That said, I’m evolving on Africa 2010 CodeJam D problem, but as soon as I get closer to solving, another challenge…
-
Whoa, that was a tough problem. Ironically it’s called Qualification Round: You’ve just advanced from the Qualification Round of Google Code Jam Africa 2010, and you want to know how many of your fellow contestants advanced with you. To give yourself a challenge, you’ve decided only to look at how many people solved each problem.…
-
I didn’t knew that this contest existed! 😀 Well, found it on the front page, looking to be solved, so, let’s go! Its summary: You receive a credit C at a local store and would like to buy two items. You first walk through the store and create a list L of all available items. From this list you…
-
Gotchas all around! 😀 In fact, this time I’ve struggled with the algorithm to solve the problem. My first attempt did work, but could only solve correctly the small input of the problem, entitled Ocean View. It’s not complicated as a problem, but this time you need to think a bit more to get there:…
Diogo Böhm 