ring S is labeled from 1 to L(left to right), and S[i] represent the i-th char of S.&nbsp;</div>
<div></div>
<div>// Prime[k] means the k-th prime number, such as Prime[1]=2, Prime[2]=3 ,Prime[8]=19.</div>
<div>Input &gt;&gt; S</div>
<div>Score = 1</div>
<div>For i = 1 to L do</div>
<div>For k=1 to n do</div>
<div>If S[j..i] equals to Word[k]</div>
<div>Score = Score * Prime[k] * ( i * 2 - j + 1 )</div>
<div>Output &lt;&lt; Score</div>
<div></div>
<div>The pseudocode above shows when input S what