soicem's note

보호되어 있는 글입니다.

a[i] += a[i - coin[j]] : 경우의수a[i] = a[i - coin[j]] + 1 : 최소 동전수 1234567891011121314151617181920212223242526272829#include using namespace std; int coins[101];int d[10001];int main(){ int N, M; cin >> N >> M; for(int i = 1; i > coins[i]; } for(int i = 0; i

보호되어 있는 글입니다.

보호되어 있는 글입니다.

bfs에서 순서 알고 싶을때는 현재값 = 이전값 + 1 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051#include#define MAX 0x12345678using namespace std;int matrix[101][101];int visitedList[101][101];int tbrl[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};int N,M;int result = MAX; bool isInMatrix(int y, int x){ return (y 0) && (x 0);} void bfs(){ queue que; que.push(pair(1, 1));..

O(3^n) dp문제 - 근데 12345678910111213141516171819202122232425262728293031323334#include using namespace std;int N,M;int maze[1001][1001];int cache[1001][1001]; int findMaze(int i, int j){ if(i == N && j == M){ return maze[i][j]; } if(i > N || j > M){ return 0; } if(cache[i][j]!=-1){ return cache[i][j]; } int &ret = cache[i][j]; int result = findMaze(i + 1, j); result = max(result, findMaze(i + 1, j..

bfs 하기 1234567891011121314151617181920212223242526272829303132333435#includeusing namespace std;int K, N;int main(){ int N, M; int edgeList[101][101]; int visitedList[101]; memset(edgeList, 0, sizeof(edgeList)); memset(visitedList, 0, sizeof(visitedList)); cin >> N >> M; for(int i = 0;i > src >> dst; edgeList[src][dst] = 1; edgeList[dst][src] = 1; } queue que; que.push(1); visitedList[1] = 1; in..

bfs 3차원배열 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697#include #include #include #include using namespace std; int M, N, H;int box[101][101][101];int visitedList[101][101][101]; /*0 : raw tomato-1 : empty1 : cooked tomato*/int main(){ int rawCnt = 0; list q..

bfs 연습문제 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101/*6 40 0 0 0 0 00 0 0 0 0 00 0 0 0 0 00 0 0 0 0 1*/ #include #include #include #include using namespace std; int M, N;int box[1001][1001];int visitedList[1001][1001]; /*0 : raw tomato-1 : empty1..

j(n, v)에서 v가 원을 따라 움직이면 시작점도 따라 움직임 12345678910111213141516171819202122232425262728293031#include #include using namespace std; void josep(list queue, int loc) { while (!queue.empty()) { for (int i = 1; i