Tag Archives: competitive

Data structure challenge: application

Posted on April 6, 2020 by Brent

I forgot to mention this in my previous post, but the thing which got me thinking about the predecessor problem in the first place was this competitive programming problem on Open Kattis: Profitable Pizzas I challenge you to go and … Continue reading →

Posted in data structures | Tagged , , , , , , , , , , , , , , | Leave a comment

Competitive Programming in Haskell: modular arithmetic, part 2

Posted on March 3, 2020 by Brent

In my last post I wrote about modular exponentiation and egcd. In this post, I consider the problem of solving modular equivalences, building on code from the previous post. Solving linear congruences A linear congruence is a modular equivalence of … Continue reading →

Posted in haskell | Tagged , , , , | 4 Comments

Competitive Programming in Haskell: modular arithmetic, part 1

Posted on February 15, 2020 by Brent

Modular arithmetic comes up a lot in computer science, and so it’s no surprise that it is featured, either explicitly or implicitly, in many competitive programming problems. As a brief aside, to be good at competitive programming it’s not enough … Continue reading →

Posted in haskell | Tagged , , , , | 7 Comments

Competitive Programming in Haskell: primes and factoring

Posted on February 7, 2020 by Brent

Number theory is a topic that comes up fairly regularly in competitive programming, and it’s a very nice fit for Haskell. I’ve developed a bunch of code over the years that regularly comes in handy. None of this is particularly … Continue reading →

Posted in haskell | Tagged , , , , | 5 Comments

Competitive Programming in Haskell: reading large inputs with ByteString

Posted on October 12, 2019 by Brent

In my last post in this series, we looked at building a small Scanner combinator library for lightweight input parsing. It uses String everywhere, and usually this is fine, but occasionally it’s not. A good example is the Kattis problem … Continue reading →

Posted in haskell | Tagged , , , , , | 3 Comments

Competitive Programming in Haskell: Scanner

Posted on May 22, 2019 by Brent

In my previous post I explored solving a simple competitive programming problem in Haskell. The input of the problem just consisted of a bunch of lines containing specific data, so that we could parse it using lines and words. There … Continue reading →

Posted in haskell | Tagged , , , , | 13 Comments

Competitive Programming in Haskell: Basic Setup

Posted on April 24, 2019 by Brent

I am the coach of my school’s competitive programming team and enjoy solving problems on Open Kattis. Since Kattis accepts submissions in a wide variety of languages (including Haskell, OCaml, Rust, Common Lisp, and even Prolog), I often enjoy submitting … Continue reading →

Posted in haskell | Tagged , , , , , | 6 Comments

Hendrix teams at ACM ICPC

Posted on November 4, 2018 by Brent

Today I took five students from Hendrix to Fort Smith to compete in the Mid-Central USA Regional of the ACM International Collegiate Programming Contest (ICPC). Both teams solved five out of ten problems, and finished second and fourth out of … Continue reading →

Posted in meta, teaching | Tagged , , , , | 1 Comment