Make sure you update the problem description with the requisite Trendy Plot when that gets up and running!
Great idea, but it is quite challenging to choose only a few problems when you solved 1500+ here on Cody... ;-)
I'm open to proposals. Would you like something like 7 votes per week? Since it is possible to vote for one problem multiple times I would like to keep some kind of limit. Right now, when limit is reached you have to wait at least one week, but number of votes is then fixed to one, and then there is always minimum one week waiting period. Would you like it to work in cumulative way? I mean if you have K votes left, there are N votes per week, after M weeks without voting your current limit is K+N*M. Maybe that would be clearer? I look forward to your opinions.
there were many jewels in the GJam series as well!
the whole PACMAT series was really fun!
because is one problem ToDo for me... and many other players!! :-P
I chooed this problem in representation of all REGEXPR problems I solved here... Now i'm not affraid about regular expressions anymore! :-D
Fast Fourier transform algorithm http://www.mathworks.com/matlabcentral/cody/problems/1509-fast-fourier-transform-algorith Because I won a Matlab base-cap and a Matlab t-shirt for one of my answers... ;-)
I agree with James... freepass.please!!!!
Alfonso created there the fisrt colaborative cody problem, very funny! And also created for this problem an amazing plot on Trendy: http://www.mathworks.com/matlabcentral/trendy/plots/1192 Take a look for the code of the plot... AMAZING!!! ;-)
"'Problem 1774. Free passes for everyone!' created by Alfonso Nieto-Castanon" This one helped me solve more problems than I would care to admit...
I agree with James... :-P
"Steal, Share or Catch: Tournament..." by Doug Hull. An old problem, I had a lot of fun with. Recent post on Blogs by Ned Gulley about Monte Carlo approach to Game Theory refreshed my memories, so I 've started with that one.
Wonderful initiative. I would need some time to give an honest answer. So many nice old problems ...
Back to basics 7 - Equal NaNs
Back to basics 9 - Indexed References
create a circulant matrix
07 - Common functions and indexing 4
Square a Number
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
Open coded lock.
Polite numbers. N-th polite number.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office