I have to traverse a matrix and say how many \"characteristic areas\" of each type it has. A characteristic area is defined as a zone where elements of value n or >n are adjacent.
\"Programming Challenges (The Programming Contest Training Manual)\" is probably one of the nicest exercises book on algorithms.
There is a bag that can take X kilogram. You will get an array of stuff and their weight. Print true and the each weight of the stuff
First of all sorry for my English. I would like to use a backtracking algorithm in Erlang. It would serve as a guessing to solve partially filled sudokus. A 9x9 sudoku is stored as a list of 81 eleme
加载中,请稍侯......