Pro.ID21640 TitleSingle Round Match Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21640 AC9 Submit18 Ratio50.00% 时间&空间限制描述Association for Couples Match (ACM) is a non-profit organization which is engaged in helping single people to find his/her other half. As November 11th is "Singles Day", on this day, ACM invites a large group of singles to the party. People round together, chatting with others, and matching partners. There are N gentlemen and M ladies in the party, each gentleman should only match with a lady and vice versa. To memorize the Singles Day, ACM decides to divide people into 11 groups, each group should have the same amount of couples and no people are left without the groups. Can ACM achieve the goal? 输入The first line of the input is a positive integer T. T is the number of test cases followed. Each test case contains two integer N and M ( 0 ≤ N, M ≤ 101000 ), which are the amount of gentleman and ladies. 输出Description Association for Couples Match (ACM) is a non-profit organization which is engaged in helping single people to find his/her other half. As November 11th is "Singles Day", on this day, ACM invites a large group of singles to the party. People round together, chatting with others, and matching partners. There are N gentlemen and M ladies in the party, each gentleman should only match with a lady and vice versa. To memorize the Singles Day, ACM decides to divide people into 11 groups, each group should have the same amount of couples and no people are left without the groups. Can ACM achieve the goal? Input The first line of the input is a positive integer T. T is the number of test cases followed. Each test case contains two integer N and M ( 0 ≤ N, M ≤ 101000 ), which are the amount of gentleman and ladies. Output For each test case, output "YES" if it is possible to find a way, output "NO" if not. Sample Input 3 Sample Output NO Source 样例输入3 样例输出NO 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-3 15:06 , Processed in 0.015915 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
