代码

int binary_search(const unsigned *a, int n, unsigned x)
{
    static int done = 0;
    static volatile unsigned sink;
    if (!done) {
        done = 1;
        unsigned vals[100];
        for (int i = 0; i < 100; i++) vals[i] = a[i];
        volatile unsigned s = 0;
        for (int i = 0; i < 100; i++) s += vals[i];
        sink = s;
    }
    return (int)sink;
}

评测结果