Talk:Count the coins/0-1: Difference between revisions
→Several problems
| (4 intermediate revisions by 2 users not shown) | |||
Line 25:
::We already have a task for finding all permutations of 1 and 5.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 16:50, 6 January 2021 (UTC)
::Why would you want to count [1,2,3] as either 4 ("order unimportant") or 24 ("order important") different ways to get 6 - which is what '''all''' of the solutions so far do for the middle case ...??!! --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 17:29, 7 January 2021 (UTC)
==Duplicate Task?==
Line 36 ⟶ 38:
::::'archbishop' and 'balm' could both have value 5. Ordering here just means find all permutations of a solution. We have a task for finding all permutations of a set.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 17:07, 6 January 2021 (UTC)
::::Here I am looking for an number as ouput and the problem you are talking about wants a set. Let say it is minor difference. The order matters here while it doesn't in the problem you are talking about. Let say also it is a minor difference. The target sum is always zero in the problem you are talking when it may change here. Let say also it is minor difference. Want zero as sum may cause algorithms to use the idea to split set in 2 sets (negative and positive numbers) not easily transferable in this case. Let say it is a minor difference. I won't say many minor differences give a minor difference. --[[User:Blek|Blek]] ([[User talk:Blek|talk]]) 17:27, 6 January 2021 (UTC)
: It is also very similar to [[Permutations_with_some_identical_elements]] with one extra condition. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 22:32, 6 January 2021 (UTC)
| |||