Produce a m*n table in HTML

Question

Input :

Two decimal integers m and n that respectively give the number of rows and columns of the table. m and n are greater than or equal to 1.

Output :

A table in HTML that has m rows and n columns.

The table should be displayable by a modern browser of your choice. Most browsers will display everything properly even if tags are not closed. Proper indentation and spacing is optional.

There should be at least one (non-whitespace) printable character in each cell.

Cells on the first line should use <th> tags while the ones on the following lines should use <td>tags.

Win condition :

This is code-golf so the shortest source-code for each language wins.

Input example :

2 3

Output example :

<table>
 <tr>
   <th>A</th>
   <th>A</th>
   <th>A</th>
 </tr>
 <tr>
   <td>A</td>
   <td>A</td>
   <td>A</td>
 </tr>
</table>

or : <table><tr><th>A<th>A<th>A<tr><td>A<td>A<td>A

Comments are not for extended discussion; this conversation has been moved to chat. — user45941, Commented May 9, 2018 at 13:21

Community · Accepted Answer · 2020-06-17 09:04:33Z

7

JavaScript (ES6), 70 bytes

Saved 2 bytes thanks to @RickHitchcock

Takes input in currying syntax (m)(n).

m=>n=>'<table>'+(g=c=>'<tr>'+`<t${c}>A`.repeat(n))`h`+g`d`.repeat(m-1)

Try it online!

Demo

f=

m=>n=>'<table>'+(g=c=>'<tr>'+`<t${c}>A`.repeat(n))`h`+g`d`.repeat(m-1)

O.innerHTML = f(2)(3)

<div id=O></div>

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 7, 2018 at 15:07

Arnauld

198k20 gold badges179 silver badges649 bronze badges

Add a comment |

Adám · Accepted Answer · 2018-05-08 05:19:18Z

APL (Dyalog Unicode) with MiServer 3.0, 31 30 bytes^SBCS

Full program. Prompts stdin for the two-element list [m,n] and prints strict XHTML to stdout.

(⎕NEW _.Table((⎕⍴0)⍬1)).Render

Example session:

      )xload C:\Users\Adam.DYALOG\Documents\MiServer\miserver.dws
C:\Users\Adam.DYALOG\Documents\MiServer\miserver.dws saved Wed Mar  7 17:19:40 2018
      Load ''
Development environment loaded
MiSite "C:/Users/Adam.DYALOG/Documents/MiServer/MS3/" loaded
      (⎕NEW _.Table((⎕⍴0)⍬1)).Render
⎕:
      2 3
<table id="id691498143"><thead><tr><th>0</th><th>0</th><th>0</th></tr></thead><tbody><tr><td>0</td><td>0</td><td>0</td></tr></tbody></table>

Try it online!

Explanation:

(…).Render Render the following HTML element:

⎕NEW _.Table (…) a new Table with the following parameters:

(…) ⍬ 1 the following content, no special styling, 1 header row:

⎕⍴0 evaluated input reshapes zero (i.e. an m-row, n-column matrix of zeros)

lynn · Accepted Answer · 2018-05-07 15:59:20Z

5

Python 2, 57 bytes

lambda m,n:'<table><tr>'+'<th>A'*n+('<tr>'+'<td>A'*n)*~-m

Try it online! Assumes m isn't zero.

answered May 7, 2018 at 15:59

lynn

69.2k11 gold badges133 silver badges283 bronze badges

Add a comment |

dzaima · Accepted Answer · 2018-05-07 17:56:32Z

5

Canvas, 31 bytes

<ŗ>
table⁸ｏ╶［tr⁸⁶｛¹１≡╵dh＠t×⁸；｝］

Try it here! or Try it visualized!

After fixing 2 bugs (ಠ_ಠ) in the interpreter, 30 bytes works too

edited May 7, 2018 at 17:56

answered May 7, 2018 at 14:52

dzaima

20.3k2 gold badges41 silver badges75 bronze badges

Add a comment |

l4m2 · Accepted Answer · 2024-05-15 02:37:49Z

4

