BGGBR

SWEA 1217 거듭제곱 #include using namespace std; int tc; int n, m; int dfs(int num, int fixNum, int cnt){ if(cnt == m){ return num; } dfs(num * fixNum, fixNum, cnt + 1); } int main(void){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); tc = 10; int x; int totalNum; while(tc--){ cin >> x; cin >> n >> m; totalNum = dfs(n, n, 1); cout

SWEA 1954 달팽이 숫자 #include #include using namespace std; #define endl "\n" #define MAX 11 bool check[MAX][MAX]; int map[MAX][MAX]; int tc; int n, k; const int dy[] = {0, 1, 0, -1}; const int dx[] = {1, 0, -1, 0}; void rotate(int y, int x, int dir, int num){ check[y][x] = true; map[y][x] = num; int ny = y + dy[dir]; int nx = x + dx[dir]; if(nx = n || nx >= n || check[ny][nx] == 1){ dir ..

SWEA 1231 Inorder 문제 #include #include #include using namespace std; #define endl "\n" typedef struct _NODE{ char Data; _NODE *Left; _NODE *Right; }NODE; int tc = 10; int totalNum; bool flag = false; NODE *arr[101]; void inorder(NODE* tmp){ if(tmp == NULL){ return; } inorder(tmp -> Left); cout Data; inorder(tmp -> Right); } int main(void){ for(int k = 1; k > totalNum; if (totalNum % 2 == 1) flag..