C#, 136 bytes
Data
- Input
Int32[] i An array of ints
- Output
Int32[,] A bidimentional array.
Golfed
i=>{int m=System.Linq.Enumerable.Max(i),l=i.Length,x,y;var o=new int[m,l];for(y=0;y<m;y++)for(x=0;x<l;)o[y,x]=i[x++]>y?y+1:0;return o;};
Ungolfed
i => {
int
m = System.Linq.Enumerable.Max( i ),
l = i.Length,
x, y;
var o = new int[ m, l ];
for( y = 0; y < m; y++ )
for( x = 0; x < l; )
o[ y, x ] = i[ x++ ] > y ? y + 1 : 0;
return o;
};
Ungolfed readable
// Take an array of Int32
i => {
// Store the max value of the array, the length and declare some vars to save some bytes
int
m = System.Linq.Enumerable.Max( i ),
l = i.Length,
x, y;
// Create the bidimensional array to output
var o = new int[ m, l ];
// Cycle line by line...
for( y = 0; y < m; y++ )
// ... and column by column...
for( x = 0; x < l; )
// And set the value of the line in the array if it's lower than the the value at the index of the input array
o[ y, x ] = i[ x++ ] > y ? y + 1 : 0;
// Return the bidimentional array.
return o;
};
Full code
using System;
using System.Collections.Generic;
namespace TestBench {
public class Program {
// Methods
static void Main( string[] args ) {
Func<Int32[], Int32[,]> f = i => {
int
m = System.Linq.Enumerable.Max( i ),
l = i.Length,
x, y;
var o = new int[ m, l ];
for( y = 0; y < m; y++ )
for( x = 0; x < l; )
o[ y, x ] = i[ x++ ] > y ? y + 1 : 0;
return o;
};
List<Int32[]>
testCases = new List<Int32[]>() {
new[] { 1, 2, 5, 6, 4 },
new[] { 3, 5, 2, 1, 6 },
new[] { 1, 2, 3, 4, 3, 2, 1 },
};
foreach( Int32[] testCase in testCases ) {
Console.WriteLine( " INPUT: " );
PrintArray( testCase );
Console.WriteLine( "OUTPUT: " );
PrintMatrix( f( testCase ) );
}
Console.ReadLine();
}
public static void PrintArray<TSource>( TSource[] array ) {
PrintArray( array, o => o.ToString() );
}
public static void PrintArray<TSource>( TSource[] array, Func<TSource, String> valueFetcher ) {
List<String>
output = new List<String>();
for( Int32 index = 0; index < array.Length; index++ ) {
output.Add( valueFetcher( array[ index ] ) );
}
Console.WriteLine( $"[ {String.Join( ", ", output )} ]" );
}
public static void PrintMatrix<TSource>( TSource[,] array ) {
PrintMatrix( array, o => o.ToString() );
}
public static void PrintMatrix<TSource>( TSource[,] array, Func<TSource, String> valueFetcher ) {
List<String>
output = new List<String>();
for( Int32 xIndex = 0; xIndex < array.GetLength( 0 ); xIndex++ ) {
List<String>
inner = new List<String>();
for( Int32 yIndex = 0; yIndex < array.GetLength( 1 ); yIndex++ ) {
inner.Add( valueFetcher( array[ xIndex, yIndex ] ) );
}
output.Add( $"[ {String.Join( ", ", inner )} ]" );
}
Console.WriteLine( $"[\n {String.Join( ",\n ", output )}\n]" );
}
}
}
Releases
- v1.0 -
136 bytes - Initial solution.
Notes
May we distribute the ranges horizontally instead? – Mr. Xcoder – 2017-09-07T19:03:53.513
No, they should be vertical. If you use a language where the words horizontal/vertical doesn't have any meaning then it's optional. (Could be relevant for languages where lists of lists aren't associated with either horizontal/vertical directions) – Stewie Griffin – 2017-09-07T19:11:53.293
1@StewieGriffin What sane language doesn't associate dimensions with nested lists? – Erik the Outgolfer – 2017-09-08T09:22:41.470
4@EriktheOutgolfer, How many insane languages are used on this site? – Stewie Griffin – 2017-09-08T09:31:26.863
@StewieGriffin It depends on how you define insane, but if your language doesn't have any concept of dimensionality at all, I'm not sure how sane it is. – Erik the Outgolfer – 2017-09-08T09:41:40.750
2@EriktheOutgolfer R for one doesn't see matrices as nested list, but rather one long list, which wraps around row-wise. – JAD – 2017-09-08T11:35:00.900