https://www.acmicpc.net/problem/2210코드#include using namespace std;#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);int arr[5][5], ans = 0;bool visit[1000000];int dx[4] = { 1, -1, 0, 0 }, dy[4] = { 0, 0, 1, -1 };void dfs(int x, int y, int sum, int cnt) { if (cnt == 5) { if (!visit[sum]) { visit[sum] = true; ans++; } return; } for (int i = 0; i = 0 && gy >= 0 && gy > arr[i][j]; for..
