深搜的学习

/**
给定整数a0、a1、.......an，判断是否可以从中选出若干数，使它们的和恰好为K。
输入：
n=4  k=11  a={1,2,4,7}
输出：
Yes（11=4+7）
刚学深搜虽然会简单的应用，却不是十分了解函数的执行过程，
今天决定好好分析一下：
首先调用dfs函数后从0进入函数，然后判断i是否等于n若等于则返回true或false
若不等于就开始执行dfs(i+1,sum),一直到执行到i=4，此时i+1=5
5 6
1 2 3 4 5
******************
这一部分是执行
dfs(i+1,sum)的结果
i = 0 sum = 0
i+1 = 1 sum = 0
i+1 = 2 sum = 0
i+1 = 3 sum = 0
i+1 = 4 sum = 0
i+1 = 5 sum = 0
******************
此时开始进行后退
然后在进，再退的
过程，直到找到目
标解
********************************************************
i+1 = 5 sum = 5///从5开始退，取当前
i+1 = 4 sum = 4///退到4取当前
i+1 = 5 sum = 4///进到5，不取当前
i+1 = 5 sum = 9///还是从5再退，取当前
********************************************************
i+1 = 3 sum = 3///这里相当于从4退到3，并且取当前
i+1 = 4 sum = 3///开始前进4，不取当前
i+1 = 5 sum = 3///进到5不取当前
i+1 = 5 sum = 8///再从5开始退，取当前
i+1 = 4 sum = 7///退到4，取当前
i+1 = 5 sum = 7///再进到5，不取当前
i+1 = 5 sum = 12///再退，取当前
********************************************************
i+1 = 2 sum = 2
i+1 = 3 sum = 2
i+1 = 4 sum = 2
i+1 = 5 sum = 2
i+1 = 5 sum = 7
i+1 = 4 sum = 6
i+1 = 5 sum = 6
YES
#######################################################
完整的执行过程
5 50
1 2 3 4 5
i = 0 sum = 0
i+1 = 1 sum = 0
i+1 = 2 sum = 0
i+1 = 3 sum = 0
i+1 = 4 sum = 0
i+1 = 5 sum = 0
****************************5退4进5
i+1 = 5 sum = 5
i+1 = 4 sum = 4
i+1 = 5 sum = 4
i+1 = 5 sum = 9
****************************4退3进5
i+1 = 3 sum = 3
i+1 = 4 sum = 3
i+1 = 5 sum = 3
i+1 = 5 sum = 8
i+1 = 4 sum = 7
i+1 = 5 sum = 7
i+1 = 5 sum = 12
****************************3退2进5
i+1 = 2 sum = 2
i+1 = 3 sum = 2
i+1 = 4 sum = 2
i+1 = 5 sum = 2
i+1 = 5 sum = 7
i+1 = 4 sum = 6
i+1 = 5 sum = 6
i+1 = 5 sum = 11
i+1 = 3 sum = 5
i+1 = 4 sum = 5
i+1 = 5 sum = 5
i+1 = 5 sum = 10
i+1 = 4 sum = 9
i+1 = 5 sum = 9
i+1 = 5 sum = 14
****************************2退1进5
i+1 = 1 sum = 1
i+1 = 2 sum = 1
i+1 = 3 sum = 1
i+1 = 4 sum = 1
i+1 = 5 sum = 1
i+1 = 5 sum = 6
i+1 = 4 sum = 5
i+1 = 5 sum = 5
i+1 = 5 sum = 10
i+1 = 3 sum = 4
i+1 = 4 sum = 4
i+1 = 5 sum = 4
i+1 = 5 sum = 9
i+1 = 4 sum = 8
i+1 = 5 sum = 8
i+1 = 5 sum = 13
i+1 = 2 sum = 3
i+1 = 3 sum = 3
i+1 = 4 sum = 3
i+1 = 5 sum = 3
i+1 = 5 sum = 8
i+1 = 4 sum = 7
i+1 = 5 sum = 7
i+1 = 5 sum = 12
i+1 = 3 sum = 6
i+1 = 4 sum = 6
i+1 = 5 sum = 6
i+1 = 5 sum = 11
i+1 = 4 sum = 10
i+1 = 5 sum = 10
i+1 = 5 sum = 15
****************************
NO

*/


#include <cstdio>
int a[30];
int n,k;
bool dfs(int i,int sum)///-------------------------------0
{
    /*if(i == 0)
        printf("i = %d sum = %d\n",i,sum);
    else
        printf("i+1 = %d sum = %d\n",i,sum);*/
    if(i==n)
        return sum==k;
    if(dfs(i+1,sum))///----------------------------------1
        return true;
    if(dfs(i+1,sum+a[i]))///-----------------------------2
        return true;
}
int main()
{
    while(~scanf("%d%d",&n,&k))
    {
        for(int i=0; i<n; i++)
            scanf("%d",&a[i]);
        if(dfs(0,0))
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}