void Obstacle::PutRandomBonus()

in agdk/agdktunnel/app/src/main/cpp/obstacle.cpp [21:65]
37 lines of code
15 McCabe index (conditional complexity)

void Obstacle::PutRandomBonus() {
    if (Random(100) * 0.01f > BONUS_PROBABILITY) {
        return;
    }

    bool candidate[OBS_GRID_SIZE][OBS_GRID_SIZE];
    memset(candidate, 0, sizeof(candidate));

    int r, c;
    int i, j;

    // (This is the most deeply indented code I have written in my life)
    // It goes through the grid and marks all the squares that are adjacent to
    // a solid square as candidates for the bonus.
    for (r = 0; r < OBS_GRID_SIZE; r++) {
        for (c = 0; c < OBS_GRID_SIZE; c++) {
            if (grid[c][r]) {
                for (i = r - 1; i <= r + 1; i++) {
                    for (j = c - 1; j <= c + 1; j++) {
                        if (i >= 0 && i < OBS_GRID_SIZE && j >= 0 && j < OBS_GRID_SIZE) {
                            candidate[j][i] = true;
                        }
                    }
                }
            }
        }
    }

    // now we randomly choose one of the candidates
    int r0 = Random(0, OBS_GRID_SIZE);
    int c0 = Random(0, OBS_GRID_SIZE);
    int rd, cd;
    bonusRow = bonusCol = -1;
    for (rd = 0; rd < OBS_GRID_SIZE && bonusRow < 0; rd++) {
        for (cd = 0; cd < OBS_GRID_SIZE; cd++) {
            int my_r = (r0 + rd) % OBS_GRID_SIZE;
            int my_c = (c0 + cd) % OBS_GRID_SIZE;
            if (!grid[my_c][my_r] && candidate[my_c][my_r]) {
                bonusRow = my_r;
                bonusCol = my_c;
                break;
            }
        }
    }
}