题库练习 Luntik and Concerts
← 上一题 下一题 →

A14658 | Luntik and Concerts

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Luntik has decided to try singing. He has $a$ one-minute songs, $b$ two-minute songs and $c$ three-minute songs. He wants to distribute all songs into two concerts such that every song should be included to exactly one concert.

He wants to make the absolute difference of durations of the concerts as small as possible. The duration of the concert is the sum of durations of all songs in that concert.

Please help Luntik and find the minimal possible difference in minutes between the concerts durations.

输入格式

The first line contains a single integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases.

Each test case consists of one line containing three integers $a, b, c$ $(1 \le a, b, c \le 10^9)$ — the number of one-minute, two-minute and three-minute songs.

输出格式

For each test case print the minimal possible difference in minutes between the concerts durations.

输入输出样例

输入 #1
4
1 1 1
2 1 3
5 5 5
1 1 2
输出 #1
0
1
0
1
C++ 编辑器
输入
输出