Question

C++帮忙解释一下题目意思

Problem 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<=10^1000), which are the amount of gentlemen and ladies. It is
worth notice that N and M are really huge. You are suggested to input the number
with string.
Output
For each test case, output “YES” if it is possible to find a
way, output “NO” if not.
Sample Input
3
1 1
11 11
22 11
Sample Output
NO
YES
NO

Answer 1

情侣拍拖会，是一个非盈利性组织。从事帮助单身的男女寻找另一半，增11月11日这天（光棍节）AMC协会邀请众多的单身来参加活动。分轮次的配对聊天，为了纪念光棍节，把人分成11组，参会人N个男生和M个女生，1对1匹配，每个组应具有相同数量的男女。
输入的第一行是一个正整数T.
T是随后的测试用例数。
每个测试案例包含两个整数N和M
（0 <=N，M <=10^ 1000），这是量的绅士和淑女。这是
值得注意的N和M是非常巨大的。建议您输入数字
字符串。

Answer 2

密密麻麻洋文！