From f9dd2eac62cbb68aac1cd9d5d039d9287c0c79bd Mon Sep 17 00:00:00 2001 From: Denis Costa Date: Wed, 24 Jul 2024 10:05:23 -0300 Subject: [PATCH] Fiz case --- solutions/beecrowd/1034/problem.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/solutions/beecrowd/1034/problem.md b/solutions/beecrowd/1034/problem.md index 498254f1..1640f1fa 100644 --- a/solutions/beecrowd/1034/problem.md +++ b/solutions/beecrowd/1034/problem.md @@ -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