Programming/BOJ (27) 썸네일형 리스트형 [C/C++] BOJ #1011 Fly me to the Alpha Centauri This problem is about finding the minimum number of times a warp drive needs to be activated to travel to Alpha Centauri. Though it sounds like a space exploration problem, it essentially boils down to finding the largest number 'k' where the sum 1+2+3+...+k is less than half the distance to Alpha Centauri.Warping to Alpha CentauriAlpha Centauri is located approximately 4.37 light-years away fro.. [C/C++] #1010 Building bridges(combination) The Baekjoon Problem #1010 “Building Bridges” requires a certain understanding of the concept of combinations in probability and statistics. On one side of the river, there are N sites, and on the other side, there are M sites. The goal is to build bridges connecting the N sites on the left side to M sites on the right side, ensuring that the bridges do not cross each other. The question a.. [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 .. 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.. 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.. BOJ #1003 Fibonacci This problem was solved six months ago while solving the problems of Paekjoon Online Judgement Algorithm site. Fibonacci functions have a very simple structure, which is often mentioned as various properties are discovered. When learning the C/C ++ language, it is often discussed with the Tower of Hanoi to learn the concept of recursive functions. This question is not a high percentage of correc.. BOJ #1002 Turret. It seems that this problem was first solved after joining the Baekjun algorithm. An intellectual asked a question of the Baekjun algorithm, and I remember joining the Baekjun algorithm to answer it, and then solved some problems. At that time, I was attending Yonsei University, so I registered as Yonsei University, but it is already a few years ago. Since I had been used to the Euler project for.. 이전 1 2 3 다음