JavaScript, 62 bytes

f=

n=>g=m=>m?g(--m)+"<tr>"+`<t${m?"d":"h"}>A`.repeat(n):"<table>"

document.write(f(4)(5));

-3 from noodle man, changing calling convention.

edited May 15 at 2:37

answered May 8, 2018 at 0:49

l4m2

28.3k2 gold badges25 silver badges103 bronze badges

\$\begingroup\$ recursion. nice! \$\endgroup\$
– mazzy
Commented Jun 10, 2018 at 9:01
\$\begingroup\$ 62 bytes with currying: n=>g=m=>m?g(--m)+"<tr>"+`<t${m?"d":"h"}>A`.repeat(n):"<table>" ATO (found independently but it ended up basically the same as yours) \$\endgroup\$
– noodle person
Commented May 15 at 2:17

Add a comment |

Emigna · Accepted Answer · 2018-05-07 16:03:49Z

05AB1E, 30 bytes

’<…È>’sF"<tr>"„hdNĀè"<tÿ>A"I×J

Try it online!

Explanation

’<…È>’                           # push "<table>"
      sF                         # no-of-rows times do:
        "<tr>"                   # push "<tr>"
              „hd                # push "hd"
                 NĀ              # push the iteration counter truthified
                   è             # index into the 2-char string with this
                    "<tÿ>A"      # insert the result into the string "<tÿ>A" instead of ÿ
                           I×    # repeat this string no-of-columns times
                             J   # join the stack to a single string

recursive · Accepted Answer · 2018-05-07 19:22:17Z

2

Stax, 28 bytes

üÉ$♠═?S┼╪├8°‼←sí☼←T≡┴╜ô‼\↑0ⁿ

Run and debug it

Unpacked, ungolfed, and commented, it looks like this.

"<table>"P  print "table"
"<th>A"*    "<th>A" repeated specified number of times
,D          repeat the rest of the program specified number of times
  "<tr>"p   print "<tr>" with no newline
  Q         print top of stack without popping
  .hd|t     replace "h" with "d"

Run this one

edited May 7, 2018 at 19:22

answered May 7, 2018 at 19:07

recursive

10.4k20 silver badges36 bronze badges

Add a comment |

ASCII-only · Accepted Answer · 2018-05-07 22:18:01Z

2

Charcoal, 33 bytes

<table><tr>×<th>AηＦ⊖θ«<tr>×<td>Aη

Try it online!

Explanation

<table><tr>                         Print "<table><tr>"
           ×<th>Aη                  Print "<th>A" * second input
                  Ｆ⊖θ«            For i in (implicit) range over first input
                        <tr>        Print("<tr>")
                            ×<td>Aη Print("<td>A") * second input

answered May 7, 2018 at 22:18

ASCII-only

5,14921 silver badges43 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

2

Java 10, 139 133 102 bytes

m->n->{var r="<table>";for(int j=0,i;j++<m;)for(r+="<tr>",i=n;i-->0;r+=j<2?"<th>A":"<td>B");return r;}

Try it online.

Explanation:

n->m->{                  // Method with two integer parameters and String return-type
  var r="<table>";       //  Result-String, starting at "<table>"
  for(int j=0,i;j++<m;)  //  Loop `j` over the rows in the range [0, `m`)
    for(r+="<tr>",       //   Append "<tr>" to the result
        i=n;i-->0;       //   Inner loop `i` over the columns in the range [`n`, 0)
      r+=j<2?            //    If `j` is 1 (first iteration):
          "<th>A"        //     Append "<th>A" to the result
         :               //    Else:
          "<td>B");      //     Append "<td>B" to the result
  return r;}             //  Return the result

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 7, 2018 at 14:58

Kevin Cruijssen

131k13 gold badges144 silver badges384 bronze badges

