#include <string>
#include <vector>

void bfs(int iter, int n, int sum, int target, vector<int> number, int& answer){
    if (iter == n){
        if (sum == target){
            answer +=1;
        }
    }
    else{
        //더하는 케이스 1)
        sum += number[iter];
        bfs(iter+1, n, sum, target, number, answer);
        //원상복귀
        sum -= number[iter];

        //빼는 케이스 2)
        sum -= number[iter];
        
        bfs(iter+1, n, sum, target, number, answer);
    }
}

int solution(vector<int> numbers, int target) {
    int answer = 0;
    
    int iter = 0, n = numbers.size();
    int sum = 0;
    
    bfs(iter, n, sum, target, numbers, answer);
    
    return answer;
}