알고리즘/Divide and Conquer-일반4 QuadTree 더블릿 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384#include #include #include #include #include using namespace std;queue q;stack change;stack rst;int arr[550][550] = { 0 }; int main() { int n; scanf("%d", &n); for (int i = 1; i 2019. 3. 5. 색종이 만들기 더블릿 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include int arr[1000][1000] = { 0 };int white = 0, pink = 0; void cut(int y, int x, int len) { int num = arr[y][x],flag=0; for (int i = y; i 2019. 2. 13. catoring along 더블릿 1234567891011121314151617181920212223242526272829303132333435363738#include #include using namespace std;int arr[10000000] = { 0 }; void cut(int st, int end) { if (st == end) return; int n = end - st + 1; n /= 3; for (int i = st + n; i 2019. 2. 13. 1992 쿼드트리 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354#include int arr[100][100] = { 0 }; void same(int y,int x,int n) { if (n 2019. 2. 11. 이전 1 다음