이경로

Difficulty : Gold V Problem Description There is an array of digits. You have to make a right equation using '-', '+'. '=' should be between the last digit and previous digit. The output is the count of right equations that you can make. Solution I solved this problem by counting the number of cases of each digits. 'n' and 'l' is the input, and 's' is the last digit for output. The last digit is..

Difficulty : Platinum V Problem Description There are many cards which mean 0 to 9. The number of cards is different by numbers. You have to make the largest number using all cards. And the same number should not be used continuously. Solution I checked all cases using conditional branches. 'c' is input of the number of cards. The index means the number, and value means the number of cards. 'l' ..

Difficulty : Platinum V Problem Description There are 'N' numbers, and you have to sort them which are never continuous. If there are several answers, choose the first one by alphabetical order. Solution 'N' is the number of numbers. 'l' is the list of numbers. Sort 'l' to solve the problem. 'a' is the output list, and -2 means that all the first number can be appended to 'a'. 'i' is the index o..

Difficulty : Gold V Problem Description There are N sensors and K centers. Each center has receivable area, and all sensors should be in these areas. The output is the minimum length of the sum of the areas. Solution 'N' and 'K' are the number of sensors and centers. 'lst' is input array of sensors. Sort 'lst' to calculate the answer. 'dis' is the distance of all sensors. There are 'N-1' distanc..

Difficulty : Silver IV Problem Description There is a floor sized N * M. You have to fill this floor with vertical and horizontal wooden plank. The input is 'N' and 'M' for the first line, and the design of the floor in the other line. If the part of the design is connected by one line, it can be made from a single wooden plank. Here is an example. When the input is '-------', only one plank who..

Difficulty : Gold V Problem Description Sungwon is on a diet. Sungwon remembered previous weight, and he took a new weight. He screamed because his weight was increased. He said 'G kilagrams', G is the difference between square of current weight and square of previous weight. The output is all weights possible with Sungwon's current weight. The weight must be natural number. If there aren't any ..

Difficulty : Gold V Problem Description There is 'N' sausages and 'M' food critics. The output is the smallest count to cut sausages to provide equally sized sausages among food critics. Solution Think of 'N' sausages as one sausages of length 'N'. In this case, count is always M-1 because I don't have to cut for the last person. And if sum of the length of all cut sausages is natural number, I ..

Difficulty : Gold V Problem Description There are 8 inputs, (W, H, f, c, x1, y1, x2, y2). There is a paper sized W*H. Fold the paper horizontally along f. Divide the paper vertically and fold it into c+1 equal parts. Paint the folded paper from (x1, y1) to (x2, y2). You have to calculate the unpainted area when you unfold the paper. Solution I calculated every cases by using conditionals. The ma..

Difficulty : Gold V Problem Description There are three numbers. If one is less than the sum of others, they are triangle. Triangular sequence is a sequence that every three elements are triangle. The input is the length of sequence 'N', and the sequence. The output is length of the longest triangular sequence that can be made up of input sequence. Solution I calculated all cases that can be mad..

Difficulty : Gold V Problem Description There are many cities, and Hyeong Taek wants to promote. Each city has the number of cost and customers. For example, if city A costs 5 to increase 3 customers, Hyeong Taek can use 15 won to increase 9 customers. You have to find out the minimum cost to increase the given number of customers. Input is C and N for the customers and the number of cities. And..