Sfida

Ho bisogno di aiuto per costruire un muro di mattoni! Metti insieme un po 'di codice per me senza input e produci la seguente parete di output mostrata di seguito:

_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__

Ora, questo muro è esattamente 10alto e 70largo.

Come detto sopra, nessun input, solo codice. Minimo numero di byte, dobbiamo costruire in modo efficiente questo muro di mattoni. Ovviamente, questo programma deve funzionare per far costruire il muro ..? o ovviamente non si costruirà da solo! In bocca al lupo!

Vincitore

Il vincitore va a Marinus usando la APLlingua, richiedendo interi 12byte! https://codegolf.stackexchange.com/a/99028/61857

Grazie a tutti per la partecipazione!

APL, 12 byte

10 70⍴'_|__'

Produzione:

      10 70⍴'_|__'
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__

Trumpcript , 303 285 244 231 226 byte

make i 1000005-1000000
as long as,i;:
make i,i - fact;
say "_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|"
say "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"!
America is great

Vorrei dire che questo è uno dei linguaggi più prolissi in cui quasi tutto non riesce a compilarlo in un programma di lavoro.

Apparentemente se -funziona invece che minusdipende completamente dall'interprete e talvolta funziona. Questa volta è stato così lo sto mettendo come golf.

Abusa del fatto che Trumpscript è scritto in Python e quindi factquando usato come intero è uno.

Suggerimenti per il golf benvenuti.

J, 12 byte

10 70$'_|__'

Modella la stringa a destra in una forma 10 per 70. Semplice!

BBC BASIC, 28 byte

Dimensione file con token 23 byte.

WIDTH70P.STRING$(175,"_|__")

WIDTH70sarebbe normalmente seguito da una nuova riga. Imposta la larghezza del campo su 70. Quindi stampiamo solo 175 copie della stringa, che avvolgono.

Brainfuck, 171 byte

+++++[>+++++++++++++++++++<-]+++++++[>>++++++++++++++++++<<-]>>--<<++[>>>+++++<<<-]+++++[>.>.>>+++++++++++++++++[<<<...>.>>-]<.>+++++++++++++++++[<<<...>.>>-]<<<..>>.<<<-]

Brainfuck è divertente, ecco la mia presentazione.

Ecco l'output:

_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__

Ecco un link per provarlo

https://repl.it/EW2Z/0

WinDbg, 45 byte

f2000000 L2bc 5f 7c 5f 5f;da/c46 2000000 L2bc

Come funziona:

f 2000000 L2bc 5f 7c 5f 5f; *Repeat the pattern _|__ (5F 7C 5F 5F) to fill 2BC (700) bytes 
                            *starting at 2000000
da /c46 2000000 L2bc        *Show 2BC (700) ASCII chars starting from 2000000 in lines 
                            *of length 0x46 (70)

Produzione:

0:000> f2000000 L2bc 5f 7c 5f 5f;da/c46 2000000 L2bc
Filled 0x2bc bytes
02000000  "_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|"
02000046  "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"
0200008c  "_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|"
020000d2  "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"
02000118  "_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|"
0200015e  "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"
020001a4  "_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|"
020001ea  "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"
02000230  "_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|"
02000276  "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"

Pyth, 12 byte

Codice:

jcT*175"_|__

Spiegazione:

       "_|__    # For the string "_|__"
   *175         # Repeat it 175 times
 cT             # Chop into 10 equal pieces
j               # Join them by newlines

Provalo qui .

Python 2, 37 byte

s="_|__"*17;print(s+"_|\n__%s\n"%s)*5

Scompone due righe come 17 copie di _|__, più un'altra copia interrotta da una nuova riga, più altre 17 copie, più un'altra nuova riga.

Alternative più lunghe:

print"%s_|\n__%s\n"%(2*("_|__"*17,))*5

s="_|__"*17;print"%s_|\n__%%s\n"%s%s*5

for i in[0,2]*5:print("_|__"*18)[i:i+70]

print("_|__"*17+"_|\n"+"___|"*17+"__\n")*5

for s in["_|__","___|"]*5:print(s*18)[:70]

s="_|__"*99;exec"print s[:70];s=s[2:];"*10

print("%s"*70+"\n")*10%(175*tuple("_|__"))

05AB1E , 13 byte

Codice:

"_|__"175×Tä»

Spiegazione:

"_|__"         # For the string "_|__"
      175×     # Repeat that 175 times
          Tä   # Split into 10 even pieces
            »  # And join them by newlines

Utilizza la codifica CP-1252 . Provalo online!

PHP, 44 42 41 caratteri

<?=chunk_split(str_pad(_,700,"|___"),70);

(Solo perché non avevo possibilità di usarlo chunk_split()mai prima d'ora.)

Grazie a:

• user59178 per aver suggerito di usare str_pad()(-1 carattere)

Esecuzione di esempio:

bash-4.3$ php <<< '<?=chunk_split(str_pad(_,700,"|___"),70);'
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__

Vim, 30 24 19 sequenze di tasti

18a___|<esc>YP2x}h.yk4P

