[SWEA] 1961. 숫자 배열 회전

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5Pq-OKAVYDFAUq&categoryId=AV5Pq-OKAVYDFAUq&categoryType=CODE

SW Expert Academy

손으로 써보면서 각각의 index가 변하는 규칙이 뭔지 찾아서 코드로 표현하면 된다.

#include <iostream>
#include <ios>
using namespace std;

int T, N;
int map[7][7];
void getResult();
void print90(int paramX);
void print180(int paramY);
void print270(int paramX);

int main() {
	cin.tie(0); ios::sync_with_stdio(0);
	cin >> T;
	for (int testCase = 1; testCase <= T; testCase++) {
		cin >> N;
		for (int y = 0; y < N; y++) {
			for (int x = 0; x < N; x++) {
				cin >> map[y][x];
			}
		}
		cout << '#' << testCase << "\n";
		getResult();
	}
	return 0;
}

void getResult() {
	for (int i = 0; i < N; i++) {
		print90(i);
		print180(N - i - 1);
		print270(N - i - 1);
	}
}

void print90(int paramX) {
	for (int y = N - 1; y >= 0; y--) {
		cout << map[y][paramX];
	}
	cout << ' ';
}

void print180(int paramY) {
	for (int x = N - 1; x >= 0; x--) {
		cout << map[paramY][x];
	}
	cout << ' ';
}

void print270(int paramX) {
	for (int y = 0; y < N; y++) {
		cout << map[y][paramX];
	}
	cout << "\n";
}