B. Card Game

time limit per test

2 seconds

memory limit per test

256 megabytes

Suneet and Slavic play a card game. The rules of the game are as follows:

  • Each card has an integer value between 11 and 1010.
  • Each player receives 22 cards which are face-down (so a player doesn't know their cards).
  • The game is turn-based and consists exactly of two turns. In a round, both players pick a random unflipped card and flip it. The player who flipped a card with a strictly greater number wins the round. In case of equality, no one wins the round.
  • A player wins a game if he wins the most number of rounds (i.e. strictly greater than the other player). In case of equality, no one wins the game.

Since Suneet and Slavic aren't best friends, you need to calculate the number of ways the game could happen that Suneet would end up as the winner.

For a better understanding, please check the notes section.

Input

The first line contains an integer tt (1≤t≤1041≤t≤104) --- the number of test cases.

The first and only line of each test case contains 44 integers a1a1, a2a2, b1b1, b2b2 (1≤a1,a2,b1,b2≤101≤a1,a2,b1,b2≤10) where a1a1 and a2a2 represent the cards Suneet has, and b1b1 and b2b2 represent the cards Slavic has, respectively.

Output

For each test case, output a single integer --- the number of games Suneet would win considering all possible games.

Example

Input

Copy

复制代码

5

3 8 2 6

1 1 1 1

10 10 2 2

1 1 10 10

3 8 7 2

Output

Copy

复制代码
2
0
4
0
2

Note

Consider the first test case when Slavic starts with the cards that have the values 22 and 66, and Suneet starts with cards that have the values 33 and 88. The game could happen in 44 different ways:

  • Suneet flips 33 and Slavic flips 22. Suneet wins the first round. Then, Suneet flips 88 and Slavic flips 66. Suneet wins the second round as well. Since Suneet won 22 rounds, he wins the game.

  • Suneet flips 33 and Slavic flips 66. Slavic wins the first round. Then, Suneet flips 88 and Slavic flips 22. Suneet wins the second round. Nobody wins since both players won an equal amount of rounds.

  • Suneet flips 88 and Slavic flips 66. Suneet wins the first round. Then, Suneet flips 33 and Slavic flips 22. Suneet wins the second round as well. Since Suneet won 22 rounds, he wins the game.

  • Suneet flips 88 and Slavic flips 22. Suneet wins the first round. Then, Suneet flips 33 and Slavic flips 66. Slavic wins the round. Nobody wins since both players won an equal amount of rounds.

解题说明:此题是一道模拟题,要求计算出第一个人赢得所有情况,就是两场中至少一平一胜才行。可以直接比较四个数字的大小,进行组合求解。

cpp 复制代码
#include<stdio.h>

int main()
{
	int t, a1, a2, b1, b2;
	scanf("%d", &t);
	for (t; t > 0; t--)
	{
		int q = 0;
		scanf("%d %d %d %d", &a1, &a2, &b1, &b2);
		if ((a1 >= b1 && a2 > b2) || (a1 > b1 && a2 >= b2))
		{
			q++;
		}
		if ((a1 >= b2 && a2 > b1) || (a1 > b2 && a2 >= b1))
		{
			q++;
		}
		printf("%d\n", q * 2);
	}
	return 0;

}
相关推荐
NAGNIP26 分钟前
一文搞懂FlashAttention怎么提升速度的?
人工智能·算法
Codebee1 小时前
OneCode图生代码技术深度解析:从可视化设计到注解驱动实现的全链路架构
css·人工智能·算法
刘大猫261 小时前
Datax安装及基本使用
java·人工智能·算法
Gyoku Mint4 小时前
深度学习×第4卷:Pytorch实战——她第一次用张量去拟合你的轨迹
人工智能·pytorch·python·深度学习·神经网络·算法·聚类
葫三生5 小时前
如何评价《论三生原理》在科技界的地位?
人工智能·算法·机器学习·数学建模·量子计算
拓端研究室7 小时前
视频讲解:门槛效应模型Threshold Effect分析数字金融指数与消费结构数据
前端·算法
随缘而动,随遇而安9 小时前
第八十八篇 大数据中的递归算法:从俄罗斯套娃到分布式计算的奇妙之旅
大数据·数据结构·算法
IT古董10 小时前
【第二章:机器学习与神经网络概述】03.类算法理论与实践-(3)决策树分类器
神经网络·算法·机器学习
水木兰亭12 小时前
数据结构之——树及树的存储
数据结构·c++·学习·算法