현구의 개발 블로그

https://www.acmicpc.net/problem/15654#include #include using namespace std;bool visit[8];int result[8];int arr[8];void dfs(int n, int m, int cnt){ if (cnt == m) { for (int i = 0; i > n >> m; for (int i = 0; i > arr[i]; } sort(arr, arr + n); dfs(n, m, 0);}

https://www.acmicpc.net/problem/15652#include using namespace std;bool visit[8];int result[8];void dfs(int start, int n, int m, int cnt){ if (cnt == m) { for (int i = 0; i > n >> m; dfs(1, n, m, 0);}

https://www.acmicpc.net/problem/15651#include using namespace std;bool visit[8];int result[8];void dfs(int n, int m, int cnt){ if (cnt == m) { for (int i = 0; i > n >> m; dfs(n, m, 0);}

https://www.acmicpc.net/problem/15650#include using namespace std;bool visit[8];int result[8];void dfs(int start, int n, int m, int cnt){ if (cnt == m) { for (int i = 0; i > n >> m; dfs(1, n, m, 0);}

https://www.acmicpc.net/problem/15649#include using namespace std;bool visit[8];int result[8];void dfs(int n, int m, int cnt){ if (cnt == m) { for (int i = 0; i > n >> m; dfs(n, m, 0);}

https://www.acmicpc.net/problem/9095#include using namespace std;int T = 0;int main(){ cin >> T; int dp[11]; dp[1] = 1; dp[2] = 2; dp[3] = 4; for (int i = 4; i > n; cout

https://www.acmicpc.net/problem/6064 #include using namespace std;int get_count;int gcd(int x,int y) { if (y > x) { int tmp = x; x = y; y = tmp; } while ((x % y) != 0) { x = x % y; int tmp = x; x = y; y = tmp; } return y;}int lcm(int x,int y){ return x * y / gcd(x, y);}int main(){ cin >> get_count; while (get_count--) { int m, n, x, y; cin >> m >> n >> x >> y; int limit = lcm(m, n); i..