I already have an idea: converting 'normal' (Arabic?) numbers to Roman numbers for ostreams (like with the small Base contest). I already have a header file and a default implementation, the latter to show what is to be expected. Of course, this implementation is rather long. If you like the idea, I'll post it or give it to Darobat.
I had fun with the obfuscation, but it's time for different contests.
I fancy code brevity contests (although I find it tough). I like template-meta-programming contests (I had trouble making even 1 correct source). I like optimize for speed. Now that I come to think of it, I seem to like all programming contest!!! But with variety. I think that is crucial. Timing is, too: once a month at most twice a month, and fixed starting points (like every first Friday in the month orso).
Don't like that; it's compiler dependent, even between compilerflags (-O9 vs -O0 in g++ for instance).Rodrigo Dias wrote:...or the smallest binary...
It is always easy to have a guideline, but then I think 200 should be the max. For some contest ideas, we can perhaps borrow problems mathschallenge.net.Darobat wrote:...count wouldn't be below 200...
One more thing about contests: I think that when contest is posted, it should not start for three days orso. This allows the contestents to interact with the designer to overcome ambiguities and stating the problem understandably and perhaps make a design change. A default implementation would come in handy.
Just my two eurocents.
? But you have been inactive for a while, so I won't accuse you of cheating 
.
