add ineverylang puzzle completion

**What does your Instant Answer do?**
It checks to see if the user is searching for a popular programming puzzle, and finds solutions from http://www.ineverylang.com. If it can, it even pulls the solution for that user's specific search.

**What problem does your Instant Answer solve (Why is it better than organic links)?**
Rich code solutions, specific to that user's language search.

**What is the data source for your Instant Answer? (Provide a link if possible)**
http://www.ineverylang.com

**Why did you choose this data source?**
I'm the developer, and there isn't another source with an easily consumable JSON format.

**Are there any other alternative (better) data sources?**
Rosetta Code has a ton of puzzle solutions, but I don't know that there is any easily-parsable way to get at that data.


**What are some example queries that trigger this Instant Answer?**
"Hello, World! in Java", "Fizz Buzz in Swift", "Binary Search in Erlang"


**Which communities will this Instant Answer be especially useful for? (gamers, book lovers, etc)**
Programmers, specifically ones that enjoy katas.


**Is this Instant Answer connected to a DuckDuckHack [Instant Answer idea](https://duck.co/ideas)?**


**Which existing Instant Answers will this one supersede/overlap with?**
SearchCode and CodeSearch


**Are you having any problems? Do you need our help with anything?**
I don't think so, unless there is something wrong with this PR!


**What are the terms of use for the API? Will DuckDuckGo need specific authorization (e.g. an API key)? Are there any costs associated with API usage?**
No costs or terms. InEveryLang is my project, and I'm sharing this with DDG fo free.


**Where did you hear about DuckDuckHack? (For first time contributors)**
I believe I saw a Hacker News link to DuckDuckHack.com


**What does the Instant Answer look like? (Provide a screenshot for new or updated Instant Answers)**
![screen shot 2014-11-17 at 3 17 55 pm](https://cloud.githubusercontent.com/assets/657707/5077843/f147115e-6e6c-11e4-99d3-c946b58c1d3a.png)


## Checklist
Please place an 'X' where appropriate.

```
[x] Added metadata and attribution information
[x] Wrote test file and added to t/ directory
[x] Verified that instant answer adheres to design guidelines (https://duck.co/duckduckhack/design_styleguide)
[x] Verified that instant answer adheres to code styleguide (https://duck.co/duckduckhack/code_styleguide)
[x] Tested cross-browser compatibility

    Please let us know which browsers/devices you've tested on:
    - Windows 8
        [] Google Chrome
        [] Firefox
        [] Opera
        [] IE 10

    - Windows 7
        [x] Google Chrome
        [x] Firefox
        [x] Opera
        [] IE 8
        [x] IE 9
        [x] IE 10

    - Windows XP
        [] IE 7
        [] IE 8

    - Mac OSX
        [x] Google Chrome
        [x] Firefox
        [x] Opera
        [x] Safari

    - iOS (iPhone)
        [x] Safari Mobile
        [] Google Chrome
        [] Opera

    - iOS (iPad)
        [x] Safari Mobile
        [] Google Chrome
        [] Opera

    - Android
        [] Firefox
        [] Native Browser
        [x] Google Chrome
        [] Opera
```

I see what you're getting at, but I'm struggling to figure out the best way to map it to this situation. The parts that make this difficult:

1. Not every puzzle has a solution in every language. That means that if a user were to search for "Fizz Buzz in R", it might not have a solution in R, even though other puzzles might have R solutions. In that scenario, I just show a generic Fizz Buzz solution.
2. Languages have to be translated before they can be worked with. User searches like "C#", "C Sharp", "C-Sharp" all need to be matched and then translated down to "csharp".

Those two things put together means that the *clean* way to do this in Perl would essentially be the same thing I'm already doing in JS, but iterate over the entire set of language translations. It's not a simple RegExp match, because even after a match I have to translate the match into the standard "csharp" naming convention. At the end of the day, this will be less efficient, because the JS is able to only iterate over the set of languages that actually have solutions for that puzzle.

If, however, DDG is caching this sort of stuff somehow, then doing it on the Perl side will be better either way. Let me know if that's the case.

There *are* some dirty ways to do it - essentially representing the data twice, once as a RegExp for matching, and again as a translation schema. That would definitely work, but the code gets less DRY and more brittle.

There might be a better way to do this, but unfortunately I'm not very fluent in Perl. I'll keep thinking on it, and would appreciate any thoughts, @moollaza.