title: skipping recursion
body: <p>The first line is a number, int x. The following m lines contain letters.  After m lines, you read in a number, int y.</p>
  
  <p>The goal is to find the soluiton number, int y, from recursion of 1 letter from each line.</p>
  
  <p>The problem states that there’s a much faster solution which avoids going through each possible password. That is where my question is. How can this be done? Any help would be greatly appreciated.</p>