Make me a s'more!

Question

Make me a s'more! I tell you the width, the amount of graham cracker, the amount of chocolate, and the amount of marshmallow. An example:

Input:

Width: 10 Graham: 3 Chocolate: 2 Marshmallow: 1.

Output:

GGGGGGGGGG
GGGGGGGGGG
GGGGGGGGGG
CCCCCCCCCC
CCCCCCCCCC
MMMMMMMMMM
GGGGGGGGGG
GGGGGGGGGG
GGGGGGGGGG

Is it that easy? Um... yes.

Note that the input should be a list of arguments to a function or a program, not a string. You might choose the first being Width, then Graham, but any order is fine.

Full test cases if you are interested.

Stack snippet (for testing, etc.)

This is to test the output.

var smore = function(width, graham, chocolate, marshmallow){
	return ("G".repeat(width) + "\n").repeat(graham) + 
	("C".repeat(width) + "\n").repeat(chocolate) + 
	("M".repeat(width) + "\n").repeat(marshmallow) + 
	("G".repeat(width) + "\n").repeat(graham);
};
Snippetify(smore);

<script src="https://programmer5000.com/snippetify.min.js"></script>
Width: <input type = "number">
Graham: <input type = "number">
Chocolate: <input type = "number">
Marshmallow: <input type = "number">
<button>Try it out!</button>
<pre data-output></pre>

Notes:

You may include a trailing newline on the end of the last line. You may also use a \ instead of a newline.
This is code-golf.
Any questions? Comment below:

I edited out your Let Me Google That For You link. It really wasn't funny. — Level River St, Commented Apr 17, 2017 at 13:47
Some answers are assuming flexible input order and format (as usual in PPCG), but the challenge seems to require a specific order and rule out strings (not sure what that means). Can you clarify? — Luis Mendo, Commented Apr 17, 2017 at 14:34
Thanks for clarifying. You should then reword the sentence the input should be a list of arguments to a function or a program, not a string, with the first being Width, then Graham, etc. Personally I would say something like "Input format is flexible as usual" — Luis Mendo, Commented Apr 17, 2017 at 14:36
@programmer5000 but why? If they downvoted, it's 90% likely it's because they think it's a boring and trivial challenge. Furthermore, it's quite rude to tell people to explain or retract. They have the right to downvote without comment. — Riker, Commented Apr 17, 2017 at 16:12

Felipe Nardi Batista · Accepted Answer · 2017-10-09 13:49:46Z

13

Python 2, 73 48 bytes

lambda w,g,c,m:zip(*['G'*g+'C'*c+'M'*m+'G'*g]*w)

Try it online!

Creates a transposed version of the answer, than transposes it to the correct format with zip(*l)

edited Oct 9, 2017 at 13:49

answered Apr 17, 2017 at 13:52

Felipe Nardi Batista

2,4211 gold badge14 silver badges32 bronze badges

Add a comment |

Magic Octopus Urn · Accepted Answer · 2017-04-17 15:38:05Z

7

05AB1E, 21 19 19 bytes

"GCMG"S×|D«‚øvy`.D»

Try it online!

-2 thanks to my oversight and Emigna.

"GCMG"S×            # Push GCMG, separate, duplicate n times.
        |D«         # Push rest of inputs, doubled.
           ‚ø       # Wrap GCMG array and input array, then zip them into pairs.
             vy`.D» # For each pair, print n of G/C/M/G.

