代码

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

评测结果