Apple Division

input/code.cpp: In function 'int main()':
input/code.cpp:52:12: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   52 |     if(n&1 == 1)
      |          ~~^~~~
input/code.cpp:58:13: warning: unused variable 'count' [-Wunused-variable]
   58 |         int count=0, sum=0;
      |             ^~~~~
input/code.cpp: In function 'void Test()':
input/code.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
input/code.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'wa...

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cmath>
#include<set>
typedef long long LL;

const int N=105;

using namespace std;


void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}

int weight[N];
int main()
{
    // Test();
    int n, m;
    scanf("%d", &n);
    m=n/2;
    for(int i=1; i<=n; i++)
    {
        scanf("%d", &weight[i]);

    }
    // 
    set<int> f;
    for(int i=0; i<(1<<m); i++)
    {
        int sum=0;
        for(int j=0; j<m; j++)
        {
            if((i>>j)&1)
                sum+=weight[j+1];
            else
                sum-=weight[j+1];
        }
        f.insert(sum);
    }

// for(auto it=f.begin(); it!=f.end(); it++)
//     printf("%d ", *it);
// printf("\n");
    int ans=0x3f3f3f3f;

    int bound = m;
    if(n&1 == 1)
        bound++;

    set<int> b;
    for(int i=0; i<bound; i++)
    {
        int count=0, sum=0;
        for(int j=0; j<bound; j++)
        {
            if((i>>j)&1)
                sum+=weight[j+m+1];
            else
                sum-=weight[j+m+1];
        }
// b.insert(sum);
        auto it = f.upper_bound(sum);
        if(it!=f.end())
            ans = min(ans, abs(sum-(*it)));
        if(it!=f.begin())
        {
            it--;
            ans = min(ans, abs(sum-(*it)));
        }
    }

// for(auto it=b.begin(); it!=b.end(); it++)
//     printf("%d ", *it);
// printf("\n");
    printf("%d", ans);

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED