Single Round Match

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<=101000), 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

#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main()
{
	//freopen("a.txt","r",stdin);
	int t,x;
	scanf("%d",&t);
	while(t--)
	{
		x=0;
		string n,m;
		cin>>n>>m;
		if(n!=m) printf("NO\n");
		else 
		{
			for(int i=0;i<n.size();i++)
			 x=((n[i]-'0')%11+x*10)%11;
			if(x==0) printf("YES\n");
			else printf("NO\n");
		}
	}
	return 0;
}