My device malfunctions... Abuse its undefined string behaviour!

Question

Help! My device malfunctions and whenever I try to repeat a String, I get a messy results. Instead of repeating the same string N times, it fills an NxN square with each of its characters, and stacks the squares up.

For example, given the String "Test" and the number 2, instead of "TestTest", I get:

TT
TT
ee
ee
ss
ss
tt
tt

---

After I have seen this for a while, I started to like it. Your task today is to reproduce this strange behaviour. Given a non-empty string that consists of printable ASCII only, and a positive integer, output the String my malfunctioning device returns.

• All standard rules apply.

• The input and output may be handled through any reasonable mean.

• This is code-golf, so the shortest code in bytes in each language wins.

---

Test Cases

Input 
Output

----------

"Test", 2

TT
TT
ee
ee
ss
ss
tt
tt

----------

"UuU", 3

UUU
UUU
UUU
uuu
uuu
uuu
UUU
UUU
UUU

----------

"A", 5

AAAAA
AAAAA
AAAAA
AAAAA
AAAAA

----------

You can find a larger test case here. Good luck and have fun golfing!

Answer 1

C# (.NET Core), 68 + 18 bytes

a=>n=>new int[a.Length*n].Select((x,i)=>Enumerable.Repeat(a[i/n],n))

Also included in byte count:

using System.Linq;

Try it online!

Output is a collection of collections of characters (one collection for each line).

Explanation:

a => n =>                                // Take a string and a number
    new int[a.Length * n]                // Create new collection, 'n' times larger than 'a'
    .Select((x, i) =>                    // Replace every member with
        Enumerable.Repeat(a[i / n], n)   //     a collection of repeated character from 'a', based on index
    )

Answer 2

Clojure v1.8, 63 62 58 bytes

#(map(fn[l](dotimes[i %2](prn(apply str(repeat %2 l)))))%)

Try it online!

Explanation

(map ... s)           For every letter of the string 's'
(dotimes[i %2] ...)   Do 'n' times
(prn(apply str(repeat %2 l))) Repeat the letter 'n' times, combine to string and print

Answer 3

Bash, 49 bytes

sed s/./$(printf \&%.s `seq $[$1*$1]`)/g|fold -$1

Try it online!

Answer 4

Python 2, 46 bytes

x,y=input()
for p in x:print'\n'.join([p*y]*y)

Try it online!

Answer 5

GNU APL, 11 bytes

⍪/⎕{⍺⍺⍴⍵}¨⍞

Left argument: ⍺ number of repetitions. ⍵ the string.

This uses ⍴ to repeat each letter (⍵ in the inner {} block) in ⍺x⍺ matrix.

Then we use ⍪/ to "laminate" them.

Answer 6

MathGolf, 8 bytes

*mÅn+m*~

String input as a list of characters.

Try it online.

Explanation:

*        # Repeat each character in the second (implicit) input-list the first
         # (implicit) input-integer amount of times
 mÅn+    # Append a newline to each inner string:
 m       #  Map over each string,
  Å      #  using the following two characters as inner code-block:
   n     #   Push a newline character
    +    #   And append it to the string
     m*  # Repeat each inner string the first (implicit) input-integer amount of times
       ~ # Dump this list of lines with trailing newlines to the stack
         # (after which the entire stack is joined and output implicitly as result)