NYoj 部分和问题(深搜经典)

题目链接：

http://acm.nyist.edu.cn/JudgeOnline/problem.php?pid=1058

 #include <stdio.h>
 int n, k, ok, arr[], vis[], count;  

 void DFS(int pos){
         if(count == k)
         {
                 ok = ;
                 printf("YES\n");
             for(int i = ; i < n; ++i)
                 if(vis[i])
                     printf("%d ", arr[i]);
             printf("\n");
         }  

     for(int i = pos; i < n; ++i)
     {
         count += arr[i];
         vis[i] = ;
         DFS(i + );
         count -= arr[i];
         vis[i] = ;
     }
 }  

 int main(){
     while(scanf("%d%d", &n, &k) == ){
         ok = ;
         for(int i = ; i < n; ++i){
             scanf("%d", arr[i]);
             vis[i] = ;
         }
         count = ; DFS();
         if(!ok) printf("NO\n");
     }
     return ;
 }