九度 oj 題目1171：C翻轉

http://ac.jobdu.com/problem.php?pid=1171

#include <cstdio>
#include <algorithm>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define inone(i) scanf("%d",&i)
#define infour(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
int MAXN = 6;
int mat[6][6];
int a, b, x, y,len,dir;

void trans(int x, int y, int n, int m)
{
	rep(i, 0, n) rep(j, i + 1, m)
		swap(mat[x+i][y+j],mat[x+j][y+i]);
}
void flapOnRow(int x, int y, int n, int m)
{	
	int l = 0, r = n;
	while (l < r) {
		rep(i, 0, m) swap(mat[x+l][y+i], mat[x+r][y+i]);
		l++; r--;
	}
}
void flapOnCol(int x, int y, int n, int m)
{
	int l = 0, r = m;
	while (l < r) {
		rep(i, 0, n) swap(mat[x+i][y+l], mat[x+i][y+r]);
		l++; r--;
	}
}

void Switch(int x, int y, int dir, int len)
{
	trans(x , y, len, len);
	if (dir) flapOnRow(x, y, len, len);
	else flapOnCol(x, y, len, len);
	rep(i, 1, MAXN - 1) {
		rep(j, 1, MAXN - 1)
			printf("%s%d",j==1?"":" ",mat[i][j]);
		puts("");
	}

}

int main()
{
	while (inone(mat[1][1]) != EOF)
	{
		rep(i, 2, MAXN-1) inone(mat[1][i]);
		rep(i, 2, MAXN-1) rep(j, 1, MAXN-1) inone(mat[i][j]);
		infour(a, b, x, y);
		if (b == 2) len = 1; else len = 2;
		if (a == 1)  dir = 0;
		else dir = 1;
		Switch(x, y, dir, len);
	}
    return 0;
}