히더

출처 : https://www.hackerrank.com/challenges/queens-attack-2/problem?h_r=internal-search #include using namespace std; vector split_string(string); int queensAttack(int n, int k, int r_q, int c_q, vector obstacles) {int ans = 0;bool check[8] = {0,0,0,0,0,0,0,0};int ck[8] = { 0,0,0,0,0,0,0,0 }; for (int i = 0; i < k; i++) {int xr = obstacles[i][0]; int xc = obstacles[i][1];if (xr == r_q && xc != c_..

출처 : https://www.hackerrank.com/challenges/encryption/problem #include using namespace std; string encryption(string s) {string ans;int L = s.length(), row = sqrt(L), col = row + 1, it = 0; if (row*row == L) col -= 1;if (row*col < L) row += 1;char arr[10][10]; memset(arr, 0, sizeof(arr));for (int i = 0; i < row; i++) {for (int j = 0; j < col && it

출처 : https://www.hackerrank.com/challenges/non-divisible-subset/problem #include using namespace std; vector split_string(string);int check[100]; int nonDivisibleSubset(int k, vector S) {int ans = 0; memset(check, 0, sizeof(check));for (int i = 0; i < S.size(); i++) {S[i] %= k; check[S[i]]++;}int tmp = k / 2; int i = tmp; int j = tmp + 1;if (check[0]) ans++;if (!(k % 2)) {if (check[tmp]) ans++;i..