Question 1173545
.
If a password {{{highlight(cross(is))}}} {{{highlight(cross(consist))}}} <U>consists</U> of two letters {{{highlight(following)}}} by 3 digits , 
then how many different possible passwords will there be if repetition is allowed.
~~~~~~~~~~



<pre>
Assuming that 2 letter go first following by 3 digits, the answer is


    {{{26^2*10^3}}} = 676000.
</pre>