Submission #31683724

---

Source Code Expand

#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower



using namespace std;


int main(){
    int N,W,count = 0;
    cin >> N >> W;
    vector<int> answer(W+1);
    
    
    vector<int> weight(N);
    for(int i=0;i<N;i++)
        cin >> weight.at(i);
    
    /*一つ選ぶ場合*/
    for(int i=0;i<N;i++){
        if(weight.at(i) <= W)
            answer.at(weight.at(i))++;
    }
    
    /*二つ選ぶ場合*/
    for(int i=0;i<N-1;i++){
        for(int j=i+1;j<N;j++){
            int sum = 0;
            sum = weight.at(i) + weight.at(j);
            if(sum <= W)
                answer.at(sum)++;
        }
    }
    
    /*三つ選ぶ場合*/
    for(int i=0;i<N-2;i++){
        for(int j=i+1;j<N-1;j++){
            for(int k=j+1;k<N;k++){
                int sum = 0;
                sum = weight.at(i) + weight.at(j) + weight.at(k);
                if(sum <= W)
                    answer.at(sum)++;
            }
        }
    }
    
    for(int i=0;i<=W;i++){
        if(answer.at(i) >= 1)
            count++;
    }
    
    cout << count << endl;

    return 0;
}

Submission Info

Judge Result