침대 밖은 위험해!

#include<iostream>
using namespace std;

int n, m, map[51][51], ans = 0;
int r, c, d;
int dr[4] = { -1, 0, 1, 0 };
int dc[4] = { 0, 1, 0, -1 };

int main(void){
	freopen("text.txt", "r", stdin);
	cin >> n >> m;
	cin >> r >> c >> d;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			cin >> map[i][j];

	while (true){
		if (map[r][c] == 0){
			map[r][c] = 2;
			ans++;
		}

		int k = 0, nd, nr, nc;
		for (; k < 4; k++){
			d = (d + 3) % 4;
			nr = r + dr[d];
			nc = c + dc[d];

			if (map[nr][nc] == 0){
				r = nr; c = nc;
				break;
			}
		}

		if (k == 4){
			nr = r - dr[d];
			nc = c - dc[d];

			if (map[nr][nc] == 1){
				break;
			}

			r = nr;
			c = nc;
		}
	}
	cout << ans << "\n";
	return 0;
}

#include<iostream>
using namespace std;

int n, a[12], s[4];
long long ans_max = -1000000000, ans_min = 1000000000;

void dfs(int cnt, int sum){
	if (cnt == n - 1){
		if (sum < ans_min)
			ans_min = sum;
		if (ans_max < sum)
			ans_max = sum;
		return;
	}

	if (s[0] > 0){
		s[0]--;
		dfs(cnt + 1, sum + a[cnt + 1]);
		s[0]++;
	}
	if (s[1] > 0){
		s[1]--;
		dfs(cnt + 1, sum - a[cnt + 1]);
		s[1]++;
	}
	if (s[2] > 0){
		s[2]--;
		dfs(cnt + 1, sum * a[cnt + 1]);
		s[2]++;
	}
	if (s[3] > 0){
		s[3]--;
		dfs(cnt + 1, sum / a[cnt + 1]);
		s[3]++;
	}
}

int main(void){
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	for (int i = 0; i < 4; i++)
		cin >> s[i];

	dfs(0, a[0]);
	cout << ans_max << "\n";
	cout << ans_min << "\n";
}