Submission #1518227

---

Source Code Expand

#include <set>
#include <iostream>
using namespace std;
/*
int main()
{
    set<int> s[3];
    s[0].insert(1);
    s[0].insert(3);
    s[0].insert(5);
    s[0].insert(7);
    s[0].insert(8);
    s[0].insert(10);
    s[0].insert(12);
    s[1].insert(4);
    s[1].insert(6);
    s[1].insert(9);
    s[1].insert(11);
    s[2].insert(2);
    

    int x, y;
    bool is_found = false;
    cin >> x >> y;
    for(int i = 0; i < 2; i++){
	    if(s[i].find(x) != s[i].end() && s[i].find(y) != s[i].end()){
		    is_found = true;
	    }
    }
    if(is_found){
	    cout << "Yes" << endl;
    }else{
	    cout << "No" << endl;
    }

    return 0;
}
*/
#include <vector>
int main()
{
	int H, W;
	cin >> H >> W;
	vector<vector<char>> array(H + 2, vector<char>(W + 2));

	for(int i = 0; i < H + 2; i++){
		for(int j = 0; j < W + 2; j++){
			if(i == 0 || j == 0 || i == H + 1 || j == W + 1){
				array[i][j] = '#';
			}else{
				char tmp;
				cin >> tmp;
				array[i][j] = tmp;
			}
		}
	}
        for(int i = 0; i < array.size(); i++){
	       for(int j = 0; j < array[i].size(); j++){
	           cout << array[i][j];
               }
               cout << endl;
       }	       
	return 0;
}

Submission Info

Judge Result