2-dimensional hue graph of array The Question

Given a two dimensional array, o[][], create a 2-dimensional graph such that o[xCoordinate][yCoordinate] is the hue of the point at (xCoordinate, yCoordinate), and the value and saturation are always 100. Let the hue go from -50 to 50, where -50 and 50 are 0 and 100 respectively.

Rules


You may use any language you wish
Lowest bytes wins
Include seperate byte amount for points taken off from extra


Extra

If you want extra points (or, less actually) you can include a snippit of code in the same language such that o[x][y] is equal to sin x · cos y, in less than 25 bytes more than your original snippit. Extra points removes 10 bytes from your score.

Example Language: 89 [79] (Extra: 113)
Mathematica: 68
Graphics@Raster@Reverse[List@@Hue[#/100]~ColorConvert~&quot;RGB&quot;&amp;/@#&amp;/@o]

Still figuring out the extra.