1379:Frog

时间限制:2 S   /  内存限制:65536 KB
AC:84   /  Submit:98
问题描述

There are x frogs and y chicken in a garden. JG found there are n heads and m legs in the garden. Please tell JG how many frogs and chicken are there. (A frog has 4 legs, and a chicken has 2 legs.)

输入描述

First line contains an integer T (1 ≤ T ≤ 10), represents there are T test cases.
For each test case: Two number n and m.
1<=n, m <=100000. The data is legal.

输出描述

For each test case, output two numbers A and B – the number of frog and the number of chicken.

样例输入复制样例

2
2 6
2 4

样例输出

1 1
0 2

来源
2017年第八届福建省大学生程序设计竞赛正式赛A

Copyright 2016 - 2024 XUJC ACM Team
闽ICP备2020022076号-1