some random text about funky things by Jan Paul Posma
In the last few years I’ve competed in a few algorithmic programming contests, which are great fun! Sometimes performing well, sometimes screwing up, it’s always a great learning experience, and you meet people who are really, really good.
Right now I’m with some guys in a house in Putten, working on the CodeCup, so this is a nice time to take a break and write down what I think are cool contests, and what makes each contest unique.
Well, there you have it. I started a blog. Now I think only people who actually have something to say should begin blogging. And I’m not sure if I’ve got something to say. So the first few posts will be postings of old projects, for my own reference and to get the hang of it. Maybe you’ll like it too!
My writing skills are average, as is my knowledge of the English language. So if you have suggestions of any kind, please, don’t hesitate to leave a comment!
That being said, let’s look at a fun little project I worked on about two years ago. I had a bet with Marcel Vlastuin that I could produce a self-enumerating pangram. This is an example of such a pangram:
This sentence contains three a’s, one b, three c’s, two d’s, thirty three e’s, seven f’s, one g, six h’s, ten i’s, one j, one k, one l, one m, twenty four n’s, sixteen o’s, one p, one q, nine r’s, twenty six s’s, seventeen t’s, five u’s, five v’s, four w’s, four x’s, four y’s, and one z.