Category Archives: competitive programming

Competitive programming in Haskell: BFS, part 4 (implementation via STUArray)

Posted on November 17, 2021 by Brent

In a previous post, we saw one way to implement our BFS API, but I claimed that it is not fast enough to solve Modulo Solitaire. Today, I want to demonstrate a faster implementation. (It’s almost certainly possible to make … Continue reading →

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

Competitive programming in Haskell: Enumeration

Posted on November 15, 2021 by Brent

I’m in the middle of a multi-part series on implementing BFS in Haskell. In my last post, we saw one implementation, but I claimed that it is not fast enough to solve Modulo Solitaire, and I promised to show off … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , | 1 Comment

Competitive programming in Haskell: BFS, part 3 (implementation via HashMap)

Posted on October 29, 2021 by Brent

In a previous post, I showed how we can solve Modulo Solitaire (and hopefully other BFS problems as well) using a certain API for BFS, and we also explored some alternatives. I had a very interesting discussion with Andrey Mokhov … Continue reading →

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

Competitive programming in Haskell: BFS, part 2 (alternative APIs)

Posted on October 18, 2021 by Brent

In my last post, I showed how we can solve Modulo Solitaire (and hopefully other BFS problems as well) using a certain API for BFS, which returns two functions: one, level :: v -> Maybe Int, gives the level (i.e. … Continue reading →

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

Competitive programming in Haskell: BFS, part 1

Posted on October 14, 2021 by Brent

In a previous post, I challenged you to solve Modulo Solitaire. In this problem, we are given a starting number and are trying to reach in as few moves as possible. At each move, we may pick one of up … Continue reading →

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

Competitive programming in Haskell: Codeforces Educational Round 114

Posted on September 21, 2021 by Brent

Yesterday morning I competed in Educational Round 114 on codeforces.com, using only Haskell. It is somewhat annoying since it does not support as many Haskell libraries as Open Kattis (e.g. no unordered-containers, split, or vector); but on the other hand, … Continue reading →

Posted in competitive programming, haskell | Tagged , | 2 Comments

Competitive programming in Haskell: Kadane’s algorithm

Posted on September 9, 2021 by Brent

I will be giving a talk on competitive programming in Haskell tomorrow, September 10, at Haskell Love. You should attend! It’s free! In my last competitive programming post, I challenged you to solve Purple Rain. We are presented with a … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , | 1 Comment

Competitive programming in Haskell: monoidal accumulation

Posted on August 11, 2021 by Brent

In my last competitive programming post, I challenged you to solve Please, Go First. In that problem, we are presented with a hypothetical scenario with people waiting in a queue for a ski lift. Each person is part of a … Continue reading →

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

Competitive programming in Haskell: folding folds

Posted on June 19, 2021 by Brent

Now that the semester is over—and I will be on sabbatical in the fall!—you can expect a lot more competitive programming in Haskell posts. In a previous post, I challenged you to solve Origami. j0sejuan took me up on the … Continue reading →

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

Competitive programming in Haskell: folding challenge

Posted on February 23, 2021 by Brent

As of this writing, I am the only person who has solved Origami on Open Kattis (see the problem statistics here). This is a shame since it is a very nice problem! Of course, I solved it in Haskell. I … Continue reading →

Posted in competitive programming, haskell | Tagged , , , , | 8 Comments