#pragma region include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include #include #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 PLL;// typedef std::pair 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; R %= 360; R = (R+360)%360; int H,W; cin >> H >> W; vector< vector > fld(H,vector(W) ); for(int h=0;h> str; for(int w=0;w > fldR; int HH,WW; if( R == 90 || R == 270 ){ HH = W*K; WW = H*K; fldR = vector >(W,vector(H)); }else{ HH = H*K; WW = W*K; fldR = vector >(H,vector(W)); } if( R == 0 ){ fldR = fld; }if( R == 90 ){ for(int h=0;h