Google APAC 2015第一轮 Problem B. Super 2048

个人感觉这道题是这轮4道题里最简单的，给个2048矩阵和下一步移动方向，求移动后矩阵显示内容

原链接https://code.google.com/codejam/contest/3214486/dashboard#s=p1

解法是逐行或逐列扫描，扫描旧矩阵，用一个指针记录新的位置，另外用一个标记位记录当前位置是否可以与下一个数据合并

#include <fstream>
#include <string>
using namespace std;
int main() {
	int T, N;
	string buffer;
	ifstream fin("B-large-practice.in");
	ofstream fout("output.txt");
	int arr[20][20];
	fin >> T;
	for (int t = 1; t <= T; t++) {
		fin >> N >> buffer;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				fin >> arr[i][j];
			}
		}
		//right
		if (buffer == "right") {
			for (int i = 0; i < N; i++) {
				bool combine = true;
				int pos = N;
				for (int j = N - 1; j >= 0; j--) {
					if (arr[i][j] != 0) {
						if (combine == false && arr[i][pos] == arr[i][j]) {
							arr[i][pos] *= 2;
							combine = true;
						}
						else {
							arr[i][--pos] = arr[i][j];
							combine = false;
						}
					}
				}
				for (int j = pos - 1; j >=0; j--) {
					arr[i][j] = 0;
				}
			}
		}
		//left
		else if (buffer == "left") {
			for (int i = 0; i < N; i++) {
				bool combine = true;
				int pos = -1;
				for (int j = 0; j < N; j++) {
					if (arr[i][j] != 0) {
						if (combine == false && arr[i][pos] == arr[i][j]) {
							arr[i][pos] *= 2;
							combine = true;
						}
						else {
							arr[i][++pos] = arr[i][j];
							combine = false;
						}
					}
				}
				for (int j = pos + 1; j < N; j++) {
					arr[i][j] = 0;
				}
			}
		}
		//down
		else if (buffer == "down") {
			for (int j = 0; j < N; j++) {
				bool combine = true;
				int pos = N;
				for (int i = N - 1; i >= 0; i--) {
					if (arr[i][j] != 0) {
						if (combine == false && arr[pos][j] == arr[i][j]) {
							arr[pos][j] *= 2;
							combine = true;
						}
						else {
							arr[--pos][j] = arr[i][j];
							combine = false;
						}
					}
				}
				for (int i = pos - 1; i >=0; i--) {
					arr[i][j] = 0;
				}
			}
		}
		//up
		else if (buffer == "up") {
			for (int j = 0; j < N; j++) {
				bool combine = true;
				int pos = -1;
				for (int i = 0; i < N; i++) {
					if (arr[i][j] != 0) {
						if (combine == false && arr[pos][j] == arr[i][j]) {
							arr[pos][j] *= 2;
							combine = true;
						}
						else {
							arr[++pos][j] = arr[i][j];
							combine = false;
						}
					}
				}
				for (int i = pos + 1; i < N; i++) {
					arr[i][j] = 0;
				}
			}
		}
		fout << "Case #" << t << ":" << endl;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N - 1; j++) {
				fout << arr[i][j] << " ";
			}
			fout << arr[i][N-1] << endl;
		}
	}
	return 0;
}