Print a 10 by 10 grid of asterisks

Question

Background

This is a standard textbook example to demonstrate for loops.

This is one of the first programs I learnt when I started learning programming ~10 years ago.

Task

You are to print this exact text:

**********
**********
**********
**********
**********
**********
**********
**********
**********
**********

Specs

• You may have extra trailing newlines.
• You may have extra trailing spaces (U+0020) at the end of each line, including the extra trailing newlines.

Scoring

This is code-golf. Shortest answer in bytes wins.

Answer 1

Arduino, 101 bytes

int i=0;void setup(){Serial.begin(300);}void loop(){if(i++<10)Serial.println("**********");else i--;}

The else case is there to prevent i from overflowing and becoming negative, since the loop() function is called indefinitely.

Answer 2

Python 3, 34 bytes

for i in range(10):
 print("*"*10)

Try it online!

Answer 3

SNOBOL4 (CSNOBOL4), 43 bytes

Outputs two trailing LFs.

 output =dupl(dupl('*',10) char(10),10)
end

Try it online!

Answer 4

jq, 16 bytes

10*("*"*10+"\n")

Try it online!

Answer 5

Aussie++, 71 bytes

G'DAY MATE!
I RECKON x IS A WALKABOUT FROM [0TO 9]<GIMME "**********";>

Tested in commit 0a5de7e, in which for loops do not behave as per the spec. The version presented here actually works in that commit.

Answer 6

KonamiCode, 103 bytes

v(^^^^>^^)>(^)v(^>)>(^^)v(>)>(^^^)v(>)S(^>)L(>)>(^^)v(>)L(^)>(>)<<>(^^)v((>))B(^)>(^)<<>(^^^)v((>))B(>)

Answer 7

Japt, 15 bytes

"*"p10)+"
")p10

Try it online!

Answer 8

Hodor, 240 bytes

hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");hodor.hod("**********");

Try it online!

I'm not good at Hodor

Answer 9

shortC, 33 bytes

AOIa=0;a<=10;a++)R"**********\n"}

Try it online!

Answer 10

tinylisp, 58 bytes

(d A(q((n *)(i n(i(disp *)0(A(s n 1)*))*
(A 9(q **********

Try it online!

We define a function A with two parameters: n is the number of iterations, and * is a row of asterisks (it will always be ten of them, but it saves bytes to pass that as an argument). If n is truthy (nonzero), we display the asterisk row (with trailing newline) and recurse with n minus 1. If n is falsey (zero), we simply return the asterisk row.

Calling the function with n = 9 results in 9 disp calls; the return value of the function is then displayed, giving us our 10th row.

Answer 11

Python 3, 23 bytes

Prints an extra newline at the end

print(f'{"*"*10}\n'*10)

Try it online!

Answer 12

Python 3, 23 bytes

print(("*"*10+"\n")*10)

Felt like entering a Python 3 program too.

Answer 13

Python 3, 23 bytes

print(('*'*10+'\n')*10)

Try it online!

(Note: new to codegolf and stackexchange in general, this is my first attempt at any code-golfing challenge)

Edit: this is a pretty generic answer, and pretty boring too, although valid and pretty short.

Answer 14

Kotlin, 34 bytes

println("**********\n".repeat(10))

Try it online!

Answer 15

Carrot, 10 9 bytes

*^*9^
^*9

Try it online! (copy & paste only)

*^                //pushes "*" to the stack
*9                //add 9 more copies of itself
                  //stack = "**********"
^\n^              //append a newline to it
*9                //add 9 more copies of the resulting string
                  //implicit output

Answer 16

Triangular , 28 bytes

A\(A@1].p-p..pA@...](/*76-1<

Try it online!

Expanded version:

       A 
      \ ( 
     A @ 1 
    ] . p - 
   p . . p A 
  @ . . . ] ( 
 / * 7 6 - 1 < 

Commands executed, excluding directional commands:

A(1-A(1-67*@p]A@pp]

Answer 17

Bits, 191 bits = 23.875 bytes

00000000000000000000000000000000000000000000000000000000000011100010110000011111011001111101100111110110011111011001111101100111110110011111011001111101100111110110011111011001110000011100011

Explained

• The long string of 0s at the start is to make a string of length 10. (This is the only way to start a for loop in Bits)
• 11100010 starts the for loop:
  • 1100000 is a separator so the strings don't join together
  • 1111101100 is the code for a *. We repeat this 10 times to get **********. (Note: this is the only way to repeat a string in Bits)
  • 11100000 prints the string
• 11100011 closes the for loop

Screenshot

Answer 18

TacO, 25 bytes

0 01
1  *"*"
*###"\n"
w
@

Explaination

The program is a 2D program which can be broken up as so:

@       ; Program Entry
w       ; Write the result of everything STDOUT concatenated together
*10     ; Repeat 10 times
  *10   ; Repeat 10 times
    "*" ; Append "*"
  "\n"  ; Append a newline

Or the psudocode:

write(repeat(10,repeat(10,"*")+"\n")

Try it online!

Answer 19

Vyxal 3 j, 5 bytes

₅•×₀÷

Try it Online!

RIP -H flag and squarify strings which could make this 3 bytes

Answer 20

C++, 76 bytes

I don't know if this could be golfed further, but just.

#include <iostream>
void a(){for(int i=0;i++<10;)std::cout<<"**********\n";}

Answer 21

C# - 88 bytes

class P{static void Main(){int i=0;while(i++<10)System.Console.Write("**********\n");}}

Answer 22

Perl, 24 bytes

print((("*"x10).$/)x10);

Answer 23

Javascript (using external library - Enumerable) (41 bytes)

_.From("**********\n").Cycle(120).Write()

Link to lib: https://github.com/mvegh1/Enumerable/

Code explanation: This runs right in the console. Load the string into the library, which parses it to a char array enumerable. Create a new enumerable from that sequence, which is generated by cycling from start to finish 120 times (because the string length is 12, and we want 10 of them..12*10=120). I.e [1,2,3].Cycle(10) would be 1,2,3,1,2,3,1,2,3,1. Finally, join everything into a string with "" as delimiter

Answer 24

Ruby, 18 bytes

puts (?**10+$/)*10

Alternative version (+3 bytes)

10.times {puts ?**10}

Ungolfed (first version)

puts ('*' * 10 + '\n') * 10

Answer 25

Swift 2, 45 Bytes

func a(){for _ in 0...9{print("**********")}}

Answer 26

Wolfram, 22 bytes

Grid[Table["*",10,10]]

Answer 27

R

matrix(rep("*",100), nrow = 10)

Probably faster way in R, but fun utilization of matrix

Explanation

rep: repeats first argument as many times as second argument.

matrix: creates matrix from vector (first argument), and nrow is the number rows desired in matrix.

Answer 28

Javascript, 45 bytes

for(i=0;i<10;i++) {console.log('**********')}

even better, ES6 Javascript, 38 bytes

console.log('**********\n'.repeat(10))

open console and copy paste to test

Answer 29

Japt, 10 bytes

'*pA +R pA

Prints * ten times, then \n, then repeat from the beginning ten times.

Demo.

Answer 30

Arcyóu, 21 bytes

(* "**********\n" 10)

Try it online!