Problem If N natural numbers less than or equal to 10 are given, M out of them are selected and all methods are printed out. input The first line is given the natural numbers N(3<=N<=10) and M(2<=M<=N) In the second line, N natural numbers are given in ascending order output Prints the result on the…
Problem How can I exchange change for the smallest number of coins when several units of coins are given as follows? Each unit of coins can be used indefinitely. input In the first line, the number of types of coins N (1<=N<=12) is given. The second line is given N types of coins, and the next line…
Problem There are marbles numbered from 1 to N. Of these, duplicates are allowed, and all methods of selecting M times and arranging them are printed out. input The first line is given the natural numbers N(3<=N<=10) and M(2<=M<=N). output Prints the result on the first line. Prints the last total…
Problem In order to get good grades in this information olympiad, Hyun-soo is going to solve the N problems given by the teacher. Each question is given a score for solving it and the time it takes to solve it. We need to get the maximum score out of N problems within the time limit M. (The problem…
Problem Cheol-su wants to go to the market with his dog. But his truck cannot carry more than C kilograms. Cheol-su wants to burn his dog the most without going over C. Given N dogs and the weight W of each dog, write a program to find the heaviest weight that Cheolsu can carry in a truck. input The…
