Submission #1841812
Source Code Expand
#include <bits/stdc++.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
typedef long long ll;
typedef pair<int,int> P;
typedef pair<P,int> PP;
struct edge {
int to,cost;
edge(int t,int c):to(t),cost(c) {}
};
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};
ll mypow(ll x,ll n,ll m) { //xのn乗をmで割った余り
if(n==0) return 1;
if(n%2==0) return mypow(x*x%m,n/2,m);
else return x*mypow(x,n-1,m)%m;
}
//-----------------------------------------------------------------------------
int h,w;
string s[100];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>h>>w;
REP(i,h) cin>>s[i];
REP(i,w+2) cout<<"#";
cout<<endl;
REP(i,h) {
cout<<"#";
REP(j,w) cout<<s[i][j];
cout<<"#"<<endl;
}
REP(i,w+2) cout<<"#";
cout<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Picture Frame |
User |
moko_freedom |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1174 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
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 |
1 ms |
256 KB |
1_07.txt |
AC |
1 ms |
256 KB |