TWO STRING -L JOINT

Question

Given two string S1 and S2 where the last letter of one of the strings is same as the first letter of the other string print the out put as given input/output section

intput format:
the first line contains S1.
the second line contain S2.

output format;
L lines contain the desired output where L is the length of the string whose last letter is same as the first letter of the other string.

Boundary containings:
2<length of S1 and S2<100

Example input/output 1:
input:
elephant
tiger

output:
e****
l****
e****
p****
h****
a****
n****
tiger

Answer 1

This is what I came up with:
https://code.sololearn.com/cFswD1pReael/#cpp

I'm still somewhat confused by the instructions but I think I got the gist of it.