Programming (96) 썸네일형 리스트형 [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/C++] Project Euler #63 - Powerful digit counts This is a problem involving powers, but unexpectedly, it’s quite easy. The difficulty level is only 5%. The problem is: How many n-digit numbers are also nth powers of some number?For example, \(16807 = 7^5\), and 16807 is a 5-digit number, which is exactly the 5th power of 7. Even a brute-force solution works just fine for this problem. First, only numbers less than 10 are worth considering as .. [C++] Project Euler #62 - Cubic Permutations This problem is rated at a difficulty level of 15%.Surprisingly, I solved it quite easily (using a brute-force method).The problem asks for the smallest number among five different cube numbers that are made up of the same digits.To be honest, if you were to solve this problem properly, you’d need to check that exactly five such numbers exist, but I didn’t go that far.I also excluded cases where.. [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++] Project Euler #61 - Cyclical Figurate Numbers This problem follows directly from problem 60 and is labeled as having a 20% difficulty level, but in my case, I didn’t find it particularly hard to solve.To tackle problems involving n-gonal numbers, it’s generally effective to focus on correctly checking whether a number satisfies the condition of being an n-gonal number. That approach should be sufficient without much difficulty.In this probl.. [C/C++] Project Euler #60 - Prime Pair Sets This is the first time I’m tackling a problem with a difficulty level of 20%.Although it’s called a prime pair, there isn’t really any deep mathematical concept involved.For example, if we take the two prime numbers 3 and 7, and simply concatenate them to form 37 and 73, and if both of these numbers are also prime, then (3, 7) is considered a prime pair.Such prime pairs exist infinitely, but the.. [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++] Project Euler #59 - XOR Decryption This problem is rated at a 5% difficulty level, but if solved in a standard way, I believe it would be more difficult than that.The method of decrypting this kind of cipher often involves brute-force repeated substitution. While simple repeated substitution can crack the cipher, it often takes thousands or even tens of thousands of years, even with the help of tens of thousands of computers. Thi.. [C++] Project Euler #58 - Spiral Primes #58 is a problem with a difficulty level of 5%.Although the problem may appear complex at first glance, it’s actually not difficult to solve at all.The key idea is that when you arrange numbers in a spiral starting from 1, the numbers that appear on the diagonals are always odd. In that case, the important part for solving this problem is to find the ratio of primes among the odd numbers located.. [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.. 이전 1 2 3 4 ··· 10 다음
