competitive programming

UVA 929 Number Maze Dijkstra based problem

UVA 929  Number Maze Dijkstra based problem. We have already discussed Dijkstra algorithm for shortest path from source to destination here http://wikistack.com/shortest-path-problem-dijkstras-algorithm/. The given problem at this link https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=870...
Continue Reading »
competitive programming

UVA Backtracking problem 639 Don’t Get Rooked solution

UVA Backtracking problem 639 Don’t Get Rooked  solution. The given problem is based on backtracking. https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=580. #include<iostream> #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; #define N 5 char mat; int...
Continue Reading »