Hey guys,

i recently went through the LCS PROBLEM REVISITED turorial thats been up in the tutorials section…

I was pretty much able to understand everything clearly, but this one part still seems obscure…

about counting the no of LCS in the given two strings…

this is a part of the code given in the tutorial for counting the no of distinct LCS…

if (lcs[x][y] == lcs[i][j] - 1) {

lcscount[i][j] = (lcscount[i][j] + lcscount[x][y])%23102009;

}

I’m not able to understand this particular part !!

if someone make things a little bit clear It’ll be very helpful thanks !