“浪潮杯”山东省第六届ACM大学生程序设计竞赛 J-Single Round Math

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
char n[10000],m[10000];
int main(void)
{
	int T;cin>>T;
	while(T--)
	{
       cin>>n>>m;
       if(strcmp(n,m)!=0)
       	{
       		cout<<"NO"<<endl; continue;
       	}
       	int tes = (n[0]-'0')*10+(n[1]-'0');  //模拟被11整除
        for(int i=2;i<strlen(n);i++)
        {
            tes=(tes%11)*10+(n[i]-'0');
        }
        if(tes%11==0) cout<<"YES"<<endl;
        else  cout<<"NO"<<endl;
	}
}

第六届省赛

Begin  2018-05-03 18:30:00  UTC+8

End  2018-05-03 23:30:00  UTC+8

100%

Time Elapsed  05:00:00

Ended

Time Remaining  00:00:00

• Home
• Problem
• Status
• RanklistShare  

ABCDEFGHIJKL

Single Round Math

  1000 ms         65536 KiB

Submit Status My Status  Origin

Description

Association for Couples Math (ACM) is a non-profit organization which is engaged in helping single people to find his/her other half. As November 11th is “Single 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 divides 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.

Output

For each test case, output “YES” if it is possible to find a way, output “NO” if not.

Sample

Input

Copy3
1 1
11 11
22 11

Output

CopyNO
YES
NO

Source

“浪潮杯”山东省第六届ACM大学生程序设计竞赛

Submit Status My Status  Origin