\$\begingroup\$ I think there's a little typo, you wrote "th" twice. \$\endgroup\$
– potato
Commented May 7, 2018 at 17:44
\$\begingroup\$ @potato Ah, you're right. The code itself and the TIO-link were correct, but my explanation had a typo. Should be fixed now, thanks. \$\endgroup\$
– Kevin Cruijssen
Commented May 8, 2018 at 6:50
\$\begingroup\$ (m,n)->{var l="<tr>";for(;n-->0;)l+="<td>A";var s="<table>"+l.replace('d','h');for(;--m>0;)s+=l;return s;} (106 bytes) I found this one interesting, but not worth it given your current score. You probably can golf a bit your answer using ideas here like the mutable m. \$\endgroup\$
– Olivier Grégoire
Commented May 8, 2018 at 9:24
\$\begingroup\$ @OlivierGrégoire I initially had a modifiable m, but due to the <th>/<td> differences it wouldn't matter. I still need to check whether it's the first iteration of the outer loop, in which case I need both j and m, and I need to do the inner loop multiple times, in which case I need i and n. Instead of going upwards from 0 and checking j<2 I could go backwards and check i>m-2, but it would be +1 byte instead of -1. Your approach of using two separated loops with modifiable m and n is indeed interesting, though. :) \$\endgroup\$
– Kevin Cruijssen
Commented May 8, 2018 at 9:37

Add a comment |

Adám · Accepted Answer · 2018-05-08 07:08:58Z

2

APL (Dyalog Unicode), 42 38 bytes^SBCS

-4 thanks to ngn.

Full program. Prompts stdin for the two-element list [m,n] and prints unclosed tags to stdout.

'<table>',∊'<tr>',⍤1{'d'}@3⍀⎕⍴⊂'<th>A'

Try it online!

⊂'<th>A' enclose this string to treat it as a whole

⎕⍴ prompt for dimensions and cyclically reshape the single cell to a matrix of that size

…⍀ cumulatively insert the following function between each vertical pair of cells:

{'d'}@3 ignore upper cell; place d at 3rd position in bottom cell

'<tr>',⍤1 prepend this string each row

∊ ϵnlist (flatten)

'<table>', prepend this string

edited May 8, 2018 at 7:08

answered May 7, 2018 at 16:55

Adám

31.1k3 gold badges124 silver badges287 bronze badges

\$\begingroup\$ 'd'⎕R'h' -> 'h'@3 \$\endgroup\$
– ngn
Commented May 8, 2018 at 0:10
\$\begingroup\$ (⊂'<tr>'), -> '<tr>',⍤1 and ...@1 -> ...⍀ \$\endgroup\$
– ngn
Commented May 8, 2018 at 0:19
\$\begingroup\$ @ngn All done. Thanks. Relevant. \$\endgroup\$
– Adám
Commented May 8, 2018 at 7:09

Add a comment |

LambdaBeta · Accepted Answer · 2018-05-08 20:11:21Z

2

C (gcc), 107 99 98 97 bytes

i;f(x,y){char s[]="<th>A";for(puts("<table><tr>");x--;s[2]=96+puts("<tr>"))for(i=y;i--;)puts(s);}

Try it online!

-8 bytes thanks to potato

-2 bytes thanks to ceilingcat

The s array has to be declared as an array not a pointer otherwise it won't be editable (we set the first h to a d). Most browsers don't even care if your closing tag is correct, so we just close all tags with </t>.

edited May 8, 2018 at 20:11

answered May 7, 2018 at 15:44

LambdaBeta

2,76912 silver badges20 bronze badges

\$\begingroup\$ Still works fine if you remove the </t> that appears twice and -8 bytes. \$\endgroup\$
– potato
Commented May 7, 2018 at 17:48
\$\begingroup\$ You can shave 4 more bytes off if you move outputting the new row to the inner loop (also, it avoids an empty row): Try it online! \$\endgroup\$
– ErikF
Commented May 8, 2018 at 22:58

Add a comment |

JayCe · Accepted Answer · 2018-05-16 16:09:48Z

2

R, 73 bytes

function(n,m)cat("<table><tr>","<th>A"<m,c("<tr>","<td>A"<m)<n-1)
"<"=rep

Try it online!

Saved 7 bytes with a dirty hack - replace "rep" by "<".

