We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
ID: methodicmultiplication
Difficulty: 1.6
CPU Time: 2 seconds
Memory: 1024 MB
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 ")".
There was an error while loading. Please reload this page.