(See Emigna's answer, it's better: https://codegolf.stackexchange.com/a/116787/59376)

edited Apr 17, 2017 at 15:38

answered Apr 17, 2017 at 13:54

Magic Octopus Urn

20.8k5 gold badges62 silver badges136 bronze badges

1

\$\begingroup\$ You seem to have accidentally left a © in there. \$\endgroup\$
– Emigna
Commented Apr 17, 2017 at 14:31
1

\$\begingroup\$ You could also replace ¬¸ with D as the extra elements are lost when you zip. \$\endgroup\$
– Emigna
Commented Apr 17, 2017 at 14:33
\$\begingroup\$ @Emigna I both like and hate that functionality. \$\endgroup\$
– Magic Octopus Urn
Commented Apr 17, 2017 at 14:56
\$\begingroup\$ Yes, it's often very annoying but now and then (like now) it becomes useful :) \$\endgroup\$
– Emigna
Commented Apr 17, 2017 at 14:57
\$\begingroup\$ "GCMG" can be …GCMĆ for -1 (although I've also just posted a 14-byter with a different approach). \$\endgroup\$
– Kevin Cruijssen
Commented Jan 29, 2020 at 10:14

Add a comment |

Emigna · Accepted Answer · 2017-04-17 15:47:05Z

7

05AB1E, 17 16 bytes

1 bytes saved thanks to carusocomputing.

"GCMG"S×vy²Nè.D»

Try it online!

Input order is W, [G,C,M]

Explanation

10, [3,2,1] used as example.

"GCMG"S           # push the list ['G','C','M','G']
       ×          # repeat each W times
                  # STACK: ['GGGGGGGGGG', 'CCCCCCCCCC', 'MMMMMMMMMM', 'GGGGGGGGGG']
        v         # for each [string, index] y,N in the list
          ²Nè     # get the amount of layers at index N from the [G,C,M] list
         y   .D   # duplicate the string y that many times
               »  # join strings by newlines

edited Apr 17, 2017 at 15:47

answered Apr 17, 2017 at 14:56

Emigna

53k5 gold badges42 silver badges162 bronze badges

1

\$\begingroup\$ "GCMG"S×vy²Nè.D» wonder-twin powers, activate! Form of, 05AB1E code! Also, arguments get swapped, but it's still 16. \$\endgroup\$
– Magic Octopus Urn
Commented Apr 17, 2017 at 14:59
\$\begingroup\$ @carusocomputing: It has the benefit of not leaving unprinted crap on the stack, but it seems similarly irreducible to me. \$\endgroup\$
– Emigna
Commented Apr 17, 2017 at 15:04
1

\$\begingroup\$ It's still 1 byte less and will beat your tie with MATL ;). \$\endgroup\$
– Magic Octopus Urn
Commented Apr 17, 2017 at 15:37
\$\begingroup\$ @carusocomputing: Oooh, when did that happen? I was sure it was 17 when I saw it. Nice! ;) \$\endgroup\$
– Emigna
Commented Apr 17, 2017 at 15:41
\$\begingroup\$ I often post stupid stuff and make edits to it 1 minute after I realize I'm being an idiot. \$\endgroup\$
– Magic Octopus Urn
Commented Apr 17, 2017 at 17:14

| Show 1 more comment

darrylyeo · Accepted Answer · 2017-04-17 21:28:03Z

7

JavaScript (ES6), 71 bytes

(W,G,C,M)=>[...'GCMG'].map(X=>`${X.repeat(W)}
`.repeat(eval(X))).join``

Woohoo, beat 3 other JavaScript answers!

f=
(W,G,C,M)=>[...'GCMG'].map(X=>`${X.repeat(W)}
`.repeat(eval(X))).join``

console.log(
    f(10, 3, 2, 1)
)

edited Apr 17, 2017 at 21:28

answered Apr 17, 2017 at 21:22

darrylyeo

7,91720 silver badges44 bronze badges

\$\begingroup\$ Nice, very nice - gets my vote. \$\endgroup\$
– Shaggy
Commented Apr 17, 2017 at 22:00

Add a comment |

Luis Mendo · Accepted Answer · 2017-04-17 14:42:15Z

MATL, 17 bytes

'GCMG'iK:)Y"!liX"

Input format is: first input [G, C, M], second input W.

Try it online!

Explanation with example

Consider inputs [3 2 1] and 10.

'GCMG' % Push this string
       % STACK: 'GCMG'
i      % Take first input: array of three numbers
       % STACK: 'GCMG', [3 2 1]
K:     % Push [1 2 3 4]
       % STACK: 'GCMG', [3 2 1], [1 2 3 4]
)      % Index (modular, 1-based). This repeats the first entry of the input array
       % STACK: 'GCMG', [3 2 1 3]
Y"     % Run-length decoding
       % STACK: 'GGGCCMGGG'
!      % Transpose. Gives a column vector of chars
       % STACK: ['G'; 'G'; 'G'; 'C'; 'C'; 'M'; 'G'; 'G'; 'G']
l      % Push 1
       % STACK: ['G'; 'G'; 'G'; 'C'; 'C'; 'M'; 'G'; 'G'; 'G'], 1
i      % Take second input: number
       % STACK: ['G'; 'G'; 'G'; 'C'; 'C'; 'M'; 'G'; 'G'; 'G'], 1, 10
