In the current article I will try to solve a problem for calculation of average distance with Dijkstra, given in codeforces.com contest here in pdf. What is the problem like? We have n weighted graphs like this: For each given graph,…

Yesterday I have spent some hours, trying to resolve one problem for shortest paths. The problem was coming from HackBulgaria and was somehow similar to these two problems here: Get the shortest path in a weighted graph with Dijkstra Dijkstra for…

Tagged with: dijkstra, dijkstra algo, dijkstra going a little crazy, Python, python algorithm dijkstra

After the article here, concerning the building of the binary trees and their usefulness, today I will show how to use these trees in action 🙂 Imagine that we have the following problem, used in arena.hackbulgaria.com: Implement a program in…

Tagged with: binary list usage, binary tree list, binary tree list in python, Python, range minimal query

Some two weeks ago, I was coding in Python with Notepad++ as a text editor and I was getting really tired, because the program was not running the way I wanted it and I had to print a lot of…

Tagged with: wing ide review

Top