A Simple Patttern

Question

Inputs:

Two single digits (let's call them m and n) and two chars (let's call them a and b) in your input format of choice.

Output:

For the walkthrough, pretend m=2, n=5, a='a', b='b'.

Your output will be a string built from your four inputs. Let's call the string result, with value "". First, concatenate a onto result m times, so concatenate a onto result 2 times. result now equals aa. Second, concatenate b onto result m times, so concatenate b onto result 2 times. result now equals aabb. Lastly, if result is already longer than n, truncate result so that it has length n. Otherwise, continue alternating with m length runs of a and b until result has length n. The final result is aabba, which has length 5.

Test Cases:

Input: m = 2, n = 4, a = A, b = B

Output: AABB

Input: m = 3, n = 8, a = A, b = B

Output: AAABBBAA

Input: m = 4, n = 3, a = A, b = B

Output: AAA

Input: m = 2, n = 10, a = A, b = B

Output: AABBAABBAA

As all knows, lesser one will rule the world, so the smallest programs, in bytes, win! :)

What do you mean by "total char in output will be 'n'" and "lesser one will rule the world"? — Erik the Outgolfer, Jul 6, 2017 at 19:05
I basically rewrote the challenge, keeping what I believe was your original intent. You can rollback if you want, but in its original state it's not going to get reopened. — Stephen, Jul 6, 2017 at 19:13
@Durga no problem :) I'm glad it still says what you wanted. — Stephen, Jul 6, 2017 at 19:17

Julian Wolf · Accepted Answer · 2017-07-06 20:01:25Z

8

Python, 32 bytes

lambda m,n,a,b:((a*m+b*m)*n)[:n]

Try it online!

edited Jul 6, 2017 at 20:01

answered Jul 6, 2017 at 19:29

Julian Wolf

1,1996 silver badges10 bronze badges

\$\begingroup\$ Anonymous functions are allowed last I checked so you can remove the f= for -2 bytes. \$\endgroup\$
– sporkl
Jul 6, 2017 at 19:54
\$\begingroup\$ @ComradeSparklePony: Thanks for the heads up. That was leftover from the TiO; I'd actually already removed it from the byte count. \$\endgroup\$
– Julian Wolf
Jul 6, 2017 at 20:01
2

\$\begingroup\$ You can put the f= in the header section of TIO, so you don't need to remove it manually. TIO \$\endgroup\$
– ovs
Jul 6, 2017 at 20:15
\$\begingroup\$ Ah, I always forget about backslashes. Thanks. \$\endgroup\$
– Julian Wolf
Jul 6, 2017 at 20:28
1

\$\begingroup\$ To whoever suggested editing (a*m+b*m) -> (a+b)*m: this does not work. \$\endgroup\$
– Julian Wolf
Jul 7, 2017 at 1:28

Add a comment |

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

6

MATL, 5 bytes

Y"i:)

Inputs are a string with the two characters, then m, then n.

Try it online!

Explanation

Y"   % Implicit inputs: string and number m. Apply run-length decoding.
     % The second input is reused for each char in the first. Gives a
     % string
i    % Input number n
:    % Push vector [1 2 ... n]
)    % Index the string with the numbers in that vector. Indexing is
     % modular, so the chars are reused if necessary. Implicit display

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jul 6, 2017 at 19:49

Luis Mendo

104k9 gold badges132 silver badges365 bronze badges

Add a comment |

nimi · Accepted Answer · 2017-07-06 19:31:09Z

5

Haskell, 44 40 bytes

f=(.cycle).take
(n#m)a=f n.(f m a++).f m

Try it online!

edited Jul 6, 2017 at 19:31

answered Jul 6, 2017 at 19:21

nimi

35.8k4 gold badges33 silver badges96 bronze badges

Add a comment |

manatwork · Accepted Answer · 2017-07-06 19:32:13Z

5

Ruby, 29 characters

->m,n,a,b{((a*m+b*m)*n)[0,n]}

Sample run:

irb(main):001:0> ->m,n,a,b{((a*m+b*m)*n)[0,n]}[3, 8, 'A', 'B']
=> "AAABBBAA"

Try it online!

edited Jul 6, 2017 at 19:32

answered Jul 6, 2017 at 19:24

manatwork

20k5 gold badges46 silver badges78 bronze badges

Add a comment |

Justin Mariner · Accepted Answer · 2017-07-06 21:59:42Z

5

Japt, 10 bytes

VîUçW +UçX

First try using a golfing language. Try it online!

Explanation

Vî          // repeat the following until it reaches length V (second input)
  UçW       // third input repeated U (first input) times
      +UçX  // plus the fourth input, repeated U times

answered Jul 6, 2017 at 21:59

Justin Mariner

4,9161 gold badge12 silver badges18 bronze badges

\$\begingroup\$ Thanks for using Japt, and well done :-) You could do VîWpU +XpU too, but both do the same thing. Vî is perfect for this challenge. \$\endgroup\$
– ETHproductions
Jul 7, 2017 at 0:16
\$\begingroup\$ @ETHproductions Thanks, and thanks for making it! I really enjoy how everything transpiles nicely to JS code. \$\endgroup\$
– Justin Mariner
Jul 7, 2017 at 0:39

