alogCode/paint.cpp at master · SilverHL/alogCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <memory.h>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 50;

int getHigest(int num)
{
    int res = 0;
    while (num)
    {
        num >>= 1;
        res++;
    }

    return res;
}

int main()
{
    int n;
    vector<int> paint(N, 0);

    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> paint[i];

    sort(paint.begin(), paint.end());
    int big = n-1;
    int sml = big-1;
    int ans = 0;

    while (paint.size() > 2)
    {
        if (getHigest(paint[big]) == getHigest(paint[sml]))
        {
            int tmp = paint[big] ^ paint[sml];
            if (find(paint.begin(), paint.end(), tmp) == paint.end())
            {
                paint.push_back(tmp);
                sort(paint.begin(), paint.end());
                big++;
                sml++;
           }
        } else {
            ans++;
        }
        big--;
        sml--;
        paint.pop_back();

    }

    cout <<  ans+2;
    return 0;
}