Create distinct-subsequences.cpp

First attempt uses recursion, and exceeds time limitation.
Second attempt uses DP. matrix[i][j] represents how many distinct subsequences there are to match T from 0 to (i-1) in S from 0 to (j-1).