edited May 16, 2018 at 16:09

answered May 7, 2018 at 17:02

JayCe

3,01312 silver badges17 bronze badges

Add a comment |

Jeff Freeman · Accepted Answer · 2018-06-11 16:27:04Z

2

PowerShell Core, 72 68 bytes

Function F($m,$n){'<table><tr>'+'<th>A'*$n+('<tr>'+'<td>A'*$n)*--$m}

Try it online!

Here are my test cases and expected outputs (C.f., TIO)

m=2; n=3 <table><tr><th>A<th>A<th>A<tr><td>A<td>A<td>A
m=1; n=3 <table><tr><th>A<th>A<th>A
m=4; n=2 <table><tr><th>A<th>A<tr><td>A<td>A<tr><td>A<td>A<tr><td>A<td>A
m=2; n=8 <table><tr><th>A<th>A<th>A<th>A<th>A<th>A<th>A<th>A<tr><td>A<td>A<td>A<td>A<td>A<td>A<td>A<td>A

Thanks, @mazzy, for the -4 bytes!

edited Jun 11, 2018 at 16:27

answered May 7, 2018 at 21:10

Jeff Freeman

2311 silver badge5 bronze badges

1

\$\begingroup\$ Brackets are optional. Try Function F($m,$n){'<table><tr>'+'<th>A'*$n+('<tr>'+'<td>A'*$n)*--$m}. \$\endgroup\$
– mazzy
Commented Jun 10, 2018 at 6:58

Add a comment |

xigoi · Accepted Answer · 2023-03-13 16:29:35Z

Nibbles, 24 23.5 22 21.5 bytes

;~"able"::"<t"$">".`,_:@"r"^_:@?$"d" "h"

Attempt This Online!

Takes arguments in the order cols rows. Outputs something like this (for 8 5):

<table><tr><th>0<th>0<th>0<th>0<th>0<th>0<th>0<th>0
<tr><td>1<td>1<td>1<td>1<td>1<td>1<td>1<td>1
<tr><td>2<td>2<td>2<td>2<td>2<td>2<td>2<td>2
<tr><td>3<td>3<td>3<td>3<td>3<td>3<td>3<td>3
<tr><td>4<td>4<td>4<td>4<td>4<td>4<td>4<td>4

Explanation

;~     Define function f(str)
"able"  and call it with str = "able":
:       join
:        join
"<t"      "<t"
$         str
">"      ">"
.      Map
`,      0...
_        number of rows
:       join
@        f
"r"       "r"
^        repeat
_         number of columns
:         join
@          f
?           if
$            row index is positive
"d"          then "d"
"h"          else "h"
           row index

manatwork · Accepted Answer · 2024-05-15 11:09:27Z

Gema, 74 characters

* <D>=<table><tr>@repeat{$2;<th>A}@repeat{@sub{*;1};<tr>@repeat{$2;<td>A}}

Producing the damaged HTML has nothing interesting.

Sample run:

bash-5.2$ gema '* <D>=<table><tr>@repeat{$2;<th>A}@repeat{@sub{*;1};<tr>@repeat{$2;<td>A}}' <<< '2 3'
<table><tr><th>A<th>A<th>A<tr><td>A<td>A<td>A

Try it online!

Gema, 97 characters

* *=<table>@r{1h$2}@r{@sub{$1;1}d$2}</table>
r:<D>?*=@repeat{$1;<tr>@repeat{*;<t$2>A</t$2>}</tr>}

But producing the complete HTML can be shortened by using domain.

Sample run:

bash-5.2$ gema '* *=<table>@r{1h$2}@r{@sub{$1;1}d$2}</table>;r:<D>?*=@repeat{$1;<tr>@repeat{*;<t$2>A</t$2>}</tr>}' <<< '2 3'
<table><tr><th>A</th><th>A</th><th>A</th></tr><tr><td>A</td><td>A</td><td>A</td></tr></table>

Try it online!

Angs · Accepted Answer · 2018-05-07 17:02:58Z

1

Haskell, 109 107 103 bytes

