View Code of Problem 125

#include<iostream>
#include<cstring>
//#include<algorithm>
using namespace std;
int main(){
	int n;
	cin>>n;
	for(int i = 0;i<n+2;i++){  //层数 
		if(i == 0 || i == n+1){
			for(int j = 0;j < n + 2;j++){
				if(j == 0 || j == n+1)cout<<" ";
				else cout<<"-";
			}
		}
		else{
			for(int j = 0;j < n + 2;j++){
				if(j == 0 || j == n+1)cout<<"|";
				else cout<<" ";
			}
		}
		cout<<endl;
	}
	for(int i = 0;i<n+1;i++){
		if(i == n){
			for(int j = 0;j < n + 2;j++){
				if(j == 0 || j == n+1)cout<<" ";
				else cout<<"-";
			}
		}else{
			for(int j = 0;j < n + 2;j++){
				if(j == 0 || j == n+1)cout<<"|";
				else cout<<" ";
			}
		}
		cout<<endl;
	}
	return 0;
}