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 gentlemen and ladies.
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
有n男m女,平均分成11组且每组男女相等
只要知道某个数的奇数位数字和与偶数位数字和之间的差能被11整除,那这个数就能被11整除这个原理的话,那么这道题就不难了
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char s1[10000],s2[10000];
int len;
int main()
{
int t,sum,i;
scanf("%d",&t);
while(t--)
{
scanf("%s%s",s1,s2);
len = strlen(s1);
sum = 0;
if(!strcmp(s1,s2))
{
for(i = 0;i<len;i++)
{
if(i%2)
sum = sum+s1[i]-'0';
else sum = sum-(s1[i]-'0');
}
if(sum%11)
printf("NO\n");
else
printf("YES\n");
}
else
printf("NO\n");
}
return 0;
}