Given an input number x, create a mirror image matrix 'Y' across the anti-diagonal. For example, if x=3,
Y = [1 2 3;
2 3 2;
3 2 1]If x=4,
Y = [1 2 3 4;
2 3 4 3;
3 4 3 2;
4 3 2 1]
Project Euler: Problem 7, Nth prime
299 Solvers
141 Solvers
Vector of numbers divisible by 3
97 Solvers
547 Solvers
412 Solvers
Solution 232886
How does this solution generate such less size inspite of using so many functions?
The way Cody scores things, a string is just a string, even if it is basically executable code. So there are tricks you can do with regexp or str2num to make your score a lot lower than it otherwise would be.
Ok, Thanks for information.