GoogleCodeJam 0.0.1 → 0.0.2

raw patch · 3 files changed

+31/−2 lines, 3 files

Files

• GoogleCodeJam.cabal +5/−2
• README.md +20/−0
• stack.yaml +6/−0

@@ -1,5 +1,5 @@ name: GoogleCodeJam-version: 0.0.1+version: 0.0.2 cabal-version: >=1.10 build-type: Simple license: MIT@@ -10,9 +10,12 @@ bug-reports: http://github.com/johannesgerer/GoogleCodeJam/issues synopsis: A monad for flexible parsing of Google Code Jam input files with automatic parallelization. description:-    For more (including usage examples and solutions to GCJ problems) see <https://github.com/johannesgerer/buchhaltung Readme> on Github.+    For more (including usage examples and solutions to GCJ problems) see <https://github.com/johannesgerer/GoogleCodeJam Readme> on Github. category: Text author: Johannes Gerer+extra-source-files:+    README.md+    stack.yaml  library     exposed-modules:

@@ -0,0 +1,20 @@+# googleCodeJam [![Build Status](https://travis-ci.org/johannesgerer/GoogleCodeJam.svg?branch=master)](https://travis-ci.org/johannesgerer/GoogleCodeJam) [![Hackage](https://img.shields.io/hackage/v/JoogleCodeJam.svg)](https://hackage.haskell.org/package/GoogleCodeJam)++A monad for flexible parsing of Google Code Jam input files with automatic parallelization.++Read the documentation on [Hackage](https://hackage.haskell.org/package/GoogleCodeJam/docs/GCJ.html).++## Examples++For usage examples check out my submission contained in this repository.++### [2014 Round 1A Problem B](https://code.google.com/codejam/contest/2984486/dashboard#s=p1)++[This](2014_1a/B/Main.hs) short and simple solution achieves linear speedup on 4 cores.+ +### [2015 Round 1A Problem B](https://code.google.com/codejam/contest/4224486/dashboard#s=p1&a=1)++[Solution](20151a/B.hs)+++

@@ -0,0 +1,6 @@+resolver: lts-7.16++packages:+- '.'++pvp-bounds: both