CodeForces 15C Industiral Nim Nim游戏

给出第一个石堆的石子数x和石堆数m，石堆中石子数为首项为x 公差为1 项数为m 的等差数列，求Nim游戏结果。

即计算异或值x^(x+1)^(x+2)^...^(x+m-1)，判断是否非0。

x和m的范围是long long，无法暴力。。

发现性质：(2x)^(2x+1)=1，利用一下就好了。

如果首项为奇数或末项为偶数都要单独异或答案。

剩下的都是1啦。

#include <cstdio>
int main() {
    long long x, m, ans = 0; int i, n;
    scanf("%d", &n);
    for (i = 0; i < n; i++) {
        scanf("%I64d%I64d", &x, &m);
        long long end = x + m - 1;
        if (x & 1) m--, ans ^= x;
        ans ^= (m & 2 ? 1 : 0) ^ ((m & 1) ? end : 0);
    }
    puts(ans ? "tolik" : "bolik");
    return 0;
}

http://codeforces.com/problemset/problem/15/c

C. Industrial Nim

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

There are n stone quarries in Petrograd.

Each quarry owns m_i dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has x_i stones in it, the second dumper hasx_i + 1 stones in it, the third has x_i + 2, and the m_i-th dumper (the last for the i-th quarry) has x_i + m_i - 1 stones in it.

Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.

Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».

Input

The first line of the input contains one integer number n (1 ≤ n ≤ 10⁵) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers x_i and m_i (1 ≤ x_i, m_i ≤ 10¹⁶) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.

Output

Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.

Sample test(s)

input

2
2 1
3 2

output

tolik

input

4
1 1
1 1
1 1
1 1

output

bolik