본문 바로가기

분류 전체보기439

카카오 코딩테스트 실패율 2019. 2. 11.
백준 1018번 C++ #include #include #include using namespace std; const int MAX = 51;int m, n;string arr[MAX];string whitestart[8] = { { "WBWBWBWB" },{ "BWBWBWBW" },{ "WBWBWBWB" },{ "BWBWBWBW" },{ "WBWBWBWB" },{ "BWBWBWBW" },{ "WBWBWBWB" },{ "BWBWBWBW" }};string blackstart[8] = { { "BWBWBWBW" },{ "WBWBWBWB" },{ "BWBWBWBW" },{ "WBWBWBWB" },{ "BWBWBWBW" },{ "WBWBWBWB" },{ "BWBWBWBW" },{ "WBWBWBWB" } }; int calwhite.. 2019. 2. 4.
백준 3190번 C++ #include#include#includeusing namespace std; const int MAX = 102;int n, k;int apple[MAX][MAX];int l;pair movedir[101];int currentdir = 1;class Point {public:int x, y;Point(int x, int y) {this->x = x;this->y = y;}};deque snake; bool terminatecheck() {if (snake.front().x n || snake.front().y > n || snake.front().y > n >> k;memset(apple, 0, sizeof(apple));for (int i = 0; i .. 2019. 1. 29.
백준 14889번 C++ #include#include#includeusing namespace std; const int MAX = 21;int n;int arr[MAX][MAX];int minsum = 987654321; void dfs(string team, int start, int link) {if (start < n/2)dfs(team + "s", start + 1, link);if (link < n/2)dfs(team + "l", start, link + 1);if (team.size() == n) {vector startteam, linkteam;for (int i = 0; i < team.size(); i++) {if (team[i] == 's')startteam.push_back(i);elselinkteam.p.. 2019. 1. 28.

티스토리툴바