침대 밖은 위험해!

#include<iostream>
using namespace std;

int n, h[51][2];

int main(void){
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> h[i][0] >> h[i][1];

	for (int i = 0; i < n; i++){
		int cnt = 1;
		for (int j = 0; j < n; j++){
// i == j인 경우는 몸무게와 키가 같기 때문에 등수에 영향이 없음
			if (h[i][0] < h[j][0] && h[i][1] < h[j][1])
				cnt++;
		}
		cout << cnt << " ";
	}
	return 0;
}

#include<iostream>
using namespace std;

int K, S[14], P[6];

void dfs(int index, int in, int size){
	if (size == 6){
		for (int i = 0; i < 6; i++)
			cout << P[i] << " ";
		cout << "\n";
		return;
	}

	for (int i = index; i < K; i++){
		P[in] = S[i];
		dfs(i + 1, in + 1, size + 1);
	}
}

int main(void){
	freopen("Text.txt", "r", stdin);
	while ((cin >> K) && K != 0){
		for (int i = 0; i < K; i++)
			cin >> S[i];
		dfs(0, 0, 0);
		cout << "\n";
	}
}

#include<iostream>
using namespace std;

int h, w;
int dr[4][3] = { { 1, 0, 0 }, { 1, 1, 0 }, { 0, 1, 1 }, { 0, 0, 1 } };
int dc[4][3] = { { 0, 0, 1 }, { -1, 0, 0 }, { 0, 0, 1 }, { 0, 1, 1 } };

int dfs(char(*map)[21]){
	// 블럭을 채울 공간을 찾음
	int row, col, ret = 0;
	bool isWhiteBlock = false;

	for (int i = 0; i < h; i++){
		for (int j = 0; j < w; j++){
			if (map[i][j] == '.'){
				row = i; col = j;
				isWhiteBlock = true;
				break;
			}
		}

		if (isWhiteBlock)
			break;
	}

	// 하나의 경우의 수를 찾음
	if (!isWhiteBlock)
		return 1;

	// 4개의 경우를 찾음
	int i = 0;
	for (; i < 4; i++){
		bool isCover = true;
		for (int j = 0; j < 3; j++){
			int nrow = row + dr[i][j];
			int ncol = col + dc[i][j];

			if (nrow < 0 || nrow >= h || ncol < 0 || ncol >= w || map[nrow][ncol] != '.'){
				isCover = false;
				break;
			}
		}

		if (isCover){
			cnt += 1;
			map[row + dr[i][0]][col + dc[i][0]] = '#';
			map[row + dr[i][1]][col + dc[i][1]] = '#';
			map[row + dr[i][2]][col + dc[i][2]] = '#';
			ret += dfs(map);
			map[row + dr[i][0]][col + dc[i][0]] = '.';
			map[row + dr[i][1]][col + dc[i][1]] = '.';
			map[row + dr[i][2]][col + dc[i][2]] = '.';
		}
	}

	return ret;
}

int main(void){
	freopen("Text.txt", "r", stdin);
	int T;
	cin >> T;
	while (T--){
		cnt = 0;
		cin >> h >> w;
		char map[21][21];
		int white_block = 0;
		for (int i = 0; i < h; i++){
			for (int j = 0; j < w; j++){
				cin >> map[i][j];
				if (map[i][j] == '.') white_block++;
			}
		}

		if (white_block == 0)
			cout << '1' << "\n";
		else if (white_block % 3 == 0){
			cout << dfs(map) << "\n";
			cout << "cnt : " << cnt << "\n";
		}
		else
			cout << '0' << "\n";
	}
	return 0;
}