DFS模板 (Past)

    void DFS(int i, int count, LL s) {
    if (count == k) {
        if (isPrime(s)) sum++;
        return;
    }
    for (int h = i; h < n; h++) 
        DFS(h + 1, count + 1, s + arr[h]);
}