NYOJ 927 The partial sum problem 【DFS】+【剪枝】

#include <stdio.h>
#include <stdlib.h>
int n, arr[22], sum, vis[22], ok, count;
const char *sam[] = {"Sorry,I can't!\n", "Of course,I can!\n"};

int cmp(const void *a, const void *b){
	return *(int *)a - *(int *)b;
}

void DFS(int k){
	if(count == sum){
		ok = 1; return;
	}
	
	for(int i = k; i < n; ++i){
		if(i && arr[i] == arr[i-1] && !vis[i-1]) //cut
			continue;
		if(count > sum && arr[i] > 0) return; //cut
		
		count += arr[i]; vis[i] = 1;
		DFS(i + 1);
		if(ok) return;
		count -= arr[i]; vis[i] = 0;
	}
}

int main(){
	while(scanf("%d", &n) == 1){
		for(int i = 0; i < n; ++i){
			scanf("%d", arr + i);
			vis[i] = 0;
		}
		scanf("%d", &sum);
		qsort(arr, n, sizeof(int), cmp);
		count = ok = 0; DFS(0);
		printf(ok ? sam[1] : sam[0]);
	}
	return 0;
}