[Question]
  [
## Challenge
I need help building a brick wall! Throw together some code for me
 using no input and produce the following output wall shown below:
```
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
```
Now, this wall is exactly `10` characters high and `70` characters
 wide.
As stated above, no inputs, only code. Least amount of bytes, we have
 to efficiently build this brick wall. Obviously, this program has to
 function to get the wall built..? or it obviously won't build itself!
 Good luck!
---
## Winner
The winner goes to **Marinus** using the `APL` language, requiring a whole `12` bytes!
<https://codegolf.stackexchange.com/a/99028/61857>
---
Thank you everyone for participating!
  
[Answer]
## [Trumpscript](https://github.com/samshadwell/TrumpScript), ~~303~~ ~~285~~ ~~244~~ ~~231~~ 226 bytes
```
make i 1000005-1000000
as long as,i;:
make i,i - fact;
say "_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|"
say "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"!
America is great
```
I would like to say this is one of the most verbose languages where almost everything fails to compile into a working program.
Apparently whether `-` works instead of `minus` is completely up to the interpreter and sometimes works. This time it did so I'm putting it in as golfed.
Abuses the fact Trumpscript is written in Python and therefore `fact` when used as an integer is one.
Golfing tips welcome.
[Answer]
# APL, 12 bytes
```
10 70⍴'_|__'
```
Output:
```
      10 70⍴'_|__'
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
```
[Answer]
# J, 12 bytes
```
10 70$'_|__'
```
Shapes the string on the right into a 10 by 70 shape. Simple!
[Answer]
# BBC BASIC, 28 bytes
Tokenised filesize 23 bytes.
```
WIDTH70P.STRING$(175,"_|__")
```
`WIDTH70` would normally be followed by a newline. It sets the field width to 70. Then we just print 175 copies of the string, which wrap around.
[Answer]
# Brainfuck, 171 bytes
```
+++++[>+++++++++++++++++++<-]+++++++[>>++++++++++++++++++<<-]>>--<<++[>>>+++++<<<-]+++++[>.>.>>+++++++++++++++++[<<<...>.>>-]<.>+++++++++++++++++[<<<...>.>>-]<<<..>>.<<<-]
```
Brainfuck is fun, here is my submission.
Here is the output:
```
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
```
Here is a link to try it
<https://repl.it/EW2Z/0>
[Answer]
# WinDbg, 45 bytes
```
f2000000 L2bc 5f 7c 5f 5f;da/c46 2000000 L2bc
```
How it works:
```
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)
```
Output:
```
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  "___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__"
```
[Answer]
# Pyth, 12 bytes
Code:
```
jcT*175"_|__
```
Explanation:
```
       "_|__    # For the string "_|__"
   *175         # Repeat it 175 times
 cT             # Chop into 10 equal pieces
j               # Join them by newlines
```
[Try it here](https://pyth.herokuapp.com/?code=jcT%2a175%22_%7C__&debug=0).
[Answer]
## Python 2, 37 bytes
```
s="_|__"*17;print(s+"_|\n__%s\n"%s)*5
```
Decomposes two rows as 17 copies of `_|__`, plus another copy interrupted by a newline, plus 17 more copies, plus another newline.
Longer alternatives:
```
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("_|__"))
```
[Answer]
# [05AB1E](http://github.com/Adriandmen/05AB1E), 13 bytes
Code:
```
"_|__"175×Tä»
```
Explanation:
```
"_|__"         # For the string "_|__"
      175×     # Repeat that 175 times
          Tä   # Split into 10 even pieces
            »  # And join them by newlines
```
Uses the **CP-1252** encoding. [Try it online!](http://05ab1e.tryitonline.net/#code=Il98X18iMTc1w5dUw6TCuw&input=)
[Answer]
# PHP, ~~44~~ ~~42~~ 41 characters
```
<?=chunk_split(str_pad(_,700,"|___"),70);
```
(Just because had no chance to use `chunk_split()` ever before.)
Thanks to:
* [user59178](https://codegolf.stackexchange.com/users/59178/user59178) for suggesting to use `str_pad()` (-1 character)
Sample run:
```
bash-4.3$ php <<< '<?=chunk_split(str_pad(_,700,"|___"),70);'
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
```
[Answer]
## Vim, ~~30~~ ~~24~~ 19 keystrokes
```
18a___|<esc>YP2x}h.yk4P
```
Thanks to DrMcMoylex and nmjcman101 for saving valuable keystrokes!
[Answer]
# Perl, ~~47~~ ~~34~~ 29 bytes
```
$_="_|__"x175;say for/.{70}/g
```
[Answer]
## Perl, 31 bytes
```
say+($@="_|__"x17,"_|
__$@
")x5
```
You'll need `-E` flag to run it :
```
perl -E 'say+($@="_|__"x17,"_|
__$@
")x5'
```
[Answer]
# [V](http://github.com/DJMcMayhem/V), ~~24~~, 16 bytes
```
175i_|__ò70|lé
```
[Try it online!](http://v.tryitonline.net/#code=MTc1aV98X18bw7I3MHxsw6kK&input=)
This contains `<esc>` characters (`0x1B`) so here is a hexdump:
```
0000000: 3137 3569 5f7c 5f5f 1bf2 3730 7c6c e90a  175i_|__..70|l..
```
8 bytes indirectly saved thanks to Jordan!
[Answer]
# [V](https://github.com/DJMcMayhem/V), 18 bytes
-1 byte thanks to DJMcMayhem.
```
175i_|__<Esc>Ó.û70}/°ò
```
Here it is with unprintable characters in xxd format:
```
0000000: 3137 3569 5f7c 5f5f 1bd3 2efb 3730 7d2f  175i_|__....70}/
0000010: b0f2                                     ..
```
[Try it online!](http://v.tryitonline.net/#code=MTc1aV98X18bw5Muw7s3MH0vwrDDsg&input=)
[Answer]
# MATL, 15 bytes
```
'_|__'700:)70e!
```
Of course, you can [Try it online!](http://matl.tryitonline.net/#code=J198X18nNzAwOik3MGUh&input=)
Explanation:
```
'_|__' % Put a brick on the stack
700    % 700 times
:)     % Makes a happy mason...
70e!   % Secret freemason code
```
OK, actually, it works as follows:
```
'_|__' % 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.
```
[Answer]
# Python 2, ~~46~~ 44 Bytes
Just using string multiplication to build the string, and slicing to get the right bits :)
```
k='_|__'*18
print'\n'.join([k[:70],k[2:]]*5)
```
*thanks to Antony Hatchkins for saving two bytes :)*
[Answer]
# [Jelly](https://github.com/DennisMitchell/jelly), 14 [bytes](https://github.com/DennisMitchell/jelly/wiki/Code-page)
```
“_|__”ṁ700s70Y
```
**[TryItOnline!](http://jelly.tryitonline.net/#code=4oCcX3xfX-KAneG5gTcwMHM3MFk&input=)**
### How?
```
“_|__”ṁ700s70Y - Main link: no arguments
“_|__”         - literal ['_','|','_','_']
      ṁ700     - mould like something 700 long
          s70  - split into chunks of length 70
             Y - join with line feeds
```
[Answer]
## PowerShell v2+, ~~34~~ 30 bytes
```
'_|__'*175-split"(.{70})"-ne''
```
Stupid regex matching algorithm requiring the `-ne''` ... wastes five bytes!
```
'_|__'*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
```
*Saved 4 bytes thanks to Conor!*
[Answer]
# C, ~~131~~ ~~115~~ ~~113~~ ~~103~~ ~~97~~ 95 Bytes
```
i,j;main(){for(;i<10;puts(i++&1?"|__":"|"))for(j=0;j<18-(i&1);printf(&"|___"[j++?0:i&1?1:3]));}
```
Time to start golfing this...
```
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
_|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|
___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|___|__
```
[Answer]
# [MATL](http://github.com/lmendo/MATL), 16 bytes
```
'___|'10:E!70:+)
```
[Try it online!](http://matl.tryitonline.net/#code=J19fX3wnMTA6RSE3MDorKQ&input=)
```
'___|'   % 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
```
[Answer]
# [CJam](http://sourceforge.net/projects/cjam/), 15 bytes
```
"_|__"175*70/N*
```
[Try it online!](http://cjam.tryitonline.net/#code=Il98X18iMTc1KjcwL04q&input=)
Port of [Adnan's 05AB1E answer](https://codegolf.stackexchange.com/a/99032/36398).
```
"_|__"             e# Push this string
      175*         e# Repeat 175 times
          70/      e# Split in pieces of size 70
             N*    e# Join by newlines
```
[Answer]
**Javascript REPL, 45 bytes**
```
"_|__".repeat(175).match(/.{70}/g).join("\n")
```
[Answer]
# JavaScript (ES6), 48 bytes
```
f=(n=350)=>n?(n%35?'_':`
_`)+"|_"[n%2]+f(n-1):""
```
Because recursion.
[Answer]
# Bash, 44, 41, 40 bytes
```
printf _\|__%.0s {1..175}|egrep -o .{70}
```
The printf makes a single line 700 characters long, the egrep matches it 70 characters at a time.
[Answer]
# [///](https://esolangs.org/wiki////), 43 bytes
```
/a/___|//b/aaccccc//c/aaa//d/_|b
b__
/ddddd
```
[Try it online!](https://tio.run/##FcaxDQAgDAPBnmV@JMsBJAq6tOwe4KrL7VwzqzCSDgR2/6C/GgY60UJqjK/qAg "/// – Try It Online")
[Answer]
# [Befunge-98](https://esolangs.org/wiki/Funge-98), 63 bytes
```
'_\:3+4%0`!> #0 #\ #|' $ #\_\,1+:7a*%0`!> #0 #, #a_:7aa**\`!#@_
```
[TryItOnline!](http://befunge-98.tryitonline.net/#code=J19cOjMrNCUwYCE-ICMwICNcICN8JyAkICNcX1wsMSs6N2EqJTBgIT4gIzAgIywgI2FfOjdhYSoqXGAhI0Bf&input=)
[Answer]
# ///, 51 bytes
If a trailing newline is allowed:
```
/e/aaaa//a/_|__//b/eeeea_|//c/__eeeea//d/b
c
/ddddd
```
[Try it online!](http://slashes.tryitonline.net/#code=L2UvYWFhYS8vYS9ffF9fLy9iL2VlZWVhX3wvL2MvX19lZWVlYS8vZC9iCmMKL2RkZGRk&input=)
[Answer]
## Pyke, 12 bytes
```
w�"_|__"*TfX
```
where `�` is the literal byte 163.
[Try it here!](http://pyke.catbus.co.uk/?code=175%22_%7C__%22%2aTfX) (`w�` replaced with literal)
[Answer]
# Ruby, 30 bytes
Thanks to manatwork for this solution
```
puts ("_|__"*175).scan /.{70}/
```
# Ruby, 39 bytes
```
10.times{|i|puts ("_|__"*18)[i%2*2,70]}
```
]