Grazie a DrMcMoylex e nmjcman101 per aver salvato sequenze di tasti importanti!

Perl, 47 34 29 byte

$_="_|__"x175;say for/.{70}/g

Perl, 31 byte

say+($@="_|__"x17,"_|
__$@
")x5

Avrai bisogno di -Eflag per eseguirlo:

perl -E 'say+($@="_|__"x17,"_|
__$@
")x5'

V , 24 , 16 byte

175i_|__ò70|lé

Provalo online! Questo contiene <esc>caratteri ( 0x1B) quindi ecco un hexdump:

0000000: 3137 3569 5f7c 5f5f 1bf2 3730 7c6c e90a  175i_|__..70|l..

8 byte salvati indirettamente grazie alla Giordania!

V , 18 byte

-1 byte grazie a DJMcMayhem.

175i_|__<Esc>Ó.û70}/°ò

Eccolo con caratteri non stampabili in formato xxd:

0000000: 3137 3569 5f7c 5f5f 1bd3 2efb 3730 7d2f  175i_|__....70}/
0000010: b0f2                                     ..

Provalo online!

MATL, 15 byte

'_|__'700:)70e!

Certo, puoi provarlo online! Spiegazione:

'_|__' % Put a brick on the stack
700    % 700 times
:)     % Makes a happy mason...
70e!   % Secret freemason code

OK, in realtà, funziona come segue:

'_|__' % Put the first bit of the string on the stack
700:   % Put 1, 2, ..., 700 on the stack as array
)      % Index into the string, modularly. Result: '_|___|__ ... __'
70e    % Reshape into 70 rows (and consequently, 10 columns)
!      % Transpose to get the desired output.

Python 2, 46 44 byte

Basta usare la moltiplicazione delle stringhe per costruire la stringa e tagliare per ottenere i bit giusti :)

k='_|__'*18
print'\n'.join([k[:70],k[2:]]*5)

^{grazie ad Antony Hatchkins per aver salvato due byte :)}

PowerShell v2 +, 34 30 byte

'_|__'*175-split"(.{70})"-ne''

Stupido algoritmo di regex che richiede -ne''... spreca cinque byte!

'_|__'*175-split"(.{70})"-ne''
'_|__'*175                     # Repeat this string 175 times
          -split"       "      # Split on this regex pattern:
                  .{70}        # Match any character 70 times
                 (     )       # Encapsulated in parens so we keep the regex results
                         -ne'' # But don't select the empty strings
                               # Output with newlines via Write-Output is implicit

4 byte salvati grazie a Conor!

C, 131 115 113 103 97 95 byte

i,j;main(){for(;i<10;puts(i++&1?"|__":"|"))for(j=0;j<18-(i&1);printf(&"|___"[j++?0:i&1?1:3]));}

È ora di iniziare a giocare a golf ...

_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__

Gelatina , 14 byte

“_|__”ṁ700s70Y

TryItOnline!

Come?

“_|__”ṁ700s70Y - Main link: no arguments
“_|__”         - literal ['_','|','_','_']
      ṁ700     - mould like something 700 long
          s70  - split into chunks of length 70
             Y - join with line feeds

MATL , 16 byte

'___|'10:E!70:+)

Provalo online!

'___|'   % Push this string
10:E!    % Push [2; 4; 6; ...; 20] (10×1 column vector)
70:      % Push [1, 2, 3, ..., 70] (1×70 row vector)
+        % Add. Gives a 10×70 matrix of all pairwise additions
)        % Index (modular, 1-based) into the string

CJam , 15 byte

"_|__"175*70/N*

Provalo online!

La risposta 05AB1E di Port of Adnan .

"_|__"             e# Push this string
      175*         e# Repeat 175 times
          70/      e# Split in pieces of size 70
             N*    e# Join by newlines

Javascript REPL, 45 byte

"_|__".repeat(175).match(/.{70}/g).join("\n")

JavaScript (ES6), 48 byte

f=(n=350)=>n?(n%35?'_':`
_`)+"|_"[n%2]+f(n-1):""

Perché ricorsione.

Bash, 44, 41 , 40 byte

printf _\|__%.0s {1..175}|egrep -o .{70}

La stampa rende lunga una riga di 700 caratteri, egrep corrisponde a 70 caratteri alla volta.

Befunge-98 , 63 byte

'_\:3+4%0`!> #0 #\ #|' $ #\_\,1+:7a*%0`!> #0 #, #a_:7aa**\`!#@_

TryItOnline!

///, 51 byte

Se è consentita una nuova riga finale:

/e/aaaa//a/_|__//b/eeeea_|//c/__eeeea//d/b
c
/ddddd

Provalo online!

Pyke, 12 byte

w�"_|__"*TfX

dov'è �il byte letterale 163.

Provalo qui! ( w�sostituito con letterale)

Rubino, 30 byte

Grazie a manatwork per questa soluzione

puts ("_|__"*175).scan /.{70}/

Rubino, 39 byte

10.times{|i|puts ("_|__"*18)[i%2*2,70]}

Haskell, 56 47 byte

unlines$[1..5]>>take 70.cycle<$>["_|__","___|"]