X"     % Repeat the specified numbers of times along first and second dimensions
       % STACK: ['GGGGGGGGGG';'GGGGGGGGGG';'GGGGGGGGGG';'CCCCCCCCCC';...;'GGGGGGGGGG']
       % Implicitly display

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

C#, 204 bytes

Golfed

(w,g,c,m)=>{string G="\n".PadLeft(++w,'G'),C="\n".PadLeft(w,'C'),M="\n".PadLeft(w,'M'),o="".PadLeft(g,'G');o+="".PadLeft(m,'M')+"".PadLeft(c,'C')+o;return o.Replace("G",G).Replace("C",C).Replace("M",M);};

Ungolfed

( w, g, c, m ) => {
   string
      G = "\n".PadLeft( ++w, 'G' ),
      C = "\n".PadLeft( w, 'C' ),
      M = "\n".PadLeft( w, 'M' ),
      o = "".PadLeft( g, 'G' );
      
   o +=
      "".PadLeft( m, 'M' ) +
      "".PadLeft( c, 'C' ) +
      o;
   
   return o
      .Replace( "G", G )
      .Replace( "C", C )
      .Replace( "M", M );
};

Ungolfed readable

// Function with 4 parameters
//   w : Width
//   g : Graham
//   c : Chocolate
//   m : Marshmallow
( w, g, c, m ) => {
   
   // Initialization of vars with the contents
   //    of each line, with a new line at the end
   string
      G = "\n".PadLeft( ++w, 'G' ),
      C = "\n".PadLeft( w, 'C' ),
      M = "\n".PadLeft( w, 'M' ),
      
      // Trick to reduce the byte count
      //   Initialize the output with n 'G's
      o = "".PadLeft( g, 'G' );
      
   // Add again n 'M's and n 'C's
   //   Append the 'G's at the end.
   o +=
      "".PadLeft( m, 'M' ) +
      "".PadLeft( c, 'C' ) +
      o;
   
   // Replce every instance of 'G'/'C'/'M'
   //    with the full line
   return o
      .Replace( "G", G )
      .Replace( "C", C )
      .Replace( "M", M );
};

Full code

using System;
using System.Collections.Generic;

namespace Namespace {
   class Program {
      static void Main( String[] args ) {
         Func<Int32, Int32, Int32, Int32, String> f = ( w, g, c, m ) => {
            string
               G = "\n".PadLeft( ++w, 'G' ),
               C = "\n".PadLeft( w, 'C' ),
               M = "\n".PadLeft( w, 'M' ),
               o = "".PadLeft( g, 'G' );
               
            o +=
               "".PadLeft( m, 'M' ) +
               "".PadLeft( c, 'C' ) +
               o;
            
            return o
               .Replace( "G", G )
               .Replace( "C", C )
               .Replace( "M", M );
         };

         List<Tuple<Int32, Int32, Int32, Int32>>
            testCases = new List<Tuple<Int32, Int32, Int32, Int32>>() {
               new Tuple<Int32, Int32, Int32, Int32>( 1, 1, 1, 1 ),
               new Tuple<Int32, Int32, Int32, Int32>( 1, 1, 1, 2 ),
               new Tuple<Int32, Int32, Int32, Int32>( 1, 1, 2, 1 ),
               //
               // ...
               //
               // The link above contains the code ready to run
               //    and with every test from the pastebin link
               //
               // Yes, it contains 342 tests ready to run.
               //
               // I can barely fit every test on a 1080p screen...
               //    ... and there's 6 tests per line... Jebus...
               //
            };
         
         foreach( var testCase in testCases ) {
            Console.WriteLine( $"Input:\nWidth: {testCase.Item1,3} Graham: {testCase.Item2,3} Chocolate: {testCase.Item3,3} Marshmellow: {testCase.Item4,3}\nOutput:\n{f( testCase.Item1, testCase.Item2, testCase.Item3, testCase.Item4 )}\n" );
         }

         Console.ReadLine();
      }
   }
}

Releases

v1.0 - 204 bytes - Initial solution.

Notes

Looking for a picture of my beautiful test screen?
On a second thought, CSharpPad can't handle those tests, here's a version with fewer tests

\$\begingroup\$ Appreciated! :D \$\endgroup\$
– auhmaan
Commented Apr 17, 2017 at 15:04 — auhmaan, Commented Apr 17, 2017 at 15:04

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

5

Ruby, 47 bytes

->w,g,c,m{puts r=[?G*w]*g,[?C*w]*c,[?M*w]*m,r}

