Submission #2126227


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<ll, P> E;
#define cost first
#define from second.first
#define to second.second
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

int main(void){
	int h,w,i;
	string a[123];
	cin >> h >> w;
	for(i=0; i<h; ++i){
		cin >> a[i];
	}
	for(i=(w+1); i>=0; --i){
		cout << "#";
	}
	cout << endl;
	for(i=0; i<h; ++i){
		cout << "#" << a[i] << "#" << endl;
	}
	for(i=(w+1); i>=0; --i){
		cout << "#";
	}
	cout << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Picture Frame
User ransewhale
Language C++14 (GCC 5.4.1)
Score 200
Code Size 658 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 2 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 2 ms 256 KB
1_07.txt AC 1 ms 256 KB