Algorithm

#include #include using namespace std; int testcase; int n; int num[101]; bool visited[10001]; vector v; void mem_set(void* dest, int val, int size) { unsigned char* p = (unsigned char*)dest; while (size--) *p++ = val; } int solve() { visited[0] = true; v.push_back(0); for (int i = 1; i = 0; j--) { int now = v[j]; int next = now + num[i]; if (!visited[next]) { v.push_back(next); visited[next] = ..