#pragma region include #include <iostream> #include <iomanip> #include <stdio.h> #include <sstream> #include <algorithm> #include <iterator> #include <cmath> #include <complex> #include <string> #include <cstring> #include <vector> #include <tuple> #include <bitset> #include <queue> #include <complex> #include <set> #include <map> #include <stack> #include <list> #include <fstream> #include <random> //#include <time.h> #include <ctime> #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) #define ALL(X) X.begin(), X.end() ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; typedef std::pair<LL,LL> PLL;// typedef std::pair<int,int> PII;// #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)1e18+20; const LD PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; void solve(){ int R,K; cin >> R >> K; int H,W; cin >> H >> W; vector< vector<char> > fld(H,vector<char>(W) ); for(int h=0;h<H;++h){ string str; cin >> str; for(int w=0;w<W;++w){ fld[h][w] = str[w]; } } vector< vector<char> > fldR; int HH,WW; if( R == 90 || R == 270 ){ HH = W*K; WW = H*K; fldR = vector<vector<char> >(W,vector<char>(H)); }else{ HH = H*K; WW = W*K; fldR = vector<vector<char> >(H,vector<char>(W)); } if( R == 0 ){ fldR = fld; }if( R == 90 ){ for(int h=0;h<H;++h){ for(int w=0;w<W;++w){ fldR[w][H-1-h] = fld[h][w]; } } }else if( R==180){ for(int h=0;h<H;++h){ for(int w=0;w<W;++w){ fldR[H-1-h][W-1-w] = fld[h][w]; } } }else if( R==270 ){ for(int h=0;h<H;++h){ for(int w=0;w<W;++w){ fldR[W-1-w][h] = fld[h][w]; } } } for(int h=0;h<HH;++h){ for(int w=0;w<WW;++w){ cout << fldR[h/K][w/K]; } cout << '\n'; } cout << flush; } #pragma region main signed main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;//小数を10進数表示 cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別 solve(); } #pragma endregion //main()