전체 글24 [C/C++] #1009 Fixing Distributed Processing, Efficient Problem Solving in Distributed Processing: Using Number TheoryWhen it comes to solving distributed processing problems, it is possible to solve them through brute force. However, for more efficient execution, number theory comes into play. The problem itself isn't hard to understand. Imagine you have N data points, and 10 computers sequentially process each data point one by one. The q.. 2024. 9. 26. Project Euler #11 : Largest product in a grid(Brute Force) This problem is actually hard to find efficient algorithms. Difficulty rating is 5%. I tried to solve it using the greed algorithm, but the greed algorithm doesn't always give the best results, but it's hard to expect a speedup because of the sorting time. Because sorting 400 data itself is basically more asymptotic than it is to compute all the products sequentially. I thought there was nothing.. 2020. 1. 26. BOJ #1007 Vector Matching(Mathematics) This is a Gold II problem. At first, I thought that it was a TSP program using dynamic programming, and I worked hard. It was a Gold I problem when I solved the problem, but the difficulty rating has been reduced. Somehow vector matching is the problem name, but it wasn't a TSP problem. And if it was a TSP problem, it would have been given a more difficult rating. If it was a TSP problem, you wo.. 2020. 1. 26. BOJ #1005 ACM Craft There are many kinds of algorithms related to graph theory, and there are various solutions to solve one problem. Algorithms consisting of prim, Dijkstra, and A * are the same, but the only difference is to find and update adjacent nodes. Floyd Warshal, Krscal, and so on. This topology sort algorithm is simple enough to memorize it. This problem difficulty ranked Gold II (about top 60% solver ca.. 2020. 1. 2. 이전 1 2 3 4 ··· 6 다음