Add a comment |

Emigna · Accepted Answer · 2017-07-06 22:15:52Z

3

05AB1E, 5 bytes

×J×I£

Try it online!

Explanation

×      # repeat a and b m times each
 J     # join to string
  ×    # repeat the string n times
   I£  # take the first n characters

answered Jul 6, 2017 at 22:15

Emigna

52.9k5 gold badges42 silver badges162 bronze badges

\$\begingroup\$ Exactly what I got without checking first :P \$\endgroup\$
– Magic Octopus Urn
Jul 13, 2017 at 14:17

Add a comment |

Erik the Outgolfer · Accepted Answer · 2017-07-07 09:02:48Z

3

Jelly, 6 4 bytes

xFṁ⁵

Try it online!

Thanks to Jonathan Allan for better input format (-2).

edited Jul 7, 2017 at 9:02

answered Jul 6, 2017 at 19:47

Erik the Outgolfer

40.5k5 gold badges41 silver badges121 bronze badges

\$\begingroup\$ 4 bytes as a full program with a different input format \$\endgroup\$
– Jonathan Allan
Jul 6, 2017 at 20:06
\$\begingroup\$ @JonathanAllan Heh I usually try to avoid using the third argument but this time it makes my answer way shorter. \$\endgroup\$
– Erik the Outgolfer
Jul 7, 2017 at 9:05

Add a comment |

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

V, 13 bytes

ÀäjÀäêÍî
À|lD

Try it online!

a and b are taken on separate lines in the input, m and n are taken as argument, reversed (so n is the first argument and m is the second)

Explanation

Àäj      ' duplicate the inputs [arg 1] times
a -> a
b    b
     a
     b
     ...
   Àäê   ' duplicate everything straight down [arg 2] times - À cycles arguments
a -> aaa
b    bbb
a    aaa
b    bbb
...  ...
      Íî ' remove all newlines
-> aaabbbaaabbb...
À|lD     ' delete from the [arg 1] + 1 column onwards
-> aaabbbaa

ბიმო · Accepted Answer · 2017-07-13 12:19:28Z

3

Haskell, 36 35 29 bytes

Yet another Haskell solution (expects the characters given as a list):

