% this problem will be updated, % your score/size can change over time % if you submit a fixed value :-)

y=like_me(); assert(isequal(mod(y,1),0));

y=like_me(); assert(y>0);

y=like_me(); url='http://www.mathworks.co.uk/matlabcentral/cody/problems/2313' % the main problem with this problem is that ... % this problem thinks. % it thinks about itself most of the time. % it is convinced, that at least X likes has it. y_sub_correct=max([10 cellfun(@(S)str2num(cell2mat(S)),regexp(urlread(url),'(\d*) players</a> like this problem','tokens'))]); % probably hackable by comments? t = mtree('like_me.m','-file'); size = length(t.nodesize); % this problem likes compliments, % even false. % For good compliment it is going to pass your solution with a smaller size! % But if you don't appreciate it, it can punish you... feval(@assignin,'caller','score',round(max(0,size*(.5+.5*y_sub_correct/y))));