히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWS2h6AKBCoDFAVT #include #include #include using namespace std; long long L, R, N, result, flag;long long map[50000]; int main(){ long long T, t = 1; cin >> T; while (T--) { cin >> N; result = 0; flag = 0; memset(map, 0, sizeof(map)); for (long long i = 0; i > map[i]; L = 0; R = 0; for (long long..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWS2dSgKA8MDFAVT #include #include #include using namespace std; int np, p;string s; int main(){ int T, t = 1; cin >> T; while (T--) { np = 0; p = 0; cin >> s; for (int i = 0; i 0) && i > p) { np += (i - p); p += (i-p); } p +=(s[i]-48); } cout

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWSNnKiazq0DFAUr #include #include #include #include using namespace std; int N, result, sum, s1, s2, s3, flag, t;vector arr;vector v[2]; void cal(int count, int sss, int start){if (flag == 1) return;if (count == 3){cout

출처 :https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V61LqAf8DFAWu #include #include using namespace std; int N, M, K, result, MAX_K, num;int map[20][20]; void square(int i, int j, int depth){ int starti = i; int startj = j; while (1) { if (i >= 0 && j >= 0 && i < N && j < N) { if (map[i][j]) num++; } i--;j++; if (i == starti - depth && j == startj + depth) bre..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWIeUtVakTMDFAVH #include #include #include using namespace std; int N, result, total;int map[16][16];bool check[16]; int cal(vector &v){ int tmp = 0; for (int i = 0; i < total;i++) for (int j = 0; j < total; j++) {if (i == j) continue; tmp += map[v[i]][v[j]];} return tmp;} int sin(){ vector a; vector b; for (i..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V4A46AdIDFAWuSWEA::2115::벌꿀채취 #include #include #include using namespace std; int t, n, m, c;int map[10][10];int d[10][10]; //최대값 계산하기int calc(vector &v, int n, int sum, int val) { if (sum > c) return 0; if (n == v.size()) return val; return max(calc(v, n + 1, sum + v[n], val + v[n] * v[n]), calc(v, n + 1, s..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; #define INF 2e9 int N, numMAX, numMIN, tmp, tmp2;int op[4], arr[12]; void dfs(int num, int count){ if (count == N - 1) { numMAX = max(numMAX, tmp); numMIN = min(numMIN, tmp); return; } for (int i = 0; i 0) { if (i == 0) { tmp = num + arr[count + 1]; op[i]--;dfs(t..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V1SYKAaUDFAWu #include#includeusing namespace std; int D, W, K;int map[14][21];int cpy[14][21];int res; bool Check(){ bool isOk; int cnt; for (int j = 1; j > W >> K; for (int i = 1; i map[i][j]; cpy[i][j] = map[i][j]; } } res = 999; if (Check()) res = 0; else{ Solve(0, 0, 0); Solve(0, 1, 0); } cout

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; #define MAX_N 20 int N, result, starti, startj;int map[MAX_N][MAX_N];bool used[101];int dir[4][2] = { { 1,1 },{ 1,-1 },{ -1,-1 },{ -1,1 } }; void dfs(int i, int j, int count, int comdrc){ used[map[i][j]] = true; if (i-1 == starti && j+1 == startj) { result = max(result, count); used[map..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; #define MAX_N 9 int N, K, result, max_num;int map[MAX_N][MAX_N];bool check[MAX_N][MAX_N], used;int dir[4][2] = { { 1,0 },{ -1,0 },{ 0,1 },{ 0,-1 } }; void dfs(int i, int j, int count){ for (int d = 0; d = 0 && ..