Talk:Permutations with some identical elements: Difference between revisions
Content added Content deleted
(Added comment.) |
(added a query about task wording.) |
||
| Line 10: | Line 10: | ||
:Yes, you're right; it is different. I've added a Go solution --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 21:27, 25 July 2019 (UTC) |
:Yes, you're right; it is different. I've added a Go solution --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 21:27, 25 July 2019 (UTC) |
||
== task wording == |
|||
Where it says: |
|||
Given an input of the form [a1, a2, ..., ak] where ai denotes how many duplicates of element i you should have, |
|||
each ai > 0 and the sum of all ai is n. |
|||
would it be better with: |
|||
Given an input of the form <big>[a1, a2, ..., ak]</big> where <big>a<sub>k</sub></big> denotes how many duplicates of element <big>k</big> you should have, |
|||
each <big>a<sub>k</sub></big> > 0 and the sum of all <big>a<sub>k</sub> is <big>'''n'''</big>. |
|||
(I've added whitespace and used a bigger font to make the subscripts easier to read.) -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 03:51, 27 July 2019 (UTC) |
|||