In this post we are going to have a look at the 8086 assembly program to add two numbers.

Dijkstra's algorithm is used to find the shortest path between two nodes. The algorithm takes on a greedy approach to obtain the solution.

This question was one among the 4 I had to face at the Google Code Jam 2014 Qualification round. I only managed to solve two - Magic Trick (this one) & Cookie Clicker Alpha (read). Although I managed to get qualified with 25 points in total, finishing at 13063 :). This one was the easiest to understand. You can read the problem Statement here. If you are interested you can also refer to Cookie clicker Alpha.

This problem is part of the Google code jam 2014 Qualification Round. I have participated and was able to solve only 2 of the 4 problems. Now I would like to share the code of the two I solved. And this is the solution of Cookie Clicker Alpha. Read the problem statement here. And if you're interested here is the solution of the other problem 'Magic Trick' that I managed to solve. I have used C Sharp to solve these problems. And I believe they are self explanatory for the most part.

The Ameoba that eats :)

This one is a Division 2 250 the easiest from SRM 615. Here's the statement

Problem Statement
    
Monte-Carlo is an amoeba. Amoebas can feed on gel:

This is my second code jam solution.

For days I have been trying to figure out how to deal with the whole input and output file thing in Google Code Jam Competition. Once I figured it out I thought of making a solution for the question recommended for beginners practicing for gcj – Store Credit. Google recommends this as the first problem for beginners who practice for code jam, and the reason is simple – it seems to be the easiest. You can read the problem here or download the zip file containing the source, input and output files along with the description. Well now we are all set lets go solve it.