n!i="<t"++n++'>':i++"</t"++n++">"
r#c="able"!("r"!([1..c]*>"h"!"H")++([2..r]*>("r"!([1..c]*>"d"!"A"))))

So many parentheses… Thanks to @nimi for two bytes (and a loss of genericity)!

Try it online!

Without end tags the straight implementation wins at 87 bytes (Try it online):

r?c="<table><tr>"++([1..c]*>"<th>H")++([2..r]*>("<tr>"++([1..c]*>"<td>A")))++"</table>"

edited May 7, 2018 at 17:02

answered May 7, 2018 at 16:30

Angs

4,9872 gold badges16 silver badges36 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

APL+WIN, 68 63 56 bytes

12 bytes in total saved thanks to Adám

Prompts for number of rows followed by number of columns and outputs non-closure option:

t←⊂'<tr>'⋄'<table>'t(n⍴⊂'<th>A'),,t,((⎕-1),n←⎕)⍴⊂'<td>A'

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 7, 2018 at 15:39

Graham

6,8461 gold badge15 silver badges11 bronze badges

\$\begingroup\$ @Adám Too trigger happy I am afraid. Looks OK now? \$\endgroup\$
– Graham
Commented May 7, 2018 at 15:47
\$\begingroup\$ Yes, but you don't need the ∊ or the trailing parens: t,,((⎕-1),n←⎕)⍴r or the first two commas. \$\endgroup\$
– Adám
Commented May 7, 2018 at 15:48
\$\begingroup\$ @Adám Thanks. Its not my day must be the heat (28C)! \$\endgroup\$
– Graham
Commented May 7, 2018 at 16:01
\$\begingroup\$ Merge h and r into the main expression: '<table>'t(n⍴⊂'<th>A')t,,((⎕-1),n←⎕)⍴⊂'<td>A' \$\endgroup\$
– Adám
Commented May 7, 2018 at 16:34
\$\begingroup\$ Something isn't right. You only insert one <tr> for the body. Each row needs a <tr>. \$\endgroup\$
– Adám
Commented May 7, 2018 at 16:36

| Show 3 more comments

Neil · Accepted Answer · 2018-05-07 20:54:30Z

1

Retina, 56 54 bytes

