05AB1E, (削除) 16 (削除ここまで) 14 bytes

×ばつs×ばつ`»D®»

Explanation

×ばつ # create a string of the correct nr of horizontal chars
 s.ø # add the corner char on both sides
 © # save in register while keeping it on the stack
 |` # push the remaining inputs to the top of the stack
 ×ばつ` # push the correct nr of vertical chars on the stack
 » # join on newline (joining the top vertical and horizontal sections)
 D # duplicate this
 ® # push the horizontal part again
 » # join everything on newline

Try it online!

Saved 4 bytes thanks to Adnan.

• 1
  \$\begingroup\$ Out of curiosity, why are you using the © register :p? \$\endgroup\$

  Adnan

  – Adnan

  2016年09月03日 17:42:47 +00:00

  Commented Sep 3, 2016 at 17:42
• 1
  \$\begingroup\$ @Adnan: Good catch! I was going to, but ended up not using it and forgot to remove it :) \$\endgroup\$

  Emigna

  – Emigna

  2016年09月03日 17:46:21 +00:00

  Commented Sep 3, 2016 at 17:46
• 1
  \$\begingroup\$ @muddyfish: Reading the explanation from the question that part wasn't obvious, so I missed it. Thanks for letting me know! \$\endgroup\$

  Emigna

  – Emigna

  2016年09月03日 20:14:10 +00:00

  Commented Sep 3, 2016 at 20:14
• 1
  \$\begingroup\$ There's also a special surround command which works here: Í×s.øU×S»X»D»Xr». \$\endgroup\$

  Adnan

  – Adnan

  2016年09月03日 20:42:04 +00:00

  Commented Sep 3, 2016 at 20:42
• 2
  \$\begingroup\$ @Adnan: Right you are. Good thinking! I've never used that before :) \$\endgroup\$

  Emigna

  – Emigna

  2016年09月03日 20:47:36 +00:00

  Commented Sep 3, 2016 at 20:47

Python, (削除) 53 (削除ここまで) (削除) 51 (削除ここまで) 55 Bytes

lambda a,b,c,d,e:d.join("\n"*-~b).join([c+e*(a-2)+c]*3)

+4 Bytes thanks to @nimi

anonymous lambda function, to call it, write f= before it. Example:

>>> print f(4,1,"€","|","-")
€--€
|
€--€
|
€--€

alternative, 53 Bytes

lambda a,b,c,d,e:((c+e*a+c+"\n"+(d+"\n")*b)*3)[:-b*2]

old version with the special case of no input, (削除) 69 (削除ここまで) (削除) 65 (削除ここまで) 63 Bytes

yay to changing the requirements mid-challenge...

lambda a=1,b=1,(c,d,e)="+|-":d.join("\n"*-~b).join([c+e*a+c]*3)

• 2
  \$\begingroup\$ Small bug: the first argument (2 in your example) is the total length of the line, including the corners, so the right input for your shape is f(4,1 ...). \$\endgroup\$

  nimi

  – nimi

  2016年09月03日 18:57:13 +00:00

  Commented Sep 3, 2016 at 18:57
• \$\begingroup\$ @nimi thanks for the tip. (+4 bytes :( ) OPs first example is a bit confusing. (Some of the other answers have this bug aswell) \$\endgroup\$

  KarlKastor

  – KarlKastor

  2016年09月03日 22:06:22 +00:00

  Commented Sep 3, 2016 at 22:06

C, (削除) 167 (削除ここまで) (削除) 161 (削除ここまで) 159 bytes

Yeah.

#define p putchar
i,j;g(a,c,e){p(c);for(i=2;i++<a;)p(e);p(c);p(10);}h(b,d){for(i=0;i++<b;){p(d);p(10);}}f(a,b,c,d,e){g(a,c,e);h(b,d);g(a,c,e);h(b,d);g(a,c,e);}

Try it on Ideone, with some test cases

• 2
  \$\begingroup\$ puts("") -> p('\n') ? or even p(10) if that'll work \$\endgroup\$

  RiaD

  – RiaD

  2016年09月04日 22:03:42 +00:00

  Commented Sep 4, 2016 at 22:03
• \$\begingroup\$ How did I miss that! Thanks, @RiaD. \$\endgroup\$

  betseg

  – betseg

  2016年09月04日 23:34:11 +00:00

  Commented Sep 4, 2016 at 23:34
• \$\begingroup\$ Also if you start loop with 2, you will save to more bytes \$\endgroup\$

  RiaD

  – RiaD

  2016年09月05日 06:51:45 +00:00

  Commented Sep 5, 2016 at 6:51

Ruby, (削除) 54 (削除ここまで) (削除) 45 (削除ここまで) 42 bytes

->x,y,c,v,h{[c+h*~-~-x+c+$/]*3*((v+$/)*y)}

It's an anonymous function that takes the different part of the input as separate parameters and returns the result as a complete string.

For example,

f=->x,y,c,v,h{[c+h*~-~-x+c+$/]*3*((v+$/)*y)}
puts f[6, 2, 'Ø', 'V', '>']

prints

Ø>>>>Ø
V
V
Ø>>>>Ø
V
V
Ø>>>>Ø

Javascript (ES6), 64 bytes

(h,v,e,V,H)=>(v=(h=e+H.repeat(h-2)+e)+`
${V}`.repeat(v)+`
`)+v+h

Example

let f =
(h,v,e,V,H)=>(v=(h=e+H.repeat(h-2)+e)+`
${V}`.repeat(v)+`
`)+v+h
console.log(f(8,3,'+','@','#'))

• \$\begingroup\$ Does this handle the special case of no input? \$\endgroup\$

  Conor O'Brien

  – Conor O'Brien

  2016年09月03日 17:00:22 +00:00

  Commented Sep 3, 2016 at 17:00
• \$\begingroup\$ { "message": "Script error.", "filename": "", "lineno": 0, "colno": 0 } when run inline. \$\endgroup\$

  noɥʇʎԀʎzɐɹƆ

  – noɥʇʎԀʎzɐɹƆ

  2016年09月03日 22:41:24 +00:00

  Commented Sep 3, 2016 at 22:41
• \$\begingroup\$ @AgentCrazyPython - Run on IE? It has no support for .repeat() \$\endgroup\$

  Arnauld

  – Arnauld

  2016年09月03日 22:54:33 +00:00

  Commented Sep 3, 2016 at 22:54
• \$\begingroup\$ @Arnauld naw, safari \$\endgroup\$

  noɥʇʎԀʎzɐɹƆ

  – noɥʇʎԀʎzɐɹƆ

  2016年09月03日 23:34:07 +00:00

  Commented Sep 3, 2016 at 23:34
• \$\begingroup\$ oh, it's ES6... \$\endgroup\$

  noɥʇʎԀʎzɐɹƆ

  – noɥʇʎԀʎzɐɹƆ

  2016年09月03日 23:34:17 +00:00

  Commented Sep 3, 2016 at 23:34

V, 18 bytes

älJxxÀPjddÀpkäGYGp

Try it online!

R, 80 bytes

Pretty repetitive :

function(h,v,a,b,c)cat(t<-c(a,rep(c,h),a,"\n"),d<-rep(c(b,"\n"),v),t,d,t,sep="")

Ungolfed :

function(h,v,a,b,c)
cat(t<-c(a,rep(c,h),a,"\n"),
 d<-rep(c(b,"\n"),v),
 t,d,t,
 sep="")

Pyke, (削除) 16 (削除ここまで) 15 bytes

*2mtz:zn+Q*' +D

Try it here!

Pyth, 19 bytes

jP*3,++Jw*-E2wJj*Ew

A program that takes newline-separated input on STDIN of the corner character, number of horizontal characters, horizontal character, number of vertical characters and the vertical character, and prints the result.

Try it online

How it works

jP*3,++Jw*-E2wJj*Ew Program.
 Jw Get the corner character. Store in J
 E Get the number of horizontal characters
 - 2 -2
 * w Get the horizontal character and repeat it that many times
 + Add J at the beginning of that
 + J and at the end
 E Get the number of vertical characters
 * w Get the vertical character and repeat it that many times
 j Join the above on newlines
 , Construct a 2-element list from the horizontal and vertical strings
 *3 Repeat it 3 times
 P Everything except the last element
j Join the above on newlines
 Implicitly print

MATLAB, (削除) 95 92 91 85 (削除ここまで) 81 bytes

MATLAB 'E' function. (edit: doesn't work on Octave)

function a=e(n,m,c,h,v);a(1:n)=h;a=[c a c];a(2:m+1,1)=v;a=[a;a;a];a=a(1:3+2*m,:);

And ungolfed:

function a=e(n,m,c,h,v); %Declare the function
a(1:n)=h; %Initialise return with top line excluding the corners
a=[c a c]; %Then add corner pieces
a(2:m+1,1)=v; %Next add the first vertical part
a=[a;a;a]; %Repeat three times vertically to get an E with a tail
a=a(1:3+2*m,:); %And then lop off the tail

The function should be called like:

e(5,2,'*','-','|')

Which will return:

+-----+
| 
| 
+-----+
| 
| 
+-----+

This can probably be simplified a bit, I'll keep working on it. I don't like having the entire function declaration to get the input, so will see if I can improve that.

• Saved 3 bytes by simplifying generation of first line to first make the line without corners and then add the corners as this reduces the number of times indexing is required.

• Another byte saved by starting with the first corner.

• 6 more bytes by replacing repmat(a,3,1) call with [a;a;a].

• Saved 4 bytes by using a without specific initialisation (it's already declared in the function declaration) - thanks @LuisMendo

• 1
  \$\begingroup\$ @LuisMendo interesting. I originally had a=[c a c] in there but removed it to shrink things down as normally you can't index access a non-existent variable and create it in the process. I forgot that this was a function so a is already declared in the function declaration as the return value. Thanks :) \$\endgroup\$

  Tom Carpenter

  – Tom Carpenter

  2016年09月04日 03:11:07 +00:00

  Commented Sep 4, 2016 at 3:11
• \$\begingroup\$ In fact you can do it even if not in a function - indexing a non-existent variable does create it. Learn new things every day. \$\endgroup\$

  Tom Carpenter

  – Tom Carpenter

  2016年09月04日 03:17:15 +00:00

  Commented Sep 4, 2016 at 3:17

Perl, 40 + 1 (-n) = 41 bytes

Thanks to @Ton Hospel for saving 14 bytes and allowing the program to work with entry greater than 10.

/.$/;,ドル=$/.<>x<>;say+($`.$&x(<>-2).$`)x3

Need -n as well as -E (or -M5.010) to run. For instance :

perl -nE '/.$/;,ドル=$/.<>x<>;say+($`.$&x(<>-2).$`)x3' <<< '^$
!
4
9'

• 2
  \$\begingroup\$ This is already very good. But you can play a bit with the input format and also solve the flaw that the challenge does not say the repeats are < 10 by putting /(.)(.)/;,ドル=$' x<>;say+(1ドル.2ドルx(<>-2).1ドル.$/)x3 in a file (since it uses $') and calling with perl -M5.010 -n prog.pl <<< '^!S\n4\n9' (use real newlines) which counts as 48 bytes (2 extra handicap since it cannot be combined with -e) \$\endgroup\$

  Ton Hospel

  – Ton Hospel

  2016年09月04日 09:45:18 +00:00

  Commented Sep 4, 2016 at 9:45
• \$\begingroup\$ @TonHospel Thanks. Right, I had not even noticed that this wouldn't work with numbers >10.. Great work with the input format, thanks. \$\endgroup\$

  Dada

  – Dada

  2016年09月04日 11:23:19 +00:00

  Commented Sep 4, 2016 at 11:23
• \$\begingroup\$ This is getting close to abusing the freedom to select the input format, but: perl -nE '/.$/;,ドル=$/.<>x<>;say+($`.$&x(<>-2).$`)x3' <<< '^$\n!\n4\n9' is 41 bytes (no more $') and also gets rid of the spurious trailing newline \$\endgroup\$

  Ton Hospel

  – Ton Hospel

  2016年09月04日 17:04:38 +00:00

  Commented Sep 4, 2016 at 17:04
• \$\begingroup\$ @TonHospel Indeed, I came up with that solution after your first suggestion, but I wasn't too comfortable with it because of the input format... Since we both thought about it, I changed my answer, but still, I feel like it's a bit cheaty... \$\endgroup\$

  Dada

  – Dada

  2016年09月04日 20:23:09 +00:00

  Commented Sep 4, 2016 at 20:23

Dyalog APL, (削除) 31 (削除ここまで) 29 bytes

Prompts for horizontal-character, width, junction-character, height, vertical-character – in that order.

h↓⊃⍪/3/⊂↑(⍞⍴⍨h←⎕),⊂⍞{∊⍺⍵⍺}⎕⍴⍞

⎕⍴⍞ input-horizontal-character and repeat input-width times (⍵ below)

⍞{...} input-junction-character which will be ⍺ in the function...

∊⍺⍵⍺ flatten [[junction],[horizontals],[junction]]

⊂ encapsulate so it can be part of a list

(...), prepend...

h←⎕ input-height

⍞⍴⍨ input-vertical-character and repeat it that many times

↑ make the list of strings into a character table

⊂ encapsulate (so it can be repeated as a whole)

3/ repeat it three times

╻ ╻ ╻
┗━ ┗━ ┗━

⍪/ concatenate the three pieces vertically

╻
┣━
┣━
┗━

(this encapsulates them too, so we need to...)

⊃ remove the encapsulation

h↓ drop the first h (rows)

┏━
┣━
┗━

TryAPL online!

C, 130 bytes

#define p putchar
#define E for(o=0;o++<O;p(10))p(S);
#define W for(p(P),D=0;D++<C-2;)p(_);p(P);p(10);
f(C,O,P,S,_,D,o){W E W E W}

Usage:

main(){f(7,2,'+','|','-');}

Output

+-----+
|
|
+-----+
|
|
+-----+

• \$\begingroup\$ Removing the semicolons in defines and adding it as f(C,O,P,S,_,D,o){W;E;W;E;W;} saves a byte. \$\endgroup\$

  betseg

  – betseg

  2016年09月28日 16:44:11 +00:00

  Commented Sep 28, 2016 at 16:44

C#, 108 bytes

(m,n,e,v,h)=>{string x=e+new string(h,m-2)+e+"\n",y=new string(v,n).Replace(v+"",v+"\n");return x+y+x+y+x;};

Anonymous function which generates each horizontal and vertical line and builds the final output.

Ungolfed function:

(m,n,e,v,h)=>
{
 string x = e + new string(h, m - 2) + e + "\n",
 y = new string(v, n).Replace(v + "", v + "\n");
 return x + y + x + y + x;
};

Full program with test cases:

using System;
namespace LetterEWithoutE
{
 class Program
 {
 static void Main(string[] args)
 {
 Func<int,int,char,char,char,string>f= (m,n,e,v,h)=>{string x=e+new string(h,m-2)+e+"\n",y=new string(v,n).Replace(v+"",v+"\n");return x+y+x+y+x;};
 
 Console.WriteLine(f(7,2,'+','|','-'));
 Console.WriteLine(f(7,2,'@','|','-'));
 Console.WriteLine(f(7,2,'@','|','#'));
 Console.WriteLine(f(8,3,'+','|','#'));
 Console.WriteLine(f(8,3,'+','@','#'));
 Console.WriteLine(f(9,4,'^','$','!'));
 }
 }
}

MATL, 15 bytes

Thanks to @muddyfish for a correction

2-Y"yv!iiY"!yyy

Try it online!

Explanation

The stack contents after each step are indicated for clarity, using the first example in the challenge.

2- % Implicitly input number of repetitions of the char of the horizontal line.
 % Subtract 2
 % STACK: 5
Y" % Implicitly input char of the horizontal line. Apply run-length decoding
 % STACK: '-----' (string)
y % Implicitly input (from below) the char of the corners. Duplicate onto the top
 % STACK: '+', '-----', '+'
v! % Concatenate all the stack horizontally. We now have the horizontal line
 % including the corners
 % STACK: '+-----+'
iiY" % Take two inputs: char of the vertical line and number of repetitions
 % STACK: '+-----+', '||'
! % Transpose. This tranforms the string into a vertical char array, which
 % gives the vertical line
 % STACK: '+-----+', ['|';'|'] (vertical char array)
y % Duplicate from below: this pushes a new copy of the horizontal line
 % onto the top of the stack
 % STACK: '+-----+', ['|';'|'], '+-----+'
y % Duplicate from below: this pushes a new copy of the vertical line
 % onto the top of the stack
 % STACK: '+-----+', ['|';'|'], '+-----+', ['|';'|'],
y % Duplicate from below: this pushes a new copy of the horizontal line
 % onto the top of the stack
 % STACK: '+-----+', ['|';'|'], '+-----+', ['|';'|'], '+-----+'
 % Implicitly display

Java 7, (削除) 205 (削除ここまで) 129 bytes

String c(int w,int h,String a,char b,char c){String r=a,n="\n",l="";for(;w-->2;r+=c);r+=a+n;for(;h-->0;l+=b+n);return r+l+r+l+r;}

-76 bytes thanks to an anonymous stranger.
PS: Don't go edit other people's posts next time. If you have something to golf please leave it as a comment, or if it's using a completely different approach you could make your own answer. Still thanks for golfing away all these bytes, though - whoever you are..

Ungolfed & test cases:

Try it here.

class M {
 static String c(int w, int h, String a, char b, char c){
 String r = a,
 n = "\n",
 l = "";
 for(; w-- > 2; r += c);
 r += a+n;
 for( ;h-- > 0; l += b+n);
 return r+l+r+l+r;
 }
 
 public static void main(String[] a) {
 System.out.print(c(7, 2, "+", '|', '-'));
 System.out.print(c(9, 4, "?", '¡', '¿'));
 }
}

Output:

+-----+
| 
| 
+-----+
| 
| 
+-----+
?¿¿¿¿¿¿¿?
¡ 
¡ 
¡ 
¡ 
?¿¿¿¿¿¿¿?
¡ 
¡ 
¡ 
¡ 
?¿¿¿¿¿¿¿?

Bash + coreutils, 105 bytes

printf -- "3ドル`printf -- "4ドル%.0s" $(seq 1ドル)`3ドル`printf "\n5ドル%.0s" $(seq 2ドル)`%.0s\n" {1..3}|sed -n 1,$((2ドル*2+3))p

Assuming the file within which this is stored is named A.sh, the usage would be:

bash A.sh <Horizontal Segment Length w/out Edge Chars> <Vertical Segment Length> '<Left/Right Edge Char>' '<Char Between Edges>' '<Vertical Char>'

The -- are needed, just in case one of the character inputs happens to be a -, and printf apparently doesn't handle dashes in the beginning of a string very nice without the double-dashes.

Explanation

Assuming that the input is 5 2 + * |...

1. 3ドルprintf -- "4ドル%.0s" $(seq 1ドル)3ドルprintf "\n5ドル%.0s" $(seq 2ドル)

   Create the first horizontal segment and vertical segment all together. This would result in:

   +*****+
   |
   |
   

2. printf -- "3ドルprintf -- "4ドル%.0s" $(seq 1ドル)3ドルprintf "\n5ドル%.0s" $(seq 2ドル)%.0s\n" {1..3}

   Repeat the previously created part 3 times over. This now results in:

   +*****+
   |
   |
   +*****+
   |
   |
   +*****+
   |
   |
   

3. printf -- "3ドルprintf -- "4ドル%.0s" $(seq 1ドル)3ドルprintf "\n5ドル%.0s" $(seq 2ドル)%.0s\n" {1..3}|sed -n 1,$((2ドル*2+3))p

   Finally pipe the previous output to sed to get rid of the last 2 line segments by only outputting the first <Vertical Segment Length>*2+3 lines of the E. We finally get the E we want:

   +*****+
   |
   |
   +*****+
   |
   |
   +*****+
   

PowerShell v2+, (削除) 60 (削除ここまで) 59 bytes

param($a,$b,$c,$d,$e)(,($x="$c$($e*($a-2))$c")+,$d*$b)*2;$x

Takes input as individual command-line arguments. Constructs the horizontal string, stores that into $x for use later, then forms that into an array with the comma-operator ,. Performs array concatenation (i.e., adding elements to the end) of $d formulated into an array of $b elements. That, in turn, is formulated into an array of two elements with another comma operator, and is left on the pipeline. Then, the horizontal $x is left on the pipeline. Abuses the default formatting of Write-Output to put a newline between elements.

Example

PS C:\Tools\Scripts\golfing> .\the-letter-e-without-e.ps1 5 3 "z" "v" "d"
zdddz
v
v
v
zdddz
v
v
v
zdddz

Python 3, 60 bytes

A Function

def p(a,b,c,d,e):q=c+e*(a-2)+c;return(q+'\n'+(d+'\n')*b)*2+q

Test Case

>>> print(p(8,2,'+','|','#'))
+######+
|
|
+######+
|
|
+######+

• \$\begingroup\$ you have 2 too many dashes in the output \$\endgroup\$

  Blue

  – Blue

  2016年09月03日 20:05:58 +00:00

  Commented Sep 3, 2016 at 20:05

Brainf*ck, 147 bytes

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

Takes input from stdin as first 5 characters entered. The first two are have 48 subtracted from their ASCII code so 0-9 behave as expected. For numbers> 9, add 48 to the number and use the corresponding character. The other three characters are as specified in the challenge.

I'm sure it's not the optimal solution but life is too short to golf brainf*ck.

With comments:

[
 Input: number number corner vertical horizontal
 Numbers are single digits; add 48 and use the ASCII character corresponding
 to the number you want for numbers > 9.
 First number is the number of characters across. Second is the number down.
 Layout: {first number-2} {second number} {temp} {a} {b} {c}
]
,>,>++++++++[<------<------>>-]<<-->>>,>,>,
now we should have the first five cells with the specified layout
the 6th will hold 3 as a counter and the 7th 2 and the 8th 10 '\n'
>+++>++>++++++++++<<
[ while the 6th cell is not 0
 -
 <<<. print corner
 <<<[->>+>>>.<<<<<] print horizontal characters
 >>[-<<+>>] copy temp back to 1st cell
 >.>>>>>. print corner and newline
 <
 [ If the second counter is not zero
 -
 <<<<<<[->+>>.>>>>.<<<<<<<] print vertical and newline n times
 >[<+>-] copy temp back to 2nd cell
 ]
 >>>>
]

Example run:

sean@SEANSBOX:~/Dropbox/Code/BF$ ./bf E.b
94^$!
^!!!!!!!^
$
$
$
$
^!!!!!!!^
$
$
$
$
^!!!!!!!^

Lua(5.2), 144 bytes

k,a,p,q=loadstring,arg,io.write,print l,d=k"for i=3,a[1]do p(a[5])end",k"for i=1,a[2]do q(a[4])end"b=a[3]p(b)l()q(b)d()p(b)l()q(b)d()p(b)l()p(b)

Try it online! (Coding Ground)

It should output something like that right now:

+@@@@@+
l
l
+@@@@@+
l
l
+@@@@@+

Own input: 7 2 + l @

You can change the input in project->compile options and there change the values, each value as in the example but not separated by commas but by spaces.

PHP, 97 bytes

list(,$w,$h,$c,$v,$r)=$argv;echo$b=str_pad($a=str_pad($c,++$w,$r)."$c\n",--$h*2+$w,"$v\n"),$b,$a;

no loop, only builtins.

Run with php -r '<code>' <parameters>.

Vyxal, 10 bytes

⇩*+Ǐ∇εJǏ∞⁋

Try it Online!

 * # Repeat the horizontal character...
⇩ # Horizontal distance - 2 times
 +Ǐ # Prepend and append the corner character
 ∇ε # Push the vertical character repeated by the amount
 J # Append that to the line
 Ǐ # Append the first line
 ∞ # Mirror
 ⁋ # Join by newlines

Racket 124 bytes

(λ(w h a b c)(for((i 3))(display a)(for((i w))(display c))(display a)(when(< i 2)(displayln "")(for((j h))(displayln b)))))

More readable form:

(define(f w h a b c)
 (for((i 3))
 (display a)
 (for((i w))
 (display c))
 (display a)
 (when(< i 2)
 (displayln "")
 (for((j h))
 (displayln b)))))

Testing:

(f 7 2 "+" "|" "-" )
+-------+
|
|
+-------+
|
|
+-------+

C++, 121 Bytes

#import<string>
#import<iostream>
#define f(w,h,C,W,H){std::string s(w,W),t;s=C+s+C+"\n";for(int i=h;i--;)t=t+H+"\n";std::cout<<s+t+s+t+s;}

Ungolfed:

#import<string>
#import<iostream>
#define f(w,h,C,W,H){
 std::string s(w,W),t; //define two strings, one empty, one with horizontal characters
 s = C+s+C+"\n"; //assemble a horizontal bar
 for(int i=h;i--;) 
 t=t+H+"\n"; //assemble a vertical bar
 std::cout<<s+t+s+t+s; //print
}

In C++ its not allowed to declare functions without type as in C. But macros that behave just like a function are totally possible. Note also that the ungolfed version will not compile until you add a "\" to each but the last line of the macro. You might save two additional bytes by removing the {}, but then you can't use the macro twice in a row.

Usage:

int main() {
 f(4,2,'+','-','|')
 f(2,1,'@','#','i')
 return 0;
}

Output:

+----+
|
|
+----+
|
|
+----+
@##@
i
@##@
i
@##@

Try it online

CJam, 23 bytes

riri)N*r2*\r*\@r**a3*\*

Try it online!

The input is is in the given order, but should be space separated instead of using a comma. Some of the difficulty is getting the input the right order for CJam's join operation *; for comparison rearranging the input in could save 4 bytes.

If the inputs are dubbed A B C D E then the program works something like this:

ri e# get A as integer
ri)N* e# create B+1 newlines
r2* e# create 2 Cs
\r* e# join newlines with D (hereafter ND)
\@ e# bring A & Cs to the front
r* e# create A Es
* e# join, puts Es between Cs (hereafter CEC)
a3* e# makes 3 copies of CEC strings
\* e# join, puts NDs between CECs

QBIC, 44 bytes

::;;;X=A[q,a-2|X=X+C]X=X+A ?X[1,2|[1,b|?B]?X

Explanation

::;;; Get the input parameters, 2 numbers and 3 strings
X=A[q,a-2|X=X+C]X=X+A Build the horizontal string: The corner string, x-2 times the filler string and another corner
?X Print the horizontal string
[1,2| Do the next thing twice
[1,b|?B]?X Print the right number of vertical strings, then the horizontal string.

PHP, 94 Bytes

<?list($v,$h,$p,$d,$r)=$_GET[a];for($h++;$i<=2*$h;)echo$i++%$h?$d:str_pad($p,$v-1,$r).$p,"\n";

Input format an array in the same order as the suggested string

• \$\begingroup\$ If you use ,"\n" instead of ."\n", you can drop the parens for the ternary. \$\endgroup\$

  Titus

  – Titus

  2016年10月17日 14:20:20 +00:00

  Commented Oct 17, 2016 at 14:20
• \$\begingroup\$ for($h++;$i<=2*$h;) and $i++%$h saves another byte. \$\endgroup\$

  Titus

  – Titus

  2016年10月17日 14:24:02 +00:00

  Commented Oct 17, 2016 at 14:24
• \$\begingroup\$ $v-1 gives only 3 horizontal characters for [5,2,+,|,-]. Number of horizontal characters, not including the left and right edge characters \$\endgroup\$

  Titus

  – Titus

  2016年10月17日 14:37:27 +00:00

  Commented Oct 17, 2016 at 14:37
• \$\begingroup\$ @Titus that is right, I have rollback your edit. 5 Horizontal means 3 Characters with 2 edges = 5. Make look at the question. And for the others ideas Thank You \$\endgroup\$

  Jörg Hülsermann

  – Jörg Hülsermann

  2016年10月17日 14:46:20 +00:00

  Commented Oct 17, 2016 at 14:46

Japt -R, 18 bytes

Can't seem to do better than 18 :\

5õ_gVÇX÷ ̧pW2ùUY é

Try it

[W2ùUY é XpV y]ê ê

Try it

• code-golf
• ascii-art