코딩일기

#include using namespace std; char map[6] = "_____"; int index, life; int main() { cin >> index >> life; // worm going to right int out = 1; while (out) { if (index > 4) { out = 0; break; } if (life == 0) { cout

#include using namespace std; int gear1[4] = { 3,7,4 }; int gear2[4] = { 2,6,9 }; int gear3[4] = { 5,1,2 }; int gear4[4] = { 3,6,7 }; int geared[4][4] = { 3,7,4,0, 2,6,9,0, 5,1,2,0, 3,6,7,0, }; void turned(int gear[4], int num) { // 3740 1 if (num % 3 == 1) { for (int i = 2;i >= 0;i--) { gear[i + 1] = gear[i]; } gear[0] = gear[3]; return; } else if (num % 3 == 2) { for (int i = 2;i >= 0;i--) { g..

#include using namespace std; int arrleft[4] = { 3,5,9,10 }; int arrright[4] = { 2,6,9,11 }; int result[8]; int lft = 0; int rht = 0; int head = 0; int main() { for (int i = 0; i > arrleft[i]; } for (int i = 0; i > arrright[i]; } while (head != 8) { if (rht == 4){ for (int i = lft; i < 4;i++) { result[head] = arrleft[i]; head++; } } else if (lft == 4) { for (int i..

#include using namespace std; int evid[7] = { -1,0,0,1,2,4,4 }; int timeStemp[7] = { 8,3,5,6,8,9,10 }; int st; void abc(int num) { if (num == 0) { // index = 0; cout

#include using namespace std; struct Node { int x; }; Node queue[20]; int main() { queue[0].x = 1; int head = 0; int year; cin >> year; for (int i = 0; i < year;i++) { queue[i + 1].x = queue[i].x * 3; } int sum = 0; for (int i = 0; i < 20;i++) { if (queue[i].x == 0)break; sum += queue[i].x; } cout

#include using namespace std; char name[7]; int map[5][5] = { 0,1,1,0,0, 0,0,0,1,1, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, }; void dfs(int now) { cout > name; dfs(0); } 인접행렬로 dfs 구현하기

#include using namespace std; int map[6][6]; struct Node { int a; }; Node queue[20]; int head = 0; int tail = 1; int main() { for (int i = 0; i > map[i][j]; } } queue[0] = { 0 }; while (head != tail) { Node now = queue[head]; if (now.a % 2 == 1) { cout

#include using namespace std; struct Node { char a; Node* left; Node* right; }; char name[15]; Node* head; Node* last; void addnode(int num, Node*now) { if (num > 7) return; if (name[num] == '0') return; if (name[num] >='A' && name[num]left = new Node(); head->right = new Node(); addnode(num * 2, head->left); addnode(num * 2+1, head->right); } int main() { cin >> name; for (int i = 5; i >=0;i--)..

#include using namespace std; void fillup(int arr[4][4], int y, int x, int now) { int divide[4][2] = { {-1,0}, {0,-1}, {0,1}, {1,0}, }; int dy, dx; for (int i = 0;i = 0 && dx >= 0 && dy x; int arr[4][4] = { 0 }; arr[y][x] = 1; int now = 1; while (1) { int cnt = 0; for (int i = 0; i ..

#include using namespace std; /* */ int main() { int arr[5][4]; for (int i = 0; i > arr[i][j]; } } int fullline[5] = { 0 }; for (int i = 0; i =0;i--) { if (fullline[i] != 1) { ..