Programming/BOJ (21) 썸네일형 리스트형 [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.. [C/C++] BOJ #1032 - Command Prompt When working with files on a computer, wildcards (?) are often used to identify common patterns or to handle multiple files efficiently. In this problem, you need to determine a common pattern among multiple file names.You will be given N file names as input, and all file names have the same length. For each position in the file names, if all characters at that position are identical, you should.. [C/C++] BOJ #1026 - Treasure The problem “Treasure” (Baekjoon #1026) requires you to find the minimum possible sum of the product of two arrays, A and B.First, you are given two arrays, A and B, each containing N integers. You can rearrange the elements of A in any order, but the order of B must remain unchanged.The goal is to compute the sum of element-wise products between A and B such that the result is minimized. That i.. [C/C++] BOJ #1024 - Sum of Number Sequences. The problem “Sum of Number Sequences” (Baekjoon #1024) requires finding a sequence of consecutive integers whose sum equals a given number N, while ensuring that the length of the sequence is at least L. If multiple valid sequences exist, the shortest one should be chosen. If no such sequence can be found, the program should return -1. The sum of a sequence depends on how the sequence is struct.. [C/C++] BOJ #1021 - Rotating Queues The Baekjoon problem #1021 “Rotating Queue” involves using a deque to efficiently extract elements from specific positions. The goal of the problem is to calculate the minimum number of operations required to extract the desired elements in the given order. The term “operation” here refers to either rotating the deque one step to the left, one step to the right, or directly removing the first el.. [C/C++] BOJ #1019 - Book Page Han Ji-min loves books and works at a library. One spring night, while reading a book, she suddenly became curious about how many digits were written on the pages of the book she was flipping through. The book’s pages are numbered from page 1 to page N. Let’s calculate how many digits are written on the pages of the book she read. Although it’s a bit different from the original problem, I was.. [C/C++] BOJ #1018 - Paint Chess Board Again The Baekjoon #1018 - Paint Chess Board Again problem requires you to determine the minimum number of squares that need to be repainted on a given rectangular board so that it becomes a valid 8x8 chessboard.Problem Description:1. Input:• A board of size NxM (where N,M > 8).• Each cell of the board contains either 'W' (white) or 'B' (black).• A chessboard is valid if:• Adjacent cells (both horiz.. 이전 1 2 3 다음
