#include <iostream>
#include <string> using namespace std; int main()
{
int n, m;
while (cin >> m >> n)
{
for (int i = ; i <= n+; i++)
{
if (i == || i == n+)
{
cout << "+";
for (int j = ; j <= m; j++)
cout << "-";
cout << "+";
cout << endl;
}
else
{
cout << "|";
for (int j = ; j <= m; j++)
cout << " ";
cout << "|";
cout << endl;
} }
cout << endl;
}
}
相关文章
- [HDOJ 5212] [BestCoder Round#39] Code 【0.0】
- hdoj 1596 find the safest road【最短路变形,求最大安全系数】
- HDOJ2070 Fibbonacci Number
- HDOJ2072 单词数
- 【HDOJ】3386 Final Kichiku “Lanlanshu”
- HDOJ(HDU).2266 How Many Equations Can You Find (DFS)
- 最小生成树问题 普利姆算法简单模板 hdoj1233
- hdoj1171 Big Event in HDU(01背包 || 多重背包)
- BestCoder Round #53 (div.2) HDOJ5423 Rikka with Tree(bfs)
- HDOJ 3183 A Magic Lamp