Skip to content

Instantly share code, notes, and snippets.

View gingemonster's full-sized avatar

Brian Norman gingemonster

61 followers · 1 following
View GitHub Profile
@gingemonster
gingemonster / adventofcode-day2-2.cs
Last active December 4, 2016 18:55
Adventofcode Day 2 - Challenge 2
/*
The document goes on to explain that each button to be pressed can be found by starting on the previous button
and moving to adjacent buttons on the keypad: U moves up, D moves down, L moves left, and R moves right.
Each line of instructions corresponds to one button, starting at the previous button
(or, for the first line, the "5" button); press whatever button you're on at the end of each line.
If a move doesn't lead to a button, ignore it.
*/
using System;
using System.Collections.Generic;
@gingemonster
gingemonster / adventofcode-day2-1.cs
Last active December 4, 2016 18:56
Adventofcode Day 2 - Challenge 1
/*
The document goes on to explain that each button to be pressed can be found by starting on the previous button
and moving to adjacent buttons on the keypad: U moves up, D moves down, L moves left, and R moves right.
Each line of instructions corresponds to one button, starting at the previous button
(or, for the first line, the "5" button); press whatever button you're on at the end of each line.
If a move doesn't lead to a button, ignore it.
*/
using System;
using System.Collections.Generic;
@gingemonster
gingemonster / adventofcode2016-day1-2.js
Created December 1, 2016 13:39
Advent of code 2016 day 1-2 nodejs solution
/*
* The Document indicates that you should start at the given coordinates (where you just landed) and face North. Then, follow the provided sequence: either turn left (L) or right (R) 90 degrees, then walk forward the given number of blocks, ending at a new intersection.
*
* There's no time to follow such ridiculous instructions on foot, though, so you take a moment and work out the destination. Given that you can only walk on the street grid of the city, how far is the shortest path to the destination?
For example:
Following R2, L3 leaves you 2 blocks East and 3 blocks North, or 5 blocks away.
R2, R2, R2 leaves you 2 blocks due South of your starting position, which is 2 blocks away.
R5, L5, R5, R3 leaves you 12 blocks away.
@gingemonster
gingemonster / adventofcode2016-day1.js
Last active December 1, 2016 08:08
Advent of code 2016 day 1 nodejs solution
/*
* The Document indicates that you should start at the given coordinates (where you just landed) and face North. Then, follow the provided sequence: either turn left (L) or right (R) 90 degrees, then walk forward the given number of blocks, ending at a new intersection.
*
* There's no time to follow such ridiculous instructions on foot, though, so you take a moment and work out the destination. Given that you can only walk on the street grid of the city, how far is the shortest path to the destination?
For example:
Following R2, L3 leaves you 2 blocks East and 3 blocks North, or 5 blocks away.
R2, R2, R2 leaves you 2 blocks due South of your starting position, which is 2 blocks away.
R5, L5, R5, R3 leaves you 12 blocks away.
@gingemonster
gingemonster / gist:1704172
Created January 30, 2012 12:33
Bing Maps Ajax v7 Find Polygons in map view
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html>
<head>
<title>Polyline default</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8"/>
<script type="text/javascript" src="http://ecn.dev.virtualearth.net/mapcontrol/mapcontrol.ashx?v=7.0"></script>
<script type="text/javascript">
var map = null;
function getMap()