코딩일기

#include #include using namespace std; int binse[10] = { 4,4,5,7,8,10,20,22,23,24 }; int ans = 100; int bin_search(int start, int end, int target) { if (start > end) return 1; int mid = (start + end) / 2; if (binse[mid] == target) { ans = 0; return 0; } else if (binse[mid] > target) { bin_search(start, mid - 1, target); } else { bin_search(mid + 1, end, target); } return ans; } int main() { int ..

#include #include #include using namespace std; //bingary search tree int map[30] = { 0,15,7,19, 0,8,17,25, 0,0,0,0,16,18 }; void find(int target, int now, int num) { //now = 1; if (now >= 30 || map[now] == 0) { cout

#include #include #include using namespace std; char arr[100] = { 0 }; char find_boss(char ch) { if (arr[ch] == 0) return ch; char ret = find_boss(arr[ch]); return ret; } void setUnion(char a, char b){ char apar = find_boss(a); char bpar = find_boss(b); if (apar == bpar) return; arr[bpar] = apar; } int main() { int n; cin >> n; for (int i = 0; i > a >> b; if (find_boss..

#include #include #include using namespace std; int arr[10][10]; int n, spinn; int result[10][10]; void spin(int nline) { for (int i = 0;i > n >> spinn; for (int i = 0; i < n;i++) { for (int ..

#include #include #include using namespace std; string abc[3] = { "ABCEFG", "HIJKLM", "NOPQRS" }; string result[3] = { "ABCEFG", "HIJKLM", "NOPQRS" }; string inputabc; int direct[5][2] = { {0,-1}, {0,1}, {1,0}, {-1,0}, {0,0} }; void flip(char a) { int ay, ax; for (int i = 0; i < 3;i++) { for (int j = 0; j < 6;j++) { if (a == abc[i][j]) { ay = i; ax = j; } } } for (int i = 0; i < 5;i++) { int dy,..

#include #include #include using namespace std; string tline[6] = { "ABCD", "ABCE", "AGEH", "EIEI", "FEQE", "ABAD" }; int main() { string answer; cin >> answer; //?B?? int cnt = 0; for (int i = 0; i < 6;i++) { int qnum = 0, anum = 0; for (int j = 0; j < 4;j++) { if (answer[j] != '?') { qnum++; if (tline[i][j] == answer[j]) { anum++; } } } if (qnum == anum) { cnt++; } } cout

#include #include #include using namespace std; intbucket[26] = { 0 }; bool compare1(char a, char b) { return a > b; } bool compare2(char a, char b) { return bucket[a - 'A'] > bucket[b - 'A']; } int main() { string t; cin >> t; int num; cin >> num; sort(&t[0], &t[t.length()], compare1); //cout

#include #include using namespace std; struct node { int num; char name[10]; }; node queue[50]; int main() { int cong, ppl; cin >> cong >> ppl; int arr[20] = { 0 }; // cong nums for (int i = 0; i > queue[i].num >> queue[i].name; arr[queue[i].num]++; } int max = 0, maxind = 0; for (int i = 0; i max) { max = arr[i]; maxind = i; } } for (int i = 0; i < p..

#include #include #include #include using namespace std; vectorarr; int main() { int n; cin >> n; for (int i = 0; i > num; arr.push_back(num); int len = arr.size(); if (len >= 2) { if (arr[len - 1] == arr[len - 2] && arr[len-2] == arr[len - 3]) { // bomb arr.pop_back(); arr.pop_back(); arr.pop_back(); } } } int len = arr.size(); sort(&arr[0], &arr[len]); for (int i = 0; ..

#include #include #include using namespace std; int main() { int arr[1000] = { 0 }; int n; cin >> n; for (int i = 0; i > arr[i]; } int result[4]; result[0] = arr[0]; for (int i = 1; i 2) y = 3; result[y] = arr[i]; for (int j = y; j > 0;j--) { //cout