thanks to ventero

Ruby, 51 bytes

->w,g,c,m{(?G*g+?C*c+?M*m+?G*g).chars{|i|puts i*w}}

Call like this:

f=->w,g,c,m{(?G*g+?C*c+?M*m+?G*g).chars{|i|puts i*w}}

f[10,3,2,1]

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 17, 2017 at 14:06

Level River St

26.5k4 gold badges37 silver badges105 bronze badges

\$\begingroup\$ ->w,g,c,m{puts r=[?G*w]*g,[?C*w]*c,[?M*w]*m,r} is a bit shorter \$\endgroup\$
– Ventero
Commented Apr 17, 2017 at 19:12

Add a comment |

AdmBorkBork · Accepted Answer · 2017-04-17 14:24:29Z

PowerShell, 49 bytes

$a,$b=$args;0..2+0|%{,("$('GCM'[$_])"*$a)*$b[$_]}

Try it online!

Takes input as four command-line arguments, width graham chocolate marshmallow, stores the first into $a and the rest into $b (implicitly as an array). Loops from over the range 0,1,2,0. Each loop, we index into string GCM, re-cast that char as a string, and multiply it out by $a (the width), and then using the comma-operator ,, turns that into an array by multiplying the appropriate index of $b (i.e., how many layers). Those resultant string arrays are all left on the pipeline and output is implicit, with a newline between elements.

Steadybox · Accepted Answer · 2017-04-18 21:10:21Z

4

C, 108 105 bytes

Thanks to @Quentin for saving 3 bytes!

#define F(i,c)for(;i--;puts(""))for(j=w;j--;)putchar(c);
i,j;f(w,g,c,m){i=g;F(i,71)F(c,67)F(m,77)F(g,71)}

Try it online!

edited Apr 18, 2017 at 21:10

answered Apr 17, 2017 at 14:09

Steadybox

16.5k5 gold badges40 silver badges84 bronze badges

1

\$\begingroup\$ #define F(i,c)for(;i--;puts(""))for(j=w;j--;)putchar(c); saves three bytes :) \$\endgroup\$
– Quentin
Commented Apr 18, 2017 at 20:31
\$\begingroup\$ @Quentin Thanks! I wonder why I missed that in the first place :) \$\endgroup\$
– Steadybox
Commented Apr 18, 2017 at 21:11

Add a comment |

Neil · Accepted Answer · 2017-04-17 13:51:47Z

3

Batch, 146 bytes

@set s=
@for /l %%i in (1,1,%1)do @call set s=G%%s%%
@for %%w in (%2.%s% %3.%s:G=C% %4.%s:G=M% %2.%s%)do @for /l %%i in (1,1,%%~nw)do @echo%%~xw

Relies on the obscure behaviour of echo in that it can often ignore the symbol between echo and the text to be echoed to collapse the four loops into a nested loop.

answered Apr 17, 2017 at 13:51

Neil

174k12 gold badges73 silver badges277 bronze badges

Add a comment |

DJMcMayhem · Accepted Answer · 2017-04-17 15:20:08Z

V, 22 bytes

éGÄÀäjMoC
MÀÄkÀÄHdêÀP

Try it online!

Hexdump:

00000000: e947 c4c0 e46a 4d6f 430a 4d1b c0c4 6bc0  .G...jMoC.M...k.
00000010: c448 64ea c050                           .Hd..P

Input order is

Graham, Marshmallow, Chocolate, Width

Explanation:

éG                  " Insert 'G'
  Ä                 " Duplicate this line
   Àäj              " *arg1* times, duplicate this line and the line below it
      M             " Move to the middle line
       o            " Open up a newline, and enter insert mode
        C<cr>M<esc> " Insert 'C\nM'
ÀÄ                  " Make *arg2* copies of this line (Marshmallow)
  k                 " Move up one line
   ÀÄ               " Make *arg3* copies of this line (Chocolate)
     H              " Move to the first line
      dê            " Delete this column
        ÀP          " And paste it horizontally *arg4* times

\$\begingroup\$ Could you add an explanation? \$\endgroup\$
– user58826
Commented Apr 17, 2017 at 14:45 — user58826, Commented Apr 17, 2017 at 14:45
\$\begingroup\$ @programmer5000 Sure! See my edit \$\endgroup\$
– DJMcMayhem
Commented Apr 17, 2017 at 15:20 — DJMcMayhem, Commented Apr 17, 2017 at 15:20

