Skip to content

methodicmultiplication

bradendubois edited this page Jun 9, 2021 · 6 revisions

Methodic Multiplication

ID: methodicmultiplication

Difficulty: 1.6

CPU Time: 2 seconds

Memory: 1024 MB

Solution

Read in both strings, and just count the occurrences of "S" in each string, and multiply them. Print that many "S("s, 0, and that many ")".

Clone this wiki locally