(m#n)c=take n$cycle$c<*[1..m]

Try it online!

Thanks @Laikoni for -1 byte.

edited Jul 13, 2017 at 12:19

answered Jul 12, 2017 at 19:44

ბიმო

16.7k2 gold badges39 silver badges103 bronze badges

1

\$\begingroup\$ You can save a byte with (m#n)a b=. \$\endgroup\$
– Laikoni
Jul 13, 2017 at 7:20

Add a comment |

Giuseppe · Accepted Answer · 2017-07-13 20:58:07Z

3

R, 41 39 bytes

function(d,m,n)cat(d[gl(2,m,n)],sep='')

An anonymous function; prints the result to stdout. Takes the characters as a vector d=c(a,b). gl generates factors (integers) of (in this case) 2 levels of run length m with total length n! cat concatenates and prints them as a string.

Try it online!

edited Jul 13, 2017 at 20:58

answered Jul 6, 2017 at 21:46

Giuseppe

28.1k3 gold badges30 silver badges101 bronze badges

\$\begingroup\$ I think function(d,m,n)rep(d,e=m,l=n) would be a valid submission. \$\endgroup\$
– ovs
Jul 8, 2017 at 12:27
\$\begingroup\$ @ovs unfortunately rep will result in a vector of characters rather than a single string \$\endgroup\$
– Giuseppe
Jul 12, 2017 at 19:49

Add a comment |

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

2

Javascript, 55 bytes

(m,n,a,b)=>(a[r='repeat'](m)+b[r](m))[r](n).substr(0,n)

Example code snippet:

f=

(m,n,a,b)=>(a[r='repeat'](m)+b[r](m))[r](n).substr(0,n)

console.log(f(2, 4, 'A', 'B'))
console.log(f(3, 8, 'A', 'B'))
console.log(f(4, 3, 'A', 'B'))
console.log(f(2, 9, 'A', 'B'))

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jul 6, 2017 at 19:35

Endenite

4,05111 silver badges28 bronze badges

Add a comment |

Ra8 · Accepted Answer · 2017-07-06 20:49:10Z

2

Javascript, 53 bytes

(m,n,a,b)=>a.repeat(n).replace(/./g,(i,j)=>j/m&1?b:i)

answered Jul 6, 2017 at 20:49

Ra8

4012 silver badges4 bronze badges

Add a comment |

ბიმო · Accepted Answer · 2017-08-05 03:59:03Z

2

Husk, 3 bytes

Direct Port of my Haskell answer, except that the argument order is different:

↑¢Ṙ

Try it online!

answered Aug 5, 2017 at 3:59

ბიმო

16.7k2 gold badges39 silver badges103 bronze badges

Add a comment |

Julian Wolf · Accepted Answer · 2017-07-06 19:19:43Z

1

Haskell, 48 43 bytes

(m#n)a|r<-(<$[1..m])=take n.cycle.(r a++).r

Try it online!

answered Jul 6, 2017 at 19:19

Julian Wolf

1,1996 silver badges10 bronze badges

Add a comment |

steenbergh · Accepted Answer · 2017-07-06 20:20:04Z

QBIC, 37 27 bytes

[:|G=;+G+;][:|G=G+G]?_sG,d

Explanation

          This takes its arguments as frequency m, A, B, length n
          For example: 2, A, B, 8
 :        Read a cmd line arg as number 'b' ('a' is used by the FOR declaration as loop counter)
[ |       Start a FOR loop, from 1 to b
G=  G     Set G to hold itself
  ;+      prepended by a cmd line arg read as strig and assigned to A$
     +;   and followed by a cmd line arg read as strig and assigned to B$
]         At the end of the FOR loop, G has had A added to the front twice, and B t the end x2: G$ = AABB
[:|       FOR c = 1 to n
G=G+G]      Add G to itself          G$ = AABBAABBAABBAABBAABBAABBAABBAABB
?_sG,d    PRINT the first n chars of G$   AABBAABB

Previous attempt:

(37b)  {Z=Z+;┘_LZ|~a=:|_X]~a%:|\C=A┘A=;┘B=C
Takes its arguments as `A, length n, frequency m, B`.
Basically adds A to Z until length % freq = 0, then swaps A for B. Loops until lengtn = n

Jörg Hülsermann · Accepted Answer · 2017-07-06 20:46:26Z

1

PHP>=7.1, 77 bytes

for([,$x,$l,$f,$s]=$argv;$l-=$z;)echo str_repeat(++$i&1?$f:$s,$z=min($l,$x));

PHP Sandbox Online

answered Jul 6, 2017 at 20:46

Jörg Hülsermann

13.3k3 gold badges14 silver badges36 bronze badges

Add a comment |

Leaky Nun · Accepted Answer · 2017-07-07 06:18:46Z

1

Java (OpenJDK 8), 75 bytes

void f(int m,int n,char[]s){for(int i=0;i<n;)System.out.print(s[i++/m%2]);}

Try it online!

answered Jul 7, 2017 at 6:18

Leaky Nun

49.6k6 gold badges107 silver badges281 bronze badges

Add a comment |

Giuseppe · Accepted Answer · 2017-07-13 18:52:01Z

Cubix, 63 58 bytes

.rr.@u:s?.\.sw).i|>v:.\nB;?(q:Is...;rr/s.uw/....sIB/\/?(qo

Try it online!

watch the interpreter

Takes input like ab*m*n where the * can be any non-digit character.

Cube version:

        . r r .
        @ u : s
        ? . \ .
        s w ) .
i | > v : . \ n B ; ? ( q : I s
. . . ; r r / s . u w / . . . .
s I B / \ / ? ( q o . . . . . .
. . . . . . . . . . . . . . . .
        . . . .
        . . . .
        . . . .
        . . . .

i|is : read in the chars, and swap them (so a is on top)
I:q : read in m, dup, and push to bottom (stack is now m,b,a,m)
) : decrement
? : turn right if positive, go straight if zero (duplicates a)
positive branch (loop)
- s:rur(/w : swap, dup, move m-i to the top of the stack, decrement m-i
zero branch
- B : reverse stack (which now has m copies of a: a... b m)
- n : negate m (so we can use ? to turn left)
- ) : increment
- ? : go straight if zero, turn left if negative
negative branch (duplicates b)
- s:r\/rw)\ basically the same as the positive branch but with increment and left turns.
zero branch (prints the output)
- >v; : pop the 0 off the stack (looks like a...b...)
- /B : reverse the stack
- I : read n
- s : swap print loop:
oq : print and push to bottom of stack now looks like: ab...a...n
( decrement n
? : turn right if positive, go straight if zero
If right, : /su : swap top of stack and continue the loop
if zero, / reflects down and the code evaluated is Iru@; @ terminates the program.

Neil · Accepted Answer · 2017-07-06 20:27:20Z

0

Charcoal, 10 bytes

…⁺×ζＩθ×εＮＮ

Try it online! Link is to verbose version of code and includes fourth example. (Annoyingly the deverbosifer won't remove the separator if I add one before the last InputNumber().)

answered Jul 6, 2017 at 20:27

Neil

166k12 gold badges70 silver badges273 bronze badges

\$\begingroup\$ What do you mean by the separator? (Can you give an example) \$\endgroup\$
– ASCII-only
Jul 27, 2017 at 3:12
\$\begingroup\$ @ASCII-only With the comma before the last InputNumber(), notice that the generated code has an unnecessary separator: Try it online! \$\endgroup\$
– Neil
Jul 27, 2017 at 7:51

Add a comment |

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

0

Mathematica , 61 bytes

T=Table;StringTake[""<>Flatten@T[{#3~T~#,#4~T~#},⌈#2/#⌉],#2]&

input

[2,10,"A","B"]

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jul 6, 2017 at 22:53

ZaMoC

24.4k2 gold badges29 silver badges79 bronze badges

Add a comment |

user61980user61980 · Accepted Answer · 2017-07-06 23:58:25Z

Mathematica, 44 bytes

StringPadRight[x={##3}~Table~#<>"",#2,x]&

Explanation

 is the three byte private use character U+F3C7, representing the postfix \[Transpose] operator in Mathematica. No TIO link because Mathics does not support , \[Transpose] has the wrong operator precedence, the second argument to Table is required to be a list, and most importantly, StringPadRight is not implemented.

                                         & (* Function *)
                 {##3}                     (* which takes the third and fourth arguments *)
                      ~Table~#             (* repeats them a number of times equal to the first argument *)
                                          (* takes the tranpose *)
                               <>""        (* then joins the strings with the empty string *)
               x=                          (* sets x equal to that string *)
StringPadRight[                            (* then pads x *)
                                   ,#2     (* to a length equal to the second argument *)
                                      ,x]  (* with x. *)

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

0

APL (Dyalog), 5 bytes

⎕⍴⎕/⎕

Try it online!

Takes the two chars in a string as the first input, followed by m and then n.

Explanation

Let the example input be 'ab', 2, 10.

⎕/⎕                 Replicate the two-char string `m` times
                    2/'ab' => 'aabb'
⎕⍴                  Shape it so that its length is `n`
                    10⍴'aabb' => 'aabbaabbaa'

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jul 7, 2017 at 4:41

user41805

13.1k6 gold badges40 silver badges87 bronze badges

Add a comment |

Jim · Accepted Answer · 2017-07-07 12:30:18Z

0

Pyth, 13 bytes

KE<*+*EQ*EQKK

Try it online!

Explanation

                 # Implicitly store m to Q
KE               # Store n to K
     *EQ         # Perform a * m
        *EQ      # Perform b * m
    +            # Concatenate the two strings
   *       K     # Multiply by n
  <         K    # Take the first n characters of the string

edited Jul 7, 2017 at 12:30

answered Jul 7, 2017 at 10:35

Jim

1,5128 silver badges15 bronze badges

Add a comment |

zgrep · Accepted Answer · 2017-07-14 06:31:03Z

0

k, 10 bytes

{y#,/x#'z}

Try it online!

answered Jul 14, 2017 at 6:31

zgrep

1,5817 silver badges9 bronze badges

Add a comment |

Phlarx · Accepted Answer · 2017-07-17 20:04:42Z

Chip, 588 bytes

*Z~vZ.*ZZZs  z. z. z. z. z. z. z. z.
  ,'|`-. ZZ--#<,#<,#<,#<,#<,#<,#<,#<
a/mAM/a| `~S `x'`x'`x'`x'`x'`x'`x'`x.
b/mBM/b|  *.)/')/')/')/')/')/')/')/'|
c/mCM/cZv--x^x-^x-^x-^x-^x-^x-^x-^x-'
d/mDM/d||A~#M',-',-',-',-',-',-',-'
e/mEM/e||B~#M-',-',-',-',-',-',-'
f/mFM/f||C~#M--',-',-',-',-',-'
g/mGM/g||D~#M---',-',-',-',-'
h/mHM/h||E~#M----',-',-',-'
 `v~v' ||F~#M-----',-',-'
* `mz  ||G~#M------',-'
Z  `---x'H~#M-------'
Z,--z--^----'
Z|z. z. z. z. z. z. z. z.
Zx#<,#<,#<,#<,#<,#<,#<,#<
 |`x'`x'`x'`x'`x'`x'`x'`xT
 |A| B| C| D| E| F| G| H|
 )\')\')\')\')\')\')\')\'
 `--^--^--^--^--^--^--'

Try it online!

Takes input as a 4-character string. The first two are the characters a and b, followed by the byte value m, and then the byte value n. For example, the TIO includes input ab<tab>2, this corresponds to 'a', 'b', 9, 50. (Since the codes for <tab> and 2 are 9 and 50.

How?

This answer is a bit of a behemoth, but here's the highlights:

The upper left block, with the lowercase a-h, is the storage mechanism for the characters a and b, one line per bit. At its bottom, with the v~v and mz is the switching mechanism, to swap between the two.

In the middle is a column with a bunch of ~#M's. This reads in m and stores its negative. The big triangle to the right is just wires to bring this value into the upper accumulator.

The upper right block is the accumulator for m. It increments every cycle (starting from -m) until it reaches zero. When this happens, the output character is swapped, and counting restarts from -m.

Meanwhile, there is the lower block, which is the n accumulator. Since n is only read once, we don't need a bank of memory (M and m) to store this value. We simply negate it and start counting. When this value reaches zero, the whole shebang is simply terminated.

All the other guff is delays (Z and z), wiring (-, |, ...), and other miscellany.

Stack Exchange Network

A Simple Patttern

25 Answers 25

Python, 32 bytes

MATL, 5 bytes

Explanation

Haskell, 44 40 bytes

Ruby, 29 characters

Japt, 10 bytes

Explanation

05AB1E, 5 bytes

Jelly, 6 4 bytes

V, 13 bytes

Explanation

Haskell, 36 35 29 bytes

R, 41 39 bytes

Javascript, 55 bytes

Javascript, 53 bytes

Husk, 3 bytes

Haskell, 48 43 bytes

QBIC, 37 27 bytes

Explanation

PHP>=7.1, 77 bytes

Java (OpenJDK 8), 75 bytes

Cubix, 63 58 bytes

Charcoal, 10 bytes

Mathematica , 61 bytes

Mathematica, 44 bytes

Explanation

APL (Dyalog), 5 bytes

Explanation

Pyth, 13 bytes

k, 10 bytes

Chip, 588 bytes

How?

Your Answer

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

Hot Network Questions

A Simple Patttern

25 Answers 25

Python, 32 bytes

MATL, 5 bytes

Explanation

Haskell, 44 40 bytes

Ruby, 29 characters

Japt, 10 bytes

Explanation

05AB1E, 5 bytes

Jelly, 6 4 bytes

V, 13 bytes

Explanation

Haskell, 36 35 29 bytes

R, 41 39 bytes

Javascript, 55 bytes

Javascript, 53 bytes

Husk, 3 bytes

Haskell, 48 43 bytes

QBIC, 37 27 bytes

Explanation

PHP>=7.1, 77 bytes

Java (OpenJDK 8), 75 bytes

Cubix, 63 58 bytes

Charcoal, 10 bytes

Mathematica , 61 bytes

Mathematica, 44 bytes

Explanation

APL (Dyalog), 5 bytes

Explanation

Pyth, 13 bytes

k, 10 bytes

Chip, 588 bytes

How?

Your Answer

Sign up or log in

Post as a guest

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

Related

Hot Network Questions

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