resendes

public int subsetSumDinamycProgramming() {
    int[] x = {2,3,5,7,8,10,15};
    int t = 23;

    int n = x.length;
    int[][] s = new int[n+1][t+1];

    s[n][0] = 1;
    for (int j = 1; j <= t; j++) {
        s[n][j] = 0;