5/22 div1 백업

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using iis = pair<int, string>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;
 
int main() {
    int n;
    scanf("%d", &n);
    
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &v[i]);
    }
    
    sort(all(v));
    do
    {
        int end = 0;
        int sumv = v[start];
        int count = 0;
        
        for (int start = 0; start < v.size();) {
            if (sumv == 50)
                count++;
            if (sumv > 50) {
                sumv -= v[start];
                start++;
            }
            end++;
            sumv += v[end];
        }
        
        
        
    } while(next_permutation(all(v));
    
    
    return 0;
}