科迪

尼古拉斯·豪

371
Rank
15
Badges
3380
Score
View Community Profile
1 – 50 of 372

尼古拉斯·豪receivedLeaderbadge forSolution 144715

on 7 Sep 2021

尼古拉斯·豪receivedFamousbadge

on 28 Dec 2020

尼古拉斯·豪received科迪挑战大师badge

on 19 Jan 2018

尼古拉斯·豪submitted aCommenttoSolution 462917

I believe this solution misses the point! ;-)

on 27 Jun 2014

尼古拉斯·豪submitted aCommenttoProblem 2390. Fair Scoring for Cody

The same regexp expression could potentially be called more than once with different dynamic code each time. It might be best to count the score of each unique code string from each separate invocation point -- that seems most in keeping with the spirit of the current rules. You're right that it would be quite complex to keep track. Thanks for pointing out the problem with newline, by the way. I think it is fixed now.

on 26 Jun 2014

尼古拉斯·豪submitted aCommenttoProblem 2390. Fair Scoring for Cody

Alfonso, thank you for your excellent thinking on this subject. You're quite right that an approach based only on parsing the program text would be hard to perfect. One could at least make people work harder to get around the scoring system! But what do you think of a different approach: modifying the definitions of regexp and its ilk on the Cody machines so that they dynamically alter the score when called with eval-like arguments?

on 26 Jun 2014

尼古拉斯·豪receivedSpeed Demonbadge forSolution 76238

on 16 May 2014

尼古拉斯·豪submitted aCommenttoProblem 2265. 2048 Next Move

http://cs.smith.edu/~nhowe/export/8192.png

on 2 Apr 2014

尼古拉斯·豪receivedCUP Challenge Masterbadge

on 10 Jan 2014

尼古拉斯·豪receivedTiles Challenge Masterbadge

on 27 Nov 2013
1 – 50 of 372