Programming/BOJ (27) 썸네일형 리스트형 [C/C++] BOJ #1074 - Z This problem involves the concept of self-replication.The large shape forms a Z pattern, and the smaller shapes within also form Z patterns. The task is to find the number at a given row and column when the array is filled according to this Z-pattern structure.If the array is 2x2, the numbers are arranged in a Z pattern as shown in the diagram. As the size increases, the pattern becomes more com.. [C/C++] BOJ #1068 - Tree This problem is about finding the number of leaf nodes after deleting a specific node in a tree. As shown in the figure above, when a tree is given and, for example, node 1 is deleted, nodes 3 and 4 are also deleted as a result. Only node 2 remains as a leaf node. The task is to count such remaining leaf nodes. Although the difficulty is marked as Silver I, the implementation itself is not very .. [C++] BOJ #1067 - Moving This problem is classified as Platinum II difficulty.To solve this problem, you need to understand convolution codes. Convolution codes are broadly categorized into non-cyclic and cyclic codes. This problem is related to cyclic convolution codes. Though convolution codes are widely used in communication, they are also an important concept in understanding systems in general.You are given two seq.. [C/C++] BOJ #1057 - Tournament A tournament match is a competition where two teams or players face off, and the winner advances to the next round. It fundamentally follows a binary tree structure.Problem DescriptionThe problem is to determine when two players, A and B, will meet in a tournament, assuming players are lined up from 1 to N in order. Once you recognize that this is essentially a binary tree, the problem becomes q.. [C/C++] BOJ #1051 - Number Square The problem itself is quite simple. Its difficulty is rated as Silver III, so it’s not particularly hard. However, the correct answer rate is relatively low, around 37%.You are given an N×M matrix of numbers, and the task is to select four numbers that form a square — meaning the four numbers should be aligned parallel to the rows and columns, forming the corners of a square — and all four numbe.. [C/C++] BOJ #1049 - Guitar string This problem can be solved simply by performing basic division and appropriate multiplication. Although it is classified as a Silver IV problem, it actually feels easier in terms of difficulty. However, the correct answer rate is quite low at 29.3%.This may be because people are prone to mistakes if they have preconceived notions. If you abandon the assumptions that bundle products should be che.. [C/C++] BOJ #1041 - Dice This problem can be easily solved if you can visualize the geometric structure of a cube. Perhaps that’s why its difficulty level is quite low. The difficulty is Silver III. While it is harder than Bronze-level problems, it’s not too difficult.As of now, the correct answer rate is 22.6%, which is quite low, and there are 531 correct submissions.The goal of the problem is to calculate the minimum.. [C/C++] BOJ #1038 - Decreasing Number This problem is one I solved back when I was working through a lot of Baekjoon problems. At that time, I used to solve around 20 problems a day, but now the difficulty level of the problems has increased, and they require more thinking, so I can’t solve as many anymore.A “decreasing number” is a number where the digits strictly decrease, such as 31, 7543, or 941. The goal is to list all such num.. [C/C++] BOJ #1037 - Divisors BOJ #1037 is a problem related to divisors and number properties. The problem provides a list of divisors of a certain positive integer N, except for 1 and N itself. The task is to determine the actual value of N using only the given divisors. The key observation is that the smallest and largest divisors in the given list, when multiplied together, yield N. This is because if all the divisors ar.. [C/C++] BOJ #1036 - Base 36 The problem “Baekjoon #1036 - Base 36” requires converting and maximizing a numerical value in base 36.In base 36, the digits range from 0-9 and A-Z, where ‘A’ represents 10, ‘B’ represents 11, …, and ‘Z’ represents 35. The input consists of several numbers written in base 36, and the task is to maximize the sum of these numbers by replacing at most one character (‘0’-‘Z’) with ‘Z’ (35) in all o.. 이전 1 2 3 다음
