코딩일기

#include using namespace std; int min = 1000; int path[4]; int main() { int n; cin >> n; int arr[5]; for (int i = 0; i > arr[i]; } int used[5] = { 0 }; int answer[3] = { 9,9,9 }; for (int i = 0;i arr[i]) { used[i] = 1; answer[0] = arr[i]; } } } } for (int k = 1; k < 3;k++) { int temp; for (int i = 0;i < n;i++) { if..

#include using namespace std; int board[6][6]; char name[7] = "ABCDEF"; char path[6]; void abc(int now, int lev) { int cnt = 0; for (int i = 0; i < 6;i++) { if (board[now][i] == 1) { path[lev] = name[i]; abc(i, lev+1); path[lev] = 0; } else { cnt++; } } if (cnt == 6) { cout board[i][j]; } } path[0] = name[0]; abc(0, 1); } 입력 예제 0 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ..

#include using namespace std; int isitSame(int arr[3][3], int brr[3][3]) { for (int i = 0; i < 3;i++) { for (int j = 0; j < 3;j++) { if (arr[i][j] != brr[i][j]) { return 0; } } } return 1; } void turn(int arr[3][3]) { int result[3][3]; result[2][0] = arr[0][0]; result[1][0] = arr[0][1]; result[0][0] = arr[0][2]; result[2][1] = arr[1][0]; result[1][1] = arr[1][1]; result[0][1] = arr[1][2]; result..

#include #include using namespace std; int main() { vectorarr = { 'B', 'H','A','I' }; int n; cin >> n; for (int i = 0;i < 3;i++) { int len = arr.size();// 4 int ind = n % len -1; // 5%4 == 1 cout

#include using namespace std; int arr[5]; int path[6]; int sum; int cnt; void abc(int lev, int sum, int head) { if (sum > 20)return; if (lev == 5) { if (sum >= 10 && sum

#include using namespace std; int n; int map[11] = { 0,3,1,2,1,3,2,1,2,1,0 }; void abc(int nowind, int addn) { if (nowind == 10) { cout

크~ strcmp(s1, s2) == 0 일때 같다. #include #include using namespace std; char path[5]; char named[10][5]; int cnt[10]; int found[3]; void abc(int which, int lev) { //named[which] = AAAC //cout n; for (int i = 0; i > named[i]; } for (int i = 0; i < n;i++) { abc(i, 0); } for (int i = 0; i < n;i++) { cout

#include using namespace std; int n; char path[10]; void abc(int lev, int border) { if (lev == border) { cout

#include using namespace std; int main() { int arr[6] = { 1,5,4,2,-5,-7 }; int n; cin >> n; // sort -> ind; for (int i = 0; i < 5;i++) { int min = arr[i]; int minind = i; for (int j = i + 1;j < 6;j++) { if (min < arr[j]) { min = arr[j]; minind = j; } } if (minind != i) { swap(arr[minind], arr[i]); } } cout

#include using namespace std; int map[6][6] = { 0,1,0,0,1,0, 0,0,1,0,0,1, 0,0,0,1,0,0, }; struct Node { int a; }; Node queue[20]; int head = 0; int tail = 1; int st; int used[6]; int main() { cin >> st; queue[0].a = st; while (head != tail) { Node now = queue[head]; cout