(.+) (.+)
<table>$1*$(<tr>$2*$(<td>@
T`\d`\h`^.*?r.*?r

Try it online! Edit: Saved 2 bytes thanks to @CowsQuack. Explanation: The first stage uses Retina 1's string multiplication first to generate the appropriate number of cells, then to generate the appropriate number of rows. The second stage then changes the first row of tds into ths.

edited May 7, 2018 at 20:54

answered May 7, 2018 at 15:55

Neil

177k12 gold badges74 silver badges281 bronze badges

\$\begingroup\$ If you know the input is going to be split by spaces, then you should be able to use . instead of \d \$\endgroup\$
– user41805
Commented May 7, 2018 at 18:19

Add a comment |

Alex Shroyer · Accepted Answer · 2018-05-08 15:43:53Z

1

K, 58 bytes

K version is whatever is included in KDB+ 3.5 2017.11.30.

Port of the Python answer above. Ends up being 1 byte longer due to having to enlist and flatten multiple times.

{,/"<table><tr>",(y#,"<th>A"),(x-1)#,("<tr>",/y#,"<td>A")}

answered May 8, 2018 at 15:43

Alex Shroyer

8388 silver badges8 bronze badges

Add a comment |

Xcali · Accepted Answer · 2018-05-08 16:21:15Z

1

Perl 5 `-p`, 65 54 bytes

-11 bytes thanks to @msh2108's reminder

/ /;$_="<table><tr>"."<th>A"x$'.('<tr>'.'<td>B'x$')x$`

Try it online!

edited May 8, 2018 at 16:21

answered May 7, 2018 at 17:31

Xcali

16.2k2 gold badges15 silver badges39 bronze badges

\$\begingroup\$ Save yourself some bytes. Per an example in the challenge, you can drop the .'</table>'. \$\endgroup\$
– msh210
Commented May 8, 2018 at 8:03

Add a comment |

Emanuel Vintilă · Accepted Answer · 2018-05-08 16:22:32Z

1

C# (.NET Core), 130 bytes

m=>n=>{var r="<table>";for(int i=0;i++<m;)r+="<tr>"+string.Concat(System.Linq.Enumerable.Repeat(i<2?"<th>H":"<td>D",n));return r;}

Try it online!

answered May 8, 2018 at 16:22

Emanuel Vintilă

1115 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Carrot, 77 51 bytes

<th>A^*$v<tr>vl+(^h)*($^F- 1)A"h"S"d"h+(^l)v<table>

(While working on this, I discovered a bug with h not working and fixed it)

Golfed some bytes by shortening the html as well as using "split, join" instead of "replace"

Try it online!, use the command-line option -d to see the AST (Note: this uses the new node interpreter, so the older version on the website cannot run this.)

This program takes the input 0-indexed and in reversed order, because of Carrot's weird nature, thus 3 2 printing a 3×4 table.

Run the program like so, ./carrot -f prog.carrot input.txt

Basically creates the header row, then the data rows on another cell of the garden (2D tape), and concatenates them together.

Carrot works on a 2D tape, called a garden. Each cell on the garden is made up of three stack modes, string, float, array. There is a value for each mode, called a "stack" (note: misnomer). These stacks begin empty. When a cell is at a particular mode, the following commands will affect the stack that corresponds to this mode, for example in float mode, the operations will affect the stack float. And of course, there are commands for switching between modes. The modes are important because each operator can be overloaded for each mode and each argument type.

In addition, there are two additional modes (these only affect the commands, not the stack directly), normal mode and caret mode. Normal mode works normally, where there are operators taking in arguments and affecting the stack directly. In caret mode, (almost) every character is interpreted literally as a string, and is later prepended/appended accordingly to the stack. Caret mode is started/ended with carets (append) or down-carets (prepend).

Carrot begins in a cell on the garden, in stack-string mode, and in caret mode.

Beginning in caret-mode, the string <th>A is added to the initially empty stack-string. Then follows the * command that duplicates it $, the input, times. Then <tr> is prepended to the stack-string by the usage of the down-caret v. This creates the header row of the table.

To create the data rows, we duplicate the header to another cell. l moves the IP to the right empty cell, and + appends (^h) the string in the cell to the left (essentially copying it to the cell on the right). () starts a subshell, a new Carrot program with almost the same tape, and ^ exits out of caret-mode so that we can h get the string in the left cell. This is then * duplicated by ($^F- 1), the next input minus 1, times.

Still in the right cell, A sets the array of this cell to its stack- tring split by "h". S joins the stack array by "d" and sets the stack string to this value. A"h"S"d" really just replaces hs with ds to form the data rows. Now h we move to the left starting cell.

Now we append the stack string of the cell to the right to this cell using +(^l). All that's remaining is to add the <table> tag, so we do this by v prepending it.

mazzy · Accepted Answer · 2018-06-10 10:27:30Z

Powershell, 63 bytes

$m,$n=$args;$t='h';'<table>';1..$m|%{'<tr>'+"<t$t>A"*$n;$t='d'}

save it as new-mntable.ps1. Test script:

.\new-mntable.ps1 2 3
.\new-mntable.ps1 1 3
.\new-mntable.ps1 4 2
.\new-mntable.ps1 2 8

output (extra spaces are optional):

<table>
<tr><th>A<th>A<th>A
<tr><td>A<td>A<td>A
<table>
<tr><th>A<th>A<th>A
<table>
<tr><th>A<th>A
<tr><td>A<td>A
<tr><td>A<td>A
<tr><td>A<td>A
<table>
<tr><th>A<th>A<th>A<th>A<th>A<th>A<th>A<th>A
<tr><td>A<td>A<td>A<td>A<td>A<td>A<td>A<td>A

Powershell, 65 bytes, `-replace`

'<table>h'+'d'*--$args[0]-replace'h|d',('<tr>'+'<t$0>A'*$args[1])

save it as new-mntable.ps1. Test script:

.\new-mntable.ps1 2 3
.\new-mntable.ps1 1 3
.\new-mntable.ps1 4 2
.\new-mntable.ps1 2 8

output:

<table><tr><th>A<th>A<th>A<tr><td>A<td>A<td>A
<table><tr><th>A<th>A<th>A
<table><tr><th>A<th>A<tr><td>A<td>A<tr><td>A<td>A<tr><td>A<td>A
<table><tr><th>A<th>A<th>A<th>A<th>A<th>A<th>A<th>A<tr><td>A<td>A<td>A<td>A<td>A<td>A<td>A<td>A

How it work:

'<table>h'+'d'*--$args[0] - create a string like <table>hddd...
'h|d'- search h or d chars in the string for replacing
'<tr>'+'<t$0>A'*$args[1] - replace each char with string like <tr><t$0>A<t$0>A...
where $0 is a captured group[0] - the char in the -replace.

Powershell, 65 bytes, `scriptblock`

$m,$n=$args;'<table>';&($r={'<tr>'+"<t$args>A"*$n})h;(&$r d)*--$m

save it as new-mntable.ps1. Test script:

.\new-mntable.ps1 2 3
.\new-mntable.ps1 1 3
.\new-mntable.ps1 4 2
.\new-mntable.ps1 2 8

output:

<table>
<tr><th>A<th>A<th>A
<tr><td>A<td>A<td>A
<table>
<tr><th>A<th>A<th>A

<table>
<tr><th>A<th>A
<tr><td>A<td>A<tr><td>A<td>A<tr><td>A<td>A
<table>
<tr><th>A<th>A<th>A<th>A<th>A<th>A<th>A<th>A
<tr><td>A<td>A<td>A<td>A<td>A<td>A<td>A<td>A

The Thonnu · Accepted Answer · 2023-03-12 12:27:48Z

Vyxal, 34 bytes

`<∨ø>`?(`<tr>`‛hdn1>i`<t%>A`$%⁰*Wṅ

Try it Online!

Port of Emigna's 05AB1E answer.

Explanation

`<∨ø>`         # Push "<table>"
      ?(       # Input number of times:
        `<tr>` #  Push "<tr>
‛hd            #  Push "hd"
   n1>         #  Is the loop variable
               #  greater than 1?
      i        #  Index into "hd"
       `<t%>A` #  Push "<t%>A"
$%             #  Replace "%" with
               #  either "h" or "d"
   ⁰*          #  Multiply this string
               #  by the second input
     Wṅ        #  Join the stack into a string
               #  Implicit output

bigyihsuan · Accepted Answer · 2023-03-13 21:24:49Z

1

Go, 130 123 bytes

func f(r,c int)(s string){for d,i:="<th>A",0;i<r;i++{if i>0{d="<td>A"}
s+="<tr>"
for j:=0;j<c;j++{s+=d}}
return"<table>"+s}

Attempt This Online!

-7 bytes from removing unused variable, condensing string literals (@xigoi)

edited Mar 13, 2023 at 21:24

answered Mar 13, 2023 at 19:45

bigyihsuan

10.8k1 gold badge23 silver badges66 bronze badges

\$\begingroup\$ What's the point of the R variable? The code seems to work without it. \$\endgroup\$
– xigoi
Commented Mar 13, 2023 at 20:24
\$\begingroup\$ Also, you can save 2 bytes by putting the "A" directly into the literals. \$\endgroup\$
– xigoi
Commented Mar 13, 2023 at 20:26

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Pyth, 40 bytes

J"<tr>"AQ"<table>"J*H"<th>A"*tGJ*H"<td>A

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 7, 2018 at 16:24

hakr14

5,0141 gold badge11 silver badges18 bronze badges

Add a comment |

vasilescur · Accepted Answer · 2018-05-07 17:10:13Z

0

Dart, 45 63 bytes

Working solution:

(m,n){print('<table><tr>'+'<th>A'*n+('<tr>'+'<td>A'*n)*(m-1));}

Try it online here!

Lambda/anonymous function taking m and n as parameters, displays output to STDOUT.

Since tables with unclosed <table>, <tr>, <th>, and <td> tags still render in modern browsers (ex., Chrome), the output is valid.

Old (broken) solution:

My first attempt forgot to switch to <td> after the first row:

(m,n){print('<table><tr>'+'<th>A'*n+('<tr>'+'<th>A'*n)*(m-1));}

Thanks to @Lynn for pointing that out.

edited May 7, 2018 at 17:10

answered May 7, 2018 at 15:35

vasilescur

3931 silver badge8 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

Google Sheets, 66 bytes

="<table><tr>"&Rept("<th>A",B1)&Rept("<tr>"&Rept("<td>A",B1),A1-1)

Input is in cell A1 and B1.
There's nothing fancy, really; it's just nested Rept functions.
It does assume m > n > 0 and that they're both integers.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 7, 2018 at 17:12

Engineer Toast

9,5291 gold badge23 silver badges53 bronze badges

Add a comment |

Jonathan Allan · Accepted Answer · 2018-05-07 17:18:27Z

0

Jelly, 33 32 bytes

“<td>A”ẋ”h3¦s5ẋ€ṭ€“<tr>”ṭ“¢ssɱU»

A full program taking rows, columns which prints the result.

Try it online!

hmm, also 32 using a table:

Ịị⁾hdṭ”t⁾<>j;ðþZṭ€“<tr>”ṭ“¢ssɱU»

edited May 7, 2018 at 17:18

answered May 7, 2018 at 15:13

Jonathan Allan

110k7 gold badges65 silver badges282 bronze badges

Add a comment |

Alex Shroyer · Accepted Answer · 2018-05-08 15:52:04Z

0

J, 64 bytes

Another port of the Python answer:

4 :0
'<table><tr>',(;y#<'<th>A'),;(<:x)#<('<tr>',(;y#<'<td>A'))
)

answered May 8, 2018 at 15:52

Alex Shroyer

8388 silver badges8 bronze badges

Add a comment |

Produce a m*n table in HTML

Input :

Output :

Win condition :

Input example :

Output example :

35 Answers 35

JavaScript (ES6), 70 bytes

Demo

APL (Dyalog Unicode) with MiServer 3.0, 31 30 bytesSBCS

Python 2, 57 bytes

Canvas, 31 bytes

JavaScript, 62 bytes

05AB1E, 30 bytes

Stax, 28 bytes

Charcoal, 33 bytes

Explanation

Java 10, 139 133 102 bytes

APL (Dyalog Unicode), 42 38 bytesSBCS

C (gcc), 107 99 98 97 bytes

R, 73 bytes

PowerShell Core, 72 68 bytes

Nibbles, 24 23.5 22 21.5 bytes

Explanation

Gema, 74 characters

Gema, 97 characters

Haskell, 109 107 103 bytes

APL+WIN, 68 63 56 bytes

Retina, 56 54 bytes

K, 58 bytes

Perl 5 -p, 65 54 bytes

C# (.NET Core), 130 bytes

Carrot, 77 51 bytes

Powershell, 63 bytes

Powershell, 65 bytes, -replace

Powershell, 65 bytes, scriptblock

Vyxal, 34 bytes

Explanation

Go, 130 123 bytes

Pyth, 40 bytes

Dart, 45 63 bytes

Working solution:

Old (broken) solution:

Google Sheets, 66 bytes

Jelly, 33 32 bytes

J, 64 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfcode-generation or ask your own question.

Linked

Related

Hot Network Questions

APL (Dyalog Unicode) with MiServer 3.0, 31 30 bytes^SBCS

APL (Dyalog Unicode), 42 38 bytes^SBCS

Perl 5 `-p`, 65 54 bytes

Powershell, 65 bytes, `-replace`

Powershell, 65 bytes, `scriptblock`

Not the answer you're looking for? Browse other questions tagged
code-golf
code-generation
or ask your own question.