Skip to content

Commit

Permalink
Fiz case
Browse files Browse the repository at this point in the history
  • Loading branch information
deniscostadsc committed Jul 24, 2024
1 parent 2435220 commit f9dd2ea
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion solutions/beecrowd/1034/problem.md
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ Harbin in blocks of standard height and depth, and several different lengths.
The artist can determine the length he wishes his block of ice and the
sculpture can begin to be carved.

The lengths of the available blocks are {$A_1$; $A_2$; ...; $a_N$} and
The lengths of the available blocks are {$a_1$; $a_2$; ...; $a_N$} and
wished length by the artist is M. The block with length = 1 is widely used,
for this reason he always appears in the list of available blocks. Your
task is to find the minimum number of blocks such that the sum of their
Expand Down

0 comments on commit f9dd2ea

Please sign in to comment.