HackerTrans
トップ新着トレンドコメント過去質問紹介求人

nicknash

no profile record

コメント

nicknash
·12 か月前·議論
I wonder if you can clear up a memory of mine from IOI 2001. The first day results were delayed, and I seem to remember this is because a contestant encoded the search in one of the problems into a compile time c++ template metaprogram. On the second day, there was then also a compile time limit for solutions, from what I remember. Do you remember any more details of this?
nicknash
·昨年·議論
How about this:

What is the most efficient algorithm to generate an N x N array of the integers 0,1,2, … such that each entry is the smallest such integer not appearing either above in the same column, or to the left in the same row?

Posting it in this thread is a bit of a spoiler :)

https://nicknash.me/2012/10/26/happy-halloween/
nicknash
·2 年前·議論
A fun fact: Each point in the XOR texture is the smallest integer not appearing above it, or to its left

(Ducking while posting my own blog: https://nicknash.me/2012/10/26/happy-halloween/)