코딩일기

int main() { int arr[15]; for (int i = 0; i > arr[i]; } for (int i = 0; i < 15;i++) { arr[i]; } int A[5], B[5], C[5]; for (int i = 0; i < 5;i++) { A[i] = arr[i]; } for (int i = 0; i < 5;i++) { B[i] = arr[i+5]; } for (int i = 0; i < 5;i++) { C[i] = arr[i+10]; } for (int i = 0; i < 5;i++) { cout

#include #include using namespace std; void turnin(int arr[3][3]) { int result[3][3] = { 0 }; result[0][2] = arr[0][0]; result[1][2] = arr[0][1]; result[2][2] = arr[0][2]; result[0][1] = arr[1][0]; result[2][1] = arr[1][2]; result[0][0] = arr[2][0]; result[1][0] = arr[2][1]; result[2][0] = arr[2][2]; for (int i = 0; i < 3;i++) { for (int j = 0; j < 3;j++) { arr[i][j] = result[i][j]; } } } int ma..

#include #include using namespace std; int findpart(char *bfsent, int len, int board[10], int b, int f) { for (int i = 0; i > bfsent; // BFFB int b = 0; i..

숫자 다시 조합하기, 쉬운 방법 없을까 #include #include using namespace std; int findnum(int a, int digit) { //cout a; int ten =findnum(a, 10); //cout

#include #include using namespace std; struct Node { int a; Node* next; }; int main() { Node* head = new Node(); head->a = 3; head->next = new Node(); head->next->a = 5; head->next->next = new Node(); head->next->next->a = 4; head->next->next->next = new Node(); head->next->next->next->a = 2; Node* last = head; while (last != NULL) { cout anext->a 전에 head->next = new Node() 해주기

#include #include using namespace std; struct Node { char a; Node* left; Node* right; }; int main() { Node* head = new Node(); head->a = 'A'; head->left = new Node(); head->right = new Node(); head->left->a = 'B'; head->right->a = 'C'; head->left->left = new Node(); head->left->right = new Node(); head->left->left->a = 'D'; head->left->right->a = 'E'; char input[5]; cin >> input; int len = strle..

#include using namespace std; struct Node { int a; Node* left; Node* right; }; int main() { Node* head = new Node(); head->a = 3; head->left = new Node(); head->right = new Node(); head->left->a = 7; head->right = new Node(); head->right->a = 6; head->right->left = new Node(); head->right->left->a = 2; }