Create program that counts the total number of letters common to two names, and finds the product of their lengths, to function as a "love tester."
Conditions: you may not get a 1:1 answer (being 3 out of 3, etc.) output.
Two names from STDIN or closest alternative.
x as the total number of letters in common between the two names, ignoring case. Compute
y as the product of the lengths of the names. Then the output, to STDOUT or closest alternative, is
Name1 and Name2 have x out of y chances of love.
Wesley and Polly have 2 out of 30 chances of love.
Wesley and Polly have 2 letters in common,
l, and the product of their lengths is 6 * 5 = 30.
Bill and Jill have 3 out of 16 chances of love.
- Subtract 30 bytes for using simplified fractions, i.e.
x out of yis in fully reduced form.
This is code-golf answers will be scored in bytes with fewer bytes being better.