Talk:Permutations with repetitions: Difference between revisions
Content added Content deleted
(→another variant of the REXX example: fix corrupted program. -- ~~~~) |
(→Isn't it just similar to "Increment_a_numerical_string": new section) |
||
| Line 79: | Line 79: | ||
interpret a |
interpret a |
||
say n**m 'permutations'</lang> |
say n**m 'permutations'</lang> |
||
== Isn't it just similar to "Increment_a_numerical_string" == |
|||
You set the length of the string to n fill it completly with "0" and set the base to k. |
|||
http://rosettacode.org/wiki/Increment_a_numerical_string#Pascal |
|||
Of course you can use an array of integer instead. |
|||