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]
Y = [1 2 3 4;
2 3 4 3;
3 4 3 2;
4 3 2 1]
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.
Extract leading non-zero digit
Number of 1s in the Binary Representation of a Number
Maximum value in a matrix
Calculate compression ratio of engine
Time and Variable mapping and matching
Implement full adder circuit
Basics: Divide integers to get integer outputs in all cases
Who has power to do everything in this world?
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