Adnan · Accepted Answer · 2017-04-17 17:28:56Z

3

05AB1E, 14 bytes

Code:

…GCM‚øü×¬)˜S×»

Uses the CP-1252 encoding. Try it online!

Explanation:

…GCM              # Push the string "GCM"
    ‚             # Wrap with the input
     ø            # Transpose the array
      ü×          # Compute the string product of each element (['A', 3] --> 'AAA')
        ¬)˜       # Get the last element and append to the list
           S      # Split the list
            ×     # Vectorized string multiplication with the second input
             »    # Join by newlines and implicitly print

edited Apr 17, 2017 at 17:28

answered Apr 17, 2017 at 17:13

Adnan

44.5k6 gold badges82 silver badges246 bronze badges

Add a comment |

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

3

Excel, 104 bytes

Oh, boy! A formula that requires line breaks.

=REPT(REPT("G",A1)&"
",A2)&REPT(REPT("C",A1)&"
",A3)&REPT(REPT("M",A1)&"
",A4)&REPT(REPT("G",A1)&"
",A2)

A1 has Width
A2 has Graham
A3 has Chocolate
A4 has Mallow

If pre-formatting is allowed, then you can format the cell for Vertical Text and shorten the formula to 65 bytes:

=REPT(REPT("G",A2)&REPT("C",A3)&REPT("M",A4)&REPT("G",A2)&"
",A1)

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 18, 2017 at 1:37

Engineer Toast

9,5091 gold badge23 silver badges53 bronze badges

Add a comment |

Jonathan Allan · Accepted Answer · 2017-04-18 08:37:01Z

Jelly, 13 bytes

“GCM”ẋ"ṁ4Fẋ€Y

A dyadic program. Inputs are: [Graham's, Chocolates, Marshmallows], Width.

Try it online!

How?

“GCM”ẋ"ṁ4Fẋ€Y - Main link: [g,c,m], w    e.g. [1,2,1], 2
“GCM”         - literal ['G', 'C', 'M']
      "       - zip that and [g,c,m] with the dyadic operation:
     ẋ        -     repeat list               [['G'],['C','C'],['M']]
       ṁ4     - mould like [1,2,3,4]          [['G'],['C','C'],['M'],['G']]
         F    - flatten                       ['G','C','C','M','G']
          ẋ€  - repeat €ach w times           [['G','G'],['C','C'],['C','C'],['M','M'],['G','G']]
            Y - join with line feeds          ['G','G','\n','C','C','\n','C','C','\n','M','M','\n','G','G']
              - implicit print                GG
                                              CC
                                              CC
                                              MM
                                              GG

Jörg Hülsermann · Accepted Answer · 2017-04-17 15:12:49Z

PHP, 85 Bytes

for($m=$argv;$i++<4;)for($c=$m[_2342[$i]]*$m[1];$c;)echo$c--%$m[1]?"":"\n",_GCMG[$i];

or

for($m=$argv;$i++<4;)for($c=$m[_2342[$i]];$c--;)echo"\n".str_pad("",$m[1],_GCMG[$i]);

Online Versions

PHP, 96 Bytes

<?[$n,$w,$G,$C,$M]=$argv;for(;$i<4;$i++)for($t=${"$n[$i]"};$t--;)echo"\n".str_pad("",$w,$n[$i]);

Online Version

Expanded

[$n,$w,$G,$C,$M]=$argv; # $argv[0] must contain a file beginning with "GCMG"
for(;$i<4;$i++) # Take the first 4 values of the filename
for($t=${"$n[$i]"};$t--;) # How many rows should be printed
echo"\n".str_pad("",$w,$n[$i]); # print $w times the actual letter

rassar · Accepted Answer · 2017-04-17 17:29:03Z

2

Python 2, 6757 bytes

(Edit: now that matrices are allowed, no need to newline-join it.)

def s(w,g,c,m):g=['G'*w]*g;print g+['C'*w]*c+['M'*w]*m+g

edited Apr 17, 2017 at 17:29

answered Apr 17, 2017 at 14:08

rassar

1214 bronze badges

Add a comment |

Rik · Accepted Answer · 2017-04-18 12:13:14Z

2

C# (150 bytes)

void S(int w,int g,int c,int m){P(w,g,'G');P(w,c,'C');P(w,m,'M');P(w,g,'G');}void P(int w,int i,char c){while(i-->0)Console.Write("\n".PadLeft(w,c));}

Ungolfed:

void SMores(int w, int g, int c, int m)
{
    Print(w,g,'G');
    Print(w,c,'C');
    Print(w,m,'M');
    Print(w,g,'G');
}
void Print(int w, int i, char c)
{
    while(i-->0)
        Console.Write("\n".PadLeft(w,c));
}

edited Apr 18, 2017 at 12:13

answered Apr 18, 2017 at 11:43

Rik

7514 silver badges7 bronze badges

Add a comment |

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

2

C, 90 bytes (based on Steadybox's answer)

Renamed the variables and exploited the stringification preprocessor operator to cut down on the macro parameters. I hope posting this idea as its own answer is fine :)

#define F(x)for(i=x;i--;puts(""))for(j=w;j--;)printf(#x);
i,j;f(w,G,C,M){F(G)F(C)F(M)F(G)}

TIO link

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 18, 2017 at 21:27

Quentin

1,1877 silver badges15 bronze badges

\$\begingroup\$ Would upvote, but hit vote limit :( \$\endgroup\$
– user58826
Commented Apr 18, 2017 at 21:41

Add a comment |

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

Java, 138 bytes

String s(int w,int g,int c,int m){String b="";int i=-g-c,j;for(;i++<g+m;){for(j=0;j++<w;)b+=i<=-c|i>m?'G':i<=0?'C':'M';b+="\n";}return b;}

Try it online!

Explanation:

String s(int w, int g, int c, int m) {
    String b = "";
    int i = -g - c, j;              // i is the layer
    for (; i++ < g + m;) {          // Repeat (G+C+M+G) times, starting from -g-c to m+g 
                                    //Layer 0 is the last chocolate layer
        
        for (j = 0; j++ < w;) {     // Repeat W times
            b += 
                i <= -c | i > m ? 'G': //If before the chocolate or after the marshmellow, output a G
                i <= 0 ? 'C' :      // Else if equal or before last chocolate layer output C
                'M';                //Otherwise output an M
        }
        b += "\n";
    }
    return b;
}

\$\begingroup\$ Not bad...for Java! \$\endgroup\$
– user58826
Commented Apr 19, 2017 at 16:27 — user58826, Commented Apr 19, 2017 at 16:27

totallyhuman · Accepted Answer · 2017-10-09 04:25:25Z

2

Swift, 138 137 134 130 bytes

^{Saved 7 bytes thanks to @Kevin}

let f=String.init(repeating:count:)
let r={w,g,c,m in f(f("G",w)+"\n",g)+f(f("C",w)+"\n",c)+f(f("M",w)+"\n",m)+f(f("G",w)+"\n",g)}

Two functions that return the expected value: f is a helper function and r is the actual lamdba-like function that generates the output. Usage: print(r(10,3,2,1))

Check it out!

edited Oct 9, 2017 at 4:25

totallyhuman

17.3k3 gold badges32 silver badges88 bronze badges

answered Apr 17, 2017 at 16:19

Mr. Xcoder

42.4k9 gold badges80 silver badges214 bronze badges

\$\begingroup\$ You can save several characters by just referencing the string initializer directly (var f=String.init(repeating:count:);). And it doesn't save you any characters but it doesn't cost any so they should both really be let. \$\endgroup\$
– Kevin
Commented Apr 18, 2017 at 5:34
\$\begingroup\$ And 3 more by dropping the explicit arguments in r (let r={f(f("G",$0)+"\n",$1)+f(f("C",$0)+"\n",$2)+f(f("M",$0)+"\n",$3)+f(f("G",$0)+"\n",$1)}) \$\endgroup\$
– Kevin
Commented Apr 18, 2017 at 5:40
\$\begingroup\$ @Kevin Thanks, I had no idea that you can initialise a value to something like this: f=String.init(repeating:count:)... \$\endgroup\$
– Mr. Xcoder
Commented Apr 18, 2017 at 6:39
\$\begingroup\$ @Kevin when it comes to your second suggestion, it seems like it exceeds the number of bytes in UTF-8, checked the byte count on TIO, don't know why \$\endgroup\$
– Mr. Xcoder
Commented Apr 18, 2017 at 6:46

Add a comment |

Dennis · Accepted Answer · 2017-04-22 23:39:29Z

Jelly, 11 bytes

ṁ4“GCMG”x×Y

Try it online!

How it works

ṁ4“GCMG”x×Y  Main link. Left argument: g, c, m. Right argument: w

ṁ4           Mold 4; repeat g, c, m until length 4 is reached. Yields [g, c, m, g].
  “GCMG”x    Repeat 'G' g times, then 'C' c times, then 'M' m times, and finally
             'G' g times. This yields a string.
         ×   Multiply each character w times. This is essentially a bug, but
             Jelly's × behaves like Python's * (and vectorizes), so it can be
             abused for character repetition.
          Y  Join, separating by linefeeds.

user58826user58826 · Accepted Answer · 2017-04-17 13:58:12Z

1

JS (ES6), 111 bytes

n=`
`,G="G",C="C",M="M",r=(s,t)=>s.repeat(t),(w,g,c,m)=>r(r(G,w)+n,g)+r(r(C,w)+n,c)+r(r(M,w)+n,m)+r(r(G,w)+n,g)

answered Apr 17, 2017 at 13:58

user58826

Add a comment |

GamrCorps · Accepted Answer · 2017-04-17 17:05:43Z

1

Convex, 20 bytes

"GCM"f*]z{~N+*}%(_@@

Try it online!

answered Apr 17, 2017 at 17:05

GamrCorps

7,5922 gold badges29 silver badges61 bronze badges

Add a comment |

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

1

JavaScript (ES6), 91 bytes

Includes trailing newline.

f=

(w,g,c,m)=>(b=(`G`[r=`repeat`](w)+`
`)[r](g))+(`C`[r](w)+`
`)[r](c)+(`M`[r](w)+`
`)[r](m)+b

console.log(f(10,3,2,1))

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 17, 2017 at 20:51

Shaggy

42.8k4 gold badges36 silver badges94 bronze badges

Add a comment |

Nebula · Accepted Answer · 2017-04-18 00:08:58Z

JS (ES6), 87 bytes

x=(w,g,c,m)=>(f=>f`Gg`+f`Cc`+f`Mm`+f`Gg`)(([[x,y]])=>(x.repeat(w)+`
`).repeat(eval(y)))

x acts as a standalone lambda function. The result has a trailing newline.

Try in a snippet:

x=(w,g,c,m)=>(f=>f`Gg`+f`Cc`+f`Mm`+f`Gg`)(([[x,y]])=>(x.repeat(w)+`
`).repeat(eval(y)))

function doTheThing() {
  document.getElementById("target").innerText = x(
    document.getElementById("width").value,
    document.getElementById("graham").value,
    document.getElementById("chocolate").value,
    document.getElementById("marshmallow").value,
  )
}

Width: <input id='width' value='10'>
Graham: <input id='graham' value='3'>
Chocolate: <input id='chocolate' value='2'>
Marshmallow: <input id='marshmallow' value='1'>
<pre id='target'></pre>
<button onclick='doTheThing()'>Do the thing</button>

Rik · Accepted Answer · 2017-04-19 08:48:37Z

1

F# (148 99 bytes)

let s w q="GCMG"|>Seq.iteri(fun i c->for j in 1..(q|>Seq.item(i%3))do printf"%A"("".PadLeft(w,c)))

Usage:

s 10 [2;3;4]

Ungolfed:

let smores width quantities =
    "GCMG"
    |>Seq.iteri(fun i char ->
        for j in 1..(quantities|>Seq.nth(i%3))
            do printf "%A" ("".PadLeft(width,char)))

I'm still new to F#, so if I did anything weird or stupid, please let me know.

edited Apr 19, 2017 at 8:48

answered Apr 18, 2017 at 14:32

Rik

7514 silver badges7 bronze badges

\$\begingroup\$ A link to F# would be nice. \$\endgroup\$
– user58826
Commented Apr 18, 2017 at 14:36

Add a comment |

fəˈnɛtɪk · Accepted Answer · 2017-04-20 12:53:44Z

1

JavaScript ES6, 69 68 66 bytes

Thanks @Arnauld for golfing off one byte

a=>b=>"GCMG".replace(/./g,(c,i)=>`${c.repeat(a)}
`.repeat(b[i%3]))

Try it online!

Explanation

Receives input in curried format (Width)([Graham,Chocolate,Marshmallow])

Using .replace(/./g,...) replaces each character in the string GCMG with the return value from the function (c,i)=>`${c.repeat(a)} `.repeat(b[i%3])

`${c.repeat(a)} ` creates each line of the graham cracker with a newline appended .repeat(b[i%3]) repeats this line the required number of times

edited Apr 20, 2017 at 12:53

answered Apr 18, 2017 at 2:12

fəˈnɛtɪk

4,1942 gold badges14 silver badges40 bronze badges

\$\begingroup\$ Using replace() would save a byte: a=>"GCMG".replace(/./g,(c,i)=>`${c.repeat(a[0])}\n`.repeat(a[1+i%3])) \$\endgroup\$
– Arnauld
Commented Apr 18, 2017 at 12:12

Add a comment |

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

1

Google Sheets, 103 Bytes

Anonymous Google Sheets worksheet formula that takes input from cells A1,B1,C1,D1 and outputs a s'more to the calling cell

=REPT(REPT("G",A1)&"
",B1)&REPT(REPT("C",A1)&"
",C1)&REPT(REPT("M",A1)&"
",D1)&REPT(REPT("G",A1)&"
",B1

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Oct 8, 2017 at 21:46

Taylor Raine

8,6962 gold badges26 silver badges51 bronze badges

Add a comment |

mkst · Accepted Answer · 2017-10-08 22:41:11Z

K (oK), 32 17 bytes

Solution:

{x#',/4#y#'"GCM"}

Try it online!

Example:

> {x#',/4#y#'"GCM"}[10;(3;2;1)]
("GGGGGGGGGG"
 "GGGGGGGGGG"
 "GGGGGGGGGG"
 "CCCCCCCCCC"
 "CCCCCCCCCC"
 "MMMMMMMMMM"
 "GGGGGGGGGG"
 "GGGGGGGGGG"
 "GGGGGGGGGG")

Explanation:

{x#',/4#y#'"GCM"} / solution
{               } / lambda function with implicit parameters x and y
        y#'"GCM"  / take input each-both (#') number "G", "C" and "M"
      4#          / 4-take, ("GGG";"CC";"M") -> ("GGG";"CC";"M";"GGG")
    ,/            / flatten list into string, ("GGG";"CC";"M";"GGG") -> "GGGCCMGGG"
 x#'              / width-take each (10#"G" -> "GGGGGGGGGG" etc)

Notes:

-15 bytes as looking through other answers it seems acceptable to take parameters as [width;(graham;chocolate;marshmallow)], which means I don't have to explicitly list the parameters to the function

dzaima · Accepted Answer · 2018-07-11 10:33:21Z

Canvas, 12 11 bytes

GCMG｛²└＠＊×Ｐ

Try it here!

Explanation:

GCMG     push "GCMG"
  {      for each character
   ²       push the counter.                     Stack: [(input2, input1), "G", 1]
    └      swap two items below ToS.             Stack: [(I1, I2), "G", I1, 1]
     @     get the counter'th item of the input. Stack: [(I1, I2), "G", I1[1] ]
      *    repeat horizontally.                  Stack: [(I1, I2), "G" * I1[1] ]
       ×   repeat vertically.                    Stack: [(I2, I1), I2 × "G" * I1[1] ]
        P  print that.                           Stack: [(I2, I1)]

Make me a s'more!

Stack snippet (for testing, etc.)

Notes:

43 Answers 43

Python 2, 73 48 bytes

05AB1E, 21 19 19 bytes

05AB1E, 17 16 bytes

JavaScript (ES6), 71 bytes

MATL, 17 bytes

Explanation with example

C#, 204 bytes

Golfed

Ungolfed

Ungolfed readable

Full code

Releases

Notes

Ruby, 47 bytes

Ruby, 51 bytes

PowerShell, 49 bytes

C, 108 105 bytes

Batch, 146 bytes

V, 22 bytes

05AB1E, 14 bytes

Excel, 104 bytes

Jelly, 13 bytes

How?

PHP, 85 Bytes

PHP, 96 Bytes

Python 2, 6757 bytes

C# (150 bytes)

C, 90 bytes (based on Steadybox's answer)

Java, 138 bytes

Swift, 138 137 134 130 bytes

Jelly, 11 bytes

How it works

JS (ES6), 111 bytes

Convex, 20 bytes

JavaScript (ES6), 91 bytes

JS (ES6), 87 bytes

F# (148 99 bytes)

JavaScript ES6, 69 68 66 bytes

Explanation

Google Sheets, 103 Bytes

K (oK), 32 17 bytes

Canvas, 12 11 bytes

Your Answer

Sign up or log in

Post as a guest

Linked

Related

Hot Network Questions