히더

출처 : 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..