Talk:Solve hanging lantern problem: Difference between revisions
(Fixed Julia based on comment.) |
(Request rename.) |
||
| Line 1: | Line 1: | ||
The task should be renamed to begin with a verb and leave subsequent words uncapitalized. Perhaps `Solve_hanging_lantern_problem`? --[[User:Markjreed|Markjreed]] ([[User talk:Markjreed|talk]]) 21:43, 22 May 2022 (UTC) |
|||
The Julia solution considered two columns with the same number of lanterns indistinguishable, and therefore output a total of only 7 sequences when given 3 columns of 1, 3, and 3 lanterns. Since the problem statement gives an example in which each lantern is individually numbered, I infer that columns with the same number of lanterns should not be interchangeable and 3 columns [1,3,3] should yield 140 distinct sequences. I have edited the Julia solution to match this interpretation, and based a Raku solution on it. But perhaps some more clarity and/or some examples in the problem statement are called for. |
The Julia solution considered two columns with the same number of lanterns indistinguishable, and therefore output a total of only 7 sequences when given 3 columns of 1, 3, and 3 lanterns. Since the problem statement gives an example in which each lantern is individually numbered, I infer that columns with the same number of lanterns should not be interchangeable and 3 columns [1,3,3] should yield 140 distinct sequences. I have edited the Julia solution to match this interpretation, and based a Raku solution on it. But perhaps some more clarity and/or some examples in the problem statement are called for. |
||
-- [[User:Markjreed|Markjreed]] ([[User talk:Markjreed|talk]]) 21:24, 22 May 2022 (UTC) |
-- [[User:Markjreed|Markjreed]] ([[User talk:Markjreed|talk]]) 21:24, 22 May 2022 (UTC) |
||
Revision as of 21:43, 22 May 2022
The task should be renamed to begin with a verb and leave subsequent words uncapitalized. Perhaps `Solve_hanging_lantern_problem`? --Markjreed (talk) 21:43, 22 May 2022 (UTC)
The Julia solution considered two columns with the same number of lanterns indistinguishable, and therefore output a total of only 7 sequences when given 3 columns of 1, 3, and 3 lanterns. Since the problem statement gives an example in which each lantern is individually numbered, I infer that columns with the same number of lanterns should not be interchangeable and 3 columns [1,3,3] should yield 140 distinct sequences. I have edited the Julia solution to match this interpretation, and based a Raku solution on it. But perhaps some more clarity and/or some examples in the problem statement are called for. -- Markjreed (talk) 21:24, 22 May 2022 (UTC)