코딩일기

#include #include using namespace std; int main() { int arr[3][3]; for (int i = 0;i > arr[i][j]; } } int max[2][3] = { 0 }; for (int k = 0; k < 2;k++) { int *samp = &max[k][0]; int *sampx = &max[k][1]; int *sampy = &max[k][2]; for (int i = 0; i < 3;i++) { for (int j = 0; j < 3;j++) { if (*samp < arr[i][j]) { *samp = arr[i][j]; *sampx = i; *sampy = j; ..

#include #include using namespace std; struct Node { char a; Node* next; }; Node* head; Node* last; void addnode(int abc) { if (head == NULL) { head = new Node(); head->a = abc; last = head; } else { Node* temp; temp = new Node(); temp->a = abc; temp->next = head; // AGAIN! its not head->next head = temp; } } int main() { char sent[16]; cin >> sent; int len = strlen(sent); for (int i = 0; i < le..

구조체 사용문제인데 진격의 거인 관련 문제라서 재밌게 풀었음 ㅋㅋㅋㅋㅋ #include struct Tlrquf{ int a; int b; }; int main(){ int n; scanf("%d\n", &n); // 입체기동장치의 갯수 1~100 struct Tlrquf t[n]; for (int i = 0; i

new 로 변수 만들기 char *a = new char(); 이렇게도 가능 #include #include using namespace std; int findin(char *a, char *b, char *c) { if (*a 'Z') return -1; if (*b 'Z') return -1; if (*c 'Z') return -1; return 0; } int main() { char* a = new char(); char* b = new char(); char* c = new char(); cin >> *a >> *b >> *c; //cout

#include #include using namespace std; int main() { int arr[6]; for (int i = 0; i > arr[i]; } char command[7]; cin >> command; for (int i = 0; i arr[j]) { min = arr[j]; minind = j; } } if (minind != i) { int temp; temp = arr[i]; arr[i] = arr[minind]; arr[minind] = temp; } } int m = 0; int x = ..

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() 해주기